FoxIntermediateBackend.Mod 580 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686146871468814689146901469114692146931469414695146961469714698146991470014701147021470314704147051470614707147081470914710147111471214713147141471514716147171471814719147201472114722147231472414725147261472714728147291473014731147321473314734147351473614737147381473914740147411474214743147441474514746147471474814749147501475114752147531475414755147561475714758147591476014761147621476314764147651476614767147681476914770147711477214773147741477514776147771477814779147801478114782147831478414785147861478714788147891479014791147921479314794147951479614797147981479914800148011480214803148041480514806148071480814809148101481114812148131481414815148161481714818148191482014821148221482314824148251482614827148281482914830148311483214833148341483514836148371483814839148401484114842148431484414845148461484714848148491485014851148521485314854148551485614857148581485914860148611486214863148641486514866
  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. END;
  104. Fixup= POINTER TO RECORD
  105. pc: LONGINT;
  106. nextFixup: Fixup;
  107. END;
  108. WriteBackCall = POINTER TO RECORD
  109. call: SyntaxTree.ProcedureCallDesignator;
  110. next: WriteBackCall;
  111. END;
  112. Label= OBJECT
  113. VAR
  114. fixups: Fixup;
  115. section: IntermediateCode.Section;
  116. pc: LONGINT;
  117. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  118. BEGIN
  119. SELF.section := section; pc := -1;
  120. END InitLabel;
  121. PROCEDURE Resolve(pc: LONGINT);
  122. VAR at: LONGINT;
  123. BEGIN
  124. SELF.pc := pc;
  125. WHILE(fixups # NIL) DO
  126. at := fixups.pc;
  127. section.PatchAddress(at,pc);
  128. fixups := fixups.nextFixup;
  129. END;
  130. END Resolve;
  131. PROCEDURE AddFixup(at: LONGINT);
  132. VAR fixup: Fixup;
  133. BEGIN
  134. ASSERT(pc=-1);
  135. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  136. END AddFixup;
  137. END Label;
  138. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  139. DeclarationVisitor =OBJECT
  140. VAR
  141. backend: IntermediateBackend;
  142. implementationVisitor: ImplementationVisitor;
  143. meta: MetaDataGenerator;
  144. system: Global.System;
  145. currentScope: SyntaxTree.Scope;
  146. module: Sections.Module;
  147. moduleSelf: SyntaxTree.Variable;
  148. dump: BOOLEAN;
  149. forceModuleBody: BOOLEAN;
  150. addressType: IntermediateCode.Type;
  151. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  152. BEGIN
  153. currentScope := NIL; module := NIL; moduleSelf := NIL;
  154. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  155. SELF.dump := dump;
  156. SELF.backend := backend;
  157. SELF.forceModuleBody := forceModuleBody;
  158. addressType := IntermediateCode.GetType(system,system.addressType)
  159. END Init;
  160. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  161. BEGIN
  162. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  163. END Error;
  164. (** types **)
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. WITH x:
  168. SyntaxTree.QualifiedType DO QualifiedType(x)
  169. |SyntaxTree.MathArrayType DO meta.CheckTypeDeclaration(x)
  170. |SyntaxTree.PointerType DO meta.CheckTypeDeclaration(x) (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  171. |SyntaxTree.RecordType DO RecordType(x)
  172. |SyntaxTree.CellType DO CellType(x)
  173. ELSE
  174. END;
  175. END Type;
  176. PROCEDURE QualifiedType(x: SyntaxTree.QualifiedType);
  177. VAR type: SyntaxTree.Type;
  178. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  179. type := x.resolved;
  180. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  181. meta.CheckTypeDeclaration(type);
  182. END;
  183. END QualifiedType;
  184. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  185. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  186. BEGIN
  187. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  188. WHILE (this # NIL) & (this.identifier# id) DO
  189. this := this.nextModifier;
  190. END;
  191. RETURN this # NIL
  192. END HasFlag;
  193. PROCEDURE RecordType(x: SyntaxTree.RecordType);
  194. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  195. BEGIN (* no code emission *)
  196. meta.CheckTypeDeclaration(x);
  197. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  198. IF x.pointerType.typeDeclaration # NIL THEN
  199. td := x.pointerType.typeDeclaration
  200. ELSE
  201. td := x.typeDeclaration
  202. END;
  203. Global.GetSymbolName(td,name);
  204. (* code section for object *)
  205. END;
  206. Scope(x.recordScope);
  207. END RecordType;
  208. PROCEDURE CellType(x: SyntaxTree.CellType);
  209. VAR capabilities: SET;
  210. BEGIN
  211. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  212. capabilities := {};
  213. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  214. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  215. backend.SetCapabilities(capabilities);
  216. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  217. Scope(x.cellScope);
  218. END;
  219. END CellType;
  220. (* symbols *)
  221. PROCEDURE Variable(x: SyntaxTree.Variable);
  222. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  223. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  224. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  225. BEGIN
  226. type := type.resolved;
  227. IF type IS SyntaxTree.RecordType THEN
  228. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  229. ELSIF (type IS SyntaxTree.ArrayType) THEN
  230. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  231. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  232. END;
  233. ELSIF type IS SyntaxTree.MathArrayType THEN
  234. WITH type: SyntaxTree.MathArrayType DO
  235. IF type.form = SyntaxTree.Open THEN
  236. RETURN TRUE
  237. ELSIF type.form = SyntaxTree.Static THEN
  238. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  239. END;
  240. END;
  241. END;
  242. RETURN FALSE
  243. END TypeNeedsInitialization;
  244. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  245. VAR variable: SyntaxTree.Variable;
  246. BEGIN
  247. variable := scope.firstVariable;
  248. WHILE variable # NIL DO
  249. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  250. IF variable.initializer # NIL THEN RETURN TRUE END;
  251. variable := variable.nextVariable;
  252. END;
  253. RETURN FALSE
  254. END ScopeNeedsInitialization;
  255. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  256. VAR size: LONGINT;
  257. BEGIN
  258. size := offset - lastUpdated;
  259. IF size > 0 THEN
  260. irv.Emit(Reserve(x.position,size));
  261. END;
  262. irv.Emit(Data(x.position, op));
  263. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  264. END SingleInitialize;
  265. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  266. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  267. BEGIN
  268. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  269. WITH type:
  270. SyntaxTree.RecordType DO
  271. baseType := type.baseType;
  272. IF baseType # NIL THEN
  273. baseType := baseType.resolved;
  274. IF baseType IS SyntaxTree.PointerType THEN
  275. baseType := baseType(SyntaxTree.PointerType).pointerBase
  276. END;
  277. Initialize(baseType,NIL, offset);
  278. END;
  279. variable := type.recordScope.firstVariable;
  280. WHILE variable # NIL DO
  281. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  282. variable := variable.nextVariable
  283. END;
  284. | SyntaxTree.ArrayType DO
  285. IF type.form = SyntaxTree.Static THEN
  286. baseType := type.arrayBase;
  287. IF TypeNeedsInitialization(baseType) THEN
  288. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  289. FOR i := 0 TO type.staticLength-1 DO
  290. Initialize(baseType,NIL,offset+i*size);
  291. END;
  292. END;
  293. END;
  294. | SyntaxTree.MathArrayType DO
  295. IF type.form = SyntaxTree.Open THEN
  296. dim := DynamicDim(type);
  297. baseType := SemanticChecker.ArrayBase(type,dim);
  298. imm := IntermediateCode.Immediate(addressType,dim);
  299. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  300. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  301. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  302. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  303. (* flags remain empty (=0) for open array *)
  304. ELSIF type.form = SyntaxTree.Static THEN
  305. baseType := type.arrayBase;
  306. IF TypeNeedsInitialization(baseType) THEN
  307. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  308. ASSERT(type.staticLength < 1024*1024*1024);
  309. FOR i := 0 TO type.staticLength-1 DO
  310. Initialize(baseType,NIL,offset+i*size);
  311. END;
  312. END;
  313. END;
  314. ELSE
  315. IF initializer # NIL THEN
  316. implementationVisitor.Evaluate(initializer, op);
  317. SingleInitialize(op.op, offset);
  318. END;
  319. END;
  320. END Initialize;
  321. BEGIN
  322. IF x.externalName # NIL THEN RETURN END;
  323. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  324. (* code section for variable *)
  325. Global.GetSymbolSegmentedName(x,name);
  326. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  327. irv.SetExported(IsExported(x));
  328. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  329. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  330. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  331. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  332. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  333. FOR i := 0 TO DynamicDim(x.type)-1 DO
  334. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  335. END;
  336. ELSE
  337. lastUpdated:= 0;
  338. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  339. Initialize(x.type, x.initializer, 0);
  340. END;
  341. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  342. IF size > 0 THEN
  343. irv.Emit(Reserve(x.position,size));
  344. END;
  345. IF ~x.fixed THEN
  346. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  347. ELSE
  348. align := x.alignment;
  349. END;
  350. irv.SetPositionOrAlignment(x.fixed, align);
  351. meta.CheckTypeDeclaration(x.type);
  352. END;
  353. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  354. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  355. END;
  356. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  357. END Variable;
  358. PROCEDURE Parameter(x: SyntaxTree.Parameter);
  359. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  360. size: LONGINT; lastUpdated: LONGINT;
  361. BEGIN
  362. ASSERT(currentScope IS SyntaxTree.CellScope);
  363. Global.GetSymbolSegmentedName(x,name);
  364. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  365. irv.SetExported(IsExported(x));
  366. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  367. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  368. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  369. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  370. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  371. FOR i := 0 TO DynamicDim(x.type)-1 DO
  372. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  373. END;
  374. ELSE
  375. lastUpdated:= 0;
  376. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  377. IF size > 0 THEN
  378. irv.Emit(Reserve(x.position,size));
  379. END;
  380. IF ~x.fixed THEN
  381. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  382. ELSE
  383. align := x.alignment;
  384. END;
  385. irv.SetPositionOrAlignment(x.fixed, align);
  386. meta.CheckTypeDeclaration(x.type);
  387. END;
  388. END Parameter;
  389. PROCEDURE TypeDeclaration(x: SyntaxTree.TypeDeclaration);
  390. BEGIN
  391. Type(x.declaredType); (* => code in objects *)
  392. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  393. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  394. END;
  395. END TypeDeclaration;
  396. PROCEDURE Constant(x: SyntaxTree.Constant);
  397. BEGIN
  398. IF (SyntaxTree.Public * x.access # {}) THEN
  399. implementationVisitor.VisitConstant(x);
  400. END;
  401. END Constant;
  402. PROCEDURE Scope(x: SyntaxTree.Scope);
  403. VAR procedure: SyntaxTree.Procedure;
  404. constant: SyntaxTree.Constant;
  405. variable: SyntaxTree.Variable;
  406. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  407. cell: SyntaxTree.CellType;
  408. parameter: SyntaxTree.Parameter;
  409. property: SyntaxTree.Property;
  410. BEGIN
  411. prevScope := currentScope;
  412. currentScope := x;
  413. (* constants treated in implementation visitor *)
  414. WITH x: SyntaxTree.CellScope DO
  415. cell := x.ownerCell;
  416. parameter := cell.firstParameter;
  417. WHILE parameter # NIL DO
  418. Parameter(parameter);
  419. parameter := parameter.nextParameter;
  420. END;
  421. property := cell.firstProperty;
  422. WHILE property # NIL DO
  423. Variable(property);
  424. property := property.nextProperty;
  425. END;
  426. ELSE
  427. END;
  428. typeDeclaration := x.firstTypeDeclaration;
  429. WHILE typeDeclaration # NIL DO
  430. TypeDeclaration(typeDeclaration);
  431. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  432. END;
  433. variable := x.firstVariable;
  434. WHILE variable # NIL DO
  435. Variable(variable);
  436. variable := variable.nextVariable;
  437. END;
  438. procedure := x.firstProcedure;
  439. WHILE procedure # NIL DO
  440. Procedure(procedure);
  441. procedure := procedure.nextProcedure;
  442. END;
  443. constant := x.firstConstant;
  444. WHILE constant # NIL DO
  445. Constant(constant);
  446. constant := constant.nextConstant;
  447. END;
  448. currentScope := prevScope;
  449. END Scope;
  450. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  451. VAR parameter: SyntaxTree.Parameter;
  452. BEGIN
  453. parameter := first;
  454. WHILE parameter # NIL DO
  455. Parameter(parameter);
  456. parameter := parameter.nextParameter;
  457. END;
  458. END Parameters;
  459. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  460. VAR scope: SyntaxTree.ProcedureScope;
  461. prevScope: SyntaxTree.Scope;
  462. inline, finalizer: BOOLEAN;
  463. procedureType: SyntaxTree.ProcedureType;
  464. pc: LONGINT;
  465. memorySize: Basic.Integer; stackSize: LONGINT;
  466. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  467. null,size,src,dest,fp,res: IntermediateCode.Operand;
  468. callingConvention: LONGINT;
  469. cellType: SyntaxTree.CellType;
  470. register: WORD;
  471. registerClass: IntermediateCode.RegisterClass;
  472. type: IntermediateCode.Type;
  473. formalParameter: SyntaxTree.Parameter;
  474. recordType: SyntaxTree.RecordType;
  475. isModuleBody: BOOLEAN;
  476. parametersSize: LONGINT;
  477. position: LONGINT;
  478. variable: SyntaxTree.Variable;
  479. nonParameterRegisters: WORD;
  480. PROCEDURE Signature;
  481. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  482. BEGIN
  483. procedureType := x.type(SyntaxTree.ProcedureType);
  484. returnType := procedureType.returnType;
  485. IF returnType # NIL THEN
  486. meta.CheckTypeDeclaration(returnType)
  487. END;
  488. parameter := procedureType.firstParameter;
  489. WHILE parameter # NIL DO
  490. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  491. parameter := parameter.nextParameter;
  492. END;
  493. END Signature;
  494. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  495. VAR result: BOOLEAN;
  496. BEGIN
  497. result := FALSE;
  498. IF x = SyntaxTree.invalidExpression THEN
  499. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  500. result := TRUE;
  501. value := x.resolved(SyntaxTree.IntegerValue).value;
  502. ELSE
  503. Error(x.position,"expression is not an integer constant");
  504. END;
  505. RETURN result;
  506. END CheckIntegerValue;
  507. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  508. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  509. BEGIN
  510. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  511. WHILE (this # NIL) & (this.identifier # id) DO
  512. this := this.nextModifier;
  513. END;
  514. IF this # NIL THEN
  515. IF this.expression = NIL THEN
  516. Error(this.position,"expected expression value");
  517. ELSIF CheckIntegerValue(this.expression,value) THEN
  518. END;
  519. RETURN TRUE
  520. ELSE RETURN FALSE
  521. END;
  522. END HasValue;
  523. CONST DefaultDataMemorySize=512;
  524. BEGIN
  525. IF x.externalName # NIL THEN RETURN END;
  526. (*
  527. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  528. *)
  529. (* code section for this procedure *)
  530. position := x.position.start;
  531. scope := x.procedureScope;
  532. prevScope := currentScope;
  533. currentScope := scope;
  534. procedureType := x.type(SyntaxTree.ProcedureType);
  535. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  536. implementationVisitor.temporaries.Clear;
  537. implementationVisitor.usedRegisters := NIL;
  538. implementationVisitor.registerUsageCount.Init;
  539. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  540. IF (scope.body # NIL) & (x.isInline) THEN
  541. inline := TRUE;
  542. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  543. ir.SetExported(IsExported(x));
  544. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  545. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  546. IF backend.cellsAreObjects THEN
  547. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  548. ir.SetExported(IsExported(x));
  549. ELSE
  550. RETURN; (* cellnet cannot be compiled for final static hardware *)
  551. END;
  552. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  553. inline := FALSE;
  554. AddBodyCallStub(x);
  555. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  556. ir.SetExported(IsExported(x));
  557. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  558. inline := FALSE;
  559. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  560. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  561. AddBodyCallStub(x);
  562. AddStackAllocation(x,memorySize);
  563. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  564. ir.SetExported(IsExported(x));
  565. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  566. inline := FALSE;
  567. Parameters(procedureType.firstParameter);
  568. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  569. ir.SetExported(IsExported(x));
  570. ELSE
  571. inline := FALSE;
  572. IF x.isEntry OR x.isExit THEN
  573. IF x.isEntry THEN
  574. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  575. ELSE
  576. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  577. END;
  578. ir.SetExported(TRUE);
  579. ELSE
  580. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  581. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  582. END;
  583. END;
  584. callingConvention := procedureType.callingConvention;
  585. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  586. parametersSize := ProcedureParametersSize(backend.system,x);
  587. ELSE
  588. parametersSize := 0;
  589. END;
  590. IF scope.body # NIL THEN
  591. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  592. IF ~inline THEN
  593. IF scope.lastVariable = NIL THEN
  594. stackSize := 0
  595. ELSE
  596. stackSize := scope.lastVariable.offsetInBits;
  597. IF stackSize <0 THEN stackSize := -stackSize END;
  598. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  599. END;
  600. (*
  601. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  602. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  603. *)
  604. (*
  605. ir.Emit(Nop(position)); (* placeholder for fill *)
  606. *)
  607. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  608. backend.ResetParameterRegisters();
  609. (* assumption: registers are passed left to right and left parameters are in registers *)
  610. formalParameter := procedureType.firstParameter;
  611. WHILE (formalParameter # NIL) DO
  612. IF PassInRegister(formalParameter, callingConvention) THEN
  613. IF formalParameter.type.IsRecordType() THEN
  614. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  615. type := addressType;
  616. ELSE
  617. type := GetType(system, formalParameter.type);
  618. END;
  619. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  620. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  621. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  622. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  623. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  624. implementationVisitor.ReleaseIntermediateOperand(src);
  625. END;
  626. END;
  627. formalParameter := formalParameter.nextParameter;
  628. END;
  629. END;
  630. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  631. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  632. END;
  633. pc := ir.pc-1;
  634. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  635. backend.ResetParameterRegisters();
  636. nonParameterRegisters := 0;
  637. (* assumption: registers are passed left to right and left parameters are in registers *)
  638. formalParameter := procedureType.firstParameter;
  639. WHILE (formalParameter # NIL) DO
  640. IF PassInRegister(formalParameter, callingConvention) THEN
  641. IF formalParameter.type.IsRecordType() THEN
  642. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  643. type := addressType;
  644. ELSE
  645. type := GetType(system, formalParameter.type);
  646. END;
  647. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  648. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  649. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  650. implementationVisitor.currentScope := currentScope;
  651. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  652. formalParameter.SetOffset(variable.offsetInBits);
  653. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  654. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  655. implementationVisitor.ReleaseIntermediateOperand(src);
  656. ELSE
  657. INC(nonParameterRegisters);
  658. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  659. END;
  660. END;
  661. formalParameter := formalParameter.nextParameter;
  662. END;
  663. END;
  664. END;
  665. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  666. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  667. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  668. IF scope.lastVariable # NIL THEN
  669. stackSize := scope.lastVariable.offsetInBits;
  670. IF stackSize <0 THEN stackSize := -stackSize END;
  671. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  672. END;
  673. END;
  674. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  675. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  676. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  677. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  678. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  679. ir.EmitAt(pc,Push(size));
  680. implementationVisitor.StaticCallOperand(result,procedure);
  681. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  682. END;
  683. *)
  684. END;
  685. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  686. IF stackSize > 0 THEN
  687. IF (stackSize MOD system.addressSize = 0) THEN
  688. null := IntermediateCode.Immediate(addressType,0);
  689. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  690. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  691. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  692. ELSE
  693. null := IntermediateCode.Immediate(int8,0);
  694. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  695. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  696. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  697. END;
  698. (*! should potentially be called by backend -- enter might initialize
  699. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  700. *)
  701. END;
  702. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  703. parametersSize := ProcedureParametersSize(backend.system,x);
  704. ELSE
  705. parametersSize := 0;
  706. END;
  707. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  708. finalizer := FALSE;
  709. IF backend.cooperative & x.isFinalizer THEN
  710. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  711. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  712. GetRecordTypeName(recordType,name);
  713. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  714. END;
  715. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  716. IF backend.cooperative THEN
  717. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  718. IF implementationVisitor.profile & ~isModuleBody THEN
  719. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  720. END;
  721. ELSE
  722. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  723. END;
  724. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  725. IF finalizer THEN
  726. IF backend.hasLinkRegister THEN
  727. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  728. END;
  729. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  730. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  731. ir.Emit(Br(x.position,dest));
  732. ELSE
  733. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  734. END;
  735. ELSE
  736. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  737. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  738. END;
  739. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  740. IF backend.cooperative THEN
  741. IF HasPointers (scope) THEN
  742. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  743. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  744. ir.Emit(Result(x.position, res));
  745. ir.Emit(Push(x.position, res));
  746. implementationVisitor.ResetVariables(scope);
  747. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  748. ir.Emit(Pop(x.position, res));
  749. ir.Emit(Return(x.position, res));
  750. ELSE
  751. implementationVisitor.ResetVariables(scope);
  752. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  753. END;
  754. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  755. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  756. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  757. ir.Emit(Result(x.position, res));
  758. ir.Emit(Push(x.position, res));
  759. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  760. ir.Emit(Pop(x.position, res));
  761. ir.Emit(Return(x.position, res));
  762. ELSE
  763. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  764. END;
  765. END;
  766. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  767. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  768. ELSE
  769. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  770. ir.Emit(Nop(x.position));
  771. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  772. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  774. END;
  775. END;
  776. END
  777. END;
  778. ELSE (* force body for procedures *)
  779. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  780. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  781. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  782. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  783. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  784. END;
  785. Scope(scope);
  786. Signature;
  787. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  788. currentScope := prevScope;
  789. END Procedure;
  790. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  791. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  792. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  793. BEGIN
  794. ASSERT (bodyProcedure # NIL);
  795. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  796. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  797. procedure.SetScope(bodyProcedure.scope);
  798. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  799. procedure.SetAccess(SyntaxTree.Hidden);
  800. Global.GetSymbolSegmentedName (procedure,name);
  801. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  802. ir.SetExported(TRUE);
  803. Global.GetSymbolSegmentedName (bodyProcedure,name);
  804. IF ~meta.simple THEN
  805. implementationVisitor.currentScope := module.module.moduleScope;
  806. implementationVisitor.section := ir;
  807. implementationVisitor.PushSelfPointer();
  808. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  809. ELSIF backend.preregisterStatic THEN
  810. implementationVisitor.currentScope := module.module.moduleScope;
  811. implementationVisitor.section := ir;
  812. implementationVisitor.PushSelfPointer();
  813. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  814. ELSE
  815. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  816. ir.Emit(Call(bodyProcedure.position,op, 0));
  817. END;
  818. END AddBodyCallStub;
  819. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  820. VAR name: Basic.SegmentedName;
  821. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  822. BEGIN
  823. Global.GetSymbolSegmentedName (symbol,name);
  824. Basic.RemoveSuffix(name);
  825. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  826. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  827. ir.SetExported(TRUE);
  828. IntermediateCode.InitImmediate(op,addressType,initStack);
  829. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  830. END AddStackAllocation;
  831. (** entry function to visit a complete module *)
  832. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  833. VAR
  834. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  835. hasDynamicOperatorDeclarations: BOOLEAN;
  836. operator: SyntaxTree.Operator;
  837. import: SyntaxTree.Import;
  838. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  839. BEGIN
  840. type := type.resolved;
  841. IF type IS SyntaxTree.RecordType THEN
  842. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  843. ELSIF (type IS SyntaxTree.ArrayType) THEN
  844. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  845. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  846. END;
  847. ELSIF type IS SyntaxTree.MathArrayType THEN
  848. WITH type: SyntaxTree.MathArrayType DO
  849. IF type.form = SyntaxTree.Open THEN
  850. RETURN TRUE
  851. ELSIF type.form = SyntaxTree.Static THEN
  852. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  853. END;
  854. END;
  855. END;
  856. RETURN FALSE
  857. END TypeNeedsInitialization;
  858. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  859. VAR variable: SyntaxTree.Variable;
  860. BEGIN
  861. variable := scope.firstVariable;
  862. WHILE variable # NIL DO
  863. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  864. IF variable.initializer # NIL THEN RETURN TRUE END;
  865. variable := variable.nextVariable;
  866. END;
  867. RETURN FALSE
  868. END ScopeNeedsInitialization;
  869. BEGIN
  870. ASSERT(x # NIL); ASSERT(module # NIL);
  871. SELF.module := module;
  872. (* add import names to the generated Sections.Module *)
  873. import := x.moduleScope.firstImport;
  874. WHILE import # NIL DO
  875. import.module.GetName(idstr);
  876. module.imports.AddName(idstr);
  877. import := import.nextImport
  878. END;
  879. implementationVisitor.module := module;
  880. implementationVisitor.moduleScope := x.moduleScope;
  881. implementationVisitor.moduleSelf := moduleSelf;
  882. implementationVisitor.canBeLoaded := TRUE;
  883. meta.SetModule(module);
  884. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  885. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  886. END;
  887. IF backend.profile THEN
  888. EnsureBodyProcedure(x.moduleScope);
  889. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  890. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  891. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  892. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  893. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  894. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  895. Global.GetModuleName(module.module,idstr);
  896. implementationVisitor.ProfilerAddModule(idstr);
  897. implementationVisitor.numberProcedures := 0;
  898. END;
  899. implementationVisitor.profile := backend.profile;
  900. (* check if there is at least one dynamic operator locally defined *)
  901. hasDynamicOperatorDeclarations := FALSE;
  902. operator := x.moduleScope.firstOperator;
  903. WHILE operator # NIL DO
  904. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  905. operator := operator.nextOperator
  906. END;
  907. (* add operator initialization code section *)
  908. IF hasDynamicOperatorDeclarations THEN
  909. EnsureBodyProcedure(x.moduleScope);
  910. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  911. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  912. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  913. END;
  914. Scope(x.moduleScope);
  915. IF hasDynamicOperatorDeclarations THEN
  916. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  917. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  918. END;
  919. IF backend.profile THEN
  920. implementationVisitor.ProfilerPatchInit;
  921. END;
  922. END Module;
  923. END DeclarationVisitor;
  924. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  925. RegisterUsageCount*=OBJECT
  926. VAR used: UsedArray; count: LONGINT;
  927. PROCEDURE &Init;
  928. VAR i: LONGINT;
  929. BEGIN
  930. count := 0;
  931. IF used = NIL THEN NEW(used,64); END;
  932. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  933. END Init;
  934. PROCEDURE Grow;
  935. VAR new: UsedArray; size,i: LONGINT;
  936. BEGIN
  937. size := LEN(used)*2;
  938. NEW(new,size);
  939. FOR i := 0 TO LEN(used)-1 DO
  940. new[i].count := used[i].count;
  941. new[i].type := used[i].type;
  942. new[i].map := used[i].map
  943. END;
  944. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  945. used := new
  946. END Grow;
  947. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  948. BEGIN
  949. INC(count);
  950. IF count = LEN(used) THEN Grow END;
  951. used[count].type := type;
  952. used[count].class := class;
  953. used[count].map := count;
  954. RETURN count;
  955. END Next;
  956. PROCEDURE IncUse(register: LONGINT);
  957. BEGIN
  958. INC(used[register].count);
  959. (*
  960. IF (register = 1) & (count > 30) THEN
  961. D.TraceBack;
  962. END;
  963. *)
  964. END IncUse;
  965. PROCEDURE DecUse(register: LONGINT);
  966. BEGIN
  967. DEC(used[register].count);
  968. END DecUse;
  969. PROCEDURE Map(register: LONGINT): LONGINT;
  970. VAR map : LONGINT;
  971. BEGIN
  972. IF register > 0 THEN
  973. map := used[register].map;
  974. WHILE register # map DO register := map; map := used[register].map END;
  975. END;
  976. RETURN register
  977. END Map;
  978. PROCEDURE Use(register: LONGINT): LONGINT;
  979. BEGIN
  980. IF register< LEN(used) THEN
  981. RETURN used[register].count
  982. ELSE
  983. RETURN 0
  984. END
  985. END Use;
  986. END RegisterUsageCount;
  987. RegisterEntry = POINTER TO RECORD
  988. prev,next: RegisterEntry;
  989. register: LONGINT;
  990. registerClass: IntermediateCode.RegisterClass;
  991. type: IntermediateCode.Type;
  992. END;
  993. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  994. Variables = OBJECT (Basic.List)
  995. VAR
  996. inUse: VariableUse;
  997. registerIndex: LONGINT;
  998. nameIndex: LONGINT;
  999. PROCEDURE & Init;
  1000. VAR i: LONGINT;
  1001. BEGIN
  1002. InitList(16);
  1003. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1004. registerIndex := 1024;
  1005. nameIndex := 0;
  1006. END Init;
  1007. PROCEDURE Clear*;
  1008. VAR i: LONGINT;
  1009. BEGIN
  1010. Clear^;
  1011. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1012. registerIndex := 1024;
  1013. nameIndex := 0;
  1014. END Clear;
  1015. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1016. VAR string: SyntaxTree.IdentifierString ;
  1017. BEGIN
  1018. COPY("@hiddenIRVar",string);
  1019. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1020. RETURN SyntaxTree.NewIdentifier(string);
  1021. END GetUID;
  1022. PROCEDURE GetUsage(VAR use: VariableUse);
  1023. BEGIN
  1024. use := inUse;
  1025. END GetUsage;
  1026. PROCEDURE SetUsage(CONST use: VariableUse);
  1027. BEGIN
  1028. inUse := use;
  1029. END SetUsage;
  1030. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1031. VAR any: ANY;
  1032. BEGIN
  1033. any := Get(i);
  1034. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1035. END GetVariable;
  1036. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1037. BEGIN
  1038. Set(pos, v);
  1039. END SetVariable;
  1040. PROCEDURE Occupy(pos: LONGINT);
  1041. BEGIN
  1042. INCL(inUse[pos DIV 32], pos MOD 32);
  1043. END Occupy;
  1044. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1045. BEGIN
  1046. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1047. END Occupied;
  1048. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1049. BEGIN
  1050. Occupy(Length());
  1051. Add(v);
  1052. END AddVariable;
  1053. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1054. BEGIN
  1055. t1 := t1.resolved;
  1056. t2 := t2.resolved;
  1057. (*RETURN t1.SameType(t2); *)
  1058. RETURN
  1059. (t1.SameType(t2))
  1060. OR
  1061. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1062. OR
  1063. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1064. OR
  1065. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1066. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1067. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1068. OR
  1069. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1070. (DynamicDim(t1) = DynamicDim(t2))
  1071. );
  1072. END CompatibleType;
  1073. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1074. VAR var : SyntaxTree.Variable; i: LONGINT;
  1075. BEGIN
  1076. pos := Length();
  1077. FOR i := 0 TO pos-1 DO
  1078. IF ~(Occupied(i)) THEN
  1079. var := GetVariable(i);
  1080. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1081. pos := i;
  1082. Occupy(i);
  1083. RETURN var;
  1084. END;
  1085. END;
  1086. END;
  1087. RETURN NIL
  1088. END GetFreeVariable;
  1089. END Variables;
  1090. SymbolMap = POINTER TO RECORD
  1091. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1092. isAddress: BOOLEAN;
  1093. END;
  1094. SymbolMapper = OBJECT
  1095. VAR
  1096. first: SymbolMap;
  1097. PROCEDURE & Init;
  1098. BEGIN
  1099. first := NIL;
  1100. END Init;
  1101. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1102. VAR new: SymbolMap;
  1103. BEGIN
  1104. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1105. new.next := first; first := new;
  1106. END Add;
  1107. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1108. VAR s: SymbolMap;
  1109. BEGIN
  1110. s := first;
  1111. WHILE (s # NIL) & (s.this # this) DO
  1112. s := s.next
  1113. END;
  1114. RETURN s
  1115. END Get;
  1116. END SymbolMapper;
  1117. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1118. VAR
  1119. system: Global.System;
  1120. section: IntermediateCode.Section;
  1121. module: Sections.Module;
  1122. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1123. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1124. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1125. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1126. checker: SemanticChecker.Checker;
  1127. backend: IntermediateBackend;
  1128. meta: MetaDataGenerator;
  1129. position: Position;
  1130. moduleSelf: SyntaxTree.Variable;
  1131. (* variables for hand over of variables / temporary state *)
  1132. currentScope: SyntaxTree.Scope;
  1133. constantDeclaration : SyntaxTree.Symbol;
  1134. result: Operand; (* result of the most recent expression / statement *)
  1135. destination: IntermediateCode.Operand;
  1136. arrayDestinationTag: IntermediateCode.Operand;
  1137. arrayDestinationDimension:LONGINT;
  1138. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1139. conditional: BOOLEAN;
  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. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1177. BEGIN
  1178. SELF.system := system;
  1179. SELF.builtinsModuleName := runtime;
  1180. currentScope := NIL;
  1181. hiddenPointerType := NIL;
  1182. delegatePointerType := NIL;
  1183. awaitProcCounter := 0;
  1184. labelId := 0; constId := 0; labelId := 0;
  1185. SELF.checker := checker;
  1186. SELF.backend := backend;
  1187. position := Basic.invalidPosition;
  1188. conditional := FALSE;
  1189. locked := FALSE;
  1190. InitOperand(result,ModeUndefined);
  1191. addressType := IntermediateCode.GetType(system,system.addressType);
  1192. setType := IntermediateCode.GetType(system,system.setType);
  1193. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1194. lenType := IntermediateCode.GetType(system, system.lenType);
  1195. byteType := IntermediateCode.GetType(system, system.byteType);
  1196. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1197. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1198. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1199. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1200. nil := IntermediateCode.Immediate(addressType,0);
  1201. one := IntermediateCode.Immediate(addressType,1);
  1202. IntermediateCode.InitOperand(destination);
  1203. tagsAvailable := TRUE;
  1204. supportedInstruction := supportedInstructionProcedure;
  1205. supportedImmediate := supportedImmediateProcedure;
  1206. inData := FALSE;
  1207. SELF.emitLabels := emitLabels;
  1208. IntermediateCode.InitOperand(arrayDestinationTag);
  1209. bool := IntermediateCode.GetType(system,system.booleanType);
  1210. IntermediateCode.InitImmediate(false,bool,0);
  1211. IntermediateCode.InitImmediate(true,bool,1);
  1212. indexCounter := 0;
  1213. NEW(registerUsageCount);
  1214. usedRegisters := NIL;
  1215. procedureResultDesignator := NIL;
  1216. NEW(fingerPrinter);
  1217. NEW(temporaries);
  1218. currentIsInline := FALSE;
  1219. NeedDescriptor := FALSE;
  1220. isUnchecked := backend.noRuntimeChecks;
  1221. END Init;
  1222. TYPE Context = RECORD
  1223. section: IntermediateCode.Section;
  1224. registerUsageCount: RegisterUsageCount;
  1225. usedRegisters: RegisterEntry;
  1226. temporaries: Variables;
  1227. END;
  1228. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1229. VAR context: Context;
  1230. BEGIN
  1231. context.section := section;
  1232. context.registerUsageCount := registerUsageCount;
  1233. context.usedRegisters := usedRegisters;
  1234. context.temporaries := temporaries;
  1235. section := new;
  1236. NEW(registerUsageCount);
  1237. NEW(temporaries);
  1238. usedRegisters := NIL;
  1239. RETURN context;
  1240. END SwitchContext;
  1241. PROCEDURE ReturnToContext(context: Context);
  1242. BEGIN
  1243. section := context.section;
  1244. registerUsageCount := context.registerUsageCount;
  1245. usedRegisters := context.usedRegisters;
  1246. temporaries := context.temporaries;
  1247. END ReturnToContext;
  1248. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1249. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1250. BEGIN
  1251. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1252. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1253. END;
  1254. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1255. section.SetExported(IsExported(syntaxTreeSymbol));
  1256. RETURN section
  1257. END NewSection;
  1258. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1259. VAR new: LONGINT;
  1260. BEGIN
  1261. new := registerUsageCount.Next(type,class);
  1262. UseRegister(new);
  1263. RETURN new
  1264. END AcquireRegister;
  1265. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1266. VAR
  1267. fingerPrint: SyntaxTree.FingerPrint;
  1268. fingerPrintString: ARRAY 32 OF CHAR;
  1269. BEGIN
  1270. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1271. string := "[";
  1272. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1273. Strings.Append(string, fingerPrintString);
  1274. Strings.Append(string, "]");
  1275. END GetFingerprintString;
  1276. (** get the name for the code section that represens a certain symbol
  1277. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1278. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1279. VAR string: ARRAY 32 OF CHAR;
  1280. BEGIN
  1281. Global.GetSymbolSegmentedName(symbol, name);
  1282. (* if the symbol is an operator, then append the fingerprint to the name *)
  1283. IF symbol IS SyntaxTree.Operator THEN
  1284. GetFingerprintString(symbol, string);
  1285. Basic.AppendToSegmentedName(name,string);
  1286. END
  1287. END GetCodeSectionNameForSymbol;
  1288. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1289. BEGIN
  1290. IF dump # NIL THEN
  1291. dump.String("enter "); dump.String(s); dump.Ln;
  1292. END;
  1293. END TraceEnter;
  1294. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1295. BEGIN
  1296. IF dump # NIL THEN
  1297. dump.String("exit "); dump.String(s); dump.Ln;
  1298. END;
  1299. END TraceExit;
  1300. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1301. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1302. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1303. VAR i: LONGINT;
  1304. BEGIN
  1305. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1306. IF op.rule # NIL THEN
  1307. FOR i := 0 TO LEN(op.rule)-1 DO
  1308. CheckRegister(op.rule[i])
  1309. END;
  1310. END;
  1311. END CheckRegister;
  1312. BEGIN
  1313. CheckRegister(instruction.op1);
  1314. CheckRegister(instruction.op2);
  1315. CheckRegister(instruction.op3);
  1316. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1317. ELSE section.Emit(instruction);
  1318. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1319. END;
  1320. END Emit;
  1321. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1322. VAR saved: RegisterEntry;
  1323. BEGIN
  1324. IF backend.cooperative THEN
  1325. ReleaseUsedRegisters(saved);
  1326. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1327. CallThis(position,"Runtime","Trap",1);
  1328. RestoreRegisterUse(saved);
  1329. ELSE
  1330. Emit(Trap(position,trapNo));
  1331. END;
  1332. END EmitTrap;
  1333. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1334. VAR name: Basic.SegmentedName;
  1335. VAR op1, op2, reg: IntermediateCode.Operand;
  1336. VAR call, nocall: Label;
  1337. VAR parametersSize: LONGINT;
  1338. VAR prevSection: IntermediateCode.Section;
  1339. VAR prevDump: Streams.Writer;
  1340. VAR body: SyntaxTree.Body;
  1341. VAR procedureType: SyntaxTree.ProcedureType;
  1342. BEGIN
  1343. IF procedure # NIL THEN
  1344. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1345. ELSE procedureType := NIL;
  1346. END;
  1347. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1348. prevSection := SELF.section;
  1349. SELF.section := section;
  1350. prevDump := dump;
  1351. dump := section.comments;
  1352. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1353. IF backend.hasLinkRegister THEN
  1354. Emit(Push(Basic.invalidPosition, lr));
  1355. END;
  1356. Emit(Push(Basic.invalidPosition,fp));
  1357. IF procedure # NIL THEN
  1358. body := procedure.procedureScope.body;
  1359. ELSE
  1360. body := NIL;
  1361. END;
  1362. IF backend.cooperative THEN
  1363. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1364. GetCodeSectionNameForSymbol(procedure, name);
  1365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1366. ELSE
  1367. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1368. END;
  1369. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1370. IntermediateCode.AddOffset(op1, 1);
  1371. Emit(Push(Basic.invalidPosition,op1));
  1372. Emit(Mov(Basic.invalidPosition,fp, sp));
  1373. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1374. NEW(call, section);
  1375. NEW(nocall, section);
  1376. reg := NewRegisterOperand(addressType);
  1377. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1378. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1379. BrltL(call, sp, reg);
  1380. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1381. BrgeL(nocall, sp, op2);
  1382. call.Resolve(section.pc);
  1383. Emit(Push(Basic.invalidPosition, reg));
  1384. ReleaseIntermediateOperand(reg);
  1385. parametersSize := ProcParametersSize(procedure);
  1386. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1387. Emit(Push(Basic.invalidPosition, op2));
  1388. CallThis(position, "Activities","ExpandStack",2);
  1389. Emit(Result(Basic.invalidPosition, sp));
  1390. nocall.Resolve(section.pc);
  1391. END;
  1392. ELSE
  1393. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1394. Emit(Push(Basic.invalidPosition, one)) ;
  1395. procedureType.SetParametersOffset(1);
  1396. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1397. END;
  1398. Emit(Mov(Basic.invalidPosition, fp, sp));
  1399. END;
  1400. END;
  1401. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1402. SELF.section := prevSection;
  1403. dump := prevDump;
  1404. END EmitEnter;
  1405. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1406. VAR op1,op2: IntermediateCode.Operand;
  1407. VAR instruction: IntermediateCode.Instruction;
  1408. BEGIN
  1409. IntermediateCode.InitNumber(op1,callconv);
  1410. IntermediateCode.InitNumber(op2,varSize);
  1411. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1412. RETURN instruction
  1413. END Enter;
  1414. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1415. VAR op1: IntermediateCode.Operand;
  1416. VAR instruction: IntermediateCode.Instruction;
  1417. BEGIN
  1418. IntermediateCode.InitNumber(op1,callconv);
  1419. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1420. RETURN instruction
  1421. END Leave;
  1422. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1423. VAR prevSection: IntermediateCode.Section;
  1424. VAR op2: IntermediateCode.Operand;
  1425. VAR body: SyntaxTree.Body;
  1426. BEGIN
  1427. prevSection := SELF.section;
  1428. SELF.section := section;
  1429. Emit(Leave(position, callconv));
  1430. IF procedure # NIL THEN
  1431. body := procedure.procedureScope.body;
  1432. ELSE
  1433. body := NIL;
  1434. END;
  1435. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1436. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1437. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1438. Emit(Add(position, sp, fp, op2));
  1439. ELSE
  1440. Emit(Mov(position, sp, fp));
  1441. END;
  1442. Emit(Pop(position, fp));
  1443. END;
  1444. SELF.section := prevSection;
  1445. END EmitLeave;
  1446. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1447. VAR m: SymbolMap;
  1448. BEGIN
  1449. position := x.position;
  1450. IF currentIsInline THEN
  1451. m := currentMapper.Get(x);
  1452. IF m # NIL THEN
  1453. (*
  1454. Printout.Info("mapping from", x);
  1455. Printout.Info("mapping to ", m.to);
  1456. *)
  1457. VExpression(m.to);
  1458. op := result;
  1459. IF m.tag # NIL THEN
  1460. ReleaseIntermediateOperand(result.tag);
  1461. VExpression(m.tag);
  1462. op.tag := result.op;
  1463. ReleaseIntermediateOperand(result.tag);
  1464. END;
  1465. RETURN
  1466. END;
  1467. END;
  1468. VSymbol(x);
  1469. op := result;
  1470. END Symbol;
  1471. PROCEDURE Expression(x: SyntaxTree.Expression);
  1472. BEGIN
  1473. position := x.position;
  1474. constantDeclaration := NIL;
  1475. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1476. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1477. END;
  1478. IF x.resolved # NIL THEN
  1479. VExpression(x.resolved);
  1480. ELSE
  1481. VExpression(x);
  1482. END;
  1483. (* check this, was commented out in ActiveCells3 *)
  1484. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1485. Error(x.position, "unsupported modifier");
  1486. END;
  1487. END Expression;
  1488. (*
  1489. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1490. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1491. BEGIN
  1492. temporaries.GetUsage(current);
  1493. FOR i := 0 TO LEN(current)-1 DO
  1494. set := current[i] - previous[i];
  1495. IF set # {} THEN
  1496. FOR j := 0 TO MAX(SET)-1 DO
  1497. IF j IN set THEN
  1498. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1499. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1500. Symbol(variable, op);
  1501. MakeMemory(tmp,op.op,addressType,0);
  1502. ReleaseOperand(op);
  1503. Emit(Mov(position,tmp, nil ) );
  1504. ReleaseIntermediateOperand(tmp);
  1505. END;
  1506. END;
  1507. END;
  1508. END;
  1509. END;
  1510. END ResetUsedTemporaries;
  1511. *)
  1512. PROCEDURE Statement(x: SyntaxTree.Statement);
  1513. VAR use: VariableUse;
  1514. BEGIN
  1515. temporaries.GetUsage(use);
  1516. position := x.position;
  1517. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1518. IF commentPrintout # NIL THEN
  1519. commentPrintout.Statement(x);
  1520. dump.Ln;
  1521. (*dump.Update;*)
  1522. END;
  1523. VStatement(x);
  1524. (*
  1525. CheckRegistersFree();
  1526. *)
  1527. (*ResetUsedTemporaries(use);*)
  1528. temporaries.SetUsage(use);
  1529. END Statement;
  1530. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1531. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1532. *)
  1533. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1534. BEGIN
  1535. ASSERT(op.mode # IntermediateCode.Undefined);
  1536. IF op.mode = IntermediateCode.ModeMemory THEN
  1537. ReuseCopy(res,op);
  1538. ELSE
  1539. res := op;
  1540. UseIntermediateOperand(res);
  1541. END;
  1542. IntermediateCode.AddOffset(res,offset);
  1543. IntermediateCode.MakeMemory(res,type);
  1544. END MakeMemory;
  1545. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1546. VAR mem: IntermediateCode.Operand;
  1547. BEGIN
  1548. MakeMemory(mem,res,type,offset);
  1549. ReleaseIntermediateOperand(res);
  1550. res := mem;
  1551. END ToMemory;
  1552. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1553. VAR mem: IntermediateCode.Operand;
  1554. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1555. componentType: SyntaxTree.Type;
  1556. BEGIN
  1557. type := type.resolved;
  1558. IF operand.mode = ModeReference THEN
  1559. IF type IS SyntaxTree.RangeType THEN
  1560. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1561. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1562. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1563. ReleaseOperand(operand);
  1564. operand.op := firstOp;
  1565. operand.tag := lastOp;
  1566. operand.extra := stepOp;
  1567. ELSIF type IS SyntaxTree.ComplexType THEN
  1568. componentType := type(SyntaxTree.ComplexType).componentType;
  1569. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1570. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1571. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1572. ReleaseOperand(operand);
  1573. operand.op := firstOp;
  1574. operand.tag := lastOp
  1575. ELSE
  1576. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1577. ReleaseIntermediateOperand(operand.op);
  1578. operand.op := mem;
  1579. END;
  1580. operand.mode := ModeValue;
  1581. END;
  1582. ASSERT(operand.mode = ModeValue);
  1583. END LoadValue;
  1584. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1585. VAR prevConditional: BOOLEAN;
  1586. BEGIN
  1587. prevConditional := conditional;
  1588. conditional := FALSE;
  1589. InitOperand(result, ModeUndefined);
  1590. Expression(x);
  1591. op := result;
  1592. LoadValue(op,x.type.resolved);
  1593. conditional := prevConditional;
  1594. END Evaluate;
  1595. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1596. VAR prevConditional: BOOLEAN;
  1597. BEGIN
  1598. prevConditional := conditional;
  1599. conditional := FALSE;
  1600. InitOperand(result,ModeUndefined);
  1601. Expression(x);
  1602. op := result;
  1603. (*
  1604. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1605. *)
  1606. conditional := prevConditional;
  1607. END Designate;
  1608. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1609. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1610. BEGIN
  1611. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1612. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1613. conditional := TRUE;
  1614. trueLabel := trueL; falseLabel := falseL;
  1615. Expression(x);
  1616. trueL := trueLabel; falseL := falseLabel;
  1617. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1618. END Condition;
  1619. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1620. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1621. BEGIN
  1622. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1623. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1624. RETURN op
  1625. END NewRegisterOperand;
  1626. PROCEDURE UnuseRegister(register: LONGINT);
  1627. BEGIN
  1628. IF (register > 0) THEN
  1629. register := registerUsageCount.Map(register);
  1630. registerUsageCount.DecUse(register);
  1631. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1632. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1633. END;
  1634. IF registerUsageCount.Use(register)=0 THEN
  1635. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1636. Warning(position, "register cannot be removed");
  1637. END;
  1638. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1639. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1640. END;
  1641. ELSIF registerUsageCount.Use(register)<0 THEN
  1642. Warning(position, "register removed too often");
  1643. IF dump # NIL THEN
  1644. dump.String("register removed too often"); dump.Ln; dump.Update;
  1645. END;
  1646. END;
  1647. END;
  1648. END UnuseRegister;
  1649. PROCEDURE UseRegister(register: LONGINT);
  1650. BEGIN
  1651. IF (register > 0) THEN
  1652. register := registerUsageCount.Map(register);
  1653. registerUsageCount.IncUse(register);
  1654. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1655. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1656. END;
  1657. IF registerUsageCount.Use(register)=1 THEN
  1658. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1659. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1660. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1661. END;
  1662. END;
  1663. END;
  1664. END UseRegister;
  1665. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1666. BEGIN
  1667. UnuseRegister(op.register)
  1668. END ReleaseIntermediateOperand;
  1669. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1670. BEGIN
  1671. UseRegister(op.register)
  1672. END UseIntermediateOperand;
  1673. PROCEDURE ReleaseOperand(CONST op: Operand);
  1674. BEGIN
  1675. UnuseRegister(op.op.register);
  1676. UnuseRegister(op.tag.register);
  1677. UnuseRegister(op.extra.register);
  1678. END ReleaseOperand;
  1679. (* save registers marked in array "markedRegisters" to the stack
  1680. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1681. *)
  1682. PROCEDURE SaveRegisters();
  1683. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1684. BEGIN
  1685. entry := usedRegisters;
  1686. WHILE entry # NIL DO
  1687. type := registerUsageCount.used[entry.register].type;
  1688. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1689. Emit(Push(position,op));
  1690. entry := entry.next;
  1691. END;
  1692. END SaveRegisters;
  1693. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1694. BEGIN
  1695. saved := usedRegisters;
  1696. usedRegisters := NIL;
  1697. END ReleaseUsedRegisters;
  1698. (** remove parameter registers from used queue *)
  1699. PROCEDURE ReleaseParameterRegisters;
  1700. VAR entry,prev,next: RegisterEntry;
  1701. BEGIN
  1702. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1703. WHILE entry # NIL DO
  1704. next := entry.next;
  1705. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1706. registerUsageCount.DecUse(entry.register);
  1707. ASSERT(registerUsageCount.Use(entry.register)=0);
  1708. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1709. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1710. END;
  1711. ELSIF prev = NIL THEN
  1712. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1713. ELSE
  1714. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1715. END;
  1716. entry := next;
  1717. END;
  1718. END ReleaseParameterRegisters;
  1719. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1720. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1721. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1722. BEGIN
  1723. entry := saved;
  1724. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1725. entry := prev;
  1726. WHILE entry # NIL DO
  1727. prev := entry.prev;
  1728. type := entry.type;
  1729. class := entry.registerClass;
  1730. IntermediateCode.InitRegister(op,type,class,entry.register);
  1731. Emit(Pop(position,op));
  1732. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1733. entry := prev;
  1734. END;
  1735. END RestoreRegisters;
  1736. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  1737. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  1738. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1739. BEGIN
  1740. entry := saved;
  1741. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1742. entry := prev;
  1743. WHILE entry # NIL DO
  1744. prev := entry.prev;
  1745. type := entry.type;
  1746. class := entry.registerClass;
  1747. IntermediateCode.InitRegister(op,type,class,entry.register);
  1748. Emit(Mov(position,op,op));
  1749. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1750. entry := prev;
  1751. END;
  1752. END RestoreRegisterUse;
  1753. PROCEDURE CheckRegistersFree;
  1754. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1755. BEGIN
  1756. IF usedRegisters # NIL THEN
  1757. r := usedRegisters;
  1758. WHILE r # NIL DO
  1759. warning := "register ";
  1760. Strings.AppendInt(warning, r.register);
  1761. Strings.Append(warning, " not released.");
  1762. Warning(position,warning);
  1763. r := r .next;
  1764. END;
  1765. END;
  1766. FOR i := 0 TO registerUsageCount.count-1 DO
  1767. IF registerUsageCount.used[i].count < 0 THEN
  1768. warning := "register ";
  1769. Strings.AppendInt(warning, i);
  1770. Strings.Append(warning, " unused too often.");
  1771. Warning(position,warning);
  1772. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1773. warning := "register ";
  1774. Strings.AppendInt(warning, i);
  1775. Strings.Append(warning, " not unused often enough.");
  1776. Warning(position,warning);
  1777. END;
  1778. END;
  1779. END CheckRegistersFree;
  1780. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1781. Otherwise allocate a new register.
  1782. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1783. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1784. BEGIN
  1785. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1786. UseIntermediateOperand(result);
  1787. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1788. UseIntermediateOperand(result);
  1789. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1790. END;
  1791. END Reuse2;
  1792. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1793. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1794. If not then allocate a new register.
  1795. Does NOT necessarily keep the content of src1 or src2 in result!
  1796. *)
  1797. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1798. BEGIN
  1799. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1800. UseIntermediateOperand(result);
  1801. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1802. UseIntermediateOperand(result);
  1803. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1804. result := alternative; alternative := emptyOperand;
  1805. UseIntermediateOperand(result);
  1806. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1807. END;
  1808. END Reuse2a;
  1809. (* like reuse2 but only one source *)
  1810. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1811. BEGIN
  1812. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1813. UseIntermediateOperand(result);
  1814. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1815. END;
  1816. END Reuse1;
  1817. (* like reuse2a but only one source *)
  1818. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1819. BEGIN
  1820. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1821. UseIntermediateOperand(result);
  1822. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1823. UseIntermediateOperand(result);
  1824. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1825. END;
  1826. END Reuse1a;
  1827. (* like reuse1 but guarantees that content of src1 is in result *)
  1828. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1829. BEGIN
  1830. IF ReusableRegister(src1) THEN
  1831. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1832. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1833. UseIntermediateOperand(result);
  1834. ELSE
  1835. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1836. Emit(Mov(position,result,src1));
  1837. END
  1838. END ReuseCopy;
  1839. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1840. BEGIN
  1841. IF ReusableRegister(src) THEN
  1842. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1843. ELSE
  1844. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1845. Emit(Mov(position,result,src));
  1846. ReleaseIntermediateOperand(src);
  1847. END
  1848. END TransferToRegister;
  1849. (** labels and branches **)
  1850. PROCEDURE NewLabel(): Label;
  1851. VAR label: Label;
  1852. BEGIN
  1853. NEW(label,section); RETURN label;
  1854. END NewLabel;
  1855. PROCEDURE SetLabel(label: Label);
  1856. BEGIN
  1857. (* basic block start / end *)
  1858. label.Resolve(section.pc);
  1859. END SetLabel;
  1860. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1861. BEGIN
  1862. ASSERT(label # NIL);
  1863. IF label.pc < 0 THEN (* label not yet set *)
  1864. label.AddFixup(section.pc);
  1865. END;
  1866. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1867. END LabelOperand;
  1868. PROCEDURE BrL(label: Label);
  1869. BEGIN
  1870. (* basic block start / end *)
  1871. Emit(Br(position,LabelOperand(label)));
  1872. END BrL;
  1873. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1874. BEGIN
  1875. Emit(Brge(position,LabelOperand(label),left,right));
  1876. END BrgeL;
  1877. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1878. BEGIN
  1879. Emit(Brlt(position,LabelOperand(label),left,right));
  1880. END BrltL;
  1881. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1882. BEGIN
  1883. Emit(Breq(position,LabelOperand(label),left,right));
  1884. END BreqL;
  1885. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1886. BEGIN
  1887. Emit(Brne(position,LabelOperand(label),left,right));
  1888. END BrneL;
  1889. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1890. VAR new: IntermediateCode.Operand;
  1891. BEGIN
  1892. IF Trace THEN TraceEnter("Convert") END;
  1893. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1894. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1895. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1896. & (operand.offset = 0)
  1897. THEN
  1898. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1899. Emit(Conv(position,new,operand));
  1900. ELSE
  1901. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1902. Emit(Conv(position,new,operand));
  1903. ReleaseIntermediateOperand(operand);
  1904. END;
  1905. operand := new;
  1906. 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
  1907. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1908. ELSE
  1909. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1910. Emit(Conv(position,new,operand));
  1911. ReleaseIntermediateOperand(operand);
  1912. operand := new;
  1913. END;
  1914. IF Trace THEN TraceExit("Convert") END;
  1915. END Convert;
  1916. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1917. VAR exit: Label;
  1918. BEGIN
  1919. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1920. exit := NewLabel();
  1921. br(exit,left,right);
  1922. EmitTrap(position,trapNo);
  1923. SetLabel(exit);
  1924. END TrapC;
  1925. (** expressions *)
  1926. (** emit necessary runtime check for set elements **)
  1927. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1928. VAR max: IntermediateCode.Operand;
  1929. BEGIN
  1930. IF isUnchecked THEN RETURN END;
  1931. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1932. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1933. TrapC(BrgeL, max, o, SetElementTrap);
  1934. END;
  1935. END CheckSetElement;
  1936. (** the set that a range represents **)
  1937. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1938. VAR
  1939. operand: Operand;
  1940. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1941. BEGIN
  1942. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1943. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1944. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1945. one := IntermediateCode.Immediate(setType, 1);
  1946. Evaluate(x, operand);
  1947. Convert(operand.op, setType);
  1948. Convert(operand.tag, setType);
  1949. CheckSetElement(operand.op);
  1950. CheckSetElement(operand.tag);
  1951. (* create mask for lower bound
  1952. i.e. shift 11111111 to the left by the value of the lower bound
  1953. *)
  1954. Reuse1(temp, operand.op);
  1955. Emit(Shl(position,temp, allBits, operand.op));
  1956. ReleaseIntermediateOperand(operand.op);
  1957. operand.op := temp;
  1958. (* create mask for upper bound
  1959. i.e. shift 11111111 to the right by the difference between the
  1960. upper bound and the maximum number of set elements
  1961. *)
  1962. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1963. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1964. Reuse1(temp, operand.tag);
  1965. ELSE
  1966. Reuse1(temp, operand.tag);
  1967. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1968. Emit(Sub(position,temp, size, operand.tag));
  1969. END;
  1970. Emit(Shr(position,temp, allBits, operand.tag));
  1971. ReleaseIntermediateOperand(operand.tag);
  1972. operand.tag := temp;
  1973. Reuse2(resultingSet, operand.op, operand.tag);
  1974. (* intersect the two masks *)
  1975. Emit(And(position,resultingSet, operand.op, operand.tag));
  1976. ReleaseOperand(operand);
  1977. RETURN resultingSet
  1978. END SetFromRange;
  1979. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  1980. VAR
  1981. res, operand: Operand;
  1982. temp, one, noBits, dest: IntermediateCode.Operand;
  1983. expression: SyntaxTree.Expression;
  1984. i: LONGINT;
  1985. BEGIN
  1986. IF Trace THEN TraceEnter("VisitSet") END;
  1987. dest := destination;
  1988. destination := emptyOperand;
  1989. noBits := IntermediateCode.Immediate(setType, 0);
  1990. one := IntermediateCode.Immediate(setType, 1);
  1991. (* start off with the empty set *)
  1992. InitOperand(res, ModeValue);
  1993. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1994. Emit(Mov(position,res.op, noBits));
  1995. FOR i := 0 TO x.elements.Length() - 1 DO
  1996. expression := x.elements.GetExpression(i);
  1997. IF expression IS SyntaxTree.RangeExpression THEN
  1998. (* range of set elements *)
  1999. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2000. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2001. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2002. ReleaseIntermediateOperand(temp)
  2003. ELSE
  2004. (* singelton element *)
  2005. Evaluate(expression, operand);
  2006. Convert(operand.op, setType);
  2007. CheckSetElement(operand.op);
  2008. (* create subset containing single element *)
  2009. Reuse1(temp, operand.op);
  2010. Emit(Shl(position,temp, one, operand.op));
  2011. ReleaseOperand(operand);
  2012. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2013. ReleaseIntermediateOperand(temp);
  2014. END
  2015. END;
  2016. result := res;
  2017. destination := dest;
  2018. IF Trace THEN TraceExit("VisitSet") END;
  2019. END VisitSet;
  2020. (* math arrays of the form [a,b,c]
  2021. x is a static array and thus does not provide any pointers
  2022. *)
  2023. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2024. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2025. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2026. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2027. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2028. element: SyntaxTree.IntegerValue;
  2029. BEGIN
  2030. numberElements := x.elements.Length();
  2031. expression := index.parameters.GetExpression(dim);
  2032. element := expression(SyntaxTree.IntegerValue);
  2033. FOR i := 0 TO numberElements-1 DO
  2034. expression := x.elements.GetExpression(i);
  2035. element.SetValue(i);
  2036. IF expression IS SyntaxTree.MathArrayExpression THEN
  2037. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2038. ELSE
  2039. Assign(index,expression);
  2040. END;
  2041. END;
  2042. END RecursiveAssignment;
  2043. PROCEDURE Dimension(): LONGINT;
  2044. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2045. BEGIN
  2046. dim := 0;
  2047. expression := x;
  2048. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2049. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2050. INC(dim);
  2051. END;
  2052. RETURN dim;
  2053. END Dimension;
  2054. BEGIN
  2055. (*static math array not providing pointers anyway *)
  2056. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2057. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2058. designator.SetType(variable.type);
  2059. dim := Dimension();
  2060. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2061. FOR i := 0 TO dim-1 DO
  2062. element := SyntaxTree.NewIntegerValue(x.position,0);
  2063. element.SetType(system.longintType);
  2064. index.parameters.AddExpression(element);
  2065. END;
  2066. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2067. RecursiveAssignment(x,0);
  2068. Expression(designator);
  2069. END VisitMathArrayExpression;
  2070. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2071. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2072. BEGIN
  2073. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2074. dest := destination; destination := emptyOperand;
  2075. IF x.operator = Scanner.Not THEN
  2076. IF conditional THEN
  2077. Condition(x.left,falseLabel,trueLabel)
  2078. ELSE
  2079. Evaluate(x.left,operand);
  2080. InitOperand(result,ModeValue);
  2081. Reuse1a(result.op,operand.op,dest);
  2082. Emit(Xor(position,result.op,operand.op,true));
  2083. ReleaseOperand(operand);
  2084. END;
  2085. ELSIF x.operator = Scanner.Minus THEN
  2086. Evaluate(x.left,operand);
  2087. InitOperand(result,ModeValue);
  2088. Reuse1a(result.op,operand.op,dest);
  2089. type := x.left.type.resolved;
  2090. IF type IS SyntaxTree.SetType THEN
  2091. Emit(Not(position,result.op,operand.op));
  2092. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2093. Reuse1(result.tag,operand.tag);
  2094. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2095. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2096. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2097. Emit(Neg(position,result.op,operand.op));
  2098. ELSE HALT(200)
  2099. END;
  2100. ReleaseOperand(operand);
  2101. ELSIF x.operator = Scanner.Address THEN
  2102. Designate(x.left,operand);
  2103. operand.mode := ModeValue;
  2104. t0 := x.left.type.resolved;
  2105. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2106. ReleaseIntermediateOperand(operand.op);
  2107. operand.op := operand.tag;
  2108. IntermediateCode.InitOperand(operand.tag);
  2109. END;
  2110. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2111. result := operand;
  2112. ELSE HALT(100)
  2113. END;
  2114. destination := dest;
  2115. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2116. END VisitUnaryExpression;
  2117. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2118. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label; withPart: BOOLEAN);
  2119. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2120. BEGIN
  2121. type := type.resolved;
  2122. originalType := type;
  2123. IF type IS SyntaxTree.PointerType THEN
  2124. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2125. END;
  2126. IF type IS SyntaxTree.ObjectType THEN
  2127. BrL(trueL);
  2128. ELSE
  2129. ASSERT(type IS SyntaxTree.RecordType);
  2130. (*
  2131. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2132. *)
  2133. IF withPart THEN
  2134. left := tag;
  2135. ELSE
  2136. ReuseCopy(left,tag);
  2137. END;
  2138. right := TypeDescriptorAdr(type);
  2139. IF backend.cooperative THEN
  2140. repeatL := NewLabel();
  2141. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2142. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2143. END;
  2144. SetLabel(repeatL);
  2145. BreqL(trueL,left,right);
  2146. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2147. BrneL(repeatL,left,nil);
  2148. ELSIF meta.simple THEN
  2149. level := type(SyntaxTree.RecordType).Level();
  2150. (* get type desc tag of level relative to base tag *)
  2151. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2152. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2153. IntermediateCode.MakeMemory(left,addressType);
  2154. BreqL(trueL,left,right);
  2155. ELSE
  2156. level := type(SyntaxTree.RecordType).Level();
  2157. (* get type desc tag of level relative to base tag *)
  2158. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2159. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2160. IntermediateCode.MakeMemory(left,addressType);
  2161. BreqL(trueL,left,right);
  2162. END;
  2163. IF ~withPart THEN
  2164. ReleaseIntermediateOperand(left);
  2165. END;
  2166. ReleaseIntermediateOperand(right);
  2167. IF falseL # NIL THEN BrL(falseL) END;
  2168. END;
  2169. END TypeTest;
  2170. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2171. BEGIN
  2172. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2173. IF dump # NIL THEN
  2174. dump.String(s); dump.Ln;
  2175. END;
  2176. END Error;
  2177. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2178. BEGIN
  2179. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2180. IF dump # NIL THEN
  2181. dump.String(s); dump.Ln; dump.Update;
  2182. END;
  2183. END Warning;
  2184. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2185. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2186. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2187. operand:Operand;
  2188. BEGIN
  2189. previousSection := section;
  2190. Global.GetModuleName(mod,name);
  2191. Strings.Append(name,".@Trace");
  2192. Basic.ToSegmentedName(name, pooledName);
  2193. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2194. IF dump # NIL THEN dump := section.comments END;
  2195. IF backend.hasLinkRegister THEN
  2196. Emit(Push(Basic.invalidPosition, lr));
  2197. END;
  2198. variable := mod.moduleScope.firstVariable;
  2199. WHILE variable # NIL DO
  2200. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2201. Symbol(variable, operand);
  2202. register := operand.op;
  2203. CallTraceMethod(register, variable.type);
  2204. ReleaseIntermediateOperand(register);
  2205. END;
  2206. variable := variable.nextVariable;
  2207. END;
  2208. IF backend.hasLinkRegister THEN
  2209. Emit(Pop(Basic.invalidPosition, lr));
  2210. END;
  2211. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2212. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2213. Emit(Br(position,op));
  2214. INC(statCoopTraceModule, section.pc);
  2215. section := previousSection;
  2216. IF dump # NIL THEN dump := section.comments END;
  2217. END CreateTraceModuleMethod;
  2218. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2219. BEGIN
  2220. Emit (Push(position, dst));
  2221. Emit (Push(position, src));
  2222. CallThis(position,"GarbageCollector","Assign", 2);
  2223. END CallAssignPointer;
  2224. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2225. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2226. BEGIN
  2227. IF SemanticChecker.IsPointerType (type) THEN
  2228. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2229. ELSIF type.IsRecordType() THEN
  2230. Emit (Push(position,dst));
  2231. Emit (Push(position,src));
  2232. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2233. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2234. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2235. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2236. ELSIF IsStaticArray(type) THEN
  2237. size := StaticArrayNumElements(type);
  2238. base := StaticArrayBaseType(type);
  2239. IF base.IsRecordType() THEN
  2240. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2241. Emit (Push(position, dst));
  2242. Emit (Push(position, src));
  2243. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2244. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2245. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2246. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2247. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2248. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2249. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2250. Emit (Push(position, dst));
  2251. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2252. Emit (Push(position, src));
  2253. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2254. ELSE
  2255. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2256. Emit (Push(position, dst));
  2257. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2258. Emit (Push(position, src));
  2259. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2260. ASSERT(StaticArrayBaseType(type).IsPointer());
  2261. END;
  2262. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2263. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2264. Emit (Push(position, dst));
  2265. Emit (Push(position, src));
  2266. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2267. ELSE HALT(100); (* missing ? *)
  2268. END;
  2269. END CallAssignMethod;
  2270. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2271. VAR name: Basic.SegmentedName;
  2272. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2273. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2274. context: Context;
  2275. BEGIN
  2276. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2277. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2278. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2279. GetRecordTypeName (recordType,name);
  2280. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2281. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2282. section.SetExported (TRUE);
  2283. IF dump # NIL THEN dump := section.comments END;
  2284. IF backend.hasLinkRegister THEN
  2285. Emit(Push(Basic.invalidPosition, lr));
  2286. END;
  2287. variable := recordType.recordScope.firstVariable;
  2288. WHILE variable # NIL DO
  2289. IF variable.NeedsTrace() THEN
  2290. dst := NewRegisterOperand (addressType);
  2291. src := NewRegisterOperand (addressType);
  2292. Emit (Mov(position, dst, parameter1));
  2293. Emit (Mov(position, src, parameter2));
  2294. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2295. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2296. CallAssignMethod(dst, src, variable.type);
  2297. ReleaseIntermediateOperand(src);
  2298. ReleaseIntermediateOperand(dst);
  2299. END;
  2300. variable := variable.nextVariable;
  2301. END;
  2302. recordBase := recordType.GetBaseRecord();
  2303. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2304. IF backend.hasLinkRegister THEN
  2305. Emit(Pop(Basic.invalidPosition, lr));
  2306. END;
  2307. GetRecordTypeName (recordBase,name);
  2308. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2309. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2310. Emit(Br(position,op));
  2311. ELSE
  2312. Emit(Exit(position,0,0, 0));
  2313. END;
  2314. IF ~recordType.isObject THEN
  2315. GetRecordTypeName (recordType,name);
  2316. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2317. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2318. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2319. section.SetExported (TRUE);
  2320. NEW(registerUsageCount);
  2321. usedRegisters := NIL;
  2322. dst := NewRegisterOperand (addressType);
  2323. src := NewRegisterOperand (addressType);
  2324. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2325. Emit(Mov(position, dst, parameter1));
  2326. Emit(Mov(position, src, parameter2));
  2327. label := NewLabel();
  2328. SetLabel(label);
  2329. Emit(Push(position, dst));
  2330. Emit(Push(position, src));
  2331. GetRecordTypeName (recordType,name);
  2332. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2333. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2334. Emit(Call(position, op, 0));
  2335. Emit(Pop(position, src));
  2336. Emit(Pop(position, dst));
  2337. Emit(Add(position, dst, dst, ofs));
  2338. Emit(Add(position, src, src, ofs));
  2339. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2340. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2341. Emit(Exit(position,0,0, 0));
  2342. END;
  2343. INC(statCoopAssignProcedure, section.pc);
  2344. ReturnToContext(context);
  2345. IF dump # NIL THEN dump := section.comments END;
  2346. END CreateAssignProcedure;
  2347. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2348. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2349. BEGIN
  2350. IF IsUnsafePointer (type) THEN
  2351. skip := NewLabel();
  2352. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2353. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2354. BreqL (skip, op, nil);
  2355. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2356. SetLabel (skip);
  2357. ELSIF SemanticChecker.IsPointerType (type) THEN
  2358. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2359. CallThis(position,"GarbageCollector","Mark", 1);
  2360. ELSIF type.IsRecordType() THEN
  2361. Emit (Push(position,register));
  2362. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2363. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2364. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2365. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2366. ELSIF IsStaticArray(type) THEN
  2367. size := StaticArrayNumElements(type);
  2368. base := StaticArrayBaseType(type);
  2369. IF base.IsRecordType() THEN
  2370. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2371. Emit (Push(position, register));
  2372. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2373. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2374. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2375. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2376. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2377. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2378. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2379. Emit (Push(position, register));
  2380. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2381. ELSE
  2382. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2383. Emit (Push(position, register));
  2384. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2385. ASSERT(base.IsPointer());
  2386. END;
  2387. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2388. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2389. CallThis(position,"GarbageCollector","Mark", 1);
  2390. ELSE HALT(100); (* missing ? *)
  2391. END;
  2392. END CallTraceMethod;
  2393. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2394. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2395. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2396. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2397. BEGIN
  2398. previousSection := section;
  2399. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2400. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2401. GetRecordTypeName (recordType,name);
  2402. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2403. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2404. section.SetExported (TRUE);
  2405. IF dump # NIL THEN dump := section.comments END;
  2406. IF backend.hasLinkRegister THEN
  2407. Emit(Push(Basic.invalidPosition, lr));
  2408. END;
  2409. variable := recordType.recordScope.firstVariable;
  2410. WHILE variable # NIL DO
  2411. IF variable.NeedsTrace() THEN
  2412. register := NewRegisterOperand (addressType);
  2413. Emit (Mov(position,register,parameter1));
  2414. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2415. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2416. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2417. END;
  2418. CallTraceMethod(register, variable.type);
  2419. ReleaseIntermediateOperand(register);
  2420. END;
  2421. variable := variable.nextVariable;
  2422. END;
  2423. recordBase := recordType.GetBaseRecord();
  2424. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2425. recordBase := recordBase.GetBaseRecord();
  2426. END;
  2427. IF recordBase # NIL THEN
  2428. IF backend.hasLinkRegister THEN
  2429. Emit(Pop(Basic.invalidPosition, lr));
  2430. END;
  2431. GetRecordTypeName (recordBase,name);
  2432. IF HasExplicitTraceMethod (recordBase) THEN
  2433. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2434. ELSE
  2435. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2436. END;
  2437. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2438. Emit(Br(position,op));
  2439. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2440. Emit(Exit(position,0,0,0));
  2441. ELSE
  2442. IF backend.hasLinkRegister THEN
  2443. Emit(Pop(Basic.invalidPosition, lr));
  2444. END;
  2445. IF recordType.isObject THEN
  2446. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2447. ELSE
  2448. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2449. END;
  2450. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2451. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2452. Emit(Br(position,op));
  2453. END;
  2454. IF ~recordType.isObject THEN
  2455. GetRecordTypeName (recordType,name);
  2456. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2457. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2458. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2459. section.SetExported (TRUE);
  2460. NEW(registerUsageCount);
  2461. usedRegisters := NIL;
  2462. IF dump # NIL THEN dump := section.comments END;
  2463. register := NewRegisterOperand (addressType);
  2464. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2465. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2466. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2467. END;
  2468. Emit (Push(position,register));
  2469. GetRecordTypeName (recordType,name);
  2470. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2471. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2472. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2473. ReleaseIntermediateOperand(register);
  2474. Emit(Exit(position,0,0,0));
  2475. GetRecordTypeName (recordType,name);
  2476. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2477. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2478. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2479. section.SetExported (TRUE);
  2480. NEW(registerUsageCount);
  2481. usedRegisters := NIL;
  2482. register := NewRegisterOperand (addressType);
  2483. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2484. Emit(Mov(position, register, parameter1));
  2485. label := NewLabel();
  2486. SetLabel(label);
  2487. Emit(Push(position, register));
  2488. GetRecordTypeName (recordType,name);
  2489. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2490. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2491. Emit(Call(position, op, 0));
  2492. Emit(Pop(position, register));
  2493. Emit(Add(position, register, register, ofs));
  2494. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2495. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2496. Emit(Exit(position,0,0,0));
  2497. END;
  2498. INC(statCoopTraceMethod, section.pc);
  2499. ReturnToContext(context);
  2500. IF dump # NIL THEN dump := section.comments END;
  2501. END CreateTraceMethod;
  2502. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2503. VAR name: Basic.SegmentedName;
  2504. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2505. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2506. context: Context;
  2507. BEGIN
  2508. IF recordType.isObject THEN RETURN END;
  2509. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2510. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2511. GetRecordTypeName (recordType,name);
  2512. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2513. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2514. section.SetExported (TRUE);
  2515. IF dump # NIL THEN dump := section.comments END;
  2516. IF backend.hasLinkRegister THEN
  2517. Emit(Push(Basic.invalidPosition, lr));
  2518. END;
  2519. variable := recordType.recordScope.firstVariable;
  2520. WHILE variable # NIL DO
  2521. IF variable.NeedsTrace() THEN
  2522. dst := NewRegisterOperand (addressType);
  2523. Emit (Mov(position, dst, parameter1));
  2524. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2525. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2526. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2527. END;
  2528. CallResetProcedure(dst, nil, variable.type);
  2529. ReleaseIntermediateOperand(dst);
  2530. END;
  2531. variable := variable.nextVariable;
  2532. END;
  2533. recordBase := recordType.GetBaseRecord();
  2534. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2535. IF backend.hasLinkRegister THEN
  2536. Emit(Pop(Basic.invalidPosition, lr));
  2537. END;
  2538. GetRecordTypeName (recordBase,name);
  2539. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2540. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2541. Emit(Br(position,op));
  2542. ELSE
  2543. Emit(Exit(position,0,0, 0));
  2544. END;
  2545. GetRecordTypeName (recordType,name);
  2546. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2547. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2548. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2549. section.SetExported (TRUE);
  2550. NEW(registerUsageCount);
  2551. usedRegisters := NIL;
  2552. dst := NewRegisterOperand (addressType);
  2553. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2554. Emit(Mov(position, dst, parameter1));
  2555. label := NewLabel();
  2556. SetLabel(label);
  2557. Emit(Push(position, dst));
  2558. GetRecordTypeName (recordType,name);
  2559. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2560. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2561. Emit(Call(position, op, 0));
  2562. Emit(Pop(position, dst));
  2563. Emit(Add(position, dst, dst, ofs));
  2564. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2565. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2566. Emit(Exit(position,0,0, 0));
  2567. INC(statCoopResetProcedure, section.pc);
  2568. ReturnToContext(context);
  2569. IF dump # NIL THEN dump := section.comments END;
  2570. END CreateResetProcedure;
  2571. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2572. VAR name: Basic.SegmentedName; context: Context;
  2573. BEGIN
  2574. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2575. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2576. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2577. IF dump # NIL THEN dump := section.comments END;
  2578. IF backend.hasLinkRegister THEN
  2579. Emit(Push(Basic.invalidPosition, lr));
  2580. END;
  2581. Emit(Push(position,fp));
  2582. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2583. ResetVariables(scope);
  2584. Emit(Pop(position,fp));
  2585. Emit(Exit(position,0,0, 0));
  2586. ReturnToContext(context);
  2587. IF dump # NIL THEN dump := section.comments END;
  2588. END CreateResetMethod;
  2589. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2590. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2591. BEGIN
  2592. IF SemanticChecker.IsPointerType (type) THEN
  2593. Emit (Push(position, dest));
  2594. CallThis(position,"GarbageCollector","Reset", 1);
  2595. ELSIF type.IsRecordType() THEN
  2596. Emit (Push(position, dest));
  2597. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2598. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2599. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2600. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2601. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2602. size := GetArrayLength(type, tag);
  2603. base := ArrayBaseType(type);
  2604. IF base.IsRecordType() THEN
  2605. Emit (Push(position, size));
  2606. Emit (Push(position, dest));
  2607. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2608. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2609. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2610. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2611. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2612. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2613. Emit (Push(position, size));
  2614. Emit (Push(position, dest));
  2615. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2616. ELSE
  2617. Emit (Push(position, size));
  2618. Emit (Push(position, dest));
  2619. CallThis(position,"GarbageCollector","ResetArray", 2);
  2620. ASSERT(ArrayBaseType(type).IsPointer());
  2621. END;
  2622. ReleaseIntermediateOperand(size);
  2623. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2624. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2625. Emit (Push(position, dest));
  2626. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2627. ELSE HALT(100); (* missing ? *)
  2628. END;
  2629. END CallResetProcedure;
  2630. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2631. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2632. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2633. VAR operand: Operand;
  2634. BEGIN
  2635. Symbol (symbol, operand);
  2636. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2637. ReleaseOperand(operand);
  2638. END Reset;
  2639. BEGIN
  2640. previousScope := currentScope;
  2641. currentScope := scope;
  2642. pc := section.pc;
  2643. prevOffset := MAX(SIZE);
  2644. variable := scope.firstVariable;
  2645. WHILE variable # NIL DO
  2646. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2647. Reset (variable);
  2648. prevOffset := variable.offsetInBits;
  2649. END;
  2650. variable := variable.nextVariable;
  2651. END;
  2652. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2653. WHILE parameter # NIL DO
  2654. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2655. Reset (parameter);
  2656. END;
  2657. parameter := parameter.nextParameter;
  2658. END;
  2659. INC(statCoopResetVariables, section.pc - pc);
  2660. currentScope := previousScope;
  2661. END ResetVariables;
  2662. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2663. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2664. BEGIN
  2665. type := symbol.type.resolved;
  2666. SaveRegisters();ReleaseUsedRegisters(saved);
  2667. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2668. Symbol(symbol, operand);
  2669. ToMemory(operand.op,addressType,0);
  2670. Emit(Push(position,operand.op));
  2671. IF refer THEN
  2672. CallThis(position,"Heaps","Refer",1);
  2673. ELSE
  2674. CallThis(position,"Heaps","Reset",1);
  2675. END;
  2676. ELSIF type.IsRecordType() THEN
  2677. Symbol(symbol, operand);
  2678. Emit(Push(position,operand.op));
  2679. Emit(Push(position,operand.tag)); (* type desc *)
  2680. IF refer THEN
  2681. CallThis(position,"Heaps","ReferRecord",2);
  2682. ELSE
  2683. CallThis(position,"Heaps","ResetRecord",2);
  2684. END;
  2685. ELSIF IsStaticArray(type) THEN
  2686. size := StaticArrayNumElements(type);
  2687. base := StaticArrayBaseType(type);
  2688. Symbol(symbol, operand);
  2689. arg := TypeDescriptorAdr(base);
  2690. Emit(Push(position,operand.op));
  2691. Emit(Push(position,arg));
  2692. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2693. ReleaseIntermediateOperand(arg);
  2694. IF refer THEN
  2695. CallThis(position,"Heaps","ReferArray",3);
  2696. ELSE
  2697. CallThis(position,"Heaps","ResetArray",3);
  2698. END;
  2699. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2700. size := StaticMathArrayNumElements(type);
  2701. base := StaticMathArrayBaseType(type);
  2702. Symbol(symbol, operand);
  2703. arg := TypeDescriptorAdr(base);
  2704. Emit(Push(position,operand.op));
  2705. Emit(Push(position,arg));
  2706. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2707. ReleaseIntermediateOperand(arg);
  2708. IF refer THEN
  2709. CallThis(position,"Heaps","ReferArray",3);
  2710. ELSE
  2711. CallThis(position,"Heaps","ResetArray",3);
  2712. END;
  2713. ELSIF type IS SyntaxTree.MathArrayType THEN
  2714. Symbol(symbol, operand);
  2715. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2716. Emit (Push(position, operand.op));
  2717. ELSE
  2718. Emit (Push(position, operand.tag));
  2719. END;
  2720. IF refer THEN
  2721. CallThis(position,"Heaps","ReferMathArray", 1);
  2722. ELSE
  2723. CallThis(position,"Heaps","ResetMathArray", 1);
  2724. END;
  2725. ELSIF type IS SyntaxTree.ProcedureType THEN
  2726. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2727. Symbol(symbol, operand);
  2728. Emit (Push(position, operand.tag));
  2729. IF refer THEN
  2730. CallThis(position,"Heaps","Refer", 1);
  2731. ELSE
  2732. CallThis(position,"Heaps","Reset", 1);
  2733. END;
  2734. ELSE HALT(100); (* missing ? *)
  2735. END;
  2736. ReleaseOperand(operand);
  2737. RestoreRegisters(saved);
  2738. END Reset;
  2739. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2740. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2741. BEGIN
  2742. previousScope := currentScope;
  2743. currentScope := scope;
  2744. pc := section.pc;
  2745. IF ~ refer THEN
  2746. variable := scope.firstVariable;
  2747. prevOffset := MAX(SIZE);
  2748. WHILE variable # NIL DO
  2749. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2750. Reset (variable,refer);
  2751. prevOffset := variable.offsetInBits;
  2752. END;
  2753. variable := variable.nextVariable;
  2754. END;
  2755. END;
  2756. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2757. WHILE parameter # NIL DO
  2758. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2759. Reset (parameter,refer);
  2760. END;
  2761. parameter := parameter.nextParameter;
  2762. END;
  2763. INC(statCoopResetVariables, section.pc - pc);
  2764. currentScope := previousScope;
  2765. END ResetVariables2;
  2766. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2767. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2768. VAR op: IntermediateCode.Operand; context: Context;
  2769. BEGIN
  2770. previousSection := section;
  2771. GetCodeSectionNameForSymbol(procedure, name);
  2772. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2773. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2774. IF dump # NIL THEN dump := section.comments END;
  2775. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2776. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2777. Emit(Data(position,op));
  2778. Emit(Data(position,nil));
  2779. IF HasPointers (procedure.procedureScope) THEN
  2780. GetCodeSectionNameForSymbol(procedure, name);
  2781. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2782. ELSE
  2783. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2784. END;
  2785. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2786. Emit(Data(position,op));
  2787. ReturnToContext(context);
  2788. IF dump # NIL THEN dump := section.comments END;
  2789. END CreateProcedureDescriptor;
  2790. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2791. VAR import: SyntaxTree.Import;
  2792. s: Basic.MessageString;
  2793. selfName: SyntaxTree.IdentifierString;
  2794. BEGIN
  2795. moduleScope.ownerModule.GetName(selfName);
  2796. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2797. module := moduleScope.ownerModule
  2798. ELSE
  2799. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2800. IF import = NIL THEN
  2801. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2802. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2803. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2804. s := "Module ";
  2805. Strings.Append(s,moduleName);
  2806. Strings.Append(s," cannot be imported.");
  2807. IF force THEN
  2808. Error(position,s);
  2809. ELSIF canBeLoaded THEN
  2810. IF WarningDynamicLoading THEN
  2811. Strings.Append(s, "=> no dynamic linking.");
  2812. Warning(position, s);
  2813. END;
  2814. canBeLoaded := FALSE;
  2815. END;
  2816. RETURN FALSE
  2817. ELSE
  2818. SELF.module.imports.AddName(moduleName)
  2819. END;
  2820. ELSIF import.module = NIL THEN (* already tried *)
  2821. RETURN FALSE
  2822. END;
  2823. module := import.module;
  2824. END;
  2825. RETURN TRUE
  2826. END AddImport;
  2827. (* needed for old binary object file format*)
  2828. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2829. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2830. BEGIN
  2831. IF AddImport(moduleName,module,TRUE) THEN
  2832. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2833. IF procedure = NIL THEN
  2834. s := "Instruction not supported on target, emulation procedure ";
  2835. Strings.Append(s,moduleName);
  2836. Strings.Append(s,".");
  2837. Strings.Append(s,procedureName);
  2838. Strings.Append(s," not present");
  2839. Error(position,s);
  2840. ELSE
  2841. StaticCallOperand(r,procedure);
  2842. ReleaseOperand(r);
  2843. fp := GetFingerprint(procedure);
  2844. END;
  2845. END;
  2846. END EnsureSymbol;
  2847. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2848. VAR exit: Label; trueL,falseL: Label;
  2849. BEGIN
  2850. trueL := NewLabel();
  2851. falseL := NewLabel();
  2852. exit := NewLabel();
  2853. Condition(x,trueL,falseL);
  2854. InitOperand(result,ModeValue);
  2855. SetLabel(trueL);
  2856. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2857. Emit(Mov(position,result.op,true));
  2858. BrL(exit);
  2859. SetLabel(falseL);
  2860. Emit(MovReplace(position,result.op,false));
  2861. SetLabel(exit);
  2862. END ConditionToValue;
  2863. PROCEDURE ValueToCondition(VAR op: Operand);
  2864. BEGIN
  2865. LoadValue(op,system.booleanType);
  2866. BrneL(trueLabel,op.op, false);
  2867. ReleaseOperand(op);
  2868. BrL(falseLabel);
  2869. END ValueToCondition;
  2870. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2871. VAR size: LONGINT;
  2872. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2873. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2874. BEGIN
  2875. ASSERT(type.form = SyntaxTree.Open);
  2876. baseType := type.arrayBase.resolved;
  2877. IF IsOpenArray(baseType) THEN
  2878. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2879. ELSE
  2880. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2881. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2882. END;
  2883. len := tag;
  2884. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2885. IntermediateCode.MakeMemory(len,addressType);
  2886. UseIntermediateOperand(len);
  2887. Reuse2(res,sizeOperand,len);
  2888. Emit(Mul(position,res,sizeOperand,len));
  2889. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2890. RETURN res
  2891. END GetArraySize;
  2892. BEGIN
  2893. type := type.resolved;
  2894. IF IsOpenArray(type) THEN
  2895. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2896. RETURN tag
  2897. ELSE
  2898. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2899. END;
  2900. ELSE
  2901. size := ToMemoryUnits(system,system.SizeOf(type));
  2902. RETURN IntermediateCode.Immediate(addressType,size)
  2903. END;
  2904. END GetDynamicSize;
  2905. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2906. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2907. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2908. BEGIN
  2909. ASSERT(type.form = SyntaxTree.Open);
  2910. baseType := type.arrayBase.resolved;
  2911. IF IsOpenArray(baseType) THEN
  2912. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2913. ELSE
  2914. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2915. END;
  2916. len := tag;
  2917. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2918. IntermediateCode.MakeMemory(len,addressType);
  2919. UseIntermediateOperand(len);
  2920. Reuse2(res,sizeOperand,len);
  2921. Emit(Mul(position,res,sizeOperand,len));
  2922. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2923. RETURN res
  2924. END GetLength;
  2925. BEGIN
  2926. type := type.resolved;
  2927. IF IsOpenArray(type) THEN
  2928. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2929. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2930. ELSIF type IS SyntaxTree.StringType THEN
  2931. RETURN tag;
  2932. ELSE
  2933. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2934. END;
  2935. END GetArrayLength;
  2936. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2937. VAR result: IntermediateCode.Operand;
  2938. BEGIN
  2939. IF backend.cooperative THEN
  2940. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2941. ELSE
  2942. MakeMemory(result, tag, addressType, 0);
  2943. END;
  2944. RETURN result
  2945. END GetSizeFromTag;
  2946. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2947. VAR parameter: SyntaxTree.Parameter;
  2948. BEGIN
  2949. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2950. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2951. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2952. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2953. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2954. END;
  2955. RETURN GetDynamicSize(e.type, tag);
  2956. END GetArrayOfBytesSize;
  2957. (*
  2958. to find imported symbol. not needed ?
  2959. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2960. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2961. BEGIN
  2962. IF AddImport(moduleName,importedModule,FALSE) THEN
  2963. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2964. RETURN symbol
  2965. ELSE
  2966. RETURN NIL
  2967. END
  2968. END SymbolByName;
  2969. *)
  2970. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2971. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2972. BEGIN
  2973. IF AddImport(moduleName,runtimeModule,force) THEN
  2974. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2975. IF procedure = NIL THEN
  2976. s := "Procedure ";
  2977. Strings.Append(s,moduleName);
  2978. Strings.Append(s,".");
  2979. Strings.Append(s,procedureName);
  2980. Strings.Append(s," not present");
  2981. Error(position,s);
  2982. RETURN FALSE
  2983. ELSE
  2984. RETURN TRUE
  2985. END;
  2986. ELSE RETURN FALSE
  2987. END;
  2988. END GetRuntimeProcedure;
  2989. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2990. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2991. s: Basic.MessageString;
  2992. BEGIN
  2993. Basic.InitSegmentedName(name);
  2994. name[0] := Basic.MakeString(moduleName);
  2995. name[1] := Basic.MakeString(typeName);
  2996. name[2] := -1;
  2997. IF AddImport(moduleName,importedModule, FALSE) THEN
  2998. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2999. IF symbol = NIL THEN
  3000. s := "type ";
  3001. Strings.Append(s,moduleName);
  3002. Strings.Append(s,".");
  3003. Strings.Append(s,typeName);
  3004. Strings.Append(s," not present");
  3005. Error(position,s);
  3006. END;
  3007. ELSE symbol := NIL;
  3008. END;
  3009. IF importedModule = moduleScope.ownerModule THEN
  3010. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3011. ELSE
  3012. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3013. END;
  3014. RETURN symbol
  3015. END GetTypeDescriptor;
  3016. (* 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. *)
  3017. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3018. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3019. pooledName: Basic.SegmentedName; size: LONGINT;
  3020. BEGIN
  3021. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3022. StaticCallOperand(result,procedure);
  3023. IF numberParameters < 0 THEN
  3024. size := ProcParametersSize(procedure);
  3025. ELSE
  3026. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3027. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3028. Error(position,"runtime call parameter count mismatch");
  3029. END;
  3030. END;
  3031. Emit(Call(position, result.op, size));
  3032. ReleaseOperand(result);
  3033. ELSE (* only static linking possible *)
  3034. ASSERT(numberParameters >= 0);
  3035. Basic.InitSegmentedName(pooledName);
  3036. pooledName[0] := Basic.MakeString(moduleName);
  3037. pooledName[1] := Basic.MakeString(procedureName);
  3038. pooledName[2] := -1;
  3039. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3040. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3041. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3042. END;
  3043. END CallThisChecked;
  3044. (* 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. *)
  3045. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3046. BEGIN
  3047. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3048. END CallThis;
  3049. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3050. VAR
  3051. left,right: Operand;
  3052. leftSize, rightSize: IntermediateCode.Operand;
  3053. saved: RegisterEntry;
  3054. reg: IntermediateCode.Operand;
  3055. procedureName: SyntaxTree.IdentifierString;
  3056. BEGIN
  3057. procedureName := "CompareString";
  3058. SaveRegisters();ReleaseUsedRegisters(saved);
  3059. Designate(leftExpression,left);
  3060. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3061. Emit(Push(position,leftSize));
  3062. ReleaseIntermediateOperand(leftSize);
  3063. Emit(Push(position,left.op));
  3064. ReleaseOperand(left);
  3065. Designate(rightExpression,right);
  3066. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3067. Emit(Push(position,rightSize));
  3068. ReleaseIntermediateOperand(rightSize);
  3069. Emit(Push(position,right.op));
  3070. ReleaseOperand(right);
  3071. CallThis(position,builtinsModuleName,procedureName, 4);
  3072. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3073. Emit(Result(position,reg));
  3074. (*
  3075. AcquireThisRegister(int8,IntermediateCode.Result);
  3076. *)
  3077. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3078. (*
  3079. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3080. *)
  3081. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3082. ReleaseIntermediateOperand(reg);
  3083. BrL(falseLabel);
  3084. END CompareString;
  3085. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3086. VAR
  3087. left,right: Operand;
  3088. leftSize, rightSize: IntermediateCode.Operand;
  3089. saved: RegisterEntry;
  3090. procedureName: SyntaxTree.IdentifierString;
  3091. BEGIN
  3092. procedureName := "CopyString";
  3093. SaveRegisters();ReleaseUsedRegisters(saved);
  3094. Designate(leftExpression,left);
  3095. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3096. Emit(Push(position,leftSize));
  3097. ReleaseIntermediateOperand(leftSize);
  3098. Emit(Push(position,left.op));
  3099. ReleaseOperand(left);
  3100. Designate(rightExpression,right);
  3101. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3102. Emit(Push(position,rightSize));
  3103. ReleaseIntermediateOperand(rightSize);
  3104. Emit(Push(position,right.op));
  3105. ReleaseOperand(right);
  3106. CallThis(position,builtinsModuleName,procedureName,4);
  3107. RestoreRegisters(saved);
  3108. END CopyString;
  3109. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3110. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3111. leftType,rightType: SyntaxTree.Type;
  3112. leftExpression,rightExpression : SyntaxTree.Expression;
  3113. componentType: IntermediateCode.Type;
  3114. next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3115. size: LONGINT;
  3116. BEGIN
  3117. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3118. dest := destination; destination := emptyOperand;
  3119. leftType := x.left.type.resolved;
  3120. rightType := x.right.type.resolved;
  3121. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3122. CASE x.operator OF
  3123. Scanner.Or:
  3124. (* shortcut evaluation of left OR right *)
  3125. IF ~conditional THEN ConditionToValue(x);
  3126. ELSE
  3127. next := NewLabel();
  3128. Condition(x.left,trueLabel,next);
  3129. SetLabel(next);
  3130. Condition(x.right,trueLabel,falseLabel);
  3131. END;
  3132. |Scanner.And:
  3133. (* shortcut evaluation of left & right *)
  3134. IF ~conditional THEN ConditionToValue(x);
  3135. ELSE
  3136. next := NewLabel();
  3137. Condition(x.left,next,falseLabel);
  3138. SetLabel(next);
  3139. Condition(x.right,trueLabel,falseLabel);
  3140. END;
  3141. |Scanner.Is:
  3142. IF ~conditional THEN ConditionToValue(x);
  3143. ELSE
  3144. (* get type desc tag *)
  3145. IF IsPointerToRecord(leftType,recordType) THEN
  3146. Evaluate(x.left,left);
  3147. Dereference(left,recordType,IsUnsafePointer(leftType))
  3148. ELSE
  3149. Designate(x.left,left);
  3150. END;
  3151. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel,FALSE);
  3152. ReleaseOperand(left);
  3153. END;
  3154. |Scanner.Plus:
  3155. Evaluate(x.left,left);
  3156. Evaluate(x.right,right);
  3157. IF leftType IS SyntaxTree.SetType THEN
  3158. InitOperand(result,ModeValue);
  3159. Reuse2a(result.op,left.op,right.op,dest);
  3160. Emit(Or(position,result.op,left.op,right.op));
  3161. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3162. InitOperand(result,ModeValue);
  3163. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3164. Reuse2(result.tag,left.tag,right.tag);
  3165. Emit(Add(position,result.op,left.op,right.op));
  3166. Emit(Add(position,result.tag,left.tag,right.tag))
  3167. ELSE
  3168. InitOperand(result,ModeValue);
  3169. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3170. AddInt(result.op, left.op, right.op) ;
  3171. ELSE
  3172. *)
  3173. Reuse2a(result.op,left.op,right.op,dest);
  3174. Emit(Add(position,result.op,left.op,right.op));
  3175. (*
  3176. END;
  3177. *)
  3178. END;
  3179. ReleaseOperand(left); ReleaseOperand(right);
  3180. |Scanner.Minus:
  3181. Evaluate(x.left,left);
  3182. Evaluate(x.right,right);
  3183. IF leftType IS SyntaxTree.SetType THEN
  3184. InitOperand(result,ModeValue);
  3185. Reuse1(result.op,right.op);
  3186. Emit(Not(position,result.op,right.op));
  3187. ReleaseOperand(right);
  3188. Emit(And(position,result.op,result.op,left.op));
  3189. ReleaseOperand(left);
  3190. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3191. InitOperand(result,ModeValue);
  3192. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3193. Reuse2(result.tag,left.tag,right.tag);
  3194. Emit(Sub(position,result.op,left.op,right.op));
  3195. Emit(Sub(position,result.tag,left.tag,right.tag));
  3196. ReleaseOperand(left); ReleaseOperand(right)
  3197. ELSE
  3198. InitOperand(result,ModeValue);
  3199. Reuse2a(result.op,left.op,right.op,dest);
  3200. Emit(Sub(position,result.op,left.op,right.op));
  3201. ReleaseOperand(left); ReleaseOperand(right);
  3202. END;
  3203. |Scanner.Times:
  3204. Evaluate(x.left,left);
  3205. Evaluate(x.right,right);
  3206. IF leftType IS SyntaxTree.SetType THEN
  3207. InitOperand(result,ModeValue);
  3208. Reuse2a(result.op,left.op,right.op,dest);
  3209. Emit(And(position,result.op,left.op,right.op));
  3210. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3211. InitOperand(result, ModeValue);
  3212. componentType := left.op.type;
  3213. (* TODO: review this *)
  3214. (*
  3215. result.op = left.op * right.op - left.tag * right.tag
  3216. result.tag = left.tag * right.op + left.op * right.tag
  3217. *)
  3218. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3219. Emit(Mul(position,result.op, left.op, right.op));
  3220. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3221. Emit(Mul(position,tempReg, left.tag, right.tag));
  3222. Emit(Sub(position,result.op, result.op, tempReg));
  3223. Reuse2(result.tag, left.tag, right.op);
  3224. Emit(Mul(position,result.tag, left.tag, right.op));
  3225. Emit(Mul(position,tempReg, left.op, right.tag));
  3226. Emit(Add(position,result.tag, result.tag, tempReg));
  3227. ReleaseIntermediateOperand(tempReg)
  3228. ELSE
  3229. InitOperand(result,ModeValue);
  3230. Reuse2a(result.op,left.op,right.op,dest);
  3231. Emit(Mul(position,result.op,left.op,right.op));
  3232. END;
  3233. ReleaseOperand(left); ReleaseOperand(right);
  3234. |Scanner.Div:
  3235. Evaluate(x.left,left);
  3236. Evaluate(x.right,right);
  3237. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3238. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3239. IF ~isUnchecked THEN
  3240. exit := NewLabel();
  3241. BrltL(exit,zero,right.op);
  3242. EmitTrap(position,NegativeDivisorTrap);
  3243. SetLabel(exit);
  3244. END;
  3245. END;
  3246. InitOperand(result,ModeValue);
  3247. Reuse2a(result.op,left.op,right.op,dest);
  3248. Emit(Div(position,result.op,left.op,right.op));
  3249. ReleaseOperand(left); ReleaseOperand(right);
  3250. |Scanner.Mod:
  3251. Evaluate(x.left,left);
  3252. Evaluate(x.right,right);
  3253. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3254. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3255. IF ~isUnchecked THEN
  3256. exit := NewLabel();
  3257. BrltL(exit,zero,right.op);
  3258. EmitTrap(position,NegativeDivisorTrap);
  3259. SetLabel(exit);
  3260. END;
  3261. END;
  3262. InitOperand(result,ModeValue);
  3263. Reuse2a(result.op,left.op,right.op,dest);
  3264. Emit(Mod(position,result.op,left.op,right.op));
  3265. ReleaseOperand(left); ReleaseOperand(right);
  3266. |Scanner.Slash:
  3267. Evaluate(x.left,left);
  3268. Evaluate(x.right,right);
  3269. IF leftType IS SyntaxTree.SetType THEN
  3270. InitOperand(result,ModeValue);
  3271. Reuse2a(result.op,left.op,right.op,dest);
  3272. Emit(Xor(position,result.op,left.op,right.op));
  3273. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3274. InitOperand(result,ModeValue);
  3275. componentType := left.op.type;
  3276. (* review this *)
  3277. (*
  3278. divisor = right.op * right.op + right.tag * right.tag
  3279. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3280. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3281. *)
  3282. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3283. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3284. Emit(Mul(position,tempReg, right.op, right.op));
  3285. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3286. Emit(Add(position,tempReg, tempReg, tempReg2));
  3287. result.op := tempReg2;
  3288. Emit(Mul(position,result.op, left.op, right.op));
  3289. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3290. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3291. Emit(Add(position,result.op, result.op, tempReg2));
  3292. Emit(Div(position,result.op, result.op, tempReg));
  3293. Reuse2(result.tag, left.tag, right.op);
  3294. Emit(Mul(position,result.tag, left.tag, right.op));
  3295. Emit(Mul(position,tempReg2, left.op, right.tag));
  3296. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3297. Emit(Div(position,result.tag, result.tag, tempReg));
  3298. ReleaseIntermediateOperand(tempReg);
  3299. ReleaseIntermediateOperand(tempReg2)
  3300. ELSE
  3301. InitOperand(result,ModeValue);
  3302. Reuse2a(result.op,left.op,right.op,dest);
  3303. Emit(Div(position,result.op,left.op,right.op));
  3304. END;
  3305. ReleaseOperand(left); ReleaseOperand(right);
  3306. |Scanner.Equal:
  3307. IF ~conditional THEN ConditionToValue(x);
  3308. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3309. CompareString(BreqL,x.left,x.right);
  3310. ELSE
  3311. Evaluate(x.left,left);
  3312. Evaluate(x.right,right);
  3313. IF leftType IS SyntaxTree.RangeType THEN
  3314. ASSERT(rightType IS SyntaxTree.RangeType);
  3315. BrneL(falseLabel, left.op, right.op); (* first *)
  3316. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3317. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3318. ReleaseOperand(left); ReleaseOperand(right);
  3319. BrL(trueLabel)
  3320. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3321. BrneL(falseLabel, left.op, right.op); (* first *)
  3322. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3323. ReleaseOperand(left); ReleaseOperand(right);
  3324. BrL(trueLabel)
  3325. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3326. (* TODO: review this *)
  3327. BrneL(falseLabel, left.op, right.op); (* real part *)
  3328. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3329. ReleaseOperand(left); ReleaseOperand(right);
  3330. BrL(trueLabel)
  3331. ELSE
  3332. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3333. ReleaseOperand(left); ReleaseOperand(right);
  3334. BrL(trueLabel);
  3335. END;
  3336. END;
  3337. |Scanner.LessEqual:
  3338. IF ~conditional THEN ConditionToValue(x);
  3339. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3340. CompareString(BrgeL,x.right,x.left);
  3341. ELSE
  3342. Evaluate(x.left,left);
  3343. Evaluate(x.right,right);
  3344. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3345. Reuse1(temp.op,right.op);
  3346. Emit(And(position,temp.op,left.op,right.op));
  3347. ReleaseOperand(right);
  3348. BreqL(trueLabel,temp.op,left.op);
  3349. BrL(falseLabel);
  3350. ReleaseOperand(temp);ReleaseOperand(left);
  3351. ELSE
  3352. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3353. ReleaseOperand(left); ReleaseOperand(right);
  3354. BrL(trueLabel);
  3355. END;
  3356. END;
  3357. |Scanner.Less:
  3358. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3359. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3360. leftExpression.SetType(system.booleanType);
  3361. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3362. rightExpression.SetType(system.booleanType);
  3363. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3364. leftExpression.SetType(system.booleanType);
  3365. Expression(leftExpression);
  3366. ELSIF ~conditional THEN ConditionToValue(x);
  3367. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3368. CompareString(BrltL,x.left,x.right);
  3369. ELSE
  3370. Evaluate(x.left,left);
  3371. Evaluate(x.right,right);
  3372. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3373. ReleaseOperand(left); ReleaseOperand(right);
  3374. BrL(trueLabel);
  3375. END;
  3376. |Scanner.Greater:
  3377. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3378. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3379. leftExpression.SetType(system.booleanType);
  3380. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3381. rightExpression.SetType(system.booleanType);
  3382. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3383. leftExpression.SetType(system.booleanType);
  3384. Expression(leftExpression);
  3385. ELSIF ~conditional THEN ConditionToValue(x);
  3386. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3387. CompareString(BrltL,x.right,x.left);
  3388. ELSE
  3389. Evaluate(x.left,left);
  3390. Evaluate(x.right,right);
  3391. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3392. ReleaseOperand(left); ReleaseOperand(right);
  3393. BrL(trueLabel);
  3394. END;
  3395. |Scanner.GreaterEqual:
  3396. IF ~conditional THEN ConditionToValue(x);
  3397. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3398. CompareString(BrgeL,x.left,x.right);
  3399. ELSE
  3400. Evaluate(x.left,left);
  3401. Evaluate(x.right,right);
  3402. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3403. Reuse1(temp.op,left.op);
  3404. Emit(And(position,temp.op,left.op,right.op));
  3405. ReleaseOperand(left);
  3406. BreqL(trueLabel, temp.op,right.op);
  3407. ReleaseOperand(temp); ReleaseOperand(right);
  3408. BrL(falseLabel);
  3409. ELSE
  3410. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3411. ReleaseOperand(left); ReleaseOperand(right);
  3412. BrL(trueLabel);
  3413. END;
  3414. END;
  3415. |Scanner.Unequal:
  3416. IF ~conditional THEN ConditionToValue(x);
  3417. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3418. CompareString(BrneL,x.left,x.right);
  3419. ELSE
  3420. Evaluate(x.left,left);
  3421. Evaluate(x.right,right);
  3422. IF leftType IS SyntaxTree.RangeType THEN
  3423. ASSERT(rightType IS SyntaxTree.RangeType);
  3424. BrneL(trueLabel, left.op, right.op); (* first *)
  3425. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3426. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3427. ReleaseOperand(left); ReleaseOperand(right);
  3428. BrL(falseLabel)
  3429. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3430. BrneL(trueLabel, left.op, right.op); (* first *)
  3431. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3432. ReleaseOperand(left); ReleaseOperand(right);
  3433. BrL(falseLabel)
  3434. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3435. (* TODO: review this *)
  3436. BrneL(trueLabel, left.op, right.op); (* real part *)
  3437. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3438. ReleaseOperand(left); ReleaseOperand(right);
  3439. BrL(falseLabel)
  3440. ELSE
  3441. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3442. ReleaseOperand(left); ReleaseOperand(right);
  3443. BrL(trueLabel);
  3444. END;
  3445. END;
  3446. |Scanner.In:
  3447. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3448. Evaluate(x.left,left);
  3449. Evaluate(x.right,right);
  3450. Convert(left.op,setType);
  3451. Convert(right.op,setType);
  3452. ReuseCopy(temp.op,right.op);
  3453. Emit(Shr(position,temp.op,temp.op,left.op));
  3454. ReleaseOperand(right); ReleaseOperand(left);
  3455. IntermediateCode.InitImmediate(one,setType,1);
  3456. Emit(And(position,temp.op,temp.op,one));
  3457. IF conditional THEN
  3458. IntermediateCode.InitImmediate(zero,setType,0);
  3459. BrneL(trueLabel,temp.op,zero);
  3460. ReleaseOperand(temp);
  3461. BrL(falseLabel);
  3462. ELSE
  3463. Convert(temp.op,bool);
  3464. result.mode := ModeValue;
  3465. result.op := temp.op;
  3466. result.tag := nil; (* may be left over from calls to evaluate *)
  3467. END;
  3468. ELSE
  3469. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3470. IF x.operator = Scanner.Questionmarks THEN
  3471. leftExpression := x.left;
  3472. rightExpression := x.right;
  3473. ELSE
  3474. leftExpression := x.right;
  3475. rightExpression := x.left;
  3476. END;
  3477. Evaluate(leftExpression, left);
  3478. Emit(Push(position,left.op));
  3479. ReleaseOperand(left);
  3480. Designate(rightExpression, right);
  3481. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3482. IF ~backend.cellsAreObjects THEN
  3483. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3484. END;
  3485. Emit(Push(position,right.op));
  3486. ReleaseOperand(right);
  3487. IF backend.cellsAreObjects THEN
  3488. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3489. ELSE
  3490. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3491. END;
  3492. InitOperand(result, ModeValue);
  3493. result.op := NewRegisterOperand(bool);
  3494. Emit(Result(position,result.op));
  3495. IF conditional THEN
  3496. IntermediateCode.InitImmediate(zero,setType,0);
  3497. BrneL(trueLabel,result.op,zero);
  3498. ReleaseOperand(result);
  3499. BrL(falseLabel);
  3500. END;
  3501. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3502. leftExpression := x.left;
  3503. rightExpression := x.right;
  3504. Evaluate(leftExpression, left);
  3505. Emit(Push(position,left.op));
  3506. ReleaseOperand(left);
  3507. Evaluate(rightExpression, right);
  3508. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3509. IF ~backend.cellsAreObjects THEN
  3510. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3511. END;
  3512. Emit(Push(position,right.op));
  3513. ReleaseOperand(right);
  3514. IF backend.cellsAreObjects THEN
  3515. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3516. ELSE
  3517. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3518. END;
  3519. InitOperand(result, ModeValue);
  3520. result.op := NewRegisterOperand(bool);
  3521. Emit(Result(position,result.op));
  3522. IF conditional THEN
  3523. IntermediateCode.InitImmediate(zero,setType,0);
  3524. BrneL(trueLabel,result.op,zero);
  3525. ReleaseOperand(result);
  3526. BrL(falseLabel);
  3527. END;
  3528. ELSE
  3529. HALT(100);
  3530. END;
  3531. END;
  3532. destination := dest;
  3533. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3534. END VisitBinaryExpression;
  3535. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3536. VAR localResult, operand: Operand;
  3537. BEGIN
  3538. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3539. InitOperand(localResult, ModeValue);
  3540. ASSERT(x.first # NIL);
  3541. Evaluate(x.first, operand);
  3542. localResult.op := operand.op;
  3543. ReleaseOperand(operand);
  3544. UseIntermediateOperand(localResult.op);
  3545. ASSERT(x.last # NIL);
  3546. Evaluate(x.last, operand);
  3547. localResult.tag := operand.op;
  3548. ReleaseOperand(operand);
  3549. UseIntermediateOperand(localResult.tag);
  3550. IF x.step # NIL THEN
  3551. Evaluate(x.step, operand);
  3552. localResult.extra := operand.op;
  3553. ReleaseOperand(operand);
  3554. UseIntermediateOperand(localResult.extra);
  3555. END;
  3556. result := localResult;
  3557. IF Trace THEN TraceExit("VisitRangeExpression") END
  3558. END VisitRangeExpression;
  3559. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3560. BEGIN
  3561. HALT(100); (* should never be evaluated *)
  3562. END VisitTensorRangeExpression;
  3563. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3564. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3565. BEGIN
  3566. IF Trace THEN TraceEnter("VisitConversion") END;
  3567. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3568. dest := destination; destination := emptyOperand;
  3569. Evaluate(x.expression,old);
  3570. InitOperand(result,ModeValue);
  3571. result.op := old.op;
  3572. ASSERT(result.op.mode # 0);
  3573. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3574. (* convert TO a complex number *)
  3575. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3576. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3577. ASSERT(result.op.mode # 0);
  3578. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3579. (* convert FROM a complex number TO a complex number*)
  3580. result.tag := old.tag;
  3581. ASSERT(result.tag.mode # 0);
  3582. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3583. ASSERT(result.tag.mode # 0)
  3584. ELSE
  3585. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3586. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3587. END
  3588. ELSE
  3589. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3590. ASSERT(result.op.mode # 0);
  3591. result.tag := old.tag; (*! probably never used *)
  3592. END;
  3593. destination := dest;
  3594. IF Trace THEN TraceExit("VisitConversion") END;
  3595. END VisitConversion;
  3596. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3597. BEGIN
  3598. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3599. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3600. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3601. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3602. END VisitTypeDeclaration;
  3603. (** designators (expressions) *)
  3604. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3605. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3606. BEGIN
  3607. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3608. IF x.left # NIL THEN Expression(x.left) END;
  3609. Symbol(x.symbol,result);
  3610. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3611. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3612. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3613. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3614. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3615. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3616. END;
  3617. END;
  3618. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3619. END VisitSymbolDesignator;
  3620. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3621. BEGIN
  3622. IF isUnchecked THEN RETURN END;
  3623. IF tagsAvailable THEN
  3624. TrapC(BrltL,index,length,IndexCheckTrap);
  3625. END;
  3626. END BoundCheck;
  3627. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3628. VAR d: IntermediateCode.Operand;
  3629. BEGIN
  3630. IF isUnchecked THEN RETURN END;
  3631. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3632. TrapC(op,dim,d,ArraySizeTrap);
  3633. ReleaseIntermediateOperand(d);
  3634. END DimensionCheck;
  3635. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3636. VAR
  3637. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3638. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3639. expression: SyntaxTree.Expression;
  3640. resultingType, leftType, baseType: SyntaxTree.Type;
  3641. skipLabel1: Label;
  3642. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3643. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3644. variableOp: Operand;
  3645. variable: SyntaxTree.Variable;
  3646. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3647. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3648. VAR e: SyntaxTree.Expression; i: LONGINT;
  3649. BEGIN
  3650. tensorFound := FALSE;
  3651. FOR i := 0 TO parameters.Length()-1 DO
  3652. e := parameters.GetExpression(i);
  3653. IF e IS SyntaxTree.TensorRangeExpression THEN
  3654. ASSERT(~tensorFound);
  3655. tensorFound := TRUE;
  3656. ELSIF e IS SyntaxTree.RangeExpression THEN
  3657. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3658. ELSE
  3659. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3660. END;
  3661. END;
  3662. END CountIndices;
  3663. BEGIN
  3664. ASSERT(tagsAvailable);
  3665. resultingType := x.type.resolved; (* resulting type *)
  3666. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3667. InitOperand(localResult, ModeReference);
  3668. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3669. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3670. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3671. (* a globally defined array destination tag is available -> use and invalidate it*)
  3672. localResult.tag := arrayDestinationTag;
  3673. IntermediateCode.InitOperand(arrayDestinationTag)
  3674. ELSE
  3675. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3676. (* the result is of array range type and thus does not provide any collectable pointers *)
  3677. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3678. Symbol(variable, variableOp);
  3679. ReuseCopy(localResult.tag, variableOp.op);
  3680. ReleaseOperand(variableOp);
  3681. END
  3682. END;
  3683. indexListSize := x.parameters.Length();
  3684. CountIndices(x.parameters);
  3685. (*ASSERT(tensorRangeCount <= 1);*)
  3686. (* designate the array to be indexed over, perform tensor range check if known *)
  3687. Designate(x.left, array);
  3688. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3689. Dereference(array, leftType,FALSE);
  3690. IF ~tensorFound THEN
  3691. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3692. END
  3693. END;
  3694. (* default base offset *)
  3695. srcDimOffset := 0;
  3696. destDimOffset := 0;
  3697. indexDim := 0;
  3698. (* use address of source array as basis *)
  3699. localResult.op := array.op;
  3700. UseIntermediateOperand(localResult.op);
  3701. (* go through the index list *)
  3702. FOR i := 0 TO indexListSize - 1 DO
  3703. expression := x.parameters.GetExpression(i);
  3704. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3705. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3706. srcDimOffset := -indexListSize;
  3707. destDimOffset := -suffixRanges;
  3708. ELSE
  3709. (* determine which dimension of source array is currently looked at *)
  3710. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3711. (* get the memory operand pointing to array descriptor dimension *)
  3712. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3713. (* make a reusable register from it *)
  3714. ReuseCopy(srcDim, tmp);
  3715. ReleaseIntermediateOperand(tmp);
  3716. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3717. ELSE
  3718. srcDim := IntermediateCode.Immediate(sizeType, i);
  3719. END;
  3720. (* get length and increment of source array for current dimension *)
  3721. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3722. Convert(sourceLength.op, sizeType);
  3723. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3724. Convert(sourceIncrement.op, sizeType);
  3725. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3726. ReleaseIntermediateOperand(srcDim);
  3727. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3728. (* SINGLE INDEX *)
  3729. Evaluate(expression, index);
  3730. ReleaseIntermediateOperand(index.tag);
  3731. index.tag := emptyOperand;
  3732. Convert(index.op, sizeType);
  3733. (* lower bound check *)
  3734. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3735. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3736. ELSIF isUnchecked THEN (* do nothing *)
  3737. ELSE
  3738. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3739. END;
  3740. (* upper bound check *)
  3741. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3742. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3743. ELSIF isUnchecked THEN (* do nothing *)
  3744. ELSE
  3745. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3746. END;
  3747. ReleaseOperand(sourceLength);
  3748. Convert(index.op, addressType);
  3749. summand := index.op;
  3750. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3751. (* RANGE OF INDICES *)
  3752. Evaluate(expression, range);
  3753. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3754. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3755. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3756. ReleaseOperand(range);
  3757. Convert(firstIndex, sizeType);
  3758. Convert(lastIndex, sizeType);
  3759. Convert(stepSize, sizeType);
  3760. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3761. if it is 'MAX(LONGINT)' *)
  3762. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3763. TransferToRegister(lastIndex, lastIndex);
  3764. skipLabel1 := NewLabel();
  3765. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3766. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3767. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3768. SetLabel(skipLabel1)
  3769. END;
  3770. (* check if step size is valid *)
  3771. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3772. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3773. ELSIF isUnchecked THEN (* do nothing *)
  3774. ELSE
  3775. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3776. END;
  3777. (* check lower bound check *)
  3778. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3779. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3780. ELSIF isUnchecked THEN (* do nothing *)
  3781. ELSE
  3782. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3783. END;
  3784. (* check upper bound check *)
  3785. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3786. (* statically open range: nothing to do *)
  3787. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3788. ASSERT(staticLastIndex < staticSourceLength)
  3789. ELSIF isUnchecked THEN (* do nothing *)
  3790. ELSE
  3791. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3792. END;
  3793. (* determine length of target array for current dimension *)
  3794. (* 1. incorporate last index: *)
  3795. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3796. (* last index is static *)
  3797. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3798. targetLength := sourceLength.op
  3799. ELSE
  3800. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3801. END;
  3802. UseIntermediateOperand(targetLength);
  3803. ELSE
  3804. (* targetLength := lastIndex + 1
  3805. Reuse1(targetLength, lastIndex);
  3806. *)
  3807. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3808. END;
  3809. ReleaseOperand(sourceLength);
  3810. ReleaseIntermediateOperand(lastIndex);
  3811. (* 2. incorporate first index: *)
  3812. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3813. (* first index and current target length are static *)
  3814. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3815. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3816. (* first index = 0: nothing to do *)
  3817. ELSE
  3818. (* targetLength := targetLength - firstIndex *)
  3819. TransferToRegister(targetLength, targetLength);
  3820. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3821. END;
  3822. (* clip negative lengths to 0 *)
  3823. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3824. IF staticTargetLength < 0 THEN
  3825. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3826. END
  3827. ELSE
  3828. skipLabel1 := NewLabel();
  3829. TransferToRegister(targetLength, targetLength);
  3830. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3831. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3832. SetLabel(skipLabel1)
  3833. END;
  3834. (* 3. incorporate index step size: *)
  3835. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3836. (*step size and current target length are static *)
  3837. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3838. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3839. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3840. (* step size = 1: nothing to do *)
  3841. ELSE
  3842. (* emit code for this:
  3843. targetLength := (targetLength-1) DIV stepSize +1;
  3844. *)
  3845. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3846. DivInt(targetLength, targetLength, stepSize);
  3847. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3848. END;
  3849. (* determine increment of target array for current dimension *)
  3850. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3851. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3852. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3853. (* step size = 1 *)
  3854. targetIncrement := sourceIncrement.op;
  3855. UseIntermediateOperand(targetIncrement)
  3856. ELSE
  3857. (* targetIncrement := sourceIncrement * stepSize *)
  3858. Reuse1(targetIncrement, stepSize);
  3859. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3860. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3861. END;
  3862. ReleaseIntermediateOperand(stepSize);
  3863. (* write length and increment of target array to descriptor *)
  3864. IF destDimOffset < 0 THEN
  3865. (* determine which dimension of target array is currently looked at *)
  3866. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3867. TransferToRegister(destDim, tmp);
  3868. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3869. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3870. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3871. ReleaseIntermediateOperand(destDim);
  3872. INC(destDimOffset);
  3873. ELSE
  3874. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3875. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3876. END;
  3877. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3878. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3879. INC(indexDim);
  3880. Convert(firstIndex, addressType);
  3881. TransferToRegister(summand, firstIndex);
  3882. ELSE HALT(100);
  3883. END;
  3884. (*
  3885. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3886. *)
  3887. Convert(sourceIncrement.op, addressType);
  3888. Convert(summand, addressType);
  3889. MulInt(summand, summand, sourceIncrement.op);
  3890. ReleaseIntermediateOperand(sourceIncrement.op);
  3891. AddInt(localResult.op, localResult.op, summand);
  3892. ReleaseIntermediateOperand(summand);
  3893. END
  3894. END;
  3895. result := localResult;
  3896. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3897. ReleaseIntermediateOperand(result.tag);
  3898. result.tag := TypeDescriptorAdr(resultingType);
  3899. ELSIF IsDelegate(resultingType) THEN
  3900. ReleaseIntermediateOperand(result.tag);
  3901. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3902. UseIntermediateOperand(result.tag);
  3903. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3904. ReleaseIntermediateOperand(result.tag);
  3905. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3906. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3907. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3908. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3909. (* finalize target array descriptor *)
  3910. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3911. (* write lengths and increments of target array for remaining dimensions *)
  3912. i := indexListSize;
  3913. WHILE indexDim < targetArrayDimensionality DO
  3914. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3915. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3916. ReleaseOperand(sourceLength);
  3917. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3918. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3919. ReleaseOperand(sourceIncrement);
  3920. INC(i); INC(indexDim);
  3921. END;
  3922. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3923. tmp := nil;
  3924. ELSE
  3925. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3926. END;
  3927. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3928. ReleaseIntermediateOperand(tmp);
  3929. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3930. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3931. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3932. ELSE
  3933. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3934. END;
  3935. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3936. ReleaseIntermediateOperand(tmp);
  3937. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3938. (* write dimensionality *)
  3939. IF targetArrayDimensionality # 0 THEN
  3940. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3941. END;
  3942. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3943. END;
  3944. ReleaseOperand(array);
  3945. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3946. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3947. END;
  3948. END MathIndexDesignator;
  3949. (* get the length of an array , trying to make use of static information *)
  3950. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3951. VAR res: IntermediateCode.Operand; size: LONGINT;
  3952. BEGIN
  3953. type := type.resolved;
  3954. IF type IS SyntaxTree.ArrayType THEN
  3955. WITH type: SyntaxTree.ArrayType DO
  3956. IF type.form = SyntaxTree.Static THEN
  3957. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3958. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3959. Evaluate(type.length, op);
  3960. ReleaseIntermediateOperand(op.tag);
  3961. RETURN op.op;*)
  3962. ELSE
  3963. res := tag;
  3964. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3965. IntermediateCode.MakeMemory(res,addressType);
  3966. UseIntermediateOperand(res);
  3967. RETURN res
  3968. END
  3969. END;
  3970. ELSE
  3971. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3972. RETURN IntermediateCode.Immediate(addressType,size);
  3973. END;
  3974. END ArrayLength;
  3975. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3976. BEGIN
  3977. IF IsImmediate(x) THEN
  3978. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3979. ELSE
  3980. IF ~ReusableRegister(res) THEN
  3981. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3982. ELSE
  3983. UseIntermediateOperand(res);
  3984. END;
  3985. Emit(Mov(position,res,x))
  3986. END;
  3987. END CopyInt;
  3988. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3989. BEGIN
  3990. ReleaseIntermediateOperand(res);
  3991. IF IsImmediate(x) & IsImmediate(y) THEN
  3992. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3993. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3994. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3995. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3996. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3997. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3998. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3999. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4000. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4001. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4002. UseIntermediateOperand(res);
  4003. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4004. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4005. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4006. UseIntermediateOperand(res);
  4007. ELSE
  4008. IF ~ReusableRegister(res) THEN
  4009. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4010. ELSE
  4011. UseIntermediateOperand(res);
  4012. END;
  4013. IF IsImmediate(x) & (x.intValue = 0) THEN
  4014. Emit(Mov(position,res,y))
  4015. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4016. Emit(Mov(position,res,x))
  4017. ELSE
  4018. Emit(Add(position,res, x, y));
  4019. END;
  4020. END;
  4021. END AddInt;
  4022. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4023. BEGIN
  4024. ReleaseIntermediateOperand(res);
  4025. IF IsImmediate(x) & IsImmediate(y) THEN
  4026. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4027. ELSE
  4028. IF ~ReusableRegister(res) THEN
  4029. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4030. ELSE UseIntermediateOperand(res);
  4031. END;
  4032. IF IsImmediate(x) & (x.intValue = 1) THEN
  4033. Emit(Mov(position,res,y))
  4034. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4035. Emit(Mov(position,res,x))
  4036. ELSE
  4037. Emit(Mul(position,res, x, y));
  4038. END;
  4039. END;
  4040. END MulInt;
  4041. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4042. BEGIN
  4043. ReleaseIntermediateOperand(res);
  4044. IF IsImmediate(x) & IsImmediate(y) THEN
  4045. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4046. ELSE
  4047. IF ~ReusableRegister(res) THEN
  4048. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4049. ELSE UseIntermediateOperand(res);
  4050. END;
  4051. IF IsImmediate(x) & (x.intValue = 1) THEN
  4052. Emit(Mov(position,res,y))
  4053. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4054. Emit(Mov(position,res,x))
  4055. ELSE
  4056. Emit(Div(position,res, x, y));
  4057. END;
  4058. END;
  4059. END DivInt;
  4060. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4061. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4062. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4063. BEGIN
  4064. type := x.left.type.resolved;
  4065. IF type IS SyntaxTree.StringType THEN
  4066. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4067. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4068. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4069. type := atype;
  4070. x.left.SetType(type);
  4071. END;
  4072. IntermediateCode.InitImmediate(res,addressType,0);
  4073. maxDim := x.parameters.Length()-1;
  4074. (*
  4075. computation rule:
  4076. a: ARRAY X,Y,Z OF Element with size S
  4077. a[i,j,k] -->
  4078. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4079. *)
  4080. FOR i := 0 TO maxDim DO
  4081. e := x.parameters.GetExpression(i);
  4082. Evaluate(e,index);
  4083. Convert(index.op,addressType);
  4084. AddInt(res, res, index.op);
  4085. IF i = 0 THEN
  4086. (*
  4087. ReuseCopy(res, index.op);
  4088. *)
  4089. Designate(x.left,array);
  4090. type := x.left.type.resolved;
  4091. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4092. Dereference(array, type, FALSE);
  4093. END;
  4094. (*
  4095. ELSE AddInt(res, res, index.op);
  4096. *)
  4097. END;
  4098. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4099. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4100. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4101. BoundCheck(index.op, length);
  4102. END;
  4103. ReleaseIntermediateOperand(length);
  4104. END;
  4105. ReleaseOperand(index);
  4106. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4107. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4108. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4109. MulInt(res,res,length);
  4110. END;
  4111. ReleaseIntermediateOperand(length);
  4112. END;
  4113. (* remaining open dimensions -- compute address *)
  4114. i := maxDim+1;
  4115. IF type IS SyntaxTree.ArrayType THEN
  4116. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4117. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4118. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4119. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4120. MulInt(res,res,length);
  4121. END;
  4122. ReleaseIntermediateOperand(length);
  4123. INC(i);
  4124. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4125. END;
  4126. END;
  4127. IF (type IS SyntaxTree.ArrayType) THEN
  4128. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4129. size := StaticSize(system, type);
  4130. IF size # 1 THEN
  4131. length := IntermediateCode.Immediate(addressType,size);
  4132. MulInt(res,res,length);
  4133. END;
  4134. ELSE
  4135. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4136. IF size # 1 THEN
  4137. length := IntermediateCode.Immediate(addressType,size);
  4138. MulInt(res,res,length);
  4139. END;
  4140. END;
  4141. END;
  4142. AddInt(res,res,array.op);
  4143. InitOperand(result,ModeReference);
  4144. result.op := res;
  4145. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4146. ReleaseIntermediateOperand(result.tag);
  4147. result.tag := TypeDescriptorAdr(type);
  4148. ELSIF IsDelegate(type) THEN
  4149. ReleaseIntermediateOperand(result.tag);
  4150. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4151. UseIntermediateOperand(result.tag);
  4152. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4153. ReleaseIntermediateOperand(result.tag);
  4154. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4155. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4156. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4157. END;
  4158. ReleaseOperand(array);
  4159. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4160. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4161. END;
  4162. END IndexDesignator;
  4163. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4164. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4165. BEGIN
  4166. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4167. dest := destination; destination := emptyOperand;
  4168. type := x.left.type.resolved;
  4169. IF type IS SyntaxTree.MathArrayType THEN
  4170. MathIndexDesignator(x);
  4171. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4172. IndexDesignator(x);
  4173. END;
  4174. destination := dest;
  4175. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4176. END VisitIndexDesignator;
  4177. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4178. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4179. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4180. procedure: SyntaxTree.Procedure;
  4181. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4182. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4183. BEGIN
  4184. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4185. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4186. parameters := expression.parameters;
  4187. moduleName := "FoxArrayBase";
  4188. procedureName := "CopyDescriptor";
  4189. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4190. SaveRegisters();ReleaseUsedRegisters(saved);
  4191. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4192. IF procedure = NIL THEN
  4193. s := "procedure ";
  4194. Strings.Append(s,moduleName);
  4195. Strings.Append(s,".");
  4196. Strings.Append(s,procedureName);
  4197. Strings.Append(s," not present");
  4198. Error(position,s);
  4199. ELSE
  4200. (* push address of temporary variable *)
  4201. Symbol(variable,destOperand);
  4202. Emit(Push(position,destOperand.op));
  4203. ReleaseOperand(destOperand);
  4204. (* push src *)
  4205. Evaluate(expression.left,srcOperand);
  4206. (*
  4207. Dereference(srcOperand,expression.type.resolved);
  4208. Emit(Push(position,srcOperand.tag));
  4209. *)
  4210. Emit(Push(position,srcOperand.op));
  4211. ReleaseOperand(srcOperand);
  4212. tensorFound := FALSE;
  4213. FOR i := 0 TO parameters.Length()-1 DO
  4214. e := parameters.GetExpression(i);
  4215. IF e IS SyntaxTree.TensorRangeExpression THEN
  4216. tensorFound := TRUE;
  4217. ELSIF e IS SyntaxTree.RangeExpression THEN
  4218. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4219. ELSE
  4220. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4221. END;
  4222. END;
  4223. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4224. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4225. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4226. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4227. StaticCallOperand(procOp,procedure);
  4228. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4229. ReleaseOperand(procOp);
  4230. END;
  4231. RestoreRegisters(saved);
  4232. END;
  4233. RETURN variable
  4234. END PrepareTensorDescriptor;
  4235. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4236. VAR
  4237. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4238. operand, tmpOperand, variableOp, variable2Op: Operand;
  4239. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4240. variable, variable2: SyntaxTree.Variable;
  4241. dim, i, size: LONGINT;
  4242. (* TODO: needed? *)
  4243. oldArrayDestinationTag: IntermediateCode.Operand;
  4244. oldArrayDestinationDimension: LONGINT;
  4245. position: Position;
  4246. saved: RegisterEntry;
  4247. arrayFlags: SET;
  4248. m, n: LONGINT;
  4249. PROCEDURE Pass(op: IntermediateCode.Operand);
  4250. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4251. BEGIN
  4252. IF register >= 0 THEN
  4253. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4254. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4255. Emit(Mov(position,parameterRegister, op));
  4256. ELSE
  4257. Emit(Push(position,op))
  4258. END
  4259. END Pass;
  4260. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4261. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4262. BEGIN
  4263. formalType := formalType.resolved; actualType := actualType.resolved;
  4264. IF IsOpenArray(formalType)THEN
  4265. IF actualType IS SyntaxTree.StringType THEN
  4266. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4267. RETURN;
  4268. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4269. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4270. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4271. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4272. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4273. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4274. ELSE
  4275. tmp := baseReg;
  4276. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4277. IntermediateCode.MakeMemory(tmp,addressType);
  4278. Pass((tmp));
  4279. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4280. END;
  4281. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4282. END;
  4283. END PushArrayLens;
  4284. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4285. BEGIN
  4286. CASE size OF
  4287. |2: INCL(flags,Size2Flag);
  4288. |3: INCL(flags,Size3Flag);
  4289. |4: INCL(flags,Size4Flag);
  4290. |5: INCL(flags,Size5Flag);
  4291. |6: INCL(flags,Size6Flag);
  4292. |7: INCL(flags,Size7Flag);
  4293. |8: INCL(flags,Size8Flag);
  4294. END;
  4295. END SetSmallArraySizeFlag;
  4296. BEGIN
  4297. IF Trace THEN TraceEnter("PushParameter") END;
  4298. position := expression.position;
  4299. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4300. type := expression.type.resolved;
  4301. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4302. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4303. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4304. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4305. );
  4306. (* TODO: needed? *)
  4307. oldArrayDestinationTag := arrayDestinationTag;
  4308. oldArrayDestinationDimension := arrayDestinationDimension;
  4309. IF IsArrayOfSystemByte(parameter.type) THEN
  4310. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4311. Designate(expression,operand);
  4312. ELSE
  4313. Evaluate(expression, tmpOperand);
  4314. (* array of system byte does not provide any pointers *)
  4315. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4316. Symbol(variable, operand);
  4317. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4318. Emit(Mov(position,tmp, tmpOperand.op));
  4319. ReleaseOperand(tmpOperand);
  4320. END;
  4321. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4322. ReleaseIntermediateOperand(operand.tag);
  4323. operand.tag := tmp;
  4324. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4325. Pass((operand.tag));
  4326. END;
  4327. Pass((operand.op));
  4328. ELSIF IsOpenArray(parameter.type) THEN
  4329. Designate(expression,operand);
  4330. baseReg := operand.tag;
  4331. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4332. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4333. END;
  4334. Pass((operand.op)); (* address of the array *)
  4335. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4336. (* case 1
  4337. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4338. *)
  4339. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4340. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4341. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4342. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4343. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4344. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4345. arrayDestinationTag := sp;
  4346. (* case 1b
  4347. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4348. *)
  4349. IF expression IS SyntaxTree.IndexDesignator THEN
  4350. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4351. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4352. arrayDestinationDimension := dim;
  4353. Designate(expression,operand);
  4354. (* case 1a
  4355. P(...,A,...) push: push array descriptor to stack
  4356. *)
  4357. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4358. Designate(expression,operand);
  4359. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4360. i := 0;
  4361. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4362. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4363. INC(i);
  4364. END;
  4365. type := expression.type.resolved;
  4366. WHILE (i<dim) DO (* remaining static dimensions *)
  4367. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4368. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4369. ReleaseOperand(tmpOperand);
  4370. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4371. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4372. ReleaseOperand(tmpOperand);
  4373. INC(i);
  4374. END;
  4375. dimOp := IntermediateCode.Immediate(addressType,dim);
  4376. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4377. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4378. (* case 1d
  4379. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4380. + case 1e
  4381. P(.. PT() ... );
  4382. *)
  4383. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4384. Designate(expression,operand);
  4385. Dereference(operand,type.resolved,FALSE);
  4386. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4387. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4388. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4389. (* case 1f
  4390. P(...,S,...) push: create array descriptor to S on stack
  4391. case 1g
  4392. P(... PS()...)
  4393. *)
  4394. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4395. Designate(expression,operand);
  4396. FOR i := 0 TO dim-1 DO
  4397. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4398. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4399. ReleaseOperand(tmpOperand);
  4400. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4401. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4402. ReleaseOperand(tmpOperand);
  4403. END;
  4404. (*******
  4405. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4406. *)
  4407. arrayFlags := {StaticFlag};
  4408. IF dim = 1 THEN
  4409. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4410. ReleaseOperand(tmpOperand);
  4411. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4412. m := LONGINT(tmpOperand.op.intValue);
  4413. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4414. ELSIF dim = 2 THEN
  4415. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4416. ReleaseOperand(tmpOperand);
  4417. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4418. m := LONGINT(tmpOperand.op.intValue);
  4419. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4420. ReleaseOperand(tmpOperand);
  4421. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4422. n := LONGINT(tmpOperand.op.intValue);
  4423. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4424. INCL(arrayFlags,SmallMatrixFlag);
  4425. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4426. END;
  4427. END;
  4428. (*******)
  4429. dimOp := IntermediateCode.Immediate(addressType,dim);
  4430. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4431. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4432. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4433. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4434. baseType := SemanticChecker.ArrayBase(type,dim);
  4435. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4436. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4437. ELSE HALT(100);
  4438. END;
  4439. (* case 2
  4440. procedure P([left args], var A: array [*,*] of Type, [right args])
  4441. *)
  4442. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4443. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4444. (* case 2b
  4445. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4446. push: push reference to pushed array descriptor
  4447. post: remove array descriptor.
  4448. *)
  4449. IF expression IS SyntaxTree.IndexDesignator THEN
  4450. descriptorType := GetMathArrayDescriptorType(dim);
  4451. (* range type : no allocation possible, should be untraced *)
  4452. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4453. Symbol(variable,variableOp);
  4454. arrayDestinationTag := variableOp.op;
  4455. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4456. arrayDestinationDimension := dim;
  4457. NeedDescriptor := TRUE;
  4458. Designate(expression,operand);
  4459. Pass((operand.tag));
  4460. NeedDescriptor := FALSE;
  4461. (* case 2a
  4462. P(...,A,...)
  4463. push: push reference to array descriptor on stack
  4464. *)
  4465. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4466. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4467. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4468. INC(i);
  4469. END;
  4470. IF i = dim THEN
  4471. Designate(expression,operand);
  4472. Pass((operand.tag));
  4473. ELSE (* open-static *)
  4474. type := expression.type.resolved;
  4475. descriptorType := GetMathArrayDescriptorType(dim);
  4476. (* static array , cannot be reallocated, untraced !*)
  4477. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4478. Symbol(variable,variableOp);
  4479. arrayDestinationTag := variableOp.op;
  4480. Designate(expression,operand);
  4481. FOR i := 0 TO dim-1 DO
  4482. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4483. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4484. ReleaseOperand(tmpOperand);
  4485. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4486. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4487. ReleaseOperand(tmpOperand);
  4488. END;
  4489. dimOp := IntermediateCode.Immediate(addressType,dim);
  4490. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4491. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4492. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4493. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4494. baseType := SemanticChecker.ArrayBase(type,dim);
  4495. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4496. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4497. Pass((arrayDestinationTag));
  4498. END;
  4499. (* case 2d
  4500. P(...,T,...) push: emit dimension check, push T
  4501. *)
  4502. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4503. Designate(expression,operand);
  4504. Dereference(operand,type.resolved,FALSE);
  4505. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4506. Pass((operand.tag));
  4507. (* case 2f
  4508. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4509. push: push reference to pushed array descriptor
  4510. post: remove array descriptor
  4511. *)
  4512. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4513. descriptorType := GetMathArrayDescriptorType(dim);
  4514. (* static array -- cannot be reallocatated, untraced *)
  4515. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4516. Symbol(variable,variableOp);
  4517. arrayDestinationTag := variableOp.op;
  4518. Designate(expression,operand);
  4519. FOR i := 0 TO dim-1 DO
  4520. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4521. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4522. ReleaseOperand(tmpOperand);
  4523. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4524. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4525. ReleaseOperand(tmpOperand);
  4526. END;
  4527. (*
  4528. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4529. *)
  4530. arrayFlags := {StaticFlag};
  4531. IF dim = 1 THEN
  4532. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4533. ReleaseOperand(tmpOperand);
  4534. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4535. m := LONGINT(tmpOperand.op.intValue);
  4536. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4537. ELSIF dim = 2 THEN
  4538. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4539. ReleaseOperand(tmpOperand);
  4540. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4541. m := LONGINT(tmpOperand.op.intValue);
  4542. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4543. ReleaseOperand(tmpOperand);
  4544. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4545. n := LONGINT(tmpOperand.op.intValue);
  4546. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4547. INCL(arrayFlags,SmallMatrixFlag);
  4548. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4549. END;
  4550. END;
  4551. (*******)
  4552. dimOp := IntermediateCode.Immediate(addressType,dim);
  4553. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4554. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4555. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4556. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4557. baseType := SemanticChecker.ArrayBase(type,dim);
  4558. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4559. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4560. Pass((arrayDestinationTag));
  4561. ELSE HALT(100);
  4562. END;
  4563. (* case 3
  4564. procedure P([left args], [const] A: array [?] of Type, [right args])
  4565. *)
  4566. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4567. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4568. (* case 3b
  4569. P(...,A[a..b,c..d],...)
  4570. *)
  4571. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4572. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4573. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4574. Symbol(variable,variableOp);
  4575. LoadValue(variableOp,system.addressType);
  4576. ELSE
  4577. descriptorType := GetMathArrayDescriptorType(dim);
  4578. (* range -- cannot be reallocated *)
  4579. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4580. Symbol(variable,variableOp);
  4581. END;
  4582. arrayDestinationTag := variableOp.op;
  4583. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4584. arrayDestinationDimension := 0;
  4585. Designate(expression,operand);
  4586. Pass((operand.tag));
  4587. (* case 3a
  4588. P(...,A,...)
  4589. *)
  4590. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4591. i := 0;
  4592. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4593. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4594. INC(i);
  4595. END;
  4596. IF i = dim THEN
  4597. Designate(expression,operand);
  4598. Pass((operand.tag));
  4599. ELSE (* open-static *)
  4600. type := expression.type.resolved;
  4601. descriptorType := GetMathArrayDescriptorType(dim);
  4602. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4603. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4604. Symbol(variable,variableOp);
  4605. arrayDestinationTag := variableOp.op;
  4606. Designate(expression,operand);
  4607. FOR i := 0 TO dim-1 DO
  4608. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4609. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4610. ReleaseOperand(tmpOperand);
  4611. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4612. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4613. ReleaseOperand(tmpOperand);
  4614. END;
  4615. dimOp := IntermediateCode.Immediate(addressType,dim);
  4616. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4617. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4618. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4619. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4620. baseType := SemanticChecker.ArrayBase(type,dim);
  4621. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4622. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4623. Pass((arrayDestinationTag));
  4624. END;
  4625. (* case 3d
  4626. P(...,T,...)
  4627. case 3e
  4628. P(...,PT(...),...)
  4629. *)
  4630. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4631. Designate(expression,operand);
  4632. Dereference(operand,type.resolved,FALSE);
  4633. Pass((operand.tag));
  4634. (* case 3f
  4635. P(...,S,...)
  4636. case 3g
  4637. P(...,PS(...),...)
  4638. *)
  4639. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4640. descriptorType := GetMathArrayDescriptorType(dim);
  4641. (* static array does not need to be traced *)
  4642. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4643. Symbol(variable,variableOp);
  4644. arrayDestinationTag := variableOp.op;
  4645. Designate(expression,operand);
  4646. IF operand.op.type.length >1 THEN (* vector register *)
  4647. (* static array does not need to be traced *)
  4648. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4649. Symbol(variable2, variable2Op);
  4650. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4651. Emit(Mov(position,tmp, operand.op));
  4652. ReleaseOperand(operand);
  4653. Symbol(variable2, operand);
  4654. END;
  4655. FOR i := 0 TO dim-1 DO
  4656. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4657. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4658. ReleaseOperand(tmpOperand);
  4659. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4660. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4661. ReleaseOperand(tmpOperand);
  4662. END;
  4663. dimOp := IntermediateCode.Immediate(addressType,dim);
  4664. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4665. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4666. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4667. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4668. baseType := SemanticChecker.ArrayBase(type,dim);
  4669. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4670. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4671. Pass((arrayDestinationTag));
  4672. ELSE HALT(100);
  4673. END;
  4674. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4675. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4676. (* case 4b
  4677. P(...,A[a..b,c..d],...)
  4678. *)
  4679. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4680. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4681. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4682. Symbol(variable,variableOp);
  4683. LoadValue(variableOp,system.addressType);
  4684. ELSE
  4685. descriptorType := GetMathArrayDescriptorType(dim);
  4686. (* range array -- cannot be allocated *)
  4687. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4688. Symbol(variable,variableOp);
  4689. END;
  4690. arrayDestinationTag := variableOp.op;
  4691. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4692. arrayDestinationDimension := 0;
  4693. Designate(expression,operand);
  4694. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4695. Symbol(variable,variableOp);
  4696. ELSE
  4697. (* alias to range -- untraced *)
  4698. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4699. Symbol(variable,variableOp);
  4700. MakeMemory(tmp,variableOp.op,addressType,0);
  4701. Emit(Mov(position,tmp,operand.tag));
  4702. ReleaseIntermediateOperand(tmp);
  4703. END;
  4704. Pass((variableOp.op));
  4705. ReleaseOperand(variableOp);
  4706. (* case 4a
  4707. P(...,A,...)
  4708. *)
  4709. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4710. i := 0;
  4711. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4712. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4713. INC(i);
  4714. END;
  4715. IF i = dim THEN
  4716. Designate(expression,operand);
  4717. arrayDestinationTag := operand.tag;
  4718. ELSE (* open-static *)
  4719. type := expression.type.resolved;
  4720. descriptorType := GetMathArrayDescriptorType(dim);
  4721. (* static array -- untraced *)
  4722. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4723. Symbol(variable,variableOp);
  4724. arrayDestinationTag := variableOp.op;
  4725. Designate(expression,operand);
  4726. FOR i := 0 TO dim-1 DO
  4727. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4728. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4729. ReleaseOperand(tmpOperand);
  4730. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4731. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4732. ReleaseOperand(tmpOperand);
  4733. END;
  4734. dimOp := IntermediateCode.Immediate(addressType,dim);
  4735. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4736. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4737. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4738. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4739. baseType := SemanticChecker.ArrayBase(type,dim);
  4740. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4741. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4742. END;
  4743. (* tensor alias to open array -- untraced *)
  4744. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4745. Symbol(variable,variableOp);
  4746. MakeMemory(tmp,variableOp.op,addressType,0);
  4747. Emit(Mov(position,tmp,arrayDestinationTag));
  4748. ReleaseIntermediateOperand(tmp);
  4749. Pass((variableOp.op));
  4750. ReleaseOperand(variableOp);
  4751. (* case 4d
  4752. P(...,T,...)
  4753. *)
  4754. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4755. Designate(expression,operand);
  4756. Pass((operand.op));
  4757. (* case 4f
  4758. P(...,S,...)
  4759. *)
  4760. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4761. descriptorType := GetMathArrayDescriptorType(dim);
  4762. (* static array -- cannot be reallocated, untraced *)
  4763. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4764. Symbol(variable,variableOp);
  4765. arrayDestinationTag := variableOp.op;
  4766. Designate(expression,operand);
  4767. FOR i := 0 TO dim-1 DO
  4768. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4769. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4770. ReleaseOperand(tmpOperand);
  4771. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4772. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4773. ReleaseOperand(tmpOperand);
  4774. END;
  4775. dimOp := IntermediateCode.Immediate(addressType,dim);
  4776. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4777. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4778. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4779. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4780. baseType := SemanticChecker.ArrayBase(type,dim);
  4781. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4782. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4783. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4784. Symbol(variable,variableOp);
  4785. MakeMemory(tmp,variableOp.op,addressType,0);
  4786. Emit(Mov(position,tmp,arrayDestinationTag));
  4787. ReleaseIntermediateOperand(tmp);
  4788. Pass((variableOp.op));
  4789. ReleaseOperand(variableOp);
  4790. ELSE HALT(100);
  4791. END;
  4792. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4793. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4794. Designate(expression,operand);
  4795. IF operand.op.type.length > 1 THEN
  4796. Emit(Push(position, operand.op));
  4797. ELSE
  4798. size := system.SizeOf(type);
  4799. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4800. size := ToMemoryUnits(system,size);
  4801. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4802. arrayDestinationTag := sp;
  4803. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4804. END;
  4805. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4806. Designate(expression,operand);
  4807. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4808. (* static array no pointer *)
  4809. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4810. Symbol(variable,variableOp);
  4811. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4812. Emit(Mov(position,tmp,operand.op));
  4813. Emit(Push(position,variableOp.op));
  4814. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4815. Pass((operand.op));
  4816. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4817. END;
  4818. ELSE HALT(200)
  4819. END;
  4820. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4821. IF parameter.kind = SyntaxTree.VarParameter THEN
  4822. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4823. Designate(expression, operand);
  4824. Pass((operand.op));
  4825. ELSE
  4826. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4827. Evaluate(expression, operand);
  4828. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  4829. Pass((operand.extra)); (* step *)
  4830. Pass((operand.tag)); (* last *)
  4831. Pass((operand.op)); (* first *)
  4832. ELSE
  4833. (* pass range as structure in order to comply with the variable alignment of its components *)
  4834. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4835. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  4836. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4837. tmp := sp;
  4838. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4839. Emit(Mov(position,tmp,operand.op)); (* first *)
  4840. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  4841. IntermediateCode.AddOffset(tmp,size);
  4842. Emit(Mov(position,tmp,operand.tag)); (* last *)
  4843. IntermediateCode.AddOffset(tmp,size);
  4844. Emit(Mov(position,tmp,operand.extra)); (* step *)
  4845. END;
  4846. END
  4847. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4848. IF parameter.kind = SyntaxTree.VarParameter THEN
  4849. Designate(expression, operand);
  4850. Pass((operand.op));
  4851. ELSE
  4852. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4853. Evaluate(expression, operand);
  4854. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4855. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4856. Pass((operand.tag)); (* imaginary part *)
  4857. Pass((operand.op)) (* real part *)
  4858. ELSE
  4859. (* pass complex as structure in order to comply with the variable alignment of its components *)
  4860. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4861. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  4862. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4863. tmp := sp;
  4864. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4865. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4866. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  4867. IntermediateCode.AddOffset(tmp,size);
  4868. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4869. END
  4870. END
  4871. ELSE
  4872. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4873. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4874. Designate(expression,operand);
  4875. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4876. (* stack allocation *)
  4877. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4878. (*! parameter alignment to be discussed ... *)
  4879. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4880. size := type(SyntaxTree.StringType).length;
  4881. END;
  4882. IF backend.cooperative & parameter.NeedsTrace() THEN
  4883. dst := NewRegisterOperand (addressType);
  4884. Emit(Mov(position,dst, sp));
  4885. IntermediateCode.InitImmediate(null, byteType, 0);
  4886. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4887. ReleaseIntermediateOperand(dst);
  4888. SaveRegisters();ReleaseUsedRegisters(saved);
  4889. (* register dst has been freed before SaveRegisters already *)
  4890. CallAssignMethod(dst, operand.op, parameter.type);
  4891. RestoreRegisters(saved);
  4892. END;
  4893. IF operand.op.type.length > 1 THEN (* vector *)
  4894. MakeMemory(tmp,sp,operand.op.type,0);
  4895. Emit(Mov(position, tmp, operand.op));
  4896. ELSE
  4897. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4898. END;
  4899. ELSIF IsOpenArray(parameter.type) THEN
  4900. Designate(expression,operand);
  4901. baseReg := operand.tag;
  4902. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4903. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4904. END;
  4905. Pass((operand.op)); (* address of the array *)
  4906. ELSIF IsDelegate(parameter.type) THEN
  4907. Evaluate(expression,operand);
  4908. IF backend.cooperative & parameter.NeedsTrace() THEN
  4909. Emit(Push(position, nil));
  4910. dst := NewRegisterOperand (addressType);
  4911. Emit(Mov(position,dst, sp));
  4912. ReleaseIntermediateOperand(dst);
  4913. SaveRegisters();ReleaseUsedRegisters(saved);
  4914. Emit(Push(position, dst));
  4915. (* register dst has been freed before SaveRegisters already *)
  4916. Emit(Push(position, operand.tag));
  4917. CallThis(position,"GarbageCollector","Assign",2);
  4918. RestoreRegisters(saved);
  4919. ELSE
  4920. Pass((operand.tag));
  4921. END;
  4922. Pass((operand.op));
  4923. ELSE
  4924. Evaluate(expression,operand);
  4925. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4926. Emit(Push(position, nil));
  4927. dst := NewRegisterOperand (addressType);
  4928. Emit(Mov(position,dst, sp));
  4929. ReleaseIntermediateOperand(dst);
  4930. SaveRegisters();ReleaseUsedRegisters(saved);
  4931. Emit(Push(position, dst));
  4932. (* register dst has been freed before SaveRegisters already *)
  4933. Emit(Push(position, operand.op));
  4934. CallThis(position,"GarbageCollector","Assign",2);
  4935. RestoreRegisters(saved);
  4936. ELSE
  4937. Pass((operand.op));
  4938. END;
  4939. END;
  4940. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4941. Evaluate(expression,operand);
  4942. Pass((operand.op));
  4943. ELSE (* var parameter *)
  4944. Designate(expression,operand);
  4945. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4946. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4947. Pass((operand.tag));
  4948. END;
  4949. END;
  4950. Pass((operand.op));
  4951. END;
  4952. END;
  4953. (* TODO: needed? *)
  4954. arrayDestinationTag := oldArrayDestinationTag;
  4955. arrayDestinationDimension := oldArrayDestinationDimension;
  4956. IF needsParameterBackup THEN
  4957. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4958. ReuseCopy(parameterBackup, operand.op)
  4959. END;
  4960. ReleaseOperand(operand);
  4961. IF Trace THEN TraceExit("PushParameter") END;
  4962. END PushParameter;
  4963. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4964. VAR prevConditional: BOOLEAN;
  4965. BEGIN
  4966. prevConditional := conditional;
  4967. conditional := FALSE;
  4968. 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
  4969. Expression(x.result); (* use register *)
  4970. END;
  4971. Statement(x.statement);
  4972. conditional := prevConditional;
  4973. IF x.result # NIL THEN Expression(x.result) END;
  4974. 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
  4975. ReleaseIntermediateOperand(result.op);
  4976. END;
  4977. END VisitStatementDesignator;
  4978. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4979. VAR
  4980. procedure: SyntaxTree.Procedure;
  4981. procedureType: SyntaxTree.ProcedureType;
  4982. wasInline: BOOLEAN;
  4983. actualParameters: SyntaxTree.ExpressionList;
  4984. formalParameter: SyntaxTree.Parameter;
  4985. actualParameter: SyntaxTree.Expression;
  4986. i: LONGINT;
  4987. localVariable: SyntaxTree.Variable;
  4988. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4989. src, dest: Operand;
  4990. prevInlineExit : Label;
  4991. prevMapper: SymbolMapper;
  4992. tooComplex: BOOLEAN;
  4993. resultDesignator: SyntaxTree.Expression;
  4994. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4995. BEGIN
  4996. IF e = NIL THEN RETURN TRUE
  4997. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4998. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4999. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5000. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5001. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5002. ELSE RETURN FALSE
  5003. END;
  5004. END SimpleExpression;
  5005. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5006. BEGIN
  5007. RETURN checker.CanPassInRegister(type)
  5008. END FitsInRegister;
  5009. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5010. VAR
  5011. variable: SyntaxTree.Variable;
  5012. variableDesignator: SyntaxTree.Designator;
  5013. BEGIN
  5014. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5015. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5016. variableDesignator.SetType(type);
  5017. RETURN variableDesignator
  5018. END GetTemp;
  5019. BEGIN
  5020. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5021. wasInline := currentIsInline;
  5022. prevInlineExit := currentInlineExit;
  5023. prevMapper := currentMapper;
  5024. currentInlineExit := NewLabel();
  5025. tooComplex := FALSE;
  5026. NEW(currentMapper);
  5027. currentIsInline := TRUE;
  5028. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5029. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5030. formalParameter := procedureType.firstParameter;
  5031. actualParameters := x.parameters;
  5032. i := 0;
  5033. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5034. actualParameter := actualParameters.GetExpression(i);
  5035. IF actualParameter.resolved # NIL THEN
  5036. actualParameter := actualParameter.resolved
  5037. END;
  5038. (*
  5039. if expression is simple and can be passed immediately
  5040. or if type fits in register then we can proceed
  5041. otherwise we escape to ordinary procedure call.
  5042. *)
  5043. (* cases where the expression can be mapped identically *)
  5044. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5045. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5046. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5047. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5048. (*
  5049. Assign(variableDesignator, actualParameter);
  5050. *)
  5051. Evaluate(actualParameter, src);
  5052. Designate(variableDesignator, dest);
  5053. Emit(Mov(x.position, dest.op, src.op));
  5054. ReleaseOperand(dest);
  5055. ReleaseOperand(src);
  5056. (* the src operand should now have been completely released ! *)
  5057. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5058. ELSE tooComplex := TRUE
  5059. END;
  5060. (*
  5061. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5062. currentMapper.Add(formalParameter, actualParameter, NIL);
  5063. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5064. variableDesignator := GetTemp(system.addressType, FALSE);
  5065. Designate(actualParameter, src);
  5066. Designate(variableDesignator, dest);
  5067. IntermediateCode.MakeMemory(dest.op,addressType);
  5068. Emit(Mov(x.position, dest.op, src.op));
  5069. ReleaseOperand(dest);
  5070. IF src.tag.mode # IntermediateCode.Undefined THEN
  5071. tagDesignator := GetTemp(system.addressType, FALSE);
  5072. Designate(tagDesignator, dest);
  5073. IntermediateCode.MakeMemory(dest.op,addressType);
  5074. Emit(Mov(x.position, dest.op, src.op));
  5075. END;
  5076. ReleaseOperand(dest); ReleaseOperand(src);
  5077. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5078. END;
  5079. *)
  5080. formalParameter := formalParameter.nextParameter;
  5081. INC(i);
  5082. END;
  5083. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5084. IF resultDesignator # NIL THEN
  5085. returnDesignator := resultDesignator
  5086. ELSE
  5087. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5088. END;
  5089. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5090. END;
  5091. localVariable := procedure.procedureScope.firstVariable;
  5092. WHILE ~tooComplex & (localVariable # NIL) DO
  5093. variableDesignator := GetTemp(localVariable.type, FALSE);
  5094. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5095. localVariable := localVariable.nextVariable;
  5096. END;
  5097. IF ~tooComplex THEN
  5098. VisitStatementBlock(procedure.procedureScope.body);
  5099. SetLabel(currentInlineExit);
  5100. IF procedureType.returnType # NIL THEN
  5101. Designate(returnDesignator, result);
  5102. IF conditional THEN
  5103. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5104. ValueToCondition(result)
  5105. END;
  5106. END;
  5107. END;
  5108. currentMapper := prevMapper;
  5109. currentInlineExit := prevInlineExit;
  5110. currentIsInline := wasInline;
  5111. RETURN ~tooComplex
  5112. END InlineProcedureCall;
  5113. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5114. VAR
  5115. parameters: SyntaxTree.ExpressionList;
  5116. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5117. designator: SyntaxTree.Designator;
  5118. procedureType: SyntaxTree.ProcedureType;
  5119. formalParameter: SyntaxTree.Parameter;
  5120. operand: Operand;
  5121. reg, size, mask, dest: IntermediateCode.Operand;
  5122. saved,saved2: RegisterEntry;
  5123. symbol: SyntaxTree.Symbol;
  5124. variable: SyntaxTree.Variable;
  5125. i, parametersSize : LONGINT;
  5126. structuredReturnType: BOOLEAN;
  5127. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5128. tempVariableDesignator: SyntaxTree.Designator;
  5129. gap, alignment: LONGINT; (*fld*)
  5130. (* TODO: remove unnecessary backup variables *)
  5131. oldResult: Operand;
  5132. oldCurrentScope: SyntaxTree.Scope;
  5133. oldArrayDestinationTag: IntermediateCode.Operand;
  5134. oldArrayDestinationDimension: LONGINT;
  5135. oldConstantDeclaration: SyntaxTree.Symbol;
  5136. oldDestination: IntermediateCode.Operand;
  5137. oldCurrentLoop: Label;
  5138. oldConditional: BOOLEAN;
  5139. oldTrueLabel, oldFalseLabel: Label;
  5140. oldLocked: BOOLEAN;
  5141. usedRegisters,oldUsedRegisters: RegisterEntry;
  5142. return: IntermediateCode.Operand;
  5143. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5144. arg: IntermediateCode.Operand;
  5145. dummy: IntermediateCode.Operand;
  5146. recordType: SyntaxTree.RecordType;
  5147. operatorSelectionProcedureOperand: Operand;
  5148. operatorSelectionProcedure: SyntaxTree.Procedure;
  5149. fingerPrint: SyntaxTree.FingerPrint;
  5150. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5151. identifierNumber: LONGINT;
  5152. parameterRegisters: SIZE;
  5153. registers: ARRAY 64 OF WORD;
  5154. procedure: SyntaxTree.Procedure;
  5155. callingConvention: SyntaxTree.CallingConvention;
  5156. type: IntermediateCode.Type;
  5157. PROCEDURE BackupGlobalState;
  5158. BEGIN
  5159. oldResult := result;
  5160. oldCurrentScope := currentScope;
  5161. oldArrayDestinationTag := arrayDestinationTag;
  5162. oldArrayDestinationDimension := arrayDestinationDimension;
  5163. oldConstantDeclaration := constantDeclaration;
  5164. oldDestination := destination;
  5165. oldCurrentLoop := currentLoop;
  5166. oldConditional := conditional;
  5167. oldTrueLabel := trueLabel;
  5168. oldFalseLabel := falseLabel;
  5169. oldLocked := locked;
  5170. oldUsedRegisters := usedRegisters
  5171. END BackupGlobalState;
  5172. PROCEDURE RestoreGlobalState;
  5173. BEGIN
  5174. result := oldResult;
  5175. currentScope := oldCurrentScope;
  5176. arrayDestinationTag := oldArrayDestinationTag;
  5177. arrayDestinationDimension := oldArrayDestinationDimension;
  5178. constantDeclaration := oldConstantDeclaration;
  5179. destination := oldDestination;
  5180. currentLoop := oldCurrentLoop;
  5181. conditional := oldConditional;
  5182. trueLabel := oldTrueLabel;
  5183. falseLabel := oldFalseLabel;
  5184. locked := oldLocked;
  5185. usedRegisters := oldUsedRegisters
  5186. END RestoreGlobalState;
  5187. (** do preparations before parameter push for array-structured object types (ASOTs):
  5188. if ASOT is passed as VAR parameter:
  5189. - allocate temporary variable of math array type
  5190. - copy contents of ASOT to be passed to temporary variable
  5191. - use temporary variable as the actual parameter instead
  5192. - 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)
  5193. **)
  5194. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5195. VAR
  5196. expression: SyntaxTree.Expression;
  5197. BEGIN
  5198. IF actualParameter IS SyntaxTree.Designator THEN
  5199. designator := actualParameter(SyntaxTree.Designator);
  5200. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5201. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5202. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5203. ASSERT(checker # NIL);
  5204. checker.SetCurrentScope(currentScope);
  5205. (* allocate temporary variable *)
  5206. ASSERT(actualParameter.type # NIL);
  5207. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5208. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5209. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5210. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5211. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5212. ASSERT(tempVariableDesignator.type # NIL);
  5213. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5214. (* copy math array stored in actual parameter to temporary variable *)
  5215. BackupGlobalState;
  5216. AssignMathArray(tempVariableDesignator, actualParameter);
  5217. RestoreGlobalState;
  5218. (* use temporary variable as actual parameter instead of the original one *)
  5219. actualParameter := tempVariableDesignator;
  5220. (* create write-back call and store it in linked list *)
  5221. (* create new list entry *)
  5222. IF firstWriteBackCall = NIL THEN
  5223. NEW(firstWriteBackCall);
  5224. currentWriteBackCall := firstWriteBackCall
  5225. ELSE
  5226. ASSERT(currentWriteBackCall # NIL);
  5227. NEW(currentWriteBackCall.next);
  5228. currentWriteBackCall := currentWriteBackCall.next
  5229. END;
  5230. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5231. ASSERT(expression.type = NIL);
  5232. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5233. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5234. (* prepare writeback for any other "normal" indexer *)
  5235. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5236. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5237. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5238. Assign(tempVariableDesignator, actualParameter);
  5239. actualParameter := tempVariableDesignator;
  5240. IF firstWriteBackCall = NIL THEN
  5241. NEW(firstWriteBackCall);
  5242. currentWriteBackCall := firstWriteBackCall
  5243. ELSE
  5244. ASSERT(currentWriteBackCall # NIL);
  5245. NEW(currentWriteBackCall.next);
  5246. currentWriteBackCall := currentWriteBackCall.next
  5247. END;
  5248. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5249. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5250. END
  5251. END
  5252. END PrepareParameter;
  5253. BEGIN
  5254. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5255. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5256. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5257. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5258. IF InlineProcedureCall(x) THEN
  5259. RETURN
  5260. ELSE
  5261. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5262. END
  5263. END;
  5264. END;
  5265. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5266. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5267. callingConvention := procedureType.callingConvention;
  5268. dest := destination; destination := emptyOperand;
  5269. SaveRegisters();ReleaseUsedRegisters(saved);
  5270. parameters := x.parameters;
  5271. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5272. (* an operator is called *)
  5273. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5274. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5275. (* check if a dynamic operator call should be performed *)
  5276. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5277. ELSE
  5278. isCallOfDynamicOperator := FALSE
  5279. END;
  5280. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5281. Emit(Push(position, ap));
  5282. END;
  5283. alignment := procedureType.stackAlignment;
  5284. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5285. alignment := 16 (* bytes *);
  5286. END;
  5287. IF alignment > 1 THEN
  5288. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5289. Emit(Mov(position,reg, sp));
  5290. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5291. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5292. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5293. gap := 4*ToMemoryUnits(system,system.addressSize);
  5294. END;
  5295. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5296. backend.ResetParameterRegisters();
  5297. formalParameter := procedureType.firstParameter;
  5298. FOR i := 0 TO parameters.Length()-1 DO
  5299. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5300. type := addressType;
  5301. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5302. type := addressType;
  5303. ELSE
  5304. type := GetType(system, formalParameter.type);
  5305. END;
  5306. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5307. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5308. END;
  5309. formalParameter := formalParameter.nextParameter;
  5310. END;
  5311. IF gap < 0 THEN
  5312. gap := 0
  5313. END;
  5314. ELSE
  5315. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5316. END;
  5317. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5318. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5319. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5320. Emit(And(position,sp, sp, mask));
  5321. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5322. Emit(Push(position,reg));
  5323. ReleaseIntermediateOperand(reg);
  5324. END;
  5325. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5326. (* align stack to 16-byte boundary *)
  5327. IntermediateCode.InitImmediate(mask,addressType,-16);
  5328. Emit(And(position,sp, sp, mask));
  5329. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5330. IF gap # 0 THEN
  5331. IntermediateCode.InitImmediate(size,addressType,gap);
  5332. Emit(Sub(position,sp,sp,size))
  5333. END;
  5334. END;
  5335. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5336. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5337. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5338. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5339. ELSE
  5340. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5341. END;
  5342. Evaluate(x.left, operand);
  5343. IF symbol IS SyntaxTree.Procedure THEN
  5344. IF (procedureType.selfParameter # NIL) THEN
  5345. Emit(Push(position,operand.tag));
  5346. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5347. Emit(Push(position,operand.tag));
  5348. ELSIF (procedureType.isDelegate) THEN
  5349. Emit(Push(position,operand.tag));
  5350. END;
  5351. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5352. IF (procedureType.selfParameter # NIL) THEN
  5353. Emit(Push(position,operand.tag));
  5354. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5355. Emit(Push(position,operand.tag));
  5356. END;
  5357. ELSE HALT(200);
  5358. END;
  5359. ReleaseIntermediateOperand(operand.tag);
  5360. operand.tag := emptyOperand;
  5361. (* determine if a structured return type is needed *)
  5362. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5363. IF structuredReturnType THEN
  5364. IF resultDesignator # NIL THEN
  5365. d := resultDesignator;
  5366. ELSE
  5367. (* temporary result that might be allocated, must potentially be traced *)
  5368. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5369. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5370. d.SetType(variable.type);
  5371. END;
  5372. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5373. Designate(d,returnValue);
  5374. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5375. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5376. Emit(Push(position,size));
  5377. Emit(Push(position,returnValue.op));
  5378. ReleaseOperand(returnValue);
  5379. ELSE*)
  5380. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5381. (*
  5382. END;
  5383. *)
  5384. END;
  5385. firstWriteBackCall := NIL; (* reset write-back call list *)
  5386. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5387. parameterRegisters := 0;
  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. INC(parameterRegisters);
  5400. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5401. Error(actualParameter.position,"cannot be passed by register")
  5402. END;
  5403. ELSE
  5404. registers[i] := -1;
  5405. END;
  5406. formalParameter := formalParameter.nextParameter;
  5407. END;
  5408. formalParameter := procedureType.lastParameter;
  5409. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5410. actualParameter := parameters.GetExpression(i);
  5411. PrepareParameter(actualParameter, formalParameter);
  5412. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5413. formalParameter := formalParameter.prevParameter;
  5414. END;
  5415. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5416. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5417. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5418. END;
  5419. ELSE
  5420. hasDynamicOperands := FALSE;
  5421. formalParameter := procedureType.firstParameter;
  5422. FOR i := 0 TO parameters.Length() - 1 DO
  5423. actualParameter := parameters.GetExpression(i);
  5424. IF formalParameter # NIL THEN (* TENTATIVE *)
  5425. PrepareParameter(actualParameter, formalParameter);
  5426. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5427. ASSERT(i < 2);
  5428. hasDynamicOperands := TRUE;
  5429. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5430. ELSE
  5431. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5432. END;
  5433. formalParameter := formalParameter.nextParameter;
  5434. END;
  5435. END;
  5436. END;
  5437. IF symbol IS SyntaxTree.Procedure THEN
  5438. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5439. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5440. Emit(Push(position,reg));
  5441. ReleaseIntermediateOperand(reg);
  5442. END;
  5443. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5444. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5445. parametersSize := ParametersSize(system,procedureType, FALSE);
  5446. END;
  5447. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5448. (*
  5449. dynamic operator overloading:
  5450. first push parameters, regularly:
  5451. [self]
  5452. par1
  5453. par2
  5454. then push parameters for GetOperator
  5455. identifier
  5456. ptr1
  5457. tag
  5458. ptr2
  5459. tag
  5460. call GetOperatorRuntimeProc
  5461. call Operator
  5462. *)
  5463. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5464. (* push ID *)
  5465. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5466. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5467. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5468. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5469. formalParameter := procedureType.firstParameter;
  5470. FOR i := 0 TO parameters.Length() - 1 DO
  5471. IF formalParameter.access # SyntaxTree.Hidden THEN
  5472. ASSERT(i < 2);
  5473. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5474. (* push pointer *)
  5475. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5476. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5477. (* add dereference *)
  5478. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5479. (*! better: do refer to stack above than using parameter backups !!*)
  5480. ReleaseIntermediateOperand(parameterBackups[i]);
  5481. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5482. END;
  5483. Emit(Push(position,parameterBackups[i]));
  5484. ReleaseIntermediateOperand(parameterBackups[i]);
  5485. (* push typetag *)
  5486. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5487. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5488. arg := TypeDescriptorAdr(recordType);
  5489. Emit(Push(position,arg));
  5490. ELSE
  5491. (* push 'NonPointer' *)
  5492. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5493. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5494. (* push fingerprint *)
  5495. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5496. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5497. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5498. END
  5499. END;
  5500. formalParameter := formalParameter.nextParameter
  5501. END;
  5502. (* for unary operators: complete the information for the second parameter *)
  5503. IF procedureType.numberParameters < 2 THEN
  5504. (* push 'NonPointer' *)
  5505. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5506. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5507. (* push 'NoType' *)
  5508. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5509. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5510. END;
  5511. (* call operator selection procedure *)
  5512. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5513. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5514. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5515. ReleaseOperand(operatorSelectionProcedureOperand);
  5516. (* use the address that the operator selection procedure returned as the target address of the call *)
  5517. InitOperand(operand, ModeValue);
  5518. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5519. Emit(Result(position,operand.op))
  5520. END
  5521. END;
  5522. ReleaseParameterRegisters();
  5523. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5524. SaveRegisters();ReleaseUsedRegisters(saved2);
  5525. CallThis(position,"Objects","LeaveA2",0);
  5526. RestoreRegisters(saved2);
  5527. END;
  5528. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5529. Emit(Call(position,operand.op,0));
  5530. ELSE
  5531. Emit(Call(position,operand.op,parametersSize));
  5532. END;
  5533. ReleaseOperand(operand);
  5534. IF procedureType.noReturn THEN
  5535. EmitTrap(position,NoReturnTrap);
  5536. END;
  5537. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5538. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5539. Emit(Result(position,return));
  5540. END;
  5541. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5542. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5543. Emit(Push(position, return));
  5544. CallThis(position,"Objects","ReenterA2",0);
  5545. Emit(Pop(position, return));
  5546. ELSE
  5547. CallThis(position,"Objects","ReenterA2",0);
  5548. END;
  5549. END;
  5550. (* === return parameter space === *)
  5551. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5552. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5553. (* cleanup all space for all parameters *)
  5554. IF parametersSize < 32 THEN
  5555. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5556. parametersSize := 32
  5557. END;
  5558. size := IntermediateCode.Immediate(addressType,parametersSize);
  5559. Emit(Add(position,sp,sp,size))
  5560. END;
  5561. IF (callingConvention IN SysvABI) THEN
  5562. IF parameterRegisters > 0 THEN
  5563. IF parameters.Length() > parameterRegisters THEN
  5564. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5565. ELSE
  5566. parametersSize := 0
  5567. END;
  5568. ELSE
  5569. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5570. INC( parametersSize, (-parametersSize) MOD 16 )
  5571. END;
  5572. IF parametersSize > 0 THEN
  5573. size := IntermediateCode.Immediate(addressType,parametersSize);
  5574. Emit(Add(position,sp,sp,size))
  5575. END;
  5576. END;
  5577. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5578. IF structuredReturnType THEN
  5579. (* stack pointer rewinding done by callee
  5580. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5581. Emit(Add(position,sp,sp,size));
  5582. *)
  5583. RestoreRegisters(saved);
  5584. InitOperand(result,ModeReference);
  5585. Symbol(variable,result);
  5586. ELSE
  5587. RestoreRegisters(saved);
  5588. InitOperand(result,ModeValue);
  5589. result.op := return;
  5590. END;
  5591. END;
  5592. IF alignment > 1 THEN
  5593. Emit(Pop(position,sp));
  5594. END;
  5595. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5596. Emit(Pop(position, ap));
  5597. END;
  5598. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5599. ValueToCondition(result);
  5600. END;
  5601. destination := dest;
  5602. (* perform all write-back calls in the list *)
  5603. BackupGlobalState;
  5604. currentWriteBackCall := firstWriteBackCall;
  5605. WHILE currentWriteBackCall # NIL DO
  5606. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5607. currentWriteBackCall := currentWriteBackCall.next
  5608. END;
  5609. RestoreGlobalState;
  5610. (* TENATIVE *)
  5611. (*
  5612. IF isOperatorCall THEN
  5613. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5614. END;
  5615. *)
  5616. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5617. END VisitProcedureCallDesignator;
  5618. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5619. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5620. td: SyntaxTree.Symbol;
  5621. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5622. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5623. BEGIN
  5624. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5625. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5626. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5627. variable.SetType(system.anyType);
  5628. scope.AddVariable(variable);
  5629. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5630. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5631. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5632. typeDeclaration.SetScope(module.module.moduleScope);
  5633. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5634. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5635. END;
  5636. RETURN hiddenPointerType;
  5637. END GetHiddenPointerType;
  5638. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5639. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5640. BEGIN
  5641. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5642. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5643. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5644. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5645. scope.AddVariable(variable);
  5646. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5647. variable.SetType(system.anyType);
  5648. scope.AddVariable(variable);
  5649. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5650. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5651. typeDeclaration.SetDeclaredType(delegatePointerType);
  5652. typeDeclaration.SetScope(module.module.moduleScope);
  5653. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5654. delegatePointerType.SetState(SyntaxTree.Resolved);
  5655. END;
  5656. RETURN delegatePointerType
  5657. END GetDelegateType;
  5658. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5659. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5660. such as in VAR a: RECORD ... END;
  5661. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5662. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5663. *)
  5664. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  5665. baseRecord: SyntaxTree.RecordType;
  5666. BEGIN (* no code emission *)
  5667. source := NIL;
  5668. x := x.resolved;
  5669. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5670. x := GetHiddenPointerType();
  5671. ELSIF IsDelegate(x) THEN
  5672. x := GetDelegateType();
  5673. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5674. ELSE HALT(200);
  5675. END;
  5676. td := x.typeDeclaration;
  5677. IF td = NIL THEN
  5678. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5679. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5680. ASSERT(td # NIL);
  5681. END;
  5682. GetCodeSectionNameForSymbol(td,name);
  5683. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5684. meta.CheckTypeDeclaration(x);
  5685. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5686. ELSE
  5687. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5688. END;
  5689. IF backend.cooperative OR meta.simple THEN
  5690. offset := 0;
  5691. ELSE
  5692. IF x IS SyntaxTree.CellType THEN
  5693. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5694. IF baseRecord = NIL THEN
  5695. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5696. ELSE
  5697. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5698. END;
  5699. ELSE
  5700. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5701. END;
  5702. END;
  5703. RETURN td
  5704. END GetBackendType;
  5705. BEGIN
  5706. (*td := t.typeDeclaration;*)
  5707. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5708. (*
  5709. IF t IS SyntaxTree.PointerType THEN
  5710. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5711. ELSE
  5712. source := GetBackendType(t);
  5713. END;
  5714. *)
  5715. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5716. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5717. IntermediateCode.SetOffset(res,offset);
  5718. (*
  5719. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5720. make memory should be used when tag is used, not earlier
  5721. *)
  5722. RETURN res
  5723. END TypeDescriptorAdr;
  5724. (*
  5725. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5726. VAR result: IntermediateCode.Operand;
  5727. BEGIN
  5728. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5729. operand.tag := TypeDescriptorAdr(operand.type);
  5730. IntermediateCode.MakeMemory(operand.tag,addressType);
  5731. UseIntermediateOperand(operand.tag);
  5732. END;
  5733. END MakeTypeTag;
  5734. *)
  5735. PROCEDURE ProfilerInit;
  5736. VAR reg: IntermediateCode.Operand;
  5737. BEGIN
  5738. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5739. Emit(Call(position,reg,0));
  5740. END ProfilerInit;
  5741. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5742. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5743. BEGIN
  5744. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5745. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5746. THEN
  5747. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5748. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5749. Emit(Push(position,reg));
  5750. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5751. Emit(Push(position,reg));
  5752. StaticCallOperand(result,procedure);
  5753. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5754. ReleaseOperand(result);
  5755. END;
  5756. END ProfilerEnterExit;
  5757. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5758. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5759. BEGIN
  5760. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5761. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5762. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5763. profileInit.Emit(Push(position,reg));
  5764. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5765. profileInit.Emit(Push(position,reg));
  5766. NEW(string, LEN(name)); COPY(name, string^);
  5767. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5768. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5769. sv.SetType(type);
  5770. Designate(sv,result);
  5771. profileInit.Emit(Push(position,result.tag));
  5772. profileInit.Emit(Push(position,result.op));
  5773. StaticCallOperand(result,procedure);
  5774. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5775. ReleaseOperand(result);
  5776. END;
  5777. END ProfilerAddProcedure;
  5778. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5779. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5780. BEGIN
  5781. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5782. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5783. profileInit.Emit(Push(position,reg));
  5784. profileInitPatchPosition := profileInit.pc;
  5785. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5786. NEW(string, LEN(name)); COPY(name, string^);
  5787. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5788. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5789. sv.SetType(type);
  5790. Designate(sv,result);
  5791. profileInit.Emit(Push(position,result.tag));
  5792. profileInit.Emit(Push(position,result.op));
  5793. StaticCallOperand(result,procedure);
  5794. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5795. ReleaseOperand(result);
  5796. END;
  5797. END ProfilerAddModule;
  5798. PROCEDURE ProfilerPatchInit;
  5799. VAR reg: IntermediateCode.Operand;
  5800. BEGIN
  5801. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5802. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5803. EmitLeave(profileInit,position,NIL,0);
  5804. profileInit.Emit(Exit(position,0,0,0));
  5805. END ProfilerPatchInit;
  5806. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5807. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5808. VAR
  5809. id: LONGINT;
  5810. leftType, rightType: SyntaxTree.Type;
  5811. procedureType: SyntaxTree.ProcedureType;
  5812. runtimeProcedure: SyntaxTree.Procedure;
  5813. runtimeProcedureOperand, operatorOperand: Operand;
  5814. kind: SET;
  5815. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5816. VAR
  5817. arg: IntermediateCode.Operand;
  5818. recordType: SyntaxTree.RecordType;
  5819. fingerPrint: SyntaxTree.FingerPrint;
  5820. BEGIN
  5821. IF type = NIL THEN
  5822. (* no type: push 'NoType' *)
  5823. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5824. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5825. ELSIF IsStrictlyPointerToRecord(type) THEN
  5826. (* pointer to record type: push typetag *)
  5827. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5828. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5829. arg := TypeDescriptorAdr(recordType);
  5830. ELSE
  5831. (* non-pointer to record type: push fingerprint *)
  5832. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5833. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5834. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5835. END;
  5836. operatorInitializationCodeSection.Emit(Push(position,arg))
  5837. END PushTypeInfo;
  5838. BEGIN
  5839. ASSERT(operatorInitializationCodeSection # NIL);
  5840. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5841. procedureType := operator.type(SyntaxTree.ProcedureType);
  5842. (* determine types *)
  5843. leftType := procedureType.firstParameter.type;
  5844. IF procedureType.numberParameters = 2 THEN
  5845. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5846. rightType := procedureType.firstParameter.nextParameter.type;
  5847. ELSE
  5848. rightType := NIL
  5849. END;
  5850. (* determine operator kind *)
  5851. IF IsStrictlyPointerToRecord(leftType) THEN
  5852. kind := {LhsIsPointer}
  5853. ELSE
  5854. kind := {}
  5855. END;
  5856. IF IsStrictlyPointerToRecord(rightType) THEN
  5857. kind := kind + {RhsIsPointer}
  5858. END;
  5859. IF kind # {} THEN (* TODO: to be removed later on *)
  5860. (* at least one of the types is a pointer to record *)
  5861. (* emit a code that registers this specific operator in the runtime *)
  5862. dump := operatorInitializationCodeSection.comments;
  5863. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5864. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5865. (* push ID *)
  5866. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5867. id := Global.GetSymbol(module.module.case, operator.name);
  5868. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5869. (* push kind *)
  5870. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5871. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5872. (* push type infos *)
  5873. PushTypeInfo(leftType);
  5874. PushTypeInfo(rightType);
  5875. (* push operator address *)
  5876. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5877. StaticCallOperand(operatorOperand, operator);
  5878. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5879. ReleaseOperand(operatorOperand);
  5880. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5881. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5882. ReleaseOperand(runtimeProcedureOperand)
  5883. END
  5884. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5885. END
  5886. END RegisterDynamicOperator;
  5887. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5888. VAR
  5889. traceModule: SyntaxTree.Module;
  5890. procedure: SyntaxTree.Procedure;
  5891. procedureVariable: SyntaxTree.Variable;
  5892. s,msg: Basic.MessageString;
  5893. res: Operand;
  5894. i: LONGINT;
  5895. sv: SyntaxTree.StringValue;
  5896. type: SyntaxTree.Type;
  5897. recordType: SyntaxTree.RecordType;
  5898. printout: Printout.Printer;
  5899. stringWriter: Streams.StringWriter;
  5900. expression: SyntaxTree.Expression;
  5901. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5902. BEGIN
  5903. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5904. IF procedure = NIL THEN
  5905. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5906. END;
  5907. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5908. s := "procedure ";
  5909. Strings.Append(s,backend.traceModuleName);
  5910. Strings.Append(s,".");
  5911. Strings.Append(s,procedureName);
  5912. Strings.Append(s," not present");
  5913. Error(position,s);
  5914. RETURN FALSE
  5915. ELSE
  5916. RETURN TRUE
  5917. END;
  5918. END GetProcedure;
  5919. PROCEDURE CallProcedure;
  5920. VAR size: LONGINT;
  5921. BEGIN
  5922. IF procedure # NIL THEN
  5923. StaticCallOperand(result,procedure);
  5924. size := ProcParametersSize(procedure);
  5925. ELSE
  5926. Symbol(procedureVariable, result);
  5927. LoadValue(result, procedureVariable.type.resolved);
  5928. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5929. END;
  5930. Emit(Call(position,result.op,size));
  5931. END CallProcedure;
  5932. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5933. VAR res: Operand; string: SyntaxTree.String;
  5934. BEGIN
  5935. IF GetProcedure("String") THEN
  5936. NEW(string, LEN(s)); COPY(s, string^);
  5937. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5938. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5939. sv.SetType(type);
  5940. Designate(sv,res);
  5941. Emit(Push(position,res.tag));
  5942. Emit(Push(position,res.op));
  5943. ReleaseOperand(res);
  5944. CallProcedure;
  5945. END;
  5946. END String;
  5947. PROCEDURE Integer(op: IntermediateCode.Operand);
  5948. BEGIN
  5949. IF GetProcedure("Int") THEN
  5950. Emit(Push(position,op));
  5951. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5952. CallProcedure;
  5953. END;
  5954. END Integer;
  5955. PROCEDURE Float(op: IntermediateCode.Operand);
  5956. BEGIN
  5957. IF GetProcedure("HIntHex") THEN
  5958. Emit(Push(position,op));
  5959. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5960. CallProcedure;
  5961. END;
  5962. END Float;
  5963. PROCEDURE Set(op: IntermediateCode.Operand);
  5964. BEGIN
  5965. IF GetProcedure("Set") THEN
  5966. Emit(Push(position,op));
  5967. (*
  5968. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5969. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5970. *)
  5971. CallProcedure;
  5972. END;
  5973. END Set;
  5974. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5975. BEGIN
  5976. IF GetProcedure("Boolean") THEN
  5977. Emit(Push(position,op));
  5978. CallProcedure;
  5979. END;
  5980. END Boolean;
  5981. PROCEDURE Char(op: IntermediateCode.Operand);
  5982. BEGIN
  5983. IF GetProcedure("Char") THEN
  5984. Emit(Push(position,op));
  5985. CallProcedure;
  5986. END;
  5987. END Char;
  5988. PROCEDURE Address(op: IntermediateCode.Operand);
  5989. BEGIN
  5990. IF GetProcedure("Address") THEN
  5991. Emit(Push(position,op));
  5992. CallProcedure;
  5993. END;
  5994. END Address;
  5995. PROCEDURE Size(op: IntermediateCode.Operand);
  5996. BEGIN
  5997. IF GetProcedure("Size") THEN
  5998. Emit(Push(position,op));
  5999. CallProcedure;
  6000. END;
  6001. END Size;
  6002. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6003. VAR len: IntermediateCode.Operand;
  6004. BEGIN
  6005. IF GetProcedure("String") THEN
  6006. len := GetArrayLength(type, op.tag);
  6007. Emit(Push(position,len));
  6008. ReleaseIntermediateOperand(len);
  6009. Emit(Push(position,op.op));
  6010. CallProcedure;
  6011. END;
  6012. END StringOperand;
  6013. PROCEDURE Ln;
  6014. BEGIN
  6015. IF GetProcedure("Ln") THEN
  6016. CallProcedure;
  6017. END;
  6018. END Ln;
  6019. BEGIN
  6020. IF backend.traceModuleName = "" THEN RETURN END;
  6021. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6022. IF GetProcedure("Enter") THEN
  6023. CallProcedure
  6024. END;
  6025. NEW(stringWriter,LEN(s));
  6026. FOR i := 0 TO x.Length()-1 DO
  6027. msg := "";
  6028. expression := x.GetExpression(i);
  6029. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6030. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6031. ELSE
  6032. Global.GetModuleName(module.module, s);
  6033. END;
  6034. IF i = 0 THEN
  6035. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6036. stringWriter.String(":");
  6037. END;
  6038. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6039. IF ~(expression IS SyntaxTree.StringValue) THEN
  6040. printout.Expression(expression);
  6041. stringWriter.Get(s);
  6042. Strings.Append(msg,s);
  6043. Strings.Append(msg,"= ");
  6044. ELSE stringWriter.Get(s); (* remove from string writer *)
  6045. Strings.Append(msg, s);
  6046. END;
  6047. String(msg);
  6048. IF SemanticChecker.IsStringType(expression.type) THEN
  6049. Designate(expression,res);
  6050. StringOperand(res, expression.type);
  6051. ELSE
  6052. Evaluate(expression,res);
  6053. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6054. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6055. Convert(res.op,int64);
  6056. END;
  6057. Integer(res.op);
  6058. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6059. Boolean(res.op);
  6060. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6061. Set(res.op);
  6062. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6063. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6064. Convert(res.op,float64);
  6065. END;
  6066. Float(res.op);
  6067. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6068. Char(res.op);
  6069. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6070. Address(res.op);String("H");
  6071. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6072. Size(res.op);
  6073. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6074. Address(res.op);String("H");
  6075. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6076. Address(res.op);String("H");
  6077. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6078. String("NIL");
  6079. ELSE HALT(200);
  6080. END;
  6081. END;
  6082. ReleaseOperand(res);
  6083. String("; ");
  6084. END;
  6085. IF GetProcedure("Exit") THEN
  6086. CallProcedure
  6087. ELSE
  6088. Ln;
  6089. END;
  6090. END;
  6091. END SystemTrace;
  6092. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6093. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6094. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6095. BEGIN
  6096. type := type.resolved;
  6097. IF type IS SyntaxTree.RecordType THEN
  6098. WITH type: SyntaxTree.RecordType DO
  6099. baseType := type.baseType;
  6100. IF baseType # NIL THEN
  6101. baseType := baseType.resolved;
  6102. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6103. InitFields(baseType,adr,offset);
  6104. END;
  6105. variable := type.recordScope.firstVariable;
  6106. WHILE variable # NIL DO
  6107. IF variable.initializer # NIL THEN
  6108. Evaluate(variable.initializer,initializerOp);
  6109. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6110. Emit(Mov(position,mem,initializerOp.op));
  6111. ReleaseOperand(initializerOp);
  6112. ReleaseIntermediateOperand(mem);
  6113. END;
  6114. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6115. variable := variable.nextVariable
  6116. END;
  6117. END;
  6118. ELSIF type IS SyntaxTree.CellType THEN
  6119. WITH type: SyntaxTree.CellType DO
  6120. baseType := type.baseType;
  6121. IF baseType # NIL THEN
  6122. baseType := baseType.resolved;
  6123. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6124. InitFields(baseType,adr,offset);
  6125. END;
  6126. variable := type.cellScope.firstVariable;
  6127. WHILE variable # NIL DO
  6128. IF variable.initializer # NIL THEN
  6129. Evaluate(variable.initializer,initializerOp);
  6130. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6131. Emit(Mov(position,mem,initializerOp.op));
  6132. ReleaseOperand(initializerOp);
  6133. ReleaseIntermediateOperand(mem);
  6134. END;
  6135. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6136. variable := variable.nextVariable
  6137. END;
  6138. END;
  6139. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6140. WITH type: SyntaxTree.ArrayType DO
  6141. IF type.form = SyntaxTree.Static THEN
  6142. baseType := type.arrayBase;
  6143. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6144. FOR i := 0 TO type.staticLength-1 DO
  6145. InitFields(baseType,adr,offset+i*size);
  6146. END;
  6147. END;
  6148. END;
  6149. ELSIF type IS SyntaxTree.MathArrayType THEN
  6150. WITH type: SyntaxTree.MathArrayType DO
  6151. IF type.form = SyntaxTree.Open THEN
  6152. dim := DynamicDim(type);
  6153. imm := IntermediateCode.Immediate(addressType,dim);
  6154. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6155. baseType := SemanticChecker.ArrayBase(type,dim);
  6156. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6157. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6158. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6159. ReleaseIntermediateOperand(imm);
  6160. (* flags remain empty (=0) for open array *)
  6161. ELSIF type.form = SyntaxTree.Static THEN
  6162. baseType := type.arrayBase;
  6163. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6164. ASSERT(type.staticLength < 1024*1024*1024);
  6165. FOR i := 0 TO type.staticLength-1 DO
  6166. InitFields(baseType,adr,offset+i*size);
  6167. END;
  6168. END;
  6169. END;
  6170. END;
  6171. END InitFields;
  6172. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6173. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6174. saved: RegisterEntry;
  6175. BEGIN
  6176. type := variable.type.resolved;
  6177. IF (type IS SyntaxTree.MathArrayType) THEN
  6178. WITH type: SyntaxTree.MathArrayType DO
  6179. IF type.form = SyntaxTree.Open THEN
  6180. Symbol(variable,operand);
  6181. InitFields(type, operand.tag,0);
  6182. IF temporary THEN
  6183. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6184. END;
  6185. ELSIF type.form = SyntaxTree.Tensor THEN
  6186. IF temporary & backend.writeBarriers THEN
  6187. SaveRegisters();ReleaseUsedRegisters(saved);
  6188. Symbol(variable, operand);
  6189. Emit(Push(position,operand.op));
  6190. ReleaseOperand(operand);
  6191. Emit(Push(position,nil));
  6192. CallThis(position,"FoxArrayBase","Assign",2);
  6193. RestoreRegisters(saved);
  6194. ELSE
  6195. Symbol(variable, operand);
  6196. MakeMemory(tmp,operand.op,addressType,0);
  6197. ReleaseOperand(operand);
  6198. IF FALSE & temporary THEN
  6199. (* trick -- temporary object from array base *)
  6200. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6201. Symbol(symbol,operand);
  6202. MakeMemory(mem,operand.op,addressType,0);
  6203. ReleaseOperand(operand);
  6204. Emit(Mov(position,tmp, mem) );
  6205. ReleaseOperand(operand);
  6206. ELSE
  6207. Emit(Mov(position,tmp, nil ) );
  6208. END;
  6209. ReleaseIntermediateOperand(tmp)
  6210. END;
  6211. END;
  6212. END;
  6213. ELSE
  6214. Symbol(variable,operand);
  6215. IF variable.initializer # NIL THEN
  6216. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6217. reference.SetType(variable.type.resolved);
  6218. reference.SetAssignable(TRUE);
  6219. Assign(reference,variable.initializer);
  6220. ELSIF temporary THEN
  6221. IF SemanticChecker.IsPointerType(variable.type) THEN
  6222. IF backend.cooperative THEN
  6223. SaveRegisters();ReleaseUsedRegisters(saved);
  6224. Symbol(variable, operand);
  6225. CallAssignPointer(operand.op, nil);
  6226. ReleaseOperand(operand);
  6227. RestoreRegisters(saved);
  6228. ELSIF backend.writeBarriers THEN
  6229. SaveRegisters();ReleaseUsedRegisters(saved);
  6230. Symbol(variable, operand);
  6231. Emit(Push(position,operand.op));
  6232. ReleaseOperand(operand);
  6233. Emit(Push(position,nil));
  6234. CallThis(position,"Heaps","Assign",2);
  6235. RestoreRegisters(saved);
  6236. ELSE
  6237. Symbol(variable, operand);
  6238. MakeMemory(tmp,operand.op,addressType,0);
  6239. ReleaseOperand(operand);
  6240. Emit(Mov(position,tmp, nil ) );
  6241. ReleaseIntermediateOperand(tmp);
  6242. END;
  6243. END;
  6244. END;
  6245. InitFields(type, operand.op,0);
  6246. ReleaseOperand(operand);
  6247. END;
  6248. END InitVariable;
  6249. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6250. VAR end: Label;
  6251. BEGIN
  6252. IF type.form = SyntaxTree.Tensor THEN
  6253. InitOperand(result,ModeValue);
  6254. ReuseCopy(result.op,base);
  6255. end := NewLabel();
  6256. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6257. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6258. SetLabel(end);
  6259. Convert(result.op,lenType);
  6260. ELSE
  6261. InitOperand(result,ModeValue);
  6262. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6263. END
  6264. END MathArrayDim;
  6265. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6266. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6267. BEGIN
  6268. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6269. MakeMemory(mem,base,addressType,offset);
  6270. Emit(Mov(position,mem,value));
  6271. ReleaseIntermediateOperand(mem);
  6272. END PutMathArrayField;
  6273. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6274. VAR mem: IntermediateCode.Operand;
  6275. BEGIN
  6276. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6277. MakeMemory(mem,base,addressType,offset);
  6278. Emit(Mov(position,mem,value));
  6279. ReleaseIntermediateOperand(mem);
  6280. END PutMathArrayFieldOffset;
  6281. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6282. BEGIN
  6283. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6284. MakeMemory(value,base,addressType,offset);
  6285. END GetMathArrayField;
  6286. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6287. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6288. BEGIN
  6289. IF incr THEN
  6290. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6291. ELSE
  6292. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6293. END;
  6294. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6295. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6296. ELSE
  6297. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6298. Emit(Mov(position,reg,dim));
  6299. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6300. Emit(Add(position,reg,reg,base));
  6301. MakeMemory(mem, reg, addressType, offset);
  6302. ReleaseIntermediateOperand(reg);
  6303. Emit(Mov(position,mem,value));
  6304. ReleaseIntermediateOperand(mem);
  6305. END;
  6306. END PutMathArrayLenOrIncr;
  6307. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6308. BEGIN
  6309. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6310. END PutMathArrayLength;
  6311. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6312. BEGIN
  6313. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6314. END PutMathArrayIncrement;
  6315. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6316. BEGIN
  6317. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6318. END GetMathArrayIncrement;
  6319. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6320. BEGIN
  6321. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6322. END GetMathArrayLength;
  6323. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6324. VAR dimOp: IntermediateCode.Operand;
  6325. BEGIN
  6326. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6327. GetMathArrayLength(type, operand, dimOp, check, result);
  6328. END GetMathArrayLengthAt;
  6329. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6330. VAR dimOp: IntermediateCode.Operand;
  6331. BEGIN
  6332. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6333. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6334. END GetMathArrayIncrementAt;
  6335. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6336. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6337. offset: LONGINT;
  6338. BEGIN
  6339. IF increment THEN
  6340. offset := MathIncrOffset;
  6341. ELSE
  6342. offset := MathLenOffset;
  6343. END;
  6344. INC(offset,operand.dimOffset*2);
  6345. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6346. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6347. END;
  6348. (* static dimension *)
  6349. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6350. IF check & (type.form = SyntaxTree.Tensor) THEN
  6351. DimensionCheck(operand.tag,dim,BrltL);
  6352. END;
  6353. val := SHORT(dim.intValue);
  6354. IF type.form # SyntaxTree.Tensor THEN
  6355. t := SemanticChecker.ArrayBase(type,val);
  6356. type := t.resolved(SyntaxTree.MathArrayType);
  6357. IF type.form = SyntaxTree.Static THEN
  6358. IF increment THEN
  6359. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6360. ELSE
  6361. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6362. END;
  6363. InitOperand(result,ModeValue);
  6364. result.op := res;
  6365. RETURN;
  6366. END;
  6367. END;
  6368. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6369. MakeMemory(res,operand.tag,addressType,offset);
  6370. (*
  6371. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6372. *)
  6373. InitOperand(result,ModeValue);
  6374. result.op := res;
  6375. ELSE
  6376. Convert(dim,addressType);
  6377. IF check THEN
  6378. IF type.form = SyntaxTree.Tensor THEN
  6379. DimensionCheck(operand.tag,dim,BrltL);
  6380. ELSIF isUnchecked THEN (* do nothing *)
  6381. ELSE
  6382. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6383. END;
  6384. END;
  6385. end := NewLabel(); next := NIL;
  6386. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6387. Emit(Mov(position,res,dim));
  6388. Convert(res,sizeType);
  6389. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6390. WHILE t IS SyntaxTree.MathArrayType DO
  6391. type := t(SyntaxTree.MathArrayType);
  6392. IF type.form = SyntaxTree.Static THEN
  6393. imm := IntermediateCode.Immediate(sizeType,val);
  6394. next := NewLabel();
  6395. BrneL(next,imm,res);
  6396. IF increment THEN
  6397. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6398. ELSE
  6399. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6400. END;
  6401. Emit(MovReplace(position,res,imm));
  6402. BrL(end);
  6403. ELSE hasDynamicPart := TRUE;
  6404. END;
  6405. t := type.arrayBase.resolved;
  6406. val := val + 1;
  6407. IF next # NIL THEN SetLabel(next) END;
  6408. END;
  6409. IF hasDynamicPart THEN
  6410. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6411. Emit(Mov(position,res2,dim));
  6412. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6413. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6414. Emit(Add(position,res2,res2,imm));
  6415. Emit(Add(position,res2,res2,operand.tag));
  6416. IntermediateCode.MakeMemory(res2,sizeType);
  6417. Emit(MovReplace(position,res,res2));
  6418. ReleaseIntermediateOperand(res2);
  6419. END;
  6420. SetLabel(end);
  6421. Convert(res,sizeType);
  6422. InitOperand(result,ModeValue);
  6423. result.op := res;
  6424. END;
  6425. END MathArrayLenOrIncr;
  6426. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6427. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6428. offset: LONGINT;
  6429. BEGIN
  6430. offset := operand.dimOffset+DynamicDim(type)-1;
  6431. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6432. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6433. val := SHORT(dim.intValue);
  6434. t := SemanticChecker.ArrayBase(type,val);
  6435. type := t.resolved(SyntaxTree.ArrayType);
  6436. IF type.form = SyntaxTree.Static THEN
  6437. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6438. ELSE
  6439. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6440. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6441. END;
  6442. UseIntermediateOperand(res);
  6443. InitOperand(result,ModeValue);
  6444. result.op := res;
  6445. ELSE
  6446. Convert(dim,addressType);
  6447. IF ~isUnchecked THEN
  6448. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6449. END;
  6450. end := NewLabel(); next := NIL;
  6451. (* ReuseCopy(dim,res); *)
  6452. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6453. Emit(Mov(position,res,dim));
  6454. Convert(res,sizeType);
  6455. Convert(res,sizeType);
  6456. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6457. WHILE t IS SyntaxTree.ArrayType DO
  6458. type := t(SyntaxTree.ArrayType);
  6459. IF type.form = SyntaxTree.Static THEN
  6460. imm := IntermediateCode.Immediate(sizeType,val);
  6461. next := NewLabel();
  6462. BrneL(next,imm,res);
  6463. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6464. Emit(MovReplace(position,res,imm));
  6465. BrL(end);
  6466. ELSE hasDynamicPart := TRUE;
  6467. END;
  6468. t := type.arrayBase.resolved;
  6469. val := val + 1;
  6470. IF next # NIL THEN SetLabel(next) END;
  6471. END;
  6472. IF hasDynamicPart THEN
  6473. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6474. Convert(res2,addressType);
  6475. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6476. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6477. Emit(Sub(position,res2,imm,res2));
  6478. Emit(Add(position,res2,res2,operand.tag));
  6479. IntermediateCode.MakeMemory(res2,sizeType);
  6480. Emit(MovReplace(position,res,res2));
  6481. ReleaseIntermediateOperand(res2);
  6482. END;
  6483. SetLabel(end);
  6484. Convert(res,sizeType);
  6485. InitOperand(result,ModeValue);
  6486. result.op := res;
  6487. END;
  6488. END ArrayLen;
  6489. (**
  6490. create a temporary variable in current scope
  6491. **)
  6492. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6493. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6494. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6495. BEGIN
  6496. IF ~register THEN
  6497. v := temporaries.GetFreeVariable(type, untraced, index);
  6498. ELSE
  6499. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6500. END;
  6501. scope := currentScope;
  6502. (*
  6503. v := NIL; (* disable free variable managemenet for the time being *)
  6504. *)
  6505. name := temporaries.GetUID();
  6506. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6507. variable.SetType(type);
  6508. variable.SetAccess(SyntaxTree.Hidden);
  6509. variable.SetUntraced(untraced);
  6510. IF v = NIL THEN
  6511. temporaries.AddVariable(variable);
  6512. IF ~register THEN
  6513. IF scope.lastVariable # NIL THEN
  6514. offset := scope.lastVariable.offsetInBits;
  6515. ELSE
  6516. offset := 0;
  6517. END;
  6518. DEC(offset,system.SizeOf(variable.type));
  6519. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6520. variable(SyntaxTree.Variable).SetOffset(offset);
  6521. scope.AddVariable(variable(SyntaxTree.Variable));
  6522. scope.EnterSymbol(variable, duplicate);
  6523. ASSERT(~duplicate);
  6524. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6525. ELSE
  6526. variable.SetUseRegister(TRUE);
  6527. variable(SyntaxTree.Variable).SetOffset(0);
  6528. END;
  6529. ELSE (* v # NIL *)
  6530. (* reuse slot for new variable, do not create new slot ! *)
  6531. temporaries.SetVariable(index, variable);
  6532. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6533. ASSERT(~register);
  6534. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6535. ASSERT(v.offsetInBits # 0);
  6536. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6537. scope.EnterSymbol(variable, duplicate);
  6538. ASSERT(~duplicate);
  6539. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6540. END;
  6541. RETURN variable(SyntaxTree.Variable)
  6542. END GetTemporaryVariable;
  6543. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6544. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6545. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6546. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6547. i: LONGINT; duplicate: BOOLEAN;
  6548. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6549. VAR variable: SyntaxTree.Variable;
  6550. BEGIN
  6551. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6552. variable.SetType(type);
  6553. recordScope.AddVariable(variable);
  6554. END AddVariable;
  6555. BEGIN
  6556. name := "@ArrayDescriptor";
  6557. Basic.AppendNumber(name,dimensions);
  6558. identifier := SyntaxTree.NewIdentifier(name);
  6559. parentScope := module.module.moduleScope;
  6560. symbol := parentScope.FindSymbol(identifier);
  6561. IF symbol # NIL THEN
  6562. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6563. type := typeDeclaration.declaredType;
  6564. ELSE
  6565. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6566. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6567. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6568. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6569. recordType.SetTypeDeclaration(typeDeclaration);
  6570. recordType.SetState(SyntaxTree.Resolved);
  6571. typeDeclaration.SetDeclaredType(recordType);
  6572. AddVariable("@ptr",system.anyType);
  6573. AddVariable("@adr",system.addressType);
  6574. AddVariable("@flags",system.addressType);
  6575. AddVariable("@dim",system.addressType);
  6576. AddVariable("@elementSize",system.addressType);
  6577. FOR i := 0 TO dimensions-1 DO
  6578. name := "@len";
  6579. Basic.AppendNumber(name,i);
  6580. AddVariable(name,system.addressType);
  6581. name := "@incr";
  6582. Basic.AppendNumber(name,i);
  6583. AddVariable(name,system.addressType);
  6584. END;
  6585. parentScope.AddTypeDeclaration(typeDeclaration);
  6586. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6587. ASSERT(~duplicate);
  6588. type := recordType;
  6589. END;
  6590. RETURN type
  6591. END GetMathArrayDescriptorType;
  6592. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6593. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6594. BEGIN
  6595. NEW(string, LEN(s)); COPY(s, string^);
  6596. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6597. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6598. sv.SetType(type);
  6599. Designate(sv,res);
  6600. Emit(Push(position,res.tag));
  6601. Emit(Push(position,res.op));
  6602. ReleaseOperand(res);
  6603. END PushConstString;
  6604. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6605. BEGIN
  6606. IF b THEN
  6607. Emit(Push(Basic.invalidPosition, true));
  6608. ELSE
  6609. Emit(Push(Basic.invalidPosition, false));
  6610. END;
  6611. END PushConstBoolean;
  6612. PROCEDURE PushConstSet(v: SET);
  6613. VAR value: SyntaxTree.Value; op: Operand;
  6614. BEGIN
  6615. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6616. value.SetType(system.setType);
  6617. Evaluate(value, op);
  6618. Emit(Push(Basic.invalidPosition, op.op));
  6619. ReleaseOperand(op);
  6620. END PushConstSet;
  6621. PROCEDURE PushConstInteger(v: LONGINT);
  6622. VAR value: SyntaxTree.Value; op: Operand;
  6623. BEGIN
  6624. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6625. value.SetType(system.longintType);
  6626. Evaluate(value, op);
  6627. Emit(Push(Basic.invalidPosition, op.op));
  6628. ReleaseOperand(op);
  6629. END PushConstInteger;
  6630. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6631. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6632. section: IntermediateCode.Section;
  6633. BEGIN
  6634. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6635. Global.GetSymbolSegmentedName(symbol, name);
  6636. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6637. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6638. procedure.SetScope(moduleScope);
  6639. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6640. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6641. procedure.SetAccess(SyntaxTree.Hidden);
  6642. currentScope := procedureScope;
  6643. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6644. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  6645. RETURN section;
  6646. END OpenInitializer;
  6647. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6648. BEGIN
  6649. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6650. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6651. section := prev;
  6652. END CloseInitializer;
  6653. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6654. VAR name: SyntaxTree.IdentifierString;
  6655. parameter: SyntaxTree.Parameter;
  6656. type: SyntaxTree.Type;
  6657. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6658. BEGIN
  6659. InitOperand(op,ModeReference);
  6660. op.op := fp;
  6661. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6662. Dereference(op, x, FALSE);
  6663. result := op;
  6664. Symbol(symbol, op);
  6665. END Field;
  6666. PROCEDURE Direction(direction: LONGINT): SET;
  6667. BEGIN
  6668. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6669. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6670. ELSE HALT(100);
  6671. END;
  6672. END Direction;
  6673. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6674. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6675. BEGIN
  6676. Field(port, op);
  6677. ToMemory(op.op,addressType,0);
  6678. Emit(Push(Basic.invalidPosition, op.op));
  6679. ReleaseOperand(op);
  6680. Basic.GetString(modifier.identifier, name);
  6681. PushConstString(name);
  6682. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6683. ASSERT(SemanticChecker.IsStringType(value.type));
  6684. Designate(value, op);
  6685. Emit(Push(modifier.position, op.tag));
  6686. Emit(Push(modifier.position, op.op));
  6687. ReleaseOperand(op);
  6688. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6689. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6690. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6691. Evaluate(value, op);
  6692. Emit(Push(modifier.position, op.op));
  6693. ReleaseOperand(op);
  6694. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6695. ELSE
  6696. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6697. END;
  6698. END AddPortProperty;
  6699. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6700. VAR modifier: SyntaxTree.Modifier;
  6701. BEGIN
  6702. modifier := parameter.modifiers;
  6703. WHILE modifier # NIL DO
  6704. AddPortProperty(parameter,modifier, modifier.expression);
  6705. modifier := modifier.nextModifier;
  6706. END;
  6707. END AddPortProperties;
  6708. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6709. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6710. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6711. PROCEDURE PushLens(type: SyntaxTree.Type);
  6712. BEGIN
  6713. IF IsSemiDynamicArray(type) THEN
  6714. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6715. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6716. Emit(Push(Basic.invalidPosition, op.op));
  6717. ReleaseOperand(op);
  6718. INC(dim);
  6719. ELSIF IsStaticArray(type) THEN
  6720. len := len * type(SyntaxTree.ArrayType).staticLength;
  6721. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6722. INC(dim);
  6723. ELSE
  6724. baseType := type;
  6725. END;
  6726. END PushLens;
  6727. BEGIN
  6728. (* cell *)
  6729. IF parameter.type IS SyntaxTree.ArrayType THEN
  6730. type := parameter.type;
  6731. dim := 0;
  6732. len := 1;
  6733. PushLens(type);
  6734. portType := baseType.resolved(SyntaxTree.PortType);
  6735. ELSE
  6736. portType := parameter.type(SyntaxTree.PortType);
  6737. END;
  6738. PushSelfPointer();
  6739. (* port / array of ports *)
  6740. IF IsStaticArray(type) THEN
  6741. PushConstInteger(len);
  6742. END;
  6743. Field(parameter, op);
  6744. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6745. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6746. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6747. Designate(d, op);*)
  6748. Emit(Push(Basic.invalidPosition, op.op));
  6749. ReleaseOperand(op);
  6750. (* name *)
  6751. PushConstString(name);
  6752. (* inout *)
  6753. PushConstSet(Direction(portType.direction));
  6754. (* width *)
  6755. PushConstInteger(portType.sizeInBits);
  6756. IF parameter.type IS SyntaxTree.PortType THEN
  6757. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6758. AddPortProperties(parameter);
  6759. ELSIF IsStaticArray(type)THEN
  6760. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6761. ELSIF IsSemiDynamicArray(type) THEN
  6762. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6763. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6764. Emit(Add(position,reg, sp, size));
  6765. (* dim *)
  6766. PushConstInteger(dim);
  6767. (* len array *)
  6768. Emit(Push(position, reg));
  6769. ReleaseIntermediateOperand(reg);
  6770. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6771. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6772. Emit(Add(position, sp,sp, size));
  6773. ELSE
  6774. HALT(100);
  6775. END;
  6776. END Parameter;
  6777. BEGIN
  6778. IF backend.cellsAreObjects THEN
  6779. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6780. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6781. END;
  6782. parameter := x.firstParameter;
  6783. WHILE (parameter # NIL) DO
  6784. type := parameter.type.resolved;
  6785. WHILE (type IS SyntaxTree.ArrayType) DO
  6786. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6787. END;
  6788. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6789. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6790. Parameter(name,parameter);
  6791. END;
  6792. parameter := parameter.nextParameter;
  6793. END;
  6794. ELSE HALT(200)
  6795. END;
  6796. END AddPorts;
  6797. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6798. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6799. BEGIN
  6800. Symbol(cell,op);
  6801. ToMemory(op.op,addressType,0);
  6802. Emit(Push(position,op.op));
  6803. ReleaseOperand(op);
  6804. property.GetName(name);
  6805. (* does not work when inheritance is used:
  6806. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6807. *)
  6808. PushConstString(name);
  6809. IF (value # NIL) THEN
  6810. ASSERT(
  6811. SemanticChecker.IsStringType(property.type)
  6812. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6813. OR (property.type.resolved IS SyntaxTree.FloatType)
  6814. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6815. OR (property.type.resolved IS SyntaxTree.SetType)
  6816. );
  6817. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6818. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6819. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6820. Designate(d, op);
  6821. IF SemanticChecker.IsStringType(property.type) THEN
  6822. Emit(Push(Basic.invalidPosition, op.tag))
  6823. END;
  6824. Emit(Push(Basic.invalidPosition, op.op));
  6825. ReleaseOperand(op);
  6826. END;
  6827. IF value = NIL THEN
  6828. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6829. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6830. ASSERT(SemanticChecker.IsStringType(value.type));
  6831. Designate(value, op);
  6832. PushString(op, value.type);
  6833. ReleaseOperand(op);
  6834. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6835. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6836. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6837. Evaluate(value, op);
  6838. Emit(Push(property.position, op.op));
  6839. ReleaseOperand(op);
  6840. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6841. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6842. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6843. Evaluate(value, op);
  6844. Emit(Push(property.position, op.op));
  6845. ReleaseOperand(op);
  6846. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6847. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6848. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6849. Evaluate(value, op);
  6850. Emit(Push(property.position, op.op));
  6851. ReleaseOperand(op);
  6852. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6853. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6854. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6855. Evaluate(value, op);
  6856. Emit(Push(property.position, op.op));
  6857. ReleaseOperand(op);
  6858. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6859. ELSE
  6860. HALT(200);
  6861. END;
  6862. END AddProperty;
  6863. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6864. VAR symbol: SyntaxTree.Symbol;
  6865. BEGIN
  6866. WHILE modifier # NIL DO
  6867. symbol := cellType.FindProperty(modifier.identifier);
  6868. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6869. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6870. modifier := modifier.nextModifier;
  6871. END;
  6872. END AddModifiers;
  6873. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6874. VAR last: SyntaxTree.Modifier;
  6875. BEGIN
  6876. IF to = NIL THEN
  6877. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6878. ELSE
  6879. last := to;
  6880. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6881. last := last.nextModifier;
  6882. END;
  6883. IF last.identifier # this.identifier THEN
  6884. ASSERT(last.nextModifier = NIL);
  6885. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6886. END;
  6887. END;
  6888. END AppendModifier;
  6889. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6890. BEGIN
  6891. WHILE this # NIL DO
  6892. AppendModifier(to, this);
  6893. this := this.nextModifier;
  6894. END;
  6895. END AppendModifiers;
  6896. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6897. VAR base: SyntaxTree.Type;
  6898. BEGIN
  6899. AppendModifiers(to, c.modifiers);
  6900. base := c.GetBaseValueType();
  6901. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6902. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6903. END;
  6904. END AppendCellTypeModifiers;
  6905. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6906. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6907. BEGIN
  6908. Basic.GetString(modifier.identifier, name);
  6909. PushConstString(name);
  6910. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6911. ASSERT(SemanticChecker.IsStringType(value.type));
  6912. Designate(value, op);
  6913. PushString(op, value.type);
  6914. ReleaseOperand(op);
  6915. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6916. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6917. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6918. Evaluate(value, op);
  6919. Emit(Push(modifier.position, op.op));
  6920. ReleaseOperand(op);
  6921. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6922. ELSE
  6923. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6924. END;
  6925. END AddPortProperty;
  6926. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6927. BEGIN
  6928. WHILE modifier # NIL DO
  6929. AddPortProperty(modifier, modifier.expression);
  6930. modifier := modifier.nextModifier;
  6931. END;
  6932. END AddPortProperties;
  6933. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6934. VAR op: Operand;
  6935. BEGIN
  6936. Evaluate(p, op);
  6937. Emit(Push(p.position, op.op));
  6938. ReleaseOperand(op);
  6939. IF p IS SyntaxTree.Designator THEN
  6940. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6941. END;
  6942. END PushPort;
  6943. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6944. VAR tmp: IntermediateCode.Operand;
  6945. BEGIN
  6946. actualType := actualType.resolved;
  6947. IF actualType IS SyntaxTree.StringType THEN
  6948. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6949. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6950. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6951. ELSE
  6952. tmp := op.tag;
  6953. IntermediateCode.MakeMemory(tmp,addressType);
  6954. Emit(Push(position,tmp));
  6955. END;
  6956. Emit(Push(position,op.op))
  6957. END PushString;
  6958. (* conservative check if x is potentially on the heap, excluding the module heap
  6959. required for generational garbage collector
  6960. *)
  6961. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6962. BEGIN
  6963. RETURN TRUE;
  6964. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6965. passed by reference.
  6966. pos := x.position.start;
  6967. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6968. x := x(SyntaxTree.Designator).left;
  6969. END;
  6970. RETURN x # NIL;
  6971. *)
  6972. END OnHeap;
  6973. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6974. VAR
  6975. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6976. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6977. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6978. tmp:IntermediateCode.Operand;
  6979. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6980. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6981. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6982. dest: IntermediateCode.Operand;
  6983. staticLength: LONGINT; itype: IntermediateCode.Type;
  6984. convert,isTensor: BOOLEAN;
  6985. recordType: SyntaxTree.RecordType;
  6986. baseType: SyntaxTree.Type;
  6987. left: SyntaxTree.Expression;
  6988. call: SyntaxTree.Designator;
  6989. procedure: SyntaxTree.Procedure;
  6990. temporaryVariable: SyntaxTree.Variable;
  6991. dummy: IntermediateCode.Operand;
  6992. customBuiltin: SyntaxTree.CustomBuiltin;
  6993. isVarPar: ARRAY 3 OF BOOLEAN;
  6994. callsection: Sections.Section;
  6995. segmentedName: Basic.SegmentedName;
  6996. needsTrace: BOOLEAN;
  6997. n: ARRAY 256 OF CHAR;
  6998. modifier: SyntaxTree.Modifier;
  6999. previous, init: IntermediateCode.Section;
  7000. prevScope: SyntaxTree.Scope;
  7001. firstPar: LONGINT;
  7002. saved: RegisterEntry;
  7003. callingConvention: SyntaxTree.CallingConvention;
  7004. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7005. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7006. priority: IntermediateCode.Operand;
  7007. op,callop: Operand;
  7008. BEGIN
  7009. IF type = NIL THEN RETURN END;
  7010. type := type.resolved;
  7011. IF type IS SyntaxTree.PointerType THEN
  7012. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7013. END;
  7014. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7015. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7016. recordScope := type(SyntaxTree.RecordType).recordScope;
  7017. IF recordScope.bodyProcedure # NIL THEN
  7018. procedure := recordScope.bodyProcedure;
  7019. body := procedure.procedureScope.body;
  7020. Emit(Push(position,self));
  7021. IF body.isActive THEN
  7022. StaticCallOperand(callop,procedure);
  7023. Emit(Push(position,callop.op));
  7024. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7025. Convert(priority,sizeType);
  7026. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7027. END;
  7028. Emit(Push(position,priority));
  7029. ReleaseIntermediateOperand(priority);
  7030. IF backend.cooperative THEN
  7031. Emit(Push(position,self));
  7032. CallThis(position,"Activities","Create",3)
  7033. ELSE
  7034. flags := 0;
  7035. IF body.isSafe THEN
  7036. flags := 1;
  7037. END;
  7038. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7039. Emit(Push(position,self));
  7040. CallThis(position,"Objects","CreateProcess",4)
  7041. END;
  7042. ELSE
  7043. Emit(Push(position,self));
  7044. StaticCallOperand(callop,procedure);
  7045. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7046. END;
  7047. Emit(Pop(position,self));
  7048. END;
  7049. END CallBodies;
  7050. PROCEDURE PushTD(type: SyntaxTree.Type);
  7051. VAR op: IntermediateCode.Operand;
  7052. BEGIN
  7053. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7054. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7055. ELSE
  7056. IF type.resolved IS SyntaxTree.PointerType THEN
  7057. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7058. END;
  7059. op := TypeDescriptorAdr(type.resolved);
  7060. Emit(Push(position,op));
  7061. END
  7062. END PushTD;
  7063. BEGIN
  7064. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7065. dest := destination; destination := emptyOperand;
  7066. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7067. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7068. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7069. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7070. CASE x.id OF
  7071. (* ---- COPY ----- *)
  7072. |Global.Copy:
  7073. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7074. (* ---- EXCL, INCL----- *)
  7075. |Global.Excl,Global.Incl:
  7076. Evaluate(p0,s0);
  7077. Evaluate(p1,s1);
  7078. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7079. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7080. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7081. END;
  7082. ReuseCopy(res,s0.op);
  7083. ReleaseOperand(s0);
  7084. Reuse1(tmp,s1.op);
  7085. ReleaseOperand(s1);
  7086. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7087. IF x.id = Global.Excl THEN
  7088. Emit(Not(position,tmp,tmp));
  7089. Emit(And(position,res,res,tmp));
  7090. ELSE
  7091. Emit(Or(position,res,res,tmp));
  7092. END;
  7093. ReleaseIntermediateOperand(tmp);
  7094. Designate(p0,s0);
  7095. ToMemory(s0.op,s1.op.type,0);
  7096. Emit(Mov(position,s0.op,res));
  7097. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7098. (* ---- DISPOSE ----- *)
  7099. |Global.Dispose:
  7100. Designate(p0,s0);
  7101. Emit(Push(position,s0.op));
  7102. ReleaseOperand(s0);
  7103. CallThis(position,"Runtime","Dispose", 1);
  7104. (* ---- GETPROCEDURE ----- *)
  7105. |Global.GetProcedure:
  7106. Designate(p0,s0);
  7107. PushString(s0,p0.type);
  7108. Designate(p1,s1);
  7109. PushString(s1,p1.type);
  7110. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7111. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7112. ELSE PushTD(procedureType.firstParameter.type)
  7113. END;
  7114. PushTD(procedureType.returnType);
  7115. Designate(p2,s2);
  7116. Emit(Push(position,s2.op));
  7117. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7118. CallThis(position,"Modules","GetProcedure", 7);
  7119. (* ---- ASH, LSH, ROT ----- *)
  7120. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7121. Evaluate(p0,s0);
  7122. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7123. (* make unsigned arguments in order to produced a logical shift *)
  7124. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7125. convert:= TRUE;
  7126. itype := s0.op.type;
  7127. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7128. Convert(s0.op,itype);
  7129. ELSE
  7130. convert := FALSE;
  7131. END;
  7132. END;
  7133. Evaluate(p1,s1);
  7134. IF IsIntegerConstant(p1,hint) THEN
  7135. ReuseCopy(reg,s0.op);
  7136. IF hint > 0 THEN
  7137. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7138. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7139. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7140. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7141. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7142. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7143. END;
  7144. ELSIF hint < 0 THEN
  7145. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7146. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7147. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7148. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7149. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7150. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7151. END;
  7152. END;
  7153. ReleaseOperand(s0); ReleaseOperand(s1);
  7154. ELSE
  7155. exit := NewLabel();
  7156. end := NewLabel();
  7157. ReuseCopy(reg,s0.op);
  7158. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7159. Reuse1(tmp,s1.op);
  7160. Emit(Neg(position,tmp,s1.op));
  7161. Convert(tmp,s1.op.type);
  7162. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7163. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7164. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7165. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7166. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7167. END;
  7168. ReleaseIntermediateOperand(tmp);
  7169. BrL(end);
  7170. SetLabel(exit);
  7171. ReuseCopy(tmp,s1.op);
  7172. Convert(tmp,s1.op.type);
  7173. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7174. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7175. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7176. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7177. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7178. END;
  7179. ReleaseIntermediateOperand(tmp);
  7180. SetLabel(end);
  7181. ReleaseOperand(s0); ReleaseOperand(s1);
  7182. END;
  7183. InitOperand(result,ModeValue);
  7184. IF convert THEN
  7185. itype := reg.type;
  7186. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7187. Convert(reg,itype);
  7188. END;
  7189. result.op := reg;
  7190. (* ---- CAP ----- *)
  7191. |Global.Cap:
  7192. Evaluate(p0,result);
  7193. ReuseCopy(reg,result.op);
  7194. ReleaseIntermediateOperand(result.op);
  7195. ignore := NewLabel();
  7196. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7197. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7198. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7199. SetLabel(ignore);
  7200. result.op := reg;
  7201. (* ---- CHR ----- *)
  7202. |Global.Chr, Global.Chr32:
  7203. Evaluate(p0,result);
  7204. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7205. |Global.Entier, Global.EntierH:
  7206. Evaluate(p0,result);
  7207. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7208. (* ---- MIN and MAX ----- *)
  7209. |Global.Max,Global.Min:
  7210. Evaluate(p0,s0);
  7211. Evaluate(p1,s1);
  7212. Reuse2(res,s0.op,s1.op);
  7213. else := NewLabel();
  7214. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7215. ELSE BrltL(else,s1.op,s0.op) END;
  7216. Emit(Mov(position,res,s0.op));
  7217. ReleaseOperand(s0);
  7218. end := NewLabel();
  7219. BrL(end);
  7220. SetLabel(else);
  7221. Emit(MovReplace(position,res,s1.op));
  7222. SetLabel(end);
  7223. ReleaseOperand(s1);
  7224. InitOperand(result,ModeValue);
  7225. result.op := res;
  7226. (* ---- ODD ----- *)
  7227. |Global.Odd:
  7228. IF ~conditional THEN
  7229. ConditionToValue(x)
  7230. ELSE
  7231. Evaluate(p0,result);
  7232. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7233. Reuse1(res,result.op);
  7234. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7235. ReleaseIntermediateOperand(result.op);
  7236. result.op := res;
  7237. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7238. ReleaseOperand(result);
  7239. BrL(falseLabel);
  7240. END;
  7241. (* ---- ORD ----- *)
  7242. |Global.Ord, Global.Ord32:
  7243. Evaluate(p0,result);
  7244. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7245. (* ---- SHORT, LONG ----- *)
  7246. |Global.Short, Global.Long:
  7247. Evaluate(p0,result);
  7248. IF x.type IS SyntaxTree.ComplexType THEN
  7249. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7250. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7251. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7252. ELSE
  7253. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7254. END
  7255. (* ---- HALT, SYSTEM.HALT----- *)
  7256. |Global.Halt, Global.systemHalt:
  7257. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7258. EmitTrap (position, val);
  7259. (* ---- ASSERT ----- *)
  7260. |Global.Assert:
  7261. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7262. trueL := NewLabel();
  7263. falseL := NewLabel();
  7264. Condition(p0,trueL,falseL);
  7265. IF p1 = NIL THEN val := AssertTrap
  7266. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7267. END;
  7268. SetLabel(falseL);
  7269. EmitTrap(position,val);
  7270. SetLabel(trueL);
  7271. END;
  7272. (*
  7273. Emit(TrapC(result.op,val);
  7274. *)
  7275. (* ---- INC, DEC----- *)
  7276. |Global.Inc,Global.Dec:
  7277. Expression(p0); adr := result.op;
  7278. LoadValue(result,p0.type); l := result;
  7279. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7280. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7281. END;
  7282. IF x.id = Global.Inc THEN
  7283. Emit(Add(position,l.op,l.op,r.op));
  7284. ELSE
  7285. Emit(Sub(position,l.op,l.op,r.op));
  7286. END;
  7287. ReleaseOperand(l); ReleaseOperand(r);
  7288. (* ---- LEN ----- *)
  7289. |Global.Len: (* dynamic length, static length done by checker *)
  7290. Designate(p0,operand);
  7291. IF p1 = NIL THEN
  7292. InitOperand(l,ModeValue);
  7293. l.op := IntermediateCode.Immediate(sizeType,0);
  7294. ELSE
  7295. Evaluate(p1,l);
  7296. END;
  7297. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7298. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7299. Dereference(operand, p0.type.resolved, FALSE);
  7300. END;
  7301. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7302. ReleaseOperand(operand); ReleaseOperand(l);
  7303. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7304. ASSERT(p1 # NIL);
  7305. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7306. Dereference(operand,p0.type.resolved,FALSE);
  7307. END;
  7308. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7309. ReleaseOperand(operand); ReleaseOperand(l);
  7310. ELSE HALT(100);
  7311. END;
  7312. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7313. (* ---- FIRST ---- *)
  7314. |Global.First:
  7315. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7316. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7317. ELSE
  7318. Designate(p0, result)
  7319. END
  7320. (* ---- LAST ---- *)
  7321. |Global.Last:
  7322. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7323. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7324. ELSE
  7325. Designate(p0, result);
  7326. (* make sure result.op is a register *)
  7327. tmp := result.op;
  7328. ReuseCopy(result.op, result.op);
  7329. ReleaseIntermediateOperand(tmp);
  7330. (* add offset to result.op *)
  7331. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7332. END
  7333. (* ---- STEP ---- *)
  7334. |Global.Step:
  7335. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7336. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7337. ELSE
  7338. Designate(p0, result);
  7339. (* make sure result.op is a register *)
  7340. tmp := result.op;
  7341. ReuseCopy(result.op, result.op);
  7342. ReleaseIntermediateOperand(tmp);
  7343. (* add offset to result.op *)
  7344. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7345. END
  7346. (* ---- RE ---- *)
  7347. |Global.Re:
  7348. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7349. Designate(p0, result)
  7350. ELSE
  7351. Evaluate(p0, result)
  7352. END
  7353. (* ---- IM ---- *)
  7354. |Global.Im:
  7355. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7356. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7357. Designate(p0, result);
  7358. (* make sure result.op is a register *)
  7359. tmp := result.op;
  7360. ReuseCopy(result.op, result.op);
  7361. ReleaseIntermediateOperand(tmp);
  7362. (* add offset to result.op *)
  7363. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7364. (* ---- ABS ----- *)
  7365. |Global.Abs:
  7366. Evaluate(p0,operand);
  7367. type := p0.type.resolved;
  7368. InitOperand(result,ModeValue);
  7369. Reuse1a(result.op,operand.op,dest);
  7370. Emit(Abs(position,result.op,operand.op));
  7371. ReleaseOperand(operand);
  7372. (* ---- WAIT ----- *)
  7373. |Global.Wait:
  7374. Evaluate(p0,operand);
  7375. Emit(Push(position,operand.op));
  7376. ReleaseOperand(operand);
  7377. CallThis(position,"Activities","Wait", 1);
  7378. (* ---- NEW ----- *)
  7379. |Global.New:
  7380. (*! the following code is only correct for "standard" Oberon calling convention *)
  7381. IF x.type # NIL THEN
  7382. type := x.type.resolved;
  7383. firstPar := 0;
  7384. ELSE
  7385. type := p0.type.resolved;
  7386. firstPar := 1;
  7387. END;
  7388. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7389. THEN
  7390. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7391. IF backend.cooperative THEN
  7392. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7393. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7394. IF recordType.isObject THEN
  7395. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7396. IF recordType.IsActive() THEN
  7397. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7398. END;
  7399. IF recordType.IsProtected() THEN
  7400. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7401. END;
  7402. ELSE
  7403. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7404. END;
  7405. END;
  7406. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7407. CallThis(position,"Runtime","New", 1);
  7408. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7409. Emit(Result(position, pointer));
  7410. exit := NewLabel();
  7411. BreqL(exit,pointer,nil);
  7412. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7413. GetRecordTypeName (recordType,name);
  7414. IF ~recordType.isObject THEN
  7415. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7416. END;
  7417. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7418. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7419. IF recordType.isObject THEN
  7420. IF recordType.IsProtected() THEN
  7421. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7422. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7423. END;
  7424. IF recordType.IsActive() THEN
  7425. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7426. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7427. END;
  7428. END;
  7429. END;
  7430. (* initialize fields *)
  7431. IF type(SyntaxTree.PointerType).isPlain THEN
  7432. size := 0;
  7433. ELSIF recordType.isObject THEN
  7434. size := BaseObjectTypeSize;
  7435. ELSE
  7436. size := BaseRecordTypeSize;
  7437. END;
  7438. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7439. (* call initializer *)
  7440. constructor := GetConstructor(recordType);
  7441. IF constructor # NIL THEN
  7442. (*! should be unified with ProcedureCallDesignator *)
  7443. Emit(Push(position,pointer));
  7444. ReleaseIntermediateOperand(pointer);
  7445. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7446. FOR i := firstPar TO x.parameters.Length()-1 DO
  7447. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7448. formalParameter := formalParameter.nextParameter;
  7449. END;
  7450. (* static call of the constructor *)
  7451. GetCodeSectionNameForSymbol(constructor,name);
  7452. ASSERT(~constructor.isInline);
  7453. IF constructor.scope.ownerModule # module.module THEN
  7454. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7455. ELSE
  7456. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7457. END;
  7458. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7459. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7460. Emit(Pop(position,pointer));
  7461. END;
  7462. (* call bodies *)
  7463. CallBodies(pointer,type);
  7464. SetLabel(exit);
  7465. needsTrace := p0.NeedsTrace();
  7466. IF needsTrace THEN ModifyAssignments(true) END;
  7467. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7468. Emit(Push(position, pointer));
  7469. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7470. Emit(Pop(position, pointer));
  7471. END;
  7472. Designate(p0,l);
  7473. IF needsTrace THEN
  7474. CallAssignPointer(l.op, pointer);
  7475. ELSE
  7476. ToMemory(l.op,addressType,0);
  7477. Emit(Mov(position,l.op,pointer));
  7478. END;
  7479. ReleaseIntermediateOperand(pointer);
  7480. ReleaseOperand(l);
  7481. IF needsTrace THEN ModifyAssignments(false) END;
  7482. ELSE (* not cooperative backend *)
  7483. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7484. IF temporaryVariable # NIL THEN
  7485. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7486. ELSE
  7487. Designate(p0,l);
  7488. END;
  7489. (* l.op contains address of pointer to record *)
  7490. Emit(Push(position,l.op)); (* address for use after syscall *)
  7491. Emit(Push(position,l.op));
  7492. ReleaseOperand(l);
  7493. (* push type descriptor *)
  7494. reg := TypeDescriptorAdr(recordType);
  7495. Emit(Push(position,reg));
  7496. ReleaseIntermediateOperand(reg);
  7497. (* push realtime flag *)
  7498. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7499. ELSE Emit(Push(position,false));
  7500. END;
  7501. CallThis(position,"Heaps","NewRec", 3);
  7502. (* check allocation success, if not successful then do not call initializers and bodies *)
  7503. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7504. Emit(Pop(position,pointer));
  7505. MakeMemory(reg,pointer,addressType,0);
  7506. ReleaseIntermediateOperand(pointer);
  7507. pointer := reg;
  7508. exit := NewLabel();
  7509. BreqL(exit,pointer,nil);
  7510. Emit(Push(position,pointer));
  7511. (* initialize fields *)
  7512. InitFields(recordType, pointer,0);
  7513. (* call initializer *)
  7514. constructor := GetConstructor(recordType);
  7515. IF constructor # NIL THEN
  7516. (*! should be unified with ProcedureCallDesignator *)
  7517. Emit(Push(position,pointer));
  7518. ReleaseIntermediateOperand(pointer);
  7519. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7520. FOR i := firstPar TO x.parameters.Length()-1 DO
  7521. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7522. formalParameter := formalParameter.nextParameter;
  7523. END;
  7524. (* static call of the constructor *)
  7525. GetCodeSectionNameForSymbol(constructor,name);
  7526. ASSERT(~constructor.isInline);
  7527. IF constructor.scope.ownerModule # module.module THEN
  7528. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7529. ELSE
  7530. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7531. END;
  7532. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7533. ELSE
  7534. ReleaseIntermediateOperand(pointer);
  7535. END;
  7536. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7537. Emit(Pop(position,pointer));
  7538. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7539. Designate(p0,l);
  7540. IF backend.writeBarriers & OnHeap(p0) THEN
  7541. SaveRegisters();ReleaseUsedRegisters(saved);
  7542. Emit(Push(position,l.op));
  7543. Emit(Push(position,pointer));
  7544. CallThis(position,"Heaps","Assign",2);
  7545. RestoreRegisters(saved);
  7546. ELSE
  7547. ToMemory(l.op,addressType,0);
  7548. Emit(Mov(position,l.op,pointer));
  7549. END;
  7550. ReleaseOperand(l);
  7551. result.tag := emptyOperand;
  7552. ELSIF (x.type # NIL) THEN
  7553. result := l; (* temporary variable is the result of NEW Type() *)
  7554. END;
  7555. (* call bodies *)
  7556. CallBodies(pointer,type);
  7557. ReleaseIntermediateOperand(pointer);
  7558. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7559. end := NewLabel();
  7560. BrL(end);
  7561. SetLabel(exit);
  7562. Designate(p0,l);
  7563. ToMemory(l.op,addressType,0);
  7564. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7565. ReleaseOperand(l);
  7566. SetLabel(end);
  7567. ELSE
  7568. SetLabel(exit);
  7569. END;
  7570. END;
  7571. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7572. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7573. IF ~backend.cooperative THEN (* simpler version *)
  7574. (*
  7575. push len0
  7576. push len1
  7577. push len2
  7578. push len_size
  7579. push len_adr
  7580. push tag
  7581. push static elements
  7582. push element size
  7583. push adr
  7584. *)
  7585. dim := 0;
  7586. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7587. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7588. parameter := x.parameters.GetExpression(i);
  7589. Evaluate(parameter,r);
  7590. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7591. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7592. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7593. END;
  7594. Emit(Push(position,r.op));
  7595. ReleaseOperand(r);
  7596. INC(dim);
  7597. END;
  7598. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7599. Emit(Mov(position, adr, sp));
  7600. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7601. Emit(Push(position, adr));
  7602. ReleaseIntermediateOperand(adr);
  7603. openDim := dim;
  7604. staticLength := 1;
  7605. IF type IS SyntaxTree.ArrayType THEN
  7606. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7607. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7608. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7609. END;
  7610. END;
  7611. IF SemanticChecker.ContainsPointer(type) THEN
  7612. tmp := TypeDescriptorAdr(type);
  7613. ELSE
  7614. tmp := nil;
  7615. END;
  7616. Emit(Push(position,tmp)); (* type descriptor *)
  7617. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7618. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7619. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7620. Designate(p0,l);
  7621. Emit(Push(position,l.op)); (* address *)
  7622. ReleaseOperand(l);
  7623. CallThis(position,"Heaps","NewArray", 6);
  7624. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7625. Emit(Add(position,sp,sp,tmp));
  7626. ELSE
  7627. dim := 0;
  7628. IntermediateCode.InitOperand(reg);
  7629. IF p1 # NIL THEN
  7630. FOR i := firstPar TO x.parameters.Length()-1 DO
  7631. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7632. parameter := x.parameters.GetExpression(i);
  7633. Evaluate(parameter,r);
  7634. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7635. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7636. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7637. END;
  7638. Emit(Push(position,r.op));
  7639. IF i=1 THEN
  7640. CopyInt(reg,r.op);
  7641. ELSE
  7642. MulInt(reg, reg, r.op);
  7643. END;
  7644. ReleaseOperand(r);
  7645. INC(dim);
  7646. END;
  7647. Convert(reg,addressType);
  7648. ELSE
  7649. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7650. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7651. END;
  7652. openDim := dim;
  7653. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7654. IF backend.cooperative THEN
  7655. size := ToMemoryUnits(system,system.SizeOf(type));
  7656. WHILE type IS SyntaxTree.ArrayType DO
  7657. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7658. END;
  7659. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7660. IF (size # 1) THEN
  7661. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7662. END;
  7663. Emit(Push(position,reg));
  7664. size := ToMemoryUnits(system,system.SizeOf(type));
  7665. IF (size # 1) THEN
  7666. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7667. END;
  7668. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7669. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7670. Emit(Push(position,reg));
  7671. ReleaseIntermediateOperand(reg);
  7672. CallThis(position,"Runtime","New", 1);
  7673. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7674. Emit(Result(position, pointer));
  7675. exit := NewLabel();
  7676. else := NewLabel();
  7677. BreqL(else,pointer,nil);
  7678. IF ~type.hasPointers THEN
  7679. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7680. ELSIF type IS SyntaxTree.RecordType THEN
  7681. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7682. ELSIF type IS SyntaxTree.ProcedureType THEN
  7683. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7684. ELSE
  7685. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7686. END;
  7687. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7688. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7689. 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))));
  7690. IF type IS SyntaxTree.RecordType THEN
  7691. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7692. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7693. ELSE
  7694. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7695. END;
  7696. i := openDim;
  7697. WHILE i > 0 DO
  7698. DEC (i);
  7699. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7700. END;
  7701. needsTrace := p0.NeedsTrace();
  7702. IF needsTrace THEN ModifyAssignments(true) END;
  7703. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7704. Emit(Push(position, pointer));
  7705. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7706. Emit(Pop(position, pointer));
  7707. END;
  7708. Designate(p0,l);
  7709. IF needsTrace THEN
  7710. CallAssignPointer(l.op, pointer);
  7711. ModifyAssignments(false);
  7712. ELSE
  7713. ToMemory(l.op,addressType,0);
  7714. Emit(Mov(position,l.op,pointer));
  7715. END;
  7716. ReleaseIntermediateOperand(pointer);
  7717. ReleaseOperand(l);
  7718. BrL(exit);
  7719. SetLabel(else);
  7720. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7721. Designate(p0,l);
  7722. IF needsTrace THEN
  7723. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7724. ELSE
  7725. ToMemory(l.op,addressType,0);
  7726. Emit(Mov(position,l.op,pointer));
  7727. END;
  7728. ReleaseOperand(l);
  7729. SetLabel(exit);
  7730. ELSE
  7731. (*! the following code is only correct for "standard" Oberon calling convention *)
  7732. IF SemanticChecker.ContainsPointer(type) THEN
  7733. IF type IS SyntaxTree.ArrayType THEN
  7734. staticLength := 1;
  7735. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7736. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7737. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7738. END;
  7739. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7740. MulInt(reg,reg,tmp);
  7741. END;
  7742. Designate(p0,l);
  7743. IF openDim > 0 THEN
  7744. Emit(Push(position,l.op)); (* address for use after syscall *)
  7745. END;
  7746. Emit(Push(position,l.op)); (* address *)
  7747. ReleaseOperand(l);
  7748. tmp := TypeDescriptorAdr(type);
  7749. Emit(Push(position,tmp)); (* type descriptor *)
  7750. ReleaseIntermediateOperand(tmp);
  7751. Emit(Push(position,reg)); (* number Elements *)
  7752. ReleaseIntermediateOperand(reg);
  7753. tmp := IntermediateCode.Immediate(addressType,dim);
  7754. Emit(Push(position,tmp)); (* dimensions *)
  7755. (* push realtime flag *)
  7756. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7757. ELSE Emit(Push(position,false));
  7758. END;
  7759. CallThis(position,"Heaps","NewArr",5)
  7760. ELSE
  7761. size := ToMemoryUnits(system,system.SizeOf(type));
  7762. IF (size # 1) THEN
  7763. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7764. (*
  7765. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7766. *)
  7767. END;
  7768. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7769. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7770. AddInt(reg, reg, tmp);
  7771. (*
  7772. Emit(Add(position,reg,reg,tmp));
  7773. *)
  7774. Designate(p0,l);
  7775. IF openDim >0 THEN
  7776. Emit(Push(position,l.op)); (* address for use after syscall *)
  7777. END;
  7778. Emit(Push(position,l.op)); (* address for syscall *)
  7779. ReleaseOperand(l); (* pointer address *)
  7780. Emit(Push(position,reg)); (* size *)
  7781. ReleaseIntermediateOperand(reg);
  7782. (* push realtime flag *)
  7783. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7784. ELSE Emit(Push(position,false));
  7785. END;
  7786. CallThis(position,"Heaps","NewSys", 3)
  7787. END;
  7788. IF openDim > 0 THEN
  7789. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7790. Emit(Pop(position,adr));
  7791. ToMemory(adr,addressType,0);
  7792. ReuseCopy(tmp,adr);
  7793. ReleaseIntermediateOperand(adr);
  7794. adr := tmp;
  7795. else := NewLabel();
  7796. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7797. i := openDim-1;
  7798. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7799. WHILE (i >= 0) DO
  7800. Emit(Pop(position,reg));
  7801. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7802. Emit(Mov(position,res,reg));
  7803. DEC(i);
  7804. END;
  7805. ReleaseIntermediateOperand(adr);
  7806. ReleaseIntermediateOperand(reg);
  7807. exit := NewLabel();
  7808. BrL(exit);
  7809. SetLabel(else);
  7810. (* else part: array could not be allocated *)
  7811. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7812. Emit(Add(position,sp,sp,tmp));
  7813. SetLabel(exit);
  7814. END;
  7815. END;
  7816. END;
  7817. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7818. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7819. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7820. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7821. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7822. callingConvention := procedureType.callingConvention;
  7823. left.SetType(procedure.type);
  7824. formalParameter := procedureType.firstParameter;
  7825. (* push array to allocate *)
  7826. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7827. formalParameter :=formalParameter.nextParameter;
  7828. (* push length array *)
  7829. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7830. (* push size *)
  7831. type := t0;
  7832. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7833. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7834. END;
  7835. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7836. Emit(Push(position,tmp));
  7837. (* *)
  7838. IF SemanticChecker.ContainsPointer(type) THEN
  7839. tmp := TypeDescriptorAdr(type);
  7840. ELSE
  7841. tmp := IntermediateCode.Immediate(addressType, 0);
  7842. END;
  7843. Emit(Push(position,tmp)); (* type descriptor *)
  7844. StaticCallOperand(result,procedure);
  7845. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7846. ReleaseOperand(result);
  7847. END;
  7848. (*
  7849. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7850. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7851. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7852. *)
  7853. ELSE
  7854. (*
  7855. push len0
  7856. push len1
  7857. push len2
  7858. push size
  7859. push len_adr
  7860. push element_size
  7861. push tag
  7862. push adr
  7863. *)
  7864. dim := 0;
  7865. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7866. isTensor := TRUE;
  7867. ELSE
  7868. isTensor := FALSE;
  7869. END;
  7870. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7871. IF ~isTensor THEN
  7872. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7873. END;
  7874. parameter := x.parameters.GetExpression(i);
  7875. Evaluate(parameter,r);
  7876. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7877. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7878. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7879. END;
  7880. Emit(Push(position,r.op));
  7881. ReleaseOperand(r);
  7882. INC(dim);
  7883. END;
  7884. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7885. Emit(Mov(position, adr, sp));
  7886. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7887. Emit(Push(position, adr));
  7888. ReleaseIntermediateOperand(adr);
  7889. openDim := dim;
  7890. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7891. IF isTensor THEN
  7892. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7893. ELSE
  7894. baseType := SemanticChecker.ArrayBase(type,openDim);
  7895. END;
  7896. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7897. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7898. IF SemanticChecker.ContainsPointer(baseType) THEN
  7899. tmp := TypeDescriptorAdr(baseType);
  7900. ELSE
  7901. tmp := nil;
  7902. END;
  7903. Emit(Push(position,tmp)); (* type descriptor *)
  7904. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7905. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7906. ELSE (* error message has already been emited *)
  7907. RETURN;
  7908. END;
  7909. Designate(p0,l);
  7910. IF isTensor THEN
  7911. Emit(Push(position,l.op)); (* address *)
  7912. ELSE
  7913. Emit(Push(position,l.tag)); (* address *)
  7914. END;
  7915. ReleaseOperand(l);
  7916. StaticCallOperand(result,procedure);
  7917. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7918. ReleaseOperand(result);
  7919. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7920. Emit(Add(position,sp,sp,tmp));
  7921. END;
  7922. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7923. THEN
  7924. IF ~backend.cellsAreObjects THEN RETURN END;
  7925. IF InCellScope(currentScope) THEN
  7926. PushSelfPointer()
  7927. ELSE
  7928. Emit(Push(position, nil));
  7929. END;
  7930. (* push temp address *)
  7931. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7932. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7933. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7934. (* l.op contains address of pointer to record *)
  7935. Emit(Push(position,l.op)); (* address for use after syscall *)
  7936. ReleaseOperand(l);
  7937. (* push type descriptor *)
  7938. reg := TypeDescriptorAdr(baseType);
  7939. Emit(Push(position,reg));
  7940. ReleaseIntermediateOperand(reg);
  7941. (* push name *)
  7942. (*Global.GetSymbolName(p0, n);*)
  7943. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7944. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7945. ELSE
  7946. Global.GetModuleName(module.module, n);
  7947. END;
  7948. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7949. (*type.typeDeclaration.GetName(n);*)
  7950. PushConstString(n);
  7951. (* push cellnet boolean *)
  7952. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7953. (* push engine boolean *)
  7954. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7955. (* allocate *)
  7956. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7957. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7958. (* l.op contains address of pointer to record *)
  7959. ToMemory(l.op,addressType,0);
  7960. (* l.op contains value of pointer to record *)
  7961. InitFields(baseType, l.op,0);
  7962. (* add capabilities *)
  7963. modifier := p0(SyntaxTree.Designator).modifiers;
  7964. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7965. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7966. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7967. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7968. END;
  7969. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7970. (*
  7971. modifier := baseType(SyntaxTree.CellType).modifiers;
  7972. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7973. modifier := p0(SyntaxTree.Designator).modifiers;
  7974. *)
  7975. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7976. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7977. (* l.op contains address of pointer to record *)
  7978. ToMemory(l.op,addressType,0);
  7979. (* l.op contains value of pointer to record *)
  7980. Emit(Push(position,l.op)); (* address for use after syscall *)
  7981. ReleaseOperand(l);
  7982. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7983. prevScope := currentScope;
  7984. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7985. previous := section;
  7986. section := init;
  7987. (* add ports *)
  7988. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7989. CloseInitializer(previous);
  7990. currentScope := prevScope;
  7991. Symbol(temporaryVariable,l);
  7992. ToMemory(l.op,addressType,0);
  7993. Emit(Push(position,l.op));
  7994. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7995. (*
  7996. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7997. IF constructor # NIL THEN
  7998. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7999. FOR i := 1 TO x.parameters.Length()-1 DO
  8000. p := x.parameters.GetExpression(i);
  8001. Global.GetSymbolName(parameter,name);
  8002. Evaluate(p, value);
  8003. ASSERT(value.type # NIL);
  8004. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8005. par := instance.AddParameter(name);
  8006. par.SetInteger(value.integer);
  8007. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8008. par := instance.AddParameter(name);
  8009. par.SetBoolean(value.boolean);
  8010. ELSE Error(x.position,NotYetImplemented)
  8011. END;
  8012. parameter := parameter.nextParameter
  8013. END;
  8014. END;
  8015. *)
  8016. (* call initializer *)
  8017. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8018. IF constructor # NIL THEN
  8019. (*! should be unified with ProcedureCallDesignator *)
  8020. IF backend.cellsAreObjects THEN
  8021. Symbol(temporaryVariable,l);
  8022. ToMemory(l.op,addressType,0);
  8023. Emit(Push(position,l.op));
  8024. ReleaseOperand(l);
  8025. END;
  8026. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8027. FOR i := firstPar TO x.parameters.Length()-1 DO
  8028. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8029. formalParameter := formalParameter.nextParameter;
  8030. END;
  8031. (* static call of the constructor *)
  8032. Global.GetSymbolSegmentedName(constructor,name);
  8033. ASSERT(~constructor.isInline);
  8034. IF constructor.scope.ownerModule # module.module THEN
  8035. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8036. ELSE
  8037. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8038. END;
  8039. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8040. (*ELSE
  8041. ReleaseIntermediateOperand(pointer);*)
  8042. END;
  8043. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8044. ToMemory(l.op, addressType, 0);
  8045. Designate(p0,s0);
  8046. ToMemory(s0.op,addressType,0);
  8047. Emit(Mov(position,s0.op,l.op));
  8048. ReleaseOperand(l);
  8049. ReleaseOperand(s0);
  8050. result.tag := emptyOperand;
  8051. (* start *)
  8052. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8053. (* push cell *)
  8054. Symbol(temporaryVariable, l);
  8055. ToMemory(l.op,addressType,0);
  8056. Emit(Push(Basic.invalidPosition,l.op));
  8057. (* push delegate *)
  8058. Emit(Push(Basic.invalidPosition,l.op));
  8059. ReleaseOperand(l);
  8060. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8061. Emit(Push(position, s1.op));
  8062. ReleaseOperand(s1);
  8063. CallThis(position,"ActiveCellsRuntime","Start",3);
  8064. END;
  8065. (*IF temporaryVariable # NIL THEN
  8066. end := NewLabel();
  8067. BrL(end);
  8068. SetLabel(exit);
  8069. Designate(p0,l);
  8070. ToMemory(l.op,addressType,0);
  8071. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8072. ReleaseOperand(l);
  8073. SetLabel(end);
  8074. ELSE
  8075. SetLabel(exit);
  8076. END;
  8077. *)
  8078. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8079. ELSE (* no pointer to record, no pointer to array *)
  8080. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8081. (* ignore new statement *)
  8082. Warning(p0.position, "cannot run on final hardware");
  8083. ELSE
  8084. HALT(200);
  8085. END;
  8086. END;
  8087. (* ---- ADDRESSOF----- *)
  8088. |Global.systemAdr:
  8089. Designate(p0,s0);
  8090. s0.mode := ModeValue;
  8091. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8092. ReleaseIntermediateOperand(s0.op);
  8093. s0.op := s0.tag;
  8094. IntermediateCode.InitOperand(s0.tag);
  8095. END;
  8096. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8097. result := s0;
  8098. (* ---- BIT ----- *)
  8099. |Global.systemBit:
  8100. Evaluate(p0,s0);
  8101. ToMemory(s0.op,addressType,0);
  8102. ReuseCopy(res,s0.op);
  8103. ReleaseOperand(s0);
  8104. Evaluate(p1,s1);
  8105. Emit(Ror(position,res,res,s1.op));
  8106. ReleaseOperand(s1);
  8107. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8108. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8109. IF ~conditional THEN
  8110. InitOperand(result,ModeValue); result.op := res;
  8111. ELSE
  8112. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8113. BrL(falseLabel);
  8114. ReleaseIntermediateOperand(res);
  8115. END;
  8116. (* --- MSK ----*)
  8117. |Global.systemMsk:
  8118. Evaluate(p0,s0);
  8119. Evaluate(p1,s1);
  8120. ReuseCopy(res,s0.op);
  8121. ReleaseOperand(s0);
  8122. Emit(And(position,res,res,s1.op));
  8123. ReleaseOperand(s1);
  8124. InitOperand(result,ModeValue);
  8125. result.op := res;
  8126. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8127. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8128. Evaluate(p0,s0);
  8129. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8130. ReleaseOperand(s0);
  8131. InitOperand(result,ModeValue);
  8132. result.op := res;
  8133. (* ---- SYSTEM.GetStackPointer ----- *)
  8134. |Global.systemGetStackPointer:
  8135. InitOperand(result,ModeValue);
  8136. result.op := sp;
  8137. (* ---- SYSTEM.GetFramePointer ----- *)
  8138. |Global.systemGetFramePointer:
  8139. InitOperand(result,ModeValue);
  8140. result.op := fp;
  8141. (* ---- SYSTEM.GetActivity ----- *)
  8142. |Global.systemGetActivity:
  8143. ASSERT(backend.cooperative);
  8144. InitOperand(result,ModeValue);
  8145. result.op := ap;
  8146. (* ---- SYSTEM.SetStackPointer ----- *)
  8147. |Global.systemSetStackPointer:
  8148. Evaluate(p0,s0); (* *)
  8149. Emit(Mov(position,sp,s0.op));
  8150. ReleaseOperand(s0);
  8151. (* ---- SYSTEM.SetFramePointer ----- *)
  8152. |Global.systemSetFramePointer:
  8153. Evaluate(p0,s0); (* *)
  8154. Emit(Mov(position,fp,s0.op));
  8155. ReleaseOperand(s0);
  8156. (* ---- SYSTEM.Activity ----- *)
  8157. |Global.systemSetActivity:
  8158. ASSERT(backend.cooperative);
  8159. Evaluate(p0,s0); (* *)
  8160. Emit(Mov(position,ap,s0.op));
  8161. ReleaseOperand(s0);
  8162. (* ---- SYSTEM.VAL ----- *)
  8163. |Global.systemVal:
  8164. Expression(p1);
  8165. s1 := result;
  8166. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8167. IF s1.mode = ModeReference THEN
  8168. (* nothing to be done if not record type, just take over new type *)
  8169. IF (type IS SyntaxTree.RecordType) THEN
  8170. ReleaseIntermediateOperand(s1.tag);
  8171. s1.tag := TypeDescriptorAdr(type);
  8172. UseIntermediateOperand(s1.tag);
  8173. END;
  8174. result := s1;
  8175. ELSE (* copy over result to different type, may not use convert *)
  8176. itype := IntermediateCode.GetType(system,type);
  8177. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8178. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8179. Emit(Mov(position,s0.op,s1.op));
  8180. ReleaseOperand(s1);
  8181. InitOperand(result,ModeValue);
  8182. result.op := s0.op;
  8183. ELSE (* different size, must convert *)
  8184. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8185. Convert(s1.op, IntermediateCode.GetType(system,type));
  8186. result := s1;
  8187. END;
  8188. END;
  8189. (* ---- SYSTEM.GET ----- *)
  8190. |Global.systemGet:
  8191. Evaluate(p0,s0); (* adr *)
  8192. Designate(p1,s1); (* variable *)
  8193. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8194. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8195. Emit(Mov(position,s1.op,s0.op));
  8196. ReleaseOperand(s1);
  8197. ReleaseOperand(s0);
  8198. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8199. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8200. Evaluate(p0,s0); (* *)
  8201. Evaluate(p1,s1); (* variable *)
  8202. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8203. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8204. (* real part *)
  8205. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8206. Emit(Mov(position,res, s1.op));
  8207. ReleaseIntermediateOperand(res);
  8208. (* imaginary part *)
  8209. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8210. Emit(Mov(position,res, s1.tag));
  8211. ReleaseIntermediateOperand(res);
  8212. ReleaseOperand(s1);
  8213. ReleaseOperand(s0);
  8214. ELSE
  8215. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8216. ReleaseOperand(s0);
  8217. Emit(Mov(position,res,s1.op));
  8218. ReleaseIntermediateOperand(res);
  8219. ReleaseOperand(s1);
  8220. END;
  8221. (* ---- SYSTEM.MOVE ----- *)
  8222. |Global.systemMove:
  8223. Evaluate(p0,s0);
  8224. Evaluate(p1,s1);
  8225. Evaluate(p2,s2);
  8226. Emit(Copy(position,s1.op,s0.op,s2.op));
  8227. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8228. (* ---- SYSTEM.NEW ----- *)
  8229. |Global.systemNew:
  8230. Designate(p0,s0);
  8231. Emit(Push(position,s0.op));
  8232. ReleaseOperand(s0);
  8233. Evaluate(p1,s1);
  8234. Emit(Push(position,s1.op));
  8235. ReleaseOperand(s1);
  8236. (* push realtime flag: false by default *)
  8237. Emit(Push(position,false));
  8238. CallThis(position,"Heaps","NewSys",3);
  8239. (* ---- SYSTEM.CALL ----- *)
  8240. |Global.systemRef:
  8241. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8242. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8243. s0.mode := ModeValue;
  8244. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8245. result := s0
  8246. (* ---- INCR ----- *)
  8247. |Global.Incr:
  8248. Designate(p0,operand);
  8249. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8250. Dereference(operand,p0.type.resolved,FALSE);
  8251. END;
  8252. ASSERT(p1 # NIL);
  8253. Evaluate(p1,l);
  8254. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8255. ReleaseOperand(operand); ReleaseOperand(l);
  8256. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8257. (* ---- SUM ----- *)
  8258. |Global.Sum: HALT(200);
  8259. (* ---- ALL ----- *)
  8260. |Global.All: HALT(200);
  8261. (* ---- CAS ----- *)
  8262. |Global.Cas:
  8263. needsTrace := p0.NeedsTrace();
  8264. IF needsTrace THEN ModifyAssignments(true) END;
  8265. Designate(p0,s0);
  8266. Evaluate(p1,s1);
  8267. Evaluate(p2,s2);
  8268. IF needsTrace THEN
  8269. Emit(Push(position, s0.op));
  8270. Emit(Push(position, s1.op));
  8271. Emit(Push(position, s2.op));
  8272. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8273. ELSE
  8274. Emit(Cas(position,s0.op,s1.op,s2.op));
  8275. END;
  8276. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8277. IF needsTrace THEN ModifyAssignments(false) END;
  8278. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8279. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8280. IF conditional THEN
  8281. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8282. BrL(falseLabel);
  8283. ReleaseIntermediateOperand(res);
  8284. END;
  8285. (* ---- DIM ----- *)
  8286. |Global.Dim:
  8287. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8288. Designate(p0,s0);
  8289. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8290. Dereference(s0,p0.type.resolved,FALSE);
  8291. END;
  8292. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8293. ReleaseOperand(s0);
  8294. (* ---- RESHAPE ----- *)
  8295. |Global.Reshape:
  8296. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8297. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8298. left.SetType(procedure.type);
  8299. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8300. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8301. END;
  8302. (* ---- SYSTEM.TYPECODE ----- *)
  8303. |Global.systemTypeCode:
  8304. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8305. IF type.resolved IS SyntaxTree.PointerType THEN
  8306. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8307. END;
  8308. result.op := TypeDescriptorAdr(type);
  8309. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8310. result.mode := ModeValue;
  8311. (* ---- SYSTEM.TRACE ----- *)
  8312. |Global.systemTrace:
  8313. SystemTrace(x.parameters, x.position);
  8314. (* ----- CONNECT ------*)
  8315. |Global.Connect:
  8316. IF backend.cellsAreObjects THEN
  8317. PushPort(p0);
  8318. PushPort(p1);
  8319. IF p2 # NIL THEN
  8320. Evaluate(p2, s2);
  8321. Emit(Push(p2.position, s2.op));
  8322. ReleaseOperand(s2);
  8323. ELSE
  8324. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8325. END;
  8326. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8327. ELSE
  8328. Warning(x.position, "cannot run on final hardware");
  8329. END;
  8330. (* ----- DELEGATE ------*)
  8331. |Global.Delegate:
  8332. IF backend.cellsAreObjects THEN
  8333. PushPort(p0);
  8334. PushPort(p1);
  8335. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8336. ELSE
  8337. Warning(x.position, "cannot run on final hardware");
  8338. END;
  8339. (* ----- SEND ------*)
  8340. |Global.Send:
  8341. Evaluate(p0,s0);
  8342. Evaluate(p1,s1);
  8343. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8344. Emit(Push(position,s0.op));
  8345. Emit(Push(position,s1.op));
  8346. (*
  8347. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8348. *)
  8349. IF ~backend.cellsAreObjects THEN
  8350. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8351. END;
  8352. ReleaseOperand(s0);
  8353. ReleaseOperand(s1);
  8354. IF backend.cellsAreObjects THEN
  8355. CallThis(position,"ActiveCellsRuntime","Send",2);
  8356. ELSE
  8357. CallThis(position,ChannelModuleName,"Send",2);
  8358. END;
  8359. (* ----- RECEIVE ------*)
  8360. |Global.Receive:
  8361. Evaluate(p0,s0);
  8362. Emit(Push(position,s0.op));
  8363. Designate(p1,s1);
  8364. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8365. Emit(Push(position,s1.op));
  8366. IF p2 # NIL THEN
  8367. Designate(p2,s2);
  8368. Emit(Push(position,s2.op));
  8369. END;
  8370. (*
  8371. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8372. *)
  8373. IF ~backend.cellsAreObjects THEN
  8374. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8375. END;
  8376. ReleaseOperand(s0);
  8377. ReleaseOperand(s1);
  8378. ReleaseOperand(s2);
  8379. IF backend.cellsAreObjects THEN
  8380. IF p2 = NIL THEN
  8381. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8382. ELSE
  8383. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8384. END;
  8385. ELSE
  8386. IF p2 = NIL THEN
  8387. CallThis(position,ChannelModuleName,"Receive",2)
  8388. ELSE
  8389. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8390. END;
  8391. END;
  8392. | Global.systemSpecial:
  8393. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8394. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8395. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8396. (* determine if parameters are of the VAR kind *)
  8397. ASSERT(x.parameters.Length() <= 3);
  8398. formalParameter := procedureType.firstParameter;
  8399. FOR i := 0 TO x.parameters.Length() - 1 DO
  8400. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8401. formalParameter := formalParameter.nextParameter
  8402. END;
  8403. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8404. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8405. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8406. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8407. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8408. IF procedureType.returnType # NIL THEN
  8409. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8410. Emit(Result(position, res));
  8411. (*InitOperand(result,ModeValue);
  8412. result.op := res;
  8413. *)
  8414. IF ~conditional THEN
  8415. InitOperand(result,ModeValue); result.op := res;
  8416. ELSE
  8417. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8418. BrL(falseLabel);
  8419. ReleaseIntermediateOperand(res);
  8420. END;
  8421. END
  8422. ELSE (* function not yet implemented *)
  8423. Error(position,"not yet implemented");
  8424. END;
  8425. destination := dest;
  8426. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8427. END VisitBuiltinCallDesignator;
  8428. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8429. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8430. BEGIN
  8431. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8432. dest := destination; destination := emptyOperand;
  8433. Expression(x.left);
  8434. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8435. ELSIF isUnchecked THEN (* no check *)
  8436. ELSE
  8437. trueL := NewLabel();
  8438. falseL := NewLabel();
  8439. IF IsPointerToRecord(x.left.type,recordType) THEN
  8440. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8441. Emit(Mov(position,tag, result.op));
  8442. IF result.mode # ModeValue THEN
  8443. ptr := tag;
  8444. IntermediateCode.MakeMemory(ptr,addressType);
  8445. Emit(Mov(position,tag, ptr));
  8446. END;
  8447. IF ~backend.cooperative THEN
  8448. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8449. END;
  8450. IntermediateCode.MakeMemory(tag,addressType);
  8451. ELSE
  8452. tag := result.tag;
  8453. UseIntermediateOperand(tag);
  8454. END;
  8455. TypeTest(tag,x.type,trueL,falseL,FALSE);
  8456. ReleaseIntermediateOperand(tag);
  8457. SetLabel(falseL);
  8458. EmitTrap(position,TypeCheckTrap);
  8459. SetLabel(trueL);
  8460. END;
  8461. destination := dest;
  8462. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8463. END VisitTypeGuardDesignator;
  8464. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8465. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8466. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8467. VAR label: Label; pc: LONGINT;
  8468. BEGIN
  8469. IF backend.cooperative & ~isUnchecked THEN
  8470. pc := section.pc;
  8471. label := NewLabel();
  8472. BrneL(label, operand.op, nil);
  8473. EmitTrap(position, NilPointerTrap);
  8474. SetLabel(label);
  8475. INC(statCoopNilCheck, section.pc - pc);
  8476. END;
  8477. END NilCheck;
  8478. BEGIN
  8479. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8480. ReuseCopy(dereferenced,operand.op);
  8481. ReleaseOperand(operand);
  8482. operand.mode := ModeReference;
  8483. operand.op := dereferenced;
  8484. operand.tag := dereferenced;
  8485. UseIntermediateOperand(operand.tag);
  8486. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8487. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8488. ReleaseIntermediateOperand(operand.tag);
  8489. operand.tag := TypeDescriptorAdr(type);
  8490. ELSE
  8491. IF ~backend.cooperative THEN
  8492. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8493. END;
  8494. IntermediateCode.MakeMemory(operand.tag,addressType);
  8495. END;
  8496. NilCheck(operand.op);
  8497. ELSIF type IS SyntaxTree.ArrayType THEN
  8498. IF isUnsafe THEN
  8499. NilCheck(operand.op);
  8500. ReleaseIntermediateOperand(operand.tag);
  8501. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8502. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8503. ELSE
  8504. operand.tag := emptyOperand;
  8505. END;
  8506. ELSE
  8507. NilCheck(operand.op);
  8508. IF backend.cooperative THEN
  8509. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8510. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8511. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8512. ELSE
  8513. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8514. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8515. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8516. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8517. END;
  8518. END;
  8519. ELSIF type IS SyntaxTree.MathArrayType THEN
  8520. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8521. IntermediateCode.MakeMemory(operand.op,addressType);
  8522. ELSE HALT(100);
  8523. END;
  8524. END Dereference;
  8525. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8526. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8527. BEGIN
  8528. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8529. dest := destination; destination := emptyOperand;
  8530. Evaluate(x.left,d);
  8531. type := x.type.resolved;
  8532. prevIsUnchecked := isUnchecked;
  8533. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8534. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8535. END;
  8536. Dereference(d,type,IsUnsafePointer(x.left.type));
  8537. isUnchecked := prevIsUnchecked;
  8538. result := d;
  8539. 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
  8540. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8541. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8542. END;
  8543. END;
  8544. destination := dest;
  8545. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8546. END VisitDereferenceDesignator;
  8547. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8548. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8549. BEGIN
  8550. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8551. dest := destination; destination := emptyOperand;
  8552. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8553. tag := result.op;
  8554. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8555. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8556. StaticCallOperand(result,procedure.super);
  8557. ReleaseIntermediateOperand(result.tag);
  8558. UseIntermediateOperand(tag); (* necessary ? *)
  8559. result.tag := tag;
  8560. destination := dest;
  8561. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8562. END VisitSupercallDesignator;
  8563. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8564. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8565. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8566. name: Basic.SegmentedName;
  8567. procedure: SyntaxTree.Procedure;
  8568. procedureType: SyntaxTree.ProcedureType;
  8569. BEGIN
  8570. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8571. dest := destination; destination := emptyOperand;
  8572. scope := currentScope;
  8573. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8574. scope := scope.outerScope;
  8575. END;
  8576. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8577. moduleSection := meta.ModuleSection();
  8578. IF backend.cooperative THEN
  8579. moduleOffset := 0;
  8580. ELSE
  8581. moduleOffset := moduleSection.pc;
  8582. END;
  8583. result.mode := ModeValue;
  8584. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8585. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8586. result.mode := ModeValue;
  8587. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8588. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8589. ELSE
  8590. GetBaseRegister(basereg,currentScope,scope);
  8591. InitOperand(result,ModeReference);
  8592. result.op := basereg;
  8593. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8594. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8595. parametersSize := ProcParametersSize(procedure);
  8596. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8597. IF backend.cooperative THEN
  8598. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8599. END;
  8600. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8601. MakeMemory(result.op, result.op, addressType, 0);
  8602. END;
  8603. (* tag must be loaded when dereferencing SELF pointer *)
  8604. END;
  8605. destination := dest;
  8606. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8607. END VisitSelfDesignator;
  8608. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8609. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8610. BEGIN
  8611. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8612. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8613. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8614. parameter := procedureType.returnParameter;
  8615. IF currentIsInline THEN
  8616. map := currentMapper.Get(NIL);
  8617. IF map # NIL THEN
  8618. Designate(map.to, result);
  8619. ELSE
  8620. HALT(200);
  8621. END;
  8622. RETURN;
  8623. END;
  8624. VisitParameter(parameter);
  8625. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8626. END VisitResultDesignator;
  8627. (** values *)
  8628. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8629. BEGIN
  8630. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8631. IF conditional THEN
  8632. IF x.value THEN BrL(trueLabel)
  8633. ELSE BrL(falseLabel)
  8634. END;
  8635. ELSE
  8636. InitOperand(result,ModeValue);
  8637. IF x.value THEN result.op := true ELSE result.op := false END;
  8638. END;
  8639. END VisitBooleanValue;
  8640. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8641. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8642. BEGIN
  8643. Global.GetModuleSegmentedName(module.module, name);
  8644. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8645. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8646. RETURN section
  8647. END GetDataSection;
  8648. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8649. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8650. BEGIN
  8651. type := vop.type;
  8652. data := GetDataSection();
  8653. pc := EnterImmediate(data,vop);
  8654. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8655. IntermediateCode.MakeMemory(vop, type);
  8656. END GetImmediateMem;
  8657. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8658. BEGIN
  8659. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8660. InitOperand(result,ModeValue);
  8661. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8662. IF ~supportedImmediate(result.op) &~inData THEN
  8663. GetImmediateMem(result.op)
  8664. END;
  8665. END VisitIntegerValue;
  8666. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8667. BEGIN
  8668. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8669. InitOperand(result,ModeValue);
  8670. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8671. END VisitCharacterValue;
  8672. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8673. BEGIN
  8674. IF Trace THEN TraceEnter("VisitSetValue") END;
  8675. InitOperand(result,ModeValue);
  8676. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8677. END VisitSetValue;
  8678. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8679. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8680. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8681. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8682. BEGIN
  8683. numberElements := x.elements.Length();
  8684. FOR i := 0 TO numberElements-1 DO
  8685. expression := x.elements.GetExpression(i);
  8686. IF expression IS SyntaxTree.MathArrayExpression THEN
  8687. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8688. ELSE
  8689. inData := TRUE;
  8690. Evaluate(expression,op);
  8691. irv.Emit(Data(position,op.op));
  8692. inData := FALSE;
  8693. ReleaseOperand(op);
  8694. END;
  8695. END;
  8696. END RecursiveData;
  8697. BEGIN
  8698. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8699. IF ~TryConstantDeclaration() THEN
  8700. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8701. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8702. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8703. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8704. ELSE
  8705. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8706. END;
  8707. RecursiveData(x.array);
  8708. InitOperand(result,ModeReference);
  8709. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8710. END
  8711. END VisitMathArrayValue;
  8712. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8713. VAR constant: Sections.Section;
  8714. BEGIN
  8715. IF constantDeclaration = NIL THEN
  8716. RETURN FALSE
  8717. ELSE
  8718. (* Is a constant in this module: did we generate it already? *)
  8719. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8720. IF constant # NIL THEN
  8721. InitOperand(result,ModeReference);
  8722. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8723. RETURN TRUE;
  8724. END;
  8725. END;
  8726. RETURN FALSE
  8727. END TryConstantDeclaration;
  8728. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8729. BEGIN
  8730. constantDeclaration := x;
  8731. VExpression(x.value.resolved);
  8732. END VisitConstant;
  8733. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8734. BEGIN
  8735. IF Trace THEN TraceEnter("VisitRealValue") END;
  8736. InitOperand(result,ModeValue);
  8737. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8738. END VisitRealValue;
  8739. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8740. VAR
  8741. componentType: SyntaxTree.Type;
  8742. BEGIN
  8743. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8744. ASSERT(x.type IS SyntaxTree.ComplexType);
  8745. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8746. InitOperand(result,ModeValue);
  8747. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8748. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8749. END VisitComplexValue;
  8750. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8751. VAR i: LONGINT; name: Basic.SegmentedName;
  8752. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8753. BEGIN
  8754. IF Trace THEN TraceEnter("VisitStringValue") END;
  8755. IF ~TryConstantDeclaration() THEN
  8756. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8757. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8758. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8759. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8760. ELSE
  8761. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8762. END;
  8763. FOR i := 0 TO x.length-1 DO
  8764. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8765. irv.Emit(Data(position,op));
  8766. END;
  8767. InitOperand(result,ModeReference);
  8768. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8769. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8770. END
  8771. END VisitStringValue;
  8772. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8773. BEGIN
  8774. IF Trace THEN TraceEnter("VisitNilValue") END;
  8775. InitOperand(result,ModeValue);
  8776. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8777. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8778. END VisitNilValue;
  8779. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8780. BEGIN
  8781. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8782. InitOperand(result,ModeValue);
  8783. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8784. END VisitEnumerationValue;
  8785. (** symbols *)
  8786. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8787. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8788. END VisitImport;
  8789. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8790. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8791. BEGIN
  8792. IF scope # baseScope THEN
  8793. (* left := [fp+8] *)
  8794. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8795. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8796. ReuseCopy(left,right);
  8797. ReleaseIntermediateOperand(right);
  8798. scope := scope.outerScope; DEC(level);
  8799. (* { left := [left+8] } *)
  8800. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8801. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8802. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8803. Emit(Mov(position,left,right));
  8804. scope := scope.outerScope; DEC(level);
  8805. END;
  8806. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8807. result := left;
  8808. ELSE
  8809. result := fp;
  8810. END;
  8811. END GetBaseRegister;
  8812. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8813. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8814. BEGIN
  8815. IF Trace THEN TraceEnter("VisitVariable"); END;
  8816. type := x.type.resolved;
  8817. IF (x.useRegister) THEN
  8818. InitOperand(result, ModeValue);
  8819. IF x.registerNumber < 0 THEN
  8820. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8821. reg := x.registerNumber;
  8822. ELSE
  8823. reg := registerUsageCount.Map(x.registerNumber);
  8824. UseRegister(reg);
  8825. END;
  8826. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8827. ELSIF x.externalName # NIL THEN
  8828. InitOperand(result,ModeReference);
  8829. Basic.ToSegmentedName(x.externalName^, name);
  8830. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8831. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8832. InitOperand(result,ModeReference);
  8833. GetBaseRegister(result.op,currentScope,x.scope);
  8834. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8835. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8836. InitOperand(result,ModeReference);
  8837. GetCodeSectionNameForSymbol(x,name);
  8838. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8839. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8840. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8841. InitOperand(result,ModeReference);
  8842. GetCodeSectionNameForSymbol(x,name);
  8843. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8844. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8845. ELSE (* field, left designator must have been emitted *)
  8846. ASSERT(result.mode = ModeReference);
  8847. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8848. ReuseCopy(temp,result.op);
  8849. ReleaseIntermediateOperand(result.op);
  8850. result.op := temp;
  8851. END;
  8852. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8853. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8854. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8855. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8856. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8857. END;
  8858. END;
  8859. END;
  8860. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8861. ValueToCondition(result);
  8862. ELSIF type IS SyntaxTree.ProcedureType THEN
  8863. ReleaseIntermediateOperand(result.tag);
  8864. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8865. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8866. UseIntermediateOperand(result.tag);
  8867. ELSE
  8868. result.tag := nil; (* nil *)
  8869. END;
  8870. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8871. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8872. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8873. ReleaseIntermediateOperand(result.tag);
  8874. Global.GetSymbolSegmentedName(x,name);
  8875. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8876. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8877. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8878. ELSE
  8879. END;
  8880. ELSE
  8881. ReleaseIntermediateOperand(result.tag);
  8882. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8883. END;
  8884. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8885. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8886. ReleaseIntermediateOperand(result.tag);
  8887. result.tag := result.op;
  8888. UseIntermediateOperand(result.tag);
  8889. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8890. IntermediateCode.MakeMemory(result.op,addressType);
  8891. END;
  8892. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8893. ReleaseIntermediateOperand(result.tag);
  8894. result.tag := TypeDescriptorAdr(type);
  8895. UseIntermediateOperand(result.tag);
  8896. (* tag for pointer type computed not here but during dereferencing *)
  8897. END;
  8898. IF Trace THEN TraceExit("VisitVariable") END;
  8899. END VisitVariable;
  8900. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8901. BEGIN
  8902. VisitVariable(property);
  8903. END VisitProperty;
  8904. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8905. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  8906. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  8907. BEGIN
  8908. type := x.type.resolved;
  8909. IF Trace THEN TraceEnter("VisitParameter") END;
  8910. IF x.ownerType IS SyntaxTree.CellType THEN
  8911. ptype := x.type.resolved;
  8912. IF backend.cellsAreObjects THEN
  8913. ASSERT(result.mode = ModeReference);
  8914. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8915. ReuseCopy(temp,result.op);
  8916. ReleaseIntermediateOperand(result.op);
  8917. result.op := temp;
  8918. END;
  8919. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8920. RETURN;
  8921. ELSE
  8922. InitOperand(result,ModeReference);
  8923. GetCodeSectionNameForSymbol(x,name);
  8924. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8925. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8926. RETURN;
  8927. END;
  8928. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8929. InitOperand(result,ModeReference);
  8930. GetCodeSectionNameForSymbol(x,name);
  8931. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8932. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8933. RETURN
  8934. ELSE
  8935. GetBaseRegister(basereg,currentScope,x.scope);
  8936. InitOperand(result,ModeReference);
  8937. result.op := basereg;
  8938. END;
  8939. IF IsOpenArray(type) THEN
  8940. result.tag := basereg;
  8941. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8942. IntermediateCode.MakeMemory(result.op,addressType);
  8943. IF Global.IsOberonProcedure(x.ownerType) THEN
  8944. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8945. UseIntermediateOperand(result.tag);
  8946. ELSE
  8947. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8948. END;
  8949. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8950. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8951. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8952. ELSIF IsStaticArray(type) THEN
  8953. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8954. IntermediateCode.MakeMemory(result.op,addressType);
  8955. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8956. ELSIF type IS SyntaxTree.MathArrayType THEN
  8957. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8958. WITH type: SyntaxTree.MathArrayType DO
  8959. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8960. IF type.form = SyntaxTree.Tensor THEN
  8961. ELSIF type.form = SyntaxTree.Open THEN
  8962. result.tag := result.op;
  8963. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8964. IntermediateCode.MakeMemory(result.op,addressType);
  8965. UseIntermediateOperand(result.tag);
  8966. ELSIF type.form = SyntaxTree.Static THEN
  8967. IF x.kind = SyntaxTree.ConstParameter THEN
  8968. IntermediateCode.MakeMemory(result.op,addressType);
  8969. END;
  8970. ELSE HALT(100)
  8971. END;
  8972. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8973. IF type.form = SyntaxTree.Tensor THEN
  8974. ToMemory(result.op,addressType,0);
  8975. ELSIF type.form = SyntaxTree.Open THEN
  8976. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8977. ReuseCopy(result.tag, mem);
  8978. ReleaseIntermediateOperand(mem);
  8979. ReleaseIntermediateOperand(result.op);
  8980. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8981. ELSIF type.form = SyntaxTree.Static THEN
  8982. IntermediateCode.MakeMemory(result.op,addressType);
  8983. ELSE HALT(100)
  8984. END;
  8985. ELSE HALT(100)
  8986. END;
  8987. END;
  8988. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8989. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8990. IntermediateCode.MakeMemory(result.op,addressType);
  8991. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8992. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8993. END;
  8994. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8995. ValueToCondition(result);
  8996. ELSIF type IS SyntaxTree.ProcedureType THEN
  8997. ReleaseIntermediateOperand(result.tag);
  8998. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8999. IF x.kind = SyntaxTree.VarParameter THEN
  9000. ReuseCopy(result.tag,result.op);
  9001. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9002. IntermediateCode.MakeMemory(result.tag,addressType);
  9003. ELSE
  9004. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9005. UseIntermediateOperand(result.tag);
  9006. END;
  9007. ELSE
  9008. result.tag := nil;
  9009. END;
  9010. (* tag for pointer type computed not here but during dereferencing *)
  9011. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9012. ReleaseIntermediateOperand(result.tag);
  9013. result.tag := basereg;
  9014. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9015. IntermediateCode.MakeMemory(result.tag,addressType);
  9016. UseIntermediateOperand(result.tag);
  9017. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9018. ReleaseIntermediateOperand(result.tag);
  9019. result.tag := TypeDescriptorAdr(type);
  9020. UseIntermediateOperand(result.tag);
  9021. END;
  9022. IF Trace THEN TraceExit("VisitParameter") END;
  9023. END VisitParameter;
  9024. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9025. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9026. BEGIN
  9027. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9028. (* left.p: left already emitted *)
  9029. tag := result.op; (* value of pointer to left *)
  9030. (* get type desc *)
  9031. tmp := result.tag;
  9032. IntermediateCode.MakeMemory(tmp,addressType);
  9033. (* get method adr *)
  9034. Reuse1(reg,tmp);
  9035. ReleaseIntermediateOperand(tmp);
  9036. IF backend.cooperative THEN
  9037. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9038. WHILE recordType.baseType # NIL DO
  9039. recordType := recordType.GetBaseRecord ();
  9040. END;
  9041. GetRecordTypeName (recordType,name);
  9042. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9043. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9044. offset := 0;
  9045. ELSE
  9046. offset := 2;
  9047. END;
  9048. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9049. ELSIF meta.simple THEN
  9050. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9051. ELSE
  9052. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9053. END;
  9054. InitOperand(operand,ModeReference);
  9055. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9056. operand.op := reg;
  9057. operand.tag := tag;
  9058. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9059. END DynamicCallOperand;
  9060. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9061. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9062. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9063. BEGIN
  9064. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9065. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9066. tag := operand.op;
  9067. ReleaseIntermediateOperand(operand.tag);
  9068. ELSE tag := nil
  9069. END;
  9070. IF x.isInline THEN
  9071. sectionType := Sections.InlineCodeSection;
  9072. ELSE
  9073. sectionType := Sections.CodeSection;
  9074. END;
  9075. IF x.externalName # NIL THEN
  9076. Basic.ToSegmentedName(x.externalName^, name);
  9077. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9078. ELSE
  9079. GetCodeSectionNameForSymbol(x, name);
  9080. IF (x.scope.ownerModule = module.module) THEN
  9081. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9082. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9083. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9084. IF source.pc = 0 THEN (* no code yet *)
  9085. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9086. END;
  9087. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9088. bits := x.procedureScope.body.code.inlineCode;
  9089. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9090. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9091. binary.CopyBits(bits, 0, bits.GetSize());
  9092. source.SetResolved(binary);
  9093. ELSE
  9094. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9095. END;
  9096. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9097. END;
  9098. InitOperand(operand,ModeValue);
  9099. operand.op := reg;
  9100. operand.tag := tag;
  9101. IF Trace THEN TraceExit("StaticCallOperand") END;
  9102. END StaticCallOperand;
  9103. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9104. (* handle expressions of the form designator.procedure or procedure *)
  9105. BEGIN
  9106. IF Trace THEN TraceEnter("VisitProcedure") END;
  9107. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9108. DynamicCallOperand(result,x);
  9109. ELSIF x.isInline THEN
  9110. StaticCallOperand(result,x);
  9111. ELSE
  9112. StaticCallOperand(result,x);
  9113. END;
  9114. IF Trace THEN TraceExit("VisitProcedure") END;
  9115. END VisitProcedure;
  9116. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9117. BEGIN
  9118. VisitProcedure(x);
  9119. END VisitOperator;
  9120. (** statements *)
  9121. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9122. BEGIN
  9123. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9124. Expression(x.call);
  9125. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9126. ReleaseOperand(result)
  9127. END;
  9128. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9129. END VisitProcedureCallStatement;
  9130. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9131. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9132. leftBase, rightBase: SyntaxTree.Type;
  9133. procedureName,s: SyntaxTree.IdentifierString;
  9134. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9135. size: LONGINT; rightKind: LONGINT;
  9136. dummy: IntermediateCode.Operand;
  9137. CONST moduleName = "FoxArrayBase";
  9138. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9139. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9140. BEGIN
  9141. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9142. IF base IS SyntaxTree.MathArrayType THEN
  9143. base := OpenArray(base(SyntaxTree.MathArrayType));
  9144. END;
  9145. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9146. result.SetArrayBase(base);
  9147. RETURN result
  9148. END OpenArray;
  9149. BEGIN
  9150. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9151. SaveRegisters();ReleaseUsedRegisters(saved);
  9152. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9153. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9154. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9155. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9156. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9157. IF leftType.form = SyntaxTree.Tensor THEN
  9158. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9159. ELSIF leftType.form = SyntaxTree.Open THEN
  9160. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9161. ELSIF leftType.form = SyntaxTree.Static THEN
  9162. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9163. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9164. END;
  9165. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9166. IF procedure = NIL THEN
  9167. s := "Instruction not supported on target, emulation procedure ";
  9168. Strings.Append(s,moduleName);
  9169. Strings.Append(s,".");
  9170. Strings.Append(s,procedureName);
  9171. Strings.Append(s," not present");
  9172. Error(position,s);
  9173. ELSE
  9174. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9175. parameter.SetType(leftType);
  9176. parameter.SetAccess(SyntaxTree.Internal);
  9177. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9178. parameter.SetKind(rightKind);
  9179. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9180. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9181. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9182. StaticCallOperand(result,procedure);
  9183. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9184. ReleaseOperand(result);
  9185. END;
  9186. RestoreRegisters(saved);
  9187. END;
  9188. END AssignMathArray;
  9189. VAR modifyAssignmentCounter := 0: LONGINT;
  9190. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9191. VAR processor,mem,dst: IntermediateCode.Operand;
  9192. BEGIN
  9193. IF value.intValue = true.intValue THEN
  9194. INC(modifyAssignmentCounter);
  9195. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9196. modifyAssignmentsPC := section.pc;
  9197. ELSE
  9198. DEC(modifyAssignmentCounter);
  9199. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9200. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9201. END;
  9202. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9203. dst := NewRegisterOperand (addressType);
  9204. Emit(Mov(position,dst, processor));
  9205. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9206. Emit(Mov(position,mem, value));
  9207. ReleaseIntermediateOperand(dst);
  9208. END ModifyAssignments;
  9209. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9210. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9211. BEGIN
  9212. type := left.type.resolved;
  9213. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9214. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9215. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9216. IF procedureType.returnParameter = parameter THEN
  9217. (* this is the only case where the destination can be dynamically smaller than the source
  9218. in all other cases the dynamic size has to be taken
  9219. *)
  9220. IF backend.cooperative THEN
  9221. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9222. ELSE
  9223. MakeMemory(mem, tag, addressType, 0);
  9224. END;
  9225. RETURN mem;
  9226. END;
  9227. END;
  9228. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9229. END CopySize;
  9230. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9231. VAR
  9232. leftO, rightO: Operand;
  9233. arg,mem, sizeOp: IntermediateCode.Operand;
  9234. leftType, rightType, componentType, base: SyntaxTree.Type;
  9235. size: LONGINT;
  9236. parameters: SyntaxTree.ExpressionList;
  9237. procedure: SyntaxTree.Procedure;
  9238. call: SyntaxTree.ProcedureCallDesignator;
  9239. designator: SyntaxTree.Designator;
  9240. saved: RegisterEntry;
  9241. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9242. VAR procedureType: SyntaxTree.ProcedureType;
  9243. BEGIN
  9244. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9245. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9246. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9247. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9248. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9249. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9250. IF right.id = Global.Reshape THEN RETURN TRUE
  9251. END;
  9252. END;
  9253. END;
  9254. END;
  9255. RETURN FALSE
  9256. END CanPassAsResultParameter;
  9257. BEGIN
  9258. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9259. leftType := left.type.resolved; rightType:= right.type.resolved;
  9260. IF backend.cooperative & left.NeedsTrace() THEN
  9261. ModifyAssignments(true);
  9262. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9263. Designate(right, rightO);
  9264. Designate(left, leftO);
  9265. ASSERT(leftO.mode = ModeReference);
  9266. TransferToRegister(leftO.op, leftO.op);
  9267. TransferToRegister(rightO.op, rightO.op);
  9268. Emit(Push(position, leftO.op));
  9269. Emit(Push(position, rightO.op));
  9270. CallAssignMethod(leftO.op, rightO.op, left.type);
  9271. Emit(Pop(position, rightO.op));
  9272. Emit(Pop(position, leftO.op));
  9273. sizeOp := CopySize(left, leftO.tag);
  9274. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9275. ReleaseIntermediateOperand(sizeOp);
  9276. ReleaseOperand(leftO);
  9277. ReleaseOperand(rightO);
  9278. ELSE
  9279. Evaluate(right,rightO);
  9280. Designate(left,leftO);
  9281. ASSERT(leftO.mode = ModeReference);
  9282. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9283. (* copy procedure address first *)
  9284. MakeMemory(mem,leftO.op,addressType,0);
  9285. Emit(Mov(position,mem,rightO.op));
  9286. ReleaseIntermediateOperand(mem);
  9287. (* copy pointer address *)
  9288. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9289. CallAssignPointer(leftO.tag, rightO.tag);
  9290. ELSE
  9291. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9292. CallAssignPointer(leftO.op, rightO.op);
  9293. END;
  9294. ReleaseOperand(leftO);
  9295. ReleaseOperand(rightO);
  9296. END;
  9297. ModifyAssignments(false);
  9298. RETURN;
  9299. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9300. SaveRegisters();ReleaseUsedRegisters(saved);
  9301. IF SemanticChecker.IsPointerType(leftType) THEN
  9302. Evaluate(right,rightO);
  9303. Designate(left,leftO);
  9304. Emit(Push(position,leftO.op));
  9305. ReleaseOperand(leftO);
  9306. Emit(Push(position,rightO.op));
  9307. ReleaseOperand(rightO);
  9308. CallThis(position,"Heaps","Assign",2);
  9309. ELSIF leftType.IsRecordType() THEN
  9310. Designate(right,rightO);
  9311. Designate(left,leftO);
  9312. Emit(Push(position,leftO.op));
  9313. Emit(Push(position,leftO.tag)); (* type desc *)
  9314. ReleaseOperand(leftO);
  9315. Emit(Push(position,rightO.op));
  9316. ReleaseOperand(rightO);
  9317. CallThis(position,"Heaps","AssignRecord",3);
  9318. ELSIF IsStaticArray(leftType) THEN
  9319. size := StaticArrayNumElements(leftType);
  9320. base := StaticArrayBaseType(leftType);
  9321. Designate(right,rightO);
  9322. Designate(left,leftO);
  9323. Emit(Push(position,leftO.op));
  9324. ReleaseOperand(leftO);
  9325. arg := TypeDescriptorAdr(base);
  9326. Emit(Push(position,arg));
  9327. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9328. Emit(Push(position,rightO.op));
  9329. ReleaseOperand(rightO);
  9330. CallThis(position,"Heaps","AssignArray",4);
  9331. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9332. size := StaticMathArrayNumElements(leftType);
  9333. base := StaticMathArrayBaseType(leftType);
  9334. Designate(right,rightO);
  9335. Designate(left,leftO);
  9336. Emit(Push(position,leftO.op));
  9337. ReleaseOperand(leftO);
  9338. arg := TypeDescriptorAdr(base);
  9339. Emit(Push(position,arg));
  9340. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9341. Emit(Push(position,rightO.op));
  9342. ReleaseOperand(rightO);
  9343. CallThis(position,"Heaps","AssignArray",4);
  9344. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9345. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9346. Evaluate(right,rightO);
  9347. Designate(left,leftO);
  9348. MakeMemory(mem,leftO.op,addressType,0);
  9349. Emit(Mov(position,mem,rightO.op));
  9350. ReleaseIntermediateOperand(mem);
  9351. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9352. Emit (Push(position, leftO.tag));
  9353. ReleaseOperand(leftO);
  9354. Emit (Push(position, rightO.tag));
  9355. ReleaseOperand(rightO);
  9356. CallThis(position,"Heaps","Assign", 2);
  9357. ELSE HALT(100); (* missing ? *)
  9358. END;
  9359. RestoreRegisters(saved);
  9360. RETURN;
  9361. END;
  9362. IF CanPassAsResultParameter(right) THEN
  9363. procedureResultDesignator := left(SyntaxTree.Designator);
  9364. Expression(right);
  9365. procedureResultDesignator := NIL;
  9366. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9367. (* left <-- ALIAS OF right: zerocopy *)
  9368. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9369. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9370. designator.SetType(procedure.type);
  9371. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9372. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9373. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9374. END;
  9375. ELSIF leftType IS SyntaxTree.RangeType THEN
  9376. (* LHS is of array range type *)
  9377. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9378. Evaluate(right, rightO);
  9379. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9380. (* first *)
  9381. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9382. Emit(Mov(position,mem, rightO.op));
  9383. ReleaseIntermediateOperand(mem);
  9384. (* last *)
  9385. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9386. Emit(Mov(position,mem, rightO.tag));
  9387. ReleaseIntermediateOperand(mem);
  9388. (* step *)
  9389. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9390. Emit(Mov(position,mem, rightO.extra));
  9391. ReleaseIntermediateOperand(mem);
  9392. ReleaseOperand(rightO);
  9393. ReleaseOperand(leftO)
  9394. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9395. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9396. Evaluate(right, rightO);
  9397. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9398. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9399. (* real part *)
  9400. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9401. Emit(Mov(position,mem, rightO.op));
  9402. ReleaseIntermediateOperand(mem);
  9403. (* imaginary part *)
  9404. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9405. Emit(Mov(position,mem, rightO.tag));
  9406. ReleaseIntermediateOperand(mem);
  9407. ReleaseOperand(rightO);
  9408. ReleaseOperand(leftO)
  9409. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9410. OR (leftType IS SyntaxTree.PortType) THEN
  9411. (* rightO := leftO;*)
  9412. Evaluate(right,rightO);
  9413. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9414. Designate(left,leftO);
  9415. IF leftO.mode = ModeReference THEN
  9416. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9417. destination := mem;
  9418. ELSE
  9419. destination := leftO.op;
  9420. END;
  9421. ReleaseOperand(leftO);
  9422. IF destination.mode # IntermediateCode.Undefined THEN
  9423. Emit(Mov(position,destination,rightO.op));
  9424. END;
  9425. ReleaseOperand(rightO);
  9426. ReleaseIntermediateOperand(mem);
  9427. IntermediateCode.InitOperand(destination);
  9428. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9429. Evaluate(right,rightO);
  9430. Designate(left,leftO);
  9431. MakeMemory(mem,leftO.op,addressType,0);
  9432. Emit(Mov(position,mem,rightO.op));
  9433. ReleaseIntermediateOperand(mem);
  9434. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9435. (* delegate *)
  9436. (*
  9437. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9438. *)
  9439. Emit(Mov(position,leftO.tag,rightO.tag));
  9440. END;
  9441. ReleaseOperand(leftO);
  9442. ReleaseOperand(rightO);
  9443. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9444. Designate(right,rightO);
  9445. Designate(left,leftO);
  9446. sizeOp := CopySize(left, leftO.tag);
  9447. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9448. ReleaseIntermediateOperand(sizeOp);
  9449. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9450. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9451. IF (rightType IS SyntaxTree.StringType) THEN
  9452. CopyString(left,right);
  9453. 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
  9454. Designate(right,rightO);
  9455. Designate(left,leftO);
  9456. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9457. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9458. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9459. ELSE
  9460. HALT(201)
  9461. END;
  9462. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9463. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9464. Designate(right,rightO);
  9465. Designate(left,leftO);
  9466. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9467. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9468. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9469. Emit(Mov(position, leftO.op, mem));
  9470. ReleaseIntermediateOperand(mem);
  9471. ELSE
  9472. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9473. END;
  9474. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9475. ELSE
  9476. AssignMathArray(left,right);
  9477. END;
  9478. ELSE
  9479. HALT(200);
  9480. END;
  9481. END Assign;
  9482. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9483. BEGIN
  9484. IF Trace THEN TraceEnter("VisitAssignment") END;
  9485. Assign(x.left,x.right);
  9486. IF Trace THEN TraceExit("VisitAssignment") END;
  9487. END VisitAssignment;
  9488. PROCEDURE EmitCooperativeSwitch;
  9489. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9490. BEGIN
  9491. ASSERT (cooperativeSwitches);
  9492. pc := section.pc;
  9493. IF lastSwitchPC = section.pc THEN RETURN END;
  9494. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9495. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9496. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9497. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9498. INC(statCoopSwitch, section.pc - pc);
  9499. END EmitCooperativeSwitch;
  9500. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9501. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9502. BEGIN
  9503. p0 := communication.left; p1 := communication.right;
  9504. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9505. Evaluate(p0,s0);
  9506. Evaluate(p1,s1);
  9507. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9508. Emit(Push(position,s0.op));
  9509. Emit(Push(position,s1.op));
  9510. (*
  9511. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9512. *)
  9513. IF ~backend.cellsAreObjects THEN
  9514. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9515. END;
  9516. ReleaseOperand(s0);
  9517. ReleaseOperand(s1);
  9518. IF backend.cellsAreObjects THEN
  9519. CallThis(position,"ActiveCellsRuntime","Send",2);
  9520. ELSE
  9521. CallThis(position,ChannelModuleName,"Send",2);
  9522. END;
  9523. (* ----- RECEIVE ------*)
  9524. ELSE
  9525. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9526. tmp := p0; p0 := p1; p1 := tmp;
  9527. END;
  9528. Evaluate(p0,s0);
  9529. Emit(Push(position,s0.op));
  9530. Designate(p1,s1);
  9531. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9532. Emit(Push(position,s1.op));
  9533. (*
  9534. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9535. *)
  9536. IF ~backend.cellsAreObjects THEN
  9537. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9538. END;
  9539. ReleaseOperand(s0);
  9540. ReleaseOperand(s1);
  9541. IF backend.cellsAreObjects THEN
  9542. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9543. ELSE
  9544. CallThis(position,ChannelModuleName,"Receive",2)
  9545. END;
  9546. END;
  9547. END VisitCommunicationStatement;
  9548. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9549. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9550. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9551. VAR true, false: Label; condition, value: BOOLEAN;
  9552. BEGIN
  9553. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9554. IF condition THEN
  9555. true := NewLabel();
  9556. false := NewLabel();
  9557. Condition(if.condition,true,false);
  9558. SetLabel(true);
  9559. StatementSequence(if.statements);
  9560. BrL(end);
  9561. SetLabel(false);
  9562. ELSE
  9563. IF value THEN (* always true *)
  9564. escape := TRUE;
  9565. StatementSequence(if.statements);
  9566. (* no branch necessary -- rest skipped *)
  9567. END;
  9568. END;
  9569. END IfPart;
  9570. BEGIN
  9571. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9572. end := NewLabel();
  9573. elsifs := x.ElsifParts();
  9574. IfPart(x.ifPart);
  9575. FOR i := 0 TO elsifs-1 DO
  9576. IF ~escape THEN
  9577. elsif := x.GetElsifPart(i);
  9578. IfPart(elsif);
  9579. END;
  9580. END;
  9581. IF (x.elsePart # NIL) & ~escape THEN
  9582. StatementSequence(x.elsePart);
  9583. END;
  9584. SetLabel(end);
  9585. IF Trace THEN TraceExit("VisitIfStatement") END;
  9586. END VisitIfStatement;
  9587. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  9588. VAR reg: IntermediateCode.Operand;
  9589. BEGIN
  9590. trueL := NewLabel();
  9591. IF backend.cooperative THEN
  9592. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  9593. Emit(Mov(position,reg,tag));
  9594. TypeTest(reg, x.type, trueL, NIL,TRUE);
  9595. ReleaseIntermediateOperand(reg);
  9596. ELSE
  9597. TypeTest(tag, x.type, trueL, NIL,TRUE);
  9598. END;
  9599. END BrWithPart;
  9600. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  9601. BEGIN
  9602. StatementSequence(x.statements);
  9603. END EmitWithPart;
  9604. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9605. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  9606. tag: IntermediateCode.Operand;
  9607. BEGIN
  9608. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9609. endL := NewLabel();
  9610. elseL := NewLabel();
  9611. Designate(x.variable,res);
  9612. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9613. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9614. END;
  9615. ReuseCopy(tag, res.tag);
  9616. ReleaseOperand(res);
  9617. NEW(trueL, x.WithParts());
  9618. FOR i := 0 TO x.WithParts()-1 DO
  9619. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  9620. END;
  9621. ReleaseIntermediateOperand(tag);
  9622. BrL(elseL);
  9623. FOR i := 0 TO x.WithParts()-1 DO
  9624. SetLabel(trueL[i]);
  9625. EmitWithPart(x.GetWithPart(i));
  9626. BrL(endL);
  9627. END;
  9628. SetLabel(elseL);
  9629. IF x.elsePart = NIL THEN
  9630. IF ~isUnchecked THEN
  9631. EmitTrap(position,WithTrap);
  9632. END;
  9633. ELSE
  9634. StatementSequence(x.elsePart)
  9635. END;
  9636. SetLabel(endL);
  9637. IF Trace THEN TraceExit("VisitWithStatement") END;
  9638. END VisitWithStatement;
  9639. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9640. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9641. out,else: Label; label: Label;
  9642. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9643. symbol: SyntaxTree.Symbol;
  9644. table: BOOLEAN;
  9645. BEGIN
  9646. (*! split case statement into if-elsif statements for large case label lists *)
  9647. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9648. range := x.max-x.min+1;
  9649. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  9650. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  9651. table := FALSE;
  9652. size := x.caseParts.Length();
  9653. ELSE
  9654. table := TRUE;
  9655. size := LONGINT(range);
  9656. END;
  9657. Evaluate(x.variable,var);
  9658. ReuseCopy(tmp,var.op);
  9659. ReleaseIntermediateOperand(var.op);
  9660. var.op := tmp;
  9661. (*
  9662. UniqueId(name,module.module,"case",caseId);
  9663. *)
  9664. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9665. else := NewLabel();
  9666. IF table THEN
  9667. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9668. Convert(var.op,addressType);
  9669. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9670. ReuseCopy(res,var.op);
  9671. ReleaseOperand(var);
  9672. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9673. Global.GetModuleSegmentedName(module.module, name);
  9674. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9675. symbol := SyntaxTree.NewSymbol(name[1]);
  9676. symbol.SetScope(moduleScope);
  9677. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9678. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9679. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9680. Emit(Add(position,res,res,jmp));
  9681. IntermediateCode.MakeMemory(res,addressType);
  9682. Emit(Br(position,res));
  9683. ReleaseIntermediateOperand(res);
  9684. ELSE
  9685. ReuseCopy(res,var.op); (* make sure it is in a register *)
  9686. ReleaseOperand(var);
  9687. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  9688. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  9689. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9690. part := x.GetCasePart(i);
  9691. constant := part.firstConstant;
  9692. fixups[i] := NewLabel();
  9693. WHILE(constant # NIL) DO (* case labels for this case part *)
  9694. IF constant.min = constant.max THEN
  9695. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  9696. ELSE
  9697. label := NewLabel();
  9698. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  9699. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  9700. BrL(fixups[i]);
  9701. SetLabel(label);
  9702. END;
  9703. constant := constant.next;
  9704. END;
  9705. END;
  9706. BrL(else);
  9707. ReleaseIntermediateOperand(res);
  9708. END;
  9709. out := NewLabel();
  9710. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9711. part := x.GetCasePart(i);
  9712. constant := part.firstConstant;
  9713. IF table THEN
  9714. label := NewLabel();
  9715. SetLabel(label);
  9716. WHILE(constant # NIL) DO (* case labels for this case part *)
  9717. FOR j := constant.min TO constant.max DO
  9718. fixups[j-x.min] := label;
  9719. END;
  9720. constant := constant.next;
  9721. END;
  9722. ELSE
  9723. SetLabel(fixups[i]);
  9724. END;
  9725. StatementSequence(part.statements);
  9726. BrL(out);
  9727. END;
  9728. SetLabel(else);
  9729. FOR i := 0 TO size-1 DO
  9730. IF fixups[i] = NIL THEN
  9731. fixups[i] := else;
  9732. END;
  9733. END;
  9734. IF x.elsePart # NIL THEN
  9735. StatementSequence(x.elsePart);
  9736. ELSIF ~isUnchecked THEN
  9737. EmitTrap(position,CaseTrap);
  9738. END;
  9739. SetLabel(out);
  9740. IF table THEN
  9741. FOR i := 0 TO size-1 DO
  9742. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9743. section.Emit(Data(position,op));
  9744. END;
  9745. END;
  9746. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9747. END VisitCaseStatement;
  9748. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9749. VAR start: Label; true,false: Label;
  9750. BEGIN
  9751. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9752. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9753. start := NewLabel();
  9754. true := NewLabel();
  9755. false := NewLabel();
  9756. SetLabel(start);
  9757. Condition(x.condition,true,false);
  9758. SetLabel(true);
  9759. StatementSequence(x.statements);
  9760. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9761. BrL(start);
  9762. SetLabel(false);
  9763. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9764. END VisitWhileStatement;
  9765. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9766. VAR false,true: Label;
  9767. BEGIN
  9768. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9769. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9770. true := NewLabel();
  9771. false := NewLabel();
  9772. SetLabel(false);
  9773. StatementSequence(x.statements);
  9774. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9775. Condition(x.condition,true,false);
  9776. SetLabel(true);
  9777. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9778. END VisitRepeatStatement;
  9779. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9780. VAR
  9781. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9782. temporaryVariable: SyntaxTree.Variable;
  9783. temporaryVariableDesignator : SyntaxTree.Designator;
  9784. BEGIN
  9785. IF Trace THEN TraceEnter("VisitForStatement") END;
  9786. true := NewLabel();
  9787. false := NewLabel();
  9788. start := NewLabel();
  9789. Assign(x.variable,x.from);
  9790. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9791. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9792. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9793. Assign(temporaryVariableDesignator,x.to);
  9794. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9795. IF by > 0 THEN
  9796. cmp := Scanner.LessEqual
  9797. ELSE
  9798. cmp := Scanner.GreaterEqual
  9799. END;
  9800. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9801. binary.SetType(system.booleanType);
  9802. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9803. SetLabel(start);
  9804. Condition(binary,true,false);
  9805. SetLabel(true);
  9806. StatementSequence(x.statements);
  9807. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9808. binary.SetType(x.variable.type);
  9809. Assign(x.variable,binary);
  9810. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9811. BrL(start);
  9812. SetLabel(false);
  9813. IF Trace THEN TraceExit("VisitForStatement") END;
  9814. END VisitForStatement;
  9815. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9816. VAR prevLoop: Label;
  9817. BEGIN
  9818. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9819. prevLoop := currentLoop;
  9820. currentLoop := NewLabel();
  9821. StatementSequence(x.statements);
  9822. SetLabel(currentLoop);
  9823. currentLoop := prevLoop;
  9824. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9825. END VisitExitableBlock;
  9826. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9827. VAR prevLoop,start: Label;
  9828. BEGIN
  9829. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9830. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9831. start := NewLabel();
  9832. prevLoop := currentLoop;
  9833. SetLabel(start);
  9834. currentLoop := NewLabel();
  9835. StatementSequence(x.statements);
  9836. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9837. BrL(start);
  9838. SetLabel(currentLoop);
  9839. currentLoop := prevLoop;
  9840. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9841. END VisitLoopStatement;
  9842. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9843. VAR outer: SyntaxTree.Statement;
  9844. BEGIN
  9845. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9846. IF locked THEN (* r if we jump out of an exclusive block *)
  9847. outer := x.outer;
  9848. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9849. outer := outer.outer;
  9850. END;
  9851. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9852. Lock(FALSE);
  9853. END;
  9854. END;
  9855. BrL(currentLoop);
  9856. IF Trace THEN TraceExit("VisitExitStatement") END;
  9857. END VisitExitStatement;
  9858. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9859. VAR
  9860. expression, parameterDesignator: SyntaxTree.Expression;
  9861. type, componentType: SyntaxTree.Type;
  9862. res, right: Operand;
  9863. left, mem, reg: IntermediateCode.Operand;
  9864. parameter: SyntaxTree.Parameter;
  9865. procedure: SyntaxTree.Procedure;
  9866. procedureType: SyntaxTree.ProcedureType;
  9867. returnTypeOffset: LONGINT;
  9868. delegate: BOOLEAN;
  9869. map: SymbolMap;
  9870. callingConvention, parametersSize: LONGINT;
  9871. BEGIN
  9872. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9873. expression := x.returnValue;
  9874. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9875. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9876. IF currentIsInline THEN
  9877. IF expression # NIL THEN
  9878. map := currentMapper.Get(NIL);
  9879. IF map # NIL THEN
  9880. Assign(map.to, expression);
  9881. ELSE
  9882. Evaluate(expression,res);
  9883. Emit(Return(position,res.op));
  9884. ReleaseOperand(res);
  9885. END;
  9886. END;
  9887. BrL(currentInlineExit);
  9888. RETURN;
  9889. END;
  9890. IF expression # NIL THEN
  9891. type := expression.type.resolved;
  9892. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9893. IF locked THEN Lock(FALSE) END;
  9894. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9895. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9896. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9897. 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
  9898. (* return without structured return parameter *)
  9899. Evaluate(expression,res);
  9900. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9901. IF locked OR profile THEN
  9902. Emit(Push(position,res.op));
  9903. IF delegate THEN HALT(200) END;
  9904. ReleaseOperand(res);
  9905. IF locked THEN Lock(FALSE) END;
  9906. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9907. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9908. reg := NewRegisterOperand(res.op.type);
  9909. Emit(Pop(position,reg));
  9910. Emit(Return(position,reg));
  9911. ReleaseIntermediateOperand(reg);
  9912. ELSE
  9913. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9914. Emit(Return(position,res.op));
  9915. ReleaseOperand(res);
  9916. END;
  9917. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9918. THEN
  9919. (* return using structured return parameter *)
  9920. 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)
  9921. OR SemanticChecker.IsPointerType(type));
  9922. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9923. parameter :=procedureType.returnParameter;
  9924. ASSERT(parameter # NIL);
  9925. returnTypeOffset := parameter.offsetInBits;
  9926. (*
  9927. IF parameter# NIL THEN
  9928. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9929. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9930. ELSE
  9931. returnTypeOffset := system.offsetFirstParameter
  9932. END;
  9933. *)
  9934. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9935. IF type IS SyntaxTree.RangeType THEN
  9936. (* array range type *)
  9937. Evaluate(expression, right);
  9938. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9939. Emit(Mov(position,mem, right.op)); (* first *)
  9940. ReleaseIntermediateOperand(mem);
  9941. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9942. Emit(Mov(position,mem, right.tag)); (* last *)
  9943. ReleaseIntermediateOperand(mem);
  9944. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9945. Emit(Mov(position,mem, right.extra)); (* step *)
  9946. ReleaseIntermediateOperand(mem);
  9947. ReleaseOperand(right);
  9948. ELSIF type IS SyntaxTree.ComplexType THEN
  9949. Evaluate(expression, right);
  9950. componentType := type(SyntaxTree.ComplexType).componentType;
  9951. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9952. Emit(Mov(position,mem, right.op)); (* real part *)
  9953. ReleaseIntermediateOperand(mem);
  9954. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9955. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9956. ReleaseIntermediateOperand(mem);
  9957. ReleaseOperand(right);
  9958. ELSE (* covers cases: pointer / record / array *)
  9959. parameter := procedureType.returnParameter;
  9960. checker.SetCurrentScope(currentScope);
  9961. ASSERT(parameter # NIL);
  9962. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9963. Assign(parameterDesignator,expression);
  9964. END;
  9965. ReleaseIntermediateOperand(left);
  9966. IF locked THEN Lock(FALSE) END;
  9967. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9968. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9969. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9970. parameter := procedureType.returnParameter;
  9971. checker.SetCurrentScope(currentScope);
  9972. IF parameter = NIL THEN
  9973. Error(procedure.position, "structured return of parameter of procedure not found");
  9974. ELSE
  9975. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9976. Assign(parameterDesignator,expression);
  9977. END;
  9978. IF locked THEN Lock(FALSE) END;
  9979. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9980. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9981. ELSE
  9982. HALT(200);
  9983. END;
  9984. ELSE
  9985. IF locked THEN Lock(FALSE) END;
  9986. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9987. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9988. END;
  9989. IF backend.cooperative THEN
  9990. BrL(exitLabel);
  9991. ELSE
  9992. callingConvention := procedureType.callingConvention;
  9993. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9994. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9995. ELSE
  9996. parametersSize := 0;
  9997. END;
  9998. EmitLeave(section, position,procedure, callingConvention);
  9999. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10000. END;
  10001. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10002. END VisitReturnStatement;
  10003. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10004. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10005. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10006. statements: SyntaxTree.StatementSequence;
  10007. name, suffix: SyntaxTree.IdentifierString;
  10008. BEGIN
  10009. Strings.IntToStr(awaitProcCounter,suffix);
  10010. Strings.Concat("@AwaitProcedure",suffix,name);
  10011. identifier := SyntaxTree.NewIdentifier(name);
  10012. INC(awaitProcCounter);
  10013. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10014. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10015. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10016. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10017. procedure.SetAccess(SyntaxTree.Hidden);
  10018. procedure.SetScope(currentScope);
  10019. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10020. procedureType.SetReturnType(system.booleanType);
  10021. procedure.SetType(procedureType);
  10022. body := SyntaxTree.NewBody(x.position,procedureScope);
  10023. procedureScope.SetBody(body);
  10024. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10025. returnStatement.SetReturnValue(x.condition);
  10026. statements := SyntaxTree.NewStatementSequence();
  10027. statements.AddStatement(returnStatement);
  10028. body.SetStatementSequence(statements);
  10029. currentScope.AddProcedure(procedure);
  10030. RETURN procedure
  10031. END MakeAwaitProcedure;
  10032. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10033. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10034. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  10035. BEGIN
  10036. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10037. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10038. IF backend.cooperative THEN
  10039. start := NewLabel();
  10040. true := NewLabel();
  10041. false := NewLabel();
  10042. SetLabel(start);
  10043. Condition(x.condition,true,false);
  10044. SetLabel(false);
  10045. PushSelfPointer();
  10046. CallThis(position,"ExclusiveBlocks","Await",1);
  10047. BrL(start);
  10048. SetLabel(true);
  10049. PushSelfPointer();
  10050. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10051. ELSE
  10052. proc := MakeAwaitProcedure(x);
  10053. Emit(Push(position,fp));
  10054. GetCodeSectionNameForSymbol(proc,name);
  10055. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10056. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10057. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10058. Emit(Call(position,call,ProcParametersSize(proc)));
  10059. Emit(Result(position,res));
  10060. (*
  10061. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10062. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10063. *)
  10064. InitOperand(result,ModeValue);
  10065. result.op := res;
  10066. label := NewLabel();
  10067. BreqL(label, result.op, SELF.true);
  10068. ReleaseOperand(result);
  10069. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10070. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10071. Emit(Push(position,res));
  10072. Emit(Push(position,fp));
  10073. PushSelfPointer();
  10074. Emit(Push(position,nil));
  10075. CallThis(position,"Objects","Await",4);
  10076. SetLabel(label);
  10077. END;
  10078. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10079. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10080. END VisitAwaitStatement;
  10081. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10082. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10083. BEGIN
  10084. FOR i := 0 TO x.Length() - 1 DO
  10085. statement := x.GetStatement( i );
  10086. Statement(statement);
  10087. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10088. END;
  10089. END StatementSequence;
  10090. PROCEDURE PushSelfPointer;
  10091. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10092. procedureType: SyntaxTree.ProcedureType;
  10093. BEGIN
  10094. scope := currentScope;
  10095. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10096. scope := scope.outerScope;
  10097. END;
  10098. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10099. moduleSection := meta.ModuleSection();
  10100. IF backend.cooperative THEN
  10101. moduleOffset := 0;
  10102. ELSE
  10103. moduleOffset := moduleSection.pc;
  10104. END;
  10105. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10106. ELSE
  10107. GetBaseRegister(op.op,currentScope,scope);
  10108. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10109. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10110. parametersSize := ProcParametersSize(procedure);
  10111. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10112. IF backend.cooperative THEN
  10113. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10114. END;
  10115. IntermediateCode.MakeMemory(op.op,addressType);
  10116. END;
  10117. Emit(Push(position,op.op));
  10118. ReleaseOperand(op);
  10119. END PushSelfPointer;
  10120. PROCEDURE Lock(lock: BOOLEAN);
  10121. BEGIN
  10122. IF Trace THEN TraceEnter("Lock") END;
  10123. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10124. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10125. ASSERT(modifyAssignmentCounter = 0);
  10126. IF dump # NIL THEN
  10127. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10128. dump.Ln;dump.Update;
  10129. END;
  10130. PushSelfPointer;
  10131. IF backend.cooperative THEN
  10132. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10133. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10134. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10135. END;
  10136. ELSE
  10137. Emit(Push(position,true));
  10138. IF lock THEN CallThis(position,"Objects","Lock",2)
  10139. ELSE CallThis(position,"Objects","Unlock",2);
  10140. END;
  10141. END;
  10142. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10143. IF Trace THEN TraceExit("Lock") END;
  10144. END Lock;
  10145. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10146. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10147. BEGIN
  10148. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10149. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10150. previouslyUnchecked := isUnchecked;
  10151. isUnchecked := isUnchecked OR x.isUnchecked;
  10152. previouslyCooperativeSwitches := cooperativeSwitches;
  10153. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10154. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10155. IF x.statements # NIL THEN
  10156. StatementSequence(x.statements);
  10157. END;
  10158. IF (x IS SyntaxTree.Body) THEN
  10159. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10160. section.SetFinally(section.pc);
  10161. StatementSequence(x(SyntaxTree.Body).finally)
  10162. ELSIF x.isExclusive THEN
  10163. end := NewLabel();
  10164. BrL(end);
  10165. section.SetFinally(section.pc);
  10166. Lock(FALSE);
  10167. EmitTrap(position,RethrowTrap);
  10168. SetLabel(end);
  10169. END;
  10170. END;
  10171. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10172. isUnchecked := previouslyUnchecked;
  10173. cooperativeSwitches := previouslyCooperativeSwitches;
  10174. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10175. END VisitStatementBlock;
  10176. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10177. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10178. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10179. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10180. procedure: SyntaxTree.Procedure;
  10181. map: SymbolMap;
  10182. callingConvention, parametersSize: LONGINT;
  10183. BEGIN
  10184. scope := currentScope;
  10185. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10186. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10187. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10188. return := emptyOperand;
  10189. IF Trace THEN TraceEnter("VisitCode") END;
  10190. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10191. NEW(in, x.inRules.Length());
  10192. FOR i := 0 TO LEN(in)-1 DO
  10193. statement := x.inRules.GetStatement(i);
  10194. WITH statement: SyntaxTree.Assignment DO
  10195. Evaluate(statement.right, operand);
  10196. result := operand.op;
  10197. NEW(str, 64);
  10198. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10199. in[i] := result; IntermediateCode.SetString(in[i], str);
  10200. ReleaseIntermediateOperand(operand.tag);
  10201. END;
  10202. END;
  10203. ELSE in := NIL
  10204. END;
  10205. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10206. NEW(out, x.outRules.Length());
  10207. FOR i := 0 TO LEN(out)-1 DO
  10208. statement := x.outRules.GetStatement(i);
  10209. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10210. WITH statement:
  10211. SyntaxTree.Assignment DO
  10212. Designate(statement.left, operand);
  10213. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10214. NEW(str, 64);
  10215. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10216. out[i] := result; IntermediateCode.SetString(out[i], str);
  10217. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10218. | SyntaxTree.ReturnStatement DO
  10219. NEW(str, 64);
  10220. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10221. IF currentIsInline THEN
  10222. map := currentMapper.Get(NIL);
  10223. Designate(map.to, operand);
  10224. IF map.isAddress THEN
  10225. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10226. ELSE
  10227. result := operand.op;
  10228. END;
  10229. (*! only if it does not fit into register
  10230. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10231. *)
  10232. (*Evaluate(map.to, operand);*)
  10233. out[i] := result;
  10234. ELSE
  10235. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10236. END;
  10237. IntermediateCode.SetString(out[i], str);
  10238. ReleaseIntermediateOperand(operand.tag);
  10239. return := out[i];
  10240. ELSE
  10241. END;
  10242. END;
  10243. ELSE out := NIL
  10244. END;
  10245. Emit(Asm(x.position,x.sourceCode, in, out));
  10246. IF in # NIL THEN
  10247. FOR i := 0 TO LEN(in)-1 DO
  10248. ReleaseIntermediateOperand(in[i]);
  10249. END;
  10250. END;
  10251. IF out # NIL THEN
  10252. FOR i := 0 TO LEN(out)-1 DO
  10253. WITH statement:
  10254. SyntaxTree.Assignment DO
  10255. ReleaseIntermediateOperand(out[i]);
  10256. |SyntaxTree.ReturnStatement DO
  10257. (* release happens below *)
  10258. ELSE
  10259. END;
  10260. statement := x.outRules.GetStatement(i);
  10261. END;
  10262. END;
  10263. IF return.mode # IntermediateCode.Undefined THEN
  10264. IF currentIsInline THEN
  10265. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10266. Symbol(procedureType.returnParameter, par);
  10267. MakeMemory(mem, par.op, return.type, 0);
  10268. ReleaseOperand(par);
  10269. Emit(Mov(position, mem, return));
  10270. ReleaseIntermediateOperand(mem);
  10271. ELSE
  10272. Emit(Return(position,return));
  10273. END;
  10274. ReleaseIntermediateOperand(return);
  10275. IF currentIsInline THEN RETURN END;
  10276. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10277. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10278. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10279. ELSE
  10280. parametersSize := 0;
  10281. END;
  10282. EmitLeave(section, position,procedure, callingConvention);
  10283. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10284. END;
  10285. IF Trace THEN TraceExit("VisitCode") END;
  10286. END VisitCode;
  10287. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10288. BEGIN
  10289. RETURN ProcedureParametersSize(system, procedure);
  10290. END ProcParametersSize;
  10291. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10292. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10293. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10294. const, call: IntermediateCode.Operand;
  10295. parameterDesignator: SyntaxTree.Expression;
  10296. saved: RegisterEntry;
  10297. name: Basic.SegmentedName;
  10298. BEGIN
  10299. IF Trace THEN TraceEnter("ParameterCopies") END;
  10300. parameter := x.firstParameter;
  10301. WHILE parameter # NIL DO
  10302. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10303. type := parameter.type.resolved;
  10304. IF IsOpenArray(type) THEN
  10305. VisitParameter(parameter);
  10306. op := result;
  10307. IF backend.cooperative & parameter.NeedsTrace() THEN
  10308. length := GetArrayLength(type, op.tag);
  10309. size := NewRegisterOperand(addressType);
  10310. base := ArrayBaseType(type);
  10311. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10312. Emit(Mul(position, size, length, const));
  10313. dst := NewRegisterOperand (addressType);
  10314. Emit(Mov(position, dst, size));
  10315. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10316. Emit(Sub(position,dst,sp,dst));
  10317. Emit(And(position,dst,dst,const));
  10318. Emit(Mov(position,sp,dst));
  10319. par := fp;
  10320. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10321. IntermediateCode.InitImmediate(null, byteType, 0);
  10322. Emit(Fill(position, dst, size, null));
  10323. ReleaseIntermediateOperand(dst);
  10324. ReleaseIntermediateOperand(length);
  10325. SaveRegisters();ReleaseUsedRegisters(saved);
  10326. (* register dst has been freed before SaveRegisters already *)
  10327. base := ArrayBaseType(type);
  10328. (* assign method of open array *)
  10329. IF base.IsRecordType() THEN
  10330. Emit (Push(position, length));
  10331. Emit (Push(position, dst));
  10332. Emit (Push(position, op.op));
  10333. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10334. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10335. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10336. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10337. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10338. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10339. Emit (Push(position,length));
  10340. Emit (Push(position, dst));
  10341. Emit (Push(position, length));
  10342. Emit (Push(position, op.op));
  10343. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10344. ELSE
  10345. Emit (Push(position, length));
  10346. Emit (Push(position, dst));
  10347. Emit (Push(position, length));
  10348. Emit (Push(position, op.op));
  10349. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10350. ASSERT(ArrayBaseType(type).IsPointer());
  10351. END;
  10352. RestoreRegisters(saved);
  10353. ELSE
  10354. temp := GetDynamicSize(type,op.tag);
  10355. ReuseCopy(size,temp);
  10356. ReleaseIntermediateOperand(temp);
  10357. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10358. Emit(Sub(position,size,sp,size));
  10359. Emit(And(position,size,size,const));
  10360. Emit(Mov(position,sp,size));
  10361. par := fp;
  10362. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10363. ReleaseIntermediateOperand(size);
  10364. size := GetDynamicSize(type,op.tag);
  10365. END;
  10366. Emit(Copy(position,sp,op.op,size));
  10367. ReleaseIntermediateOperand(size);
  10368. ReleaseOperand(op);
  10369. IntermediateCode.MakeMemory(par,addressType);
  10370. Emit(Mov(position,par,sp));
  10371. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10372. checker.SetCurrentScope(currentScope);
  10373. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10374. Assign(parameterDesignator,parameterDesignator);
  10375. END;
  10376. END;
  10377. parameter := parameter.nextParameter;
  10378. END;
  10379. IF Trace THEN TraceExit("ParameterCopies") END;
  10380. END ParameterCopies;
  10381. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10382. VAR x: SyntaxTree.Variable;
  10383. BEGIN
  10384. x := scope.firstVariable;
  10385. WHILE x # NIL DO
  10386. InitVariable(x,FALSE);
  10387. x := x.nextVariable;
  10388. END;
  10389. END InitVariables;
  10390. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10391. BEGIN
  10392. IF (symbol # NIL) THEN
  10393. RETURN fingerPrinter.SymbolFP(symbol).public
  10394. ELSE
  10395. RETURN 0
  10396. END;
  10397. END GetFingerprint;
  10398. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10399. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10400. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10401. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10402. name: Basic.SegmentedName;
  10403. offset: LONGINT;
  10404. BEGIN
  10405. IF Trace THEN TraceEnter("Body") END;
  10406. ReleaseUsedRegisters(saved); (* just in case ... *)
  10407. section := ir;
  10408. exitLabel := NewLabel ();
  10409. IF moduleBody THEN moduleBodySection := section END;
  10410. IF ir.comments # NIL THEN
  10411. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10412. commentPrintout.SingleStatement(TRUE);
  10413. dump := ir.comments;
  10414. ELSE
  10415. commentPrintout := NIL;
  10416. dump := NIL;
  10417. END;
  10418. prevScope := currentScope;
  10419. currentScope := scope;
  10420. lastSwitchPC := 0;
  10421. cooperativeSwitches := backend.cooperative;
  10422. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10423. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10424. IF x # NIL THEN
  10425. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10426. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10427. IF moduleBody THEN
  10428. ProfilerInit();
  10429. ELSE
  10430. Basic.SegmentedNameToString(ir.name, string);
  10431. ProfilerAddProcedure(numberProcedures,string);
  10432. ProfilerEnterExit(numberProcedures,TRUE);
  10433. END;
  10434. END;
  10435. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10436. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10437. END;
  10438. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10439. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10440. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10441. IF procedure = cellScope.bodyProcedure THEN
  10442. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10443. StaticCallOperand(op, cellScope.constructor);
  10444. Emit(Call(position,op.op,0));
  10445. END;
  10446. END;
  10447. END;
  10448. InitVariables(scope);
  10449. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10450. GetCodeSectionNameForSymbol(procedure, name);
  10451. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10452. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10453. IF ProtectModulesPointers THEN
  10454. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10455. ELSE
  10456. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10457. END;
  10458. IntermediateCode.SetOffset(right,offset); (* tag *)
  10459. IntermediateCode.InitMemory(left,addressType,fp,0);
  10460. Emit(Mov(position, left, right));
  10461. END;
  10462. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10463. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10464. ParameterCopies(procedureType);
  10465. IF x.code = NIL THEN
  10466. VisitStatementBlock(x);
  10467. ELSE
  10468. VisitCode(x.code)
  10469. END;
  10470. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10471. IF ~backend.cooperative THEN
  10472. ProfilerEnterExit(numberProcedures,FALSE);
  10473. END;
  10474. INC(numberProcedures);
  10475. END;
  10476. END;
  10477. IF backend.cooperative THEN
  10478. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10479. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10480. END;
  10481. IF x # NIL THEN
  10482. SELF.position := x.position;
  10483. END;
  10484. CheckRegistersFree();
  10485. ASSERT(modifyAssignmentCounter = 0);
  10486. currentScope := prevScope;
  10487. IF Trace THEN TraceExit("Body") END;
  10488. END Body;
  10489. END ImplementationVisitor;
  10490. MetaDataGenerator=OBJECT
  10491. VAR
  10492. implementationVisitor: ImplementationVisitor;
  10493. declarationVisitor: DeclarationVisitor;
  10494. module: Sections.Module;
  10495. moduleName: ARRAY 128 OF CHAR;
  10496. moduleNamePool: Basic.HashTableInt;
  10497. moduleNamePoolSection: IntermediateCode.Section;
  10498. modulePointerSection: IntermediateCode.Section;
  10499. modulePointerSizePC: LONGINT;
  10500. modulePointerSectionOffset: LONGINT;
  10501. modulePointers: LONGINT;
  10502. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10503. RecordBaseOffset: LONGINT;
  10504. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10505. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10506. TypeTags: LONGINT; (* type extension level support *)
  10507. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10508. patchInfoPC: LONGINT;
  10509. patchCRC: LONGINT;
  10510. CONST
  10511. EmptyBlockOffset = 2;
  10512. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10513. BEGIN
  10514. IF implementationVisitor.backend.cooperative THEN
  10515. TypeTags := MAX(LONGINT);
  10516. BaseTypesTableOffset := 0;
  10517. MethodTableOffset := 2;
  10518. TypeRecordBaseOffset := 0;
  10519. RecordBaseOffset := 0;
  10520. ELSIF simple THEN
  10521. TypeTags := 3; (* only 3 extensions allowed *)
  10522. BaseTypesTableOffset := 1;
  10523. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10524. TypeRecordBaseOffset := 0;
  10525. RecordBaseOffset := 1;
  10526. ELSE
  10527. TypeTags := 16;
  10528. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10529. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10530. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10531. (* change this when Heaps.HeapBlock is modified *)
  10532. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10533. RecordBaseOffset := 8; (* addresses *)
  10534. ELSE
  10535. RecordBaseOffset := 9; (* addresses *)
  10536. END;
  10537. END;
  10538. SELF.simple := simple;
  10539. SELF.implementationVisitor := implementationVisitor;
  10540. SELF.declarationVisitor := declarationVisitor;
  10541. implementationVisitor.meta := SELF;
  10542. declarationVisitor.meta := SELF;
  10543. END InitMetaDataGenerator;
  10544. PROCEDURE SetModule(module: Sections.Module);
  10545. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10546. BEGIN
  10547. SELF.module := module;
  10548. Global.GetModuleName(module.module,moduleName);
  10549. Global.GetSymbolSegmentedName(module.module, name);
  10550. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10551. NEW(moduleNamePool, 32);
  10552. (*! require GC protection *)
  10553. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10554. IF ProtectModulesPointers THEN
  10555. name := "Heaps.AnyPtr";
  10556. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10557. (* set base pointer *)
  10558. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10559. END;
  10560. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10561. modulePointers := 0;
  10562. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10563. AddPointer(moduleNamePoolSection, namePoolOffset);
  10564. END;
  10565. END SetModule;
  10566. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10567. BEGIN
  10568. IF ~implementationVisitor.backend.cooperative THEN
  10569. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10570. INC(modulePointers);
  10571. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10572. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10573. END;
  10574. END AddPointer;
  10575. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10576. BEGIN
  10577. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10578. END GetTypeRecordBaseOffset;
  10579. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10580. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10581. BEGIN
  10582. (* change this when Heaps.HeapBlock is modified *)
  10583. INC(dataAdrOffset,7);
  10584. Info(section,"headerAdr");
  10585. Address(section,0);
  10586. Info(section,"typeDesc");
  10587. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10588. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10589. NamedSymbol(section, name, symbol, 0, offset);
  10590. Info(section,"mark: LONGINT;");
  10591. Longint(section,-1);
  10592. Info(section,"refCount: LONGINT;");
  10593. Longint(section,0);
  10594. (*
  10595. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10596. *)
  10597. Info(section,"dataAdr-: ADDRESS");
  10598. Symbol(section,section, dataAdrOffset,0);
  10599. Info(section,"size-: SIZE");
  10600. Address(section,0);
  10601. Info(section,"nextMark: HeapBlock;");
  10602. Address(section,0);
  10603. END HeapBlock;
  10604. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10605. VAR i: LONGINT;
  10606. BEGIN
  10607. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10608. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10609. Info(section,"count*: LONGINT");
  10610. Longint(section,0);
  10611. Info(section,"locked*: BOOLEAN");
  10612. Longint(section,0);
  10613. Info(section,"awaitingLock*: ProcessQueue");
  10614. Address(section,0);
  10615. Address(section,0);
  10616. Info(section,"awaitingCond*: ProcessQueue");
  10617. Address(section,0);
  10618. Address(section,0);
  10619. Info(section,"lockedBy*: ANY");
  10620. Address(section,0);
  10621. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10622. Longint(section,1);
  10623. FOR i := 2 TO 6 DO
  10624. Longint(section,0);
  10625. END;
  10626. Info(section,"lock*: ANY");
  10627. Address(section,0);
  10628. END ProtectedHeapBlock;
  10629. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10630. BEGIN
  10631. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10632. END Info;
  10633. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10634. VAR op: IntermediateCode.Operand;
  10635. BEGIN
  10636. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10637. section.Emit(Data(Basic.invalidPosition,op));
  10638. END Address;
  10639. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10640. VAR op: IntermediateCode.Operand;
  10641. BEGIN
  10642. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10643. section.Emit(Data(Basic.invalidPosition,op));
  10644. END Size;
  10645. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10646. VAR op: IntermediateCode.Operand;
  10647. BEGIN
  10648. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10649. section.Emit(Data(Basic.invalidPosition,op));
  10650. END Set;
  10651. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10652. VAR op: IntermediateCode.Operand;
  10653. BEGIN
  10654. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10655. section.Emit(Data(Basic.invalidPosition,op));
  10656. END Longint;
  10657. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10658. VAR op,noOperand: IntermediateCode.Operand;
  10659. BEGIN
  10660. IntermediateCode.InitOperand(noOperand);
  10661. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10662. section.PatchOperands(pc,op,noOperand,noOperand);
  10663. END PatchSize;
  10664. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10665. VAR op,noOperand: IntermediateCode.Operand;
  10666. BEGIN
  10667. IntermediateCode.InitOperand(noOperand);
  10668. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10669. section.PatchOperands(pc,op,noOperand,noOperand);
  10670. END PatchLongint;
  10671. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10672. VAR op, noOperand: IntermediateCode.Operand;
  10673. BEGIN
  10674. IntermediateCode.InitOperand(noOperand);
  10675. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10676. section.PatchOperands(pc,op,noOperand,noOperand);
  10677. END PatchSymbol;
  10678. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10679. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10680. BEGIN
  10681. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10682. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10683. section.Emit(Data(Basic.invalidPosition,op));
  10684. END Boolean;
  10685. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10686. VAR op: IntermediateCode.Operand;
  10687. BEGIN
  10688. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10689. section.Emit(Data(Basic.invalidPosition,op));
  10690. END Char;
  10691. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10692. VAR i: LONGINT;
  10693. BEGIN
  10694. Info(section,str);
  10695. i := 0;
  10696. WHILE(str[i] # 0X) DO
  10697. Char(section,str[i]);
  10698. INC(i);
  10699. END;
  10700. Char(section,0X);
  10701. END String;
  10702. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10703. VAR s: Basic.SectionName;
  10704. BEGIN
  10705. StringPool.GetString(str, s);
  10706. String(section, s);
  10707. END String0;
  10708. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10709. VAR op: IntermediateCode.Operand;
  10710. BEGIN
  10711. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10712. IntermediateCode.SetOffset(op,realOffset);
  10713. section.Emit(Data(Basic.invalidPosition,op));
  10714. END NamedSymbol;
  10715. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10716. VAR op: IntermediateCode.Operand;
  10717. BEGIN
  10718. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10719. IntermediateCode.SetOffset(op,realOffset);
  10720. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10721. END NamedSymbolAt;
  10722. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10723. BEGIN
  10724. IF symbol= NIL THEN
  10725. Address( section, realOffset);
  10726. ASSERT(virtualOffset = 0);
  10727. ELSE
  10728. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10729. END;
  10730. END Symbol;
  10731. (* OutPointers delivers
  10732. {pointerOffset}
  10733. *)
  10734. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10735. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10736. BEGIN
  10737. type := type.resolved;
  10738. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10739. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10740. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10741. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10742. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10743. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10744. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10745. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10746. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10747. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10748. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10749. ELSIF (type IS SyntaxTree.RecordType) THEN
  10750. (* never treat a record like a pointer, even if the pointer field is set! *)
  10751. WITH type: SyntaxTree.RecordType DO
  10752. base := type.GetBaseRecord();
  10753. IF base # NIL THEN
  10754. Pointers(offset,symbol,section, base,numberPointers);
  10755. END;
  10756. variable := type.recordScope.firstVariable;
  10757. WHILE(variable # NIL) DO
  10758. IF ~(variable.untraced) THEN
  10759. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10760. END;
  10761. variable := variable.nextVariable;
  10762. END;
  10763. END;
  10764. ELSIF (type IS SyntaxTree.CellType) THEN
  10765. WITH type: SyntaxTree.CellType DO
  10766. base := type.GetBaseRecord();
  10767. IF base # NIL THEN
  10768. Pointers(offset,symbol,section, base,numberPointers);
  10769. END;
  10770. variable := type.cellScope.firstVariable;
  10771. WHILE(variable # NIL) DO
  10772. IF ~(variable.untraced) THEN
  10773. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10774. END;
  10775. variable := variable.nextVariable;
  10776. END;
  10777. property := type.firstProperty;
  10778. WHILE(property # NIL) DO
  10779. IF ~(property.untraced) THEN
  10780. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10781. END;
  10782. property := property.nextProperty;
  10783. END;
  10784. parameter := type.firstParameter;
  10785. WHILE(parameter # NIL) DO
  10786. IF ~(parameter.untraced) THEN
  10787. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10788. END;
  10789. parameter := parameter.nextParameter;
  10790. END;
  10791. END;
  10792. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10793. WITH type: SyntaxTree.ArrayType DO
  10794. IF type.form= SyntaxTree.Static THEN
  10795. n := type.staticLength;
  10796. base := type.arrayBase.resolved;
  10797. WHILE(base IS SyntaxTree.ArrayType) DO
  10798. type := base(SyntaxTree.ArrayType);
  10799. n := n* type.staticLength;
  10800. base := type.arrayBase.resolved;
  10801. END;
  10802. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10803. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10804. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10805. FOR i := 0 TO n-1 DO
  10806. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10807. END;
  10808. END;
  10809. ELSE
  10810. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10811. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10812. END;
  10813. END;
  10814. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10815. WITH type: SyntaxTree.MathArrayType DO
  10816. IF type.form = SyntaxTree.Static THEN
  10817. n := type.staticLength;
  10818. base := type.arrayBase.resolved;
  10819. WHILE(base IS SyntaxTree.MathArrayType) DO
  10820. type := base(SyntaxTree.MathArrayType);
  10821. n := n* type.staticLength;
  10822. base := type.arrayBase.resolved;
  10823. END;
  10824. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10825. IF SemanticChecker.ContainsPointer(base) THEN
  10826. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10827. FOR i := 0 TO n-1 DO
  10828. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10829. END;
  10830. END;
  10831. ELSE
  10832. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10833. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10834. END
  10835. END;
  10836. (* ELSE no pointers in type *)
  10837. END;
  10838. END Pointers;
  10839. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10840. VAR position,i: LONGINT; ch: CHAR;
  10841. BEGIN
  10842. IF pool.Has(index) THEN
  10843. RETURN pool.GetInt(index)
  10844. ELSE
  10845. position := source.pc;
  10846. pool.PutInt(index, position);
  10847. Info(source, name);
  10848. i := 0;
  10849. REPEAT
  10850. ch := name[i]; INC(i);
  10851. Char( source, ch);
  10852. UNTIL ch = 0X;
  10853. END;
  10854. RETURN position;
  10855. END EnterDynamicName;
  10856. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10857. VAR name: Basic.SectionName; position: LONGINT;
  10858. BEGIN
  10859. IF pool.Has(index) THEN
  10860. RETURN pool.GetInt(index)
  10861. ELSE
  10862. StringPool.GetString(index, name);
  10863. position := EnterDynamicName(source,name,index, pool);
  10864. END;
  10865. RETURN position;
  10866. END DynamicName;
  10867. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10868. VAR section: IntermediateCode.Section;
  10869. BEGIN
  10870. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10871. IF implementationVisitor.backend.cooperative THEN
  10872. Info(section, "TypeDescriptor");
  10873. Basic.ToSegmentedName("BaseTypes.Array", name);
  10874. NamedSymbol(section, name,NIL, 0, 0);
  10875. BasePointer(section);
  10876. offset := 0;
  10877. ELSE
  10878. IF ProtectModulesPointers THEN
  10879. HeapBlock(mName,typeName,section,2);
  10880. END;
  10881. Info(section, "HeapBlock");
  10882. IF ProtectModulesPointers THEN
  10883. Symbol(section,section,2,0);
  10884. ELSE
  10885. Address(section,0);
  10886. END;
  10887. Info(section, "TypeDescriptor");
  10888. Address(section,0);
  10889. offset := section.pc;
  10890. END;
  10891. RETURN section
  10892. END NamedBlock;
  10893. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10894. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10895. BEGIN
  10896. COPY(moduleName,name);
  10897. Strings.Append(name,suffix);
  10898. Basic.ToSegmentedName(name, pooledName);
  10899. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10900. END Block;
  10901. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10902. VAR name: Basic.SegmentedName;
  10903. BEGIN
  10904. Info(source,"ArrayHeader");
  10905. IF implementationVisitor.backend.cooperative THEN
  10906. sizePC := source.pc;
  10907. Address(source,0);
  10908. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10909. IF baseType # "" THEN
  10910. Basic.ToSegmentedName(baseType, name);
  10911. NamedSymbol(source, name,NIL, 0, 0);
  10912. ELSE
  10913. Address(source,0);
  10914. END;
  10915. Address(source,0);
  10916. ELSE
  10917. Address(source,0);
  10918. Address(source,0);
  10919. (* first pointer for GC *)
  10920. IF hasPointer THEN
  10921. (* points to first element in the array, this is NOT the base type descriptor *)
  10922. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10923. ELSE
  10924. Address(source,0);
  10925. END;
  10926. sizePC := source.pc;
  10927. Address(source,0);
  10928. Info(source,"array data");
  10929. END;
  10930. END ArrayBlock;
  10931. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10932. BEGIN
  10933. IF implementationVisitor.backend.cooperative THEN
  10934. PatchSize(section, pc, size);
  10935. PatchSize(section, pc + 3, size);
  10936. ELSE
  10937. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10938. PatchSize(section, pc, size);
  10939. END;
  10940. END PatchArray;
  10941. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10942. VAR
  10943. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10944. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10945. poolMap: Basic.HashTableInt;
  10946. namePool: IntermediateCode.Section;
  10947. namePoolOffset: LONGINT;
  10948. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10949. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10950. BEGIN
  10951. Basic.SegmentedNameToString(s1.name,n1);
  10952. Basic.SegmentedNameToString(s2.name,n2);
  10953. index := 0;
  10954. ch1 := n1[index];
  10955. ch2 := n2[index];
  10956. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10957. INC(index);
  10958. ch1 := n1[index];
  10959. ch2 := n2[index];
  10960. END;
  10961. RETURN ch1 < ch2;
  10962. END Compare;
  10963. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10964. VAR
  10965. i, j: LONGINT;
  10966. x, t: Sections.Section;
  10967. BEGIN
  10968. IF lo < hi THEN
  10969. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10970. WHILE i <= j DO
  10971. WHILE Compare(list[i], x) DO INC(i) END;
  10972. WHILE Compare(x, list[j]) DO DEC(j) END;
  10973. IF i <= j THEN
  10974. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10975. INC(i); DEC(j)
  10976. END
  10977. END;
  10978. IF lo < j THEN QuickSort(list, lo, j) END;
  10979. IF i < hi THEN QuickSort(list, i, hi) END
  10980. END;
  10981. END QuickSort;
  10982. (*
  10983. ExportDesc* = RECORD
  10984. fp*: ADDRESS;
  10985. name* {UNTRACED}: DynamicName;
  10986. adr*: ADDRESS;
  10987. exports*: LONGINT;
  10988. dsc* {UNTRACED}: ExportArray
  10989. END;
  10990. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10991. *)
  10992. PROCEDURE ExportDesc2(
  10993. source: IntermediateCode.Section;
  10994. namePool: IntermediateCode.Section;
  10995. fingerPrinter: FingerPrinter.FingerPrinter;
  10996. symbol: Sections.Section;
  10997. name: StringPool.Index;
  10998. VAR patchAdr: LONGINT
  10999. ): BOOLEAN;
  11000. VAR fingerPrint: SyntaxTree.FingerPrint;
  11001. BEGIN
  11002. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11003. & (symbol.type # Sections.InlineCodeSection)
  11004. THEN
  11005. *)
  11006. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11007. & (symbol.type # Sections.ExitCodeSection)
  11008. & (symbol.type # Sections.InlineCodeSection))
  11009. THEN
  11010. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11011. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11012. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11013. Longint(source,fingerPrint.public);
  11014. ELSE
  11015. Longint(source, 0);
  11016. END;
  11017. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11018. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11019. Symbol(source, symbol,0,0);
  11020. patchAdr := source.pc;
  11021. Longint(source, 0);
  11022. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11023. Address(source,0);
  11024. END;
  11025. RETURN TRUE
  11026. ELSE
  11027. RETURN FALSE
  11028. END;
  11029. END ExportDesc2;
  11030. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11031. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11032. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11033. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11034. nextPatch: LONGINT;
  11035. TYPE
  11036. Scope = RECORD
  11037. elements: LONGINT;
  11038. gelements: LONGINT;
  11039. section: IntermediateCode.Section;
  11040. patchAdr: LONGINT;
  11041. arraySizePC: LONGINT;
  11042. beginPC: LONGINT; (* current scope start pc *)
  11043. END;
  11044. BEGIN
  11045. Basic.InitSegmentedName(prev);
  11046. olevel := -1;
  11047. scopes[0].section := source;
  11048. scopes[0].arraySizePC := MIN(LONGINT);
  11049. FOR s := 0 TO LEN(sections)-1 DO
  11050. symbol := sections[s];
  11051. 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
  11052. this := sections[s].name;
  11053. level := 0;
  11054. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11055. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11056. INC(level);
  11057. END;
  11058. WHILE level < olevel DO
  11059. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11060. IF olevel > 0 THEN
  11061. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11062. nextPatch := scopes[olevel-1].patchAdr+1;
  11063. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11064. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11065. END;
  11066. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11067. DEC(olevel);
  11068. END;
  11069. IF (level < LEN(this)) & (this[level] > 0) THEN
  11070. IF level > olevel THEN
  11071. (*TRACE("opening",level); *)
  11072. IF scopes[level].section = NIL THEN
  11073. arrayName := ".@ExportArray";
  11074. Strings.AppendInt(arrayName, level);
  11075. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11076. AddPointer(scopes[level].section,offset);
  11077. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11078. END;
  11079. scopes[level].beginPC := scopes[level].section.pc;
  11080. olevel := level;
  11081. scopes[olevel].elements := 0;
  11082. END;
  11083. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11084. sym := sections[s];
  11085. ELSE
  11086. sym := NIL;
  11087. END;
  11088. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11089. THEN
  11090. INC(scopes[olevel].elements);
  11091. END;
  11092. (* enter string in scope *)
  11093. INC(level);
  11094. END;
  11095. END;
  11096. Basic.SegmentedNameToString(this, name);
  11097. prev := this;
  11098. END;
  11099. END;
  11100. WHILE 0 <= olevel DO
  11101. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11102. IF olevel > 0 THEN
  11103. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11104. nextPatch := scopes[olevel-1].patchAdr+1;
  11105. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11106. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11107. END;
  11108. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11109. DEC(olevel);
  11110. END;
  11111. level := 0;
  11112. WHILE (level < LEN(scopes)) DO
  11113. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11114. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11115. END;
  11116. INC(level);
  11117. END;
  11118. END Export;
  11119. BEGIN
  11120. NEW(fingerPrinter);
  11121. NEW(poolMap, 64);
  11122. (* 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 *)
  11123. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11124. NEW(sectionArray, module.allSections.Length());
  11125. FOR i := 0 TO module.allSections.Length() - 1 DO
  11126. section := module.allSections.GetSection(i);
  11127. sectionArray[i] := section;
  11128. END;
  11129. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11130. Export(sectionArray^);
  11131. END ExportDesc;
  11132. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11133. VAR
  11134. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11135. BEGIN
  11136. Info(source, "exception table offsets array descriptor");
  11137. size := 0;
  11138. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11139. Info(source, "exception table content");
  11140. FOR i := 0 TO module.allSections.Length() - 1 DO
  11141. p := module.allSections.GetSection(i);
  11142. IF p.type = Sections.CodeSection THEN
  11143. finallyPC := p(IntermediateCode.Section).finally;
  11144. IF finallyPC>=0 THEN
  11145. Symbol( source, p, 0,0);
  11146. Symbol( source, p, finallyPC, 0);
  11147. Symbol( source, p, finallyPC,0);
  11148. INC(size);
  11149. END;
  11150. END
  11151. END;
  11152. PatchArray(source,sizePC,size);
  11153. END ExceptionArray;
  11154. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11155. VAR i: LONGINT; ch: CHAR;
  11156. BEGIN
  11157. i := 0;
  11158. REPEAT
  11159. ch := name[i]; INC(i);
  11160. Char( section, ch);
  11161. UNTIL ch = 0X;
  11162. WHILE i < 32 DO
  11163. Char( section, 0X); INC(i);
  11164. END;
  11165. END Name;
  11166. PROCEDURE References(section: IntermediateCode.Section);
  11167. CONST
  11168. sfTypeNone = 0X;
  11169. sfTypeCHAR = 01X;
  11170. sfTypeCHAR8 = 02X;
  11171. sfTypeCHAR16 = 03X;
  11172. sfTypeCHAR32 = 04X;
  11173. sfTypeRANGE = 05X;
  11174. sfTypeSHORTINT = 06X;
  11175. sfTypeINTEGER = 07X;
  11176. sfTypeLONGINT = 08X;
  11177. sfTypeHUGEINT = 09X;
  11178. sfTypeWORD = 0AX;
  11179. sfTypeLONGWORD = 0BX;
  11180. sfTypeSIGNED8 = 0CX;
  11181. sfTypeSIGNED16 = 0DX;
  11182. sfTypeSIGNED32 = 0EX;
  11183. sfTypeSIGNED64 = 0FX;
  11184. sfTypeUNSIGNED8 = 10X;
  11185. sfTypeUNSIGNED16 = 11X;
  11186. sfTypeUNSIGNED32 = 12X;
  11187. sfTypeUNSIGNED64 = 13X;
  11188. sfTypeREAL = 14X;
  11189. sfTypeLONGREAL = 15X;
  11190. sfTypeCOMPLEX = 16X;
  11191. sfTypeLONGCOMPLEX = 17X;
  11192. sfTypeBOOLEAN = 18X;
  11193. sfTypeSET = 19X;
  11194. sfTypeANY = 1AX;
  11195. sfTypeOBJECT = 1BX;
  11196. sfTypeBYTE = 1CX;
  11197. sfTypeADDRESS = 1DX;
  11198. sfTypeSIZE = 1EX;
  11199. sfTypeIndirect = 1FX;
  11200. sfTypeRecord = 20X;
  11201. sfTypePointerToRecord = 21X;
  11202. sfTypePointerToArray = 22X;
  11203. sfTypeOpenArray = 23X;
  11204. sfTypeStaticArray = 24X;
  11205. sfTypeDynamicArray = 25X;
  11206. sfTypeMathStaticArray = 26X;
  11207. sfTypeMathOpenArray = 27X;
  11208. sfTypeMathTensor = 28X;
  11209. sfTypeProcedure = 29X;
  11210. sfTypeDelegate = 2AX;
  11211. sfTypeENUM = 2BX;
  11212. (* sfTypeCELL = 2CX; *)
  11213. sfTypePORT = 2DX;
  11214. sfIN = 0X;
  11215. sfOUT = 1X;
  11216. flagDelegate = 0;
  11217. flagConstructor = 1;
  11218. (* variable / parameter addressing modes *)
  11219. sfAbsolute = 0X; (* global vars *)
  11220. sfRelative = 1X; (* variables, value parameters *)
  11221. sfIndirect = 2X; (* var parameters *)
  11222. sfScopeBegin = 0F0X;
  11223. sfScopeEnd = 0F1X;
  11224. sfProcedure = 0F2X;
  11225. sfVariable = 0F3X;
  11226. sfTypeDeclaration = 0F4X;
  11227. sfModule = 0FFX;
  11228. RefInfo = TRUE;
  11229. VAR
  11230. sizePC, startPC, lastOffset: LONGINT;
  11231. indirectTypes: Basic.HashTable;
  11232. PROCEDURE CurrentIndex(): LONGINT;
  11233. VAR i: LONGINT;
  11234. BEGIN
  11235. FOR i := startPC TO section.pc -1 DO
  11236. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11237. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11238. END;
  11239. startPC := section.pc;
  11240. RETURN lastOffset;
  11241. END CurrentIndex;
  11242. (*
  11243. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11244. Module = sfModule prevSymbol:SIZE name:String Scope.
  11245. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11246. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11247. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11248. Type =
  11249. sfTypePointerToRecord
  11250. | sfTypePointerToArray Type
  11251. | sfTypeOpenArray Type
  11252. | sfTypeDynamicArray Type
  11253. | sfTypeStaticArray length:SIZE Type
  11254. | sfTypeMathOpenArray Type
  11255. | sfTypeMathStaticArray length:SIZE Type
  11256. | sfTypeMathTensor Type
  11257. | sfTypeRecord tdAdr:ADDRESS
  11258. | sfTypeProcedure {Parameter} return:Type
  11259. | sfTypeDelegate {Parameter} return:Type
  11260. | sfTypePort (sfIN | sfOUT)
  11261. | sfTypeBOOLEAN
  11262. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11263. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11264. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11265. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11266. | sfTypeWORD | sfTypeLONGWORD
  11267. | sfTypeREAL | sfTypeLONGREAL
  11268. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11269. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11270. | sfTypeIndirect offset:SIZE.
  11271. *)
  11272. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11273. VAR offset: SIZE;
  11274. BEGIN
  11275. IF indirectTypes.Has(type) THEN
  11276. offset := indirectTypes.GetInt(type);
  11277. Char(section, sfTypeIndirect);
  11278. Size(section, offset);
  11279. RETURN TRUE;
  11280. ELSE
  11281. indirectTypes.PutInt(type, CurrentIndex());
  11282. RETURN FALSE;
  11283. END;
  11284. END Indirect;
  11285. PROCEDURE NType(type: SyntaxTree.Type);
  11286. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11287. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11288. BEGIN
  11289. IF type = NIL THEN
  11290. Char(section, sfTypeNone)
  11291. ELSE
  11292. type := type.resolved;
  11293. size := type.sizeInBits;
  11294. WITH type:
  11295. SyntaxTree.PointerType DO
  11296. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11297. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11298. Char(section, sfTypePointerToRecord);
  11299. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11300. ELSE
  11301. IF RefInfo THEN Info(section,"PointerToArray") END;
  11302. Char(section, sfTypePointerToArray);
  11303. NType(type.pointerBase);
  11304. END;
  11305. | SyntaxTree.ArrayType DO
  11306. IF ~Indirect(type) THEN
  11307. IF type.form = SyntaxTree.Open THEN
  11308. IF RefInfo THEN Info(section,"OpenArray") END;
  11309. Char(section, sfTypeOpenArray);
  11310. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11311. IF RefInfo THEN Info(section,"DynamicArray") END;
  11312. Char(section, sfTypeDynamicArray);
  11313. ELSIF type.form = SyntaxTree.Static THEN
  11314. IF RefInfo THEN Info(section,"StaticArray") END;
  11315. Char(section, sfTypeStaticArray);
  11316. Size(section, type.staticLength);
  11317. ELSE
  11318. HALT(100);
  11319. END;
  11320. NType(type.arrayBase);
  11321. END;
  11322. | SyntaxTree.MathArrayType DO
  11323. IF ~Indirect(type) THEN
  11324. IF type.form = SyntaxTree.Open THEN
  11325. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11326. Char(section, sfTypeMathOpenArray);
  11327. ELSIF type.form = SyntaxTree.Static THEN
  11328. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11329. Char(section, sfTypeMathStaticArray);
  11330. Size(section, type.staticLength);
  11331. ELSIF type.form = SyntaxTree.Tensor THEN
  11332. IF RefInfo THEN Info(section,"MathTensor") END;
  11333. Char(section, sfTypeMathTensor);
  11334. ELSE
  11335. HALT(100);
  11336. END;
  11337. NType(type.arrayBase);
  11338. END;
  11339. | SyntaxTree.RecordType DO
  11340. IF ~Indirect(type) THEN
  11341. IF type.pointerType # NIL (* OBJECT *) THEN
  11342. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11343. Char(section, sfTypePointerToRecord)
  11344. ELSE
  11345. IF RefInfo THEN Info(section,"Record") END;
  11346. Char(section, sfTypeRecord);
  11347. td := type.typeDeclaration;
  11348. IF RefInfo THEN Info(section,"TD") END;
  11349. IF (td # NIL) THEN
  11350. Global.GetSymbolSegmentedName(td,segmentedName);
  11351. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11352. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11353. ELSE
  11354. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11355. END;
  11356. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11357. Symbol(section, tir, 0, offset);
  11358. ELSE
  11359. Address(section, 0);
  11360. END;
  11361. END;
  11362. END;
  11363. | SyntaxTree.CellType DO
  11364. IF ~Indirect(type) THEN
  11365. IF RefInfo THEN Info(section,"Record") END;
  11366. Char(section, sfTypeRecord);
  11367. td := type.typeDeclaration;
  11368. IF RefInfo THEN Info(section,"TD") END;
  11369. IF (td # NIL) THEN
  11370. Global.GetSymbolSegmentedName(td,segmentedName);
  11371. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11372. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11373. ELSE
  11374. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11375. END;
  11376. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11377. Symbol(section, tir, 0, offset);
  11378. ELSE
  11379. Address(section, 0);
  11380. END;
  11381. END;
  11382. | SyntaxTree.PortType DO
  11383. Char(section, sfTypePORT);
  11384. IF type.direction = SyntaxTree.OutPort THEN
  11385. Char(section, sfOUT)
  11386. ELSE
  11387. Char(section, sfIN)
  11388. END;
  11389. | SyntaxTree.ProcedureType DO
  11390. IF ~Indirect(type) THEN
  11391. IF type.isDelegate THEN
  11392. Char(section, sfTypeDelegate);
  11393. ELSE
  11394. Char(section, sfTypeProcedure);
  11395. END;
  11396. parameter := type.firstParameter;
  11397. WHILE(parameter # NIL) DO
  11398. NParameter(parameter, -1);
  11399. parameter := parameter.nextParameter;
  11400. END;
  11401. NType(type.returnType);
  11402. END;
  11403. | SyntaxTree.EnumerationType DO
  11404. Char(section, sfTypeENUM);
  11405. | SyntaxTree.BasicType DO
  11406. WITH type:
  11407. SyntaxTree.BooleanType DO
  11408. IF RefInfo THEN Info(section,"Boolean") END;
  11409. Char(section, sfTypeBOOLEAN);
  11410. | SyntaxTree.CharacterType DO
  11411. IF type = module.system.characterType THEN
  11412. IF RefInfo THEN Info(section,"CHAR") END;
  11413. Char(section, sfTypeCHAR);
  11414. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11415. IF RefInfo THEN Info(section,"CHAR8") END;
  11416. Char(section, sfTypeCHAR8)
  11417. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11418. IF RefInfo THEN Info(section,"CHAR16") END;
  11419. Char(section, sfTypeCHAR16);
  11420. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11421. IF RefInfo THEN Info(section,"CHAR32") END;
  11422. Char(section, sfTypeCHAR32);
  11423. ELSE
  11424. HALT(100);
  11425. END;
  11426. |SyntaxTree.IntegerType DO
  11427. IF type(SyntaxTree.IntegerType).signed THEN
  11428. IF (type = module.system.shortintType) THEN
  11429. IF RefInfo THEN Info(section,"SHORTINT") END;
  11430. Char(section, sfTypeSHORTINT)
  11431. ELSIF (type = module.system.integerType) THEN
  11432. IF RefInfo THEN Info(section,"INTEGER") END;
  11433. Char(section, sfTypeINTEGER)
  11434. ELSIF (type = module.system.longintType) THEN
  11435. IF RefInfo THEN Info(section,"LONGINT") END;
  11436. Char(section, sfTypeLONGINT)
  11437. ELSIF (type = module.system.hugeintType) THEN
  11438. IF RefInfo THEN Info(section,"HUGEINT") END;
  11439. Char(section, sfTypeHUGEINT)
  11440. ELSIF (type = module.system.wordType) THEN
  11441. IF RefInfo THEN Info(section,"WORD") END;
  11442. Char(section, sfTypeWORD)
  11443. ELSIF (type = module.system.longWordType) THEN
  11444. IF RefInfo THEN Info(section,"LONGWORD") END;
  11445. Char(section, sfTypeLONGWORD);
  11446. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11447. IF RefInfo THEN Info(section,"SIGNED8") END;
  11448. Char(section, sfTypeSIGNED8)
  11449. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11450. IF RefInfo THEN Info(section,"SIGNED16") END;
  11451. Char(section, sfTypeSIGNED16)
  11452. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11453. IF RefInfo THEN Info(section,"SIGNED32") END;
  11454. Char(section, sfTypeSIGNED32)
  11455. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11456. IF RefInfo THEN Info(section,"SIGNED64") END;
  11457. Char(section, sfTypeSIGNED64)
  11458. ELSE
  11459. HALT(100);
  11460. END
  11461. ELSE (* unsigned *)
  11462. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11463. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11464. Char(section, sfTypeUNSIGNED8)
  11465. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11466. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11467. Char(section, sfTypeUNSIGNED16)
  11468. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11469. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11470. Char(section, sfTypeUNSIGNED32)
  11471. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11472. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11473. Char(section, sfTypeUNSIGNED64)
  11474. ELSE
  11475. HALT(100)
  11476. END
  11477. END;
  11478. | SyntaxTree.FloatType DO
  11479. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11480. IF RefInfo THEN Info(section,"REAL") END;
  11481. Char(section, sfTypeREAL);
  11482. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11483. IF RefInfo THEN Info(section,"LONGREAL") END;
  11484. Char(section, sfTypeLONGREAL);
  11485. ELSE
  11486. HALT(100);
  11487. END;
  11488. | SyntaxTree.ComplexType DO
  11489. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11490. IF RefInfo THEN Info(section,"COMPLEX") END;
  11491. Char(section, sfTypeCOMPLEX);
  11492. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11493. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11494. Char(section, sfTypeLONGCOMPLEX);
  11495. ELSE
  11496. HALT(100);
  11497. END;
  11498. |SyntaxTree.SetType DO
  11499. IF RefInfo THEN Info(section,"SET") END;
  11500. Char(section, sfTypeSET);
  11501. |SyntaxTree.AnyType DO
  11502. IF RefInfo THEN Info(section,"ANY") END;
  11503. Char(section, sfTypeANY);
  11504. |SyntaxTree.ObjectType DO
  11505. IF RefInfo THEN Info(section,"OBJECT") END;
  11506. Char(section, sfTypeOBJECT);
  11507. |SyntaxTree.ByteType DO
  11508. IF RefInfo THEN Info(section,"BYTE") END;
  11509. Char(section, sfTypeBYTE);
  11510. |SyntaxTree.RangeType DO
  11511. IF RefInfo THEN Info(section,"RANGE") END;
  11512. Char(section, sfTypeRANGE)
  11513. |SyntaxTree.AddressType DO
  11514. IF RefInfo THEN Info(section,"ADDRESS") END;
  11515. Char(section, sfTypeADDRESS)
  11516. |SyntaxTree.SizeType DO
  11517. IF RefInfo THEN Info(section,"SIZE") END;
  11518. Char(section, sfTypeSIZE)
  11519. ELSE
  11520. HALT(100)
  11521. END;
  11522. ELSE HALT(101);
  11523. END;
  11524. END;
  11525. END NType;
  11526. (*
  11527. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11528. *)
  11529. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11530. VAR type: SyntaxTree.Type;
  11531. BEGIN
  11532. IF RefInfo THEN Info(section, "Parameter") END;
  11533. Char(section, sfVariable);
  11534. Size(section, procOffset);
  11535. String0(section, parameter.name);
  11536. type := parameter.type.resolved;
  11537. IF parameter.kind = SyntaxTree.VarParameter THEN
  11538. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11539. ELSE Char(section, sfIndirect)
  11540. END;
  11541. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11542. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11543. Char(section, sfIndirect);
  11544. ELSE
  11545. Char(section, sfRelative);
  11546. END;
  11547. ELSE
  11548. Char(section, sfRelative);
  11549. END;
  11550. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11551. NType(parameter.type);
  11552. END NParameter;
  11553. (*
  11554. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11555. *)
  11556. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11557. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11558. flags: SET;
  11559. BEGIN
  11560. IF procedure.externalName # NIL THEN RETURN END;
  11561. IF RefInfo THEN Info(section, "Procedure") END;
  11562. pos := CurrentIndex();
  11563. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11564. Char(section, sfProcedure);
  11565. Size(section, scopeOffset);
  11566. String0(section,procedure.name);
  11567. s := module.allSections.FindBySymbol(procedure);
  11568. Symbol(section,s,0,0); (* start *)
  11569. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11570. flags := {};
  11571. IF procedureType.isDelegate THEN
  11572. INCL(flags, flagDelegate);
  11573. END;
  11574. IF procedure.isConstructor THEN
  11575. INCL(flags, flagConstructor);
  11576. END;
  11577. Set(section, flags);
  11578. IF RefInfo THEN Info(section, "Parameters") END;
  11579. parameter := procedureType.firstParameter;
  11580. WHILE(parameter # NIL) DO
  11581. NParameter(parameter, pos);
  11582. parameter := parameter.nextParameter;
  11583. END;
  11584. IF procedureType.returnParameter # NIL THEN
  11585. NParameter(procedureType.returnParameter, pos);
  11586. END;
  11587. IF procedureType.selfParameter # NIL THEN
  11588. NParameter(procedureType.selfParameter, pos);
  11589. END;
  11590. IF RefInfo THEN Info(section, "ReturnType") END;
  11591. NType(procedureType.returnType);
  11592. NScope(procedure.procedureScope, pos);
  11593. END NProcedure;
  11594. (*
  11595. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11596. *)
  11597. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11598. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11599. BEGIN
  11600. IF RefInfo THEN Info(section, "Variable") END;
  11601. pos := CurrentIndex();
  11602. Char(section, sfVariable);
  11603. Size(section, scopeOffset);
  11604. String0(section, variable.name);
  11605. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11606. Char(section, sfAbsolute);
  11607. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11608. NamedSymbol(section, sn,variable, 0,0);
  11609. ELSE
  11610. Char(section, sfRelative);
  11611. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11612. END;
  11613. NType(variable.type);
  11614. s := module.allSections.FindBySymbol(variable);
  11615. END NVariable;
  11616. (*
  11617. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11618. *)
  11619. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11620. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11621. BEGIN
  11622. IF typeDeclaration = NIL THEN RETURN END;
  11623. pos := CurrentIndex();
  11624. s := module.allSections.FindBySymbol(typeDeclaration);
  11625. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11626. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11627. Char(section, sfTypeDeclaration);
  11628. Size(section, scopeOffset);
  11629. String0(section, typeDeclaration.name);
  11630. declared := typeDeclaration.declaredType.resolved;
  11631. IF (declared IS SyntaxTree.PointerType) THEN
  11632. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11633. END;
  11634. WITH declared:
  11635. SyntaxTree.RecordType DO
  11636. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11637. Symbol(section, s, 0, offset);
  11638. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11639. Basic.AppendToSegmentedName(name,".@Info");
  11640. s := module.allSections.FindByName(name);
  11641. IF s # NIL THEN (* does not work for coop *)
  11642. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11643. END;
  11644. NScope(declared.recordScope, pos);
  11645. |SyntaxTree.CellType DO
  11646. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11647. Symbol(section, s, 0, offset);
  11648. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11649. Basic.AppendToSegmentedName(name,".@Info");
  11650. s := module.allSections.FindByName(name);
  11651. IF s # NIL THEN
  11652. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11653. END;
  11654. NScope(declared.cellScope, pos);
  11655. ELSE
  11656. Address(section, 0);
  11657. END;
  11658. END NTypeDeclaration;
  11659. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11660. VAR pos: LONGINT;
  11661. BEGIN
  11662. pos := CurrentIndex();
  11663. Char(section,sfModule);
  11664. Size(section, prevSymbol);
  11665. String0(section, module.name);
  11666. NScope(module.moduleScope, pos);
  11667. END NModule;
  11668. (*
  11669. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11670. *)
  11671. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11672. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  11673. BEGIN
  11674. IF scope = NIL THEN RETURN END;
  11675. IF RefInfo THEN Info(section, "Scope") END;
  11676. Char(section, sfScopeBegin);
  11677. variable := scope.firstVariable;
  11678. WHILE (variable # NIL) DO
  11679. NVariable(variable, prevSymbol);
  11680. variable := variable.nextVariable;
  11681. END;
  11682. WITH scope:
  11683. SyntaxTree.ModuleScope DO
  11684. bodyProcedure := scope.bodyProcedure;
  11685. |SyntaxTree.RecordScope DO
  11686. bodyProcedure := scope.bodyProcedure;
  11687. ELSE
  11688. bodyProcedure := NIL;
  11689. END;
  11690. IF bodyProcedure # NIL THEN
  11691. NProcedure(bodyProcedure, prevSymbol)
  11692. END;
  11693. procedure := scope.firstProcedure;
  11694. WHILE procedure # NIL DO
  11695. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11696. procedure := procedure.nextProcedure;
  11697. END;
  11698. typeDeclaration := scope.firstTypeDeclaration;
  11699. WHILE typeDeclaration # NIL DO
  11700. NTypeDeclaration(typeDeclaration, prevSymbol);
  11701. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11702. END;
  11703. Char(section, sfScopeEnd); (* scope ends *)
  11704. END NScope;
  11705. BEGIN
  11706. NEW(indirectTypes, 32);
  11707. ArrayBlock(section,sizePC,"", FALSE);
  11708. startPC := section.pc;
  11709. NModule(module.module, -1);
  11710. PatchArray(section,sizePC,CurrentIndex());
  11711. END References;
  11712. (*
  11713. Command* = RECORD
  11714. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11715. name*: Name; (* name of the procedure *)
  11716. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11717. entryAdr* : ADDRESS; (* entry address of procedure *)
  11718. END;
  11719. *)
  11720. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11721. VAR
  11722. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11723. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11724. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11725. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11726. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11727. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11728. BEGIN
  11729. RETURN
  11730. (type = NIL) OR
  11731. (type.resolved IS SyntaxTree.RecordType) OR
  11732. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11733. (type.resolved IS SyntaxTree.AnyType);
  11734. END TypeAllowed;
  11735. BEGIN
  11736. numberParameters := procedureType.numberParameters;
  11737. RETURN
  11738. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11739. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11740. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11741. END GetProcedureAllowed;
  11742. PROCEDURE WriteType(type : SyntaxTree.Type);
  11743. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11744. name: Basic.SegmentedName; offset: LONGINT;
  11745. BEGIN
  11746. IF type = NIL THEN
  11747. Address(source,0);
  11748. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11749. Address(source,1);
  11750. ELSE
  11751. type := type.resolved;
  11752. IF type IS SyntaxTree.PointerType THEN
  11753. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11754. END;
  11755. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11756. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11757. name[0] := typeDeclaration.name; name[1] := -1;
  11758. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11759. ASSERT(section # NIL);
  11760. ELSE
  11761. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11762. (* TODO *)
  11763. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11764. END;
  11765. IF implementationVisitor.backend.cooperative THEN
  11766. offset := 0;
  11767. ELSE
  11768. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11769. END;
  11770. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11771. END;
  11772. END WriteType;
  11773. BEGIN
  11774. Info(source, "command array descriptor");
  11775. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11776. numberCommands := 0;
  11777. Info(source, "command array content");
  11778. FOR i := 0 TO module.allSections.Length() - 1 DO
  11779. p := module.allSections.GetSection(i);
  11780. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11781. procedure := p.symbol(SyntaxTree.Procedure);
  11782. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11783. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11784. procedure.GetName(name);
  11785. Name(source,name);
  11786. numberParameters := procedureType.numberParameters;
  11787. (* offset of type of first parameter *)
  11788. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11789. ELSE WriteType(procedureType.firstParameter.type)
  11790. END;
  11791. (* offset of type of return parameter *)
  11792. WriteType(procedureType.returnType);
  11793. (* command name *)
  11794. (* command code offset *)
  11795. Symbol(source,p,0,0);
  11796. INC(numberCommands);
  11797. IF Trace THEN
  11798. D.Ln;
  11799. END;
  11800. END;
  11801. END
  11802. END;
  11803. PatchArray(source,sizePC,numberCommands);
  11804. END CommandArray;
  11805. (* to prevent from double import of different module aliases *)
  11806. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11807. VAR i: SyntaxTree.Import;
  11808. BEGIN
  11809. i := module.module.moduleScope.firstImport;
  11810. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11811. i := i.nextImport;
  11812. END;
  11813. RETURN i = import
  11814. END IsFirstDirectOccurence;
  11815. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11816. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11817. BEGIN
  11818. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11819. ArrayBlock(source,pc,"", FALSE);
  11820. Info(source, "import module array data");
  11821. IF implementationVisitor.backend.cooperative THEN
  11822. offset := 0;
  11823. ELSE
  11824. IF module.system.addressType.sizeInBits = 64 THEN
  11825. (* change this when Heaps.HeapBlock is modified *)
  11826. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11827. ELSE
  11828. (* change this when Heaps.HeapBlock is modified *)
  11829. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11830. END;
  11831. END;
  11832. import := module.module.moduleScope.firstImport;
  11833. numberImports := 0;
  11834. WHILE import # NIL DO
  11835. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11836. Global.GetModuleSegmentedName(import.module,name);
  11837. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11838. NamedSymbol(source, name, NIL, 0, offset);
  11839. INC(numberImports);
  11840. END;
  11841. import := import.nextImport
  11842. END;
  11843. PatchArray(source,pc,numberImports);
  11844. END ImportsArray;
  11845. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11846. VAR
  11847. p: Sections.Section; sizePC, size, i: LONGINT;
  11848. BEGIN
  11849. Info(source, "Type info section");
  11850. size := 0;
  11851. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11852. FOR i := 0 TO module.allSections.Length() - 1 DO
  11853. p := module.allSections.GetSection(i);
  11854. WITH p: IntermediateCode.Section DO
  11855. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11856. Symbol(source,p,EmptyBlockOffset,0);
  11857. INC(size);
  11858. END;
  11859. END
  11860. END;
  11861. PatchArray(source,sizePC,size);
  11862. END TypeInfoSection;
  11863. (*
  11864. ProcTableEntry* = RECORD
  11865. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11866. noPtr*: LONGINT;
  11867. END;
  11868. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11869. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11870. *)
  11871. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11872. VAR
  11873. numberPointers: LONGINT;
  11874. procedure: SyntaxTree.Procedure;
  11875. BEGIN
  11876. Info(section,"pcFrom");
  11877. Symbol(section,procedureSection,0,0);
  11878. Info(section,"pcTo");
  11879. Symbol(section, procedureSection, procedureSection.pc, 0);
  11880. Info(section,"pointer to offsets array");
  11881. Symbol(section, section,section.pc+1,0);
  11882. Info(section,"offsets array");
  11883. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11884. PointerArray(section, procedure.procedureScope, numberPointers);
  11885. END ProcedureDescriptor;
  11886. (* only for tracing, the descriptor is otherwise not complete ! *)
  11887. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11888. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11889. BEGIN
  11890. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11891. name := procedureSection.name;
  11892. Basic.AppendToSegmentedName(name,".@Info");
  11893. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11894. Address(section,0);
  11895. Symbol(section,section,2,0);
  11896. (*
  11897. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11898. descSize: SIZE;
  11899. sentinel: ADDRESS; (* = MPO-4 *)
  11900. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11901. flags*: SET;
  11902. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11903. name*: Name;
  11904. END;
  11905. *)
  11906. Size(section, 0);
  11907. Address(section,0);
  11908. Address(section,0);
  11909. Set(section,{});
  11910. moduleSection := ModuleSection();
  11911. Symbol( section, moduleSection, moduleSection.pc,0);
  11912. IF procedureSection.symbol = NIL THEN
  11913. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11914. ELSE
  11915. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11916. END;
  11917. Name(section, infoName);
  11918. Size(section, 0);
  11919. RETURN section;
  11920. END MakeProcedureDescriptorTag;
  11921. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11922. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11923. BEGIN
  11924. name := procedureSection.name;
  11925. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11926. IF implementationVisitor.backend.cooperative THEN
  11927. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11928. Info(section, "TypeDescriptor");
  11929. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11930. NamedSymbol(dest, name,NIL, 0, 0);
  11931. BaseRecord(dest);
  11932. offset := 0;
  11933. ELSIF CreateProcedureDescInfo THEN
  11934. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11935. Address(dest,0);
  11936. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11937. offset := dest.pc;
  11938. ELSE
  11939. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11940. END;
  11941. ProcedureDescriptor(dest, procedureSection);
  11942. Symbol(section, dest, offset, 0);
  11943. END ProcedureDescriptorPointer;
  11944. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11945. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11946. BEGIN
  11947. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11948. numberProcs := 0;
  11949. FOR i := 0 TO module.allSections.Length() - 1 DO
  11950. destination := module.allSections.GetSection(i);
  11951. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11952. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11953. INC(numberProcs);
  11954. END
  11955. END;
  11956. PatchArray(section, sizePC, numberProcs);
  11957. END ProcedureDescriptorArray;
  11958. (*
  11959. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11960. VAR
  11961. next*: Module; (** once a module is published, all fields are read-only *)
  11962. name*: Name;
  11963. init, published: BOOLEAN;
  11964. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11965. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11966. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11967. command*: POINTER TO ARRAY OF Command;
  11968. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11969. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11970. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11971. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11972. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11973. data*, code*: Bytes;
  11974. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11975. export*: ExportDesc;
  11976. term*: TerminationHandler;
  11977. exTable*: ExceptionTable;
  11978. noProcs*: LONGINT;
  11979. firstProc*: ADDRESS; <- done by loader
  11980. maxPtrs*: LONGINT;
  11981. crc*: LONGINT;
  11982. *)
  11983. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11984. BEGIN
  11985. Info(section, "cycle");
  11986. Size(section,0);
  11987. Info(section, "references");
  11988. Size(section,0);
  11989. Info(section, "nextMarked");
  11990. Address(section,0);
  11991. Info(section, "nextWatched");
  11992. Address(section,0);
  11993. END BasePointer;
  11994. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11995. BEGIN
  11996. BasePointer(section);
  11997. Info(section, "action");
  11998. Address(section,0);
  11999. Info(section, "monitor");
  12000. Address(section,0);
  12001. END BaseObject;
  12002. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12003. BEGIN
  12004. BasePointer(section);
  12005. Info(section, "action");
  12006. Address(section,0);
  12007. Info(section, "monitor");
  12008. Address(section,0);
  12009. END BaseRecord;
  12010. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12011. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12012. pooledName: Basic.SegmentedName;
  12013. symbol: SyntaxTree.Symbol;
  12014. BEGIN
  12015. Global.GetModuleName(module.module,name);
  12016. Strings.Append(name,".@Module.@Descriptor");
  12017. Basic.ToSegmentedName(name, pooledName);
  12018. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12019. Symbol(section,descriptorSection,0,0);
  12020. Info(descriptorSection, "descriptor");
  12021. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12022. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12023. Address(descriptorSection,0);
  12024. Global.GetModuleName(module.module,name);
  12025. Strings.Append(name,".@Trace");
  12026. Basic.ToSegmentedName(name, pooledName);
  12027. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12028. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12029. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12030. END ModuleDescriptor;
  12031. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12032. VAR name: ARRAY 128 OF CHAR;
  12033. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12034. symbol: SyntaxTree.Symbol;
  12035. BEGIN
  12036. Global.GetModuleName(module.module,name);
  12037. Strings.Append(name,".@Module");
  12038. Basic.ToSegmentedName(name, pooledName);
  12039. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12040. moduleSection.SetExported(TRUE);
  12041. IF moduleSection.pc = 0 THEN
  12042. IF implementationVisitor.backend.cooperative THEN
  12043. Info(moduleSection, "descriptor");
  12044. ModuleDescriptor(moduleSection);
  12045. BaseObject(moduleSection);
  12046. implementationVisitor.CreateTraceModuleMethod(module.module);
  12047. ELSE
  12048. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12049. Info(moduleSection, "HeapBlock");
  12050. Symbol(moduleSection,moduleSection,2,0);
  12051. Info(moduleSection, "TypeDescriptor");
  12052. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12053. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12054. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12055. END;
  12056. END;
  12057. RETURN moduleSection;
  12058. END ModuleSection;
  12059. PROCEDURE NewModuleInfo();
  12060. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12061. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12062. sectionName: Basic.SectionName;
  12063. CONST MPO=-40000000H;
  12064. BEGIN
  12065. (*
  12066. TypeDesc* = POINTER TO RECORD
  12067. descSize: SIZE;
  12068. sentinel: LONGINT; (* = MPO-4 *)
  12069. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12070. flags*: SET;
  12071. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12072. name*: Name;
  12073. refsOffset: SIZE;
  12074. END;
  12075. *)
  12076. (*name is missing prefixes sometimes*)
  12077. Global.GetModuleSegmentedName(module.module,name);
  12078. Basic.AppendToSegmentedName(name,".@Info");
  12079. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12080. IF ~implementationVisitor.backend.cooperative THEN
  12081. Info(source, "HeapBlock");
  12082. Address(source,0); (* an empty heap block prevents GC marking *)
  12083. Info(source, "TypeDescriptor");
  12084. Address(source,0);
  12085. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12086. END;
  12087. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12088. Address(source,MPO-4);
  12089. Info(source, "type tag pointer");
  12090. Address( source,0);
  12091. Info(source, "type flags");
  12092. flags := {};
  12093. Set( source, flags);
  12094. Info(source, "pointer to module");
  12095. moduleSection := ModuleSection();
  12096. Symbol( source, moduleSection, moduleSection.pc,0);
  12097. Info(source, "type name");
  12098. i := 0;
  12099. sectionName := "@Self";
  12100. (*
  12101. Global.GetSymbolSegmentedName(td,name);
  12102. Basic.SegmentedNameToString(name, sectionName);
  12103. *)
  12104. Name(source,sectionName);
  12105. patchInfoPC := source.pc;
  12106. Size(source, 0);
  12107. END NewModuleInfo;
  12108. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12109. VAR
  12110. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12111. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12112. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12113. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  12114. referenceSectionOffset : LONGINT;
  12115. name: Basic.SegmentedName; offset: LONGINT;
  12116. flags: SET;
  12117. BEGIN
  12118. NewModuleInfo();
  12119. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12120. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12121. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12122. ImportsArray(importSection);
  12123. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12124. CommandArray(commandsSection);
  12125. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12126. ExceptionArray(exceptionSection);
  12127. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12128. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12129. TypeInfoSection(typeInfoSection);
  12130. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12131. referenceSection.SetExported(TRUE);
  12132. References(referenceSection);
  12133. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12134. ProcedureDescriptorArray(procTableSection, numberProcs);
  12135. IF ProtectModulesPointers THEN
  12136. name := "Heaps.AnyPtr";
  12137. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12138. (* set base pointer *)
  12139. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12140. END;
  12141. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12142. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12143. moduleSection := ModuleSection();
  12144. Info(moduleSection, "nextRoot*: RootObject");
  12145. Address(moduleSection,0);
  12146. Info(moduleSection, "next*: Module");
  12147. Address(moduleSection,0);
  12148. Info(moduleSection, "name*: Name");
  12149. Name(moduleSection,moduleName);
  12150. Info(moduleSection, "init, published: BOOLEAN");
  12151. Boolean(moduleSection,FALSE);
  12152. Boolean(moduleSection,FALSE);
  12153. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12154. Boolean(moduleSection,FALSE);
  12155. Boolean(moduleSection,FALSE);
  12156. Info(moduleSection, "refcnt*: LONGINT");
  12157. Longint(moduleSection,0);
  12158. Info(moduleSection, "sb*: ADDRESS");
  12159. Address(moduleSection,0);
  12160. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12161. Address(moduleSection,0);
  12162. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12163. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12164. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12165. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12166. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12167. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12168. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12169. Symbol(moduleSection,importSection,importSectionOffset,0);
  12170. Info(moduleSection, "procTable*: ProcTable");
  12171. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12172. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12173. Address(moduleSection,0);
  12174. Address(moduleSection,0);
  12175. Address(moduleSection,0);
  12176. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12177. Info(moduleSection, "export*: ExportDesc");
  12178. ExportDesc(moduleSection);
  12179. Info(moduleSection, "term*: TerminationHandler");
  12180. Address(moduleSection,0);
  12181. Info(moduleSection, "exTable*: ExceptionTable");
  12182. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12183. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12184. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12185. Info(moduleSection, "crc*: LONGINT");
  12186. patchCRC:= moduleSection.pc;
  12187. Longint(moduleSection, 0); (*! must be implemented *)
  12188. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12189. Info(moduleSection, "body*: ADDRESS");
  12190. Symbol(moduleSection, bodyProc, 0,0);
  12191. Info(moduleSection, "module flags");
  12192. flags := {};
  12193. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12194. Set( moduleSection, flags);
  12195. IF implementationVisitor.backend.cooperative THEN
  12196. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12197. Info(moduleSection, "monitor.owner");
  12198. Address(moduleSection,0);
  12199. Info(moduleSection, "monitor.nestingLevel");
  12200. Address(moduleSection,0);
  12201. Info(moduleSection, "monitor.blockedQueue");
  12202. Address(moduleSection,0); Address(moduleSection,0);
  12203. Info(moduleSection, "monitor.waitingQueue");
  12204. Address(moduleSection,0); Address(moduleSection,0);
  12205. Info(moduleSection, "monitor.waitingSentinel");
  12206. Address(moduleSection,0);
  12207. END;
  12208. END Module;
  12209. PROCEDURE PatchCRC(crc: LONGINT);
  12210. BEGIN
  12211. IF ~simple THEN
  12212. PatchLongint(ModuleSection(), patchCRC, crc);
  12213. END;
  12214. END PatchCRC;
  12215. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12216. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12217. BEGIN
  12218. ArrayBlock(source,pc,"",FALSE);
  12219. Info(source, "pointer offsets array data");
  12220. IF scope IS SyntaxTree.RecordScope THEN
  12221. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12222. ELSIF scope IS SyntaxTree.CellScope THEN
  12223. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12224. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12225. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12226. WHILE variable # NIL DO
  12227. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12228. symbol := module.allSections.FindBySymbol(variable);
  12229. ASSERT(symbol # NIL);
  12230. Pointers(0,symbol, source,variable.type,numberPointers);
  12231. END;
  12232. variable := variable.nextVariable;
  12233. END;
  12234. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12235. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12236. WHILE parameter # NIL DO
  12237. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12238. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12239. END;
  12240. parameter := parameter.nextParameter;
  12241. END;
  12242. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12243. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12244. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12245. IF implementationVisitor.backend.preciseGC THEN
  12246. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12247. END;
  12248. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12249. END;
  12250. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12251. WHILE(variable # NIL) DO
  12252. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12253. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12254. END;
  12255. variable := variable.nextVariable
  12256. END;
  12257. END;
  12258. PatchArray(source,pc,numberPointers);
  12259. END PointerArray;
  12260. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12261. VAR recordType: SyntaxTree.RecordType;
  12262. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  12263. section: Sections.Section; cellType: SyntaxTree.CellType;
  12264. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12265. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12266. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12267. sectionName: Basic.SectionName;
  12268. CONST MPO=-40000000H;
  12269. BEGIN
  12270. (*
  12271. TypeDesc* = POINTER TO RECORD
  12272. descSize: SIZE;
  12273. sentinel: LONGINT; (* = MPO-4 *)
  12274. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12275. flags*: SET;
  12276. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12277. name*: Name;
  12278. refsOffset: SIZE;
  12279. END;
  12280. *)
  12281. (* source := module.sections.FindByName(...) *)
  12282. Global.GetSymbolSegmentedName(td,name);
  12283. Basic.AppendToSegmentedName(name,".@Info");
  12284. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12285. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12286. Address(source,0);
  12287. Info(source, "TypeDescriptor");
  12288. Address(source,0);
  12289. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12290. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12291. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12292. Info(source, "type tag pointer");
  12293. Symbol( source, tag, offset, 0);
  12294. Info(source, "type flags");
  12295. flags := {};
  12296. IF isProtected THEN INCL(flags,31) END;
  12297. Set( source, flags);
  12298. Info(source, "pointer to module");
  12299. moduleSection := ModuleSection();
  12300. Symbol( source, moduleSection, moduleSection.pc,0);
  12301. Info(source, "type name");
  12302. i := 0;
  12303. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12304. (*
  12305. Global.GetSymbolSegmentedName(td,name);
  12306. Basic.SegmentedNameToString(name, sectionName);
  12307. *)
  12308. Name(source,sectionName);
  12309. Size(source, 0);
  12310. RETURN source;
  12311. END NewTypeDescriptorInfo;
  12312. PROCEDURE NewTypeDescriptor;
  12313. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12314. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12315. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12316. numberPointers: LONGINT; padding, i: LONGINT;
  12317. CONST MPO=-40000000H;
  12318. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12319. VAR i: LONGINT;
  12320. PROCEDURE Td(record: SyntaxTree.RecordType);
  12321. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12322. BEGIN
  12323. IF record # NIL THEN
  12324. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12325. baseTD := record.typeDeclaration;
  12326. Global.GetSymbolSegmentedName(baseTD,name);
  12327. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12328. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12329. ELSE
  12330. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12331. END;
  12332. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12333. Symbol(source, tir, 0, offset);
  12334. IF reverse THEN Td(record.GetBaseRecord()) END;
  12335. END;
  12336. END Td;
  12337. BEGIN
  12338. Info(source, "tag table");
  12339. baseRecord := recordType;
  12340. i := 0;
  12341. WHILE baseRecord # NIL DO
  12342. INC(i);
  12343. baseRecord := baseRecord.GetBaseRecord();
  12344. END;
  12345. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12346. IF ~reverse THEN Td(recordType) END;
  12347. WHILE i < size DO
  12348. Address(source,0);
  12349. INC(i);
  12350. END;
  12351. IF reverse THEN Td(recordType) END;
  12352. END TdTable;
  12353. PROCEDURE MethodTable(reverse: BOOLEAN);
  12354. VAR i,methods: LONGINT;
  12355. BEGIN
  12356. Info(source, "method table");
  12357. IF recordType # NIL THEN
  12358. methods := recordType.recordScope.numberMethods;
  12359. IF reverse THEN
  12360. FOR i := methods-1 TO 0 BY -1 DO
  12361. procedure := recordType.recordScope.FindMethod(i);
  12362. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12363. NamedSymbol(source, name,procedure, 0,0);
  12364. END;
  12365. ELSE
  12366. FOR i := 0 TO methods-1 DO
  12367. procedure := recordType.recordScope.FindMethod(i);
  12368. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12369. NamedSymbol(source, name,procedure, 0,0);
  12370. END;
  12371. END;
  12372. END;
  12373. END MethodTable;
  12374. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12375. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12376. BEGIN
  12377. Info(source, "method table");
  12378. baseRecord := recordType;
  12379. WHILE baseRecord.baseType # NIL DO
  12380. baseRecord := baseRecord.GetBaseRecord ();
  12381. END;
  12382. GetRecordTypeName (baseRecord, name);
  12383. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12384. IF name = stackFrame THEN
  12385. start := 0;
  12386. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12387. baseRecord := recordType;
  12388. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12389. baseRecord := baseRecord.GetBaseRecord ();
  12390. END;
  12391. IF baseRecord # NIL THEN
  12392. GetRecordTypeName (baseRecord, name);
  12393. IF pointer & ~baseRecord.isObject THEN
  12394. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12395. END;
  12396. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12397. ELSIF recordType.isObject THEN
  12398. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12399. ELSIF pointer THEN
  12400. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12401. ELSE
  12402. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12403. END;
  12404. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12405. Symbol(source, tir, 0, 0);
  12406. start := 0;
  12407. baseRecord := recordType;
  12408. WHILE (baseRecord # NIL) DO
  12409. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12410. baseRecord := baseRecord.GetBaseRecord ();
  12411. END;
  12412. ELSE
  12413. (* explicit trace method: *)
  12414. procedure := recordType.recordScope.FindMethod(0);
  12415. IF ~procedure.isFinalizer THEN
  12416. Global.GetSymbolSegmentedName(procedure, name);
  12417. NamedSymbol(source, name,procedure, 0,0);
  12418. END;
  12419. start := 1;
  12420. END;
  12421. IF (name # stackFrame) & recordType.isObject THEN
  12422. baseRecord := recordType;
  12423. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12424. baseRecord := baseRecord.GetBaseRecord ();
  12425. END;
  12426. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12427. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12428. ELSE
  12429. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12430. END;
  12431. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12432. Symbol(source, tir, 0, 0);
  12433. END;
  12434. methods := recordType.recordScope.numberMethods;
  12435. FOR i := start TO methods-1 DO
  12436. procedure := recordType.recordScope.FindMethod(i);
  12437. IF ~procedure.isFinalizer THEN
  12438. Global.GetSymbolSegmentedName(procedure, name);
  12439. NamedSymbol(source, name,procedure, 0,0);
  12440. END;
  12441. END;
  12442. END CooperativeMethodTable;
  12443. BEGIN
  12444. Global.GetSymbolSegmentedName(td,name);
  12445. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12446. source.SetExported(IsExported(td));
  12447. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12448. IF implementationVisitor.backend.cooperative THEN
  12449. base := NIL;
  12450. baseRecord := recordType.GetBaseRecord();
  12451. IF baseRecord # NIL THEN
  12452. baseTD := baseRecord.typeDeclaration;
  12453. END;
  12454. IF ~recordType.isObject THEN
  12455. Info(source, "parent");
  12456. IF baseRecord # NIL THEN
  12457. Global.GetSymbolSegmentedName(baseTD,name);
  12458. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12459. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12460. ELSE
  12461. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12462. END;
  12463. Symbol(source, tir, 0, 0);
  12464. ELSE
  12465. Address(source,0);
  12466. END;
  12467. Info(source, "record size");
  12468. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12469. CooperativeMethodTable(FALSE);
  12470. base := source;
  12471. Global.GetSymbolSegmentedName(td,name);
  12472. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12473. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12474. source.SetExported(IsExported(td));
  12475. END;
  12476. Info(source, "parent");
  12477. IF baseRecord # NIL THEN
  12478. Global.GetSymbolSegmentedName(baseTD,name);
  12479. sym := baseTD;
  12480. IF ~recordType.isObject THEN
  12481. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12482. sym := NIL;
  12483. END;
  12484. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12485. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12486. ELSE
  12487. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12488. END;
  12489. Symbol(source, tir, 0, 0);
  12490. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12491. Address(source,0);
  12492. ELSE
  12493. IF recordType.isObject THEN
  12494. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12495. ELSE
  12496. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12497. END;
  12498. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12499. Symbol(source, tir, 0, 0);
  12500. END;
  12501. Info(source, "base record descriptor");
  12502. Symbol(source, base, 0, 0);
  12503. CooperativeMethodTable(TRUE);
  12504. IF recordType.hasPointers THEN
  12505. IF ~HasExplicitTraceMethod (recordType) THEN
  12506. implementationVisitor.CreateTraceMethod(recordType);
  12507. END;
  12508. implementationVisitor.CreateResetProcedure(recordType);
  12509. implementationVisitor.CreateAssignProcedure(recordType);
  12510. END;
  12511. ELSIF ~simple THEN
  12512. (*
  12513. MethodEnd = MPO
  12514. ---
  12515. methods (# methods)
  12516. ---
  12517. tags (16)
  12518. ---
  12519. TypeDesc = TypeInfoAdr
  12520. ---
  12521. td adr ---> rec size
  12522. ----
  12523. pointer offsets
  12524. ----
  12525. (padding)
  12526. -----
  12527. empty [2 addresses aligned]
  12528. empty
  12529. empty
  12530. numPtrs
  12531. ---
  12532. pointer offsets
  12533. ---
  12534. *)
  12535. Info(source, "MethodEnd = MPO");
  12536. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12537. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12538. MethodTable(TRUE);
  12539. TdTable(TypeTags, TRUE);
  12540. Info(source, "type descriptor info pointer");
  12541. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12542. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12543. IF (cellType # NIL) THEN
  12544. IF cellType.sizeInBits < 0 THEN
  12545. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12546. END;
  12547. Info(source, "cell size");
  12548. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12549. ELSE
  12550. Info(source, "record size");
  12551. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12552. END;
  12553. Info(source, "pointer offsets pointer");
  12554. padding := 1- source.pc MOD 2;
  12555. Symbol(source, source, source.pc+1+padding,0);
  12556. IF padding >0 THEN
  12557. Info(source, "padding");
  12558. FOR i := 1 TO padding DO Address(source,0) END;
  12559. END;
  12560. IF cellType # NIL THEN
  12561. PointerArray(source, cellType.cellScope, numberPointers);
  12562. ELSE
  12563. PointerArray(source, recordType.recordScope, numberPointers);
  12564. END;
  12565. ELSE
  12566. (*
  12567. simple:
  12568. td adr --> size
  12569. tag(1)
  12570. tag(2)
  12571. tag(3)
  12572. methods ->
  12573. *)
  12574. Info(source, "record size");
  12575. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12576. TdTable(TypeTags, FALSE);
  12577. MethodTable(FALSE);
  12578. END;
  12579. END NewTypeDescriptor;
  12580. BEGIN
  12581. x := x.resolved;
  12582. IF (x IS SyntaxTree.PointerType) THEN
  12583. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12584. END;
  12585. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12586. recordType := x(SyntaxTree.RecordType);
  12587. td := x.typeDeclaration;
  12588. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12589. ASSERT(td # NIL);
  12590. section := module.allSections.FindBySymbol(td); (* TODO *)
  12591. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12592. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12593. NewTypeDescriptor
  12594. END;
  12595. END;
  12596. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12597. cellType := x(SyntaxTree.CellType);
  12598. td := x.typeDeclaration;
  12599. section := module.allSections.FindBySymbol(td); (* TODO *)
  12600. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12601. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12602. NewTypeDescriptor
  12603. END;
  12604. END;
  12605. END
  12606. END CheckTypeDeclaration
  12607. END MetaDataGenerator;
  12608. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12609. VAR
  12610. trace-: BOOLEAN;
  12611. traceString-: SyntaxTree.IdentifierString;
  12612. traceModuleName-: SyntaxTree.IdentifierString;
  12613. profile-: BOOLEAN;
  12614. noRuntimeChecks: BOOLEAN;
  12615. simpleMetaData-: BOOLEAN;
  12616. noAsserts: BOOLEAN;
  12617. optimize-: BOOLEAN;
  12618. cooperative-: BOOLEAN;
  12619. preregisterStatic-: BOOLEAN;
  12620. dump-: Basic.Writer;
  12621. cellsAreObjects: BOOLEAN;
  12622. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12623. experiment: BOOLEAN;
  12624. PROCEDURE &InitIntermediateBackend*;
  12625. BEGIN
  12626. simpleMetaData := FALSE;
  12627. InitBackend;
  12628. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12629. SetTraceModuleName(DefaultTraceModuleName);
  12630. END InitIntermediateBackend;
  12631. (* must be overwritten by actual backend, if parameter registers should be used *)
  12632. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  12633. BEGIN
  12634. register := -1;
  12635. RETURN FALSE;
  12636. END GetParameterRegister;
  12637. PROCEDURE ResetParameterRegisters*;
  12638. BEGIN
  12639. END ResetParameterRegisters;
  12640. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12641. VAR
  12642. declarationVisitor: DeclarationVisitor;
  12643. implementationVisitor: ImplementationVisitor;
  12644. module: Sections.Module;
  12645. name, platformName: SyntaxTree.IdentifierString;
  12646. meta: MetaDataGenerator;
  12647. crc: CRC.CRC32Stream;
  12648. BEGIN
  12649. ResetError;
  12650. Global.GetSymbolName(x,name);
  12651. NEW(module,x,system); (* backend structures *)
  12652. Global.GetModuleName(x, name);
  12653. module.SetModuleName(name);
  12654. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12655. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12656. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12657. declarationVisitor.Module(x,module);
  12658. IF ~meta.simple THEN
  12659. meta.Module(implementationVisitor.moduleBodySection);
  12660. END;
  12661. GetDescription(platformName);
  12662. module.SetPlatformName(platformName);
  12663. NEW(crc);
  12664. module.allSections.WriteRaw(crc);
  12665. crc.Update;
  12666. meta.PatchCRC(crc.GetCRC());
  12667. RETURN module
  12668. END GenerateIntermediate;
  12669. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12670. BEGIN RETURN TRUE
  12671. END SupportedImmediate;
  12672. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12673. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12674. END ProcessSyntaxTreeModule;
  12675. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12676. VAR
  12677. result: Sections.Module;
  12678. traceName: Basic.MessageString;
  12679. BEGIN
  12680. ASSERT(intermediateCodeModule IS Sections.Module);
  12681. result := intermediateCodeModule(Sections.Module);
  12682. IF trace THEN
  12683. traceName := "intermediate code trace: ";
  12684. Strings.Append(traceName,traceString);
  12685. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12686. IF (traceString="") OR (traceString="*") THEN
  12687. result.Dump(dump);
  12688. dump.Update
  12689. ELSE
  12690. Sections.DumpFiltered(dump, result, traceString);
  12691. END
  12692. END;
  12693. RETURN result
  12694. END ProcessIntermediateCodeModule;
  12695. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12696. BEGIN instructionSet := "Intermediate";
  12697. END GetDescription;
  12698. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12699. BEGIN
  12700. SELF.simpleMetaData := simpleMetaData;
  12701. END SetSimpleMetaData;
  12702. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12703. BEGIN COPY(name, traceModuleName)
  12704. END SetTraceModuleName;
  12705. PROCEDURE DefineOptions*(options: Options.Options);
  12706. BEGIN
  12707. DefineOptions^(options);
  12708. options.Add(0X,"trace",Options.String);
  12709. options.Add(0X,"builtinsModule",Options.String);
  12710. options.Add(0X,"traceModule",Options.String);
  12711. options.Add(0X,"profile",Options.Flag);
  12712. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12713. options.Add(0X,"noAsserts",Options.Flag);
  12714. options.Add(0X,"metaData",Options.String);
  12715. options.Add('o',"optimize", Options.Flag);
  12716. options.Add(0X,"preregisterStatic", Options.Flag);
  12717. options.Add(0X,"cellsAreObjects", Options.Flag);
  12718. options.Add(0X,"preciseGC", Options.Flag);
  12719. options.Add(0X,"trackLeave", Options.Flag);
  12720. options.Add(0X,"writeBarriers", Options.Flag);
  12721. options.Add(0X,"experiment", Options.Flag);
  12722. END DefineOptions;
  12723. PROCEDURE GetOptions*(options: Options.Options);
  12724. VAR name,string: SyntaxTree.IdentifierString;
  12725. BEGIN
  12726. GetOptions^(options);
  12727. trace := options.GetString("trace",traceString);
  12728. profile := options.GetFlag("profile");
  12729. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12730. noAsserts := options.GetFlag("noAsserts");
  12731. cooperative := options.GetFlag("cooperative");
  12732. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12733. simpleMetaData := TRUE
  12734. END;
  12735. IF options.GetString("metaData",string) THEN
  12736. IF string = "simple" THEN simpleMetaData := TRUE
  12737. ELSIF string ="full" THEN simpleMetaData := FALSE
  12738. END;
  12739. END;
  12740. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12741. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12742. optimize := options.GetFlag("optimize");
  12743. preregisterStatic := options.GetFlag("preregisterStatic");
  12744. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12745. preciseGC := options.GetFlag("preciseGC");
  12746. trackLeave := options.GetFlag("trackLeave");
  12747. writeBarriers := options.GetFlag("writeBarriers");
  12748. experiment := options.GetFlag("experiment");
  12749. END GetOptions;
  12750. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12751. BEGIN RETURN SymbolFileFormat.Get()
  12752. END DefaultSymbolFileFormat;
  12753. END IntermediateBackend;
  12754. (* ----------------------------------- register allocation ------------------------------------- *)
  12755. (* register mapping scheme
  12756. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12757. spill offset
  12758. part(n) --> ticket <--> physical register
  12759. spill offset
  12760. *)
  12761. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12762. emptyOperand: IntermediateCode.Operand;
  12763. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12764. statCoopResetVariables: LONGINT;
  12765. statCoopModifyAssignments: LONGINT;
  12766. modifyAssignmentsPC : LONGINT;
  12767. statCoopNilCheck: LONGINT;
  12768. statCoopSwitch: LONGINT;
  12769. statCoopAssignProcedure: LONGINT;
  12770. statCoopTraceMethod: LONGINT;
  12771. statCoopResetProcedure: LONGINT;
  12772. statCoopTraceModule: LONGINT;
  12773. PROCEDURE ResetStatistics*;
  12774. BEGIN
  12775. statCoopResetVariables := 0;
  12776. statCoopModifyAssignments := 0;
  12777. statCoopNilCheck:= 0;
  12778. statCoopSwitch:= 0;
  12779. statCoopAssignProcedure:= 0;
  12780. statCoopTraceMethod:= 0;
  12781. statCoopResetProcedure:= 0;
  12782. statCoopTraceModule:= 0;
  12783. END ResetStatistics;
  12784. PROCEDURE Statistics*;
  12785. BEGIN
  12786. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12787. TRACE(statCoopNilCheck, statCoopSwitch);
  12788. TRACE(statCoopAssignProcedure,
  12789. statCoopTraceMethod,
  12790. statCoopResetProcedure,
  12791. statCoopTraceModule)
  12792. END Statistics;
  12793. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12794. VAR h: LONGINT;
  12795. BEGIN
  12796. WHILE b # 0 DO
  12797. h := a MOD b;
  12798. a := b;
  12799. b := h;
  12800. END;
  12801. RETURN a
  12802. END GCD;
  12803. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12804. BEGIN
  12805. RETURN a*b DIV GCD(a,b)
  12806. END SCM;
  12807. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12808. BEGIN
  12809. (*TRACE(a,b);*)
  12810. IF a = 0 THEN RETURN b
  12811. ELSIF b = 0 THEN RETURN a
  12812. ELSE RETURN SCM(a,b)
  12813. END;
  12814. END CommonAlignment;
  12815. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12816. BEGIN
  12817. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12818. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12819. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12820. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12821. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12822. END
  12823. END PassBySingleReference;
  12824. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12825. BEGIN
  12826. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12827. END PassInRegister;
  12828. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12829. VAR new: RegisterEntry;
  12830. BEGIN
  12831. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12832. IF queue = NIL THEN
  12833. queue := new
  12834. ELSE
  12835. new.next := queue;
  12836. IF queue#NIL THEN queue.prev := new END;
  12837. queue := new
  12838. END;
  12839. END AddRegisterEntry;
  12840. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12841. VAR this: RegisterEntry;
  12842. BEGIN
  12843. this := queue;
  12844. WHILE (this # NIL) & (this.register # register) DO
  12845. this := this.next;
  12846. END;
  12847. IF this = NIL THEN
  12848. RETURN FALSE
  12849. END;
  12850. ASSERT(this # NIL);
  12851. IF this = queue THEN queue := queue.next END;
  12852. IF this.prev # NIL THEN this.prev.next := this.next END;
  12853. IF this.next # NIL THEN this.next.prev := this.prev END;
  12854. RETURN TRUE
  12855. END RemoveRegisterEntry;
  12856. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12857. BEGIN ASSERT(cond);
  12858. END Assert;
  12859. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12860. BEGIN
  12861. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12862. END ReusableRegister;
  12863. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12864. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12865. BEGIN
  12866. procedure := moduleScope.bodyProcedure;
  12867. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12868. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12869. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12870. procedure.SetScope(moduleScope);
  12871. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12872. procedure.SetAccess(SyntaxTree.Hidden);
  12873. moduleScope.SetBodyProcedure(procedure);
  12874. moduleScope.AddProcedure(procedure);
  12875. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12876. END;
  12877. END EnsureBodyProcedure;
  12878. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12879. VAR import: SyntaxTree.Import;
  12880. selfName: SyntaxTree.IdentifierString;
  12881. module: SyntaxTree.Module;
  12882. BEGIN
  12883. scope.ownerModule.GetName(selfName);
  12884. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12885. module := scope.ownerModule
  12886. ELSE
  12887. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12888. IF import = NIL THEN
  12889. RETURN NIL
  12890. ELSIF import.module = NIL THEN
  12891. RETURN NIL
  12892. ELSE module := import.module
  12893. END;
  12894. END;
  12895. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12896. END GetSymbol;
  12897. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12898. BEGIN
  12899. op.mode := mode;
  12900. IntermediateCode.InitOperand(op.op);
  12901. IntermediateCode.InitOperand(op.tag);
  12902. IntermediateCode.InitOperand(op.extra);
  12903. op.dimOffset := 0;
  12904. END InitOperand;
  12905. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12906. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12907. BEGIN RETURN IntermediateCode.GetType(system, type)
  12908. END GetType;
  12909. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12910. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12911. BEGIN
  12912. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12913. (*
  12914. UniqueId(name,module,name,adr);
  12915. *)
  12916. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12917. constant.SetValue(value);
  12918. constant.SetAccess(SyntaxTree.Hidden);
  12919. module.moduleScope.AddConstant(constant);
  12920. constant.SetScope(module.moduleScope);
  12921. RETURN constant
  12922. END BuildConstant;
  12923. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12924. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12925. BEGIN
  12926. variable := scope.firstVariable;
  12927. WHILE variable # NIL DO
  12928. IF variable.NeedsTrace() THEN
  12929. RETURN TRUE;
  12930. END;
  12931. variable := variable.nextVariable;
  12932. END;
  12933. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12934. WHILE parameter # NIL DO
  12935. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12936. RETURN TRUE;
  12937. END;
  12938. parameter := parameter.nextParameter;
  12939. END;
  12940. RETURN FALSE;
  12941. END HasPointers;
  12942. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12943. 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));
  12944. END IsVariableParameter;
  12945. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12946. VAR parameter: SyntaxTree.Parameter;
  12947. BEGIN
  12948. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12949. WHILE parameter # NIL DO
  12950. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12951. IF parameter.movable THEN RETURN TRUE END;
  12952. parameter := parameter.nextParameter;
  12953. END;
  12954. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12955. END HasVariableParameters;
  12956. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12957. BEGIN
  12958. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12959. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12960. END HasExplicitTraceMethod;
  12961. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12962. BEGIN
  12963. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12964. IF (expression IS SyntaxTree.IntegerValue) THEN
  12965. val := expression(SyntaxTree.IntegerValue).value;
  12966. RETURN TRUE
  12967. ELSE
  12968. RETURN FALSE
  12969. END;
  12970. END IsIntegerConstant;
  12971. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12972. BEGIN
  12973. IF val <= 0 THEN RETURN FALSE END;
  12974. exp := 0;
  12975. WHILE ~ODD(val) DO
  12976. val := val DIV 2;
  12977. INC(exp)
  12978. END;
  12979. RETURN val = 1
  12980. END PowerOf2;
  12981. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12982. VAR procedure: SyntaxTree.Procedure;
  12983. BEGIN
  12984. procedure := record.recordScope.constructor;
  12985. IF procedure = NIL THEN
  12986. record := record.GetBaseRecord();
  12987. IF record # NIL THEN
  12988. procedure := GetConstructor(record)
  12989. END;
  12990. END;
  12991. RETURN procedure;
  12992. END GetConstructor;
  12993. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12994. BEGIN
  12995. value := SHORT(op.intValue);
  12996. RETURN op.mode = IntermediateCode.ModeImmediate;
  12997. END IsIntegerImmediate;
  12998. (** whether a type strictily is a pointer to record or object type
  12999. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13000. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13001. BEGIN
  13002. IF type = NIL THEN
  13003. RETURN FALSE
  13004. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13005. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13006. ELSE
  13007. RETURN FALSE
  13008. END
  13009. END IsStrictlyPointerToRecord;
  13010. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13011. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13012. END IsUnsafePointer;
  13013. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13014. BEGIN type := type.resolved;
  13015. IF type IS SyntaxTree.PointerType THEN
  13016. type := type(SyntaxTree.PointerType).pointerBase;
  13017. type := type.resolved;
  13018. IF type IS SyntaxTree.RecordType THEN
  13019. recordType := type(SyntaxTree.RecordType);
  13020. RETURN TRUE
  13021. ELSE
  13022. RETURN FALSE
  13023. END
  13024. ELSIF type IS SyntaxTree.RecordType THEN
  13025. recordType := type(SyntaxTree.RecordType);
  13026. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13027. ELSIF type IS SyntaxTree.ObjectType THEN
  13028. RETURN TRUE
  13029. ELSIF type IS SyntaxTree.AnyType THEN
  13030. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13031. ELSE
  13032. RETURN FALSE
  13033. END;
  13034. END IsPointerToRecord;
  13035. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13036. BEGIN
  13037. type := type.resolved;
  13038. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13039. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13040. END IsArrayOfSystemByte;
  13041. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13042. BEGIN
  13043. IF type = NIL THEN RETURN FALSE END;
  13044. type := type.resolved;
  13045. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13046. END IsOpenArray;
  13047. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13048. BEGIN
  13049. IF type = NIL THEN RETURN FALSE END;
  13050. type := type.resolved;
  13051. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13052. END IsSemiDynamicArray;
  13053. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13054. BEGIN
  13055. IF type = NIL THEN RETURN FALSE END;
  13056. type := type.resolved;
  13057. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13058. END IsStaticArray;
  13059. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13060. BEGIN
  13061. IF type = NIL THEN RETURN FALSE END;
  13062. type := type.resolved;
  13063. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13064. END IsStaticMathArray;
  13065. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13066. BEGIN
  13067. WHILE (IsStaticMathArray(type)) DO
  13068. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13069. END;
  13070. RETURN type;
  13071. END StaticMathArrayBaseType;
  13072. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13073. VAR size: LONGINT;
  13074. BEGIN
  13075. size := 1;
  13076. WHILE (IsStaticArray(type)) DO
  13077. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13078. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13079. END;
  13080. RETURN size;
  13081. END StaticArrayNumElements;
  13082. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13083. VAR size: LONGINT;
  13084. BEGIN
  13085. size := 1;
  13086. WHILE (IsStaticMathArray(type)) DO
  13087. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13088. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13089. END;
  13090. RETURN size;
  13091. END StaticMathArrayNumElements;
  13092. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13093. BEGIN
  13094. WHILE (IsStaticArray(type)) DO
  13095. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13096. END;
  13097. RETURN type;
  13098. END StaticArrayBaseType;
  13099. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13100. BEGIN
  13101. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13102. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13103. END;
  13104. RETURN type;
  13105. END ArrayBaseType;
  13106. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13107. BEGIN
  13108. IF type = NIL THEN RETURN FALSE END;
  13109. type := type.resolved;
  13110. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13111. END IsDelegate;
  13112. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13113. VAR i: LONGINT;
  13114. BEGIN
  13115. i := 0; type := type.resolved;
  13116. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13117. INC(i);
  13118. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13119. END;
  13120. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13121. INC(i);
  13122. type := type(SyntaxTree.MathArrayType).arrayBase;
  13123. IF type # NIL THEN type := type.resolved END;
  13124. END;
  13125. RETURN i
  13126. END DynamicDim;
  13127. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13128. BEGIN
  13129. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13130. type := type(SyntaxTree.ArrayType).arrayBase;
  13131. END;
  13132. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13133. type := type(SyntaxTree.MathArrayType).arrayBase;
  13134. END;
  13135. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13136. END StaticSize;
  13137. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13138. BEGIN
  13139. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13140. END IsImmediate;
  13141. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13142. BEGIN
  13143. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13144. END IsAddress;
  13145. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13146. BEGIN
  13147. RETURN (x.mode = IntermediateCode.ModeRegister);
  13148. END IsRegister;
  13149. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13150. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13151. BEGIN
  13152. typeDeclaration := recordType.typeDeclaration;
  13153. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13154. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13155. END GetRecordTypeName;
  13156. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13157. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13158. BEGIN
  13159. parSize := 0;
  13160. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13161. parameter := procedureType.returnParameter;
  13162. INC(parSize,system.SizeOfParameter(parameter));
  13163. parSize := parSize + (-parSize) MOD system.addressSize;
  13164. END;
  13165. parameter :=procedureType.lastParameter;
  13166. WHILE (parameter # NIL) DO
  13167. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13168. INC(parSize, system.addressSize);
  13169. ELSE
  13170. INC(parSize,system.SizeOfParameter(parameter));
  13171. parSize := parSize + (-parSize) MOD system.addressSize;
  13172. END;
  13173. parameter := parameter.prevParameter;
  13174. END;
  13175. IF procedureType.selfParameter # NIL THEN
  13176. parameter := procedureType.selfParameter;
  13177. INC(parSize,system.SizeOfParameter(parameter));
  13178. parSize := parSize + (-parSize) MOD system.addressSize;
  13179. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13180. END; (* method => self pointer *)
  13181. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13182. RETURN ToMemoryUnits(system,parSize)
  13183. END ParametersSize;
  13184. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13185. BEGIN
  13186. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13187. END IsNested;
  13188. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13189. BEGIN
  13190. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13191. scope := scope.outerScope;
  13192. END;
  13193. RETURN scope # NIL;
  13194. END InCellScope;
  13195. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13196. BEGIN
  13197. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13198. END ProcedureParametersSize;
  13199. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13200. VAR dataUnit: LONGINT;
  13201. BEGIN dataUnit := system.dataUnit;
  13202. ASSERT(size MOD system.dataUnit = 0);
  13203. RETURN LONGINT(size DIV system.dataUnit)
  13204. END ToMemoryUnits;
  13205. PROCEDURE Get*(): Backend.Backend;
  13206. VAR backend: IntermediateBackend;
  13207. BEGIN NEW(backend); RETURN backend
  13208. END Get;
  13209. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13210. VAR instruction: IntermediateCode.Instruction;
  13211. BEGIN
  13212. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13213. RETURN instruction
  13214. END Nop;
  13215. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13216. VAR instruction: IntermediateCode.Instruction;
  13217. BEGIN
  13218. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13219. RETURN instruction
  13220. END Mov;
  13221. (* like Mov but ensures that no new register will be allocated for dest *)
  13222. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13223. VAR instruction: IntermediateCode.Instruction;
  13224. BEGIN
  13225. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13226. RETURN instruction
  13227. END MovReplace;
  13228. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13229. VAR instruction: IntermediateCode.Instruction;
  13230. BEGIN
  13231. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13232. RETURN instruction
  13233. END Conv;
  13234. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13235. VAR instruction: IntermediateCode.Instruction;
  13236. BEGIN
  13237. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13238. RETURN instruction
  13239. END Call;
  13240. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13241. VAR op1, op2, op3: IntermediateCode.Operand;
  13242. VAR instruction: IntermediateCode.Instruction;
  13243. BEGIN
  13244. IntermediateCode.InitNumber(op1,pcOffset);
  13245. IntermediateCode.InitNumber(op2,callingConvention);
  13246. IntermediateCode.InitNumber(op3,unwind);
  13247. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13248. RETURN instruction
  13249. END Exit;
  13250. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13251. VAR instruction: IntermediateCode.Instruction;
  13252. BEGIN
  13253. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13254. RETURN instruction
  13255. END Return;
  13256. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13257. VAR instruction: IntermediateCode.Instruction;
  13258. BEGIN
  13259. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13260. RETURN instruction
  13261. END Result;
  13262. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13263. VAR op1: IntermediateCode.Operand;
  13264. VAR instruction: IntermediateCode.Instruction;
  13265. BEGIN
  13266. IntermediateCode.InitNumber(op1,nr);
  13267. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13268. RETURN instruction
  13269. END Trap;
  13270. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13271. VAR instruction: IntermediateCode.Instruction;
  13272. BEGIN
  13273. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13274. RETURN instruction
  13275. END Br;
  13276. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13277. VAR instruction: IntermediateCode.Instruction;
  13278. BEGIN
  13279. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13280. RETURN instruction
  13281. END Breq;
  13282. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13283. VAR instruction: IntermediateCode.Instruction;
  13284. BEGIN
  13285. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13286. RETURN instruction
  13287. END Brne;
  13288. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13289. VAR instruction: IntermediateCode.Instruction;
  13290. BEGIN
  13291. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13292. RETURN instruction
  13293. END Brge;
  13294. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13295. VAR instruction: IntermediateCode.Instruction;
  13296. BEGIN
  13297. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13298. RETURN instruction
  13299. END Brlt;
  13300. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13301. VAR instruction: IntermediateCode.Instruction;
  13302. BEGIN
  13303. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13304. RETURN instruction
  13305. END Pop;
  13306. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13307. VAR instruction: IntermediateCode.Instruction;
  13308. BEGIN
  13309. ASSERT(op.mode # IntermediateCode.Undefined);
  13310. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13311. RETURN instruction
  13312. END Push;
  13313. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13314. VAR instruction: IntermediateCode.Instruction;
  13315. BEGIN
  13316. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13317. RETURN instruction
  13318. END Neg;
  13319. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13320. VAR instruction: IntermediateCode.Instruction;
  13321. BEGIN
  13322. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13323. RETURN instruction
  13324. END Not;
  13325. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13326. VAR instruction: IntermediateCode.Instruction;
  13327. BEGIN
  13328. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13329. RETURN instruction
  13330. END Abs;
  13331. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13332. VAR instruction: IntermediateCode.Instruction;
  13333. BEGIN
  13334. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13335. ASSERT(~IsImmediate(instruction.op1));
  13336. RETURN instruction
  13337. END Mul;
  13338. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13339. VAR instruction: IntermediateCode.Instruction;
  13340. BEGIN
  13341. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13342. RETURN instruction
  13343. END Div;
  13344. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13345. VAR instruction: IntermediateCode.Instruction;
  13346. BEGIN
  13347. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13348. RETURN instruction
  13349. END Mod;
  13350. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13351. VAR instruction: IntermediateCode.Instruction;
  13352. BEGIN
  13353. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13354. RETURN instruction
  13355. END Sub;
  13356. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13357. VAR instruction: IntermediateCode.Instruction;
  13358. BEGIN
  13359. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13360. RETURN instruction
  13361. END Add;
  13362. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13363. VAR instruction: IntermediateCode.Instruction;
  13364. BEGIN
  13365. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13366. RETURN instruction
  13367. END And;
  13368. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13369. VAR instruction: IntermediateCode.Instruction;
  13370. BEGIN
  13371. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13372. RETURN instruction
  13373. END Or;
  13374. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13375. VAR instruction: IntermediateCode.Instruction;
  13376. BEGIN
  13377. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13378. RETURN instruction
  13379. END Xor;
  13380. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13381. VAR instruction: IntermediateCode.Instruction;
  13382. BEGIN
  13383. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13384. RETURN instruction
  13385. END Shl;
  13386. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13387. VAR instruction: IntermediateCode.Instruction;
  13388. BEGIN
  13389. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13390. RETURN instruction
  13391. END Shr;
  13392. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13393. VAR instruction: IntermediateCode.Instruction;
  13394. BEGIN
  13395. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13396. RETURN instruction
  13397. END Rol;
  13398. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13399. VAR instruction: IntermediateCode.Instruction;
  13400. BEGIN
  13401. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13402. RETURN instruction
  13403. END Ror;
  13404. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13405. VAR instruction: IntermediateCode.Instruction;
  13406. BEGIN
  13407. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13408. RETURN instruction
  13409. END Cas;
  13410. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13411. VAR instruction: IntermediateCode.Instruction;
  13412. BEGIN
  13413. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13414. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13415. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13416. RETURN instruction
  13417. END Copy;
  13418. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13419. VAR instruction: IntermediateCode.Instruction;
  13420. BEGIN
  13421. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13422. RETURN instruction
  13423. END Fill;
  13424. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13425. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13426. BEGIN
  13427. string := IntermediateCode.String(s);
  13428. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13429. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13430. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13431. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13432. RETURN instruction
  13433. END Asm;
  13434. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13435. VAR instruction: IntermediateCode.Instruction;
  13436. BEGIN
  13437. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13438. RETURN instruction
  13439. END Data;
  13440. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13441. VAR instruction: IntermediateCode.Instruction;
  13442. BEGIN
  13443. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13444. IntermediateCode.SetSubType(instruction, subtype);
  13445. RETURN instruction
  13446. END SpecialInstruction;
  13447. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13448. VAR op1: IntermediateCode.Operand;
  13449. VAR instruction: IntermediateCode.Instruction;
  13450. BEGIN
  13451. (*! generate a warning if size exceeds a certain limit *)
  13452. (*
  13453. ASSERT(bytes < 1000000); (* sanity check *)
  13454. *)
  13455. ASSERT(0 <= units); (* sanity check *)
  13456. IntermediateCode.InitNumber(op1,units);
  13457. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13458. RETURN instruction
  13459. END Reserve;
  13460. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13461. VAR op1: IntermediateCode.Operand;
  13462. VAR instruction: IntermediateCode.Instruction;
  13463. BEGIN
  13464. IntermediateCode.InitNumber(op1,position.start);
  13465. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13466. RETURN instruction
  13467. END LabelInstruction;
  13468. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13469. VAR pc: LONGINT;
  13470. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13471. BEGIN
  13472. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13473. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13474. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13475. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13476. IF instr.op1.type.form = IntermediateCode.Float THEN
  13477. RETURN instr.op1.floatValue = op.floatValue
  13478. ELSE
  13479. RETURN instr.op1.intValue = op.intValue
  13480. END;
  13481. END ProvidesValue;
  13482. BEGIN
  13483. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13484. pc := 0;
  13485. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13486. INC(pc);
  13487. END;
  13488. IF pc = data.pc THEN
  13489. data.Emit(Data(Basic.invalidPosition,vop));
  13490. END;
  13491. RETURN pc
  13492. END EnterImmediate;
  13493. PROCEDURE Init;
  13494. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13495. BEGIN
  13496. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13497. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13498. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13499. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13500. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13501. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13502. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13503. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13504. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13505. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13506. IntermediateCode.InitOperand(emptyOperand);
  13507. FOR i := 0 TO NumberSystemCalls-1 DO
  13508. name := "@SystemCall";
  13509. Basic.AppendNumber(name,i);
  13510. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13511. END;
  13512. END Init;
  13513. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13514. BEGIN
  13515. RETURN (symbol # NIL) & symbol.NeedsSection();
  13516. END IsExported;
  13517. BEGIN
  13518. Init;
  13519. END FoxIntermediateBackend.
  13520. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13521. # Release.Build --path="/temp/obg/" Win32 ~
  13522. # 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 ~
  13523. FStols.CloseFiles A2Z.exe ~
  13524. System.FreeDownTo FoxIntermediateBackend ~
  13525. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13526. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13527. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13528. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13529. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13530. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13531. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13532. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13533. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13534. GenericLinker.Mod Loader.Mod BootConsole.Mod