FoxIntermediateBackend.Mod 581 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686146871468814689146901469114692146931469414695146961469714698146991470014701147021470314704147051470614707147081470914710147111471214713147141471514716147171471814719147201472114722147231472414725147261472714728147291473014731147321473314734147351473614737147381473914740147411474214743147441474514746147471474814749147501475114752147531475414755147561475714758147591476014761147621476314764147651476614767147681476914770147711477214773147741477514776147771477814779147801478114782147831478414785147861478714788147891479014791147921479314794147951479614797147981479914800148011480214803148041480514806148071480814809148101481114812148131481414815148161481714818148191482014821148221482314824148251482614827148281482914830148311483214833148341483514836148371483814839148401484114842148431484414845148461484714848148491485014851148521485314854148551485614857148581485914860148611486214863148641486514866148671486814869148701487114872148731487414875
  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. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. BasePointerTypeSize = 5;
  63. BaseArrayTypeSize = BasePointerTypeSize + 3;
  64. LengthOffset = BasePointerTypeSize + 0;
  65. DataOffset = BasePointerTypeSize + 1;
  66. DescriptorOffset = BasePointerTypeSize + 2;
  67. BaseRecordTypeSize = BasePointerTypeSize + 2;
  68. ActionOffset = BasePointerTypeSize + 0;
  69. MonitorOffset = BasePointerTypeSize + 1;
  70. BaseObjectTypeSize = BaseRecordTypeSize;
  71. ActionTypeSize = 3;
  72. MonitorTypeSize = 7;
  73. ProcessorOffset = BaseObjectTypeSize + 1;
  74. StackLimitOffset* = BaseObjectTypeSize + 3;
  75. QuantumOffset = BaseObjectTypeSize + 4;
  76. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  77. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  78. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  79. Size2Flag = 4; (* size = 2 *)
  80. Size3Flag = 5; (* size = 3 *)
  81. Size4Flag = 6; (* size = 4 *)
  82. Size5Flag = 7; (* size = 5 *)
  83. Size6Flag = 8; (* size = 6 *)
  84. Size7Flag = 9; (* size = 7 *)
  85. Size8Flag = 10; (* size = 8 *)
  86. ReflectionSupport = TRUE;
  87. (* 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:
  88. 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
  89. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  90. *)
  91. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  92. ProtectModulesPointers = FALSE;
  93. CreateProcedureDescInfo = TRUE;
  94. WarningDynamicLoading = FALSE;
  95. SysvABI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention};
  97. TYPE
  98. Position=SyntaxTree.Position;
  99. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  100. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. END;
  108. Fixup= POINTER TO RECORD
  109. pc: LONGINT;
  110. nextFixup: Fixup;
  111. END;
  112. WriteBackCall = POINTER TO RECORD
  113. call: SyntaxTree.ProcedureCallDesignator;
  114. next: WriteBackCall;
  115. END;
  116. Label= OBJECT
  117. VAR
  118. fixups: Fixup;
  119. section: IntermediateCode.Section;
  120. pc: LONGINT;
  121. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  122. BEGIN
  123. SELF.section := section; pc := -1;
  124. END InitLabel;
  125. PROCEDURE Resolve(pc: LONGINT);
  126. VAR at: LONGINT;
  127. BEGIN
  128. SELF.pc := pc;
  129. WHILE(fixups # NIL) DO
  130. at := fixups.pc;
  131. section.PatchAddress(at,pc);
  132. fixups := fixups.nextFixup;
  133. END;
  134. END Resolve;
  135. PROCEDURE AddFixup(at: LONGINT);
  136. VAR fixup: Fixup;
  137. BEGIN
  138. ASSERT(pc=-1);
  139. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  140. END AddFixup;
  141. END Label;
  142. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  143. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  144. VAR
  145. backend: IntermediateBackend;
  146. implementationVisitor: ImplementationVisitor;
  147. meta: MetaDataGenerator;
  148. system: Global.System;
  149. currentScope: SyntaxTree.Scope;
  150. module: Sections.Module;
  151. moduleSelf: SyntaxTree.Variable;
  152. dump: BOOLEAN;
  153. forceModuleBody: BOOLEAN;
  154. addressType: IntermediateCode.Type;
  155. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  156. BEGIN
  157. currentScope := NIL; module := NIL; moduleSelf := NIL;
  158. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  159. SELF.dump := dump;
  160. SELF.backend := backend;
  161. SELF.forceModuleBody := forceModuleBody;
  162. addressType := IntermediateCode.GetType(system,system.addressType)
  163. END Init;
  164. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  165. BEGIN
  166. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. x.Accept(SELF);
  171. END Type;
  172. (** types **)
  173. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  174. BEGIN (* no code emission *) END VisitBasicType;
  175. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  176. BEGIN (* no code emission *) END VisitCharacterType;
  177. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  178. BEGIN (* no code emission *) END VisitIntegerType;
  179. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  180. BEGIN (* no code emission *) END VisitFloatType;
  181. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  182. BEGIN (* no code emission *) END VisitComplexType;
  183. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  184. VAR type: SyntaxTree.Type;
  185. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  186. type := x.resolved;
  187. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  188. meta.CheckTypeDeclaration(type);
  189. END;
  190. END VisitQualifiedType;
  191. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  192. BEGIN (* no code emission *) END VisitStringType;
  193. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  194. BEGIN (* no code emission *)
  195. END VisitArrayRangeType;
  196. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  197. BEGIN (* no code emission *) END VisitArrayType;
  198. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  199. BEGIN (* no code emission *) END VisitPortType;
  200. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  201. BEGIN
  202. meta.CheckTypeDeclaration(x);
  203. END VisitMathArrayType;
  204. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  205. BEGIN
  206. meta.CheckTypeDeclaration(x);
  207. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  208. END VisitPointerType;
  209. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  210. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  211. BEGIN (* no code emission *)
  212. meta.CheckTypeDeclaration(x);
  213. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  214. IF x.pointerType.typeDeclaration # NIL THEN
  215. td := x.pointerType.typeDeclaration
  216. ELSE
  217. td := x.typeDeclaration
  218. END;
  219. Global.GetSymbolName(td,name);
  220. (* code section for object *)
  221. END;
  222. Scope(x.recordScope);
  223. END VisitRecordType;
  224. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  225. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  226. BEGIN
  227. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  228. WHILE (this # NIL) & (this.identifier# id) DO
  229. this := this.nextModifier;
  230. END;
  231. RETURN this # NIL
  232. END HasFlag;
  233. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  234. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  235. BEGIN
  236. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  237. capabilities := {};
  238. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  239. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  240. backend.SetCapabilities(capabilities);
  241. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  242. Scope(x.cellScope);
  243. END;
  244. END VisitCellType;
  245. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  246. BEGIN (* no code emission *) END VisitProcedureType;
  247. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  248. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  249. END VisitEnumerationType;
  250. (* symbols *)
  251. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  252. BEGIN
  253. Procedure(x);
  254. END VisitProcedure;
  255. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  256. BEGIN
  257. Procedure(x);
  258. END VisitOperator;
  259. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  260. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  261. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  262. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  263. BEGIN
  264. type := type.resolved;
  265. IF type IS SyntaxTree.RecordType THEN
  266. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  269. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  270. END;
  271. ELSIF type IS SyntaxTree.MathArrayType THEN
  272. WITH type: SyntaxTree.MathArrayType DO
  273. IF type.form = SyntaxTree.Open THEN
  274. RETURN TRUE
  275. ELSIF type.form = SyntaxTree.Static THEN
  276. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  277. END;
  278. END;
  279. END;
  280. RETURN FALSE
  281. END TypeNeedsInitialization;
  282. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  283. VAR variable: SyntaxTree.Variable;
  284. BEGIN
  285. variable := scope.firstVariable;
  286. WHILE variable # NIL DO
  287. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  288. IF variable.initializer # NIL THEN RETURN TRUE END;
  289. variable := variable.nextVariable;
  290. END;
  291. RETURN FALSE
  292. END ScopeNeedsInitialization;
  293. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  294. VAR size: LONGINT;
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. IF TypeNeedsInitialization(baseType) THEN
  325. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  326. FOR i := 0 TO type.staticLength-1 DO
  327. Initialize(baseType,NIL,offset+i*size);
  328. END;
  329. END;
  330. END;
  331. | type: SyntaxTree.MathArrayType DO
  332. IF type.form = SyntaxTree.Open THEN
  333. dim := DynamicDim(type);
  334. baseType := SemanticChecker.ArrayBase(type,dim);
  335. imm := IntermediateCode.Immediate(addressType,dim);
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  337. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  338. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  339. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  340. (* flags remain empty (=0) for open array *)
  341. ELSIF type.form = SyntaxTree.Static THEN
  342. baseType := type.arrayBase;
  343. IF TypeNeedsInitialization(baseType) THEN
  344. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  345. ASSERT(type.staticLength < 1024*1024*1024);
  346. FOR i := 0 TO type.staticLength-1 DO
  347. Initialize(baseType,NIL,offset+i*size);
  348. END;
  349. END;
  350. END;
  351. ELSE
  352. IF initializer # NIL THEN
  353. implementationVisitor.Evaluate(initializer, op);
  354. SingleInitialize(op.op, offset);
  355. END;
  356. END;
  357. END Initialize;
  358. BEGIN
  359. IF x.externalName # NIL THEN RETURN END;
  360. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  361. (* code section for variable *)
  362. Global.GetSymbolSegmentedName(x,name);
  363. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  364. irv.SetExported(IsExported(x));
  365. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  366. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  369. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  370. FOR i := 0 TO DynamicDim(x.type)-1 DO
  371. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  372. END;
  373. ELSE
  374. lastUpdated:= 0;
  375. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  376. Initialize(x.type, x.initializer, 0);
  377. END;
  378. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  379. IF size > 0 THEN
  380. irv.Emit(Reserve(x.position,size));
  381. END;
  382. IF ~x.fixed THEN
  383. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  384. ELSE
  385. align := x.alignment;
  386. END;
  387. irv.SetPositionOrAlignment(x.fixed, align);
  388. meta.CheckTypeDeclaration(x.type);
  389. END;
  390. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  391. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  392. END;
  393. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  394. END VisitVariable;
  395. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  396. BEGIN
  397. VisitVariable(x)
  398. END VisitProperty;
  399. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  400. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  401. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  402. BEGIN
  403. ASSERT(currentScope IS SyntaxTree.CellScope);
  404. Global.GetSymbolSegmentedName(x,name);
  405. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  406. irv.SetExported(IsExported(x));
  407. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  408. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  411. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  412. FOR i := 0 TO DynamicDim(x.type)-1 DO
  413. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  414. END;
  415. ELSE
  416. lastUpdated:= 0;
  417. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  418. IF size > 0 THEN
  419. irv.Emit(Reserve(x.position,size));
  420. END;
  421. IF ~x.fixed THEN
  422. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  423. ELSE
  424. align := x.alignment;
  425. END;
  426. irv.SetPositionOrAlignment(x.fixed, align);
  427. meta.CheckTypeDeclaration(x.type);
  428. END;
  429. END VisitParameter;
  430. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  431. BEGIN
  432. Type(x.declaredType); (* => code in objects *)
  433. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  434. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  435. END;
  436. END VisitTypeDeclaration;
  437. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  438. BEGIN
  439. IF (SyntaxTree.Public * x.access # {}) THEN
  440. implementationVisitor.VisitConstant(x);
  441. END;
  442. END VisitConstant;
  443. PROCEDURE Scope(x: SyntaxTree.Scope);
  444. VAR procedure: SyntaxTree.Procedure;
  445. constant: SyntaxTree.Constant;
  446. variable: SyntaxTree.Variable;
  447. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  448. cell: SyntaxTree.CellType;
  449. parameter: SyntaxTree.Parameter;
  450. property: SyntaxTree.Property;
  451. BEGIN
  452. prevScope := currentScope;
  453. currentScope := x;
  454. (* constants treated in implementation visitor *)
  455. WITH x: SyntaxTree.CellScope DO
  456. cell := x.ownerCell;
  457. parameter := cell.firstParameter;
  458. WHILE parameter # NIL DO
  459. VisitParameter(parameter);
  460. parameter := parameter.nextParameter;
  461. END;
  462. property := cell.firstProperty;
  463. WHILE property # NIL DO
  464. VisitProperty(property);
  465. property := property.nextProperty;
  466. END;
  467. ELSE
  468. END;
  469. typeDeclaration := x.firstTypeDeclaration;
  470. WHILE typeDeclaration # NIL DO
  471. VisitTypeDeclaration(typeDeclaration);
  472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  473. END;
  474. variable := x.firstVariable;
  475. WHILE variable # NIL DO
  476. VisitVariable(variable);
  477. variable := variable.nextVariable;
  478. END;
  479. procedure := x.firstProcedure;
  480. WHILE procedure # NIL DO
  481. VisitProcedure(procedure);
  482. procedure := procedure.nextProcedure;
  483. END;
  484. constant := x.firstConstant;
  485. WHILE constant # NIL DO
  486. VisitConstant(constant);
  487. constant := constant.nextConstant;
  488. END;
  489. currentScope := prevScope;
  490. END Scope;
  491. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  492. VAR parameter: SyntaxTree.Parameter;
  493. BEGIN
  494. parameter := first;
  495. WHILE parameter # NIL DO
  496. VisitParameter(parameter);
  497. parameter := parameter.nextParameter;
  498. END;
  499. END Parameters;
  500. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  501. VAR scope: SyntaxTree.ProcedureScope;
  502. prevScope: SyntaxTree.Scope;
  503. inline, finalizer: BOOLEAN;
  504. procedureType: SyntaxTree.ProcedureType;
  505. pc: LONGINT;
  506. memorySize: Basic.Integer; stackSize: LONGINT;
  507. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  508. null,size,src,dest,fp,res: IntermediateCode.Operand;
  509. callingConvention: LONGINT;
  510. cellType: SyntaxTree.CellType;
  511. registerNumber: LONGINT;
  512. registerParameters: SIZE;
  513. registerClass: IntermediateCode.RegisterClass;
  514. type: IntermediateCode.Type;
  515. formalParameter: SyntaxTree.Parameter;
  516. recordType: SyntaxTree.RecordType;
  517. isModuleBody: BOOLEAN;
  518. parametersSize: LONGINT;
  519. position: LONGINT;
  520. variable: SyntaxTree.Variable;
  521. PROCEDURE Signature;
  522. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  523. BEGIN
  524. procedureType := x.type(SyntaxTree.ProcedureType);
  525. returnType := procedureType.returnType;
  526. IF returnType # NIL THEN
  527. meta.CheckTypeDeclaration(returnType)
  528. END;
  529. parameter := procedureType.firstParameter;
  530. WHILE parameter # NIL DO
  531. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  532. parameter := parameter.nextParameter;
  533. END;
  534. END Signature;
  535. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  536. VAR result: BOOLEAN;
  537. BEGIN
  538. result := FALSE;
  539. IF x = SyntaxTree.invalidExpression THEN
  540. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  541. result := TRUE;
  542. value := x.resolved(SyntaxTree.IntegerValue).value;
  543. ELSE
  544. Error(x.position,"expression is not an integer constant");
  545. END;
  546. RETURN result;
  547. END CheckIntegerValue;
  548. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  549. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  550. BEGIN
  551. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  552. WHILE (this # NIL) & (this.identifier # id) DO
  553. this := this.nextModifier;
  554. END;
  555. IF this # NIL THEN
  556. IF this.expression = NIL THEN
  557. Error(this.position,"expected expression value");
  558. ELSIF CheckIntegerValue(this.expression,value) THEN
  559. END;
  560. RETURN TRUE
  561. ELSE RETURN FALSE
  562. END;
  563. END HasValue;
  564. CONST DefaultDataMemorySize=512;
  565. BEGIN
  566. IF x.externalName # NIL THEN RETURN END;
  567. (*
  568. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  569. *)
  570. (* code section for this procedure *)
  571. position := x.position.start;
  572. scope := x.procedureScope;
  573. prevScope := currentScope;
  574. currentScope := scope;
  575. procedureType := x.type(SyntaxTree.ProcedureType);
  576. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  577. implementationVisitor.temporaries.Clear;
  578. implementationVisitor.usedRegisters := NIL;
  579. implementationVisitor.registerUsageCount.Init;
  580. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  581. IF (scope.body # NIL) & (x.isInline) THEN
  582. inline := TRUE;
  583. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  584. ir.SetExported(IsExported(x));
  585. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  586. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  587. IF backend.cellsAreObjects THEN
  588. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  589. ir.SetExported(IsExported(x));
  590. ELSE
  591. RETURN; (* cellnet cannot be compiled for final static hardware *)
  592. END;
  593. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  594. inline := FALSE;
  595. AddBodyCallStub(x);
  596. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  597. ir.SetExported(IsExported(x));
  598. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  599. inline := FALSE;
  600. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  601. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  602. AddBodyCallStub(x);
  603. AddStackAllocation(x,memorySize);
  604. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  605. ir.SetExported(IsExported(x));
  606. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  607. inline := FALSE;
  608. Parameters(procedureType.firstParameter);
  609. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  610. ir.SetExported(IsExported(x));
  611. ELSE
  612. inline := FALSE;
  613. IF x.isEntry OR x.isExit THEN
  614. IF x.isEntry THEN
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  616. ELSE
  617. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  618. END;
  619. ir.SetExported(TRUE);
  620. ELSE
  621. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  622. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  623. END;
  624. END;
  625. callingConvention := procedureType.callingConvention;
  626. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  627. parametersSize := ProcedureParametersSize(backend.system,x);
  628. ELSE
  629. parametersSize := 0;
  630. END;
  631. IF scope.body # NIL THEN
  632. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  633. registerNumber := 0;
  634. IF ~inline THEN
  635. IF scope.lastVariable = NIL THEN
  636. stackSize := 0
  637. ELSE
  638. stackSize := scope.lastVariable.offsetInBits;
  639. IF stackSize <0 THEN stackSize := -stackSize END;
  640. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  641. END;
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  644. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  645. *)
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  650. registerParameters := backend.NumberParameterRegisters(callingConvention);
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  654. IF ~PassInRegister(formalParameter, callingConvention) THEN
  655. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  656. ELSE
  657. IF formalParameter.type.IsRecordType() THEN
  658. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  659. type := addressType;
  660. ELSE
  661. type := GetType(system, formalParameter.type);
  662. END;
  663. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  664. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  665. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  666. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  667. implementationVisitor.ReleaseIntermediateOperand(src);
  668. INC(registerNumber);
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. END;
  673. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  674. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize),registerNumber);
  675. END;
  676. pc := ir.pc-1;
  677. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  678. registerParameters := backend.NumberParameterRegisters(callingConvention);
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  682. IF ~PassInRegister(formalParameter, callingConvention) THEN
  683. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  684. ELSE
  685. IF formalParameter.type.IsRecordType() THEN
  686. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  687. type := addressType;
  688. ELSE
  689. type := GetType(system, formalParameter.type);
  690. END;
  691. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  692. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  693. implementationVisitor.currentScope := currentScope;
  694. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  695. formalParameter.SetOffset(variable.offsetInBits);
  696. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  697. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  698. implementationVisitor.ReleaseIntermediateOperand(src);
  699. INC(registerNumber);
  700. formalParameter := formalParameter.nextParameter;
  701. END;
  702. END;
  703. END;
  704. END;
  705. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  706. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  707. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  708. IF scope.lastVariable # NIL THEN
  709. stackSize := scope.lastVariable.offsetInBits;
  710. IF stackSize <0 THEN stackSize := -stackSize END;
  711. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  712. END;
  713. END;
  714. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  715. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  716. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  717. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  718. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  719. ir.EmitAt(pc,Push(size));
  720. implementationVisitor.StaticCallOperand(result,procedure);
  721. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  722. END;
  723. *)
  724. END;
  725. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  726. IF stackSize > 0 THEN
  727. IF (stackSize MOD system.addressSize = 0) THEN
  728. null := IntermediateCode.Immediate(addressType,0);
  729. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  730. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  731. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  732. ELSE
  733. null := IntermediateCode.Immediate(int8,0);
  734. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  735. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  736. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  737. END;
  738. (*! should potentially be called by backend -- enter might initialize
  739. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  740. *)
  741. END;
  742. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  743. parametersSize := ProcedureParametersSize(backend.system,x);
  744. ELSE
  745. parametersSize := 0;
  746. END;
  747. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  748. finalizer := FALSE;
  749. IF backend.cooperative & x.isFinalizer THEN
  750. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  751. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  752. GetRecordTypeName(recordType,name);
  753. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  754. END;
  755. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  756. IF backend.cooperative THEN
  757. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  758. IF implementationVisitor.profile & ~isModuleBody THEN
  759. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  760. END;
  761. ELSE
  762. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  763. END;
  764. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  765. IF finalizer THEN
  766. IF backend.hasLinkRegister THEN
  767. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  768. END;
  769. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  770. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  771. ir.Emit(Br(x.position,dest));
  772. ELSE
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  774. END;
  775. ELSE
  776. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  777. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  778. END;
  779. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  780. IF backend.cooperative THEN
  781. IF HasPointers (scope) THEN
  782. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  783. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  784. ir.Emit(Result(x.position, res));
  785. ir.Emit(Push(x.position, res));
  786. implementationVisitor.ResetVariables(scope);
  787. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  788. ir.Emit(Pop(x.position, res));
  789. ir.Emit(Return(x.position, res));
  790. ELSE
  791. implementationVisitor.ResetVariables(scope);
  792. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  793. END;
  794. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  795. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  796. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  797. ir.Emit(Result(x.position, res));
  798. ir.Emit(Push(x.position, res));
  799. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  800. ir.Emit(Pop(x.position, res));
  801. ir.Emit(Return(x.position, res));
  802. ELSE
  803. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  804. END;
  805. END;
  806. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  807. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  808. ELSE
  809. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  810. ir.Emit(Nop(x.position));
  811. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  812. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  813. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  814. END;
  815. END;
  816. END
  817. END;
  818. ELSE (* force body for procedures *)
  819. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0,0);
  820. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  821. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  822. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  823. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  824. END;
  825. Scope(scope);
  826. Signature;
  827. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  828. currentScope := prevScope;
  829. END Procedure;
  830. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  831. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  832. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  833. BEGIN
  834. ASSERT (bodyProcedure # NIL);
  835. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  836. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  837. procedure.SetScope(bodyProcedure.scope);
  838. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  839. procedure.SetAccess(SyntaxTree.Hidden);
  840. Global.GetSymbolSegmentedName (procedure,name);
  841. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  842. ir.SetExported(TRUE);
  843. Global.GetSymbolSegmentedName (bodyProcedure,name);
  844. IF ~meta.simple THEN
  845. implementationVisitor.currentScope := module.module.moduleScope;
  846. implementationVisitor.section := ir;
  847. implementationVisitor.PushSelfPointer();
  848. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  849. ELSIF backend.preregisterStatic THEN
  850. implementationVisitor.currentScope := module.module.moduleScope;
  851. implementationVisitor.section := ir;
  852. implementationVisitor.PushSelfPointer();
  853. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  854. ELSE
  855. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  856. ir.Emit(Call(bodyProcedure.position,op, 0));
  857. END;
  858. END AddBodyCallStub;
  859. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  860. VAR name: Basic.SegmentedName;
  861. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  862. BEGIN
  863. Global.GetSymbolSegmentedName (symbol,name);
  864. Basic.RemoveSuffix(name);
  865. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  866. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  867. ir.SetExported(TRUE);
  868. IntermediateCode.InitImmediate(op,addressType,initStack);
  869. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  870. END AddStackAllocation;
  871. (** entry function to visit a complete module *)
  872. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  873. VAR
  874. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  875. hasDynamicOperatorDeclarations: BOOLEAN;
  876. operator: SyntaxTree.Operator;
  877. import: SyntaxTree.Import;
  878. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  879. BEGIN
  880. type := type.resolved;
  881. IF type IS SyntaxTree.RecordType THEN
  882. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  883. ELSIF (type IS SyntaxTree.ArrayType) THEN
  884. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  885. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  886. END;
  887. ELSIF type IS SyntaxTree.MathArrayType THEN
  888. WITH type: SyntaxTree.MathArrayType DO
  889. IF type.form = SyntaxTree.Open THEN
  890. RETURN TRUE
  891. ELSIF type.form = SyntaxTree.Static THEN
  892. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  893. END;
  894. END;
  895. END;
  896. RETURN FALSE
  897. END TypeNeedsInitialization;
  898. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  899. VAR variable: SyntaxTree.Variable;
  900. BEGIN
  901. variable := scope.firstVariable;
  902. WHILE variable # NIL DO
  903. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  904. IF variable.initializer # NIL THEN RETURN TRUE END;
  905. variable := variable.nextVariable;
  906. END;
  907. RETURN FALSE
  908. END ScopeNeedsInitialization;
  909. BEGIN
  910. ASSERT(x # NIL); ASSERT(module # NIL);
  911. SELF.module := module;
  912. (* add import names to the generated Sections.Module *)
  913. import := x.moduleScope.firstImport;
  914. WHILE import # NIL DO
  915. import.module.GetName(idstr);
  916. module.imports.AddName(idstr);
  917. import := import.nextImport
  918. END;
  919. implementationVisitor.module := module;
  920. implementationVisitor.moduleScope := x.moduleScope;
  921. implementationVisitor.moduleSelf := moduleSelf;
  922. implementationVisitor.canBeLoaded := TRUE;
  923. meta.SetModule(module);
  924. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  925. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  926. END;
  927. IF backend.profile THEN
  928. EnsureBodyProcedure(x.moduleScope);
  929. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  930. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  931. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  932. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  933. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  934. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  935. Global.GetModuleName(module.module,idstr);
  936. implementationVisitor.ProfilerAddModule(idstr);
  937. implementationVisitor.numberProcedures := 0;
  938. END;
  939. implementationVisitor.profile := backend.profile;
  940. (* check if there is at least one dynamic operator locally defined *)
  941. hasDynamicOperatorDeclarations := FALSE;
  942. operator := x.moduleScope.firstOperator;
  943. WHILE operator # NIL DO
  944. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  945. operator := operator.nextOperator
  946. END;
  947. (* add operator initialization code section *)
  948. IF hasDynamicOperatorDeclarations THEN
  949. EnsureBodyProcedure(x.moduleScope);
  950. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  951. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  952. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  953. END;
  954. Scope(x.moduleScope);
  955. IF hasDynamicOperatorDeclarations THEN
  956. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  957. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  958. END;
  959. IF backend.profile THEN
  960. implementationVisitor.ProfilerPatchInit;
  961. END;
  962. END Module;
  963. END DeclarationVisitor;
  964. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  965. RegisterUsageCount*=OBJECT
  966. VAR used: UsedArray; count: LONGINT;
  967. PROCEDURE &Init;
  968. VAR i: LONGINT;
  969. BEGIN
  970. count := 0;
  971. IF used = NIL THEN NEW(used,64); END;
  972. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  973. END Init;
  974. PROCEDURE Grow;
  975. VAR new: UsedArray; size,i: LONGINT;
  976. BEGIN
  977. size := LEN(used)*2;
  978. NEW(new,size);
  979. FOR i := 0 TO LEN(used)-1 DO
  980. new[i].count := used[i].count;
  981. new[i].type := used[i].type;
  982. new[i].map := used[i].map
  983. END;
  984. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  985. used := new
  986. END Grow;
  987. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  988. BEGIN
  989. INC(count);
  990. IF count = LEN(used) THEN Grow END;
  991. used[count].type := type;
  992. used[count].class := class;
  993. used[count].map := count;
  994. RETURN count;
  995. END Next;
  996. PROCEDURE IncUse(register: LONGINT);
  997. BEGIN
  998. INC(used[register].count);
  999. (*
  1000. IF (register = 1) & (count > 30) THEN
  1001. D.TraceBack;
  1002. END;
  1003. *)
  1004. END IncUse;
  1005. PROCEDURE DecUse(register: LONGINT);
  1006. BEGIN
  1007. DEC(used[register].count);
  1008. END DecUse;
  1009. PROCEDURE Map(register: LONGINT): LONGINT;
  1010. VAR map : LONGINT;
  1011. BEGIN
  1012. IF register > 0 THEN
  1013. map := used[register].map;
  1014. WHILE register # map DO register := map; map := used[register].map END;
  1015. END;
  1016. RETURN register
  1017. END Map;
  1018. PROCEDURE Use(register: LONGINT): LONGINT;
  1019. BEGIN
  1020. IF register< LEN(used) THEN
  1021. RETURN used[register].count
  1022. ELSE
  1023. RETURN 0
  1024. END
  1025. END Use;
  1026. END RegisterUsageCount;
  1027. RegisterEntry = POINTER TO RECORD
  1028. prev,next: RegisterEntry;
  1029. register: LONGINT;
  1030. registerClass: IntermediateCode.RegisterClass;
  1031. type: IntermediateCode.Type;
  1032. END;
  1033. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1034. Variables = OBJECT (Basic.List)
  1035. VAR
  1036. inUse: VariableUse;
  1037. registerIndex: LONGINT;
  1038. nameIndex: LONGINT;
  1039. PROCEDURE & Init;
  1040. VAR i: LONGINT;
  1041. BEGIN
  1042. InitList(16);
  1043. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1044. registerIndex := 1024;
  1045. nameIndex := 0;
  1046. END Init;
  1047. PROCEDURE Clear*;
  1048. VAR i: LONGINT;
  1049. BEGIN
  1050. Clear^;
  1051. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1052. registerIndex := 1024;
  1053. nameIndex := 0;
  1054. END Clear;
  1055. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1056. VAR string: SyntaxTree.IdentifierString ;
  1057. BEGIN
  1058. COPY("@hiddenIRVar",string);
  1059. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1060. RETURN SyntaxTree.NewIdentifier(string);
  1061. END GetUID;
  1062. PROCEDURE GetUsage(VAR use: VariableUse);
  1063. BEGIN
  1064. use := inUse;
  1065. END GetUsage;
  1066. PROCEDURE SetUsage(CONST use: VariableUse);
  1067. BEGIN
  1068. inUse := use;
  1069. END SetUsage;
  1070. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1071. VAR any: ANY;
  1072. BEGIN
  1073. any := Get(i);
  1074. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1075. END GetVariable;
  1076. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1077. BEGIN
  1078. Set(pos, v);
  1079. END SetVariable;
  1080. PROCEDURE Occupy(pos: LONGINT);
  1081. BEGIN
  1082. INCL(inUse[pos DIV 32], pos MOD 32);
  1083. END Occupy;
  1084. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1085. BEGIN
  1086. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1087. END Occupied;
  1088. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1089. BEGIN
  1090. Occupy(Length());
  1091. Add(v);
  1092. END AddVariable;
  1093. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1094. BEGIN
  1095. t1 := t1.resolved;
  1096. t2 := t2.resolved;
  1097. (*RETURN t1.SameType(t2); *)
  1098. RETURN
  1099. (t1.SameType(t2))
  1100. OR
  1101. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1102. OR
  1103. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1104. OR
  1105. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1106. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1107. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1108. OR
  1109. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1110. (DynamicDim(t1) = DynamicDim(t2))
  1111. );
  1112. END CompatibleType;
  1113. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1114. VAR var : SyntaxTree.Variable; i: LONGINT;
  1115. BEGIN
  1116. pos := Length();
  1117. FOR i := 0 TO pos-1 DO
  1118. IF ~(Occupied(i)) THEN
  1119. var := GetVariable(i);
  1120. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1121. pos := i;
  1122. Occupy(i);
  1123. RETURN var;
  1124. END;
  1125. END;
  1126. END;
  1127. RETURN NIL
  1128. END GetFreeVariable;
  1129. END Variables;
  1130. SymbolMap = POINTER TO RECORD
  1131. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1132. isAddress: BOOLEAN;
  1133. END;
  1134. SymbolMapper = OBJECT
  1135. VAR
  1136. first: SymbolMap;
  1137. PROCEDURE & Init;
  1138. BEGIN
  1139. first := NIL;
  1140. END Init;
  1141. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1142. VAR new: SymbolMap;
  1143. BEGIN
  1144. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1145. new.next := first; first := new;
  1146. END Add;
  1147. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1148. VAR s: SymbolMap;
  1149. BEGIN
  1150. s := first;
  1151. WHILE (s # NIL) & (s.this # this) DO
  1152. s := s.next
  1153. END;
  1154. RETURN s
  1155. END Get;
  1156. END SymbolMapper;
  1157. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1158. VAR
  1159. system: Global.System;
  1160. section: IntermediateCode.Section;
  1161. module: Sections.Module;
  1162. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1163. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1164. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1165. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1166. checker: SemanticChecker.Checker;
  1167. backend: IntermediateBackend;
  1168. meta: MetaDataGenerator;
  1169. position: Position;
  1170. moduleSelf: SyntaxTree.Variable;
  1171. (* variables for hand over of variables / temporary state *)
  1172. currentScope: SyntaxTree.Scope;
  1173. constantDeclaration : SyntaxTree.Symbol;
  1174. result: Operand; (* result of the most recent expression / statement *)
  1175. destination: IntermediateCode.Operand;
  1176. arrayDestinationTag: IntermediateCode.Operand;
  1177. arrayDestinationDimension:LONGINT;
  1178. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1179. conditional: BOOLEAN;
  1180. trueLabel, falseLabel, exitLabel: Label;
  1181. locked: BOOLEAN;
  1182. (*
  1183. usedRegisters: Registers;
  1184. *)
  1185. registerUsageCount: RegisterUsageCount;
  1186. usedRegisters: RegisterEntry;
  1187. (* useful operands and types *)
  1188. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1189. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1190. commentPrintout: Printout.Printer;
  1191. dump: Streams.Writer;
  1192. tagsAvailable : BOOLEAN;
  1193. supportedInstruction: SupportedInstructionProcedure;
  1194. supportedImmediate: SupportedImmediateProcedure;
  1195. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1196. emitLabels: BOOLEAN;
  1197. builtinsModuleName : SyntaxTree.IdentifierString;
  1198. indexCounter: LONGINT;
  1199. profile: BOOLEAN;
  1200. profileId, profileInit: IntermediateCode.Section;
  1201. profileInitPatchPosition: LONGINT;
  1202. numberProcedures: LONGINT;
  1203. procedureResultDesignator : SyntaxTree.Designator;
  1204. operatorInitializationCodeSection: IntermediateCode.Section;
  1205. fingerPrinter: FingerPrinter.FingerPrinter;
  1206. temporaries: Variables;
  1207. canBeLoaded : BOOLEAN;
  1208. currentIsInline: BOOLEAN;
  1209. currentMapper: SymbolMapper;
  1210. currentInlineExit: Label;
  1211. moduleBodySection: IntermediateCode.Section;
  1212. NeedDescriptor : BOOLEAN;
  1213. cooperativeSwitches: BOOLEAN;
  1214. lastSwitchPC: LONGINT;
  1215. isUnchecked: BOOLEAN;
  1216. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1217. BEGIN
  1218. SELF.system := system;
  1219. SELF.builtinsModuleName := runtime;
  1220. currentScope := NIL;
  1221. hiddenPointerType := NIL;
  1222. delegatePointerType := NIL;
  1223. awaitProcCounter := 0;
  1224. labelId := 0; constId := 0; labelId := 0;
  1225. SELF.checker := checker;
  1226. SELF.backend := backend;
  1227. position := Basic.invalidPosition;
  1228. conditional := FALSE;
  1229. locked := FALSE;
  1230. InitOperand(result,ModeUndefined);
  1231. addressType := IntermediateCode.GetType(system,system.addressType);
  1232. setType := IntermediateCode.GetType(system,system.setType);
  1233. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1234. lenType := IntermediateCode.GetType(system, system.lenType);
  1235. byteType := IntermediateCode.GetType(system, system.byteType);
  1236. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1237. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1238. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1239. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1240. nil := IntermediateCode.Immediate(addressType,0);
  1241. one := IntermediateCode.Immediate(addressType,1);
  1242. IntermediateCode.InitOperand(destination);
  1243. tagsAvailable := TRUE;
  1244. supportedInstruction := supportedInstructionProcedure;
  1245. supportedImmediate := supportedImmediateProcedure;
  1246. inData := FALSE;
  1247. SELF.emitLabels := emitLabels;
  1248. IntermediateCode.InitOperand(arrayDestinationTag);
  1249. bool := IntermediateCode.GetType(system,system.booleanType);
  1250. IntermediateCode.InitImmediate(false,bool,0);
  1251. IntermediateCode.InitImmediate(true,bool,1);
  1252. indexCounter := 0;
  1253. NEW(registerUsageCount);
  1254. usedRegisters := NIL;
  1255. procedureResultDesignator := NIL;
  1256. NEW(fingerPrinter);
  1257. NEW(temporaries);
  1258. currentIsInline := FALSE;
  1259. NeedDescriptor := FALSE;
  1260. isUnchecked := backend.noRuntimeChecks;
  1261. END Init;
  1262. TYPE Context = RECORD
  1263. section: IntermediateCode.Section;
  1264. registerUsageCount: RegisterUsageCount;
  1265. usedRegisters: RegisterEntry;
  1266. temporaries: Variables;
  1267. END;
  1268. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1269. VAR context: Context;
  1270. BEGIN
  1271. context.section := section;
  1272. context.registerUsageCount := registerUsageCount;
  1273. context.usedRegisters := usedRegisters;
  1274. context.temporaries := temporaries;
  1275. section := new;
  1276. NEW(registerUsageCount);
  1277. NEW(temporaries);
  1278. usedRegisters := NIL;
  1279. RETURN context;
  1280. END SwitchContext;
  1281. PROCEDURE ReturnToContext(context: Context);
  1282. BEGIN
  1283. section := context.section;
  1284. registerUsageCount := context.registerUsageCount;
  1285. usedRegisters := context.usedRegisters;
  1286. temporaries := context.temporaries;
  1287. END ReturnToContext;
  1288. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1289. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1290. BEGIN
  1291. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1292. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1293. END;
  1294. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1295. section.SetExported(IsExported(syntaxTreeSymbol));
  1296. RETURN section
  1297. END NewSection;
  1298. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1299. VAR new: LONGINT;
  1300. BEGIN
  1301. new := registerUsageCount.Next(type,class);
  1302. UseRegister(new);
  1303. RETURN new
  1304. END AcquireRegister;
  1305. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1306. VAR
  1307. fingerPrint: SyntaxTree.FingerPrint;
  1308. fingerPrintString: ARRAY 32 OF CHAR;
  1309. BEGIN
  1310. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1311. string := "[";
  1312. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1313. Strings.Append(string, fingerPrintString);
  1314. Strings.Append(string, "]");
  1315. END GetFingerprintString;
  1316. (** get the name for the code section that represens a certain symbol
  1317. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1318. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1319. VAR string: ARRAY 32 OF CHAR;
  1320. BEGIN
  1321. Global.GetSymbolSegmentedName(symbol, name);
  1322. (* if the symbol is an operator, then append the fingerprint to the name *)
  1323. IF symbol IS SyntaxTree.Operator THEN
  1324. GetFingerprintString(symbol, string);
  1325. Basic.AppendToSegmentedName(name,string);
  1326. END
  1327. END GetCodeSectionNameForSymbol;
  1328. (** get the name for the code section that represens a certain symbol
  1329. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1330. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1331. VAR string: ARRAY 32 OF CHAR;
  1332. BEGIN
  1333. Global.GetSymbolNameInScope(symbol, scope, name);
  1334. (* if the symbol is an operator, then append the fingerprint to the name *)
  1335. IF symbol IS SyntaxTree.Operator THEN
  1336. GetFingerprintString(symbol, string);
  1337. Strings.Append(name, string);
  1338. END
  1339. END GetCodeSectionNameForSymbolInScope;
  1340. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1341. BEGIN
  1342. IF dump # NIL THEN
  1343. dump.String("enter "); dump.String(s); dump.Ln;
  1344. END;
  1345. END TraceEnter;
  1346. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1347. BEGIN
  1348. IF dump # NIL THEN
  1349. dump.String("exit "); dump.String(s); dump.Ln;
  1350. END;
  1351. END TraceExit;
  1352. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1353. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1354. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1355. VAR i: LONGINT;
  1356. BEGIN
  1357. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1358. IF op.rule # NIL THEN
  1359. FOR i := 0 TO LEN(op.rule)-1 DO
  1360. CheckRegister(op.rule[i])
  1361. END;
  1362. END;
  1363. END CheckRegister;
  1364. BEGIN
  1365. CheckRegister(instruction.op1);
  1366. CheckRegister(instruction.op2);
  1367. CheckRegister(instruction.op3);
  1368. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1369. ELSE section.Emit(instruction);
  1370. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1371. END;
  1372. END Emit;
  1373. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1374. VAR saved: RegisterEntry;
  1375. BEGIN
  1376. IF backend.cooperative THEN
  1377. ReleaseUsedRegisters(saved);
  1378. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1379. CallThis(position,"Runtime","Trap",1);
  1380. RestoreRegisterUse(saved);
  1381. ELSE
  1382. Emit(Trap(position,trapNo));
  1383. END;
  1384. END EmitTrap;
  1385. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1386. VAR name: Basic.SegmentedName;
  1387. VAR op1, op2, reg: IntermediateCode.Operand;
  1388. VAR call, nocall: Label;
  1389. VAR parametersSize: LONGINT;
  1390. VAR prevSection: IntermediateCode.Section;
  1391. VAR prevDump: Streams.Writer;
  1392. VAR body: SyntaxTree.Body;
  1393. VAR procedureType: SyntaxTree.ProcedureType;
  1394. BEGIN
  1395. IF procedure # NIL THEN
  1396. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1397. ELSE procedureType := NIL;
  1398. END;
  1399. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1400. prevSection := SELF.section;
  1401. SELF.section := section;
  1402. prevDump := dump;
  1403. dump := section.comments;
  1404. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1405. IF backend.hasLinkRegister THEN
  1406. Emit(Push(Basic.invalidPosition, lr));
  1407. END;
  1408. Emit(Push(Basic.invalidPosition,fp));
  1409. IF procedure # NIL THEN
  1410. body := procedure.procedureScope.body;
  1411. ELSE
  1412. body := NIL;
  1413. END;
  1414. IF backend.cooperative THEN
  1415. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1416. GetCodeSectionNameForSymbol(procedure, name);
  1417. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1418. ELSE
  1419. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1420. END;
  1421. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1422. IntermediateCode.AddOffset(op1, 1);
  1423. Emit(Push(Basic.invalidPosition,op1));
  1424. Emit(Mov(Basic.invalidPosition,fp, sp));
  1425. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1426. NEW(call, section);
  1427. NEW(nocall, section);
  1428. reg := NewRegisterOperand(addressType);
  1429. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1430. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1431. BrltL(call, sp, reg);
  1432. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1433. BrgeL(nocall, sp, op2);
  1434. call.Resolve(section.pc);
  1435. Emit(Push(Basic.invalidPosition, reg));
  1436. ReleaseIntermediateOperand(reg);
  1437. parametersSize := ProcParametersSize(procedure);
  1438. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1439. Emit(Push(Basic.invalidPosition, op2));
  1440. CallThis(position, "Activities","ExpandStack",2);
  1441. Emit(Result(Basic.invalidPosition, sp));
  1442. nocall.Resolve(section.pc);
  1443. END;
  1444. ELSE
  1445. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1446. Emit(Push(Basic.invalidPosition, one)) ;
  1447. procedureType.SetParametersOffset(1);
  1448. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1449. END;
  1450. Emit(Mov(Basic.invalidPosition, fp, sp));
  1451. END;
  1452. END;
  1453. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1454. SELF.section := prevSection;
  1455. dump := prevDump;
  1456. END EmitEnter;
  1457. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1458. VAR op1,op2: IntermediateCode.Operand;
  1459. VAR instruction: IntermediateCode.Instruction;
  1460. BEGIN
  1461. IntermediateCode.InitNumber(op1,callconv);
  1462. IntermediateCode.InitNumber(op2,varSize);
  1463. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1464. RETURN instruction
  1465. END Enter;
  1466. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1467. VAR op1: IntermediateCode.Operand;
  1468. VAR instruction: IntermediateCode.Instruction;
  1469. BEGIN
  1470. IntermediateCode.InitNumber(op1,callconv);
  1471. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1472. RETURN instruction
  1473. END Leave;
  1474. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1475. VAR prevSection: IntermediateCode.Section;
  1476. VAR op2, size: IntermediateCode.Operand;
  1477. VAR body: SyntaxTree.Body;
  1478. BEGIN
  1479. prevSection := SELF.section;
  1480. SELF.section := section;
  1481. Emit(Leave(position, callconv));
  1482. IF procedure # NIL THEN
  1483. body := procedure.procedureScope.body;
  1484. ELSE
  1485. body := NIL;
  1486. END;
  1487. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1488. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1489. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1490. Emit(Add(position, sp, fp, op2));
  1491. ELSE
  1492. Emit(Mov(position, sp, fp));
  1493. END;
  1494. Emit(Pop(position, fp));
  1495. END;
  1496. SELF.section := prevSection;
  1497. END EmitLeave;
  1498. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1499. VAR m: SymbolMap;
  1500. BEGIN
  1501. position := x.position;
  1502. IF currentIsInline THEN
  1503. m := currentMapper.Get(x);
  1504. IF m # NIL THEN
  1505. (*
  1506. Printout.Info("mapping from", x);
  1507. Printout.Info("mapping to ", m.to);
  1508. *)
  1509. m.to.Accept(SELF);
  1510. op := result;
  1511. IF m.tag # NIL THEN
  1512. ReleaseIntermediateOperand(result.tag);
  1513. m.tag.Accept(SELF);
  1514. op.tag := result.op;
  1515. ReleaseIntermediateOperand(result.tag);
  1516. END;
  1517. RETURN
  1518. END;
  1519. END;
  1520. x.Accept(SELF);
  1521. op := result;
  1522. END Symbol;
  1523. PROCEDURE Expression(x: SyntaxTree.Expression);
  1524. BEGIN
  1525. position := x.position;
  1526. constantDeclaration := NIL;
  1527. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1528. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1529. END;
  1530. IF x.resolved # NIL THEN
  1531. x.resolved.Accept(SELF)
  1532. ELSE
  1533. x.Accept(SELF)
  1534. END;
  1535. (* check this, was commented out in ActiveCells3 *)
  1536. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1537. Error(x.position, "unsupported modifier");
  1538. END;
  1539. END Expression;
  1540. (*
  1541. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1542. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1543. BEGIN
  1544. temporaries.GetUsage(current);
  1545. FOR i := 0 TO LEN(current)-1 DO
  1546. set := current[i] - previous[i];
  1547. IF set # {} THEN
  1548. FOR j := 0 TO MAX(SET)-1 DO
  1549. IF j IN set THEN
  1550. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1551. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1552. Symbol(variable, op);
  1553. MakeMemory(tmp,op.op,addressType,0);
  1554. ReleaseOperand(op);
  1555. Emit(Mov(position,tmp, nil ) );
  1556. ReleaseIntermediateOperand(tmp);
  1557. END;
  1558. END;
  1559. END;
  1560. END;
  1561. END;
  1562. END ResetUsedTemporaries;
  1563. *)
  1564. PROCEDURE Statement(x: SyntaxTree.Statement);
  1565. VAR use: VariableUse;
  1566. BEGIN
  1567. temporaries.GetUsage(use);
  1568. position := x.position;
  1569. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1570. IF commentPrintout # NIL THEN
  1571. commentPrintout.Statement(x);
  1572. dump.Ln;
  1573. (*dump.Update;*)
  1574. END;
  1575. x.Accept(SELF);
  1576. (*
  1577. CheckRegistersFree();
  1578. *)
  1579. (*ResetUsedTemporaries(use);*)
  1580. temporaries.SetUsage(use);
  1581. END Statement;
  1582. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1583. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1584. *)
  1585. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1586. BEGIN
  1587. ASSERT(op.mode # IntermediateCode.Undefined);
  1588. IF op.mode = IntermediateCode.ModeMemory THEN
  1589. ReuseCopy(res,op);
  1590. ELSE
  1591. res := op;
  1592. UseIntermediateOperand(res);
  1593. END;
  1594. IntermediateCode.AddOffset(res,offset);
  1595. IntermediateCode.MakeMemory(res,type);
  1596. END MakeMemory;
  1597. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1598. VAR mem: IntermediateCode.Operand;
  1599. BEGIN
  1600. MakeMemory(mem,res,type,offset);
  1601. ReleaseIntermediateOperand(res);
  1602. res := mem;
  1603. END ToMemory;
  1604. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1605. VAR mem: IntermediateCode.Operand;
  1606. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1607. componentType: SyntaxTree.Type;
  1608. BEGIN
  1609. type := type.resolved;
  1610. IF operand.mode = ModeReference THEN
  1611. IF type IS SyntaxTree.RangeType THEN
  1612. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1613. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1614. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1615. ReleaseOperand(operand);
  1616. operand.op := firstOp;
  1617. operand.tag := lastOp;
  1618. operand.extra := stepOp;
  1619. ELSIF type IS SyntaxTree.ComplexType THEN
  1620. componentType := type(SyntaxTree.ComplexType).componentType;
  1621. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1622. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1623. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1624. ReleaseOperand(operand);
  1625. operand.op := firstOp;
  1626. operand.tag := lastOp
  1627. ELSE
  1628. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1629. ReleaseIntermediateOperand(operand.op);
  1630. operand.op := mem;
  1631. END;
  1632. operand.mode := ModeValue;
  1633. END;
  1634. ASSERT(operand.mode = ModeValue);
  1635. END LoadValue;
  1636. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1637. VAR prevConditional: BOOLEAN;
  1638. BEGIN
  1639. prevConditional := conditional;
  1640. conditional := FALSE;
  1641. InitOperand(result, ModeUndefined);
  1642. Expression(x);
  1643. op := result;
  1644. LoadValue(op,x.type.resolved);
  1645. conditional := prevConditional;
  1646. END Evaluate;
  1647. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1648. VAR prevConditional: BOOLEAN;
  1649. BEGIN
  1650. prevConditional := conditional;
  1651. conditional := FALSE;
  1652. InitOperand(result,ModeUndefined);
  1653. Expression(x);
  1654. op := result;
  1655. (*
  1656. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1657. *)
  1658. conditional := prevConditional;
  1659. END Designate;
  1660. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1661. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1662. BEGIN
  1663. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1664. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1665. conditional := TRUE;
  1666. trueLabel := trueL; falseLabel := falseL;
  1667. Expression(x);
  1668. trueL := trueLabel; falseL := falseLabel;
  1669. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1670. END Condition;
  1671. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1672. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1673. BEGIN
  1674. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1675. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1676. RETURN op
  1677. END NewRegisterOperand;
  1678. PROCEDURE UnuseRegister(register: LONGINT);
  1679. BEGIN
  1680. IF (register > 0) THEN
  1681. register := registerUsageCount.Map(register);
  1682. registerUsageCount.DecUse(register);
  1683. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1684. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1685. END;
  1686. IF registerUsageCount.Use(register)=0 THEN
  1687. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1688. Warning(position, "register cannot be removed");
  1689. END;
  1690. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1691. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1692. END;
  1693. ELSIF registerUsageCount.Use(register)<0 THEN
  1694. Warning(position, "register removed too often");
  1695. IF dump # NIL THEN
  1696. dump.String("register removed too often"); dump.Ln; dump.Update;
  1697. END;
  1698. END;
  1699. END;
  1700. END UnuseRegister;
  1701. PROCEDURE UseRegister(register: LONGINT);
  1702. BEGIN
  1703. IF (register > 0) THEN
  1704. register := registerUsageCount.Map(register);
  1705. registerUsageCount.IncUse(register);
  1706. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1707. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1708. END;
  1709. IF registerUsageCount.Use(register)=1 THEN
  1710. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1711. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1712. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1713. END;
  1714. END;
  1715. END;
  1716. END UseRegister;
  1717. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1718. BEGIN
  1719. UnuseRegister(op.register)
  1720. END ReleaseIntermediateOperand;
  1721. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1722. BEGIN
  1723. UseRegister(op.register)
  1724. END UseIntermediateOperand;
  1725. PROCEDURE ReleaseOperand(CONST op: Operand);
  1726. BEGIN
  1727. UnuseRegister(op.op.register);
  1728. UnuseRegister(op.tag.register);
  1729. UnuseRegister(op.extra.register);
  1730. END ReleaseOperand;
  1731. (* save registers marked in array "markedRegisters" to the stack
  1732. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1733. *)
  1734. PROCEDURE SaveRegisters();
  1735. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1736. BEGIN
  1737. entry := usedRegisters;
  1738. WHILE entry # NIL DO
  1739. type := registerUsageCount.used[entry.register].type;
  1740. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1741. Emit(Push(position,op));
  1742. entry := entry.next;
  1743. END;
  1744. END SaveRegisters;
  1745. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1746. BEGIN
  1747. saved := usedRegisters;
  1748. usedRegisters := NIL;
  1749. END ReleaseUsedRegisters;
  1750. (** remove parameter registers from used queue *)
  1751. PROCEDURE ReleaseParameterRegisters;
  1752. VAR entry,prev,next: RegisterEntry;
  1753. BEGIN
  1754. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1755. WHILE entry # NIL DO
  1756. next := entry.next;
  1757. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1758. registerUsageCount.DecUse(entry.register);
  1759. ASSERT(registerUsageCount.Use(entry.register)=0);
  1760. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1761. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1762. END;
  1763. ELSIF prev = NIL THEN
  1764. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1765. ELSE
  1766. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1767. END;
  1768. entry := next;
  1769. END;
  1770. END ReleaseParameterRegisters;
  1771. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1772. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1773. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1774. BEGIN
  1775. entry := saved;
  1776. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1777. entry := prev;
  1778. WHILE entry # NIL DO
  1779. prev := entry.prev;
  1780. type := entry.type;
  1781. class := entry.registerClass;
  1782. IntermediateCode.InitRegister(op,type,class,entry.register);
  1783. Emit(Pop(position,op));
  1784. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1785. entry := prev;
  1786. END;
  1787. END RestoreRegisters;
  1788. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  1789. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  1790. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1791. BEGIN
  1792. entry := saved;
  1793. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1794. entry := prev;
  1795. WHILE entry # NIL DO
  1796. prev := entry.prev;
  1797. type := entry.type;
  1798. class := entry.registerClass;
  1799. IntermediateCode.InitRegister(op,type,class,entry.register);
  1800. Emit(Mov(position,op,op));
  1801. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1802. entry := prev;
  1803. END;
  1804. END RestoreRegisterUse;
  1805. PROCEDURE CheckRegistersFree;
  1806. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1807. BEGIN
  1808. IF usedRegisters # NIL THEN
  1809. r := usedRegisters;
  1810. WHILE r # NIL DO
  1811. warning := "register ";
  1812. Strings.AppendInt(warning, r.register);
  1813. Strings.Append(warning, " not released.");
  1814. Warning(position,warning);
  1815. r := r .next;
  1816. END;
  1817. END;
  1818. FOR i := 0 TO registerUsageCount.count-1 DO
  1819. IF registerUsageCount.used[i].count < 0 THEN
  1820. warning := "register ";
  1821. Strings.AppendInt(warning, i);
  1822. Strings.Append(warning, " unused too often.");
  1823. Warning(position,warning);
  1824. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1825. warning := "register ";
  1826. Strings.AppendInt(warning, i);
  1827. Strings.Append(warning, " not unused often enough.");
  1828. Warning(position,warning);
  1829. END;
  1830. END;
  1831. END CheckRegistersFree;
  1832. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1833. Otherwise allocate a new register.
  1834. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1835. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1836. BEGIN
  1837. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1838. UseIntermediateOperand(result);
  1839. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1840. UseIntermediateOperand(result);
  1841. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1842. END;
  1843. END Reuse2;
  1844. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1845. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1846. If not then allocate a new register.
  1847. Does NOT necessarily keep the content of src1 or src2 in result!
  1848. *)
  1849. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1850. BEGIN
  1851. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1852. UseIntermediateOperand(result);
  1853. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1854. UseIntermediateOperand(result);
  1855. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1856. result := alternative; alternative := emptyOperand;
  1857. UseIntermediateOperand(result);
  1858. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1859. END;
  1860. END Reuse2a;
  1861. (* like reuse2 but only one source *)
  1862. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1863. BEGIN
  1864. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1865. UseIntermediateOperand(result);
  1866. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1867. END;
  1868. END Reuse1;
  1869. (* like reuse2a but only one source *)
  1870. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1871. BEGIN
  1872. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1873. UseIntermediateOperand(result);
  1874. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1875. UseIntermediateOperand(result);
  1876. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1877. END;
  1878. END Reuse1a;
  1879. (* like reuse1 but guarantees that content of src1 is in result *)
  1880. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1881. BEGIN
  1882. IF ReusableRegister(src1) THEN
  1883. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1884. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1885. UseIntermediateOperand(result);
  1886. ELSE
  1887. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1888. Emit(Mov(position,result,src1));
  1889. END
  1890. END ReuseCopy;
  1891. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1892. BEGIN
  1893. IF ReusableRegister(src) THEN
  1894. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1895. ELSE
  1896. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1897. Emit(Mov(position,result,src));
  1898. ReleaseIntermediateOperand(src);
  1899. END
  1900. END TransferToRegister;
  1901. (** labels and branches **)
  1902. PROCEDURE NewLabel(): Label;
  1903. VAR label: Label;
  1904. BEGIN
  1905. NEW(label,section); RETURN label;
  1906. END NewLabel;
  1907. PROCEDURE SetLabel(label: Label);
  1908. BEGIN label.Resolve(section.pc);
  1909. END SetLabel;
  1910. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1911. BEGIN
  1912. ASSERT(label # NIL);
  1913. IF label.pc < 0 THEN (* label not yet set *)
  1914. label.AddFixup(section.pc);
  1915. END;
  1916. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1917. END LabelOperand;
  1918. PROCEDURE BrL(label: Label);
  1919. BEGIN
  1920. Emit(Br(position,LabelOperand(label)));
  1921. END BrL;
  1922. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1923. BEGIN
  1924. Emit(Brge(position,LabelOperand(label),left,right));
  1925. END BrgeL;
  1926. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1927. BEGIN
  1928. Emit(Brlt(position,LabelOperand(label),left,right));
  1929. END BrltL;
  1930. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1931. BEGIN
  1932. Emit(Breq(position,LabelOperand(label),left,right));
  1933. END BreqL;
  1934. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1935. BEGIN
  1936. Emit(Brne(position,LabelOperand(label),left,right));
  1937. END BrneL;
  1938. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1939. VAR new: IntermediateCode.Operand;
  1940. BEGIN
  1941. IF Trace THEN TraceEnter("Convert") END;
  1942. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1943. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1944. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1945. & (operand.offset = 0)
  1946. THEN
  1947. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1948. Emit(Conv(position,new,operand));
  1949. ELSE
  1950. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1951. Emit(Conv(position,new,operand));
  1952. ReleaseIntermediateOperand(operand);
  1953. END;
  1954. operand := new;
  1955. 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
  1956. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1957. ELSE
  1958. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1959. Emit(Conv(position,new,operand));
  1960. ReleaseIntermediateOperand(operand);
  1961. operand := new;
  1962. END;
  1963. IF Trace THEN TraceExit("Convert") END;
  1964. END Convert;
  1965. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1966. VAR exit: Label;
  1967. BEGIN
  1968. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1969. exit := NewLabel();
  1970. br(exit,left,right);
  1971. EmitTrap(position,trapNo);
  1972. SetLabel(exit);
  1973. END TrapC;
  1974. (** expressions *)
  1975. (** emit necessary runtime check for set elements **)
  1976. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1977. VAR max: IntermediateCode.Operand;
  1978. BEGIN
  1979. IF isUnchecked THEN RETURN END;
  1980. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1981. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1982. TrapC(BrgeL, max, o, SetElementTrap);
  1983. END;
  1984. END CheckSetElement;
  1985. (** the set that a range represents **)
  1986. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1987. VAR
  1988. operand: Operand;
  1989. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1990. BEGIN
  1991. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1992. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1993. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1994. one := IntermediateCode.Immediate(setType, 1);
  1995. Evaluate(x, operand);
  1996. Convert(operand.op, setType);
  1997. Convert(operand.tag, setType);
  1998. CheckSetElement(operand.op);
  1999. CheckSetElement(operand.tag);
  2000. (* create mask for lower bound
  2001. i.e. shift 11111111 to the left by the value of the lower bound
  2002. *)
  2003. Reuse1(temp, operand.op);
  2004. Emit(Shl(position,temp, allBits, operand.op));
  2005. ReleaseIntermediateOperand(operand.op);
  2006. operand.op := temp;
  2007. (* create mask for upper bound
  2008. i.e. shift 11111111 to the right by the difference between the
  2009. upper bound and the maximum number of set elements
  2010. *)
  2011. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2012. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2013. Reuse1(temp, operand.tag);
  2014. ELSE
  2015. Reuse1(temp, operand.tag);
  2016. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2017. Emit(Sub(position,temp, size, operand.tag));
  2018. END;
  2019. Emit(Shr(position,temp, allBits, operand.tag));
  2020. ReleaseIntermediateOperand(operand.tag);
  2021. operand.tag := temp;
  2022. Reuse2(resultingSet, operand.op, operand.tag);
  2023. (* intersect the two masks *)
  2024. Emit(And(position,resultingSet, operand.op, operand.tag));
  2025. ReleaseOperand(operand);
  2026. RETURN resultingSet
  2027. END SetFromRange;
  2028. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2029. VAR
  2030. res, operand: Operand;
  2031. temp, one, noBits, dest: IntermediateCode.Operand;
  2032. expression: SyntaxTree.Expression;
  2033. i: LONGINT;
  2034. BEGIN
  2035. IF Trace THEN TraceEnter("VisitSet") END;
  2036. dest := destination;
  2037. destination := emptyOperand;
  2038. noBits := IntermediateCode.Immediate(setType, 0);
  2039. one := IntermediateCode.Immediate(setType, 1);
  2040. (* start off with the empty set *)
  2041. InitOperand(res, ModeValue);
  2042. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2043. Emit(Mov(position,res.op, noBits));
  2044. FOR i := 0 TO x.elements.Length() - 1 DO
  2045. expression := x.elements.GetExpression(i);
  2046. IF expression IS SyntaxTree.RangeExpression THEN
  2047. (* range of set elements *)
  2048. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2049. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2050. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2051. ReleaseIntermediateOperand(temp)
  2052. ELSE
  2053. (* singelton element *)
  2054. Evaluate(expression, operand);
  2055. Convert(operand.op, setType);
  2056. CheckSetElement(operand.op);
  2057. (* create subset containing single element *)
  2058. Reuse1(temp, operand.op);
  2059. Emit(Shl(position,temp, one, operand.op));
  2060. ReleaseOperand(operand);
  2061. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2062. ReleaseIntermediateOperand(temp);
  2063. END
  2064. END;
  2065. result := res;
  2066. destination := dest;
  2067. IF Trace THEN TraceExit("VisitSet") END;
  2068. END VisitSet;
  2069. (* math arrays of the form [a,b,c]
  2070. x is a static array and thus does not provide any pointers
  2071. *)
  2072. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2073. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2074. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2075. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2076. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2077. element: SyntaxTree.IntegerValue;
  2078. BEGIN
  2079. numberElements := x.elements.Length();
  2080. expression := index.parameters.GetExpression(dim);
  2081. element := expression(SyntaxTree.IntegerValue);
  2082. FOR i := 0 TO numberElements-1 DO
  2083. expression := x.elements.GetExpression(i);
  2084. element.SetValue(i);
  2085. IF expression IS SyntaxTree.MathArrayExpression THEN
  2086. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2087. ELSE
  2088. Assign(index,expression);
  2089. END;
  2090. END;
  2091. END RecursiveAssignment;
  2092. PROCEDURE Dimension(): LONGINT;
  2093. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2094. BEGIN
  2095. dim := 0;
  2096. expression := x;
  2097. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2098. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2099. INC(dim);
  2100. END;
  2101. RETURN dim;
  2102. END Dimension;
  2103. BEGIN
  2104. (*static math array not providing pointers anyway *)
  2105. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2106. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2107. designator.SetType(variable.type);
  2108. dim := Dimension();
  2109. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2110. FOR i := 0 TO dim-1 DO
  2111. element := SyntaxTree.NewIntegerValue(x.position,0);
  2112. element.SetType(system.longintType);
  2113. index.parameters.AddExpression(element);
  2114. END;
  2115. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2116. RecursiveAssignment(x,0);
  2117. Expression(designator);
  2118. END VisitMathArrayExpression;
  2119. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2120. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2121. BEGIN
  2122. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2123. dest := destination; destination := emptyOperand;
  2124. IF x.operator = Scanner.Not THEN
  2125. IF conditional THEN
  2126. Condition(x.left,falseLabel,trueLabel)
  2127. ELSE
  2128. Evaluate(x.left,operand);
  2129. InitOperand(result,ModeValue);
  2130. Reuse1a(result.op,operand.op,dest);
  2131. Emit(Xor(position,result.op,operand.op,true));
  2132. ReleaseOperand(operand);
  2133. END;
  2134. ELSIF x.operator = Scanner.Minus THEN
  2135. Evaluate(x.left,operand);
  2136. InitOperand(result,ModeValue);
  2137. Reuse1a(result.op,operand.op,dest);
  2138. type := x.left.type.resolved;
  2139. IF type IS SyntaxTree.SetType THEN
  2140. Emit(Not(position,result.op,operand.op));
  2141. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2142. Reuse1(result.tag,operand.tag);
  2143. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2144. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2145. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2146. Emit(Neg(position,result.op,operand.op));
  2147. ELSE HALT(200)
  2148. END;
  2149. ReleaseOperand(operand);
  2150. ELSIF x.operator = Scanner.Address THEN
  2151. Designate(x.left,operand);
  2152. operand.mode := ModeValue;
  2153. t0 := x.left.type.resolved;
  2154. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2155. ReleaseIntermediateOperand(operand.op);
  2156. operand.op := operand.tag;
  2157. IntermediateCode.InitOperand(operand.tag);
  2158. END;
  2159. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2160. result := operand;
  2161. ELSE HALT(100)
  2162. END;
  2163. destination := dest;
  2164. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2165. END VisitUnaryExpression;
  2166. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2167. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2168. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2169. BEGIN
  2170. type := type.resolved;
  2171. originalType := type;
  2172. IF type IS SyntaxTree.PointerType THEN
  2173. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2174. END;
  2175. IF type IS SyntaxTree.ObjectType THEN
  2176. BrL(trueL);
  2177. ELSE
  2178. ASSERT(type IS SyntaxTree.RecordType);
  2179. (*
  2180. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2181. *)
  2182. ReuseCopy(left,tag);
  2183. right := TypeDescriptorAdr(type);
  2184. IF backend.cooperative THEN
  2185. repeatL := NewLabel();
  2186. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2187. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2188. END;
  2189. SetLabel(repeatL);
  2190. BreqL(trueL,left,right);
  2191. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2192. BrneL(repeatL,left,nil);
  2193. ELSIF meta.simple THEN
  2194. level := type(SyntaxTree.RecordType).Level();
  2195. (* get type desc tag of level relative to base tag *)
  2196. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2197. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2198. IntermediateCode.MakeMemory(left,addressType);
  2199. BreqL(trueL,left,right);
  2200. ELSE
  2201. level := type(SyntaxTree.RecordType).Level();
  2202. (* get type desc tag of level relative to base tag *)
  2203. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2204. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2205. IntermediateCode.MakeMemory(left,addressType);
  2206. BreqL(trueL,left,right);
  2207. END;
  2208. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2209. BrL(falseL);
  2210. END;
  2211. END TypeTest;
  2212. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2213. BEGIN
  2214. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2215. IF dump # NIL THEN
  2216. dump.String(s); dump.Ln;
  2217. END;
  2218. END Error;
  2219. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2220. BEGIN
  2221. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2222. IF dump # NIL THEN
  2223. dump.String(s); dump.Ln; dump.Update;
  2224. END;
  2225. END Warning;
  2226. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2227. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2228. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2229. operand:Operand;
  2230. BEGIN
  2231. previousSection := section;
  2232. Global.GetModuleName(mod,name);
  2233. Strings.Append(name,".@Trace");
  2234. Basic.ToSegmentedName(name, pooledName);
  2235. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2236. IF dump # NIL THEN dump := section.comments END;
  2237. IF backend.hasLinkRegister THEN
  2238. Emit(Push(Basic.invalidPosition, lr));
  2239. END;
  2240. variable := mod.moduleScope.firstVariable;
  2241. WHILE variable # NIL DO
  2242. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2243. Symbol(variable, operand);
  2244. register := operand.op;
  2245. CallTraceMethod(register, variable.type);
  2246. ReleaseIntermediateOperand(register);
  2247. END;
  2248. variable := variable.nextVariable;
  2249. END;
  2250. IF backend.hasLinkRegister THEN
  2251. Emit(Pop(Basic.invalidPosition, lr));
  2252. END;
  2253. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2254. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2255. Emit(Br(position,op));
  2256. INC(statCoopTraceModule, section.pc);
  2257. section := previousSection;
  2258. IF dump # NIL THEN dump := section.comments END;
  2259. END CreateTraceModuleMethod;
  2260. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2261. BEGIN
  2262. Emit (Push(position, dst));
  2263. Emit (Push(position, src));
  2264. CallThis(position,"GarbageCollector","Assign", 2);
  2265. END CallAssignPointer;
  2266. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2267. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2268. BEGIN
  2269. IF SemanticChecker.IsPointerType (type) THEN
  2270. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2271. ELSIF type.IsRecordType() THEN
  2272. Emit (Push(position,dst));
  2273. Emit (Push(position,src));
  2274. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2275. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2276. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2277. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2278. ELSIF IsStaticArray(type) THEN
  2279. size := StaticArrayNumElements(type);
  2280. base := StaticArrayBaseType(type);
  2281. IF base.IsRecordType() THEN
  2282. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2283. Emit (Push(position, dst));
  2284. Emit (Push(position, src));
  2285. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2287. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2288. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2289. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2290. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2291. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2292. Emit (Push(position, dst));
  2293. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2294. Emit (Push(position, src));
  2295. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2296. ELSE
  2297. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2298. Emit (Push(position, dst));
  2299. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2300. Emit (Push(position, src));
  2301. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2302. ASSERT(StaticArrayBaseType(type).IsPointer());
  2303. END;
  2304. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2305. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2306. Emit (Push(position, dst));
  2307. Emit (Push(position, src));
  2308. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2309. ELSE HALT(100); (* missing ? *)
  2310. END;
  2311. END CallAssignMethod;
  2312. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2313. VAR name: Basic.SegmentedName;
  2314. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2315. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2316. context: Context;
  2317. BEGIN
  2318. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2319. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2320. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2321. GetRecordTypeName (recordType,name);
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2323. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2324. IF dump # NIL THEN dump := section.comments END;
  2325. IF backend.hasLinkRegister THEN
  2326. Emit(Push(Basic.invalidPosition, lr));
  2327. END;
  2328. variable := recordType.recordScope.firstVariable;
  2329. WHILE variable # NIL DO
  2330. IF variable.NeedsTrace() THEN
  2331. dst := NewRegisterOperand (addressType);
  2332. src := NewRegisterOperand (addressType);
  2333. Emit (Mov(position, dst, parameter1));
  2334. Emit (Mov(position, src, parameter2));
  2335. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2336. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2337. CallAssignMethod(dst, src, variable.type);
  2338. ReleaseIntermediateOperand(src);
  2339. ReleaseIntermediateOperand(dst);
  2340. END;
  2341. variable := variable.nextVariable;
  2342. END;
  2343. recordBase := recordType.GetBaseRecord();
  2344. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2345. IF backend.hasLinkRegister THEN
  2346. Emit(Pop(Basic.invalidPosition, lr));
  2347. END;
  2348. GetRecordTypeName (recordBase,name);
  2349. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2350. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2351. Emit(Br(position,op));
  2352. ELSE
  2353. Emit(Exit(position,0,0, 0));
  2354. END;
  2355. IF ~recordType.isObject THEN
  2356. GetRecordTypeName (recordType,name);
  2357. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2358. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2359. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2360. NEW(registerUsageCount);
  2361. usedRegisters := NIL;
  2362. dst := NewRegisterOperand (addressType);
  2363. src := NewRegisterOperand (addressType);
  2364. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2365. Emit(Mov(position, dst, parameter1));
  2366. Emit(Mov(position, src, parameter2));
  2367. label := NewLabel();
  2368. SetLabel(label);
  2369. Emit(Push(position, dst));
  2370. Emit(Push(position, src));
  2371. GetRecordTypeName (recordType,name);
  2372. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2373. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2374. Emit(Call(position, op, 0));
  2375. Emit(Pop(position, src));
  2376. Emit(Pop(position, dst));
  2377. Emit(Add(position, dst, dst, ofs));
  2378. Emit(Add(position, src, src, ofs));
  2379. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2380. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2381. Emit(Exit(position,0,0, 0));
  2382. END;
  2383. INC(statCoopAssignProcedure, section.pc);
  2384. ReturnToContext(context);
  2385. IF dump # NIL THEN dump := section.comments END;
  2386. END CreateAssignProcedure;
  2387. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2388. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2389. BEGIN
  2390. IF IsUnsafePointer (type) THEN
  2391. skip := NewLabel();
  2392. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2393. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2394. BreqL (skip, op, nil);
  2395. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2396. SetLabel (skip);
  2397. ELSIF SemanticChecker.IsPointerType (type) THEN
  2398. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2399. CallThis(position,"GarbageCollector","Mark", 1);
  2400. ELSIF type.IsRecordType() THEN
  2401. Emit (Push(position,register));
  2402. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2403. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2404. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2405. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2406. ELSIF IsStaticArray(type) THEN
  2407. size := StaticArrayNumElements(type);
  2408. base := StaticArrayBaseType(type);
  2409. IF base.IsRecordType() THEN
  2410. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2411. Emit (Push(position, register));
  2412. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2413. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2414. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2415. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2416. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2417. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2418. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2419. Emit (Push(position, register));
  2420. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2421. ELSE
  2422. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2423. Emit (Push(position, register));
  2424. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2425. ASSERT(base.IsPointer());
  2426. END;
  2427. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2428. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2429. CallThis(position,"GarbageCollector","Mark", 1);
  2430. ELSE HALT(100); (* missing ? *)
  2431. END;
  2432. END CallTraceMethod;
  2433. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2434. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2435. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2436. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2437. BEGIN
  2438. previousSection := section;
  2439. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2440. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2441. GetRecordTypeName (recordType,name);
  2442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2443. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2444. IF dump # NIL THEN dump := section.comments END;
  2445. IF backend.hasLinkRegister THEN
  2446. Emit(Push(Basic.invalidPosition, lr));
  2447. END;
  2448. variable := recordType.recordScope.firstVariable;
  2449. WHILE variable # NIL DO
  2450. IF variable.NeedsTrace() THEN
  2451. register := NewRegisterOperand (addressType);
  2452. Emit (Mov(position,register,parameter1));
  2453. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2454. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2455. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2456. END;
  2457. CallTraceMethod(register, variable.type);
  2458. ReleaseIntermediateOperand(register);
  2459. END;
  2460. variable := variable.nextVariable;
  2461. END;
  2462. recordBase := recordType.GetBaseRecord();
  2463. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2464. recordBase := recordBase.GetBaseRecord();
  2465. END;
  2466. IF recordBase # NIL THEN
  2467. IF backend.hasLinkRegister THEN
  2468. Emit(Pop(Basic.invalidPosition, lr));
  2469. END;
  2470. GetRecordTypeName (recordBase,name);
  2471. IF HasExplicitTraceMethod (recordBase) THEN
  2472. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2473. ELSE
  2474. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2475. END;
  2476. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2477. Emit(Br(position,op));
  2478. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2479. Emit(Exit(position,0,0,0));
  2480. ELSE
  2481. IF backend.hasLinkRegister THEN
  2482. Emit(Pop(Basic.invalidPosition, lr));
  2483. END;
  2484. IF recordType.isObject THEN
  2485. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2486. ELSE
  2487. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2488. END;
  2489. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2490. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2491. Emit(Br(position,op));
  2492. END;
  2493. IF ~recordType.isObject THEN
  2494. GetRecordTypeName (recordType,name);
  2495. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2496. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2497. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2498. NEW(registerUsageCount);
  2499. usedRegisters := NIL;
  2500. IF dump # NIL THEN dump := section.comments END;
  2501. register := NewRegisterOperand (addressType);
  2502. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2503. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2504. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2505. END;
  2506. Emit (Push(position,register));
  2507. GetRecordTypeName (recordType,name);
  2508. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2509. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2510. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2511. ReleaseIntermediateOperand(register);
  2512. Emit(Exit(position,0,0,0));
  2513. GetRecordTypeName (recordType,name);
  2514. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2515. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2516. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2517. NEW(registerUsageCount);
  2518. usedRegisters := NIL;
  2519. register := NewRegisterOperand (addressType);
  2520. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2521. Emit(Mov(position, register, parameter1));
  2522. label := NewLabel();
  2523. SetLabel(label);
  2524. Emit(Push(position, register));
  2525. GetRecordTypeName (recordType,name);
  2526. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2527. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2528. Emit(Call(position, op, 0));
  2529. Emit(Pop(position, register));
  2530. Emit(Add(position, register, register, ofs));
  2531. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2532. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2533. Emit(Exit(position,0,0,0));
  2534. END;
  2535. INC(statCoopTraceMethod, section.pc);
  2536. ReturnToContext(context);
  2537. IF dump # NIL THEN dump := section.comments END;
  2538. END CreateTraceMethod;
  2539. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2540. VAR name: Basic.SegmentedName;
  2541. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2542. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2543. context: Context;
  2544. BEGIN
  2545. IF recordType.isObject THEN RETURN END;
  2546. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2547. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2548. GetRecordTypeName (recordType,name);
  2549. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2550. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2551. IF dump # NIL THEN dump := section.comments END;
  2552. IF backend.hasLinkRegister THEN
  2553. Emit(Push(Basic.invalidPosition, lr));
  2554. END;
  2555. variable := recordType.recordScope.firstVariable;
  2556. WHILE variable # NIL DO
  2557. IF variable.NeedsTrace() THEN
  2558. dst := NewRegisterOperand (addressType);
  2559. Emit (Mov(position, dst, parameter1));
  2560. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2561. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2562. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2563. END;
  2564. CallResetProcedure(dst, nil, variable.type);
  2565. ReleaseIntermediateOperand(dst);
  2566. END;
  2567. variable := variable.nextVariable;
  2568. END;
  2569. recordBase := recordType.GetBaseRecord();
  2570. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2571. IF backend.hasLinkRegister THEN
  2572. Emit(Pop(Basic.invalidPosition, lr));
  2573. END;
  2574. GetRecordTypeName (recordBase,name);
  2575. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2576. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2577. Emit(Br(position,op));
  2578. ELSE
  2579. Emit(Exit(position,0,0, 0));
  2580. END;
  2581. GetRecordTypeName (recordType,name);
  2582. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2583. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2584. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2585. NEW(registerUsageCount);
  2586. usedRegisters := NIL;
  2587. dst := NewRegisterOperand (addressType);
  2588. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2589. Emit(Mov(position, dst, parameter1));
  2590. label := NewLabel();
  2591. SetLabel(label);
  2592. Emit(Push(position, dst));
  2593. GetRecordTypeName (recordType,name);
  2594. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2595. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2596. Emit(Call(position, op, 0));
  2597. Emit(Pop(position, dst));
  2598. Emit(Add(position, dst, dst, ofs));
  2599. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2600. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2601. Emit(Exit(position,0,0, 0));
  2602. INC(statCoopResetProcedure, section.pc);
  2603. ReturnToContext(context);
  2604. IF dump # NIL THEN dump := section.comments END;
  2605. END CreateResetProcedure;
  2606. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2607. VAR name: Basic.SegmentedName; context: Context;
  2608. BEGIN
  2609. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2610. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2611. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2612. IF dump # NIL THEN dump := section.comments END;
  2613. IF backend.hasLinkRegister THEN
  2614. Emit(Push(Basic.invalidPosition, lr));
  2615. END;
  2616. Emit(Push(position,fp));
  2617. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2618. ResetVariables(scope);
  2619. Emit(Pop(position,fp));
  2620. Emit(Exit(position,0,0, 0));
  2621. ReturnToContext(context);
  2622. IF dump # NIL THEN dump := section.comments END;
  2623. END CreateResetMethod;
  2624. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2625. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2626. BEGIN
  2627. IF SemanticChecker.IsPointerType (type) THEN
  2628. Emit (Push(position, dest));
  2629. CallThis(position,"GarbageCollector","Reset", 1);
  2630. ELSIF type.IsRecordType() THEN
  2631. Emit (Push(position, dest));
  2632. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2633. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2634. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2635. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2636. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2637. size := GetArrayLength(type, tag);
  2638. base := ArrayBaseType(type);
  2639. IF base.IsRecordType() THEN
  2640. Emit (Push(position, size));
  2641. Emit (Push(position, dest));
  2642. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2643. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2644. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2645. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2646. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2647. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2648. Emit (Push(position, size));
  2649. Emit (Push(position, dest));
  2650. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2651. ELSE
  2652. Emit (Push(position, size));
  2653. Emit (Push(position, dest));
  2654. CallThis(position,"GarbageCollector","ResetArray", 2);
  2655. ASSERT(ArrayBaseType(type).IsPointer());
  2656. END;
  2657. ReleaseIntermediateOperand(size);
  2658. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2659. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2660. Emit (Push(position, dest));
  2661. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2662. ELSE HALT(100); (* missing ? *)
  2663. END;
  2664. END CallResetProcedure;
  2665. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2666. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2667. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2668. VAR operand: Operand;
  2669. BEGIN
  2670. Symbol (symbol, operand);
  2671. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2672. ReleaseOperand(operand);
  2673. END Reset;
  2674. BEGIN
  2675. previousScope := currentScope;
  2676. currentScope := scope;
  2677. pc := section.pc;
  2678. prevOffset := MAX(SIZE);
  2679. variable := scope.firstVariable;
  2680. WHILE variable # NIL DO
  2681. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2682. Reset (variable);
  2683. prevOffset := variable.offsetInBits;
  2684. END;
  2685. variable := variable.nextVariable;
  2686. END;
  2687. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2688. WHILE parameter # NIL DO
  2689. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2690. Reset (parameter);
  2691. END;
  2692. parameter := parameter.nextParameter;
  2693. END;
  2694. INC(statCoopResetVariables, section.pc - pc);
  2695. currentScope := previousScope;
  2696. END ResetVariables;
  2697. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2698. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2699. BEGIN
  2700. type := symbol.type.resolved;
  2701. SaveRegisters();ReleaseUsedRegisters(saved);
  2702. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2703. Symbol(symbol, operand);
  2704. ToMemory(operand.op,addressType,0);
  2705. Emit(Push(position,operand.op));
  2706. IF refer THEN
  2707. CallThis(position,"Heaps","Refer",1);
  2708. ELSE
  2709. CallThis(position,"Heaps","Reset",1);
  2710. END;
  2711. ELSIF type.IsRecordType() THEN
  2712. Symbol(symbol, operand);
  2713. Emit(Push(position,operand.op));
  2714. Emit(Push(position,operand.tag)); (* type desc *)
  2715. IF refer THEN
  2716. CallThis(position,"Heaps","ReferRecord",2);
  2717. ELSE
  2718. CallThis(position,"Heaps","ResetRecord",2);
  2719. END;
  2720. ELSIF IsStaticArray(type) THEN
  2721. size := StaticArrayNumElements(type);
  2722. base := StaticArrayBaseType(type);
  2723. Symbol(symbol, operand);
  2724. arg := TypeDescriptorAdr(base);
  2725. Emit(Push(position,operand.op));
  2726. Emit(Push(position,arg));
  2727. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2728. ReleaseIntermediateOperand(arg);
  2729. IF refer THEN
  2730. CallThis(position,"Heaps","ReferArray",3);
  2731. ELSE
  2732. CallThis(position,"Heaps","ResetArray",3);
  2733. END;
  2734. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2735. size := StaticMathArrayNumElements(type);
  2736. base := StaticMathArrayBaseType(type);
  2737. Symbol(symbol, operand);
  2738. arg := TypeDescriptorAdr(base);
  2739. Emit(Push(position,operand.op));
  2740. Emit(Push(position,arg));
  2741. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2742. ReleaseIntermediateOperand(arg);
  2743. IF refer THEN
  2744. CallThis(position,"Heaps","ReferArray",3);
  2745. ELSE
  2746. CallThis(position,"Heaps","ResetArray",3);
  2747. END;
  2748. ELSIF type IS SyntaxTree.MathArrayType THEN
  2749. Symbol(symbol, operand);
  2750. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2751. Emit (Push(position, operand.op));
  2752. ELSE
  2753. Emit (Push(position, operand.tag));
  2754. END;
  2755. IF refer THEN
  2756. CallThis(position,"Heaps","ReferMathArray", 1);
  2757. ELSE
  2758. CallThis(position,"Heaps","ResetMathArray", 1);
  2759. END;
  2760. ELSIF type IS SyntaxTree.ProcedureType THEN
  2761. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2762. Symbol(symbol, operand);
  2763. Emit (Push(position, operand.tag));
  2764. IF refer THEN
  2765. CallThis(position,"Heaps","Refer", 1);
  2766. ELSE
  2767. CallThis(position,"Heaps","Reset", 1);
  2768. END;
  2769. ELSE HALT(100); (* missing ? *)
  2770. END;
  2771. ReleaseOperand(operand);
  2772. RestoreRegisters(saved);
  2773. END Reset;
  2774. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2775. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2776. BEGIN
  2777. previousScope := currentScope;
  2778. currentScope := scope;
  2779. pc := section.pc;
  2780. IF ~ refer THEN
  2781. variable := scope.firstVariable;
  2782. prevOffset := MAX(SIZE);
  2783. WHILE variable # NIL DO
  2784. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2785. Reset (variable,refer);
  2786. prevOffset := variable.offsetInBits;
  2787. END;
  2788. variable := variable.nextVariable;
  2789. END;
  2790. END;
  2791. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2792. WHILE parameter # NIL DO
  2793. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2794. Reset (parameter,refer);
  2795. END;
  2796. parameter := parameter.nextParameter;
  2797. END;
  2798. INC(statCoopResetVariables, section.pc - pc);
  2799. currentScope := previousScope;
  2800. END ResetVariables2;
  2801. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2802. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2803. VAR op: IntermediateCode.Operand; context: Context;
  2804. BEGIN
  2805. previousSection := section;
  2806. GetCodeSectionNameForSymbol(procedure, name);
  2807. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2808. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2809. IF dump # NIL THEN dump := section.comments END;
  2810. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2811. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2812. Emit(Data(position,op));
  2813. Emit(Data(position,nil));
  2814. IF HasPointers (procedure.procedureScope) THEN
  2815. GetCodeSectionNameForSymbol(procedure, name);
  2816. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2817. ELSE
  2818. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2819. END;
  2820. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2821. Emit(Data(position,op));
  2822. ReturnToContext(context);
  2823. IF dump # NIL THEN dump := section.comments END;
  2824. END CreateProcedureDescriptor;
  2825. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2826. VAR import: SyntaxTree.Import;
  2827. s: Basic.MessageString;
  2828. selfName: SyntaxTree.IdentifierString;
  2829. BEGIN
  2830. moduleScope.ownerModule.GetName(selfName);
  2831. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2832. module := moduleScope.ownerModule
  2833. ELSE
  2834. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2835. IF import = NIL THEN
  2836. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2837. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2838. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2839. s := "Module ";
  2840. Strings.Append(s,moduleName);
  2841. Strings.Append(s," cannot be imported.");
  2842. IF force THEN
  2843. Error(position,s);
  2844. ELSIF canBeLoaded THEN
  2845. IF WarningDynamicLoading THEN
  2846. Strings.Append(s, "=> no dynamic linking.");
  2847. Warning(position, s);
  2848. END;
  2849. canBeLoaded := FALSE;
  2850. END;
  2851. RETURN FALSE
  2852. ELSE
  2853. SELF.module.imports.AddName(moduleName)
  2854. END;
  2855. ELSIF import.module = NIL THEN (* already tried *)
  2856. RETURN FALSE
  2857. END;
  2858. module := import.module;
  2859. END;
  2860. RETURN TRUE
  2861. END AddImport;
  2862. (* needed for old binary object file format*)
  2863. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2864. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2865. BEGIN
  2866. IF AddImport(moduleName,module,TRUE) THEN
  2867. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2868. IF procedure = NIL THEN
  2869. s := "Instruction not supported on target, emulation procedure ";
  2870. Strings.Append(s,moduleName);
  2871. Strings.Append(s,".");
  2872. Strings.Append(s,procedureName);
  2873. Strings.Append(s," not present");
  2874. Error(position,s);
  2875. ELSE
  2876. StaticCallOperand(r,procedure);
  2877. ReleaseOperand(r);
  2878. fp := GetFingerprint(procedure);
  2879. END;
  2880. END;
  2881. END EnsureSymbol;
  2882. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2883. VAR exit: Label; trueL,falseL: Label;
  2884. BEGIN
  2885. trueL := NewLabel();
  2886. falseL := NewLabel();
  2887. exit := NewLabel();
  2888. Condition(x,trueL,falseL);
  2889. InitOperand(result,ModeValue);
  2890. SetLabel(trueL);
  2891. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2892. Emit(Mov(position,result.op,true));
  2893. BrL(exit);
  2894. SetLabel(falseL);
  2895. Emit(MovReplace(position,result.op,false));
  2896. SetLabel(exit);
  2897. END ConditionToValue;
  2898. PROCEDURE ValueToCondition(VAR op: Operand);
  2899. BEGIN
  2900. LoadValue(op,system.booleanType);
  2901. BrneL(trueLabel,op.op, false);
  2902. ReleaseOperand(op);
  2903. BrL(falseLabel);
  2904. END ValueToCondition;
  2905. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2906. VAR size: LONGINT;
  2907. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2908. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2909. BEGIN
  2910. ASSERT(type.form = SyntaxTree.Open);
  2911. baseType := type.arrayBase.resolved;
  2912. IF IsOpenArray(baseType) THEN
  2913. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2914. ELSE
  2915. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2916. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2917. END;
  2918. len := tag;
  2919. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2920. IntermediateCode.MakeMemory(len,addressType);
  2921. UseIntermediateOperand(len);
  2922. Reuse2(res,sizeOperand,len);
  2923. Emit(Mul(position,res,sizeOperand,len));
  2924. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2925. RETURN res
  2926. END GetArraySize;
  2927. BEGIN
  2928. type := type.resolved;
  2929. IF IsOpenArray(type) THEN
  2930. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2931. RETURN tag
  2932. ELSE
  2933. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2934. END;
  2935. ELSE
  2936. size := ToMemoryUnits(system,system.SizeOf(type));
  2937. RETURN IntermediateCode.Immediate(addressType,size)
  2938. END;
  2939. END GetDynamicSize;
  2940. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2941. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2942. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2943. BEGIN
  2944. ASSERT(type.form = SyntaxTree.Open);
  2945. baseType := type.arrayBase.resolved;
  2946. IF IsOpenArray(baseType) THEN
  2947. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2948. ELSE
  2949. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2950. END;
  2951. len := tag;
  2952. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2953. IntermediateCode.MakeMemory(len,addressType);
  2954. UseIntermediateOperand(len);
  2955. Reuse2(res,sizeOperand,len);
  2956. Emit(Mul(position,res,sizeOperand,len));
  2957. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2958. RETURN res
  2959. END GetLength;
  2960. BEGIN
  2961. type := type.resolved;
  2962. IF IsOpenArray(type) THEN
  2963. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2964. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2965. ELSIF type IS SyntaxTree.StringType THEN
  2966. RETURN tag;
  2967. ELSE
  2968. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2969. END;
  2970. END GetArrayLength;
  2971. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2972. VAR result: IntermediateCode.Operand;
  2973. BEGIN
  2974. IF backend.cooperative THEN
  2975. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2976. ELSE
  2977. MakeMemory(result, tag, addressType, 0);
  2978. END;
  2979. RETURN result
  2980. END GetSizeFromTag;
  2981. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2982. VAR parameter: SyntaxTree.Parameter;
  2983. BEGIN
  2984. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2985. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2986. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2987. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2988. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2989. END;
  2990. RETURN GetDynamicSize(e.type, tag);
  2991. END GetArrayOfBytesSize;
  2992. (*
  2993. to find imported symbol. not needed ?
  2994. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2995. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2996. BEGIN
  2997. IF AddImport(moduleName,importedModule,FALSE) THEN
  2998. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2999. RETURN symbol
  3000. ELSE
  3001. RETURN NIL
  3002. END
  3003. END SymbolByName;
  3004. *)
  3005. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3006. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3007. BEGIN
  3008. IF AddImport(moduleName,runtimeModule,force) THEN
  3009. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3010. IF procedure = NIL THEN
  3011. s := "Procedure ";
  3012. Strings.Append(s,moduleName);
  3013. Strings.Append(s,".");
  3014. Strings.Append(s,procedureName);
  3015. Strings.Append(s," not present");
  3016. Error(position,s);
  3017. RETURN FALSE
  3018. ELSE
  3019. RETURN TRUE
  3020. END;
  3021. ELSE RETURN FALSE
  3022. END;
  3023. END GetRuntimeProcedure;
  3024. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3025. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3026. s: Basic.MessageString;
  3027. BEGIN
  3028. Basic.InitSegmentedName(name);
  3029. name[0] := Basic.MakeString(moduleName);
  3030. name[1] := Basic.MakeString(typeName);
  3031. name[2] := -1;
  3032. IF AddImport(moduleName,importedModule, FALSE) THEN
  3033. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3034. IF symbol = NIL THEN
  3035. s := "type ";
  3036. Strings.Append(s,moduleName);
  3037. Strings.Append(s,".");
  3038. Strings.Append(s,typeName);
  3039. Strings.Append(s," not present");
  3040. Error(position,s);
  3041. END;
  3042. ELSE symbol := NIL;
  3043. END;
  3044. IF importedModule = moduleScope.ownerModule THEN
  3045. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3046. ELSE
  3047. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3048. END;
  3049. RETURN symbol
  3050. END GetTypeDescriptor;
  3051. (* 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. *)
  3052. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3053. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3054. pooledName: Basic.SegmentedName; size: LONGINT;
  3055. BEGIN
  3056. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3057. StaticCallOperand(result,procedure);
  3058. IF numberParameters < 0 THEN
  3059. size := ProcParametersSize(procedure);
  3060. ELSE
  3061. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3062. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3063. Error(position,"runtime call parameter count mismatch");
  3064. END;
  3065. END;
  3066. Emit(Call(position, result.op, size));
  3067. ReleaseOperand(result);
  3068. ELSE (* only static linking possible *)
  3069. ASSERT(numberParameters >= 0);
  3070. Basic.InitSegmentedName(pooledName);
  3071. pooledName[0] := Basic.MakeString(moduleName);
  3072. pooledName[1] := Basic.MakeString(procedureName);
  3073. pooledName[2] := -1;
  3074. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3075. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3076. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3077. END;
  3078. END CallThisChecked;
  3079. (* 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. *)
  3080. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3081. BEGIN
  3082. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3083. END CallThis;
  3084. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3085. VAR
  3086. left,right: Operand;
  3087. leftSize, rightSize: IntermediateCode.Operand;
  3088. saved: RegisterEntry;
  3089. reg: IntermediateCode.Operand;
  3090. procedureName: SyntaxTree.IdentifierString;
  3091. BEGIN
  3092. procedureName := "CompareString";
  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. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3108. Emit(Result(position,reg));
  3109. (*
  3110. AcquireThisRegister(int8,IntermediateCode.Result);
  3111. *)
  3112. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3113. (*
  3114. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3115. *)
  3116. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3117. ReleaseIntermediateOperand(reg);
  3118. BrL(falseLabel);
  3119. END CompareString;
  3120. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3121. VAR
  3122. left,right: Operand;
  3123. leftSize, rightSize: IntermediateCode.Operand;
  3124. saved: RegisterEntry;
  3125. procedureName: SyntaxTree.IdentifierString;
  3126. BEGIN
  3127. procedureName := "CopyString";
  3128. SaveRegisters();ReleaseUsedRegisters(saved);
  3129. Designate(leftExpression,left);
  3130. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3131. Emit(Push(position,leftSize));
  3132. ReleaseIntermediateOperand(leftSize);
  3133. Emit(Push(position,left.op));
  3134. ReleaseOperand(left);
  3135. Designate(rightExpression,right);
  3136. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3137. Emit(Push(position,rightSize));
  3138. ReleaseIntermediateOperand(rightSize);
  3139. Emit(Push(position,right.op));
  3140. ReleaseOperand(right);
  3141. CallThis(position,builtinsModuleName,procedureName,4);
  3142. RestoreRegisters(saved);
  3143. END CopyString;
  3144. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3145. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3146. leftType,rightType: SyntaxTree.Type;
  3147. leftExpression,rightExpression : SyntaxTree.Expression;
  3148. componentType: IntermediateCode.Type;
  3149. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3150. size: LONGINT;
  3151. BEGIN
  3152. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3153. dest := destination; destination := emptyOperand;
  3154. leftType := x.left.type.resolved;
  3155. rightType := x.right.type.resolved;
  3156. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3157. CASE x.operator OF
  3158. Scanner.Or:
  3159. (* shortcut evaluation of left OR right *)
  3160. IF ~conditional THEN ConditionToValue(x);
  3161. ELSE
  3162. next := NewLabel();
  3163. Condition(x.left,trueLabel,next);
  3164. SetLabel(next);
  3165. Condition(x.right,trueLabel,falseLabel);
  3166. END;
  3167. |Scanner.And:
  3168. (* shortcut evaluation of left & right *)
  3169. IF ~conditional THEN ConditionToValue(x);
  3170. ELSE
  3171. next := NewLabel();
  3172. Condition(x.left,next,falseLabel);
  3173. SetLabel(next);
  3174. Condition(x.right,trueLabel,falseLabel);
  3175. END;
  3176. |Scanner.Is:
  3177. IF ~conditional THEN ConditionToValue(x);
  3178. ELSE
  3179. (* get type desc tag *)
  3180. IF IsPointerToRecord(leftType,recordType) THEN
  3181. Evaluate(x.left,left);
  3182. Dereference(left,recordType,IsUnsafePointer(leftType))
  3183. ELSE
  3184. Designate(x.left,left);
  3185. END;
  3186. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3187. ReleaseOperand(left);
  3188. END;
  3189. |Scanner.Plus:
  3190. Evaluate(x.left,left);
  3191. Evaluate(x.right,right);
  3192. IF leftType IS SyntaxTree.SetType THEN
  3193. InitOperand(result,ModeValue);
  3194. Reuse2a(result.op,left.op,right.op,dest);
  3195. Emit(Or(position,result.op,left.op,right.op));
  3196. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3197. InitOperand(result,ModeValue);
  3198. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3199. Reuse2(result.tag,left.tag,right.tag);
  3200. Emit(Add(position,result.op,left.op,right.op));
  3201. Emit(Add(position,result.tag,left.tag,right.tag))
  3202. ELSE
  3203. InitOperand(result,ModeValue);
  3204. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3205. AddInt(result.op, left.op, right.op) ;
  3206. ELSE
  3207. *)
  3208. Reuse2a(result.op,left.op,right.op,dest);
  3209. Emit(Add(position,result.op,left.op,right.op));
  3210. (*
  3211. END;
  3212. *)
  3213. END;
  3214. ReleaseOperand(left); ReleaseOperand(right);
  3215. |Scanner.Minus:
  3216. Evaluate(x.left,left);
  3217. Evaluate(x.right,right);
  3218. IF leftType IS SyntaxTree.SetType THEN
  3219. InitOperand(result,ModeValue);
  3220. Reuse1(result.op,right.op);
  3221. Emit(Not(position,result.op,right.op));
  3222. ReleaseOperand(right);
  3223. Emit(And(position,result.op,result.op,left.op));
  3224. ReleaseOperand(left);
  3225. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3226. InitOperand(result,ModeValue);
  3227. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3228. Reuse2(result.tag,left.tag,right.tag);
  3229. Emit(Sub(position,result.op,left.op,right.op));
  3230. Emit(Sub(position,result.tag,left.tag,right.tag));
  3231. ReleaseOperand(left); ReleaseOperand(right)
  3232. ELSE
  3233. InitOperand(result,ModeValue);
  3234. Reuse2a(result.op,left.op,right.op,dest);
  3235. Emit(Sub(position,result.op,left.op,right.op));
  3236. ReleaseOperand(left); ReleaseOperand(right);
  3237. END;
  3238. |Scanner.Times:
  3239. Evaluate(x.left,left);
  3240. Evaluate(x.right,right);
  3241. IF leftType IS SyntaxTree.SetType THEN
  3242. InitOperand(result,ModeValue);
  3243. Reuse2a(result.op,left.op,right.op,dest);
  3244. Emit(And(position,result.op,left.op,right.op));
  3245. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3246. InitOperand(result, ModeValue);
  3247. componentType := left.op.type;
  3248. (* TODO: review this *)
  3249. (*
  3250. result.op = left.op * right.op - left.tag * right.tag
  3251. result.tag = left.tag * right.op + left.op * right.tag
  3252. *)
  3253. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3254. Emit(Mul(position,result.op, left.op, right.op));
  3255. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3256. Emit(Mul(position,tempReg, left.tag, right.tag));
  3257. Emit(Sub(position,result.op, result.op, tempReg));
  3258. Reuse2(result.tag, left.tag, right.op);
  3259. Emit(Mul(position,result.tag, left.tag, right.op));
  3260. Emit(Mul(position,tempReg, left.op, right.tag));
  3261. Emit(Add(position,result.tag, result.tag, tempReg));
  3262. ReleaseIntermediateOperand(tempReg)
  3263. ELSE
  3264. InitOperand(result,ModeValue);
  3265. Reuse2a(result.op,left.op,right.op,dest);
  3266. Emit(Mul(position,result.op,left.op,right.op));
  3267. END;
  3268. ReleaseOperand(left); ReleaseOperand(right);
  3269. |Scanner.Div:
  3270. Evaluate(x.left,left);
  3271. Evaluate(x.right,right);
  3272. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3273. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3274. IF ~isUnchecked THEN
  3275. exit := NewLabel();
  3276. BrltL(exit,zero,right.op);
  3277. EmitTrap(position,NegativeDivisorTrap);
  3278. SetLabel(exit);
  3279. END;
  3280. END;
  3281. InitOperand(result,ModeValue);
  3282. Reuse2a(result.op,left.op,right.op,dest);
  3283. Emit(Div(position,result.op,left.op,right.op));
  3284. ReleaseOperand(left); ReleaseOperand(right);
  3285. |Scanner.Mod:
  3286. Evaluate(x.left,left);
  3287. Evaluate(x.right,right);
  3288. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3289. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3290. IF ~isUnchecked THEN
  3291. exit := NewLabel();
  3292. BrltL(exit,zero,right.op);
  3293. EmitTrap(position,NegativeDivisorTrap);
  3294. SetLabel(exit);
  3295. END;
  3296. END;
  3297. InitOperand(result,ModeValue);
  3298. Reuse2a(result.op,left.op,right.op,dest);
  3299. Emit(Mod(position,result.op,left.op,right.op));
  3300. ReleaseOperand(left); ReleaseOperand(right);
  3301. |Scanner.Slash:
  3302. Evaluate(x.left,left);
  3303. Evaluate(x.right,right);
  3304. IF leftType IS SyntaxTree.SetType THEN
  3305. InitOperand(result,ModeValue);
  3306. Reuse2a(result.op,left.op,right.op,dest);
  3307. Emit(Xor(position,result.op,left.op,right.op));
  3308. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3309. InitOperand(result,ModeValue);
  3310. componentType := left.op.type;
  3311. (* review this *)
  3312. (*
  3313. divisor = right.op * right.op + right.tag * right.tag
  3314. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3315. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3316. *)
  3317. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3318. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3319. Emit(Mul(position,tempReg, right.op, right.op));
  3320. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3321. Emit(Add(position,tempReg, tempReg, tempReg2));
  3322. result.op := tempReg2;
  3323. Emit(Mul(position,result.op, left.op, right.op));
  3324. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3325. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3326. Emit(Add(position,result.op, result.op, tempReg2));
  3327. Emit(Div(position,result.op, result.op, tempReg));
  3328. Reuse2(result.tag, left.tag, right.op);
  3329. Emit(Mul(position,result.tag, left.tag, right.op));
  3330. Emit(Mul(position,tempReg2, left.op, right.tag));
  3331. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3332. Emit(Div(position,result.tag, result.tag, tempReg));
  3333. ReleaseIntermediateOperand(tempReg);
  3334. ReleaseIntermediateOperand(tempReg2)
  3335. ELSE
  3336. InitOperand(result,ModeValue);
  3337. Reuse2a(result.op,left.op,right.op,dest);
  3338. Emit(Div(position,result.op,left.op,right.op));
  3339. END;
  3340. ReleaseOperand(left); ReleaseOperand(right);
  3341. |Scanner.Equal:
  3342. IF ~conditional THEN ConditionToValue(x);
  3343. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3344. CompareString(BreqL,x.left,x.right);
  3345. ELSE
  3346. Evaluate(x.left,left);
  3347. Evaluate(x.right,right);
  3348. IF leftType IS SyntaxTree.RangeType THEN
  3349. ASSERT(rightType IS SyntaxTree.RangeType);
  3350. BrneL(falseLabel, left.op, right.op); (* first *)
  3351. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3352. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3353. ReleaseOperand(left); ReleaseOperand(right);
  3354. BrL(trueLabel)
  3355. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3356. BrneL(falseLabel, left.op, right.op); (* first *)
  3357. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3358. ReleaseOperand(left); ReleaseOperand(right);
  3359. BrL(trueLabel)
  3360. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3361. (* TODO: review this *)
  3362. BrneL(falseLabel, left.op, right.op); (* real part *)
  3363. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3364. ReleaseOperand(left); ReleaseOperand(right);
  3365. BrL(trueLabel)
  3366. ELSE
  3367. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3368. ReleaseOperand(left); ReleaseOperand(right);
  3369. BrL(trueLabel);
  3370. END;
  3371. END;
  3372. |Scanner.LessEqual:
  3373. IF ~conditional THEN ConditionToValue(x);
  3374. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3375. CompareString(BrgeL,x.right,x.left);
  3376. ELSE
  3377. Evaluate(x.left,left);
  3378. Evaluate(x.right,right);
  3379. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3380. Reuse1(temp.op,right.op);
  3381. Emit(And(position,temp.op,left.op,right.op));
  3382. ReleaseOperand(right);
  3383. BreqL(trueLabel,temp.op,left.op);
  3384. BrL(falseLabel);
  3385. ReleaseOperand(temp);ReleaseOperand(left);
  3386. ELSE
  3387. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3388. ReleaseOperand(left); ReleaseOperand(right);
  3389. BrL(trueLabel);
  3390. END;
  3391. END;
  3392. |Scanner.Less:
  3393. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3394. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3395. leftExpression.SetType(system.booleanType);
  3396. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3397. rightExpression.SetType(system.booleanType);
  3398. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3399. leftExpression.SetType(system.booleanType);
  3400. Expression(leftExpression);
  3401. ELSIF ~conditional THEN ConditionToValue(x);
  3402. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3403. CompareString(BrltL,x.left,x.right);
  3404. ELSE
  3405. Evaluate(x.left,left);
  3406. Evaluate(x.right,right);
  3407. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3408. ReleaseOperand(left); ReleaseOperand(right);
  3409. BrL(trueLabel);
  3410. END;
  3411. |Scanner.Greater:
  3412. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3413. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3414. leftExpression.SetType(system.booleanType);
  3415. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3416. rightExpression.SetType(system.booleanType);
  3417. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3418. leftExpression.SetType(system.booleanType);
  3419. Expression(leftExpression);
  3420. ELSIF ~conditional THEN ConditionToValue(x);
  3421. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3422. CompareString(BrltL,x.right,x.left);
  3423. ELSE
  3424. Evaluate(x.left,left);
  3425. Evaluate(x.right,right);
  3426. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3427. ReleaseOperand(left); ReleaseOperand(right);
  3428. BrL(trueLabel);
  3429. END;
  3430. |Scanner.GreaterEqual:
  3431. IF ~conditional THEN ConditionToValue(x);
  3432. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3433. CompareString(BrgeL,x.left,x.right);
  3434. ELSE
  3435. Evaluate(x.left,left);
  3436. Evaluate(x.right,right);
  3437. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3438. Reuse1(temp.op,left.op);
  3439. Emit(And(position,temp.op,left.op,right.op));
  3440. ReleaseOperand(left);
  3441. BreqL(trueLabel, temp.op,right.op);
  3442. ReleaseOperand(temp); ReleaseOperand(right);
  3443. BrL(falseLabel);
  3444. ELSE
  3445. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3446. ReleaseOperand(left); ReleaseOperand(right);
  3447. BrL(trueLabel);
  3448. END;
  3449. END;
  3450. |Scanner.Unequal:
  3451. IF ~conditional THEN ConditionToValue(x);
  3452. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3453. CompareString(BrneL,x.left,x.right);
  3454. ELSE
  3455. Evaluate(x.left,left);
  3456. Evaluate(x.right,right);
  3457. IF leftType IS SyntaxTree.RangeType THEN
  3458. ASSERT(rightType IS SyntaxTree.RangeType);
  3459. BrneL(trueLabel, left.op, right.op); (* first *)
  3460. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3461. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3462. ReleaseOperand(left); ReleaseOperand(right);
  3463. BrL(falseLabel)
  3464. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3465. BrneL(trueLabel, left.op, right.op); (* first *)
  3466. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3467. ReleaseOperand(left); ReleaseOperand(right);
  3468. BrL(falseLabel)
  3469. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3470. (* TODO: review this *)
  3471. BrneL(trueLabel, left.op, right.op); (* real part *)
  3472. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3473. ReleaseOperand(left); ReleaseOperand(right);
  3474. BrL(falseLabel)
  3475. ELSE
  3476. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3477. ReleaseOperand(left); ReleaseOperand(right);
  3478. BrL(trueLabel);
  3479. END;
  3480. END;
  3481. |Scanner.In:
  3482. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3483. Evaluate(x.left,left);
  3484. Evaluate(x.right,right);
  3485. Convert(left.op,setType);
  3486. Convert(right.op,setType);
  3487. ReuseCopy(temp.op,right.op);
  3488. Emit(Shr(position,temp.op,temp.op,left.op));
  3489. ReleaseOperand(right); ReleaseOperand(left);
  3490. IntermediateCode.InitImmediate(one,setType,1);
  3491. Emit(And(position,temp.op,temp.op,one));
  3492. IF conditional THEN
  3493. IntermediateCode.InitImmediate(zero,setType,0);
  3494. BrneL(trueLabel,temp.op,zero);
  3495. ReleaseOperand(temp);
  3496. BrL(falseLabel);
  3497. ELSE
  3498. Convert(temp.op,bool);
  3499. result.mode := ModeValue;
  3500. result.op := temp.op;
  3501. result.tag := nil; (* may be left over from calls to evaluate *)
  3502. END;
  3503. ELSE
  3504. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3505. IF x.operator = Scanner.Questionmarks THEN
  3506. leftExpression := x.left;
  3507. rightExpression := x.right;
  3508. ELSE
  3509. leftExpression := x.right;
  3510. rightExpression := x.left;
  3511. END;
  3512. Evaluate(leftExpression, left);
  3513. Emit(Push(position,left.op));
  3514. ReleaseOperand(left);
  3515. Designate(rightExpression, right);
  3516. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3517. IF ~backend.cellsAreObjects THEN
  3518. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3519. END;
  3520. Emit(Push(position,right.op));
  3521. ReleaseOperand(right);
  3522. IF backend.cellsAreObjects THEN
  3523. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3524. ELSE
  3525. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3526. END;
  3527. InitOperand(result, ModeValue);
  3528. result.op := NewRegisterOperand(bool);
  3529. Emit(Result(position,result.op));
  3530. IF conditional THEN
  3531. IntermediateCode.InitImmediate(zero,setType,0);
  3532. BrneL(trueLabel,result.op,zero);
  3533. ReleaseOperand(result);
  3534. BrL(falseLabel);
  3535. END;
  3536. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3537. leftExpression := x.left;
  3538. rightExpression := x.right;
  3539. Evaluate(leftExpression, left);
  3540. Emit(Push(position,left.op));
  3541. ReleaseOperand(left);
  3542. Evaluate(rightExpression, right);
  3543. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3544. IF ~backend.cellsAreObjects THEN
  3545. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3546. END;
  3547. Emit(Push(position,right.op));
  3548. ReleaseOperand(right);
  3549. IF backend.cellsAreObjects THEN
  3550. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3551. ELSE
  3552. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3553. END;
  3554. InitOperand(result, ModeValue);
  3555. result.op := NewRegisterOperand(bool);
  3556. Emit(Result(position,result.op));
  3557. IF conditional THEN
  3558. IntermediateCode.InitImmediate(zero,setType,0);
  3559. BrneL(trueLabel,result.op,zero);
  3560. ReleaseOperand(result);
  3561. BrL(falseLabel);
  3562. END;
  3563. ELSE
  3564. HALT(100);
  3565. END;
  3566. END;
  3567. destination := dest;
  3568. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3569. END VisitBinaryExpression;
  3570. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3571. VAR localResult, operand: Operand;
  3572. BEGIN
  3573. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3574. InitOperand(localResult, ModeValue);
  3575. ASSERT(x.first # NIL);
  3576. Evaluate(x.first, operand);
  3577. localResult.op := operand.op;
  3578. ReleaseOperand(operand);
  3579. UseIntermediateOperand(localResult.op);
  3580. ASSERT(x.last # NIL);
  3581. Evaluate(x.last, operand);
  3582. localResult.tag := operand.op;
  3583. ReleaseOperand(operand);
  3584. UseIntermediateOperand(localResult.tag);
  3585. IF x.step # NIL THEN
  3586. Evaluate(x.step, operand);
  3587. localResult.extra := operand.op;
  3588. ReleaseOperand(operand);
  3589. UseIntermediateOperand(localResult.extra);
  3590. END;
  3591. result := localResult;
  3592. IF Trace THEN TraceExit("VisitRangeExpression") END
  3593. END VisitRangeExpression;
  3594. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3595. BEGIN
  3596. HALT(100); (* should never be evaluated *)
  3597. END VisitTensorRangeExpression;
  3598. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3599. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3600. BEGIN
  3601. IF Trace THEN TraceEnter("VisitConversion") END;
  3602. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3603. dest := destination; destination := emptyOperand;
  3604. Evaluate(x.expression,old);
  3605. InitOperand(result,ModeValue);
  3606. result.op := old.op;
  3607. ASSERT(result.op.mode # 0);
  3608. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3609. (* convert TO a complex number *)
  3610. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3611. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3612. ASSERT(result.op.mode # 0);
  3613. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3614. (* convert FROM a complex number TO a complex number*)
  3615. result.tag := old.tag;
  3616. ASSERT(result.tag.mode # 0);
  3617. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3618. ASSERT(result.tag.mode # 0)
  3619. ELSE
  3620. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3621. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3622. END
  3623. ELSE
  3624. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3625. ASSERT(result.op.mode # 0);
  3626. result.tag := old.tag; (*! probably never used *)
  3627. END;
  3628. destination := dest;
  3629. IF Trace THEN TraceExit("VisitConversion") END;
  3630. END VisitConversion;
  3631. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3632. BEGIN
  3633. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3634. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3635. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3636. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3637. END VisitTypeDeclaration;
  3638. (** designators (expressions) *)
  3639. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3640. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3641. BEGIN
  3642. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3643. IF x.left # NIL THEN Expression(x.left) END;
  3644. Symbol(x.symbol,result);
  3645. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3646. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3647. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3648. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3649. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3650. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3651. END;
  3652. END;
  3653. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3654. END VisitSymbolDesignator;
  3655. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3656. BEGIN
  3657. IF isUnchecked THEN RETURN END;
  3658. IF tagsAvailable THEN
  3659. TrapC(BrltL,index,length,IndexCheckTrap);
  3660. END;
  3661. END BoundCheck;
  3662. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3663. VAR d: IntermediateCode.Operand;
  3664. BEGIN
  3665. IF isUnchecked THEN RETURN END;
  3666. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3667. TrapC(op,dim,d,ArraySizeTrap);
  3668. ReleaseIntermediateOperand(d);
  3669. END DimensionCheck;
  3670. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3671. VAR
  3672. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3673. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3674. expression: SyntaxTree.Expression;
  3675. resultingType, leftType, baseType: SyntaxTree.Type;
  3676. skipLabel1: Label;
  3677. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3678. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3679. variableOp: Operand;
  3680. variable: SyntaxTree.Variable;
  3681. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3682. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3683. VAR e: SyntaxTree.Expression; i: LONGINT;
  3684. BEGIN
  3685. tensorFound := FALSE;
  3686. FOR i := 0 TO parameters.Length()-1 DO
  3687. e := parameters.GetExpression(i);
  3688. IF e IS SyntaxTree.TensorRangeExpression THEN
  3689. ASSERT(~tensorFound);
  3690. tensorFound := TRUE;
  3691. ELSIF e IS SyntaxTree.RangeExpression THEN
  3692. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3693. ELSE
  3694. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3695. END;
  3696. END;
  3697. END CountIndices;
  3698. BEGIN
  3699. ASSERT(tagsAvailable);
  3700. resultingType := x.type.resolved; (* resulting type *)
  3701. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3702. InitOperand(localResult, ModeReference);
  3703. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3704. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3705. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3706. (* a globally defined array destination tag is available -> use and invalidate it*)
  3707. localResult.tag := arrayDestinationTag;
  3708. IntermediateCode.InitOperand(arrayDestinationTag)
  3709. ELSE
  3710. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3711. (* the result is of array range type and thus does not provide any collectable pointers *)
  3712. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3713. Symbol(variable, variableOp);
  3714. ReuseCopy(localResult.tag, variableOp.op);
  3715. ReleaseOperand(variableOp);
  3716. END
  3717. END;
  3718. indexListSize := x.parameters.Length();
  3719. CountIndices(x.parameters);
  3720. (*ASSERT(tensorRangeCount <= 1);*)
  3721. (* designate the array to be indexed over, perform tensor range check if known *)
  3722. Designate(x.left, array);
  3723. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3724. Dereference(array, leftType,FALSE);
  3725. IF ~tensorFound THEN
  3726. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3727. END
  3728. END;
  3729. (* default base offset *)
  3730. srcDimOffset := 0;
  3731. destDimOffset := 0;
  3732. indexDim := 0;
  3733. (* use address of source array as basis *)
  3734. localResult.op := array.op;
  3735. UseIntermediateOperand(localResult.op);
  3736. (* go through the index list *)
  3737. FOR i := 0 TO indexListSize - 1 DO
  3738. expression := x.parameters.GetExpression(i);
  3739. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3740. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3741. srcDimOffset := -indexListSize;
  3742. destDimOffset := -suffixRanges;
  3743. ELSE
  3744. (* determine which dimension of source array is currently looked at *)
  3745. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3746. (* get the memory operand pointing to array descriptor dimension *)
  3747. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3748. (* make a reusable register from it *)
  3749. ReuseCopy(srcDim, tmp);
  3750. ReleaseIntermediateOperand(tmp);
  3751. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3752. ELSE
  3753. srcDim := IntermediateCode.Immediate(sizeType, i);
  3754. END;
  3755. (* get length and increment of source array for current dimension *)
  3756. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3757. Convert(sourceLength.op, sizeType);
  3758. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3759. Convert(sourceIncrement.op, sizeType);
  3760. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3761. ReleaseIntermediateOperand(srcDim);
  3762. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3763. (* SINGLE INDEX *)
  3764. Evaluate(expression, index);
  3765. ReleaseIntermediateOperand(index.tag);
  3766. index.tag := emptyOperand;
  3767. Convert(index.op, sizeType);
  3768. (* lower bound check *)
  3769. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3770. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3771. ELSIF isUnchecked THEN (* do nothing *)
  3772. ELSE
  3773. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3774. END;
  3775. (* upper bound check *)
  3776. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3777. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3778. ELSIF isUnchecked THEN (* do nothing *)
  3779. ELSE
  3780. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3781. END;
  3782. ReleaseOperand(sourceLength);
  3783. Convert(index.op, addressType);
  3784. summand := index.op;
  3785. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3786. (* RANGE OF INDICES *)
  3787. Evaluate(expression, range);
  3788. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3789. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3790. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3791. ReleaseOperand(range);
  3792. Convert(firstIndex, sizeType);
  3793. Convert(lastIndex, sizeType);
  3794. Convert(stepSize, sizeType);
  3795. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3796. if it is 'MAX(LONGINT)' *)
  3797. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3798. TransferToRegister(lastIndex, lastIndex);
  3799. skipLabel1 := NewLabel();
  3800. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3801. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3802. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3803. SetLabel(skipLabel1)
  3804. END;
  3805. (* check if step size is valid *)
  3806. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3807. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3808. ELSIF isUnchecked THEN (* do nothing *)
  3809. ELSE
  3810. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3811. END;
  3812. (* check lower bound check *)
  3813. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3814. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3815. ELSIF isUnchecked THEN (* do nothing *)
  3816. ELSE
  3817. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3818. END;
  3819. (* check upper bound check *)
  3820. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3821. (* statically open range: nothing to do *)
  3822. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3823. ASSERT(staticLastIndex < staticSourceLength)
  3824. ELSIF isUnchecked THEN (* do nothing *)
  3825. ELSE
  3826. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3827. END;
  3828. (* determine length of target array for current dimension *)
  3829. (* 1. incorporate last index: *)
  3830. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3831. (* last index is static *)
  3832. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3833. targetLength := sourceLength.op
  3834. ELSE
  3835. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3836. END;
  3837. UseIntermediateOperand(targetLength);
  3838. ELSE
  3839. (* targetLength := lastIndex + 1
  3840. Reuse1(targetLength, lastIndex);
  3841. *)
  3842. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3843. END;
  3844. ReleaseOperand(sourceLength);
  3845. ReleaseIntermediateOperand(lastIndex);
  3846. (* 2. incorporate first index: *)
  3847. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3848. (* first index and current target length are static *)
  3849. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3850. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3851. (* first index = 0: nothing to do *)
  3852. ELSE
  3853. (* targetLength := targetLength - firstIndex *)
  3854. TransferToRegister(targetLength, targetLength);
  3855. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3856. END;
  3857. (* clip negative lengths to 0 *)
  3858. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3859. IF staticTargetLength < 0 THEN
  3860. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3861. END
  3862. ELSE
  3863. skipLabel1 := NewLabel();
  3864. TransferToRegister(targetLength, targetLength);
  3865. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3866. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3867. SetLabel(skipLabel1)
  3868. END;
  3869. (* 3. incorporate index step size: *)
  3870. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3871. (*step size and current target length are static *)
  3872. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3873. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3874. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3875. (* step size = 1: nothing to do *)
  3876. ELSE
  3877. (* emit code for this:
  3878. targetLength := (targetLength-1) DIV stepSize +1;
  3879. *)
  3880. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3881. DivInt(targetLength, targetLength, stepSize);
  3882. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3883. END;
  3884. (* determine increment of target array for current dimension *)
  3885. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3886. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3887. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3888. (* step size = 1 *)
  3889. targetIncrement := sourceIncrement.op;
  3890. UseIntermediateOperand(targetIncrement)
  3891. ELSE
  3892. (* targetIncrement := sourceIncrement * stepSize *)
  3893. Reuse1(targetIncrement, stepSize);
  3894. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3895. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3896. END;
  3897. ReleaseIntermediateOperand(stepSize);
  3898. (* write length and increment of target array to descriptor *)
  3899. IF destDimOffset < 0 THEN
  3900. (* determine which dimension of target array is currently looked at *)
  3901. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3902. TransferToRegister(destDim, tmp);
  3903. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3904. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3905. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3906. ReleaseIntermediateOperand(destDim);
  3907. INC(destDimOffset);
  3908. ELSE
  3909. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3910. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3911. END;
  3912. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3913. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3914. INC(indexDim);
  3915. Convert(firstIndex, addressType);
  3916. TransferToRegister(summand, firstIndex);
  3917. ELSE HALT(100);
  3918. END;
  3919. (*
  3920. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3921. *)
  3922. Convert(sourceIncrement.op, addressType);
  3923. Convert(summand, addressType);
  3924. MulInt(summand, summand, sourceIncrement.op);
  3925. ReleaseIntermediateOperand(sourceIncrement.op);
  3926. AddInt(localResult.op, localResult.op, summand);
  3927. ReleaseIntermediateOperand(summand);
  3928. END
  3929. END;
  3930. result := localResult;
  3931. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3932. ReleaseIntermediateOperand(result.tag);
  3933. result.tag := TypeDescriptorAdr(resultingType);
  3934. ELSIF IsDelegate(resultingType) THEN
  3935. ReleaseIntermediateOperand(result.tag);
  3936. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3937. UseIntermediateOperand(result.tag);
  3938. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3939. ReleaseIntermediateOperand(result.tag);
  3940. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3941. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3942. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3943. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3944. (* finalize target array descriptor *)
  3945. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3946. (* write lengths and increments of target array for remaining dimensions *)
  3947. i := indexListSize;
  3948. WHILE indexDim < targetArrayDimensionality DO
  3949. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3950. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3951. ReleaseOperand(sourceLength);
  3952. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3953. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3954. ReleaseOperand(sourceIncrement);
  3955. INC(i); INC(indexDim);
  3956. END;
  3957. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3958. tmp := nil;
  3959. ELSE
  3960. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3961. END;
  3962. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3963. ReleaseIntermediateOperand(tmp);
  3964. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3965. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3966. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3967. ELSE
  3968. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3969. END;
  3970. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3971. ReleaseIntermediateOperand(tmp);
  3972. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3973. (* write dimensionality *)
  3974. IF targetArrayDimensionality # 0 THEN
  3975. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3976. END;
  3977. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3978. END;
  3979. ReleaseOperand(array);
  3980. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3981. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3982. END;
  3983. END MathIndexDesignator;
  3984. (* get the length of an array , trying to make use of static information *)
  3985. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3986. VAR res: IntermediateCode.Operand; size: LONGINT;
  3987. BEGIN
  3988. type := type.resolved;
  3989. IF type IS SyntaxTree.ArrayType THEN
  3990. WITH type: SyntaxTree.ArrayType DO
  3991. IF type.form = SyntaxTree.Static THEN
  3992. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3993. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3994. Evaluate(type.length, op);
  3995. ReleaseIntermediateOperand(op.tag);
  3996. RETURN op.op;*)
  3997. ELSE
  3998. res := tag;
  3999. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4000. IntermediateCode.MakeMemory(res,addressType);
  4001. UseIntermediateOperand(res);
  4002. RETURN res
  4003. END
  4004. END;
  4005. ELSE
  4006. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4007. RETURN IntermediateCode.Immediate(addressType,size);
  4008. END;
  4009. END ArrayLength;
  4010. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4011. BEGIN
  4012. IF IsImmediate(x) THEN
  4013. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4014. ELSE
  4015. IF ~ReusableRegister(res) THEN
  4016. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4017. ELSE
  4018. UseIntermediateOperand(res);
  4019. END;
  4020. Emit(Mov(position,res,x))
  4021. END;
  4022. END CopyInt;
  4023. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4024. BEGIN
  4025. ReleaseIntermediateOperand(res);
  4026. IF IsImmediate(x) & IsImmediate(y) THEN
  4027. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4028. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4029. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4030. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4031. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4032. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4033. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4034. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4035. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4036. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4037. UseIntermediateOperand(res);
  4038. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4039. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4040. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4041. UseIntermediateOperand(res);
  4042. ELSE
  4043. IF ~ReusableRegister(res) THEN
  4044. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4045. ELSE
  4046. UseIntermediateOperand(res);
  4047. END;
  4048. IF IsImmediate(x) & (x.intValue = 0) THEN
  4049. Emit(Mov(position,res,y))
  4050. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4051. Emit(Mov(position,res,x))
  4052. ELSE
  4053. Emit(Add(position,res, x, y));
  4054. END;
  4055. END;
  4056. END AddInt;
  4057. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4058. BEGIN
  4059. ReleaseIntermediateOperand(res);
  4060. IF IsImmediate(x) & IsImmediate(y) THEN
  4061. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4062. ELSE
  4063. IF ~ReusableRegister(res) THEN
  4064. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4065. ELSE UseIntermediateOperand(res);
  4066. END;
  4067. IF IsImmediate(x) & (x.intValue = 1) THEN
  4068. Emit(Mov(position,res,y))
  4069. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4070. Emit(Mov(position,res,x))
  4071. ELSE
  4072. Emit(Mul(position,res, x, y));
  4073. END;
  4074. END;
  4075. END MulInt;
  4076. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4077. BEGIN
  4078. ReleaseIntermediateOperand(res);
  4079. IF IsImmediate(x) & IsImmediate(y) THEN
  4080. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4081. ELSE
  4082. IF ~ReusableRegister(res) THEN
  4083. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4084. ELSE UseIntermediateOperand(res);
  4085. END;
  4086. IF IsImmediate(x) & (x.intValue = 1) THEN
  4087. Emit(Mov(position,res,y))
  4088. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4089. Emit(Mov(position,res,x))
  4090. ELSE
  4091. Emit(Div(position,res, x, y));
  4092. END;
  4093. END;
  4094. END DivInt;
  4095. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4096. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4097. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4098. BEGIN
  4099. type := x.left.type.resolved;
  4100. IF type IS SyntaxTree.StringType THEN
  4101. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4102. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4103. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4104. type := atype;
  4105. x.left.SetType(type);
  4106. END;
  4107. IntermediateCode.InitImmediate(res,addressType,0);
  4108. maxDim := x.parameters.Length()-1;
  4109. (*
  4110. computation rule:
  4111. a: ARRAY X,Y,Z OF Element with size S
  4112. a[i,j,k] -->
  4113. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4114. *)
  4115. FOR i := 0 TO maxDim DO
  4116. e := x.parameters.GetExpression(i);
  4117. Evaluate(e,index);
  4118. Convert(index.op,addressType);
  4119. AddInt(res, res, index.op);
  4120. IF i = 0 THEN
  4121. (*
  4122. ReuseCopy(res, index.op);
  4123. *)
  4124. Designate(x.left,array);
  4125. type := x.left.type.resolved;
  4126. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4127. Dereference(array, type, FALSE);
  4128. END;
  4129. (*
  4130. ELSE AddInt(res, res, index.op);
  4131. *)
  4132. END;
  4133. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4134. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4135. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4136. BoundCheck(index.op, length);
  4137. END;
  4138. ReleaseIntermediateOperand(length);
  4139. END;
  4140. ReleaseOperand(index);
  4141. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4142. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4143. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4144. MulInt(res,res,length);
  4145. END;
  4146. ReleaseIntermediateOperand(length);
  4147. END;
  4148. (* remaining open dimensions -- compute address *)
  4149. i := maxDim+1;
  4150. IF type IS SyntaxTree.ArrayType THEN
  4151. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4152. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4153. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4154. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4155. MulInt(res,res,length);
  4156. END;
  4157. ReleaseIntermediateOperand(length);
  4158. INC(i);
  4159. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4160. END;
  4161. END;
  4162. IF (type IS SyntaxTree.ArrayType) THEN
  4163. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4164. size := StaticSize(system, type);
  4165. IF size # 1 THEN
  4166. length := IntermediateCode.Immediate(addressType,size);
  4167. MulInt(res,res,length);
  4168. END;
  4169. ELSE
  4170. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4171. IF size # 1 THEN
  4172. length := IntermediateCode.Immediate(addressType,size);
  4173. MulInt(res,res,length);
  4174. END;
  4175. END;
  4176. END;
  4177. AddInt(res,res,array.op);
  4178. InitOperand(result,ModeReference);
  4179. result.op := res;
  4180. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4181. ReleaseIntermediateOperand(result.tag);
  4182. result.tag := TypeDescriptorAdr(type);
  4183. ELSIF IsDelegate(type) THEN
  4184. ReleaseIntermediateOperand(result.tag);
  4185. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4186. UseIntermediateOperand(result.tag);
  4187. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4188. ReleaseIntermediateOperand(result.tag);
  4189. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4190. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4191. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4192. END;
  4193. ReleaseOperand(array);
  4194. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4195. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4196. END;
  4197. END IndexDesignator;
  4198. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4199. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4200. BEGIN
  4201. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4202. dest := destination; destination := emptyOperand;
  4203. type := x.left.type.resolved;
  4204. IF type IS SyntaxTree.MathArrayType THEN
  4205. MathIndexDesignator(x);
  4206. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4207. IndexDesignator(x);
  4208. END;
  4209. destination := dest;
  4210. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4211. END VisitIndexDesignator;
  4212. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4213. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4214. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4215. procedure: SyntaxTree.Procedure;
  4216. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4217. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4218. BEGIN
  4219. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4220. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4221. parameters := expression.parameters;
  4222. moduleName := "FoxArrayBase";
  4223. procedureName := "CopyDescriptor";
  4224. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4225. SaveRegisters();ReleaseUsedRegisters(saved);
  4226. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4227. IF procedure = NIL THEN
  4228. s := "procedure ";
  4229. Strings.Append(s,moduleName);
  4230. Strings.Append(s,".");
  4231. Strings.Append(s,procedureName);
  4232. Strings.Append(s," not present");
  4233. Error(position,s);
  4234. ELSE
  4235. (* push address of temporary variable *)
  4236. Symbol(variable,destOperand);
  4237. Emit(Push(position,destOperand.op));
  4238. ReleaseOperand(destOperand);
  4239. (* push src *)
  4240. Evaluate(expression.left,srcOperand);
  4241. (*
  4242. Dereference(srcOperand,expression.type.resolved);
  4243. Emit(Push(position,srcOperand.tag));
  4244. *)
  4245. Emit(Push(position,srcOperand.op));
  4246. ReleaseOperand(srcOperand);
  4247. tensorFound := FALSE;
  4248. FOR i := 0 TO parameters.Length()-1 DO
  4249. e := parameters.GetExpression(i);
  4250. IF e IS SyntaxTree.TensorRangeExpression THEN
  4251. tensorFound := TRUE;
  4252. ELSIF e IS SyntaxTree.RangeExpression THEN
  4253. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4254. ELSE
  4255. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4256. END;
  4257. END;
  4258. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4259. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4260. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4261. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4262. StaticCallOperand(procOp,procedure);
  4263. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4264. ReleaseOperand(procOp);
  4265. END;
  4266. RestoreRegisters(saved);
  4267. END;
  4268. RETURN variable
  4269. END PrepareTensorDescriptor;
  4270. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4271. VAR
  4272. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4273. operand, tmpOperand, variableOp, variable2Op: Operand;
  4274. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4275. variable, variable2: SyntaxTree.Variable;
  4276. dim, i, size: LONGINT;
  4277. (* TODO: needed? *)
  4278. oldArrayDestinationTag: IntermediateCode.Operand;
  4279. oldArrayDestinationDimension: LONGINT;
  4280. position: Position;
  4281. saved: RegisterEntry;
  4282. arrayFlags: SET;
  4283. m, n: LONGINT;
  4284. PROCEDURE Pass(op: IntermediateCode.Operand);
  4285. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4286. BEGIN
  4287. IF numberRegister >= 0 THEN
  4288. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4289. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4290. Emit(Mov(position,parameterRegister, op));
  4291. ELSE
  4292. Emit(Push(position,op))
  4293. END
  4294. END Pass;
  4295. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4296. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4297. BEGIN
  4298. formalType := formalType.resolved; actualType := actualType.resolved;
  4299. IF IsOpenArray(formalType)THEN
  4300. IF actualType IS SyntaxTree.StringType THEN
  4301. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4302. RETURN;
  4303. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4304. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4305. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4306. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4307. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4308. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4309. ELSE
  4310. tmp := baseReg;
  4311. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4312. IntermediateCode.MakeMemory(tmp,addressType);
  4313. Pass((tmp));
  4314. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4315. END;
  4316. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4317. END;
  4318. END PushArrayLens;
  4319. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4320. BEGIN
  4321. CASE size OF
  4322. |2: INCL(flags,Size2Flag);
  4323. |3: INCL(flags,Size3Flag);
  4324. |4: INCL(flags,Size4Flag);
  4325. |5: INCL(flags,Size5Flag);
  4326. |6: INCL(flags,Size6Flag);
  4327. |7: INCL(flags,Size7Flag);
  4328. |8: INCL(flags,Size8Flag);
  4329. END;
  4330. END SetSmallArraySizeFlag;
  4331. BEGIN
  4332. IF Trace THEN TraceEnter("PushParameter") END;
  4333. position := expression.position;
  4334. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4335. type := expression.type.resolved;
  4336. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4337. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4338. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4339. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4340. );
  4341. (* TODO: needed? *)
  4342. oldArrayDestinationTag := arrayDestinationTag;
  4343. oldArrayDestinationDimension := arrayDestinationDimension;
  4344. IF IsArrayOfSystemByte(parameter.type) THEN
  4345. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4346. Designate(expression,operand);
  4347. ELSE
  4348. Evaluate(expression, tmpOperand);
  4349. (* array of system byte does not provide any pointers *)
  4350. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4351. Symbol(variable, operand);
  4352. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4353. Emit(Mov(position,tmp, tmpOperand.op));
  4354. ReleaseOperand(tmpOperand);
  4355. END;
  4356. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4357. ReleaseIntermediateOperand(operand.tag);
  4358. operand.tag := tmp;
  4359. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4360. Pass((operand.tag));
  4361. END;
  4362. Pass((operand.op));
  4363. ELSIF IsOpenArray(parameter.type) THEN
  4364. Designate(expression,operand);
  4365. baseReg := operand.tag;
  4366. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4367. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4368. END;
  4369. Pass((operand.op)); (* address of the array *)
  4370. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4371. (* case 1
  4372. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4373. *)
  4374. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4375. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4376. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4377. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4378. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4379. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4380. arrayDestinationTag := sp;
  4381. (* case 1b
  4382. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4383. *)
  4384. IF expression IS SyntaxTree.IndexDesignator THEN
  4385. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4386. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4387. arrayDestinationDimension := dim;
  4388. Designate(expression,operand);
  4389. (* case 1a
  4390. P(...,A,...) push: push array descriptor to stack
  4391. *)
  4392. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4393. Designate(expression,operand);
  4394. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4395. i := 0;
  4396. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4397. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4398. INC(i);
  4399. END;
  4400. type := expression.type.resolved;
  4401. WHILE (i<dim) DO (* remaining static dimensions *)
  4402. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4403. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4404. ReleaseOperand(tmpOperand);
  4405. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4406. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4407. ReleaseOperand(tmpOperand);
  4408. INC(i);
  4409. END;
  4410. dimOp := IntermediateCode.Immediate(addressType,dim);
  4411. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4412. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4413. (* case 1d
  4414. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4415. + case 1e
  4416. P(.. PT() ... );
  4417. *)
  4418. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4419. Designate(expression,operand);
  4420. Dereference(operand,type.resolved,FALSE);
  4421. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4422. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4423. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4424. (* case 1f
  4425. P(...,S,...) push: create array descriptor to S on stack
  4426. case 1g
  4427. P(... PS()...)
  4428. *)
  4429. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4430. Designate(expression,operand);
  4431. FOR i := 0 TO dim-1 DO
  4432. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4433. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4434. ReleaseOperand(tmpOperand);
  4435. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4436. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4437. ReleaseOperand(tmpOperand);
  4438. END;
  4439. (*******
  4440. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4441. *)
  4442. arrayFlags := {StaticFlag};
  4443. IF dim = 1 THEN
  4444. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4445. ReleaseOperand(tmpOperand);
  4446. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4447. m := LONGINT(tmpOperand.op.intValue);
  4448. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4449. ELSIF dim = 2 THEN
  4450. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4451. ReleaseOperand(tmpOperand);
  4452. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4453. m := LONGINT(tmpOperand.op.intValue);
  4454. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4455. ReleaseOperand(tmpOperand);
  4456. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4457. n := LONGINT(tmpOperand.op.intValue);
  4458. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4459. INCL(arrayFlags,SmallMatrixFlag);
  4460. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4461. END;
  4462. END;
  4463. (*******)
  4464. dimOp := IntermediateCode.Immediate(addressType,dim);
  4465. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4466. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4467. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4468. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4469. baseType := SemanticChecker.ArrayBase(type,dim);
  4470. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4471. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4472. ELSE HALT(100);
  4473. END;
  4474. (* case 2
  4475. procedure P([left args], var A: array [*,*] of Type, [right args])
  4476. *)
  4477. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4478. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4479. (* case 2b
  4480. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4481. push: push reference to pushed array descriptor
  4482. post: remove array descriptor.
  4483. *)
  4484. IF expression IS SyntaxTree.IndexDesignator THEN
  4485. descriptorType := GetMathArrayDescriptorType(dim);
  4486. (* range type : no allocation possible, should be untraced *)
  4487. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4488. Symbol(variable,variableOp);
  4489. arrayDestinationTag := variableOp.op;
  4490. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4491. arrayDestinationDimension := dim;
  4492. NeedDescriptor := TRUE;
  4493. Designate(expression,operand);
  4494. Pass((operand.tag));
  4495. NeedDescriptor := FALSE;
  4496. (* case 2a
  4497. P(...,A,...)
  4498. push: push reference to array descriptor on stack
  4499. *)
  4500. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4501. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4502. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4503. INC(i);
  4504. END;
  4505. IF i = dim THEN
  4506. Designate(expression,operand);
  4507. Pass((operand.tag));
  4508. ELSE (* open-static *)
  4509. type := expression.type.resolved;
  4510. descriptorType := GetMathArrayDescriptorType(dim);
  4511. (* static array , cannot be reallocated, untraced !*)
  4512. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4513. Symbol(variable,variableOp);
  4514. arrayDestinationTag := variableOp.op;
  4515. Designate(expression,operand);
  4516. FOR i := 0 TO dim-1 DO
  4517. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4518. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4519. ReleaseOperand(tmpOperand);
  4520. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4521. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4522. ReleaseOperand(tmpOperand);
  4523. END;
  4524. dimOp := IntermediateCode.Immediate(addressType,dim);
  4525. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4526. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4527. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4528. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4529. baseType := SemanticChecker.ArrayBase(type,dim);
  4530. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4531. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4532. Pass((arrayDestinationTag));
  4533. END;
  4534. (* case 2d
  4535. P(...,T,...) push: emit dimension check, push T
  4536. *)
  4537. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4538. Designate(expression,operand);
  4539. Dereference(operand,type.resolved,FALSE);
  4540. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4541. Pass((operand.tag));
  4542. (* case 2f
  4543. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4544. push: push reference to pushed array descriptor
  4545. post: remove array descriptor
  4546. *)
  4547. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4548. descriptorType := GetMathArrayDescriptorType(dim);
  4549. (* static array -- cannot be reallocatated, untraced *)
  4550. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4551. Symbol(variable,variableOp);
  4552. arrayDestinationTag := variableOp.op;
  4553. Designate(expression,operand);
  4554. FOR i := 0 TO dim-1 DO
  4555. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4556. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4557. ReleaseOperand(tmpOperand);
  4558. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4559. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4560. ReleaseOperand(tmpOperand);
  4561. END;
  4562. (*
  4563. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4564. *)
  4565. arrayFlags := {StaticFlag};
  4566. IF dim = 1 THEN
  4567. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4568. ReleaseOperand(tmpOperand);
  4569. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4570. m := LONGINT(tmpOperand.op.intValue);
  4571. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4572. ELSIF dim = 2 THEN
  4573. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4574. ReleaseOperand(tmpOperand);
  4575. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4576. m := LONGINT(tmpOperand.op.intValue);
  4577. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4578. ReleaseOperand(tmpOperand);
  4579. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4580. n := LONGINT(tmpOperand.op.intValue);
  4581. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4582. INCL(arrayFlags,SmallMatrixFlag);
  4583. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4584. END;
  4585. END;
  4586. (*******)
  4587. dimOp := IntermediateCode.Immediate(addressType,dim);
  4588. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4589. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4590. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4591. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4592. baseType := SemanticChecker.ArrayBase(type,dim);
  4593. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4594. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4595. Pass((arrayDestinationTag));
  4596. ELSE HALT(100);
  4597. END;
  4598. (* case 3
  4599. procedure P([left args], [const] A: array [?] of Type, [right args])
  4600. *)
  4601. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4602. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4603. (* case 3b
  4604. P(...,A[a..b,c..d],...)
  4605. *)
  4606. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4607. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4608. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4609. Symbol(variable,variableOp);
  4610. LoadValue(variableOp,system.addressType);
  4611. ELSE
  4612. descriptorType := GetMathArrayDescriptorType(dim);
  4613. (* range -- cannot be reallocated *)
  4614. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4615. Symbol(variable,variableOp);
  4616. END;
  4617. arrayDestinationTag := variableOp.op;
  4618. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4619. arrayDestinationDimension := 0;
  4620. Designate(expression,operand);
  4621. Pass((operand.tag));
  4622. (* case 3a
  4623. P(...,A,...)
  4624. *)
  4625. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4626. i := 0;
  4627. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4628. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4629. INC(i);
  4630. END;
  4631. IF i = dim THEN
  4632. Designate(expression,operand);
  4633. Pass((operand.tag));
  4634. ELSE (* open-static *)
  4635. type := expression.type.resolved;
  4636. descriptorType := GetMathArrayDescriptorType(dim);
  4637. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4638. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4639. Symbol(variable,variableOp);
  4640. arrayDestinationTag := variableOp.op;
  4641. Designate(expression,operand);
  4642. FOR i := 0 TO dim-1 DO
  4643. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4644. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4645. ReleaseOperand(tmpOperand);
  4646. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4647. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4648. ReleaseOperand(tmpOperand);
  4649. END;
  4650. dimOp := IntermediateCode.Immediate(addressType,dim);
  4651. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4652. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4653. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4654. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4655. baseType := SemanticChecker.ArrayBase(type,dim);
  4656. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4657. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4658. Pass((arrayDestinationTag));
  4659. END;
  4660. (* case 3d
  4661. P(...,T,...)
  4662. case 3e
  4663. P(...,PT(...),...)
  4664. *)
  4665. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4666. Designate(expression,operand);
  4667. Dereference(operand,type.resolved,FALSE);
  4668. Pass((operand.tag));
  4669. (* case 3f
  4670. P(...,S,...)
  4671. case 3g
  4672. P(...,PS(...),...)
  4673. *)
  4674. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4675. descriptorType := GetMathArrayDescriptorType(dim);
  4676. (* static array does not need to be traced *)
  4677. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4678. Symbol(variable,variableOp);
  4679. arrayDestinationTag := variableOp.op;
  4680. Designate(expression,operand);
  4681. IF operand.op.type.length >1 THEN (* vector register *)
  4682. (* static array does not need to be traced *)
  4683. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4684. Symbol(variable2, variable2Op);
  4685. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4686. Emit(Mov(position,tmp, operand.op));
  4687. ReleaseOperand(operand);
  4688. Symbol(variable2, operand);
  4689. END;
  4690. FOR i := 0 TO dim-1 DO
  4691. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4692. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4693. ReleaseOperand(tmpOperand);
  4694. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4695. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4696. ReleaseOperand(tmpOperand);
  4697. END;
  4698. dimOp := IntermediateCode.Immediate(addressType,dim);
  4699. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4700. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4701. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4702. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4703. baseType := SemanticChecker.ArrayBase(type,dim);
  4704. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4705. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4706. Pass((arrayDestinationTag));
  4707. ELSE HALT(100);
  4708. END;
  4709. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4710. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4711. (* case 4b
  4712. P(...,A[a..b,c..d],...)
  4713. *)
  4714. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4715. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4716. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4717. Symbol(variable,variableOp);
  4718. LoadValue(variableOp,system.addressType);
  4719. ELSE
  4720. descriptorType := GetMathArrayDescriptorType(dim);
  4721. (* range array -- cannot be allocated *)
  4722. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4723. Symbol(variable,variableOp);
  4724. END;
  4725. arrayDestinationTag := variableOp.op;
  4726. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4727. arrayDestinationDimension := 0;
  4728. Designate(expression,operand);
  4729. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4730. Symbol(variable,variableOp);
  4731. ELSE
  4732. (* alias to range -- untraced *)
  4733. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4734. Symbol(variable,variableOp);
  4735. MakeMemory(tmp,variableOp.op,addressType,0);
  4736. Emit(Mov(position,tmp,operand.tag));
  4737. ReleaseIntermediateOperand(tmp);
  4738. END;
  4739. Pass((variableOp.op));
  4740. ReleaseOperand(variableOp);
  4741. (* case 4a
  4742. P(...,A,...)
  4743. *)
  4744. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4745. i := 0;
  4746. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4747. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4748. INC(i);
  4749. END;
  4750. IF i = dim THEN
  4751. Designate(expression,operand);
  4752. arrayDestinationTag := operand.tag;
  4753. ELSE (* open-static *)
  4754. type := expression.type.resolved;
  4755. descriptorType := GetMathArrayDescriptorType(dim);
  4756. (* static array -- untraced *)
  4757. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4758. Symbol(variable,variableOp);
  4759. arrayDestinationTag := variableOp.op;
  4760. Designate(expression,operand);
  4761. FOR i := 0 TO dim-1 DO
  4762. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4763. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4764. ReleaseOperand(tmpOperand);
  4765. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4766. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4767. ReleaseOperand(tmpOperand);
  4768. END;
  4769. dimOp := IntermediateCode.Immediate(addressType,dim);
  4770. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4771. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4772. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4773. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4774. baseType := SemanticChecker.ArrayBase(type,dim);
  4775. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4776. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4777. END;
  4778. (* tensor alias to open array -- untraced *)
  4779. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4780. Symbol(variable,variableOp);
  4781. MakeMemory(tmp,variableOp.op,addressType,0);
  4782. Emit(Mov(position,tmp,arrayDestinationTag));
  4783. ReleaseIntermediateOperand(tmp);
  4784. Pass((variableOp.op));
  4785. ReleaseOperand(variableOp);
  4786. (* case 4d
  4787. P(...,T,...)
  4788. *)
  4789. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4790. Designate(expression,operand);
  4791. Pass((operand.op));
  4792. (* case 4f
  4793. P(...,S,...)
  4794. *)
  4795. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4796. descriptorType := GetMathArrayDescriptorType(dim);
  4797. (* static array -- cannot be reallocated, untraced *)
  4798. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4799. Symbol(variable,variableOp);
  4800. arrayDestinationTag := variableOp.op;
  4801. Designate(expression,operand);
  4802. FOR i := 0 TO dim-1 DO
  4803. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4804. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4805. ReleaseOperand(tmpOperand);
  4806. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4807. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4808. ReleaseOperand(tmpOperand);
  4809. END;
  4810. dimOp := IntermediateCode.Immediate(addressType,dim);
  4811. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4812. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4813. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4814. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4815. baseType := SemanticChecker.ArrayBase(type,dim);
  4816. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4817. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4818. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4819. Symbol(variable,variableOp);
  4820. MakeMemory(tmp,variableOp.op,addressType,0);
  4821. Emit(Mov(position,tmp,arrayDestinationTag));
  4822. ReleaseIntermediateOperand(tmp);
  4823. Pass((variableOp.op));
  4824. ReleaseOperand(variableOp);
  4825. ELSE HALT(100);
  4826. END;
  4827. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4828. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4829. Designate(expression,operand);
  4830. IF operand.op.type.length > 1 THEN
  4831. Emit(Push(position, operand.op));
  4832. ELSE
  4833. size := system.SizeOf(type);
  4834. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4835. size := ToMemoryUnits(system,size);
  4836. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4837. arrayDestinationTag := sp;
  4838. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4839. END;
  4840. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4841. Designate(expression,operand);
  4842. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4843. (* static array no pointer *)
  4844. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4845. Symbol(variable,variableOp);
  4846. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4847. Emit(Mov(position,tmp,operand.op));
  4848. Emit(Push(position,variableOp.op));
  4849. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4850. Pass((operand.op));
  4851. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4852. END;
  4853. ELSE HALT(200)
  4854. END;
  4855. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4856. IF parameter.kind = SyntaxTree.VarParameter THEN
  4857. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4858. Designate(expression, operand);
  4859. Pass((operand.op));
  4860. ELSE
  4861. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4862. Evaluate(expression, operand);
  4863. Pass((operand.extra)); (* step *)
  4864. Pass((operand.tag)); (* last *)
  4865. Pass((operand.op)) (* first *)
  4866. END
  4867. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4868. IF parameter.kind = SyntaxTree.VarParameter THEN
  4869. Designate(expression, operand);
  4870. Pass((operand.op));
  4871. ELSE
  4872. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4873. Evaluate(expression, operand);
  4874. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4875. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4876. Pass((operand.tag)); (* imaginary part *)
  4877. Pass((operand.op)) (* real part *)
  4878. ELSE
  4879. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4880. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4881. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4882. tmp := sp;
  4883. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4884. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4885. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4886. IntermediateCode.AddOffset(tmp,size);
  4887. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4888. END
  4889. END
  4890. ELSE
  4891. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4892. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4893. Designate(expression,operand);
  4894. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4895. (* stack allocation *)
  4896. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4897. (*! parameter alignment to be discussed ... *)
  4898. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4899. size := type(SyntaxTree.StringType).length;
  4900. END;
  4901. IF backend.cooperative & parameter.NeedsTrace() THEN
  4902. dst := NewRegisterOperand (addressType);
  4903. Emit(Mov(position,dst, sp));
  4904. IntermediateCode.InitImmediate(null, byteType, 0);
  4905. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4906. ReleaseIntermediateOperand(dst);
  4907. SaveRegisters();ReleaseUsedRegisters(saved);
  4908. (* register dst has been freed before SaveRegisters already *)
  4909. CallAssignMethod(dst, operand.op, parameter.type);
  4910. RestoreRegisters(saved);
  4911. END;
  4912. IF operand.op.type.length > 1 THEN (* vector *)
  4913. MakeMemory(tmp,sp,operand.op.type,0);
  4914. Emit(Mov(position, tmp, operand.op));
  4915. ELSE
  4916. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4917. END;
  4918. ELSIF IsOpenArray(parameter.type) THEN
  4919. Designate(expression,operand);
  4920. baseReg := operand.tag;
  4921. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4922. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4923. END;
  4924. Pass((operand.op)); (* address of the array *)
  4925. ELSIF IsDelegate(parameter.type) THEN
  4926. Evaluate(expression,operand);
  4927. IF backend.cooperative & parameter.NeedsTrace() THEN
  4928. Emit(Push(position, nil));
  4929. dst := NewRegisterOperand (addressType);
  4930. Emit(Mov(position,dst, sp));
  4931. ReleaseIntermediateOperand(dst);
  4932. SaveRegisters();ReleaseUsedRegisters(saved);
  4933. Emit(Push(position, dst));
  4934. (* register dst has been freed before SaveRegisters already *)
  4935. Emit(Push(position, operand.tag));
  4936. CallThis(position,"GarbageCollector","Assign",2);
  4937. RestoreRegisters(saved);
  4938. ELSE
  4939. Pass((operand.tag));
  4940. END;
  4941. Pass((operand.op));
  4942. ELSE
  4943. Evaluate(expression,operand);
  4944. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4945. Emit(Push(position, nil));
  4946. dst := NewRegisterOperand (addressType);
  4947. Emit(Mov(position,dst, sp));
  4948. ReleaseIntermediateOperand(dst);
  4949. SaveRegisters();ReleaseUsedRegisters(saved);
  4950. Emit(Push(position, dst));
  4951. (* register dst has been freed before SaveRegisters already *)
  4952. Emit(Push(position, operand.op));
  4953. CallThis(position,"GarbageCollector","Assign",2);
  4954. RestoreRegisters(saved);
  4955. ELSE
  4956. Pass((operand.op));
  4957. END;
  4958. END;
  4959. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4960. Evaluate(expression,operand);
  4961. Pass((operand.op));
  4962. ELSE (* var parameter *)
  4963. Designate(expression,operand);
  4964. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4965. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4966. Pass((operand.tag));
  4967. END;
  4968. END;
  4969. Pass((operand.op));
  4970. END;
  4971. END;
  4972. (* TODO: needed? *)
  4973. arrayDestinationTag := oldArrayDestinationTag;
  4974. arrayDestinationDimension := oldArrayDestinationDimension;
  4975. IF needsParameterBackup THEN
  4976. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4977. ReuseCopy(parameterBackup, operand.op)
  4978. END;
  4979. ReleaseOperand(operand);
  4980. IF Trace THEN TraceExit("PushParameter") END;
  4981. END PushParameter;
  4982. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4983. VAR prevConditional: BOOLEAN;
  4984. BEGIN
  4985. prevConditional := conditional;
  4986. conditional := FALSE;
  4987. 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
  4988. Expression(x.result); (* use register *)
  4989. END;
  4990. Statement(x.statement);
  4991. conditional := prevConditional;
  4992. IF x.result # NIL THEN Expression(x.result) END;
  4993. 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
  4994. ReleaseIntermediateOperand(result.op);
  4995. END;
  4996. END VisitStatementDesignator;
  4997. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4998. VAR
  4999. procedure: SyntaxTree.Procedure;
  5000. procedureType: SyntaxTree.ProcedureType;
  5001. wasInline: BOOLEAN;
  5002. actualParameters: SyntaxTree.ExpressionList;
  5003. formalParameter: SyntaxTree.Parameter;
  5004. actualParameter: SyntaxTree.Expression;
  5005. i: LONGINT;
  5006. localVariable: SyntaxTree.Variable;
  5007. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5008. src, dest: Operand;
  5009. prevInlineExit : Label;
  5010. prevMapper: SymbolMapper;
  5011. tooComplex: BOOLEAN;
  5012. resultDesignator: SyntaxTree.Expression;
  5013. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5014. BEGIN
  5015. IF e = NIL THEN RETURN TRUE
  5016. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5017. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5018. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5019. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5020. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5021. ELSE RETURN FALSE
  5022. END;
  5023. END SimpleExpression;
  5024. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5025. BEGIN
  5026. RETURN checker.CanPassInRegister(type)
  5027. END FitsInRegister;
  5028. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5029. VAR
  5030. variable: SyntaxTree.Variable;
  5031. variableDesignator: SyntaxTree.Designator;
  5032. BEGIN
  5033. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5034. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5035. variableDesignator.SetType(type);
  5036. RETURN variableDesignator
  5037. END GetTemp;
  5038. BEGIN
  5039. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5040. wasInline := currentIsInline;
  5041. prevInlineExit := currentInlineExit;
  5042. prevMapper := currentMapper;
  5043. currentInlineExit := NewLabel();
  5044. tooComplex := FALSE;
  5045. NEW(currentMapper);
  5046. currentIsInline := TRUE;
  5047. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5048. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5049. formalParameter := procedureType.firstParameter;
  5050. actualParameters := x.parameters;
  5051. i := 0;
  5052. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5053. actualParameter := actualParameters.GetExpression(i);
  5054. IF actualParameter.resolved # NIL THEN
  5055. actualParameter := actualParameter.resolved
  5056. END;
  5057. (*
  5058. if expression is simple and can be passed immediately
  5059. or if type fits in register then we can proceed
  5060. otherwise we escape to ordinary procedure call.
  5061. *)
  5062. (* cases where the expression can be mapped identically *)
  5063. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5064. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5065. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5066. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5067. (*
  5068. Assign(variableDesignator, actualParameter);
  5069. *)
  5070. Evaluate(actualParameter, src);
  5071. Designate(variableDesignator, dest);
  5072. Emit(Mov(x.position, dest.op, src.op));
  5073. ReleaseOperand(dest);
  5074. ReleaseOperand(src);
  5075. (* the src operand should now have been completely released ! *)
  5076. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5077. ELSE tooComplex := TRUE
  5078. END;
  5079. (*
  5080. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5081. currentMapper.Add(formalParameter, actualParameter, NIL);
  5082. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5083. variableDesignator := GetTemp(system.addressType, FALSE);
  5084. Designate(actualParameter, src);
  5085. Designate(variableDesignator, dest);
  5086. IntermediateCode.MakeMemory(dest.op,addressType);
  5087. Emit(Mov(x.position, dest.op, src.op));
  5088. ReleaseOperand(dest);
  5089. IF src.tag.mode # IntermediateCode.Undefined THEN
  5090. tagDesignator := GetTemp(system.addressType, FALSE);
  5091. Designate(tagDesignator, dest);
  5092. IntermediateCode.MakeMemory(dest.op,addressType);
  5093. Emit(Mov(x.position, dest.op, src.op));
  5094. END;
  5095. ReleaseOperand(dest); ReleaseOperand(src);
  5096. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5097. END;
  5098. *)
  5099. formalParameter := formalParameter.nextParameter;
  5100. INC(i);
  5101. END;
  5102. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5103. IF resultDesignator # NIL THEN
  5104. returnDesignator := resultDesignator
  5105. ELSE
  5106. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5107. END;
  5108. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5109. END;
  5110. localVariable := procedure.procedureScope.firstVariable;
  5111. WHILE ~tooComplex & (localVariable # NIL) DO
  5112. variableDesignator := GetTemp(localVariable.type, FALSE);
  5113. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5114. localVariable := localVariable.nextVariable;
  5115. END;
  5116. IF ~tooComplex THEN
  5117. VisitStatementBlock(procedure.procedureScope.body);
  5118. SetLabel(currentInlineExit);
  5119. IF procedureType.returnType # NIL THEN
  5120. Designate(returnDesignator, result);
  5121. IF conditional THEN
  5122. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5123. ValueToCondition(result)
  5124. END;
  5125. END;
  5126. END;
  5127. currentMapper := prevMapper;
  5128. currentInlineExit := prevInlineExit;
  5129. currentIsInline := wasInline;
  5130. RETURN ~tooComplex
  5131. END InlineProcedureCall;
  5132. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5133. VAR
  5134. parameters: SyntaxTree.ExpressionList;
  5135. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5136. designator: SyntaxTree.Designator;
  5137. procedureType: SyntaxTree.ProcedureType;
  5138. formalParameter: SyntaxTree.Parameter;
  5139. operand, returnValue: Operand;
  5140. reg, size, mask, dest: IntermediateCode.Operand;
  5141. saved,saved2: RegisterEntry;
  5142. symbol: SyntaxTree.Symbol;
  5143. variable: SyntaxTree.Variable;
  5144. i, parametersSize, returnTypeSize : LONGINT;
  5145. structuredReturnType: BOOLEAN;
  5146. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5147. tempVariableDesignator: SyntaxTree.Designator;
  5148. gap, alignment: LONGINT; (*fld*)
  5149. (* TODO: remove unnecessary backup variables *)
  5150. oldResult: Operand;
  5151. oldCurrentScope: SyntaxTree.Scope;
  5152. oldArrayDestinationTag: IntermediateCode.Operand;
  5153. oldArrayDestinationDimension: LONGINT;
  5154. oldConstantDeclaration: SyntaxTree.Symbol;
  5155. oldDestination: IntermediateCode.Operand;
  5156. oldCurrentLoop: Label;
  5157. oldConditional: BOOLEAN;
  5158. oldTrueLabel, oldFalseLabel: Label;
  5159. oldLocked: BOOLEAN;
  5160. usedRegisters,oldUsedRegisters: RegisterEntry;
  5161. return: IntermediateCode.Operand;
  5162. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5163. arg: IntermediateCode.Operand;
  5164. dummy: IntermediateCode.Operand;
  5165. recordType: SyntaxTree.RecordType;
  5166. operatorSelectionProcedureOperand: Operand;
  5167. operatorSelectionProcedure: SyntaxTree.Procedure;
  5168. fingerPrint: SyntaxTree.FingerPrint;
  5169. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5170. identifierNumber: LONGINT;
  5171. parameterRegisters: SIZE;
  5172. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5173. procedure: SyntaxTree.Procedure;
  5174. callingConvention: SyntaxTree.CallingConvention;
  5175. PROCEDURE BackupGlobalState;
  5176. BEGIN
  5177. oldResult := result;
  5178. oldCurrentScope := currentScope;
  5179. oldArrayDestinationTag := arrayDestinationTag;
  5180. oldArrayDestinationDimension := arrayDestinationDimension;
  5181. oldConstantDeclaration := constantDeclaration;
  5182. oldDestination := destination;
  5183. oldCurrentLoop := currentLoop;
  5184. oldConditional := conditional;
  5185. oldTrueLabel := trueLabel;
  5186. oldFalseLabel := falseLabel;
  5187. oldLocked := locked;
  5188. oldUsedRegisters := usedRegisters
  5189. END BackupGlobalState;
  5190. PROCEDURE RestoreGlobalState;
  5191. BEGIN
  5192. result := oldResult;
  5193. currentScope := oldCurrentScope;
  5194. arrayDestinationTag := oldArrayDestinationTag;
  5195. arrayDestinationDimension := oldArrayDestinationDimension;
  5196. constantDeclaration := oldConstantDeclaration;
  5197. destination := oldDestination;
  5198. currentLoop := oldCurrentLoop;
  5199. conditional := oldConditional;
  5200. trueLabel := oldTrueLabel;
  5201. falseLabel := oldFalseLabel;
  5202. locked := oldLocked;
  5203. usedRegisters := oldUsedRegisters
  5204. END RestoreGlobalState;
  5205. (** do preparations before parameter push for array-structured object types (ASOTs):
  5206. if ASOT is passed as VAR parameter:
  5207. - allocate temporary variable of math array type
  5208. - copy contents of ASOT to be passed to temporary variable
  5209. - use temporary variable as the actual parameter instead
  5210. - 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)
  5211. **)
  5212. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5213. VAR
  5214. expression: SyntaxTree.Expression;
  5215. BEGIN
  5216. IF actualParameter IS SyntaxTree.Designator THEN
  5217. designator := actualParameter(SyntaxTree.Designator);
  5218. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5219. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5220. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5221. ASSERT(checker # NIL);
  5222. checker.SetCurrentScope(currentScope);
  5223. (* allocate temporary variable *)
  5224. ASSERT(actualParameter.type # NIL);
  5225. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5226. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5227. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5228. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5229. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5230. ASSERT(tempVariableDesignator.type # NIL);
  5231. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5232. (* copy math array stored in actual parameter to temporary variable *)
  5233. BackupGlobalState;
  5234. AssignMathArray(tempVariableDesignator, actualParameter);
  5235. RestoreGlobalState;
  5236. (* use temporary variable as actual parameter instead of the original one *)
  5237. actualParameter := tempVariableDesignator;
  5238. (* create write-back call and store it in linked list *)
  5239. (* create new list entry *)
  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.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5249. ASSERT(expression.type = NIL);
  5250. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5251. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5252. (* prepare writeback for any other "normal" indexer *)
  5253. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5254. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5255. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5256. Assign(tempVariableDesignator, actualParameter);
  5257. actualParameter := tempVariableDesignator;
  5258. IF firstWriteBackCall = NIL THEN
  5259. NEW(firstWriteBackCall);
  5260. currentWriteBackCall := firstWriteBackCall
  5261. ELSE
  5262. ASSERT(currentWriteBackCall # NIL);
  5263. NEW(currentWriteBackCall.next);
  5264. currentWriteBackCall := currentWriteBackCall.next
  5265. END;
  5266. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5267. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5268. END
  5269. END
  5270. END PrepareParameter;
  5271. BEGIN
  5272. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5273. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5274. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5275. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5276. IF InlineProcedureCall(x) THEN
  5277. RETURN
  5278. ELSE
  5279. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5280. END
  5281. END;
  5282. END;
  5283. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5284. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5285. callingConvention := procedureType.callingConvention;
  5286. dest := destination; destination := emptyOperand;
  5287. SaveRegisters();ReleaseUsedRegisters(saved);
  5288. parameters := x.parameters;
  5289. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5290. (* an operator is called *)
  5291. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5292. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5293. (* check if a dynamic operator call should be performed *)
  5294. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5295. ELSE
  5296. isCallOfDynamicOperator := FALSE
  5297. END;
  5298. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5299. Emit(Push(position, ap));
  5300. END;
  5301. alignment := procedureType.stackAlignment;
  5302. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5303. alignment := 16 (* bytes *);
  5304. END;
  5305. IF alignment > 1 THEN
  5306. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5307. Emit(Mov(position,reg, sp));
  5308. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5309. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5310. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5311. gap := 4*ToMemoryUnits(system,system.addressSize);
  5312. END;
  5313. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5314. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5315. IF gap < 0 THEN
  5316. gap := 0
  5317. END;
  5318. ELSE
  5319. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5320. END;
  5321. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5322. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5323. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5324. Emit(And(position,sp, sp, mask));
  5325. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5326. Emit(Push(position,reg));
  5327. ReleaseIntermediateOperand(reg);
  5328. END;
  5329. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5330. (* align stack to 16-byte boundary *)
  5331. IntermediateCode.InitImmediate(mask,addressType,-16);
  5332. Emit(And(position,sp, sp, mask));
  5333. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5334. IF gap # 0 THEN
  5335. IntermediateCode.InitImmediate(size,addressType,gap);
  5336. Emit(Sub(position,sp,sp,size))
  5337. END;
  5338. END;
  5339. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5340. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5341. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5342. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5343. ELSE
  5344. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5345. END;
  5346. Evaluate(x.left, operand);
  5347. IF symbol IS SyntaxTree.Procedure THEN
  5348. IF (procedureType.selfParameter # NIL) THEN
  5349. Emit(Push(position,operand.tag));
  5350. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5351. Emit(Push(position,operand.tag));
  5352. ELSIF (procedureType.isDelegate) THEN
  5353. Emit(Push(position,operand.tag));
  5354. END;
  5355. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5356. IF (procedureType.selfParameter # NIL) THEN
  5357. Emit(Push(position,operand.tag));
  5358. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5359. Emit(Push(position,operand.tag));
  5360. END;
  5361. ELSE HALT(200);
  5362. END;
  5363. ReleaseIntermediateOperand(operand.tag);
  5364. operand.tag := emptyOperand;
  5365. (* determine if a structured return type is needed *)
  5366. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5367. IF structuredReturnType THEN
  5368. IF resultDesignator # NIL THEN
  5369. d := resultDesignator;
  5370. ELSE
  5371. (* temporary result that might be allocated, must potentially be traced *)
  5372. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5373. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5374. d.SetType(variable.type);
  5375. END;
  5376. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5377. Designate(d,returnValue);
  5378. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5379. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5380. Emit(Push(position,size));
  5381. Emit(Push(position,returnValue.op));
  5382. ReleaseOperand(returnValue);
  5383. ELSE*)
  5384. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5385. (*
  5386. END;
  5387. *)
  5388. END;
  5389. firstWriteBackCall := NIL; (* reset write-back call list *)
  5390. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5391. parameterRegisters := backend.NumberParameterRegisters(callingConvention);
  5392. passByRegister := parameterRegisters > 0;
  5393. registerNumber := 0;
  5394. formalParameter := procedureType.lastParameter;
  5395. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5396. actualParameter := parameters.GetExpression(i);
  5397. PrepareParameter(actualParameter, formalParameter);
  5398. IF passByRegister & (i < parameterRegisters) THEN
  5399. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5400. Error(actualParameter.position,"cannot be passed by register")
  5401. ELSE
  5402. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5403. END;
  5404. INC(registerNumber);
  5405. ELSE
  5406. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5407. END;
  5408. formalParameter := formalParameter.prevParameter;
  5409. END;
  5410. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) THEN
  5411. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5412. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5413. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5414. END;
  5415. ELSE
  5416. hasDynamicOperands := FALSE;
  5417. formalParameter := procedureType.firstParameter;
  5418. FOR i := 0 TO parameters.Length() - 1 DO
  5419. actualParameter := parameters.GetExpression(i);
  5420. IF formalParameter # NIL THEN (* TENTATIVE *)
  5421. PrepareParameter(actualParameter, formalParameter);
  5422. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5423. ASSERT(i < 2);
  5424. hasDynamicOperands := TRUE;
  5425. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5426. ELSE
  5427. IF passByRegister & (registerNumber > 0) THEN
  5428. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5429. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5430. END;
  5431. passByRegister := FALSE;
  5432. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5433. END;
  5434. formalParameter := formalParameter.nextParameter;
  5435. END;
  5436. END;
  5437. END;
  5438. IF symbol IS SyntaxTree.Procedure THEN
  5439. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5440. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5441. Emit(Push(position,reg));
  5442. ReleaseIntermediateOperand(reg);
  5443. END;
  5444. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5445. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5446. parametersSize := ParametersSize(system,procedureType, FALSE);
  5447. END;
  5448. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5449. (*
  5450. dynamic operator overloading:
  5451. first push parameters, regularly:
  5452. [self]
  5453. par1
  5454. par2
  5455. then push parameters for GetOperator
  5456. identifier
  5457. ptr1
  5458. tag
  5459. ptr2
  5460. tag
  5461. call GetOperatorRuntimeProc
  5462. call Operator
  5463. *)
  5464. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5465. (* push ID *)
  5466. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5467. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5468. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5469. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5470. formalParameter := procedureType.firstParameter;
  5471. FOR i := 0 TO parameters.Length() - 1 DO
  5472. IF formalParameter.access # SyntaxTree.Hidden THEN
  5473. ASSERT(i < 2);
  5474. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5475. (* push pointer *)
  5476. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5477. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5478. (* add dereference *)
  5479. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5480. (*! better: do refer to stack above than using parameter backups !!*)
  5481. ReleaseIntermediateOperand(parameterBackups[i]);
  5482. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5483. END;
  5484. Emit(Push(position,parameterBackups[i]));
  5485. ReleaseIntermediateOperand(parameterBackups[i]);
  5486. (* push typetag *)
  5487. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5488. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5489. arg := TypeDescriptorAdr(recordType);
  5490. Emit(Push(position,arg));
  5491. ELSE
  5492. (* push 'NonPointer' *)
  5493. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5494. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5495. (* push fingerprint *)
  5496. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5497. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5498. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5499. END
  5500. END;
  5501. formalParameter := formalParameter.nextParameter
  5502. END;
  5503. (* for unary operators: complete the information for the second parameter *)
  5504. IF procedureType.numberParameters < 2 THEN
  5505. (* push 'NonPointer' *)
  5506. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5507. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5508. (* push 'NoType' *)
  5509. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5510. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5511. END;
  5512. (* call operator selection procedure *)
  5513. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5514. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5515. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5516. ReleaseOperand(operatorSelectionProcedureOperand);
  5517. (* use the address that the operator selection procedure returned as the target address of the call *)
  5518. InitOperand(operand, ModeValue);
  5519. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5520. Emit(Result(position,operand.op))
  5521. END
  5522. END;
  5523. ReleaseParameterRegisters();
  5524. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5525. SaveRegisters();ReleaseUsedRegisters(saved2);
  5526. CallThis(position,"Objects","LeaveA2",0);
  5527. RestoreRegisters(saved2);
  5528. END;
  5529. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5530. Emit(Call(position,operand.op,0));
  5531. ELSE
  5532. Emit(Call(position,operand.op,parametersSize));
  5533. END;
  5534. ReleaseOperand(operand);
  5535. IF procedureType.noReturn THEN
  5536. EmitTrap(position,NoReturnTrap);
  5537. END;
  5538. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5539. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5540. Emit(Result(position,return));
  5541. END;
  5542. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5543. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5544. Emit(Push(position, return));
  5545. CallThis(position,"Objects","ReenterA2",0);
  5546. Emit(Pop(position, return));
  5547. ELSE
  5548. CallThis(position,"Objects","ReenterA2",0);
  5549. END;
  5550. END;
  5551. (* === return parameter space === *)
  5552. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5553. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5554. (* cleanup all space for all parameters *)
  5555. IF parametersSize < 32 THEN
  5556. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5557. parametersSize := 32
  5558. END;
  5559. size := IntermediateCode.Immediate(addressType,parametersSize);
  5560. Emit(Add(position,sp,sp,size))
  5561. END;
  5562. IF (callingConvention IN SysvABI) THEN
  5563. IF passByRegister THEN
  5564. IF parameters.Length() > parameterRegisters THEN
  5565. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5566. ELSE
  5567. parametersSize := 0
  5568. END;
  5569. ELSE
  5570. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5571. INC( parametersSize, (-parametersSize) MOD 16 )
  5572. END;
  5573. IF parametersSize > 0 THEN
  5574. size := IntermediateCode.Immediate(addressType,parametersSize);
  5575. Emit(Add(position,sp,sp,size))
  5576. END;
  5577. END;
  5578. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5579. IF structuredReturnType THEN
  5580. (* stack pointer rewinding done by callee
  5581. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5582. Emit(Add(position,sp,sp,size));
  5583. *)
  5584. RestoreRegisters(saved);
  5585. InitOperand(result,ModeReference);
  5586. Symbol(variable,result);
  5587. ELSE
  5588. RestoreRegisters(saved);
  5589. InitOperand(result,ModeValue);
  5590. result.op := return;
  5591. END;
  5592. END;
  5593. IF alignment > 1 THEN
  5594. Emit(Pop(position,sp));
  5595. END;
  5596. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5597. Emit(Pop(position, ap));
  5598. END;
  5599. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5600. ValueToCondition(result);
  5601. END;
  5602. destination := dest;
  5603. (* perform all write-back calls in the list *)
  5604. BackupGlobalState;
  5605. currentWriteBackCall := firstWriteBackCall;
  5606. WHILE currentWriteBackCall # NIL DO
  5607. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5608. currentWriteBackCall := currentWriteBackCall.next
  5609. END;
  5610. RestoreGlobalState;
  5611. (* TENATIVE *)
  5612. (*
  5613. IF isOperatorCall THEN
  5614. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5615. END;
  5616. *)
  5617. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5618. END VisitProcedureCallDesignator;
  5619. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5620. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5621. td: SyntaxTree.Symbol;
  5622. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5623. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5624. BEGIN
  5625. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5626. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5627. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5628. variable.SetType(system.anyType);
  5629. scope.AddVariable(variable);
  5630. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5631. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5632. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5633. typeDeclaration.SetScope(module.module.moduleScope);
  5634. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5635. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5636. END;
  5637. RETURN hiddenPointerType;
  5638. END GetHiddenPointerType;
  5639. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5640. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5641. BEGIN
  5642. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5643. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5644. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5645. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5646. scope.AddVariable(variable);
  5647. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5648. variable.SetType(system.anyType);
  5649. scope.AddVariable(variable);
  5650. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5651. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5652. typeDeclaration.SetDeclaredType(delegatePointerType);
  5653. typeDeclaration.SetScope(module.module.moduleScope);
  5654. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5655. delegatePointerType.SetState(SyntaxTree.Resolved);
  5656. END;
  5657. RETURN delegatePointerType
  5658. END GetDelegateType;
  5659. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5660. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5661. such as in VAR a: RECORD ... END;
  5662. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5663. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5664. *)
  5665. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5666. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5667. BEGIN (* no code emission *)
  5668. source := NIL;
  5669. x := x.resolved;
  5670. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5671. x := GetHiddenPointerType();
  5672. ELSIF IsDelegate(x) THEN
  5673. x := GetDelegateType();
  5674. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5675. ELSE HALT(200);
  5676. END;
  5677. td := x.typeDeclaration;
  5678. IF td = NIL THEN
  5679. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5680. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5681. ASSERT(td # NIL);
  5682. END;
  5683. GetCodeSectionNameForSymbol(td,name);
  5684. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5685. meta.CheckTypeDeclaration(x);
  5686. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5687. ELSE
  5688. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5689. END;
  5690. IF backend.cooperative OR meta.simple THEN
  5691. offset := 0;
  5692. ELSE
  5693. IF x IS SyntaxTree.CellType THEN
  5694. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5695. IF baseRecord = NIL THEN
  5696. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5697. ELSE
  5698. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5699. END;
  5700. ELSE
  5701. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5702. END;
  5703. END;
  5704. RETURN td
  5705. END GetBackendType;
  5706. BEGIN
  5707. (*td := t.typeDeclaration;*)
  5708. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5709. (*
  5710. IF t IS SyntaxTree.PointerType THEN
  5711. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5712. ELSE
  5713. source := GetBackendType(t);
  5714. END;
  5715. *)
  5716. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5717. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5718. IntermediateCode.SetOffset(res,offset);
  5719. (*
  5720. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5721. make memory should be used when tag is used, not earlier
  5722. *)
  5723. RETURN res
  5724. END TypeDescriptorAdr;
  5725. (*
  5726. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5727. VAR result: IntermediateCode.Operand;
  5728. BEGIN
  5729. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5730. operand.tag := TypeDescriptorAdr(operand.type);
  5731. IntermediateCode.MakeMemory(operand.tag,addressType);
  5732. UseIntermediateOperand(operand.tag);
  5733. END;
  5734. END MakeTypeTag;
  5735. *)
  5736. PROCEDURE ProfilerInit;
  5737. VAR reg: IntermediateCode.Operand;
  5738. BEGIN
  5739. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5740. Emit(Call(position,reg,0));
  5741. END ProfilerInit;
  5742. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5743. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5744. BEGIN
  5745. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5746. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5747. THEN
  5748. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5749. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5750. Emit(Push(position,reg));
  5751. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5752. Emit(Push(position,reg));
  5753. StaticCallOperand(result,procedure);
  5754. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5755. ReleaseOperand(result);
  5756. END;
  5757. END ProfilerEnterExit;
  5758. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5759. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5760. BEGIN
  5761. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5762. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5763. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5764. profileInit.Emit(Push(position,reg));
  5765. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5766. profileInit.Emit(Push(position,reg));
  5767. NEW(string, LEN(name)); COPY(name, string^);
  5768. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5769. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5770. sv.SetType(type);
  5771. Designate(sv,result);
  5772. profileInit.Emit(Push(position,result.tag));
  5773. profileInit.Emit(Push(position,result.op));
  5774. StaticCallOperand(result,procedure);
  5775. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5776. ReleaseOperand(result);
  5777. END;
  5778. END ProfilerAddProcedure;
  5779. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5780. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5781. BEGIN
  5782. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5783. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5784. profileInit.Emit(Push(position,reg));
  5785. profileInitPatchPosition := profileInit.pc;
  5786. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5787. NEW(string, LEN(name)); COPY(name, string^);
  5788. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5789. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5790. sv.SetType(type);
  5791. Designate(sv,result);
  5792. profileInit.Emit(Push(position,result.tag));
  5793. profileInit.Emit(Push(position,result.op));
  5794. StaticCallOperand(result,procedure);
  5795. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5796. ReleaseOperand(result);
  5797. END;
  5798. END ProfilerAddModule;
  5799. PROCEDURE ProfilerPatchInit;
  5800. VAR reg: IntermediateCode.Operand;
  5801. BEGIN
  5802. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5803. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5804. EmitLeave(profileInit,position,NIL,0);
  5805. profileInit.Emit(Exit(position,0,0,0));
  5806. END ProfilerPatchInit;
  5807. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5808. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5809. VAR
  5810. id: LONGINT;
  5811. leftType, rightType: SyntaxTree.Type;
  5812. procedureType: SyntaxTree.ProcedureType;
  5813. runtimeProcedure: SyntaxTree.Procedure;
  5814. runtimeProcedureOperand, operatorOperand: Operand;
  5815. kind: SET;
  5816. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5817. VAR
  5818. arg: IntermediateCode.Operand;
  5819. recordType: SyntaxTree.RecordType;
  5820. fingerPrint: SyntaxTree.FingerPrint;
  5821. BEGIN
  5822. IF type = NIL THEN
  5823. (* no type: push 'NoType' *)
  5824. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5825. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5826. ELSIF IsStrictlyPointerToRecord(type) THEN
  5827. (* pointer to record type: push typetag *)
  5828. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5829. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5830. arg := TypeDescriptorAdr(recordType);
  5831. ELSE
  5832. (* non-pointer to record type: push fingerprint *)
  5833. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5834. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5835. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5836. END;
  5837. operatorInitializationCodeSection.Emit(Push(position,arg))
  5838. END PushTypeInfo;
  5839. BEGIN
  5840. ASSERT(operatorInitializationCodeSection # NIL);
  5841. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5842. procedureType := operator.type(SyntaxTree.ProcedureType);
  5843. (* determine types *)
  5844. leftType := procedureType.firstParameter.type;
  5845. IF procedureType.numberParameters = 2 THEN
  5846. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5847. rightType := procedureType.firstParameter.nextParameter.type;
  5848. ELSE
  5849. rightType := NIL
  5850. END;
  5851. (* determine operator kind *)
  5852. IF IsStrictlyPointerToRecord(leftType) THEN
  5853. kind := {LhsIsPointer}
  5854. ELSE
  5855. kind := {}
  5856. END;
  5857. IF IsStrictlyPointerToRecord(rightType) THEN
  5858. kind := kind + {RhsIsPointer}
  5859. END;
  5860. IF kind # {} THEN (* TODO: to be removed later on *)
  5861. (* at least one of the types is a pointer to record *)
  5862. (* emit a code that registers this specific operator in the runtime *)
  5863. dump := operatorInitializationCodeSection.comments;
  5864. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5865. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5866. (* push ID *)
  5867. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5868. id := Global.GetSymbol(module.module.case, operator.name);
  5869. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5870. (* push kind *)
  5871. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5872. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5873. (* push type infos *)
  5874. PushTypeInfo(leftType);
  5875. PushTypeInfo(rightType);
  5876. (* push operator address *)
  5877. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5878. StaticCallOperand(operatorOperand, operator);
  5879. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5880. ReleaseOperand(operatorOperand);
  5881. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5882. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5883. ReleaseOperand(runtimeProcedureOperand)
  5884. END
  5885. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5886. END
  5887. END RegisterDynamicOperator;
  5888. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5889. VAR
  5890. traceModule: SyntaxTree.Module;
  5891. procedure: SyntaxTree.Procedure;
  5892. procedureVariable: SyntaxTree.Variable;
  5893. s,msg: Basic.MessageString;
  5894. res: Operand;
  5895. i: LONGINT;
  5896. sv: SyntaxTree.StringValue;
  5897. type: SyntaxTree.Type;
  5898. recordType: SyntaxTree.RecordType;
  5899. printout: Printout.Printer;
  5900. stringWriter: Streams.StringWriter;
  5901. expression: SyntaxTree.Expression;
  5902. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5903. BEGIN
  5904. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5905. IF procedure = NIL THEN
  5906. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5907. END;
  5908. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5909. s := "procedure ";
  5910. Strings.Append(s,backend.traceModuleName);
  5911. Strings.Append(s,".");
  5912. Strings.Append(s,procedureName);
  5913. Strings.Append(s," not present");
  5914. Error(position,s);
  5915. RETURN FALSE
  5916. ELSE
  5917. RETURN TRUE
  5918. END;
  5919. END GetProcedure;
  5920. PROCEDURE CallProcedure;
  5921. VAR size: LONGINT;
  5922. BEGIN
  5923. IF procedure # NIL THEN
  5924. StaticCallOperand(result,procedure);
  5925. size := ProcParametersSize(procedure);
  5926. ELSE
  5927. Symbol(procedureVariable, result);
  5928. LoadValue(result, procedureVariable.type.resolved);
  5929. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5930. END;
  5931. Emit(Call(position,result.op,size));
  5932. END CallProcedure;
  5933. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5934. VAR res: Operand; string: SyntaxTree.String;
  5935. BEGIN
  5936. IF GetProcedure("String") THEN
  5937. NEW(string, LEN(s)); COPY(s, string^);
  5938. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5939. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5940. sv.SetType(type);
  5941. Designate(sv,res);
  5942. Emit(Push(position,res.tag));
  5943. Emit(Push(position,res.op));
  5944. ReleaseOperand(res);
  5945. CallProcedure;
  5946. END;
  5947. END String;
  5948. PROCEDURE Integer(op: IntermediateCode.Operand);
  5949. BEGIN
  5950. IF GetProcedure("Int") THEN
  5951. Emit(Push(position,op));
  5952. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5953. CallProcedure;
  5954. END;
  5955. END Integer;
  5956. PROCEDURE Float(op: IntermediateCode.Operand);
  5957. BEGIN
  5958. IF GetProcedure("HIntHex") THEN
  5959. Emit(Push(position,op));
  5960. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5961. CallProcedure;
  5962. END;
  5963. END Float;
  5964. PROCEDURE Set(op: IntermediateCode.Operand);
  5965. BEGIN
  5966. IF GetProcedure("Set") THEN
  5967. Emit(Push(position,op));
  5968. (*
  5969. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5970. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5971. *)
  5972. CallProcedure;
  5973. END;
  5974. END Set;
  5975. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5976. BEGIN
  5977. IF GetProcedure("Boolean") THEN
  5978. Emit(Push(position,op));
  5979. CallProcedure;
  5980. END;
  5981. END Boolean;
  5982. PROCEDURE Char(op: IntermediateCode.Operand);
  5983. BEGIN
  5984. IF GetProcedure("Char") THEN
  5985. Emit(Push(position,op));
  5986. CallProcedure;
  5987. END;
  5988. END Char;
  5989. PROCEDURE Address(op: IntermediateCode.Operand);
  5990. BEGIN
  5991. IF GetProcedure("Address") THEN
  5992. Emit(Push(position,op));
  5993. CallProcedure;
  5994. END;
  5995. END Address;
  5996. PROCEDURE Size(op: IntermediateCode.Operand);
  5997. BEGIN
  5998. IF GetProcedure("Size") THEN
  5999. Emit(Push(position,op));
  6000. CallProcedure;
  6001. END;
  6002. END Size;
  6003. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6004. VAR len: IntermediateCode.Operand;
  6005. BEGIN
  6006. IF GetProcedure("String") THEN
  6007. len := GetArrayLength(type, op.tag);
  6008. Emit(Push(position,len));
  6009. ReleaseIntermediateOperand(len);
  6010. Emit(Push(position,op.op));
  6011. CallProcedure;
  6012. END;
  6013. END StringOperand;
  6014. PROCEDURE Ln;
  6015. BEGIN
  6016. IF GetProcedure("Ln") THEN
  6017. CallProcedure;
  6018. END;
  6019. END Ln;
  6020. BEGIN
  6021. IF backend.traceModuleName = "" THEN RETURN END;
  6022. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6023. IF GetProcedure("Enter") THEN
  6024. CallProcedure
  6025. END;
  6026. NEW(stringWriter,LEN(s));
  6027. FOR i := 0 TO x.Length()-1 DO
  6028. msg := "";
  6029. expression := x.GetExpression(i);
  6030. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6031. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6032. ELSE
  6033. Global.GetModuleName(module.module, s);
  6034. END;
  6035. IF i = 0 THEN
  6036. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6037. stringWriter.String(":");
  6038. END;
  6039. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6040. IF ~(expression IS SyntaxTree.StringValue) THEN
  6041. printout.Expression(expression);
  6042. stringWriter.Get(s);
  6043. Strings.Append(msg,s);
  6044. Strings.Append(msg,"= ");
  6045. ELSE stringWriter.Get(s); (* remove from string writer *)
  6046. Strings.Append(msg, s);
  6047. END;
  6048. String(msg);
  6049. IF SemanticChecker.IsStringType(expression.type) THEN
  6050. Designate(expression,res);
  6051. StringOperand(res, expression.type);
  6052. ELSE
  6053. Evaluate(expression,res);
  6054. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6055. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6056. Convert(res.op,int64);
  6057. END;
  6058. Integer(res.op);
  6059. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6060. Boolean(res.op);
  6061. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6062. Set(res.op);
  6063. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6064. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6065. Convert(res.op,float64);
  6066. END;
  6067. Float(res.op);
  6068. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6069. Char(res.op);
  6070. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6071. Address(res.op);String("H");
  6072. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6073. Size(res.op);
  6074. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6075. Address(res.op);String("H");
  6076. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6077. Address(res.op);String("H");
  6078. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6079. String("NIL");
  6080. ELSE HALT(200);
  6081. END;
  6082. END;
  6083. ReleaseOperand(res);
  6084. String("; ");
  6085. END;
  6086. IF GetProcedure("Exit") THEN
  6087. CallProcedure
  6088. ELSE
  6089. Ln;
  6090. END;
  6091. END;
  6092. END SystemTrace;
  6093. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6094. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6095. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6096. BEGIN
  6097. type := type.resolved;
  6098. IF type IS SyntaxTree.RecordType THEN
  6099. WITH type: SyntaxTree.RecordType DO
  6100. baseType := type.baseType;
  6101. IF baseType # NIL THEN
  6102. baseType := baseType.resolved;
  6103. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6104. InitFields(baseType,adr,offset);
  6105. END;
  6106. variable := type.recordScope.firstVariable;
  6107. WHILE variable # NIL DO
  6108. IF variable.initializer # NIL THEN
  6109. Evaluate(variable.initializer,initializerOp);
  6110. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6111. Emit(Mov(position,mem,initializerOp.op));
  6112. ReleaseOperand(initializerOp);
  6113. ReleaseIntermediateOperand(mem);
  6114. END;
  6115. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6116. variable := variable.nextVariable
  6117. END;
  6118. END;
  6119. ELSIF type IS SyntaxTree.CellType THEN
  6120. WITH type: SyntaxTree.CellType DO
  6121. baseType := type.baseType;
  6122. IF baseType # NIL THEN
  6123. baseType := baseType.resolved;
  6124. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6125. InitFields(baseType,adr,offset);
  6126. END;
  6127. variable := type.cellScope.firstVariable;
  6128. WHILE variable # NIL DO
  6129. IF variable.initializer # NIL THEN
  6130. Evaluate(variable.initializer,initializerOp);
  6131. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6132. Emit(Mov(position,mem,initializerOp.op));
  6133. ReleaseOperand(initializerOp);
  6134. ReleaseIntermediateOperand(mem);
  6135. END;
  6136. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6137. variable := variable.nextVariable
  6138. END;
  6139. END;
  6140. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6141. WITH type: SyntaxTree.ArrayType DO
  6142. IF type.form = SyntaxTree.Static THEN
  6143. baseType := type.arrayBase;
  6144. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6145. FOR i := 0 TO type.staticLength-1 DO
  6146. InitFields(baseType,adr,offset+i*size);
  6147. END;
  6148. END;
  6149. END;
  6150. ELSIF type IS SyntaxTree.MathArrayType THEN
  6151. WITH type: SyntaxTree.MathArrayType DO
  6152. IF type.form = SyntaxTree.Open THEN
  6153. dim := DynamicDim(type);
  6154. imm := IntermediateCode.Immediate(addressType,dim);
  6155. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6156. baseType := SemanticChecker.ArrayBase(type,dim);
  6157. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6158. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6159. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6160. ReleaseIntermediateOperand(imm);
  6161. (* flags remain empty (=0) for open array *)
  6162. ELSIF type.form = SyntaxTree.Static THEN
  6163. baseType := type.arrayBase;
  6164. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6165. ASSERT(type.staticLength < 1024*1024*1024);
  6166. FOR i := 0 TO type.staticLength-1 DO
  6167. InitFields(baseType,adr,offset+i*size);
  6168. END;
  6169. END;
  6170. END;
  6171. END;
  6172. END InitFields;
  6173. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6174. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6175. saved: RegisterEntry;
  6176. BEGIN
  6177. type := variable.type.resolved;
  6178. IF (type IS SyntaxTree.MathArrayType) THEN
  6179. WITH type: SyntaxTree.MathArrayType DO
  6180. IF type.form = SyntaxTree.Open THEN
  6181. Symbol(variable,operand);
  6182. InitFields(type, operand.tag,0);
  6183. IF temporary THEN
  6184. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6185. END;
  6186. ELSIF type.form = SyntaxTree.Tensor THEN
  6187. IF temporary & backend.writeBarriers THEN
  6188. SaveRegisters();ReleaseUsedRegisters(saved);
  6189. Symbol(variable, operand);
  6190. Emit(Push(position,operand.op));
  6191. ReleaseOperand(operand);
  6192. Emit(Push(position,nil));
  6193. CallThis(position,"FoxArrayBase","Assign",2);
  6194. RestoreRegisters(saved);
  6195. ELSE
  6196. Symbol(variable, operand);
  6197. MakeMemory(tmp,operand.op,addressType,0);
  6198. ReleaseOperand(operand);
  6199. IF FALSE & temporary THEN
  6200. (* trick -- temporary object from array base *)
  6201. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6202. Symbol(symbol,operand);
  6203. MakeMemory(mem,operand.op,addressType,0);
  6204. ReleaseOperand(operand);
  6205. Emit(Mov(position,tmp, mem) );
  6206. ReleaseOperand(operand);
  6207. ELSE
  6208. Emit(Mov(position,tmp, nil ) );
  6209. END;
  6210. ReleaseIntermediateOperand(tmp)
  6211. END;
  6212. END;
  6213. END;
  6214. ELSE
  6215. Symbol(variable,operand);
  6216. IF variable.initializer # NIL THEN
  6217. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6218. reference.SetType(variable.type.resolved);
  6219. reference.SetAssignable(TRUE);
  6220. Assign(reference,variable.initializer);
  6221. ELSIF temporary THEN
  6222. IF SemanticChecker.IsPointerType(variable.type) THEN
  6223. IF backend.cooperative THEN
  6224. SaveRegisters();ReleaseUsedRegisters(saved);
  6225. Symbol(variable, operand);
  6226. CallAssignPointer(operand.op, nil);
  6227. ReleaseOperand(operand);
  6228. RestoreRegisters(saved);
  6229. ELSIF backend.writeBarriers THEN
  6230. SaveRegisters();ReleaseUsedRegisters(saved);
  6231. Symbol(variable, operand);
  6232. Emit(Push(position,operand.op));
  6233. ReleaseOperand(operand);
  6234. Emit(Push(position,nil));
  6235. CallThis(position,"Heaps","Assign",2);
  6236. RestoreRegisters(saved);
  6237. ELSE
  6238. Symbol(variable, operand);
  6239. MakeMemory(tmp,operand.op,addressType,0);
  6240. ReleaseOperand(operand);
  6241. Emit(Mov(position,tmp, nil ) );
  6242. ReleaseIntermediateOperand(tmp);
  6243. END;
  6244. END;
  6245. END;
  6246. InitFields(type, operand.op,0);
  6247. ReleaseOperand(operand);
  6248. END;
  6249. END InitVariable;
  6250. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6251. VAR end: Label;
  6252. BEGIN
  6253. IF type.form = SyntaxTree.Tensor THEN
  6254. InitOperand(result,ModeValue);
  6255. ReuseCopy(result.op,base);
  6256. end := NewLabel();
  6257. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6258. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6259. SetLabel(end);
  6260. Convert(result.op,lenType);
  6261. ELSE
  6262. InitOperand(result,ModeValue);
  6263. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6264. END
  6265. END MathArrayDim;
  6266. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6267. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6268. BEGIN
  6269. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6270. MakeMemory(mem,base,addressType,offset);
  6271. Emit(Mov(position,mem,value));
  6272. ReleaseIntermediateOperand(mem);
  6273. END PutMathArrayField;
  6274. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6275. VAR mem: IntermediateCode.Operand;
  6276. BEGIN
  6277. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6278. MakeMemory(mem,base,addressType,offset);
  6279. Emit(Mov(position,mem,value));
  6280. ReleaseIntermediateOperand(mem);
  6281. END PutMathArrayFieldOffset;
  6282. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6283. BEGIN
  6284. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6285. MakeMemory(value,base,addressType,offset);
  6286. END GetMathArrayField;
  6287. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6288. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6289. BEGIN
  6290. IF incr THEN
  6291. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6292. ELSE
  6293. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6294. END;
  6295. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6296. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6297. ELSE
  6298. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6299. Emit(Mov(position,reg,dim));
  6300. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6301. Emit(Add(position,reg,reg,base));
  6302. MakeMemory(mem, reg, addressType, offset);
  6303. ReleaseIntermediateOperand(reg);
  6304. Emit(Mov(position,mem,value));
  6305. ReleaseIntermediateOperand(mem);
  6306. END;
  6307. END PutMathArrayLenOrIncr;
  6308. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6309. BEGIN
  6310. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6311. END PutMathArrayLength;
  6312. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6313. BEGIN
  6314. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6315. END PutMathArrayIncrement;
  6316. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6317. BEGIN
  6318. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6319. END GetMathArrayIncrement;
  6320. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6321. BEGIN
  6322. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6323. END GetMathArrayLength;
  6324. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6325. VAR dimOp: IntermediateCode.Operand;
  6326. BEGIN
  6327. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6328. GetMathArrayLength(type, operand, dimOp, check, result);
  6329. END GetMathArrayLengthAt;
  6330. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6331. VAR dimOp: IntermediateCode.Operand;
  6332. BEGIN
  6333. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6334. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6335. END GetMathArrayIncrementAt;
  6336. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6337. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6338. offset: LONGINT;
  6339. BEGIN
  6340. IF increment THEN
  6341. offset := MathIncrOffset;
  6342. ELSE
  6343. offset := MathLenOffset;
  6344. END;
  6345. INC(offset,operand.dimOffset*2);
  6346. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6347. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6348. END;
  6349. (* static dimension *)
  6350. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6351. IF check & (type.form = SyntaxTree.Tensor) THEN
  6352. DimensionCheck(operand.tag,dim,BrltL);
  6353. END;
  6354. val := SHORT(dim.intValue);
  6355. IF type.form # SyntaxTree.Tensor THEN
  6356. t := SemanticChecker.ArrayBase(type,val);
  6357. type := t.resolved(SyntaxTree.MathArrayType);
  6358. IF type.form = SyntaxTree.Static THEN
  6359. IF increment THEN
  6360. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6361. ELSE
  6362. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6363. END;
  6364. InitOperand(result,ModeValue);
  6365. result.op := res;
  6366. RETURN;
  6367. END;
  6368. END;
  6369. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6370. MakeMemory(res,operand.tag,addressType,offset);
  6371. (*
  6372. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6373. *)
  6374. InitOperand(result,ModeValue);
  6375. result.op := res;
  6376. ELSE
  6377. Convert(dim,addressType);
  6378. IF check THEN
  6379. IF type.form = SyntaxTree.Tensor THEN
  6380. DimensionCheck(operand.tag,dim,BrltL);
  6381. ELSIF isUnchecked THEN (* do nothing *)
  6382. ELSE
  6383. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6384. END;
  6385. END;
  6386. end := NewLabel(); next := NIL;
  6387. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6388. Emit(Mov(position,res,dim));
  6389. Convert(res,sizeType);
  6390. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6391. WHILE t IS SyntaxTree.MathArrayType DO
  6392. type := t(SyntaxTree.MathArrayType);
  6393. IF type.form = SyntaxTree.Static THEN
  6394. imm := IntermediateCode.Immediate(sizeType,val);
  6395. next := NewLabel();
  6396. BrneL(next,imm,res);
  6397. IF increment THEN
  6398. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6399. ELSE
  6400. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6401. END;
  6402. Emit(MovReplace(position,res,imm));
  6403. BrL(end);
  6404. ELSE hasDynamicPart := TRUE;
  6405. END;
  6406. t := type.arrayBase.resolved;
  6407. val := val + 1;
  6408. IF next # NIL THEN SetLabel(next) END;
  6409. END;
  6410. IF hasDynamicPart THEN
  6411. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6412. Emit(Mov(position,res2,dim));
  6413. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6414. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6415. Emit(Add(position,res2,res2,imm));
  6416. Emit(Add(position,res2,res2,operand.tag));
  6417. IntermediateCode.MakeMemory(res2,sizeType);
  6418. Emit(MovReplace(position,res,res2));
  6419. ReleaseIntermediateOperand(res2);
  6420. END;
  6421. SetLabel(end);
  6422. Convert(res,sizeType);
  6423. InitOperand(result,ModeValue);
  6424. result.op := res;
  6425. END;
  6426. END MathArrayLenOrIncr;
  6427. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6428. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6429. offset: LONGINT;
  6430. BEGIN
  6431. offset := operand.dimOffset+DynamicDim(type)-1;
  6432. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6433. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6434. val := SHORT(dim.intValue);
  6435. t := SemanticChecker.ArrayBase(type,val);
  6436. type := t.resolved(SyntaxTree.ArrayType);
  6437. IF type.form = SyntaxTree.Static THEN
  6438. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6439. ELSE
  6440. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6441. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6442. END;
  6443. UseIntermediateOperand(res);
  6444. InitOperand(result,ModeValue);
  6445. result.op := res;
  6446. ELSE
  6447. Convert(dim,addressType);
  6448. IF ~isUnchecked THEN
  6449. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6450. END;
  6451. end := NewLabel(); next := NIL;
  6452. (* ReuseCopy(dim,res); *)
  6453. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6454. Emit(Mov(position,res,dim));
  6455. Convert(res,sizeType);
  6456. Convert(res,sizeType);
  6457. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6458. WHILE t IS SyntaxTree.ArrayType DO
  6459. type := t(SyntaxTree.ArrayType);
  6460. IF type.form = SyntaxTree.Static THEN
  6461. imm := IntermediateCode.Immediate(sizeType,val);
  6462. next := NewLabel();
  6463. BrneL(next,imm,res);
  6464. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6465. Emit(MovReplace(position,res,imm));
  6466. BrL(end);
  6467. ELSE hasDynamicPart := TRUE;
  6468. END;
  6469. t := type.arrayBase.resolved;
  6470. val := val + 1;
  6471. IF next # NIL THEN SetLabel(next) END;
  6472. END;
  6473. IF hasDynamicPart THEN
  6474. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6475. Convert(res2,addressType);
  6476. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6477. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6478. Emit(Sub(position,res2,imm,res2));
  6479. Emit(Add(position,res2,res2,operand.tag));
  6480. IntermediateCode.MakeMemory(res2,sizeType);
  6481. Emit(MovReplace(position,res,res2));
  6482. ReleaseIntermediateOperand(res2);
  6483. END;
  6484. SetLabel(end);
  6485. Convert(res,sizeType);
  6486. InitOperand(result,ModeValue);
  6487. result.op := res;
  6488. END;
  6489. END ArrayLen;
  6490. (**
  6491. create a temporary variable in current scope
  6492. **)
  6493. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6494. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6495. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6496. BEGIN
  6497. IF ~register THEN
  6498. v := temporaries.GetFreeVariable(type, untraced, index);
  6499. ELSE
  6500. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6501. END;
  6502. scope := currentScope;
  6503. (*
  6504. v := NIL; (* disable free variable managemenet for the time being *)
  6505. *)
  6506. name := temporaries.GetUID();
  6507. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6508. variable.SetType(type);
  6509. variable.SetAccess(SyntaxTree.Hidden);
  6510. variable.SetUntraced(untraced);
  6511. IF v = NIL THEN
  6512. temporaries.AddVariable(variable);
  6513. IF ~register THEN
  6514. IF scope.lastVariable # NIL THEN
  6515. offset := scope.lastVariable.offsetInBits;
  6516. ELSE
  6517. offset := 0;
  6518. END;
  6519. DEC(offset,system.SizeOf(variable.type));
  6520. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6521. variable(SyntaxTree.Variable).SetOffset(offset);
  6522. scope.AddVariable(variable(SyntaxTree.Variable));
  6523. scope.EnterSymbol(variable, duplicate);
  6524. ASSERT(~duplicate);
  6525. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6526. ELSE
  6527. variable.SetUseRegister(TRUE);
  6528. variable(SyntaxTree.Variable).SetOffset(0);
  6529. END;
  6530. ELSE (* v # NIL *)
  6531. (* reuse slot for new variable, do not create new slot ! *)
  6532. temporaries.SetVariable(index, variable);
  6533. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6534. ASSERT(~register);
  6535. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6536. ASSERT(v.offsetInBits # 0);
  6537. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6538. scope.EnterSymbol(variable, duplicate);
  6539. ASSERT(~duplicate);
  6540. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6541. END;
  6542. RETURN variable(SyntaxTree.Variable)
  6543. END GetTemporaryVariable;
  6544. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6545. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6546. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6547. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6548. i: LONGINT; duplicate: BOOLEAN;
  6549. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6550. VAR variable: SyntaxTree.Variable;
  6551. BEGIN
  6552. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6553. variable.SetType(type);
  6554. recordScope.AddVariable(variable);
  6555. END AddVariable;
  6556. BEGIN
  6557. name := "@ArrayDescriptor";
  6558. Basic.AppendNumber(name,dimensions);
  6559. identifier := SyntaxTree.NewIdentifier(name);
  6560. parentScope := module.module.moduleScope;
  6561. symbol := parentScope.FindSymbol(identifier);
  6562. IF symbol # NIL THEN
  6563. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6564. type := typeDeclaration.declaredType;
  6565. ELSE
  6566. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6567. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6568. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6569. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6570. recordType.SetTypeDeclaration(typeDeclaration);
  6571. recordType.SetState(SyntaxTree.Resolved);
  6572. typeDeclaration.SetDeclaredType(recordType);
  6573. AddVariable("@ptr",system.anyType);
  6574. AddVariable("@adr",system.addressType);
  6575. AddVariable("@flags",system.addressType);
  6576. AddVariable("@dim",system.addressType);
  6577. AddVariable("@elementSize",system.addressType);
  6578. FOR i := 0 TO dimensions-1 DO
  6579. name := "@len";
  6580. Basic.AppendNumber(name,i);
  6581. AddVariable(name,system.addressType);
  6582. name := "@incr";
  6583. Basic.AppendNumber(name,i);
  6584. AddVariable(name,system.addressType);
  6585. END;
  6586. parentScope.AddTypeDeclaration(typeDeclaration);
  6587. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6588. ASSERT(~duplicate);
  6589. type := recordType;
  6590. END;
  6591. RETURN type
  6592. END GetMathArrayDescriptorType;
  6593. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6594. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6595. BEGIN
  6596. type := GetMathArrayDescriptorType(dimensions);
  6597. Emit(Push(position,op.op));
  6598. (* push type descriptor *)
  6599. reg := TypeDescriptorAdr(type);
  6600. Emit(Push(position,reg));
  6601. ReleaseIntermediateOperand(reg);
  6602. (* push realtime flag: false by default *)
  6603. Emit(Push(position,false));
  6604. CallThis(position,"Heaps","NewRec",3);
  6605. END NewMathArrayDescriptor;
  6606. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6607. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6608. BEGIN
  6609. NEW(string, LEN(s)); COPY(s, string^);
  6610. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6611. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6612. sv.SetType(type);
  6613. Designate(sv,res);
  6614. Emit(Push(position,res.tag));
  6615. Emit(Push(position,res.op));
  6616. ReleaseOperand(res);
  6617. END PushConstString;
  6618. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6619. BEGIN
  6620. IF b THEN
  6621. Emit(Push(Basic.invalidPosition, true));
  6622. ELSE
  6623. Emit(Push(Basic.invalidPosition, false));
  6624. END;
  6625. END PushConstBoolean;
  6626. PROCEDURE PushConstSet(v: SET);
  6627. VAR value: SyntaxTree.Value; op: Operand;
  6628. BEGIN
  6629. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6630. value.SetType(system.setType);
  6631. Evaluate(value, op);
  6632. Emit(Push(Basic.invalidPosition, op.op));
  6633. ReleaseOperand(op);
  6634. END PushConstSet;
  6635. PROCEDURE PushConstInteger(v: LONGINT);
  6636. VAR value: SyntaxTree.Value; op: Operand;
  6637. BEGIN
  6638. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6639. value.SetType(system.longintType);
  6640. Evaluate(value, op);
  6641. Emit(Push(Basic.invalidPosition, op.op));
  6642. ReleaseOperand(op);
  6643. END PushConstInteger;
  6644. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6645. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6646. section: IntermediateCode.Section;
  6647. BEGIN
  6648. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6649. Global.GetSymbolSegmentedName(symbol, name);
  6650. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6651. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6652. procedure.SetScope(moduleScope);
  6653. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6654. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6655. procedure.SetAccess(SyntaxTree.Hidden);
  6656. currentScope := procedureScope;
  6657. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6658. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6659. RETURN section;
  6660. END OpenInitializer;
  6661. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6662. BEGIN
  6663. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6664. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6665. section := prev;
  6666. END CloseInitializer;
  6667. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6668. VAR name: SyntaxTree.IdentifierString;
  6669. variable: SyntaxTree.Variable;
  6670. parameter: SyntaxTree.Parameter;
  6671. type: SyntaxTree.Type;
  6672. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6673. BEGIN
  6674. InitOperand(op,ModeReference);
  6675. op.op := fp;
  6676. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6677. Dereference(op, x, FALSE);
  6678. result := op;
  6679. Symbol(symbol, op);
  6680. END Field;
  6681. PROCEDURE Direction(direction: LONGINT): SET;
  6682. BEGIN
  6683. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6684. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6685. ELSE HALT(100);
  6686. END;
  6687. END Direction;
  6688. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6689. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6690. BEGIN
  6691. Field(port, op);
  6692. ToMemory(op.op,addressType,0);
  6693. Emit(Push(Basic.invalidPosition, op.op));
  6694. ReleaseOperand(op);
  6695. Basic.GetString(modifier.identifier, name);
  6696. PushConstString(name);
  6697. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6698. ASSERT(SemanticChecker.IsStringType(value.type));
  6699. Designate(value, op);
  6700. Emit(Push(modifier.position, op.tag));
  6701. Emit(Push(modifier.position, op.op));
  6702. ReleaseOperand(op);
  6703. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6704. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6705. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6706. Evaluate(value, op);
  6707. Emit(Push(modifier.position, op.op));
  6708. ReleaseOperand(op);
  6709. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6710. ELSE
  6711. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6712. END;
  6713. END AddPortProperty;
  6714. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6715. VAR modifier: SyntaxTree.Modifier;
  6716. BEGIN
  6717. modifier := parameter.modifiers;
  6718. WHILE modifier # NIL DO
  6719. AddPortProperty(parameter,modifier, modifier.expression);
  6720. modifier := modifier.nextModifier;
  6721. END;
  6722. END AddPortProperties;
  6723. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6724. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6725. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6726. PROCEDURE PushLens(type: SyntaxTree.Type);
  6727. BEGIN
  6728. IF IsSemiDynamicArray(type) THEN
  6729. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6730. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6731. Emit(Push(Basic.invalidPosition, op.op));
  6732. ReleaseOperand(op);
  6733. INC(dim);
  6734. ELSIF IsStaticArray(type) THEN
  6735. len := len * type(SyntaxTree.ArrayType).staticLength;
  6736. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6737. INC(dim);
  6738. ELSE
  6739. baseType := type;
  6740. END;
  6741. END PushLens;
  6742. BEGIN
  6743. (* cell *)
  6744. IF parameter.type IS SyntaxTree.ArrayType THEN
  6745. type := parameter.type;
  6746. dim := 0;
  6747. len := 1;
  6748. PushLens(type);
  6749. portType := baseType.resolved(SyntaxTree.PortType);
  6750. ELSE
  6751. portType := parameter.type(SyntaxTree.PortType);
  6752. END;
  6753. PushSelfPointer();
  6754. (* port / array of ports *)
  6755. IF IsStaticArray(type) THEN
  6756. PushConstInteger(len);
  6757. END;
  6758. Field(parameter, op);
  6759. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6760. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6761. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6762. Designate(d, op);*)
  6763. Emit(Push(Basic.invalidPosition, op.op));
  6764. ReleaseOperand(op);
  6765. (* name *)
  6766. PushConstString(name);
  6767. (* inout *)
  6768. PushConstSet(Direction(portType.direction));
  6769. (* width *)
  6770. PushConstInteger(portType.sizeInBits);
  6771. IF parameter.type IS SyntaxTree.PortType THEN
  6772. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6773. AddPortProperties(parameter);
  6774. ELSIF IsStaticArray(type)THEN
  6775. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6776. ELSIF IsSemiDynamicArray(type) THEN
  6777. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6778. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6779. Emit(Add(position,reg, sp, size));
  6780. (* dim *)
  6781. PushConstInteger(dim);
  6782. (* len array *)
  6783. Emit(Push(position, reg));
  6784. ReleaseIntermediateOperand(reg);
  6785. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6786. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6787. Emit(Add(position, sp,sp, size));
  6788. ELSE
  6789. HALT(100);
  6790. END;
  6791. END Parameter;
  6792. BEGIN
  6793. IF backend.cellsAreObjects THEN
  6794. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6795. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6796. END;
  6797. parameter := x.firstParameter;
  6798. WHILE (parameter # NIL) DO
  6799. type := parameter.type.resolved;
  6800. WHILE (type IS SyntaxTree.ArrayType) DO
  6801. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6802. END;
  6803. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6804. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6805. Parameter(name,parameter);
  6806. END;
  6807. parameter := parameter.nextParameter;
  6808. END;
  6809. ELSE HALT(200)
  6810. END;
  6811. END AddPorts;
  6812. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6813. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6814. BEGIN
  6815. Symbol(cell,op);
  6816. ToMemory(op.op,addressType,0);
  6817. Emit(Push(position,op.op));
  6818. ReleaseOperand(op);
  6819. property.GetName(name);
  6820. (* does not work when inheritance is used:
  6821. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6822. *)
  6823. PushConstString(name);
  6824. IF (value # NIL) THEN
  6825. ASSERT(
  6826. SemanticChecker.IsStringType(property.type)
  6827. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6828. OR (property.type.resolved IS SyntaxTree.FloatType)
  6829. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6830. OR (property.type.resolved IS SyntaxTree.SetType)
  6831. );
  6832. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6833. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6834. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6835. Designate(d, op);
  6836. IF SemanticChecker.IsStringType(property.type) THEN
  6837. Emit(Push(Basic.invalidPosition, op.tag))
  6838. END;
  6839. Emit(Push(Basic.invalidPosition, op.op));
  6840. ReleaseOperand(op);
  6841. END;
  6842. IF value = NIL THEN
  6843. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6844. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6845. ASSERT(SemanticChecker.IsStringType(value.type));
  6846. Designate(value, op);
  6847. PushString(op, value.type);
  6848. ReleaseOperand(op);
  6849. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6850. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6851. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6852. Evaluate(value, op);
  6853. Emit(Push(property.position, op.op));
  6854. ReleaseOperand(op);
  6855. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6856. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6857. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6858. Evaluate(value, op);
  6859. Emit(Push(property.position, op.op));
  6860. ReleaseOperand(op);
  6861. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6862. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6863. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6864. Evaluate(value, op);
  6865. Emit(Push(property.position, op.op));
  6866. ReleaseOperand(op);
  6867. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6868. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6869. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6870. Evaluate(value, op);
  6871. Emit(Push(property.position, op.op));
  6872. ReleaseOperand(op);
  6873. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6874. ELSE
  6875. HALT(200);
  6876. END;
  6877. END AddProperty;
  6878. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6879. VAR symbol: SyntaxTree.Symbol;
  6880. BEGIN
  6881. WHILE modifier # NIL DO
  6882. symbol := cellType.FindProperty(modifier.identifier);
  6883. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6884. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6885. modifier := modifier.nextModifier;
  6886. END;
  6887. END AddModifiers;
  6888. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6889. VAR last: SyntaxTree.Modifier;
  6890. BEGIN
  6891. IF to = NIL THEN
  6892. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6893. ELSE
  6894. last := to;
  6895. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6896. last := last.nextModifier;
  6897. END;
  6898. IF last.identifier # this.identifier THEN
  6899. ASSERT(last.nextModifier = NIL);
  6900. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6901. END;
  6902. END;
  6903. END AppendModifier;
  6904. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6905. BEGIN
  6906. WHILE this # NIL DO
  6907. AppendModifier(to, this);
  6908. this := this.nextModifier;
  6909. END;
  6910. END AppendModifiers;
  6911. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6912. VAR base: SyntaxTree.Type;
  6913. BEGIN
  6914. AppendModifiers(to, c.modifiers);
  6915. base := c.GetBaseValueType();
  6916. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6917. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6918. END;
  6919. END AppendCellTypeModifiers;
  6920. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6921. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6922. BEGIN
  6923. Basic.GetString(modifier.identifier, name);
  6924. PushConstString(name);
  6925. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6926. ASSERT(SemanticChecker.IsStringType(value.type));
  6927. Designate(value, op);
  6928. PushString(op, value.type);
  6929. ReleaseOperand(op);
  6930. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6931. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6932. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6933. Evaluate(value, op);
  6934. Emit(Push(modifier.position, op.op));
  6935. ReleaseOperand(op);
  6936. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6937. ELSE
  6938. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6939. END;
  6940. END AddPortProperty;
  6941. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6942. BEGIN
  6943. WHILE modifier # NIL DO
  6944. AddPortProperty(modifier, modifier.expression);
  6945. modifier := modifier.nextModifier;
  6946. END;
  6947. END AddPortProperties;
  6948. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6949. VAR op: Operand;
  6950. BEGIN
  6951. Evaluate(p, op);
  6952. Emit(Push(p.position, op.op));
  6953. ReleaseOperand(op);
  6954. IF p IS SyntaxTree.Designator THEN
  6955. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6956. END;
  6957. END PushPort;
  6958. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6959. VAR tmp: IntermediateCode.Operand;
  6960. BEGIN
  6961. actualType := actualType.resolved;
  6962. IF actualType IS SyntaxTree.StringType THEN
  6963. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6964. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6965. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6966. ELSE
  6967. tmp := op.tag;
  6968. IntermediateCode.MakeMemory(tmp,addressType);
  6969. Emit(Push(position,tmp));
  6970. END;
  6971. Emit(Push(position,op.op))
  6972. END PushString;
  6973. (* conservative check if x is potentially on the heap, excluding the module heap
  6974. required for generational garbage collector
  6975. *)
  6976. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6977. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6978. BEGIN
  6979. RETURN TRUE;
  6980. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6981. passed by reference.
  6982. pos := x.position.start;
  6983. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6984. x := x(SyntaxTree.Designator).left;
  6985. END;
  6986. RETURN x # NIL;
  6987. *)
  6988. END OnHeap;
  6989. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6990. VAR
  6991. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6992. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6993. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6994. tmp:IntermediateCode.Operand;
  6995. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6996. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6997. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6998. dest: IntermediateCode.Operand;
  6999. staticLength: LONGINT; itype: IntermediateCode.Type;
  7000. convert,isTensor: BOOLEAN;
  7001. recordType: SyntaxTree.RecordType;
  7002. baseType: SyntaxTree.Type;
  7003. flags: SET;
  7004. left: SyntaxTree.Expression;
  7005. call: SyntaxTree.Designator;
  7006. procedure: SyntaxTree.Procedure;
  7007. temporaryVariable: SyntaxTree.Variable;
  7008. dummy: IntermediateCode.Operand;
  7009. customBuiltin: SyntaxTree.CustomBuiltin;
  7010. isVarPar: ARRAY 3 OF BOOLEAN;
  7011. callsection: Sections.Section;
  7012. segmentedName: Basic.SegmentedName;
  7013. needsTrace: BOOLEAN;
  7014. n: ARRAY 256 OF CHAR;
  7015. modifier: SyntaxTree.Modifier;
  7016. previous, init: IntermediateCode.Section;
  7017. prevScope: SyntaxTree.Scope;
  7018. firstPar: LONGINT;
  7019. saved: RegisterEntry;
  7020. callingConvention: SyntaxTree.CallingConvention;
  7021. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7022. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7023. priority: IntermediateCode.Operand;
  7024. op,callop: Operand;
  7025. BEGIN
  7026. IF type = NIL THEN RETURN END;
  7027. type := type.resolved;
  7028. IF type IS SyntaxTree.PointerType THEN
  7029. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7030. END;
  7031. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7032. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7033. recordScope := type(SyntaxTree.RecordType).recordScope;
  7034. IF recordScope.bodyProcedure # NIL THEN
  7035. procedure := recordScope.bodyProcedure;
  7036. body := procedure.procedureScope.body;
  7037. Emit(Push(position,self));
  7038. IF body.isActive THEN
  7039. StaticCallOperand(callop,procedure);
  7040. Emit(Push(position,callop.op));
  7041. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7042. Convert(priority,sizeType);
  7043. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7044. END;
  7045. Emit(Push(position,priority));
  7046. ReleaseIntermediateOperand(priority);
  7047. IF backend.cooperative THEN
  7048. Emit(Push(position,self));
  7049. CallThis(position,"Activities","Create",3)
  7050. ELSE
  7051. flags := 0;
  7052. IF body.isSafe THEN
  7053. flags := 1;
  7054. END;
  7055. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7056. Emit(Push(position,self));
  7057. CallThis(position,"Objects","CreateProcess",4)
  7058. END;
  7059. ELSE
  7060. Emit(Push(position,self));
  7061. StaticCallOperand(callop,procedure);
  7062. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7063. END;
  7064. Emit(Pop(position,self));
  7065. END;
  7066. END CallBodies;
  7067. PROCEDURE PushTD(type: SyntaxTree.Type);
  7068. VAR op: IntermediateCode.Operand;
  7069. BEGIN
  7070. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7071. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7072. ELSE
  7073. IF type.resolved IS SyntaxTree.PointerType THEN
  7074. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7075. END;
  7076. op := TypeDescriptorAdr(type.resolved);
  7077. Emit(Push(position,op));
  7078. END
  7079. END PushTD;
  7080. BEGIN
  7081. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7082. dest := destination; destination := emptyOperand;
  7083. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7084. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7085. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7086. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7087. CASE x.id OF
  7088. (* ---- COPY ----- *)
  7089. |Global.Copy:
  7090. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7091. (* ---- EXCL, INCL----- *)
  7092. |Global.Excl,Global.Incl:
  7093. Evaluate(p0,s0);
  7094. Evaluate(p1,s1);
  7095. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7096. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7097. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7098. END;
  7099. ReuseCopy(res,s0.op);
  7100. ReleaseOperand(s0);
  7101. Reuse1(tmp,s1.op);
  7102. ReleaseOperand(s1);
  7103. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7104. IF x.id = Global.Excl THEN
  7105. Emit(Not(position,tmp,tmp));
  7106. Emit(And(position,res,res,tmp));
  7107. ELSE
  7108. Emit(Or(position,res,res,tmp));
  7109. END;
  7110. ReleaseIntermediateOperand(tmp);
  7111. Designate(p0,s0);
  7112. ToMemory(s0.op,s1.op.type,0);
  7113. Emit(Mov(position,s0.op,res));
  7114. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7115. (* ---- DISPOSE ----- *)
  7116. |Global.Dispose:
  7117. Designate(p0,s0);
  7118. Emit(Push(position,s0.op));
  7119. ReleaseOperand(s0);
  7120. CallThis(position,"Runtime","Dispose", 1);
  7121. (* ---- GETPROCEDURE ----- *)
  7122. |Global.GetProcedure:
  7123. Designate(p0,s0);
  7124. PushString(s0,p0.type);
  7125. Designate(p1,s1);
  7126. PushString(s1,p1.type);
  7127. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7128. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7129. ELSE PushTD(procedureType.firstParameter.type)
  7130. END;
  7131. PushTD(procedureType.returnType);
  7132. Designate(p2,s2);
  7133. Emit(Push(position,s2.op));
  7134. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7135. CallThis(position,"Modules","GetProcedure", 7);
  7136. (* ---- ASH, LSH, ROT ----- *)
  7137. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7138. Evaluate(p0,s0);
  7139. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7140. (* make unsigned arguments in order to produced a logical shift *)
  7141. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7142. convert:= TRUE;
  7143. itype := s0.op.type;
  7144. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7145. Convert(s0.op,itype);
  7146. ELSE
  7147. convert := FALSE;
  7148. END;
  7149. END;
  7150. Evaluate(p1,s1);
  7151. IF IsIntegerConstant(p1,hint) THEN
  7152. ReuseCopy(reg,s0.op);
  7153. IF hint > 0 THEN
  7154. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7155. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7156. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7157. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7158. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7159. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7160. END;
  7161. ELSIF hint < 0 THEN
  7162. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7163. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7164. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7165. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7166. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7167. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7168. END;
  7169. END;
  7170. ReleaseOperand(s0); ReleaseOperand(s1);
  7171. ELSE
  7172. exit := NewLabel();
  7173. end := NewLabel();
  7174. ReuseCopy(reg,s0.op);
  7175. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7176. Reuse1(tmp,s1.op);
  7177. Emit(Neg(position,tmp,s1.op));
  7178. Convert(tmp,s1.op.type);
  7179. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7180. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7181. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7182. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7183. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7184. END;
  7185. ReleaseIntermediateOperand(tmp);
  7186. BrL(end);
  7187. SetLabel(exit);
  7188. ReuseCopy(tmp,s1.op);
  7189. Convert(tmp,s1.op.type);
  7190. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7191. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7192. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7193. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7194. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7195. END;
  7196. ReleaseIntermediateOperand(tmp);
  7197. SetLabel(end);
  7198. ReleaseOperand(s0); ReleaseOperand(s1);
  7199. END;
  7200. InitOperand(result,ModeValue);
  7201. IF convert THEN
  7202. itype := reg.type;
  7203. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7204. Convert(reg,itype);
  7205. END;
  7206. result.op := reg;
  7207. (* ---- CAP ----- *)
  7208. |Global.Cap:
  7209. Evaluate(p0,result);
  7210. ReuseCopy(reg,result.op);
  7211. ReleaseIntermediateOperand(result.op);
  7212. ignore := NewLabel();
  7213. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7214. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7215. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7216. SetLabel(ignore);
  7217. result.op := reg;
  7218. (* ---- CHR ----- *)
  7219. |Global.Chr, Global.Chr32:
  7220. Evaluate(p0,result);
  7221. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7222. |Global.Entier, Global.EntierH:
  7223. Evaluate(p0,result);
  7224. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7225. (* ---- MIN and MAX ----- *)
  7226. |Global.Max,Global.Min:
  7227. Evaluate(p0,s0);
  7228. Evaluate(p1,s1);
  7229. Reuse2(res,s0.op,s1.op);
  7230. else := NewLabel();
  7231. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7232. ELSE BrltL(else,s1.op,s0.op) END;
  7233. Emit(Mov(position,res,s0.op));
  7234. ReleaseOperand(s0);
  7235. end := NewLabel();
  7236. BrL(end);
  7237. SetLabel(else);
  7238. Emit(MovReplace(position,res,s1.op));
  7239. SetLabel(end);
  7240. ReleaseOperand(s1);
  7241. InitOperand(result,ModeValue);
  7242. result.op := res;
  7243. (* ---- ODD ----- *)
  7244. |Global.Odd:
  7245. IF ~conditional THEN
  7246. ConditionToValue(x)
  7247. ELSE
  7248. Evaluate(p0,result);
  7249. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7250. Reuse1(res,result.op);
  7251. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7252. ReleaseIntermediateOperand(result.op);
  7253. result.op := res;
  7254. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7255. ReleaseOperand(result);
  7256. BrL(falseLabel);
  7257. END;
  7258. (* ---- ORD ----- *)
  7259. |Global.Ord, Global.Ord32:
  7260. Evaluate(p0,result);
  7261. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7262. (* ---- SHORT, LONG ----- *)
  7263. |Global.Short, Global.Long:
  7264. Evaluate(p0,result);
  7265. IF x.type IS SyntaxTree.ComplexType THEN
  7266. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7267. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7268. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7269. ELSE
  7270. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7271. END
  7272. (* ---- HALT, SYSTEM.HALT----- *)
  7273. |Global.Halt, Global.systemHalt:
  7274. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7275. EmitTrap (position, val);
  7276. (* ---- ASSERT ----- *)
  7277. |Global.Assert:
  7278. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7279. trueL := NewLabel();
  7280. falseL := NewLabel();
  7281. Condition(p0,trueL,falseL);
  7282. IF p1 = NIL THEN val := AssertTrap
  7283. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7284. END;
  7285. SetLabel(falseL);
  7286. EmitTrap(position,val);
  7287. SetLabel(trueL);
  7288. END;
  7289. (*
  7290. Emit(TrapC(result.op,val);
  7291. *)
  7292. (* ---- INC, DEC----- *)
  7293. |Global.Inc,Global.Dec:
  7294. Expression(p0); adr := result.op;
  7295. LoadValue(result,p0.type); l := result;
  7296. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7297. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7298. END;
  7299. IF x.id = Global.Inc THEN
  7300. Emit(Add(position,l.op,l.op,r.op));
  7301. ELSE
  7302. Emit(Sub(position,l.op,l.op,r.op));
  7303. END;
  7304. ReleaseOperand(l); ReleaseOperand(r);
  7305. (* ---- LEN ----- *)
  7306. |Global.Len: (* dynamic length, static length done by checker *)
  7307. Designate(p0,operand);
  7308. IF p1 = NIL THEN
  7309. InitOperand(l,ModeValue);
  7310. l.op := IntermediateCode.Immediate(sizeType,0);
  7311. ELSE
  7312. Evaluate(p1,l);
  7313. END;
  7314. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7315. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7316. Dereference(operand, p0.type.resolved, FALSE);
  7317. END;
  7318. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7319. ReleaseOperand(operand); ReleaseOperand(l);
  7320. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7321. ASSERT(p1 # NIL);
  7322. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7323. Dereference(operand,p0.type.resolved,FALSE);
  7324. END;
  7325. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7326. ReleaseOperand(operand); ReleaseOperand(l);
  7327. ELSE HALT(100);
  7328. END;
  7329. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7330. (* ---- FIRST ---- *)
  7331. |Global.First:
  7332. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7333. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7334. ELSE
  7335. Designate(p0, result)
  7336. END
  7337. (* ---- LAST ---- *)
  7338. |Global.Last:
  7339. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7340. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7341. ELSE
  7342. Designate(p0, result);
  7343. (* make sure result.op is a register *)
  7344. tmp := result.op;
  7345. ReuseCopy(result.op, result.op);
  7346. ReleaseIntermediateOperand(tmp);
  7347. (* add offset to result.op *)
  7348. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7349. END
  7350. (* ---- STEP ---- *)
  7351. |Global.Step:
  7352. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7353. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7354. ELSE
  7355. Designate(p0, result);
  7356. (* make sure result.op is a register *)
  7357. tmp := result.op;
  7358. ReuseCopy(result.op, result.op);
  7359. ReleaseIntermediateOperand(tmp);
  7360. (* add offset to result.op *)
  7361. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7362. END
  7363. (* ---- RE ---- *)
  7364. |Global.Re:
  7365. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7366. Designate(p0, result)
  7367. ELSE
  7368. Evaluate(p0, result)
  7369. END
  7370. (* ---- IM ---- *)
  7371. |Global.Im:
  7372. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7373. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7374. Designate(p0, result);
  7375. (* make sure result.op is a register *)
  7376. tmp := result.op;
  7377. ReuseCopy(result.op, result.op);
  7378. ReleaseIntermediateOperand(tmp);
  7379. (* add offset to result.op *)
  7380. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7381. (* ---- ABS ----- *)
  7382. |Global.Abs:
  7383. Evaluate(p0,operand);
  7384. type := p0.type.resolved;
  7385. InitOperand(result,ModeValue);
  7386. Reuse1a(result.op,operand.op,dest);
  7387. Emit(Abs(position,result.op,operand.op));
  7388. ReleaseOperand(operand);
  7389. (* ---- WAIT ----- *)
  7390. |Global.Wait:
  7391. Evaluate(p0,operand);
  7392. Emit(Push(position,operand.op));
  7393. ReleaseOperand(operand);
  7394. CallThis(position,"Activities","Wait", 1);
  7395. (* ---- NEW ----- *)
  7396. |Global.New:
  7397. (*! the following code is only correct for "standard" Oberon calling convention *)
  7398. IF x.type # NIL THEN
  7399. type := x.type.resolved;
  7400. firstPar := 0;
  7401. ELSE
  7402. type := p0.type.resolved;
  7403. firstPar := 1;
  7404. END;
  7405. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7406. THEN
  7407. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7408. IF backend.cooperative THEN
  7409. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7410. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7411. IF recordType.isObject THEN
  7412. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7413. IF recordType.IsActive() THEN
  7414. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7415. END;
  7416. IF recordType.IsProtected() THEN
  7417. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7418. END;
  7419. ELSE
  7420. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7421. END;
  7422. END;
  7423. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7424. CallThis(position,"Runtime","New", 1);
  7425. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7426. Emit(Result(position, pointer));
  7427. exit := NewLabel();
  7428. BreqL(exit,pointer,nil);
  7429. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7430. GetRecordTypeName (recordType,name);
  7431. IF ~recordType.isObject THEN
  7432. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7433. END;
  7434. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7435. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7436. IF recordType.isObject THEN
  7437. IF recordType.IsProtected() THEN
  7438. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7439. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7440. END;
  7441. IF recordType.IsActive() THEN
  7442. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7443. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7444. END;
  7445. END;
  7446. END;
  7447. (* initialize fields *)
  7448. IF type(SyntaxTree.PointerType).isPlain THEN
  7449. size := 0;
  7450. ELSIF recordType.isObject THEN
  7451. size := BaseObjectTypeSize;
  7452. ELSE
  7453. size := BaseRecordTypeSize;
  7454. END;
  7455. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7456. (* call initializer *)
  7457. constructor := GetConstructor(recordType);
  7458. IF constructor # NIL THEN
  7459. (*! should be unified with ProcedureCallDesignator *)
  7460. Emit(Push(position,pointer));
  7461. ReleaseIntermediateOperand(pointer);
  7462. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7463. FOR i := firstPar TO x.parameters.Length()-1 DO
  7464. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7465. formalParameter := formalParameter.nextParameter;
  7466. END;
  7467. (* static call of the constructor *)
  7468. GetCodeSectionNameForSymbol(constructor,name);
  7469. ASSERT(~constructor.isInline);
  7470. IF constructor.scope.ownerModule # module.module THEN
  7471. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7472. ELSE
  7473. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7474. END;
  7475. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7476. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7477. Emit(Pop(position,pointer));
  7478. END;
  7479. (* call bodies *)
  7480. CallBodies(pointer,type);
  7481. SetLabel(exit);
  7482. needsTrace := p0.NeedsTrace();
  7483. IF needsTrace THEN ModifyAssignments(true) END;
  7484. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7485. Emit(Push(position, pointer));
  7486. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7487. Emit(Pop(position, pointer));
  7488. END;
  7489. Designate(p0,l);
  7490. IF needsTrace THEN
  7491. CallAssignPointer(l.op, pointer);
  7492. ELSE
  7493. ToMemory(l.op,addressType,0);
  7494. Emit(Mov(position,l.op,pointer));
  7495. END;
  7496. ReleaseIntermediateOperand(pointer);
  7497. ReleaseOperand(l);
  7498. IF needsTrace THEN ModifyAssignments(false) END;
  7499. ELSE (* not cooperative backend *)
  7500. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7501. IF temporaryVariable # NIL THEN
  7502. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7503. ELSE
  7504. Designate(p0,l);
  7505. END;
  7506. (* l.op contains address of pointer to record *)
  7507. Emit(Push(position,l.op)); (* address for use after syscall *)
  7508. Emit(Push(position,l.op));
  7509. ReleaseOperand(l);
  7510. (* push type descriptor *)
  7511. reg := TypeDescriptorAdr(recordType);
  7512. Emit(Push(position,reg));
  7513. ReleaseIntermediateOperand(reg);
  7514. (* push realtime flag *)
  7515. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7516. ELSE Emit(Push(position,false));
  7517. END;
  7518. CallThis(position,"Heaps","NewRec", 3);
  7519. (* check allocation success, if not successful then do not call initializers and bodies *)
  7520. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7521. Emit(Pop(position,pointer));
  7522. MakeMemory(reg,pointer,addressType,0);
  7523. ReleaseIntermediateOperand(pointer);
  7524. pointer := reg;
  7525. exit := NewLabel();
  7526. BreqL(exit,pointer,nil);
  7527. Emit(Push(position,pointer));
  7528. (* initialize fields *)
  7529. InitFields(recordType, pointer,0);
  7530. (* call initializer *)
  7531. constructor := GetConstructor(recordType);
  7532. IF constructor # NIL THEN
  7533. (*! should be unified with ProcedureCallDesignator *)
  7534. Emit(Push(position,pointer));
  7535. ReleaseIntermediateOperand(pointer);
  7536. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7537. FOR i := firstPar TO x.parameters.Length()-1 DO
  7538. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7539. formalParameter := formalParameter.nextParameter;
  7540. END;
  7541. (* static call of the constructor *)
  7542. GetCodeSectionNameForSymbol(constructor,name);
  7543. ASSERT(~constructor.isInline);
  7544. IF constructor.scope.ownerModule # module.module THEN
  7545. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7546. ELSE
  7547. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7548. END;
  7549. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7550. ELSE
  7551. ReleaseIntermediateOperand(pointer);
  7552. END;
  7553. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7554. Emit(Pop(position,pointer));
  7555. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7556. Designate(p0,l);
  7557. IF backend.writeBarriers & OnHeap(p0) THEN
  7558. SaveRegisters();ReleaseUsedRegisters(saved);
  7559. Emit(Push(position,l.op));
  7560. Emit(Push(position,pointer));
  7561. CallThis(position,"Heaps","Assign",2);
  7562. RestoreRegisters(saved);
  7563. ELSE
  7564. ToMemory(l.op,addressType,0);
  7565. Emit(Mov(position,l.op,pointer));
  7566. END;
  7567. ReleaseOperand(l);
  7568. result.tag := emptyOperand;
  7569. ELSIF (x.type # NIL) THEN
  7570. result := l; (* temporary variable is the result of NEW Type() *)
  7571. END;
  7572. (* call bodies *)
  7573. CallBodies(pointer,type);
  7574. ReleaseIntermediateOperand(pointer);
  7575. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7576. end := NewLabel();
  7577. BrL(end);
  7578. SetLabel(exit);
  7579. Designate(p0,l);
  7580. ToMemory(l.op,addressType,0);
  7581. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7582. ReleaseOperand(l);
  7583. SetLabel(end);
  7584. ELSE
  7585. SetLabel(exit);
  7586. END;
  7587. END;
  7588. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7589. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7590. IF ~backend.cooperative THEN (* simpler version *)
  7591. (*
  7592. push len0
  7593. push len1
  7594. push len2
  7595. push len_size
  7596. push len_adr
  7597. push tag
  7598. push static elements
  7599. push element size
  7600. push adr
  7601. *)
  7602. dim := 0;
  7603. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7604. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7605. parameter := x.parameters.GetExpression(i);
  7606. Evaluate(parameter,r);
  7607. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7608. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7609. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7610. END;
  7611. Emit(Push(position,r.op));
  7612. ReleaseOperand(r);
  7613. INC(dim);
  7614. END;
  7615. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7616. Emit(Mov(position, adr, sp));
  7617. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7618. Emit(Push(position, adr));
  7619. ReleaseIntermediateOperand(adr);
  7620. openDim := dim;
  7621. staticLength := 1;
  7622. IF type IS SyntaxTree.ArrayType THEN
  7623. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7624. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7625. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7626. END;
  7627. END;
  7628. IF SemanticChecker.ContainsPointer(type) THEN
  7629. tmp := TypeDescriptorAdr(type);
  7630. ELSE
  7631. tmp := nil;
  7632. END;
  7633. Emit(Push(position,tmp)); (* type descriptor *)
  7634. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7635. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7636. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7637. Designate(p0,l);
  7638. Emit(Push(position,l.op)); (* address *)
  7639. ReleaseOperand(l);
  7640. CallThis(position,"Heaps","NewArray", 6);
  7641. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7642. Emit(Add(position,sp,sp,tmp));
  7643. ELSE
  7644. dim := 0;
  7645. IntermediateCode.InitOperand(reg);
  7646. IF p1 # NIL THEN
  7647. FOR i := firstPar TO x.parameters.Length()-1 DO
  7648. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7649. parameter := x.parameters.GetExpression(i);
  7650. Evaluate(parameter,r);
  7651. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7652. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7653. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7654. END;
  7655. Emit(Push(position,r.op));
  7656. IF i=1 THEN
  7657. CopyInt(reg,r.op);
  7658. ELSE
  7659. MulInt(reg, reg, r.op);
  7660. END;
  7661. ReleaseOperand(r);
  7662. INC(dim);
  7663. END;
  7664. Convert(reg,addressType);
  7665. ELSE
  7666. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7667. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7668. END;
  7669. openDim := dim;
  7670. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7671. IF backend.cooperative THEN
  7672. size := ToMemoryUnits(system,system.SizeOf(type));
  7673. WHILE type IS SyntaxTree.ArrayType DO
  7674. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7675. END;
  7676. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7677. IF (size # 1) THEN
  7678. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7679. END;
  7680. Emit(Push(position,reg));
  7681. size := ToMemoryUnits(system,system.SizeOf(type));
  7682. IF (size # 1) THEN
  7683. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7684. END;
  7685. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7686. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7687. Emit(Push(position,reg));
  7688. ReleaseIntermediateOperand(reg);
  7689. CallThis(position,"Runtime","New", 1);
  7690. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7691. Emit(Result(position, pointer));
  7692. exit := NewLabel();
  7693. else := NewLabel();
  7694. BreqL(else,pointer,nil);
  7695. IF ~type.hasPointers THEN
  7696. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7697. ELSIF type IS SyntaxTree.RecordType THEN
  7698. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7699. ELSIF type IS SyntaxTree.ProcedureType THEN
  7700. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7701. ELSE
  7702. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7703. END;
  7704. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7705. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7706. 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))));
  7707. IF type IS SyntaxTree.RecordType THEN
  7708. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7709. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7710. ELSE
  7711. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7712. END;
  7713. i := openDim;
  7714. WHILE i > 0 DO
  7715. DEC (i);
  7716. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7717. END;
  7718. needsTrace := p0.NeedsTrace();
  7719. IF needsTrace THEN ModifyAssignments(true) END;
  7720. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7721. Emit(Push(position, pointer));
  7722. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7723. Emit(Pop(position, pointer));
  7724. END;
  7725. Designate(p0,l);
  7726. IF needsTrace THEN
  7727. CallAssignPointer(l.op, pointer);
  7728. ModifyAssignments(false);
  7729. ELSE
  7730. ToMemory(l.op,addressType,0);
  7731. Emit(Mov(position,l.op,pointer));
  7732. END;
  7733. ReleaseIntermediateOperand(pointer);
  7734. ReleaseOperand(l);
  7735. BrL(exit);
  7736. SetLabel(else);
  7737. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7738. Designate(p0,l);
  7739. IF needsTrace THEN
  7740. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7741. ELSE
  7742. ToMemory(l.op,addressType,0);
  7743. Emit(Mov(position,l.op,pointer));
  7744. END;
  7745. ReleaseOperand(l);
  7746. SetLabel(exit);
  7747. ELSE
  7748. (*! the following code is only correct for "standard" Oberon calling convention *)
  7749. IF SemanticChecker.ContainsPointer(type) THEN
  7750. IF type IS SyntaxTree.ArrayType THEN
  7751. staticLength := 1;
  7752. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7753. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7754. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7755. END;
  7756. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7757. MulInt(reg,reg,tmp);
  7758. END;
  7759. Designate(p0,l);
  7760. IF openDim > 0 THEN
  7761. Emit(Push(position,l.op)); (* address for use after syscall *)
  7762. END;
  7763. Emit(Push(position,l.op)); (* address *)
  7764. ReleaseOperand(l);
  7765. tmp := TypeDescriptorAdr(type);
  7766. Emit(Push(position,tmp)); (* type descriptor *)
  7767. ReleaseIntermediateOperand(tmp);
  7768. Emit(Push(position,reg)); (* number Elements *)
  7769. ReleaseIntermediateOperand(reg);
  7770. tmp := IntermediateCode.Immediate(addressType,dim);
  7771. Emit(Push(position,tmp)); (* dimensions *)
  7772. (* push realtime flag *)
  7773. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7774. ELSE Emit(Push(position,false));
  7775. END;
  7776. CallThis(position,"Heaps","NewArr",5)
  7777. ELSE
  7778. size := ToMemoryUnits(system,system.SizeOf(type));
  7779. IF (size # 1) THEN
  7780. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7781. (*
  7782. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7783. *)
  7784. END;
  7785. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7786. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7787. AddInt(reg, reg, tmp);
  7788. (*
  7789. Emit(Add(position,reg,reg,tmp));
  7790. *)
  7791. Designate(p0,l);
  7792. IF openDim >0 THEN
  7793. Emit(Push(position,l.op)); (* address for use after syscall *)
  7794. END;
  7795. Emit(Push(position,l.op)); (* address for syscall *)
  7796. ReleaseOperand(l); (* pointer address *)
  7797. Emit(Push(position,reg)); (* size *)
  7798. ReleaseIntermediateOperand(reg);
  7799. (* push realtime flag *)
  7800. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7801. ELSE Emit(Push(position,false));
  7802. END;
  7803. CallThis(position,"Heaps","NewSys", 3)
  7804. END;
  7805. IF openDim > 0 THEN
  7806. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7807. Emit(Pop(position,adr));
  7808. ToMemory(adr,addressType,0);
  7809. ReuseCopy(tmp,adr);
  7810. ReleaseIntermediateOperand(adr);
  7811. adr := tmp;
  7812. else := NewLabel();
  7813. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7814. i := openDim-1;
  7815. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7816. WHILE (i >= 0) DO
  7817. Emit(Pop(position,reg));
  7818. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7819. Emit(Mov(position,res,reg));
  7820. DEC(i);
  7821. END;
  7822. ReleaseIntermediateOperand(adr);
  7823. ReleaseIntermediateOperand(reg);
  7824. exit := NewLabel();
  7825. BrL(exit);
  7826. SetLabel(else);
  7827. (* else part: array could not be allocated *)
  7828. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7829. Emit(Add(position,sp,sp,tmp));
  7830. SetLabel(exit);
  7831. END;
  7832. END;
  7833. END;
  7834. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7835. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7836. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7837. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7838. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7839. callingConvention := procedureType.callingConvention;
  7840. left.SetType(procedure.type);
  7841. formalParameter := procedureType.firstParameter;
  7842. (* push array to allocate *)
  7843. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7844. formalParameter :=formalParameter.nextParameter;
  7845. (* push length array *)
  7846. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7847. (* push size *)
  7848. type := t0;
  7849. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7850. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7851. END;
  7852. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7853. Emit(Push(position,tmp));
  7854. (* *)
  7855. IF SemanticChecker.ContainsPointer(type) THEN
  7856. tmp := TypeDescriptorAdr(type);
  7857. ELSE
  7858. tmp := IntermediateCode.Immediate(addressType, 0);
  7859. END;
  7860. Emit(Push(position,tmp)); (* type descriptor *)
  7861. StaticCallOperand(result,procedure);
  7862. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7863. ReleaseOperand(result);
  7864. END;
  7865. (*
  7866. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7867. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7868. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7869. *)
  7870. ELSE
  7871. (*
  7872. push len0
  7873. push len1
  7874. push len2
  7875. push size
  7876. push len_adr
  7877. push element_size
  7878. push tag
  7879. push adr
  7880. *)
  7881. dim := 0;
  7882. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7883. isTensor := TRUE;
  7884. ELSE
  7885. isTensor := FALSE;
  7886. END;
  7887. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7888. IF ~isTensor THEN
  7889. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7890. END;
  7891. parameter := x.parameters.GetExpression(i);
  7892. Evaluate(parameter,r);
  7893. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7894. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7895. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7896. END;
  7897. Emit(Push(position,r.op));
  7898. ReleaseOperand(r);
  7899. INC(dim);
  7900. END;
  7901. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7902. Emit(Mov(position, adr, sp));
  7903. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7904. Emit(Push(position, adr));
  7905. ReleaseIntermediateOperand(adr);
  7906. openDim := dim;
  7907. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7908. IF isTensor THEN
  7909. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7910. ELSE
  7911. baseType := SemanticChecker.ArrayBase(type,openDim);
  7912. END;
  7913. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7914. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7915. IF SemanticChecker.ContainsPointer(baseType) THEN
  7916. tmp := TypeDescriptorAdr(baseType);
  7917. ELSE
  7918. tmp := nil;
  7919. END;
  7920. Emit(Push(position,tmp)); (* type descriptor *)
  7921. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7922. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7923. ELSE (* error message has already been emited *)
  7924. RETURN;
  7925. END;
  7926. Designate(p0,l);
  7927. IF isTensor THEN
  7928. Emit(Push(position,l.op)); (* address *)
  7929. ELSE
  7930. Emit(Push(position,l.tag)); (* address *)
  7931. END;
  7932. ReleaseOperand(l);
  7933. StaticCallOperand(result,procedure);
  7934. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7935. ReleaseOperand(result);
  7936. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7937. Emit(Add(position,sp,sp,tmp));
  7938. END;
  7939. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7940. THEN
  7941. IF ~backend.cellsAreObjects THEN RETURN END;
  7942. IF InCellScope(currentScope) THEN
  7943. PushSelfPointer()
  7944. ELSE
  7945. Emit(Push(position, nil));
  7946. END;
  7947. (* push temp address *)
  7948. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7949. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7950. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7951. (* l.op contains address of pointer to record *)
  7952. Emit(Push(position,l.op)); (* address for use after syscall *)
  7953. ReleaseOperand(l);
  7954. (* push type descriptor *)
  7955. reg := TypeDescriptorAdr(baseType);
  7956. Emit(Push(position,reg));
  7957. ReleaseIntermediateOperand(reg);
  7958. (* push name *)
  7959. (*Global.GetSymbolName(p0, n);*)
  7960. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7961. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7962. ELSE
  7963. Global.GetModuleName(module.module, n);
  7964. END;
  7965. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7966. (*type.typeDeclaration.GetName(n);*)
  7967. PushConstString(n);
  7968. (* push cellnet boolean *)
  7969. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7970. (* push engine boolean *)
  7971. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7972. (* allocate *)
  7973. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7974. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7975. (* l.op contains address of pointer to record *)
  7976. ToMemory(l.op,addressType,0);
  7977. (* l.op contains value of pointer to record *)
  7978. InitFields(baseType, l.op,0);
  7979. (* add capabilities *)
  7980. modifier := p0(SyntaxTree.Designator).modifiers;
  7981. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7982. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7983. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7984. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7985. END;
  7986. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7987. (*
  7988. modifier := baseType(SyntaxTree.CellType).modifiers;
  7989. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7990. modifier := p0(SyntaxTree.Designator).modifiers;
  7991. *)
  7992. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7993. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7994. (* l.op contains address of pointer to record *)
  7995. ToMemory(l.op,addressType,0);
  7996. (* l.op contains value of pointer to record *)
  7997. Emit(Push(position,l.op)); (* address for use after syscall *)
  7998. ReleaseOperand(l);
  7999. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8000. prevScope := currentScope;
  8001. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8002. previous := section;
  8003. section := init;
  8004. (* add ports *)
  8005. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8006. CloseInitializer(previous);
  8007. currentScope := prevScope;
  8008. Symbol(temporaryVariable,l);
  8009. ToMemory(l.op,addressType,0);
  8010. Emit(Push(position,l.op));
  8011. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8012. (*
  8013. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8014. IF constructor # NIL THEN
  8015. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8016. FOR i := 1 TO x.parameters.Length()-1 DO
  8017. p := x.parameters.GetExpression(i);
  8018. Global.GetSymbolName(parameter,name);
  8019. Evaluate(p, value);
  8020. ASSERT(value.type # NIL);
  8021. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8022. par := instance.AddParameter(name);
  8023. par.SetInteger(value.integer);
  8024. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8025. par := instance.AddParameter(name);
  8026. par.SetBoolean(value.boolean);
  8027. ELSE Error(x.position,NotYetImplemented)
  8028. END;
  8029. parameter := parameter.nextParameter
  8030. END;
  8031. END;
  8032. *)
  8033. (* call initializer *)
  8034. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8035. IF constructor # NIL THEN
  8036. (*! should be unified with ProcedureCallDesignator *)
  8037. IF backend.cellsAreObjects THEN
  8038. Symbol(temporaryVariable,l);
  8039. ToMemory(l.op,addressType,0);
  8040. Emit(Push(position,l.op));
  8041. ReleaseOperand(l);
  8042. END;
  8043. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8044. FOR i := firstPar TO x.parameters.Length()-1 DO
  8045. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8046. formalParameter := formalParameter.nextParameter;
  8047. END;
  8048. (* static call of the constructor *)
  8049. Global.GetSymbolSegmentedName(constructor,name);
  8050. ASSERT(~constructor.isInline);
  8051. IF constructor.scope.ownerModule # module.module THEN
  8052. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8053. ELSE
  8054. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8055. END;
  8056. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8057. (*ELSE
  8058. ReleaseIntermediateOperand(pointer);*)
  8059. END;
  8060. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8061. ToMemory(l.op, addressType, 0);
  8062. Designate(p0,s0);
  8063. ToMemory(s0.op,addressType,0);
  8064. Emit(Mov(position,s0.op,l.op));
  8065. ReleaseOperand(l);
  8066. ReleaseOperand(s0);
  8067. result.tag := emptyOperand;
  8068. (* start *)
  8069. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8070. (* push cell *)
  8071. Symbol(temporaryVariable, l);
  8072. ToMemory(l.op,addressType,0);
  8073. Emit(Push(Basic.invalidPosition,l.op));
  8074. (* push delegate *)
  8075. Emit(Push(Basic.invalidPosition,l.op));
  8076. ReleaseOperand(l);
  8077. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8078. Emit(Push(position, s1.op));
  8079. ReleaseOperand(s1);
  8080. CallThis(position,"ActiveCellsRuntime","Start",3);
  8081. END;
  8082. (*IF temporaryVariable # NIL THEN
  8083. end := NewLabel();
  8084. BrL(end);
  8085. SetLabel(exit);
  8086. Designate(p0,l);
  8087. ToMemory(l.op,addressType,0);
  8088. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8089. ReleaseOperand(l);
  8090. SetLabel(end);
  8091. ELSE
  8092. SetLabel(exit);
  8093. END;
  8094. *)
  8095. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8096. ELSE (* no pointer to record, no pointer to array *)
  8097. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8098. (* ignore new statement *)
  8099. Warning(p0.position, "cannot run on final hardware");
  8100. ELSE
  8101. HALT(200);
  8102. END;
  8103. END;
  8104. (* ---- ADDRESSOF----- *)
  8105. |Global.systemAdr:
  8106. Designate(p0,s0);
  8107. s0.mode := ModeValue;
  8108. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8109. ReleaseIntermediateOperand(s0.op);
  8110. s0.op := s0.tag;
  8111. IntermediateCode.InitOperand(s0.tag);
  8112. END;
  8113. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8114. result := s0;
  8115. (* ---- BIT ----- *)
  8116. |Global.systemBit:
  8117. Evaluate(p0,s0);
  8118. ToMemory(s0.op,addressType,0);
  8119. ReuseCopy(res,s0.op);
  8120. ReleaseOperand(s0);
  8121. Evaluate(p1,s1);
  8122. Emit(Ror(position,res,res,s1.op));
  8123. ReleaseOperand(s1);
  8124. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8125. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8126. IF ~conditional THEN
  8127. InitOperand(result,ModeValue); result.op := res;
  8128. ELSE
  8129. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8130. BrL(falseLabel);
  8131. ReleaseIntermediateOperand(res);
  8132. END;
  8133. (* --- MSK ----*)
  8134. |Global.systemMsk:
  8135. Evaluate(p0,s0);
  8136. Evaluate(p1,s1);
  8137. ReuseCopy(res,s0.op);
  8138. ReleaseOperand(s0);
  8139. Emit(And(position,res,res,s1.op));
  8140. ReleaseOperand(s1);
  8141. InitOperand(result,ModeValue);
  8142. result.op := res;
  8143. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8144. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8145. Evaluate(p0,s0);
  8146. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8147. ReleaseOperand(s0);
  8148. InitOperand(result,ModeValue);
  8149. result.op := res;
  8150. (* ---- SYSTEM.GetStackPointer ----- *)
  8151. |Global.systemGetStackPointer:
  8152. InitOperand(result,ModeValue);
  8153. result.op := sp;
  8154. (* ---- SYSTEM.GetFramePointer ----- *)
  8155. |Global.systemGetFramePointer:
  8156. InitOperand(result,ModeValue);
  8157. result.op := fp;
  8158. (* ---- SYSTEM.GetActivity ----- *)
  8159. |Global.systemGetActivity:
  8160. ASSERT(backend.cooperative);
  8161. InitOperand(result,ModeValue);
  8162. result.op := ap;
  8163. (* ---- SYSTEM.SetStackPointer ----- *)
  8164. |Global.systemSetStackPointer:
  8165. Evaluate(p0,s0); (* *)
  8166. Emit(Mov(position,sp,s0.op));
  8167. ReleaseOperand(s0);
  8168. (* ---- SYSTEM.SetFramePointer ----- *)
  8169. |Global.systemSetFramePointer:
  8170. Evaluate(p0,s0); (* *)
  8171. Emit(Mov(position,fp,s0.op));
  8172. ReleaseOperand(s0);
  8173. (* ---- SYSTEM.Activity ----- *)
  8174. |Global.systemSetActivity:
  8175. ASSERT(backend.cooperative);
  8176. Evaluate(p0,s0); (* *)
  8177. Emit(Mov(position,ap,s0.op));
  8178. ReleaseOperand(s0);
  8179. (* ---- SYSTEM.VAL ----- *)
  8180. |Global.systemVal:
  8181. Expression(p1);
  8182. s1 := result;
  8183. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8184. IF s1.mode = ModeReference THEN
  8185. (* nothing to be done if not record type, just take over new type *)
  8186. IF (type IS SyntaxTree.RecordType) THEN
  8187. ReleaseIntermediateOperand(s1.tag);
  8188. s1.tag := TypeDescriptorAdr(type);
  8189. UseIntermediateOperand(s1.tag);
  8190. END;
  8191. result := s1;
  8192. ELSE (* copy over result to different type, may not use convert *)
  8193. itype := IntermediateCode.GetType(system,type);
  8194. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8195. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8196. Emit(Mov(position,s0.op,s1.op));
  8197. ReleaseOperand(s1);
  8198. InitOperand(result,ModeValue);
  8199. result.op := s0.op;
  8200. ELSE (* different size, must convert *)
  8201. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8202. Convert(s1.op, IntermediateCode.GetType(system,type));
  8203. result := s1;
  8204. END;
  8205. END;
  8206. (* ---- SYSTEM.GET ----- *)
  8207. |Global.systemGet:
  8208. Evaluate(p0,s0); (* adr *)
  8209. Designate(p1,s1); (* variable *)
  8210. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8211. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8212. Emit(Mov(position,s1.op,s0.op));
  8213. ReleaseOperand(s1);
  8214. ReleaseOperand(s0);
  8215. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8216. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8217. Evaluate(p0,s0); (* *)
  8218. Evaluate(p1,s1); (* variable *)
  8219. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8220. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8221. (* real part *)
  8222. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8223. Emit(Mov(position,res, s1.op));
  8224. ReleaseIntermediateOperand(res);
  8225. (* imaginary part *)
  8226. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8227. Emit(Mov(position,res, s1.tag));
  8228. ReleaseIntermediateOperand(res);
  8229. ReleaseOperand(s1);
  8230. ReleaseOperand(s0);
  8231. ELSE
  8232. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8233. ReleaseOperand(s0);
  8234. Emit(Mov(position,res,s1.op));
  8235. ReleaseIntermediateOperand(res);
  8236. ReleaseOperand(s1);
  8237. END;
  8238. (* ---- SYSTEM.MOVE ----- *)
  8239. |Global.systemMove:
  8240. Evaluate(p0,s0);
  8241. Evaluate(p1,s1);
  8242. Evaluate(p2,s2);
  8243. Emit(Copy(position,s1.op,s0.op,s2.op));
  8244. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8245. (* ---- SYSTEM.NEW ----- *)
  8246. |Global.systemNew:
  8247. Designate(p0,s0);
  8248. Emit(Push(position,s0.op));
  8249. ReleaseOperand(s0);
  8250. Evaluate(p1,s1);
  8251. Emit(Push(position,s1.op));
  8252. ReleaseOperand(s1);
  8253. (* push realtime flag: false by default *)
  8254. Emit(Push(position,false));
  8255. CallThis(position,"Heaps","NewSys",3);
  8256. (* ---- SYSTEM.CALL ----- *)
  8257. |Global.systemRef:
  8258. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8259. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8260. s0.mode := ModeValue;
  8261. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8262. result := s0
  8263. (* ---- INCR ----- *)
  8264. |Global.Incr:
  8265. Designate(p0,operand);
  8266. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8267. Dereference(operand,p0.type.resolved,FALSE);
  8268. END;
  8269. ASSERT(p1 # NIL);
  8270. Evaluate(p1,l);
  8271. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8272. ReleaseOperand(operand); ReleaseOperand(l);
  8273. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8274. (* ---- SUM ----- *)
  8275. |Global.Sum: HALT(200);
  8276. (* ---- ALL ----- *)
  8277. |Global.All: HALT(200);
  8278. (* ---- CAS ----- *)
  8279. |Global.Cas:
  8280. needsTrace := p0.NeedsTrace();
  8281. IF needsTrace THEN ModifyAssignments(true) END;
  8282. Designate(p0,s0);
  8283. Evaluate(p1,s1);
  8284. Evaluate(p2,s2);
  8285. IF needsTrace THEN
  8286. Emit(Push(position, s0.op));
  8287. Emit(Push(position, s1.op));
  8288. Emit(Push(position, s2.op));
  8289. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8290. ELSE
  8291. Emit(Cas(position,s0.op,s1.op,s2.op));
  8292. END;
  8293. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8294. IF needsTrace THEN ModifyAssignments(false) END;
  8295. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8296. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8297. IF conditional THEN
  8298. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8299. BrL(falseLabel);
  8300. ReleaseIntermediateOperand(res);
  8301. END;
  8302. (* ---- DIM ----- *)
  8303. |Global.Dim:
  8304. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8305. Designate(p0,s0);
  8306. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8307. Dereference(s0,p0.type.resolved,FALSE);
  8308. END;
  8309. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8310. ReleaseOperand(s0);
  8311. (* ---- RESHAPE ----- *)
  8312. |Global.Reshape:
  8313. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8314. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8315. left.SetType(procedure.type);
  8316. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8317. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8318. END;
  8319. (* ---- SYSTEM.TYPECODE ----- *)
  8320. |Global.systemTypeCode:
  8321. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8322. IF type.resolved IS SyntaxTree.PointerType THEN
  8323. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8324. END;
  8325. result.op := TypeDescriptorAdr(type);
  8326. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8327. result.mode := ModeValue;
  8328. (* ---- SYSTEM.TRACE ----- *)
  8329. |Global.systemTrace:
  8330. SystemTrace(x.parameters, x.position);
  8331. (* ----- CONNECT ------*)
  8332. |Global.Connect:
  8333. IF backend.cellsAreObjects THEN
  8334. PushPort(p0);
  8335. PushPort(p1);
  8336. IF p2 # NIL THEN
  8337. Evaluate(p2, s2);
  8338. Emit(Push(p2.position, s2.op));
  8339. ReleaseOperand(s2);
  8340. ELSE
  8341. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8342. END;
  8343. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8344. ELSE
  8345. Warning(x.position, "cannot run on final hardware");
  8346. END;
  8347. (* ----- DELEGATE ------*)
  8348. |Global.Delegate:
  8349. IF backend.cellsAreObjects THEN
  8350. PushPort(p0);
  8351. PushPort(p1);
  8352. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8353. ELSE
  8354. Warning(x.position, "cannot run on final hardware");
  8355. END;
  8356. (* ----- SEND ------*)
  8357. |Global.Send:
  8358. Evaluate(p0,s0);
  8359. Evaluate(p1,s1);
  8360. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8361. Emit(Push(position,s0.op));
  8362. Emit(Push(position,s1.op));
  8363. (*
  8364. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8365. *)
  8366. IF ~backend.cellsAreObjects THEN
  8367. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8368. END;
  8369. ReleaseOperand(s0);
  8370. ReleaseOperand(s1);
  8371. IF backend.cellsAreObjects THEN
  8372. CallThis(position,"ActiveCellsRuntime","Send",2);
  8373. ELSE
  8374. CallThis(position,ChannelModuleName,"Send",2);
  8375. END;
  8376. (* ----- RECEIVE ------*)
  8377. |Global.Receive:
  8378. Evaluate(p0,s0);
  8379. Emit(Push(position,s0.op));
  8380. Designate(p1,s1);
  8381. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8382. Emit(Push(position,s1.op));
  8383. IF p2 # NIL THEN
  8384. Designate(p2,s2);
  8385. Emit(Push(position,s2.op));
  8386. END;
  8387. (*
  8388. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8389. *)
  8390. IF ~backend.cellsAreObjects THEN
  8391. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8392. END;
  8393. ReleaseOperand(s0);
  8394. ReleaseOperand(s1);
  8395. ReleaseOperand(s2);
  8396. IF backend.cellsAreObjects THEN
  8397. IF p2 = NIL THEN
  8398. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8399. ELSE
  8400. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8401. END;
  8402. ELSE
  8403. IF p2 = NIL THEN
  8404. CallThis(position,ChannelModuleName,"Receive",2)
  8405. ELSE
  8406. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8407. END;
  8408. END;
  8409. | Global.systemSpecial:
  8410. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8411. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8412. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8413. (* determine if parameters are of the VAR kind *)
  8414. ASSERT(x.parameters.Length() <= 3);
  8415. formalParameter := procedureType.firstParameter;
  8416. FOR i := 0 TO x.parameters.Length() - 1 DO
  8417. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8418. formalParameter := formalParameter.nextParameter
  8419. END;
  8420. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8421. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8422. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8423. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8424. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8425. IF procedureType.returnType # NIL THEN
  8426. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8427. Emit(Result(position, res));
  8428. (*InitOperand(result,ModeValue);
  8429. result.op := res;
  8430. *)
  8431. IF ~conditional THEN
  8432. InitOperand(result,ModeValue); result.op := res;
  8433. ELSE
  8434. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8435. BrL(falseLabel);
  8436. ReleaseIntermediateOperand(res);
  8437. END;
  8438. END
  8439. ELSE (* function not yet implemented *)
  8440. Error(position,"not yet implemented");
  8441. END;
  8442. destination := dest;
  8443. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8444. END VisitBuiltinCallDesignator;
  8445. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8446. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8447. BEGIN
  8448. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8449. dest := destination; destination := emptyOperand;
  8450. Expression(x.left);
  8451. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8452. ELSIF isUnchecked THEN (* no check *)
  8453. ELSE
  8454. trueL := NewLabel();
  8455. falseL := NewLabel();
  8456. IF IsPointerToRecord(x.left.type,recordType) THEN
  8457. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8458. Emit(Mov(position,tag, result.op));
  8459. IF result.mode # ModeValue THEN
  8460. ptr := tag;
  8461. IntermediateCode.MakeMemory(ptr,addressType);
  8462. Emit(Mov(position,tag, ptr));
  8463. END;
  8464. IF ~backend.cooperative THEN
  8465. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8466. END;
  8467. IntermediateCode.MakeMemory(tag,addressType);
  8468. ELSE
  8469. tag := result.tag;
  8470. UseIntermediateOperand(tag);
  8471. END;
  8472. TypeTest(tag,x.type,trueL,falseL);
  8473. ReleaseIntermediateOperand(tag);
  8474. SetLabel(falseL);
  8475. EmitTrap(position,TypeCheckTrap);
  8476. SetLabel(trueL);
  8477. END;
  8478. destination := dest;
  8479. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8480. END VisitTypeGuardDesignator;
  8481. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8482. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8483. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8484. VAR label: Label; pc: LONGINT;
  8485. BEGIN
  8486. IF backend.cooperative & ~isUnchecked THEN
  8487. pc := section.pc;
  8488. label := NewLabel();
  8489. BrneL(label, operand.op, nil);
  8490. EmitTrap(position, NilPointerTrap);
  8491. SetLabel(label);
  8492. INC(statCoopNilCheck, section.pc - pc);
  8493. END;
  8494. END NilCheck;
  8495. BEGIN
  8496. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8497. ReuseCopy(dereferenced,operand.op);
  8498. ReleaseOperand(operand);
  8499. operand.mode := ModeReference;
  8500. operand.op := dereferenced;
  8501. operand.tag := dereferenced;
  8502. UseIntermediateOperand(operand.tag);
  8503. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8504. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8505. ReleaseIntermediateOperand(operand.tag);
  8506. operand.tag := TypeDescriptorAdr(type);
  8507. ELSE
  8508. IF ~backend.cooperative THEN
  8509. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8510. END;
  8511. IntermediateCode.MakeMemory(operand.tag,addressType);
  8512. END;
  8513. NilCheck(operand.op);
  8514. ELSIF type IS SyntaxTree.ArrayType THEN
  8515. IF isUnsafe THEN
  8516. NilCheck(operand.op);
  8517. ReleaseIntermediateOperand(operand.tag);
  8518. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8519. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8520. ELSE
  8521. operand.tag := emptyOperand;
  8522. END;
  8523. ELSE
  8524. NilCheck(operand.op);
  8525. IF backend.cooperative THEN
  8526. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8527. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8528. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8529. ELSE
  8530. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8531. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8532. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8533. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8534. END;
  8535. END;
  8536. ELSIF type IS SyntaxTree.MathArrayType THEN
  8537. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8538. IntermediateCode.MakeMemory(operand.op,addressType);
  8539. ELSE HALT(100);
  8540. END;
  8541. END Dereference;
  8542. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8543. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8544. BEGIN
  8545. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8546. dest := destination; destination := emptyOperand;
  8547. Evaluate(x.left,d);
  8548. type := x.type.resolved;
  8549. prevIsUnchecked := isUnchecked;
  8550. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8551. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8552. END;
  8553. Dereference(d,type,IsUnsafePointer(x.left.type));
  8554. isUnchecked := prevIsUnchecked;
  8555. result := d;
  8556. 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
  8557. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8558. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8559. END;
  8560. END;
  8561. destination := dest;
  8562. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8563. END VisitDereferenceDesignator;
  8564. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8565. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8566. BEGIN
  8567. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8568. dest := destination; destination := emptyOperand;
  8569. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8570. tag := result.op;
  8571. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8572. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8573. StaticCallOperand(result,procedure.super);
  8574. ReleaseIntermediateOperand(result.tag);
  8575. UseIntermediateOperand(tag); (* necessary ? *)
  8576. result.tag := tag;
  8577. destination := dest;
  8578. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8579. END VisitSupercallDesignator;
  8580. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8581. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8582. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8583. name: Basic.SegmentedName;
  8584. procedure: SyntaxTree.Procedure;
  8585. procedureType: SyntaxTree.ProcedureType;
  8586. BEGIN
  8587. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8588. dest := destination; destination := emptyOperand;
  8589. scope := currentScope;
  8590. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8591. scope := scope.outerScope;
  8592. END;
  8593. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8594. moduleSection := meta.ModuleSection();
  8595. IF backend.cooperative THEN
  8596. moduleOffset := 0;
  8597. ELSE
  8598. moduleOffset := moduleSection.pc;
  8599. END;
  8600. result.mode := ModeValue;
  8601. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8602. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8603. result.mode := ModeValue;
  8604. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8605. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8606. ELSE
  8607. GetBaseRegister(basereg,currentScope,scope);
  8608. InitOperand(result,ModeReference);
  8609. result.op := basereg;
  8610. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8611. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8612. parametersSize := ProcParametersSize(procedure);
  8613. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8614. IF backend.cooperative THEN
  8615. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8616. END;
  8617. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8618. MakeMemory(result.op, result.op, addressType, 0);
  8619. END;
  8620. (* tag must be loaded when dereferencing SELF pointer *)
  8621. END;
  8622. destination := dest;
  8623. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8624. END VisitSelfDesignator;
  8625. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8626. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8627. BEGIN
  8628. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8629. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8630. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8631. parameter := procedureType.returnParameter;
  8632. IF currentIsInline THEN
  8633. map := currentMapper.Get(NIL);
  8634. IF map # NIL THEN
  8635. Designate(map.to, result);
  8636. ELSE
  8637. HALT(200);
  8638. END;
  8639. RETURN;
  8640. END;
  8641. VisitParameter(parameter);
  8642. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8643. END VisitResultDesignator;
  8644. (** values *)
  8645. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8646. BEGIN
  8647. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8648. IF conditional THEN
  8649. IF x.value THEN BrL(trueLabel)
  8650. ELSE BrL(falseLabel)
  8651. END;
  8652. ELSE
  8653. InitOperand(result,ModeValue);
  8654. IF x.value THEN result.op := true ELSE result.op := false END;
  8655. END;
  8656. END VisitBooleanValue;
  8657. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8658. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8659. BEGIN
  8660. Global.GetModuleSegmentedName(module.module, name);
  8661. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8662. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8663. RETURN section
  8664. END GetDataSection;
  8665. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8666. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8667. BEGIN
  8668. type := vop.type;
  8669. data := GetDataSection();
  8670. pc := EnterImmediate(data,vop);
  8671. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8672. IntermediateCode.MakeMemory(vop, type);
  8673. END GetImmediateMem;
  8674. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8675. BEGIN
  8676. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8677. InitOperand(result,ModeValue);
  8678. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8679. IF ~supportedImmediate(result.op) &~inData THEN
  8680. GetImmediateMem(result.op)
  8681. END;
  8682. END VisitIntegerValue;
  8683. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8684. BEGIN
  8685. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8686. InitOperand(result,ModeValue);
  8687. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8688. END VisitCharacterValue;
  8689. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8690. BEGIN
  8691. IF Trace THEN TraceEnter("VisitSetValue") END;
  8692. InitOperand(result,ModeValue);
  8693. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8694. END VisitSetValue;
  8695. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8696. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8697. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8698. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8699. BEGIN
  8700. numberElements := x.elements.Length();
  8701. FOR i := 0 TO numberElements-1 DO
  8702. expression := x.elements.GetExpression(i);
  8703. IF expression IS SyntaxTree.MathArrayExpression THEN
  8704. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8705. ELSE
  8706. inData := TRUE;
  8707. Evaluate(expression,op);
  8708. irv.Emit(Data(position,op.op));
  8709. inData := FALSE;
  8710. ReleaseOperand(op);
  8711. END;
  8712. END;
  8713. END RecursiveData;
  8714. BEGIN
  8715. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8716. IF ~TryConstantDeclaration() THEN
  8717. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8718. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8719. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8720. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8721. ELSE
  8722. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8723. END;
  8724. RecursiveData(x.array);
  8725. InitOperand(result,ModeReference);
  8726. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8727. END
  8728. END VisitMathArrayValue;
  8729. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8730. VAR constant: Sections.Section;
  8731. BEGIN
  8732. IF constantDeclaration = NIL THEN
  8733. RETURN FALSE
  8734. ELSE
  8735. (* Is a constant in this module: did we generate it already? *)
  8736. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8737. IF constant # NIL THEN
  8738. InitOperand(result,ModeReference);
  8739. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8740. RETURN TRUE;
  8741. END;
  8742. END;
  8743. RETURN FALSE
  8744. END TryConstantDeclaration;
  8745. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8746. BEGIN
  8747. constantDeclaration := x;
  8748. x.value.resolved.Accept(SELF);
  8749. END VisitConstant;
  8750. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8751. BEGIN
  8752. IF Trace THEN TraceEnter("VisitRealValue") END;
  8753. InitOperand(result,ModeValue);
  8754. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8755. END VisitRealValue;
  8756. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8757. VAR
  8758. componentType: SyntaxTree.Type;
  8759. BEGIN
  8760. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8761. ASSERT(x.type IS SyntaxTree.ComplexType);
  8762. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8763. InitOperand(result,ModeValue);
  8764. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8765. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8766. END VisitComplexValue;
  8767. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8768. VAR i: LONGINT; name: Basic.SegmentedName;
  8769. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8770. BEGIN
  8771. IF Trace THEN TraceEnter("VisitStringValue") END;
  8772. IF ~TryConstantDeclaration() THEN
  8773. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8774. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8775. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8776. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8777. ELSE
  8778. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8779. END;
  8780. FOR i := 0 TO x.length-1 DO
  8781. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8782. irv.Emit(Data(position,op));
  8783. END;
  8784. InitOperand(result,ModeReference);
  8785. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8786. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8787. END
  8788. END VisitStringValue;
  8789. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8790. BEGIN
  8791. IF Trace THEN TraceEnter("VisitNilValue") END;
  8792. InitOperand(result,ModeValue);
  8793. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8794. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8795. END VisitNilValue;
  8796. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8797. BEGIN
  8798. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8799. InitOperand(result,ModeValue);
  8800. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8801. END VisitEnumerationValue;
  8802. (** symbols *)
  8803. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8804. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8805. END VisitImport;
  8806. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8807. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8808. BEGIN
  8809. IF scope # baseScope THEN
  8810. (* left := [fp+8] *)
  8811. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8812. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8813. ReuseCopy(left,right);
  8814. ReleaseIntermediateOperand(right);
  8815. scope := scope.outerScope; DEC(level);
  8816. (* { left := [left+8] } *)
  8817. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8818. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8819. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8820. Emit(Mov(position,left,right));
  8821. scope := scope.outerScope; DEC(level);
  8822. END;
  8823. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8824. result := left;
  8825. ELSE
  8826. result := fp;
  8827. END;
  8828. END GetBaseRegister;
  8829. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8830. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8831. BEGIN
  8832. IF Trace THEN TraceEnter("VisitVariable"); END;
  8833. type := x.type.resolved;
  8834. IF (x.useRegister) THEN
  8835. InitOperand(result, ModeValue);
  8836. IF x.registerNumber < 0 THEN
  8837. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8838. reg := x.registerNumber;
  8839. ELSE
  8840. reg := registerUsageCount.Map(x.registerNumber);
  8841. UseRegister(reg);
  8842. END;
  8843. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8844. ELSIF x.externalName # NIL THEN
  8845. InitOperand(result,ModeReference);
  8846. Basic.ToSegmentedName(x.externalName^, name);
  8847. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8848. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8849. InitOperand(result,ModeReference);
  8850. GetBaseRegister(result.op,currentScope,x.scope);
  8851. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8852. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8853. InitOperand(result,ModeReference);
  8854. GetCodeSectionNameForSymbol(x,name);
  8855. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8856. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8857. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8858. InitOperand(result,ModeReference);
  8859. GetCodeSectionNameForSymbol(x,name);
  8860. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8861. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8862. ELSE (* field, left designator must have been emitted *)
  8863. ASSERT(result.mode = ModeReference);
  8864. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8865. ReuseCopy(temp,result.op);
  8866. ReleaseIntermediateOperand(result.op);
  8867. result.op := temp;
  8868. END;
  8869. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8870. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8871. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8872. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8873. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8874. END;
  8875. END;
  8876. END;
  8877. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8878. ValueToCondition(result);
  8879. ELSIF type IS SyntaxTree.ProcedureType THEN
  8880. ReleaseIntermediateOperand(result.tag);
  8881. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8882. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8883. UseIntermediateOperand(result.tag);
  8884. ELSE
  8885. result.tag := nil; (* nil *)
  8886. END;
  8887. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8888. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8889. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8890. ReleaseIntermediateOperand(result.tag);
  8891. Global.GetSymbolSegmentedName(x,name);
  8892. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8893. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8894. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8895. ELSE
  8896. END;
  8897. ELSE
  8898. ReleaseIntermediateOperand(result.tag);
  8899. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8900. END;
  8901. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8902. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8903. ReleaseIntermediateOperand(result.tag);
  8904. result.tag := result.op;
  8905. UseIntermediateOperand(result.tag);
  8906. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8907. IntermediateCode.MakeMemory(result.op,addressType);
  8908. END;
  8909. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8910. ReleaseIntermediateOperand(result.tag);
  8911. result.tag := TypeDescriptorAdr(type);
  8912. UseIntermediateOperand(result.tag);
  8913. (* tag for pointer type computed not here but during dereferencing *)
  8914. END;
  8915. IF Trace THEN TraceExit("VisitVariable") END;
  8916. END VisitVariable;
  8917. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8918. BEGIN
  8919. VisitVariable(property);
  8920. END VisitProperty;
  8921. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8922. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8923. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8924. BEGIN
  8925. type := x.type.resolved;
  8926. IF Trace THEN TraceEnter("VisitParameter") END;
  8927. IF x.ownerType IS SyntaxTree.CellType THEN
  8928. ptype := x.type.resolved;
  8929. IF backend.cellsAreObjects THEN
  8930. ASSERT(result.mode = ModeReference);
  8931. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8932. ReuseCopy(temp,result.op);
  8933. ReleaseIntermediateOperand(result.op);
  8934. result.op := temp;
  8935. END;
  8936. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8937. RETURN;
  8938. ELSE
  8939. InitOperand(result,ModeReference);
  8940. GetCodeSectionNameForSymbol(x,name);
  8941. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8942. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8943. RETURN;
  8944. END;
  8945. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8946. InitOperand(result,ModeReference);
  8947. GetCodeSectionNameForSymbol(x,name);
  8948. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8949. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8950. RETURN
  8951. ELSE
  8952. GetBaseRegister(basereg,currentScope,x.scope);
  8953. InitOperand(result,ModeReference);
  8954. result.op := basereg;
  8955. END;
  8956. IF IsOpenArray(type) THEN
  8957. result.tag := basereg;
  8958. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8959. IntermediateCode.MakeMemory(result.op,addressType);
  8960. IF Global.IsOberonProcedure(x.ownerType) THEN
  8961. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8962. UseIntermediateOperand(result.tag);
  8963. ELSE
  8964. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8965. END;
  8966. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8967. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8968. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8969. ELSIF IsStaticArray(type) THEN
  8970. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8971. IntermediateCode.MakeMemory(result.op,addressType);
  8972. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8973. ELSIF type IS SyntaxTree.MathArrayType THEN
  8974. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8975. WITH type: SyntaxTree.MathArrayType DO
  8976. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8977. IF type.form = SyntaxTree.Tensor THEN
  8978. ELSIF type.form = SyntaxTree.Open THEN
  8979. result.tag := result.op;
  8980. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8981. IntermediateCode.MakeMemory(result.op,addressType);
  8982. UseIntermediateOperand(result.tag);
  8983. ELSIF type.form = SyntaxTree.Static THEN
  8984. IF x.kind = SyntaxTree.ConstParameter THEN
  8985. IntermediateCode.MakeMemory(result.op,addressType);
  8986. END;
  8987. ELSE HALT(100)
  8988. END;
  8989. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8990. IF type.form = SyntaxTree.Tensor THEN
  8991. ToMemory(result.op,addressType,0);
  8992. ELSIF type.form = SyntaxTree.Open THEN
  8993. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8994. ReuseCopy(result.tag, mem);
  8995. ReleaseIntermediateOperand(mem);
  8996. ReleaseIntermediateOperand(result.op);
  8997. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8998. ELSIF type.form = SyntaxTree.Static THEN
  8999. IntermediateCode.MakeMemory(result.op,addressType);
  9000. ELSE HALT(100)
  9001. END;
  9002. ELSE HALT(100)
  9003. END;
  9004. END;
  9005. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9006. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9007. IntermediateCode.MakeMemory(result.op,addressType);
  9008. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9009. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9010. END;
  9011. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  9012. ValueToCondition(result);
  9013. ELSIF type IS SyntaxTree.ProcedureType THEN
  9014. ReleaseIntermediateOperand(result.tag);
  9015. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9016. IF x.kind = SyntaxTree.VarParameter THEN
  9017. ReuseCopy(result.tag,result.op);
  9018. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9019. IntermediateCode.MakeMemory(result.tag,addressType);
  9020. ELSE
  9021. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9022. UseIntermediateOperand(result.tag);
  9023. END;
  9024. ELSE
  9025. result.tag := nil;
  9026. END;
  9027. (* tag for pointer type computed not here but during dereferencing *)
  9028. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9029. ReleaseIntermediateOperand(result.tag);
  9030. result.tag := basereg;
  9031. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9032. IntermediateCode.MakeMemory(result.tag,addressType);
  9033. UseIntermediateOperand(result.tag);
  9034. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9035. ReleaseIntermediateOperand(result.tag);
  9036. result.tag := TypeDescriptorAdr(type);
  9037. UseIntermediateOperand(result.tag);
  9038. END;
  9039. IF Trace THEN TraceExit("VisitParameter") END;
  9040. END VisitParameter;
  9041. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9042. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9043. BEGIN
  9044. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9045. (* left.p: left already emitted *)
  9046. tag := result.op; (* value of pointer to left *)
  9047. (* get type desc *)
  9048. tmp := result.tag;
  9049. IntermediateCode.MakeMemory(tmp,addressType);
  9050. (* get method adr *)
  9051. Reuse1(reg,tmp);
  9052. ReleaseIntermediateOperand(tmp);
  9053. IF backend.cooperative THEN
  9054. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9055. WHILE recordType.baseType # NIL DO
  9056. recordType := recordType.GetBaseRecord ();
  9057. END;
  9058. GetRecordTypeName (recordType,name);
  9059. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9060. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9061. offset := 0;
  9062. ELSE
  9063. offset := 2;
  9064. END;
  9065. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9066. ELSIF meta.simple THEN
  9067. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9068. ELSE
  9069. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9070. END;
  9071. InitOperand(operand,ModeReference);
  9072. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9073. operand.op := reg;
  9074. operand.tag := tag;
  9075. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9076. END DynamicCallOperand;
  9077. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9078. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9079. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9080. BEGIN
  9081. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9082. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9083. tag := operand.op;
  9084. ReleaseIntermediateOperand(operand.tag);
  9085. ELSE tag := nil
  9086. END;
  9087. IF x.isInline THEN
  9088. sectionType := Sections.InlineCodeSection;
  9089. ELSE
  9090. sectionType := Sections.CodeSection;
  9091. END;
  9092. IF x.externalName # NIL THEN
  9093. Basic.ToSegmentedName(x.externalName^, name);
  9094. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9095. ELSE
  9096. GetCodeSectionNameForSymbol(x, name);
  9097. IF (x.scope.ownerModule = module.module) THEN
  9098. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9099. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9100. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9101. IF source.pc = 0 THEN (* no code yet *)
  9102. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9103. END;
  9104. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9105. bits := x.procedureScope.body.code.inlineCode;
  9106. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9107. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9108. binary.CopyBits(bits, 0, bits.GetSize());
  9109. source.SetResolved(binary);
  9110. ELSE
  9111. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9112. END;
  9113. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9114. END;
  9115. InitOperand(operand,ModeValue);
  9116. operand.op := reg;
  9117. operand.tag := tag;
  9118. IF Trace THEN TraceExit("StaticCallOperand") END;
  9119. END StaticCallOperand;
  9120. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9121. (* handle expressions of the form designator.procedure or procedure *)
  9122. BEGIN
  9123. IF Trace THEN TraceEnter("VisitProcedure") END;
  9124. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9125. DynamicCallOperand(result,x);
  9126. ELSIF x.isInline THEN
  9127. StaticCallOperand(result,x);
  9128. ELSE
  9129. StaticCallOperand(result,x);
  9130. END;
  9131. IF Trace THEN TraceExit("VisitProcedure") END;
  9132. END VisitProcedure;
  9133. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9134. BEGIN
  9135. VisitProcedure(x);
  9136. END VisitOperator;
  9137. (** statements *)
  9138. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9139. BEGIN
  9140. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9141. Expression(x.call);
  9142. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9143. ReleaseOperand(result)
  9144. END;
  9145. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9146. END VisitProcedureCallStatement;
  9147. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9148. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9149. leftBase, rightBase: SyntaxTree.Type;
  9150. procedureName,s: SyntaxTree.IdentifierString;
  9151. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9152. size: LONGINT; rightKind: LONGINT;
  9153. dummy: IntermediateCode.Operand;
  9154. CONST moduleName = "FoxArrayBase";
  9155. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9156. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9157. BEGIN
  9158. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9159. IF base IS SyntaxTree.MathArrayType THEN
  9160. base := OpenArray(base(SyntaxTree.MathArrayType));
  9161. END;
  9162. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9163. result.SetArrayBase(base);
  9164. RETURN result
  9165. END OpenArray;
  9166. BEGIN
  9167. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9168. SaveRegisters();ReleaseUsedRegisters(saved);
  9169. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9170. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9171. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9172. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9173. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9174. IF leftType.form = SyntaxTree.Tensor THEN
  9175. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9176. ELSIF leftType.form = SyntaxTree.Open THEN
  9177. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9178. ELSIF leftType.form = SyntaxTree.Static THEN
  9179. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9180. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9181. END;
  9182. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9183. IF procedure = NIL THEN
  9184. s := "Instruction not supported on target, emulation procedure ";
  9185. Strings.Append(s,moduleName);
  9186. Strings.Append(s,".");
  9187. Strings.Append(s,procedureName);
  9188. Strings.Append(s," not present");
  9189. Error(position,s);
  9190. ELSE
  9191. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9192. parameter.SetType(leftType);
  9193. parameter.SetAccess(SyntaxTree.Internal);
  9194. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9195. parameter.SetKind(rightKind);
  9196. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9197. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9198. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9199. StaticCallOperand(result,procedure);
  9200. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9201. ReleaseOperand(result);
  9202. END;
  9203. RestoreRegisters(saved);
  9204. END;
  9205. END AssignMathArray;
  9206. VAR modifyAssignmentCounter := 0: LONGINT;
  9207. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9208. VAR processor,mem,dst: IntermediateCode.Operand;
  9209. BEGIN
  9210. IF value.intValue = true.intValue THEN
  9211. INC(modifyAssignmentCounter);
  9212. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9213. modifyAssignmentsPC := section.pc;
  9214. ELSE
  9215. DEC(modifyAssignmentCounter);
  9216. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9217. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9218. END;
  9219. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9220. dst := NewRegisterOperand (addressType);
  9221. Emit(Mov(position,dst, processor));
  9222. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9223. Emit(Mov(position,mem, value));
  9224. ReleaseIntermediateOperand(dst);
  9225. END ModifyAssignments;
  9226. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9227. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9228. BEGIN
  9229. type := left.type.resolved;
  9230. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9231. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9232. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9233. IF procedureType.returnParameter = parameter THEN
  9234. (* this is the only case where the destination can be dynamically smaller than the source
  9235. in all other cases the dynamic size has to be taken
  9236. *)
  9237. IF backend.cooperative THEN
  9238. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9239. ELSE
  9240. MakeMemory(mem, tag, addressType, 0);
  9241. END;
  9242. RETURN mem;
  9243. END;
  9244. END;
  9245. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9246. END CopySize;
  9247. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9248. VAR
  9249. leftO, rightO: Operand;
  9250. arg,mem, sizeOp: IntermediateCode.Operand;
  9251. leftType, rightType, componentType, base: SyntaxTree.Type;
  9252. size: LONGINT;
  9253. parameters: SyntaxTree.ExpressionList;
  9254. procedure: SyntaxTree.Procedure;
  9255. call: SyntaxTree.ProcedureCallDesignator;
  9256. designator: SyntaxTree.Designator;
  9257. saved: RegisterEntry;
  9258. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9259. VAR procedureType: SyntaxTree.ProcedureType;
  9260. BEGIN
  9261. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9262. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9263. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9264. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9265. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9266. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9267. IF right.id = Global.Reshape THEN RETURN TRUE
  9268. END;
  9269. END;
  9270. END;
  9271. END;
  9272. RETURN FALSE
  9273. END CanPassAsResultParameter;
  9274. BEGIN
  9275. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9276. leftType := left.type.resolved; rightType:= right.type.resolved;
  9277. IF backend.cooperative & left.NeedsTrace() THEN
  9278. ModifyAssignments(true);
  9279. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9280. Designate(right, rightO);
  9281. Designate(left, leftO);
  9282. ASSERT(leftO.mode = ModeReference);
  9283. TransferToRegister(leftO.op, leftO.op);
  9284. TransferToRegister(rightO.op, rightO.op);
  9285. Emit(Push(position, leftO.op));
  9286. Emit(Push(position, rightO.op));
  9287. CallAssignMethod(leftO.op, rightO.op, left.type);
  9288. Emit(Pop(position, rightO.op));
  9289. Emit(Pop(position, leftO.op));
  9290. sizeOp := CopySize(left, leftO.tag);
  9291. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9292. ReleaseIntermediateOperand(sizeOp);
  9293. ReleaseOperand(leftO);
  9294. ReleaseOperand(rightO);
  9295. ELSE
  9296. Evaluate(right,rightO);
  9297. Designate(left,leftO);
  9298. ASSERT(leftO.mode = ModeReference);
  9299. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9300. (* copy procedure address first *)
  9301. MakeMemory(mem,leftO.op,addressType,0);
  9302. Emit(Mov(position,mem,rightO.op));
  9303. ReleaseIntermediateOperand(mem);
  9304. (* copy pointer address *)
  9305. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9306. CallAssignPointer(leftO.tag, rightO.tag);
  9307. ELSE
  9308. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9309. CallAssignPointer(leftO.op, rightO.op);
  9310. END;
  9311. ReleaseOperand(leftO);
  9312. ReleaseOperand(rightO);
  9313. END;
  9314. ModifyAssignments(false);
  9315. RETURN;
  9316. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9317. SaveRegisters();ReleaseUsedRegisters(saved);
  9318. IF SemanticChecker.IsPointerType(leftType) THEN
  9319. Evaluate(right,rightO);
  9320. Designate(left,leftO);
  9321. Emit(Push(position,leftO.op));
  9322. ReleaseOperand(leftO);
  9323. Emit(Push(position,rightO.op));
  9324. ReleaseOperand(rightO);
  9325. CallThis(position,"Heaps","Assign",2);
  9326. ELSIF leftType.IsRecordType() THEN
  9327. Designate(right,rightO);
  9328. Designate(left,leftO);
  9329. Emit(Push(position,leftO.op));
  9330. Emit(Push(position,leftO.tag)); (* type desc *)
  9331. ReleaseOperand(leftO);
  9332. Emit(Push(position,rightO.op));
  9333. ReleaseOperand(rightO);
  9334. CallThis(position,"Heaps","AssignRecord",3);
  9335. ELSIF IsStaticArray(leftType) THEN
  9336. size := StaticArrayNumElements(leftType);
  9337. base := StaticArrayBaseType(leftType);
  9338. Designate(right,rightO);
  9339. Designate(left,leftO);
  9340. Emit(Push(position,leftO.op));
  9341. ReleaseOperand(leftO);
  9342. arg := TypeDescriptorAdr(base);
  9343. Emit(Push(position,arg));
  9344. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9345. Emit(Push(position,rightO.op));
  9346. ReleaseOperand(rightO);
  9347. CallThis(position,"Heaps","AssignArray",4);
  9348. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9349. size := StaticMathArrayNumElements(leftType);
  9350. base := StaticMathArrayBaseType(leftType);
  9351. Designate(right,rightO);
  9352. Designate(left,leftO);
  9353. Emit(Push(position,leftO.op));
  9354. ReleaseOperand(leftO);
  9355. arg := TypeDescriptorAdr(base);
  9356. Emit(Push(position,arg));
  9357. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9358. Emit(Push(position,rightO.op));
  9359. ReleaseOperand(rightO);
  9360. CallThis(position,"Heaps","AssignArray",4);
  9361. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9362. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9363. Evaluate(right,rightO);
  9364. Designate(left,leftO);
  9365. MakeMemory(mem,leftO.op,addressType,0);
  9366. Emit(Mov(position,mem,rightO.op));
  9367. ReleaseIntermediateOperand(mem);
  9368. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9369. Emit (Push(position, leftO.tag));
  9370. ReleaseOperand(leftO);
  9371. Emit (Push(position, rightO.tag));
  9372. ReleaseOperand(rightO);
  9373. CallThis(position,"Heaps","Assign", 2);
  9374. ELSE HALT(100); (* missing ? *)
  9375. END;
  9376. RestoreRegisters(saved);
  9377. RETURN;
  9378. END;
  9379. IF CanPassAsResultParameter(right) THEN
  9380. procedureResultDesignator := left(SyntaxTree.Designator);
  9381. Expression(right);
  9382. procedureResultDesignator := NIL;
  9383. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9384. (* left <-- ALIAS OF right: zerocopy *)
  9385. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9386. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9387. designator.SetType(procedure.type);
  9388. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9389. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9390. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9391. END;
  9392. ELSIF leftType IS SyntaxTree.RangeType THEN
  9393. (* LHS is of array range type *)
  9394. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9395. Evaluate(right, rightO);
  9396. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9397. (* first *)
  9398. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9399. Emit(Mov(position,mem, rightO.op));
  9400. ReleaseIntermediateOperand(mem);
  9401. (* last *)
  9402. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9403. Emit(Mov(position,mem, rightO.tag));
  9404. ReleaseIntermediateOperand(mem);
  9405. (* step *)
  9406. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9407. Emit(Mov(position,mem, rightO.extra));
  9408. ReleaseIntermediateOperand(mem);
  9409. ReleaseOperand(rightO);
  9410. ReleaseOperand(leftO)
  9411. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9412. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9413. Evaluate(right, rightO);
  9414. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9415. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9416. (* real part *)
  9417. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9418. Emit(Mov(position,mem, rightO.op));
  9419. ReleaseIntermediateOperand(mem);
  9420. (* imaginary part *)
  9421. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9422. Emit(Mov(position,mem, rightO.tag));
  9423. ReleaseIntermediateOperand(mem);
  9424. ReleaseOperand(rightO);
  9425. ReleaseOperand(leftO)
  9426. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9427. OR (leftType IS SyntaxTree.PortType) THEN
  9428. (* rightO := leftO;*)
  9429. Evaluate(right,rightO);
  9430. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9431. Designate(left,leftO);
  9432. IF leftO.mode = ModeReference THEN
  9433. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9434. destination := mem;
  9435. ELSE
  9436. destination := leftO.op;
  9437. END;
  9438. ReleaseOperand(leftO);
  9439. IF destination.mode # IntermediateCode.Undefined THEN
  9440. Emit(Mov(position,destination,rightO.op));
  9441. END;
  9442. ReleaseOperand(rightO);
  9443. ReleaseIntermediateOperand(mem);
  9444. IntermediateCode.InitOperand(destination);
  9445. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9446. Evaluate(right,rightO);
  9447. Designate(left,leftO);
  9448. MakeMemory(mem,leftO.op,addressType,0);
  9449. Emit(Mov(position,mem,rightO.op));
  9450. ReleaseIntermediateOperand(mem);
  9451. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9452. (* delegate *)
  9453. (*
  9454. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9455. *)
  9456. Emit(Mov(position,leftO.tag,rightO.tag));
  9457. END;
  9458. ReleaseOperand(leftO);
  9459. ReleaseOperand(rightO);
  9460. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9461. Designate(right,rightO);
  9462. Designate(left,leftO);
  9463. sizeOp := CopySize(left, leftO.tag);
  9464. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9465. ReleaseIntermediateOperand(sizeOp);
  9466. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9467. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9468. IF (rightType IS SyntaxTree.StringType) THEN
  9469. CopyString(left,right);
  9470. 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
  9471. Designate(right,rightO);
  9472. Designate(left,leftO);
  9473. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9474. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9475. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9476. ELSE
  9477. HALT(201)
  9478. END;
  9479. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9480. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9481. Designate(right,rightO);
  9482. Designate(left,leftO);
  9483. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9484. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9485. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9486. Emit(Mov(position, leftO.op, mem));
  9487. ReleaseIntermediateOperand(mem);
  9488. ELSE
  9489. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9490. END;
  9491. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9492. ELSE
  9493. AssignMathArray(left,right);
  9494. END;
  9495. ELSE
  9496. HALT(200);
  9497. END;
  9498. END Assign;
  9499. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9500. BEGIN
  9501. IF Trace THEN TraceEnter("VisitAssignment") END;
  9502. Assign(x.left,x.right);
  9503. IF Trace THEN TraceExit("VisitAssignment") END;
  9504. END VisitAssignment;
  9505. PROCEDURE EmitCooperativeSwitch;
  9506. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9507. BEGIN
  9508. ASSERT (cooperativeSwitches);
  9509. pc := section.pc;
  9510. IF lastSwitchPC = section.pc THEN RETURN END;
  9511. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9512. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9513. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9514. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9515. INC(statCoopSwitch, section.pc - pc);
  9516. END EmitCooperativeSwitch;
  9517. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9518. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9519. BEGIN
  9520. p0 := communication.left; p1 := communication.right;
  9521. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9522. Evaluate(p0,s0);
  9523. Evaluate(p1,s1);
  9524. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9525. Emit(Push(position,s0.op));
  9526. Emit(Push(position,s1.op));
  9527. (*
  9528. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9529. *)
  9530. IF ~backend.cellsAreObjects THEN
  9531. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9532. END;
  9533. ReleaseOperand(s0);
  9534. ReleaseOperand(s1);
  9535. IF backend.cellsAreObjects THEN
  9536. CallThis(position,"ActiveCellsRuntime","Send",2);
  9537. ELSE
  9538. CallThis(position,ChannelModuleName,"Send",2);
  9539. END;
  9540. (* ----- RECEIVE ------*)
  9541. ELSE
  9542. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9543. tmp := p0; p0 := p1; p1 := tmp;
  9544. END;
  9545. Evaluate(p0,s0);
  9546. Emit(Push(position,s0.op));
  9547. Designate(p1,s1);
  9548. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9549. Emit(Push(position,s1.op));
  9550. (*
  9551. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9552. *)
  9553. IF ~backend.cellsAreObjects THEN
  9554. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9555. END;
  9556. ReleaseOperand(s0);
  9557. ReleaseOperand(s1);
  9558. IF backend.cellsAreObjects THEN
  9559. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9560. ELSE
  9561. CallThis(position,ChannelModuleName,"Receive",2)
  9562. END;
  9563. END;
  9564. END VisitCommunicationStatement;
  9565. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9566. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9567. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9568. VAR true, false: Label; condition, value: BOOLEAN;
  9569. BEGIN
  9570. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9571. IF condition THEN
  9572. true := NewLabel();
  9573. false := NewLabel();
  9574. Condition(if.condition,true,false);
  9575. SetLabel(true);
  9576. StatementSequence(if.statements);
  9577. BrL(end);
  9578. SetLabel(false);
  9579. ELSE
  9580. IF value THEN (* always true *)
  9581. escape := TRUE;
  9582. StatementSequence(if.statements);
  9583. (* no branch necessary -- rest skipped *)
  9584. END;
  9585. END;
  9586. END IfPart;
  9587. BEGIN
  9588. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9589. end := NewLabel();
  9590. elsifs := x.ElsifParts();
  9591. IfPart(x.ifPart);
  9592. FOR i := 0 TO elsifs-1 DO
  9593. IF ~escape THEN
  9594. elsif := x.GetElsifPart(i);
  9595. IfPart(elsif);
  9596. END;
  9597. END;
  9598. IF (x.elsePart # NIL) & ~escape THEN
  9599. StatementSequence(x.elsePart);
  9600. END;
  9601. SetLabel(end);
  9602. IF Trace THEN TraceExit("VisitIfStatement") END;
  9603. END VisitIfStatement;
  9604. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9605. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9606. BEGIN
  9607. (*IF x.variable.type.resolved = x.type.resolved THEN
  9608. (* always true, do nothing *)
  9609. ELSE*)
  9610. Designate(x.variable,res);
  9611. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9612. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9613. END;
  9614. trueL := NewLabel();
  9615. TypeTest(res.tag,x.type,trueL,falseL);
  9616. ReleaseOperand(res);
  9617. SetLabel(trueL);
  9618. StatementSequence(x.statements);
  9619. BrL(endL);
  9620. END WithPart;
  9621. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9622. VAR endL,falseL: Label;i: LONGINT;
  9623. BEGIN
  9624. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9625. endL := NewLabel();
  9626. FOR i := 0 TO x.WithParts()-1 DO
  9627. falseL := NewLabel();
  9628. WithPart(x.GetWithPart(i),falseL,endL);
  9629. SetLabel(falseL);
  9630. END;
  9631. IF x.elsePart = NIL THEN
  9632. IF ~isUnchecked THEN
  9633. EmitTrap(position,WithTrap);
  9634. END;
  9635. ELSE
  9636. StatementSequence(x.elsePart)
  9637. END;
  9638. SetLabel(endL);
  9639. IF Trace THEN TraceExit("VisitWithStatement") END;
  9640. END VisitWithStatement;
  9641. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9642. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9643. out,else: Label; label: Label;
  9644. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9645. symbol: SyntaxTree.Symbol;
  9646. BEGIN
  9647. (*! split case statement into if-elsif statements for large case label lists *)
  9648. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9649. range := x.max-x.min+1;
  9650. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9651. END;
  9652. size := LONGINT(range);
  9653. Evaluate(x.variable,var);
  9654. ReuseCopy(tmp,var.op);
  9655. ReleaseIntermediateOperand(var.op);
  9656. var.op := tmp;
  9657. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9658. Convert(var.op,addressType);
  9659. else := NewLabel();
  9660. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9661. (*
  9662. UniqueId(name,module.module,"case",caseId);
  9663. *)
  9664. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9665. Global.GetModuleSegmentedName(module.module, name);
  9666. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9667. symbol := SyntaxTree.NewSymbol(name[1]);
  9668. symbol.SetScope(moduleScope);
  9669. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9670. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9671. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9672. ReuseCopy(res,var.op);
  9673. ReleaseOperand(var);
  9674. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9675. Emit(Add(position,res,res,jmp));
  9676. IntermediateCode.MakeMemory(res,addressType);
  9677. Emit(Br(position,res));
  9678. ReleaseIntermediateOperand(res);
  9679. out := NewLabel();
  9680. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9681. part := x.GetCasePart(i);
  9682. constant := part.firstConstant;
  9683. label := NewLabel();
  9684. SetLabel(label);
  9685. WHILE(constant # NIL) DO (* case labels for this case part *)
  9686. FOR j := constant.min TO constant.max DO
  9687. fixups[j-x.min] := label;
  9688. END;
  9689. constant := constant.next;
  9690. END;
  9691. StatementSequence(part.statements);
  9692. BrL(out);
  9693. END;
  9694. SetLabel(else);
  9695. FOR i := 0 TO size-1 DO
  9696. IF fixups[i] = NIL THEN
  9697. fixups[i] := else;
  9698. END;
  9699. END;
  9700. IF x.elsePart # NIL THEN
  9701. StatementSequence(x.elsePart);
  9702. ELSIF ~isUnchecked THEN
  9703. EmitTrap(position,CaseTrap);
  9704. END;
  9705. SetLabel(out);
  9706. FOR i := 0 TO size-1 DO
  9707. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9708. section.Emit(Data(position,op));
  9709. END;
  9710. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9711. END VisitCaseStatement;
  9712. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9713. VAR start: Label; true,false: Label;
  9714. BEGIN
  9715. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9716. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9717. start := NewLabel();
  9718. true := NewLabel();
  9719. false := NewLabel();
  9720. SetLabel(start);
  9721. Condition(x.condition,true,false);
  9722. SetLabel(true);
  9723. StatementSequence(x.statements);
  9724. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9725. BrL(start);
  9726. SetLabel(false);
  9727. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9728. END VisitWhileStatement;
  9729. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9730. VAR false,true: Label;
  9731. BEGIN
  9732. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9733. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9734. true := NewLabel();
  9735. false := NewLabel();
  9736. SetLabel(false);
  9737. StatementSequence(x.statements);
  9738. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9739. Condition(x.condition,true,false);
  9740. SetLabel(true);
  9741. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9742. END VisitRepeatStatement;
  9743. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9744. VAR
  9745. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9746. temporaryVariable: SyntaxTree.Variable;
  9747. temporaryVariableDesignator : SyntaxTree.Designator;
  9748. BEGIN
  9749. IF Trace THEN TraceEnter("VisitForStatement") END;
  9750. true := NewLabel();
  9751. false := NewLabel();
  9752. start := NewLabel();
  9753. Assign(x.variable,x.from);
  9754. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9755. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9756. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9757. Assign(temporaryVariableDesignator,x.to);
  9758. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9759. IF by > 0 THEN
  9760. cmp := Scanner.LessEqual
  9761. ELSE
  9762. cmp := Scanner.GreaterEqual
  9763. END;
  9764. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9765. binary.SetType(system.booleanType);
  9766. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9767. SetLabel(start);
  9768. Condition(binary,true,false);
  9769. SetLabel(true);
  9770. StatementSequence(x.statements);
  9771. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9772. binary.SetType(x.variable.type);
  9773. Assign(x.variable,binary);
  9774. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9775. BrL(start);
  9776. SetLabel(false);
  9777. IF Trace THEN TraceExit("VisitForStatement") END;
  9778. END VisitForStatement;
  9779. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9780. VAR prevLoop: Label;
  9781. BEGIN
  9782. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9783. prevLoop := currentLoop;
  9784. currentLoop := NewLabel();
  9785. StatementSequence(x.statements);
  9786. SetLabel(currentLoop);
  9787. currentLoop := prevLoop;
  9788. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9789. END VisitExitableBlock;
  9790. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9791. VAR prevLoop,start: Label;
  9792. BEGIN
  9793. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9794. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9795. start := NewLabel();
  9796. prevLoop := currentLoop;
  9797. SetLabel(start);
  9798. currentLoop := NewLabel();
  9799. StatementSequence(x.statements);
  9800. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9801. BrL(start);
  9802. SetLabel(currentLoop);
  9803. currentLoop := prevLoop;
  9804. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9805. END VisitLoopStatement;
  9806. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9807. VAR outer: SyntaxTree.Statement;
  9808. BEGIN
  9809. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9810. IF locked THEN (* r if we jump out of an exclusive block *)
  9811. outer := x.outer;
  9812. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9813. outer := outer.outer;
  9814. END;
  9815. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9816. Lock(FALSE);
  9817. END;
  9818. END;
  9819. BrL(currentLoop);
  9820. IF Trace THEN TraceExit("VisitExitStatement") END;
  9821. END VisitExitStatement;
  9822. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9823. VAR
  9824. expression, parameterDesignator: SyntaxTree.Expression;
  9825. type, componentType: SyntaxTree.Type;
  9826. res, right: Operand;
  9827. left, mem, reg: IntermediateCode.Operand;
  9828. parameter: SyntaxTree.Parameter;
  9829. procedure: SyntaxTree.Procedure;
  9830. procedureType: SyntaxTree.ProcedureType;
  9831. returnTypeOffset: LONGINT;
  9832. delegate: BOOLEAN;
  9833. map: SymbolMap;
  9834. callingConvention, parametersSize: LONGINT;
  9835. BEGIN
  9836. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9837. expression := x.returnValue;
  9838. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9839. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9840. IF currentIsInline THEN
  9841. IF expression # NIL THEN
  9842. map := currentMapper.Get(NIL);
  9843. IF map # NIL THEN
  9844. Assign(map.to, expression);
  9845. ELSE
  9846. Evaluate(expression,res);
  9847. Emit(Return(position,res.op));
  9848. ReleaseOperand(res);
  9849. END;
  9850. END;
  9851. BrL(currentInlineExit);
  9852. RETURN;
  9853. END;
  9854. IF expression # NIL THEN
  9855. type := expression.type.resolved;
  9856. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9857. IF locked THEN Lock(FALSE) END;
  9858. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9859. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9860. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9861. 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
  9862. (* return without structured return parameter *)
  9863. Evaluate(expression,res);
  9864. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9865. IF locked OR profile THEN
  9866. Emit(Push(position,res.op));
  9867. IF delegate THEN HALT(200) END;
  9868. ReleaseOperand(res);
  9869. IF locked THEN Lock(FALSE) END;
  9870. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9871. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9872. reg := NewRegisterOperand(res.op.type);
  9873. Emit(Pop(position,reg));
  9874. Emit(Return(position,reg));
  9875. ReleaseIntermediateOperand(reg);
  9876. ELSE
  9877. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9878. Emit(Return(position,res.op));
  9879. ReleaseOperand(res);
  9880. END;
  9881. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9882. THEN
  9883. (* return using structured return parameter *)
  9884. 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)
  9885. OR SemanticChecker.IsPointerType(type));
  9886. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9887. parameter :=procedureType.returnParameter;
  9888. ASSERT(parameter # NIL);
  9889. returnTypeOffset := parameter.offsetInBits;
  9890. (*
  9891. IF parameter# NIL THEN
  9892. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9893. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9894. ELSE
  9895. returnTypeOffset := system.offsetFirstParameter
  9896. END;
  9897. *)
  9898. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9899. IF type IS SyntaxTree.RangeType THEN
  9900. (* array range type *)
  9901. Evaluate(expression, right);
  9902. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9903. Emit(Mov(position,mem, right.op)); (* first *)
  9904. ReleaseIntermediateOperand(mem);
  9905. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9906. Emit(Mov(position,mem, right.tag)); (* last *)
  9907. ReleaseIntermediateOperand(mem);
  9908. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9909. Emit(Mov(position,mem, right.extra)); (* step *)
  9910. ReleaseIntermediateOperand(mem);
  9911. ReleaseOperand(right);
  9912. ELSIF type IS SyntaxTree.ComplexType THEN
  9913. Evaluate(expression, right);
  9914. componentType := type(SyntaxTree.ComplexType).componentType;
  9915. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9916. Emit(Mov(position,mem, right.op)); (* real part *)
  9917. ReleaseIntermediateOperand(mem);
  9918. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9919. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9920. ReleaseIntermediateOperand(mem);
  9921. ReleaseOperand(right);
  9922. ELSE (* covers cases: pointer / record / array *)
  9923. parameter := procedureType.returnParameter;
  9924. checker.SetCurrentScope(currentScope);
  9925. ASSERT(parameter # NIL);
  9926. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9927. Assign(parameterDesignator,expression);
  9928. END;
  9929. ReleaseIntermediateOperand(left);
  9930. IF locked THEN Lock(FALSE) END;
  9931. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9932. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9933. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9934. parameter := procedureType.returnParameter;
  9935. checker.SetCurrentScope(currentScope);
  9936. IF parameter = NIL THEN
  9937. Error(procedure.position, "structured return of parameter of procedure not found");
  9938. ELSE
  9939. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9940. Assign(parameterDesignator,expression);
  9941. END;
  9942. IF locked THEN Lock(FALSE) END;
  9943. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9944. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9945. ELSE
  9946. HALT(200);
  9947. END;
  9948. ELSE
  9949. IF locked THEN Lock(FALSE) END;
  9950. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9951. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9952. END;
  9953. IF backend.cooperative THEN
  9954. BrL(exitLabel);
  9955. ELSE
  9956. callingConvention := procedureType.callingConvention;
  9957. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9958. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9959. ELSE
  9960. parametersSize := 0;
  9961. END;
  9962. EmitLeave(section, position,procedure, callingConvention);
  9963. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  9964. END;
  9965. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9966. END VisitReturnStatement;
  9967. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9968. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9969. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9970. statements: SyntaxTree.StatementSequence;
  9971. name, suffix: SyntaxTree.IdentifierString;
  9972. BEGIN
  9973. Strings.IntToStr(awaitProcCounter,suffix);
  9974. Strings.Concat("@AwaitProcedure",suffix,name);
  9975. identifier := SyntaxTree.NewIdentifier(name);
  9976. INC(awaitProcCounter);
  9977. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9978. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9979. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9980. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9981. procedure.SetAccess(SyntaxTree.Hidden);
  9982. procedure.SetScope(currentScope);
  9983. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9984. procedureType.SetReturnType(system.booleanType);
  9985. procedure.SetType(procedureType);
  9986. body := SyntaxTree.NewBody(x.position,procedureScope);
  9987. procedureScope.SetBody(body);
  9988. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9989. returnStatement.SetReturnValue(x.condition);
  9990. statements := SyntaxTree.NewStatementSequence();
  9991. statements.AddStatement(returnStatement);
  9992. body.SetStatementSequence(statements);
  9993. currentScope.AddProcedure(procedure);
  9994. RETURN procedure
  9995. END MakeAwaitProcedure;
  9996. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  9997. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9998. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9999. BEGIN
  10000. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10001. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10002. IF backend.cooperative THEN
  10003. start := NewLabel();
  10004. true := NewLabel();
  10005. false := NewLabel();
  10006. SetLabel(start);
  10007. Condition(x.condition,true,false);
  10008. SetLabel(false);
  10009. PushSelfPointer();
  10010. CallThis(position,"ExclusiveBlocks","Await",1);
  10011. BrL(start);
  10012. SetLabel(true);
  10013. PushSelfPointer();
  10014. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10015. ELSE
  10016. proc := MakeAwaitProcedure(x);
  10017. Emit(Push(position,fp));
  10018. GetCodeSectionNameForSymbol(proc,name);
  10019. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10020. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10021. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10022. Emit(Call(position,call,ProcParametersSize(proc)));
  10023. Emit(Result(position,res));
  10024. (*
  10025. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10026. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10027. *)
  10028. InitOperand(result,ModeValue);
  10029. result.op := res;
  10030. label := NewLabel();
  10031. BreqL(label, result.op, SELF.true);
  10032. ReleaseOperand(result);
  10033. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10034. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10035. Emit(Push(position,res));
  10036. Emit(Push(position,fp));
  10037. PushSelfPointer();
  10038. Emit(Push(position,nil));
  10039. CallThis(position,"Objects","Await",4);
  10040. SetLabel(label);
  10041. END;
  10042. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10043. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10044. END VisitAwaitStatement;
  10045. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10046. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10047. BEGIN
  10048. FOR i := 0 TO x.Length() - 1 DO
  10049. statement := x.GetStatement( i );
  10050. Statement(statement);
  10051. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10052. END;
  10053. END StatementSequence;
  10054. PROCEDURE PushSelfPointer;
  10055. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10056. procedureType: SyntaxTree.ProcedureType;
  10057. BEGIN
  10058. scope := currentScope;
  10059. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10060. scope := scope.outerScope;
  10061. END;
  10062. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10063. moduleSection := meta.ModuleSection();
  10064. IF backend.cooperative THEN
  10065. moduleOffset := 0;
  10066. ELSE
  10067. moduleOffset := moduleSection.pc;
  10068. END;
  10069. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10070. ELSE
  10071. GetBaseRegister(op.op,currentScope,scope);
  10072. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10073. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10074. parametersSize := ProcParametersSize(procedure);
  10075. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10076. IF backend.cooperative THEN
  10077. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10078. END;
  10079. IntermediateCode.MakeMemory(op.op,addressType);
  10080. END;
  10081. Emit(Push(position,op.op));
  10082. ReleaseOperand(op);
  10083. END PushSelfPointer;
  10084. PROCEDURE Lock(lock: BOOLEAN);
  10085. BEGIN
  10086. IF Trace THEN TraceEnter("Lock") END;
  10087. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10088. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10089. ASSERT(modifyAssignmentCounter = 0);
  10090. IF dump # NIL THEN
  10091. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10092. dump.Ln;dump.Update;
  10093. END;
  10094. PushSelfPointer;
  10095. IF backend.cooperative THEN
  10096. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10097. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10098. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10099. END;
  10100. ELSE
  10101. Emit(Push(position,true));
  10102. IF lock THEN CallThis(position,"Objects","Lock",2)
  10103. ELSE CallThis(position,"Objects","Unlock",2);
  10104. END;
  10105. END;
  10106. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10107. IF Trace THEN TraceExit("Lock") END;
  10108. END Lock;
  10109. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10110. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10111. BEGIN
  10112. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10113. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10114. previouslyUnchecked := isUnchecked;
  10115. isUnchecked := isUnchecked OR x.isUnchecked;
  10116. previouslyCooperativeSwitches := cooperativeSwitches;
  10117. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10118. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10119. IF x.statements # NIL THEN
  10120. StatementSequence(x.statements);
  10121. END;
  10122. IF (x IS SyntaxTree.Body) THEN
  10123. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10124. section.SetFinally(section.pc);
  10125. StatementSequence(x(SyntaxTree.Body).finally)
  10126. ELSIF x.isExclusive THEN
  10127. end := NewLabel();
  10128. BrL(end);
  10129. section.SetFinally(section.pc);
  10130. Lock(FALSE);
  10131. EmitTrap(position,RethrowTrap);
  10132. SetLabel(end);
  10133. END;
  10134. END;
  10135. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10136. isUnchecked := previouslyUnchecked;
  10137. cooperativeSwitches := previouslyCooperativeSwitches;
  10138. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10139. END VisitStatementBlock;
  10140. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10141. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10142. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10143. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10144. procedure: SyntaxTree.Procedure;
  10145. map: SymbolMap;
  10146. callingConvention, parametersSize: LONGINT;
  10147. BEGIN
  10148. scope := currentScope;
  10149. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10150. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10151. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10152. return := emptyOperand;
  10153. IF Trace THEN TraceEnter("VisitCode") END;
  10154. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10155. NEW(in, x.inRules.Length());
  10156. FOR i := 0 TO LEN(in)-1 DO
  10157. statement := x.inRules.GetStatement(i);
  10158. WITH statement: SyntaxTree.Assignment DO
  10159. Evaluate(statement.right, operand);
  10160. result := operand.op;
  10161. NEW(str, 64);
  10162. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10163. in[i] := result; IntermediateCode.SetString(in[i], str);
  10164. ReleaseIntermediateOperand(operand.tag);
  10165. END;
  10166. END;
  10167. ELSE in := NIL
  10168. END;
  10169. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10170. NEW(out, x.outRules.Length());
  10171. FOR i := 0 TO LEN(out)-1 DO
  10172. statement := x.outRules.GetStatement(i);
  10173. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10174. WITH statement: SyntaxTree.Assignment DO
  10175. Designate(statement.left, operand);
  10176. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10177. NEW(str, 64);
  10178. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10179. out[i] := result; IntermediateCode.SetString(out[i], str);
  10180. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10181. |statement: SyntaxTree.ReturnStatement DO
  10182. NEW(str, 64);
  10183. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10184. IF currentIsInline THEN
  10185. map := currentMapper.Get(NIL);
  10186. Designate(map.to, operand);
  10187. IF map.isAddress THEN
  10188. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10189. ELSE
  10190. result := operand.op;
  10191. END;
  10192. (*! only if it does not fit into register
  10193. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10194. *)
  10195. (*Evaluate(map.to, operand);*)
  10196. out[i] := result;
  10197. ELSE
  10198. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10199. END;
  10200. IntermediateCode.SetString(out[i], str);
  10201. ReleaseIntermediateOperand(operand.tag);
  10202. return := out[i];
  10203. ELSE
  10204. END;
  10205. END;
  10206. ELSE out := NIL
  10207. END;
  10208. Emit(Asm(x.position,x.sourceCode, in, out));
  10209. IF in # NIL THEN
  10210. FOR i := 0 TO LEN(in)-1 DO
  10211. ReleaseIntermediateOperand(in[i]);
  10212. END;
  10213. END;
  10214. IF out # NIL THEN
  10215. FOR i := 0 TO LEN(out)-1 DO
  10216. WITH statement: SyntaxTree.Assignment DO
  10217. ReleaseIntermediateOperand(out[i]);
  10218. |statement: SyntaxTree.ReturnStatement DO
  10219. (* release happens below *)
  10220. ELSE
  10221. END;
  10222. statement := x.outRules.GetStatement(i);
  10223. END;
  10224. END;
  10225. IF return.mode # IntermediateCode.Undefined THEN
  10226. IF currentIsInline THEN
  10227. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10228. Symbol(procedureType.returnParameter, par);
  10229. MakeMemory(mem, par.op, return.type, 0);
  10230. ReleaseOperand(par);
  10231. Emit(Mov(position, mem, return));
  10232. ReleaseIntermediateOperand(mem);
  10233. ELSE
  10234. Emit(Return(position,return));
  10235. END;
  10236. ReleaseIntermediateOperand(return);
  10237. IF currentIsInline THEN RETURN END;
  10238. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10239. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10240. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10241. ELSE
  10242. parametersSize := 0;
  10243. END;
  10244. EmitLeave(section, position,procedure, callingConvention);
  10245. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10246. END;
  10247. IF Trace THEN TraceExit("VisitCode") END;
  10248. END VisitCode;
  10249. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10250. BEGIN
  10251. RETURN ProcedureParametersSize(system, procedure);
  10252. END ProcParametersSize;
  10253. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10254. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10255. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10256. const, call: IntermediateCode.Operand;
  10257. parameterDesignator: SyntaxTree.Expression;
  10258. saved: RegisterEntry;
  10259. name: Basic.SegmentedName;
  10260. BEGIN
  10261. IF Trace THEN TraceEnter("ParameterCopies") END;
  10262. parameter := x.firstParameter;
  10263. WHILE parameter # NIL DO
  10264. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10265. type := parameter.type.resolved;
  10266. IF IsOpenArray(type) THEN
  10267. VisitParameter(parameter);
  10268. op := result;
  10269. IF backend.cooperative & parameter.NeedsTrace() THEN
  10270. length := GetArrayLength(type, op.tag);
  10271. size := NewRegisterOperand(addressType);
  10272. base := ArrayBaseType(type);
  10273. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10274. Emit(Mul(position, size, length, const));
  10275. dst := NewRegisterOperand (addressType);
  10276. Emit(Mov(position, dst, size));
  10277. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10278. Emit(Sub(position,dst,sp,dst));
  10279. Emit(And(position,dst,dst,const));
  10280. Emit(Mov(position,sp,dst));
  10281. par := fp;
  10282. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10283. IntermediateCode.InitImmediate(null, byteType, 0);
  10284. Emit(Fill(position, dst, size, null));
  10285. ReleaseIntermediateOperand(dst);
  10286. ReleaseIntermediateOperand(length);
  10287. SaveRegisters();ReleaseUsedRegisters(saved);
  10288. (* register dst has been freed before SaveRegisters already *)
  10289. base := ArrayBaseType(type);
  10290. (* assign method of open array *)
  10291. IF base.IsRecordType() THEN
  10292. Emit (Push(position, length));
  10293. Emit (Push(position, dst));
  10294. Emit (Push(position, op.op));
  10295. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10296. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10297. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10298. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10299. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10300. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10301. Emit (Push(position,length));
  10302. Emit (Push(position, dst));
  10303. Emit (Push(position, length));
  10304. Emit (Push(position, op.op));
  10305. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10306. ELSE
  10307. Emit (Push(position, length));
  10308. Emit (Push(position, dst));
  10309. Emit (Push(position, length));
  10310. Emit (Push(position, op.op));
  10311. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10312. ASSERT(ArrayBaseType(type).IsPointer());
  10313. END;
  10314. RestoreRegisters(saved);
  10315. ELSE
  10316. temp := GetDynamicSize(type,op.tag);
  10317. ReuseCopy(size,temp);
  10318. ReleaseIntermediateOperand(temp);
  10319. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10320. Emit(Sub(position,size,sp,size));
  10321. Emit(And(position,size,size,const));
  10322. Emit(Mov(position,sp,size));
  10323. par := fp;
  10324. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10325. ReleaseIntermediateOperand(size);
  10326. size := GetDynamicSize(type,op.tag);
  10327. END;
  10328. Emit(Copy(position,sp,op.op,size));
  10329. ReleaseIntermediateOperand(size);
  10330. ReleaseOperand(op);
  10331. IntermediateCode.MakeMemory(par,addressType);
  10332. Emit(Mov(position,par,sp));
  10333. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10334. checker.SetCurrentScope(currentScope);
  10335. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10336. Assign(parameterDesignator,parameterDesignator);
  10337. END;
  10338. END;
  10339. parameter := parameter.nextParameter;
  10340. END;
  10341. IF Trace THEN TraceExit("ParameterCopies") END;
  10342. END ParameterCopies;
  10343. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10344. VAR x: SyntaxTree.Variable;
  10345. BEGIN
  10346. x := scope.firstVariable;
  10347. WHILE x # NIL DO
  10348. InitVariable(x,FALSE);
  10349. x := x.nextVariable;
  10350. END;
  10351. END InitVariables;
  10352. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10353. BEGIN
  10354. IF (symbol # NIL) THEN
  10355. RETURN fingerPrinter.SymbolFP(symbol).public
  10356. ELSE
  10357. RETURN 0
  10358. END;
  10359. END GetFingerprint;
  10360. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10361. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10362. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10363. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10364. name: Basic.SegmentedName;
  10365. offset: LONGINT;
  10366. BEGIN
  10367. IF Trace THEN TraceEnter("Body") END;
  10368. ReleaseUsedRegisters(saved); (* just in case ... *)
  10369. section := ir;
  10370. exitLabel := NewLabel ();
  10371. IF moduleBody THEN moduleBodySection := section END;
  10372. IF ir.comments # NIL THEN
  10373. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10374. commentPrintout.SingleStatement(TRUE);
  10375. dump := ir.comments;
  10376. ELSE
  10377. commentPrintout := NIL;
  10378. dump := NIL;
  10379. END;
  10380. prevScope := currentScope;
  10381. currentScope := scope;
  10382. lastSwitchPC := 0;
  10383. cooperativeSwitches := backend.cooperative;
  10384. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10385. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10386. IF x # NIL THEN
  10387. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10388. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10389. IF moduleBody THEN
  10390. ProfilerInit();
  10391. ELSE
  10392. Basic.SegmentedNameToString(ir.name, string);
  10393. ProfilerAddProcedure(numberProcedures,string);
  10394. ProfilerEnterExit(numberProcedures,TRUE);
  10395. END;
  10396. END;
  10397. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10398. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10399. END;
  10400. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10401. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10402. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10403. IF procedure = cellScope.bodyProcedure THEN
  10404. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10405. StaticCallOperand(op, cellScope.constructor);
  10406. Emit(Call(position,op.op,0));
  10407. END;
  10408. END;
  10409. END;
  10410. InitVariables(scope);
  10411. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10412. GetCodeSectionNameForSymbol(procedure, name);
  10413. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10414. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10415. IF ProtectModulesPointers THEN
  10416. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10417. ELSE
  10418. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10419. END;
  10420. IntermediateCode.SetOffset(right,offset); (* tag *)
  10421. IntermediateCode.InitMemory(left,addressType,fp,0);
  10422. Emit(Mov(position, left, right));
  10423. END;
  10424. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10425. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10426. ParameterCopies(procedureType);
  10427. IF x.code = NIL THEN
  10428. VisitStatementBlock(x);
  10429. ELSE
  10430. VisitCode(x.code)
  10431. END;
  10432. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10433. IF ~backend.cooperative THEN
  10434. ProfilerEnterExit(numberProcedures,FALSE);
  10435. END;
  10436. INC(numberProcedures);
  10437. END;
  10438. END;
  10439. IF backend.cooperative THEN
  10440. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10441. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10442. END;
  10443. IF x # NIL THEN
  10444. SELF.position := x.position;
  10445. END;
  10446. CheckRegistersFree();
  10447. ASSERT(modifyAssignmentCounter = 0);
  10448. currentScope := prevScope;
  10449. IF Trace THEN TraceExit("Body") END;
  10450. END Body;
  10451. END ImplementationVisitor;
  10452. MetaDataGenerator=OBJECT
  10453. VAR
  10454. implementationVisitor: ImplementationVisitor;
  10455. declarationVisitor: DeclarationVisitor;
  10456. module: Sections.Module;
  10457. moduleName: ARRAY 128 OF CHAR;
  10458. moduleNamePool: Basic.HashTableInt;
  10459. moduleNamePoolSection: IntermediateCode.Section;
  10460. modulePointerSection: IntermediateCode.Section;
  10461. modulePointerSizePC: LONGINT;
  10462. modulePointerSectionOffset: LONGINT;
  10463. modulePointers: LONGINT;
  10464. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10465. RecordBaseOffset: LONGINT;
  10466. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10467. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10468. TypeTags: LONGINT; (* type extension level support *)
  10469. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10470. patchInfoPC: LONGINT;
  10471. patchCRC: LONGINT;
  10472. CONST
  10473. EmptyBlockOffset = 2;
  10474. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10475. BEGIN
  10476. IF implementationVisitor.backend.cooperative THEN
  10477. TypeTags := MAX(LONGINT);
  10478. BaseTypesTableOffset := 0;
  10479. MethodTableOffset := 2;
  10480. TypeRecordBaseOffset := 0;
  10481. RecordBaseOffset := 0;
  10482. ELSIF simple THEN
  10483. TypeTags := 3; (* only 3 extensions allowed *)
  10484. BaseTypesTableOffset := 1;
  10485. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10486. TypeRecordBaseOffset := 0;
  10487. RecordBaseOffset := 1;
  10488. ELSE
  10489. TypeTags := 16;
  10490. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10491. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10492. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10493. (* change this when Heaps.HeapBlock is modified *)
  10494. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10495. RecordBaseOffset := 8; (* addresses *)
  10496. ELSE
  10497. RecordBaseOffset := 9; (* addresses *)
  10498. END;
  10499. END;
  10500. SELF.simple := simple;
  10501. SELF.implementationVisitor := implementationVisitor;
  10502. SELF.declarationVisitor := declarationVisitor;
  10503. implementationVisitor.meta := SELF;
  10504. declarationVisitor.meta := SELF;
  10505. END InitMetaDataGenerator;
  10506. PROCEDURE SetModule(module: Sections.Module);
  10507. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10508. BEGIN
  10509. SELF.module := module;
  10510. Global.GetModuleName(module.module,moduleName);
  10511. Global.GetSymbolSegmentedName(module.module, name);
  10512. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10513. NEW(moduleNamePool, 32);
  10514. (*! require GC protection *)
  10515. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10516. IF ProtectModulesPointers THEN
  10517. name := "Heaps.AnyPtr";
  10518. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10519. (* set base pointer *)
  10520. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10521. END;
  10522. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10523. modulePointers := 0;
  10524. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10525. AddPointer(moduleNamePoolSection, namePoolOffset);
  10526. END;
  10527. END SetModule;
  10528. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10529. BEGIN
  10530. IF ~implementationVisitor.backend.cooperative THEN
  10531. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10532. INC(modulePointers);
  10533. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10534. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10535. END;
  10536. END AddPointer;
  10537. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10538. BEGIN
  10539. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10540. END GetTypeRecordBaseOffset;
  10541. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10542. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10543. BEGIN
  10544. (* change this when Heaps.HeapBlock is modified *)
  10545. INC(dataAdrOffset,7);
  10546. Info(section,"headerAdr");
  10547. Address(section,0);
  10548. Info(section,"typeDesc");
  10549. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10550. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10551. NamedSymbol(section, name, symbol, 0, offset);
  10552. Info(section,"mark: LONGINT;");
  10553. Longint(section,-1);
  10554. Info(section,"refCount: LONGINT;");
  10555. Longint(section,0);
  10556. (*
  10557. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10558. *)
  10559. Info(section,"dataAdr-: ADDRESS");
  10560. Symbol(section,section, dataAdrOffset,0);
  10561. Info(section,"size-: SIZE");
  10562. Address(section,0);
  10563. Info(section,"nextMark: HeapBlock;");
  10564. Address(section,0);
  10565. END HeapBlock;
  10566. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10567. VAR i: LONGINT;
  10568. BEGIN
  10569. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10570. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10571. Info(section,"count*: LONGINT");
  10572. Longint(section,0);
  10573. Info(section,"locked*: BOOLEAN");
  10574. Longint(section,0);
  10575. Info(section,"awaitingLock*: ProcessQueue");
  10576. Address(section,0);
  10577. Address(section,0);
  10578. Info(section,"awaitingCond*: ProcessQueue");
  10579. Address(section,0);
  10580. Address(section,0);
  10581. Info(section,"lockedBy*: ANY");
  10582. Address(section,0);
  10583. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10584. Longint(section,1);
  10585. FOR i := 2 TO 6 DO
  10586. Longint(section,0);
  10587. END;
  10588. Info(section,"lock*: ANY");
  10589. Address(section,0);
  10590. END ProtectedHeapBlock;
  10591. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10592. BEGIN
  10593. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10594. END Info;
  10595. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10596. VAR op: IntermediateCode.Operand;
  10597. BEGIN
  10598. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10599. section.Emit(Data(Basic.invalidPosition,op));
  10600. END Address;
  10601. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10602. VAR op: IntermediateCode.Operand;
  10603. BEGIN
  10604. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10605. section.Emit(Data(Basic.invalidPosition,op));
  10606. END Size;
  10607. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10608. VAR op: IntermediateCode.Operand;
  10609. BEGIN
  10610. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10611. section.Emit(Data(Basic.invalidPosition,op));
  10612. END Set;
  10613. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10614. VAR op: IntermediateCode.Operand;
  10615. BEGIN
  10616. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10617. section.Emit(Data(Basic.invalidPosition,op));
  10618. END Longint;
  10619. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10620. VAR op,noOperand: IntermediateCode.Operand;
  10621. BEGIN
  10622. IntermediateCode.InitOperand(noOperand);
  10623. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10624. section.PatchOperands(pc,op,noOperand,noOperand);
  10625. END PatchAddress;
  10626. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10627. VAR op,noOperand: IntermediateCode.Operand;
  10628. BEGIN
  10629. IntermediateCode.InitOperand(noOperand);
  10630. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10631. section.PatchOperands(pc,op,noOperand,noOperand);
  10632. END PatchSize;
  10633. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10634. VAR op,noOperand: IntermediateCode.Operand;
  10635. BEGIN
  10636. IntermediateCode.InitOperand(noOperand);
  10637. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10638. section.PatchOperands(pc,op,noOperand,noOperand);
  10639. END PatchLongint;
  10640. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10641. VAR op, noOperand: IntermediateCode.Operand;
  10642. BEGIN
  10643. IntermediateCode.InitOperand(noOperand);
  10644. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10645. section.PatchOperands(pc,op,noOperand,noOperand);
  10646. END PatchSymbol;
  10647. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10648. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10649. BEGIN
  10650. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10651. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10652. section.Emit(Data(Basic.invalidPosition,op));
  10653. END Boolean;
  10654. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10655. VAR op: IntermediateCode.Operand;
  10656. BEGIN
  10657. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10658. section.Emit(Data(Basic.invalidPosition,op));
  10659. END Char;
  10660. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10661. VAR op: IntermediateCode.Operand;
  10662. BEGIN
  10663. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10664. section.Emit(Data(Basic.invalidPosition,op));
  10665. END Integer;
  10666. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10667. VAR i: LONGINT;
  10668. BEGIN
  10669. Info(section,str);
  10670. i := 0;
  10671. WHILE(str[i] # 0X) DO
  10672. Char(section,str[i]);
  10673. INC(i);
  10674. END;
  10675. Char(section,0X);
  10676. END String;
  10677. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10678. VAR s: Basic.SectionName;
  10679. BEGIN
  10680. StringPool.GetString(str, s);
  10681. String(section, s);
  10682. END String0;
  10683. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10684. VAR op: IntermediateCode.Operand;
  10685. BEGIN
  10686. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10687. IntermediateCode.SetOffset(op,realOffset);
  10688. section.Emit(Data(Basic.invalidPosition,op));
  10689. END NamedSymbol;
  10690. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10691. VAR op: IntermediateCode.Operand;
  10692. BEGIN
  10693. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10694. IntermediateCode.SetOffset(op,realOffset);
  10695. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10696. END NamedSymbolAt;
  10697. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10698. BEGIN
  10699. IF symbol= NIL THEN
  10700. Address( section, realOffset);
  10701. ASSERT(virtualOffset = 0);
  10702. ELSE
  10703. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10704. END;
  10705. END Symbol;
  10706. (* OutPointers delivers
  10707. {pointerOffset}
  10708. *)
  10709. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10710. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10711. BEGIN
  10712. type := type.resolved;
  10713. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10714. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10715. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10716. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10717. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10718. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10719. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10720. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10721. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10722. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10723. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10724. ELSIF (type IS SyntaxTree.RecordType) THEN
  10725. (* never treat a record like a pointer, even if the pointer field is set! *)
  10726. WITH type: SyntaxTree.RecordType DO
  10727. base := type.GetBaseRecord();
  10728. IF base # NIL THEN
  10729. Pointers(offset,symbol,section, base,numberPointers);
  10730. END;
  10731. variable := type.recordScope.firstVariable;
  10732. WHILE(variable # NIL) DO
  10733. IF ~(variable.untraced) THEN
  10734. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10735. END;
  10736. variable := variable.nextVariable;
  10737. END;
  10738. END;
  10739. ELSIF (type IS SyntaxTree.CellType) THEN
  10740. WITH type: SyntaxTree.CellType DO
  10741. base := type.GetBaseRecord();
  10742. IF base # NIL THEN
  10743. Pointers(offset,symbol,section, base,numberPointers);
  10744. END;
  10745. variable := type.cellScope.firstVariable;
  10746. WHILE(variable # NIL) DO
  10747. IF ~(variable.untraced) THEN
  10748. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10749. END;
  10750. variable := variable.nextVariable;
  10751. END;
  10752. property := type.firstProperty;
  10753. WHILE(property # NIL) DO
  10754. IF ~(property.untraced) THEN
  10755. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10756. END;
  10757. property := property.nextProperty;
  10758. END;
  10759. parameter := type.firstParameter;
  10760. WHILE(parameter # NIL) DO
  10761. IF ~(parameter.untraced) THEN
  10762. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10763. END;
  10764. parameter := parameter.nextParameter;
  10765. END;
  10766. END;
  10767. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10768. WITH type: SyntaxTree.ArrayType DO
  10769. IF type.form= SyntaxTree.Static THEN
  10770. n := type.staticLength;
  10771. base := type.arrayBase.resolved;
  10772. WHILE(base IS SyntaxTree.ArrayType) DO
  10773. type := base(SyntaxTree.ArrayType);
  10774. n := n* type.staticLength;
  10775. base := type.arrayBase.resolved;
  10776. END;
  10777. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10778. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10779. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10780. FOR i := 0 TO n-1 DO
  10781. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10782. END;
  10783. END;
  10784. ELSE
  10785. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10786. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10787. END;
  10788. END;
  10789. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10790. WITH type: SyntaxTree.MathArrayType DO
  10791. IF type.form = SyntaxTree.Static THEN
  10792. n := type.staticLength;
  10793. base := type.arrayBase.resolved;
  10794. WHILE(base IS SyntaxTree.MathArrayType) DO
  10795. type := base(SyntaxTree.MathArrayType);
  10796. n := n* type.staticLength;
  10797. base := type.arrayBase.resolved;
  10798. END;
  10799. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10800. IF SemanticChecker.ContainsPointer(base) THEN
  10801. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10802. FOR i := 0 TO n-1 DO
  10803. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10804. END;
  10805. END;
  10806. ELSE
  10807. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10808. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10809. END
  10810. END;
  10811. (* ELSE no pointers in type *)
  10812. END;
  10813. END Pointers;
  10814. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10815. VAR position,i: LONGINT; ch: CHAR;
  10816. BEGIN
  10817. IF pool.Has(index) THEN
  10818. RETURN pool.GetInt(index)
  10819. ELSE
  10820. position := source.pc;
  10821. pool.PutInt(index, position);
  10822. Info(source, name);
  10823. i := 0;
  10824. REPEAT
  10825. ch := name[i]; INC(i);
  10826. Char( source, ch);
  10827. UNTIL ch = 0X;
  10828. END;
  10829. RETURN position;
  10830. END EnterDynamicName;
  10831. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10832. VAR name: Basic.SectionName; position: LONGINT;
  10833. BEGIN
  10834. IF pool.Has(index) THEN
  10835. RETURN pool.GetInt(index)
  10836. ELSE
  10837. StringPool.GetString(index, name);
  10838. position := EnterDynamicName(source,name,index, pool);
  10839. END;
  10840. RETURN position;
  10841. END DynamicName;
  10842. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10843. VAR section: IntermediateCode.Section;
  10844. BEGIN
  10845. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10846. IF implementationVisitor.backend.cooperative THEN
  10847. Info(section, "TypeDescriptor");
  10848. Basic.ToSegmentedName("BaseTypes.Array", name);
  10849. NamedSymbol(section, name,NIL, 0, 0);
  10850. BasePointer(section);
  10851. offset := 0;
  10852. ELSE
  10853. IF ProtectModulesPointers THEN
  10854. HeapBlock(mName,typeName,section,2);
  10855. END;
  10856. Info(section, "HeapBlock");
  10857. IF ProtectModulesPointers THEN
  10858. Symbol(section,section,2,0);
  10859. ELSE
  10860. Address(section,0);
  10861. END;
  10862. Info(section, "TypeDescriptor");
  10863. Address(section,0);
  10864. offset := section.pc;
  10865. END;
  10866. RETURN section
  10867. END NamedBlock;
  10868. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10869. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10870. BEGIN
  10871. COPY(moduleName,name);
  10872. Strings.Append(name,suffix);
  10873. Basic.ToSegmentedName(name, pooledName);
  10874. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10875. END Block;
  10876. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10877. VAR name: Basic.SegmentedName;
  10878. BEGIN
  10879. Info(source,"ArrayHeader");
  10880. IF implementationVisitor.backend.cooperative THEN
  10881. sizePC := source.pc;
  10882. Address(source,0);
  10883. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10884. IF baseType # "" THEN
  10885. Basic.ToSegmentedName(baseType, name);
  10886. NamedSymbol(source, name,NIL, 0, 0);
  10887. ELSE
  10888. Address(source,0);
  10889. END;
  10890. Address(source,0);
  10891. ELSE
  10892. Address(source,0);
  10893. Address(source,0);
  10894. (* first pointer for GC *)
  10895. IF hasPointer THEN
  10896. (* points to first element in the array, this is NOT the base type descriptor *)
  10897. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10898. ELSE
  10899. Address(source,0);
  10900. END;
  10901. sizePC := source.pc;
  10902. Address(source,0);
  10903. Info(source,"array data");
  10904. END;
  10905. END ArrayBlock;
  10906. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10907. BEGIN
  10908. IF implementationVisitor.backend.cooperative THEN
  10909. PatchSize(section, pc, size);
  10910. PatchSize(section, pc + 3, size);
  10911. ELSE
  10912. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10913. PatchSize(section, pc, size);
  10914. END;
  10915. END PatchArray;
  10916. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10917. VAR
  10918. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10919. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10920. poolMap: Basic.HashTableInt;
  10921. namePool: IntermediateCode.Section;
  10922. namePoolOffset: LONGINT;
  10923. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10924. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10925. BEGIN
  10926. Basic.SegmentedNameToString(s1.name,n1);
  10927. Basic.SegmentedNameToString(s2.name,n2);
  10928. index := 0;
  10929. ch1 := n1[index];
  10930. ch2 := n2[index];
  10931. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10932. INC(index);
  10933. ch1 := n1[index];
  10934. ch2 := n2[index];
  10935. END;
  10936. RETURN ch1 < ch2;
  10937. END Compare;
  10938. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10939. VAR
  10940. i, j: LONGINT;
  10941. x, t: Sections.Section;
  10942. BEGIN
  10943. IF lo < hi THEN
  10944. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10945. WHILE i <= j DO
  10946. WHILE Compare(list[i], x) DO INC(i) END;
  10947. WHILE Compare(x, list[j]) DO DEC(j) END;
  10948. IF i <= j THEN
  10949. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10950. INC(i); DEC(j)
  10951. END
  10952. END;
  10953. IF lo < j THEN QuickSort(list, lo, j) END;
  10954. IF i < hi THEN QuickSort(list, i, hi) END
  10955. END;
  10956. END QuickSort;
  10957. (*
  10958. ExportDesc* = RECORD
  10959. fp*: ADDRESS;
  10960. name* {UNTRACED}: DynamicName;
  10961. adr*: ADDRESS;
  10962. exports*: LONGINT;
  10963. dsc* {UNTRACED}: ExportArray
  10964. END;
  10965. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10966. *)
  10967. PROCEDURE ExportDesc2(
  10968. source: IntermediateCode.Section;
  10969. namePool: IntermediateCode.Section;
  10970. fingerPrinter: FingerPrinter.FingerPrinter;
  10971. symbol: Sections.Section;
  10972. name: StringPool.Index;
  10973. VAR patchAdr: LONGINT
  10974. ): BOOLEAN;
  10975. VAR fingerPrint: SyntaxTree.FingerPrint;
  10976. BEGIN
  10977. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10978. & (symbol.type # Sections.InlineCodeSection)
  10979. THEN
  10980. *)
  10981. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10982. & (symbol.type # Sections.ExitCodeSection)
  10983. & (symbol.type # Sections.InlineCodeSection))
  10984. THEN
  10985. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10986. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10987. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10988. Longint(source,fingerPrint.public);
  10989. ELSE
  10990. Longint(source, 0);
  10991. END;
  10992. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10993. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10994. Symbol(source, symbol,0,0);
  10995. patchAdr := source.pc;
  10996. Longint(source, 0);
  10997. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10998. Address(source,0);
  10999. END;
  11000. RETURN TRUE
  11001. ELSE
  11002. RETURN FALSE
  11003. END;
  11004. END ExportDesc2;
  11005. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11006. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11007. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11008. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11009. nextPatch: LONGINT;
  11010. TYPE
  11011. Scope = RECORD
  11012. elements: LONGINT;
  11013. gelements: LONGINT;
  11014. section: IntermediateCode.Section;
  11015. patchAdr: LONGINT;
  11016. arraySizePC: LONGINT;
  11017. beginPC: LONGINT; (* current scope start pc *)
  11018. END;
  11019. BEGIN
  11020. Basic.InitSegmentedName(prev);
  11021. olevel := -1;
  11022. scopes[0].section := source;
  11023. scopes[0].arraySizePC := MIN(LONGINT);
  11024. FOR s := 0 TO LEN(sections)-1 DO
  11025. symbol := sections[s];
  11026. 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
  11027. this := sections[s].name;
  11028. level := 0;
  11029. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11030. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11031. INC(level);
  11032. END;
  11033. WHILE level < olevel DO
  11034. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11035. IF olevel > 0 THEN
  11036. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11037. nextPatch := scopes[olevel-1].patchAdr+1;
  11038. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11039. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11040. END;
  11041. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11042. DEC(olevel);
  11043. END;
  11044. IF (level < LEN(this)) & (this[level] > 0) THEN
  11045. IF level > olevel THEN
  11046. (*TRACE("opening",level); *)
  11047. IF scopes[level].section = NIL THEN
  11048. arrayName := ".@ExportArray";
  11049. Strings.AppendInt(arrayName, level);
  11050. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11051. AddPointer(scopes[level].section,offset);
  11052. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11053. END;
  11054. scopes[level].beginPC := scopes[level].section.pc;
  11055. olevel := level;
  11056. scopes[olevel].elements := 0;
  11057. END;
  11058. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11059. sym := sections[s];
  11060. ELSE
  11061. sym := NIL;
  11062. END;
  11063. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11064. THEN
  11065. INC(scopes[olevel].elements);
  11066. END;
  11067. (* enter string in scope *)
  11068. INC(level);
  11069. END;
  11070. END;
  11071. Basic.SegmentedNameToString(this, name);
  11072. prev := this;
  11073. END;
  11074. END;
  11075. WHILE 0 <= olevel DO
  11076. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11077. IF olevel > 0 THEN
  11078. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11079. nextPatch := scopes[olevel-1].patchAdr+1;
  11080. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11081. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11082. END;
  11083. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11084. DEC(olevel);
  11085. END;
  11086. level := 0;
  11087. WHILE (level < LEN(scopes)) DO
  11088. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11089. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11090. END;
  11091. INC(level);
  11092. END;
  11093. END Export;
  11094. BEGIN
  11095. NEW(fingerPrinter);
  11096. NEW(poolMap, 64);
  11097. (* 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 *)
  11098. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11099. NEW(sectionArray, module.allSections.Length());
  11100. FOR i := 0 TO module.allSections.Length() - 1 DO
  11101. section := module.allSections.GetSection(i);
  11102. sectionArray[i] := section;
  11103. END;
  11104. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11105. Export(sectionArray^);
  11106. END ExportDesc;
  11107. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11108. VAR
  11109. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11110. BEGIN
  11111. Info(source, "exception table offsets array descriptor");
  11112. size := 0;
  11113. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11114. Info(source, "exception table content");
  11115. FOR i := 0 TO module.allSections.Length() - 1 DO
  11116. p := module.allSections.GetSection(i);
  11117. IF p.type = Sections.CodeSection THEN
  11118. finallyPC := p(IntermediateCode.Section).finally;
  11119. IF finallyPC>=0 THEN
  11120. Symbol( source, p, 0,0);
  11121. Symbol( source, p, finallyPC, 0);
  11122. Symbol( source, p, finallyPC,0);
  11123. INC(size);
  11124. END;
  11125. END
  11126. END;
  11127. PatchArray(source,sizePC,size);
  11128. END ExceptionArray;
  11129. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11130. VAR i: LONGINT; ch: CHAR;
  11131. BEGIN
  11132. i := 0;
  11133. REPEAT
  11134. ch := name[i]; INC(i);
  11135. Char( section, ch);
  11136. UNTIL ch = 0X;
  11137. WHILE i < 32 DO
  11138. Char( section, 0X); INC(i);
  11139. END;
  11140. END Name;
  11141. PROCEDURE References(section: IntermediateCode.Section);
  11142. CONST
  11143. sfTypeNone = 0X;
  11144. sfTypeCHAR = 01X;
  11145. sfTypeCHAR8 = 02X;
  11146. sfTypeCHAR16 = 03X;
  11147. sfTypeCHAR32 = 04X;
  11148. sfTypeRANGE = 05X;
  11149. sfTypeSHORTINT = 06X;
  11150. sfTypeINTEGER = 07X;
  11151. sfTypeLONGINT = 08X;
  11152. sfTypeHUGEINT = 09X;
  11153. sfTypeWORD = 0AX;
  11154. sfTypeLONGWORD = 0BX;
  11155. sfTypeSIGNED8 = 0CX;
  11156. sfTypeSIGNED16 = 0DX;
  11157. sfTypeSIGNED32 = 0EX;
  11158. sfTypeSIGNED64 = 0FX;
  11159. sfTypeUNSIGNED8 = 10X;
  11160. sfTypeUNSIGNED16 = 11X;
  11161. sfTypeUNSIGNED32 = 12X;
  11162. sfTypeUNSIGNED64 = 13X;
  11163. sfTypeREAL = 14X;
  11164. sfTypeLONGREAL = 15X;
  11165. sfTypeCOMPLEX = 16X;
  11166. sfTypeLONGCOMPLEX = 17X;
  11167. sfTypeBOOLEAN = 18X;
  11168. sfTypeSET = 19X;
  11169. sfTypeANY = 1AX;
  11170. sfTypeOBJECT = 1BX;
  11171. sfTypeBYTE = 1CX;
  11172. sfTypeADDRESS = 1DX;
  11173. sfTypeSIZE = 1EX;
  11174. sfTypeIndirect = 1FX;
  11175. sfTypeRecord = 20X;
  11176. sfTypePointerToRecord = 21X;
  11177. sfTypePointerToArray = 22X;
  11178. sfTypeOpenArray = 23X;
  11179. sfTypeStaticArray = 24X;
  11180. sfTypeDynamicArray = 25X;
  11181. sfTypeMathStaticArray = 26X;
  11182. sfTypeMathOpenArray = 27X;
  11183. sfTypeMathTensor = 28X;
  11184. sfTypeProcedure = 29X;
  11185. sfTypeDelegate = 2AX;
  11186. sfTypeENUM = 2BX;
  11187. sfTypeCELL = 2CX;
  11188. sfTypePORT = 2DX;
  11189. sfIN = 0X;
  11190. sfOUT = 1X;
  11191. flagDelegate = 0;
  11192. flagConstructor = 1;
  11193. (* variable / parameter addressing modes *)
  11194. sfAbsolute = 0X; (* global vars *)
  11195. sfRelative = 1X; (* variables, value parameters *)
  11196. sfIndirect = 2X; (* var parameters *)
  11197. sfScopeBegin = 0F0X;
  11198. sfScopeEnd = 0F1X;
  11199. sfProcedure = 0F2X;
  11200. sfVariable = 0F3X;
  11201. sfTypeDeclaration = 0F4X;
  11202. sfModule = 0FFX;
  11203. RefInfo = TRUE;
  11204. VAR
  11205. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11206. indirectTypes: Basic.HashTable;
  11207. PROCEDURE CurrentIndex(): LONGINT;
  11208. VAR i: LONGINT;
  11209. BEGIN
  11210. FOR i := startPC TO section.pc -1 DO
  11211. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11212. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11213. END;
  11214. startPC := section.pc;
  11215. RETURN lastOffset;
  11216. END CurrentIndex;
  11217. (*
  11218. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11219. Module = sfModule prevSymbol:SIZE name:String Scope.
  11220. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11221. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11222. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11223. Type =
  11224. sfTypePointerToRecord
  11225. | sfTypePointerToArray Type
  11226. | sfTypeOpenArray Type
  11227. | sfTypeDynamicArray Type
  11228. | sfTypeStaticArray length:SIZE Type
  11229. | sfTypeMathOpenArray Type
  11230. | sfTypeMathStaticArray length:SIZE Type
  11231. | sfTypeMathTensor Type
  11232. | sfTypeRecord tdAdr:ADDRESS
  11233. | sfTypeProcedure {Parameter} return:Type
  11234. | sfTypeDelegate {Parameter} return:Type
  11235. | sfTypePort (sfIN | sfOUT)
  11236. | sfTypeBOOLEAN
  11237. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11238. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11239. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11240. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11241. | sfTypeWORD | sfTypeLONGWORD
  11242. | sfTypeREAL | sfTypeLONGREAL
  11243. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11244. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11245. | sfTypeIndirect offset:SIZE.
  11246. *)
  11247. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11248. VAR offset: SIZE;
  11249. BEGIN
  11250. IF indirectTypes.Has(type) THEN
  11251. offset := indirectTypes.GetInt(type);
  11252. Char(section, sfTypeIndirect);
  11253. Size(section, offset);
  11254. RETURN TRUE;
  11255. ELSE
  11256. indirectTypes.PutInt(type, CurrentIndex());
  11257. RETURN FALSE;
  11258. END;
  11259. END Indirect;
  11260. PROCEDURE NType(type: SyntaxTree.Type);
  11261. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11262. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11263. BEGIN
  11264. IF type = NIL THEN
  11265. Char(section, sfTypeNone)
  11266. ELSE
  11267. type := type.resolved;
  11268. size := type.sizeInBits;
  11269. WITH type:SyntaxTree.PointerType DO
  11270. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11271. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11272. Char(section, sfTypePointerToRecord);
  11273. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11274. ELSE
  11275. IF RefInfo THEN Info(section,"PointerToArray") END;
  11276. Char(section, sfTypePointerToArray);
  11277. NType(type.pointerBase);
  11278. END;
  11279. | type: SyntaxTree.ArrayType DO
  11280. IF ~Indirect(type) THEN
  11281. IF type.form = SyntaxTree.Open THEN
  11282. IF RefInfo THEN Info(section,"OpenArray") END;
  11283. Char(section, sfTypeOpenArray);
  11284. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11285. IF RefInfo THEN Info(section,"DynamicArray") END;
  11286. Char(section, sfTypeDynamicArray);
  11287. ELSIF type.form = SyntaxTree.Static THEN
  11288. IF RefInfo THEN Info(section,"StaticArray") END;
  11289. Char(section, sfTypeStaticArray);
  11290. Size(section, type.staticLength);
  11291. ELSE
  11292. HALT(100);
  11293. END;
  11294. NType(type.arrayBase);
  11295. END;
  11296. | type: SyntaxTree.MathArrayType DO
  11297. IF ~Indirect(type) THEN
  11298. IF type.form = SyntaxTree.Open THEN
  11299. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11300. Char(section, sfTypeMathOpenArray);
  11301. ELSIF type.form = SyntaxTree.Static THEN
  11302. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11303. Char(section, sfTypeMathStaticArray);
  11304. Size(section, type.staticLength);
  11305. ELSIF type.form = SyntaxTree.Tensor THEN
  11306. IF RefInfo THEN Info(section,"MathTensor") END;
  11307. Char(section, sfTypeMathTensor);
  11308. ELSE
  11309. HALT(100);
  11310. END;
  11311. NType(type.arrayBase);
  11312. END;
  11313. | type: SyntaxTree.RecordType DO
  11314. IF ~Indirect(type) THEN
  11315. IF type.pointerType # NIL (* OBJECT *) THEN
  11316. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11317. Char(section, sfTypePointerToRecord)
  11318. ELSE
  11319. IF RefInfo THEN Info(section,"Record") END;
  11320. Char(section, sfTypeRecord);
  11321. td := type.typeDeclaration;
  11322. IF RefInfo THEN Info(section,"TD") END;
  11323. IF (td # NIL) THEN
  11324. Global.GetSymbolSegmentedName(td,segmentedName);
  11325. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11326. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11327. ELSE
  11328. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11329. END;
  11330. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11331. Symbol(section, tir, 0, offset);
  11332. ELSE
  11333. Address(section, 0);
  11334. END;
  11335. END;
  11336. END;
  11337. | type: SyntaxTree.CellType DO
  11338. IF ~Indirect(type) THEN
  11339. IF RefInfo THEN Info(section,"Record") END;
  11340. Char(section, sfTypeRecord);
  11341. td := type.typeDeclaration;
  11342. IF RefInfo THEN Info(section,"TD") END;
  11343. IF (td # NIL) THEN
  11344. Global.GetSymbolSegmentedName(td,segmentedName);
  11345. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11346. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11347. ELSE
  11348. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11349. END;
  11350. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11351. Symbol(section, tir, 0, offset);
  11352. ELSE
  11353. Address(section, 0);
  11354. END;
  11355. END;
  11356. | type: SyntaxTree.PortType DO
  11357. Char(section, sfTypePORT);
  11358. IF type.direction = SyntaxTree.OutPort THEN
  11359. Char(section, sfOUT)
  11360. ELSE
  11361. Char(section, sfIN)
  11362. END;
  11363. | type: SyntaxTree.ProcedureType DO
  11364. IF ~Indirect(type) THEN
  11365. IF type.isDelegate THEN
  11366. Char(section, sfTypeDelegate);
  11367. ELSE
  11368. Char(section, sfTypeProcedure);
  11369. END;
  11370. parameter := type.firstParameter;
  11371. WHILE(parameter # NIL) DO
  11372. NParameter(parameter, -1);
  11373. parameter := parameter.nextParameter;
  11374. END;
  11375. NType(type.returnType);
  11376. END;
  11377. | type:SyntaxTree.EnumerationType DO
  11378. Char(section, sfTypeENUM);
  11379. | type: SyntaxTree.BasicType DO
  11380. WITH type: SyntaxTree.BooleanType DO
  11381. IF RefInfo THEN Info(section,"Boolean") END;
  11382. Char(section, sfTypeBOOLEAN);
  11383. | type: SyntaxTree.CharacterType DO
  11384. IF type = module.system.characterType THEN
  11385. IF RefInfo THEN Info(section,"CHAR") END;
  11386. Char(section, sfTypeCHAR);
  11387. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11388. IF RefInfo THEN Info(section,"CHAR8") END;
  11389. Char(section, sfTypeCHAR8)
  11390. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11391. IF RefInfo THEN Info(section,"CHAR16") END;
  11392. Char(section, sfTypeCHAR16);
  11393. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11394. IF RefInfo THEN Info(section,"CHAR32") END;
  11395. Char(section, sfTypeCHAR32);
  11396. ELSE
  11397. HALT(100);
  11398. END;
  11399. |type: SyntaxTree.IntegerType DO
  11400. IF type(SyntaxTree.IntegerType).signed THEN
  11401. IF (type = module.system.shortintType) THEN
  11402. IF RefInfo THEN Info(section,"SHORTINT") END;
  11403. Char(section, sfTypeSHORTINT)
  11404. ELSIF (type = module.system.integerType) THEN
  11405. IF RefInfo THEN Info(section,"INTEGER") END;
  11406. Char(section, sfTypeINTEGER)
  11407. ELSIF (type = module.system.longintType) THEN
  11408. IF RefInfo THEN Info(section,"LONGINT") END;
  11409. Char(section, sfTypeLONGINT)
  11410. ELSIF (type = module.system.hugeintType) THEN
  11411. IF RefInfo THEN Info(section,"HUGEINT") END;
  11412. Char(section, sfTypeHUGEINT)
  11413. ELSIF (type = module.system.wordType) THEN
  11414. IF RefInfo THEN Info(section,"WORD") END;
  11415. Char(section, sfTypeWORD)
  11416. ELSIF (type = module.system.longWordType) THEN
  11417. IF RefInfo THEN Info(section,"LONGWORD") END;
  11418. Char(section, sfTypeLONGWORD);
  11419. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11420. IF RefInfo THEN Info(section,"SIGNED8") END;
  11421. Char(section, sfTypeSIGNED8)
  11422. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11423. IF RefInfo THEN Info(section,"SIGNED16") END;
  11424. Char(section, sfTypeSIGNED16)
  11425. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11426. IF RefInfo THEN Info(section,"SIGNED32") END;
  11427. Char(section, sfTypeSIGNED32)
  11428. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11429. IF RefInfo THEN Info(section,"SIGNED64") END;
  11430. Char(section, sfTypeSIGNED64)
  11431. ELSE
  11432. HALT(100);
  11433. END
  11434. ELSE (* unsigned *)
  11435. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11436. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11437. Char(section, sfTypeUNSIGNED8)
  11438. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11439. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11440. Char(section, sfTypeUNSIGNED16)
  11441. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11442. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11443. Char(section, sfTypeUNSIGNED32)
  11444. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11445. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11446. Char(section, sfTypeUNSIGNED64)
  11447. ELSE
  11448. HALT(100)
  11449. END
  11450. END;
  11451. | type: SyntaxTree.FloatType DO
  11452. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11453. IF RefInfo THEN Info(section,"REAL") END;
  11454. Char(section, sfTypeREAL);
  11455. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11456. IF RefInfo THEN Info(section,"LONGREAL") END;
  11457. Char(section, sfTypeLONGREAL);
  11458. ELSE
  11459. HALT(100);
  11460. END;
  11461. |type: SyntaxTree.ComplexType DO
  11462. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11463. IF RefInfo THEN Info(section,"COMPLEX") END;
  11464. Char(section, sfTypeCOMPLEX);
  11465. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11466. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11467. Char(section, sfTypeLONGCOMPLEX);
  11468. ELSE
  11469. HALT(100);
  11470. END;
  11471. |type:SyntaxTree.SetType DO
  11472. IF RefInfo THEN Info(section,"SET") END;
  11473. Char(section, sfTypeSET);
  11474. |type:SyntaxTree.AnyType DO
  11475. IF RefInfo THEN Info(section,"ANY") END;
  11476. Char(section, sfTypeANY);
  11477. |type:SyntaxTree.ObjectType DO
  11478. IF RefInfo THEN Info(section,"OBJECT") END;
  11479. Char(section, sfTypeOBJECT);
  11480. |type:SyntaxTree.ByteType DO
  11481. IF RefInfo THEN Info(section,"BYTE") END;
  11482. Char(section, sfTypeBYTE);
  11483. |type:SyntaxTree.RangeType DO
  11484. IF RefInfo THEN Info(section,"RANGE") END;
  11485. Char(section, sfTypeRANGE)
  11486. |type:SyntaxTree.AddressType DO
  11487. IF RefInfo THEN Info(section,"ADDRESS") END;
  11488. Char(section, sfTypeADDRESS)
  11489. |type:SyntaxTree.SizeType DO
  11490. IF RefInfo THEN Info(section,"SIZE") END;
  11491. Char(section, sfTypeSIZE)
  11492. ELSE
  11493. HALT(100)
  11494. END;
  11495. ELSE HALT(101);
  11496. END;
  11497. END;
  11498. END NType;
  11499. (*
  11500. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11501. *)
  11502. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11503. VAR pos: LONGINT; type: SyntaxTree.Type;
  11504. BEGIN
  11505. IF RefInfo THEN Info(section, "Parameter") END;
  11506. Char(section, sfVariable);
  11507. Size(section, procOffset);
  11508. String0(section, parameter.name);
  11509. type := parameter.type.resolved;
  11510. IF parameter.kind = SyntaxTree.VarParameter THEN
  11511. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11512. ELSE Char(section, sfIndirect)
  11513. END;
  11514. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11515. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11516. Char(section, sfIndirect);
  11517. ELSE
  11518. Char(section, sfRelative);
  11519. END;
  11520. ELSE
  11521. Char(section, sfRelative);
  11522. END;
  11523. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11524. NType(parameter.type);
  11525. END NParameter;
  11526. (*
  11527. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11528. *)
  11529. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11530. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11531. flags: SET;
  11532. BEGIN
  11533. IF procedure.externalName # NIL THEN RETURN END;
  11534. IF RefInfo THEN Info(section, "Procedure") END;
  11535. pos := CurrentIndex();
  11536. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11537. Char(section, sfProcedure);
  11538. Size(section, scopeOffset);
  11539. String0(section,procedure.name);
  11540. s := module.allSections.FindBySymbol(procedure);
  11541. Symbol(section,s,0,0); (* start *)
  11542. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11543. flags := {};
  11544. IF procedureType.isDelegate THEN
  11545. INCL(flags, flagDelegate);
  11546. END;
  11547. IF procedure.isConstructor THEN
  11548. INCL(flags, flagConstructor);
  11549. END;
  11550. Set(section, flags);
  11551. IF RefInfo THEN Info(section, "Parameters") END;
  11552. parameter := procedureType.firstParameter;
  11553. WHILE(parameter # NIL) DO
  11554. NParameter(parameter, pos);
  11555. parameter := parameter.nextParameter;
  11556. END;
  11557. IF procedureType.returnParameter # NIL THEN
  11558. NParameter(procedureType.returnParameter, pos);
  11559. END;
  11560. IF procedureType.selfParameter # NIL THEN
  11561. NParameter(procedureType.selfParameter, pos);
  11562. END;
  11563. IF RefInfo THEN Info(section, "ReturnType") END;
  11564. NType(procedureType.returnType);
  11565. NScope(procedure.procedureScope, pos);
  11566. END NProcedure;
  11567. (*
  11568. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11569. *)
  11570. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11571. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11572. BEGIN
  11573. IF RefInfo THEN Info(section, "Variable") END;
  11574. pos := CurrentIndex();
  11575. Char(section, sfVariable);
  11576. Size(section, scopeOffset);
  11577. String0(section, variable.name);
  11578. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11579. Char(section, sfAbsolute);
  11580. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11581. NamedSymbol(section, sn,variable, 0,0);
  11582. ELSE
  11583. Char(section, sfRelative);
  11584. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11585. END;
  11586. NType(variable.type);
  11587. s := module.allSections.FindBySymbol(variable);
  11588. END NVariable;
  11589. (*
  11590. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11591. *)
  11592. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11593. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11594. BEGIN
  11595. IF typeDeclaration = NIL THEN RETURN END;
  11596. pos := CurrentIndex();
  11597. s := module.allSections.FindBySymbol(typeDeclaration);
  11598. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11599. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11600. Char(section, sfTypeDeclaration);
  11601. Size(section, scopeOffset);
  11602. String0(section, typeDeclaration.name);
  11603. declared := typeDeclaration.declaredType.resolved;
  11604. IF (declared IS SyntaxTree.PointerType) THEN
  11605. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11606. END;
  11607. WITH declared: SyntaxTree.RecordType DO
  11608. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11609. Symbol(section, s, 0, offset);
  11610. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11611. Basic.AppendToSegmentedName(name,".@Info");
  11612. s := module.allSections.FindByName(name);
  11613. IF s # NIL THEN (* does not work for coop *)
  11614. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11615. END;
  11616. NScope(declared.recordScope, pos);
  11617. |declared: SyntaxTree.CellType DO
  11618. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11619. Symbol(section, s, 0, offset);
  11620. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11621. Basic.AppendToSegmentedName(name,".@Info");
  11622. s := module.allSections.FindByName(name);
  11623. IF s # NIL THEN
  11624. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11625. END;
  11626. NScope(declared.cellScope, pos);
  11627. ELSE
  11628. Address(section, 0);
  11629. END;
  11630. END NTypeDeclaration;
  11631. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11632. VAR pos: LONGINT;
  11633. BEGIN
  11634. pos := CurrentIndex();
  11635. Char(section,sfModule);
  11636. Size(section, prevSymbol);
  11637. String0(section, module.name);
  11638. NScope(module.moduleScope, pos);
  11639. END NModule;
  11640. (*
  11641. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11642. *)
  11643. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11644. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11645. BEGIN
  11646. IF scope = NIL THEN RETURN END;
  11647. IF RefInfo THEN Info(section, "Scope") END;
  11648. Char(section, sfScopeBegin);
  11649. variable := scope.firstVariable;
  11650. WHILE (variable # NIL) DO
  11651. NVariable(variable, prevSymbol);
  11652. variable := variable.nextVariable;
  11653. END;
  11654. WITH scope: SyntaxTree.ModuleScope DO
  11655. bodyProcedure := scope.bodyProcedure;
  11656. |scope: SyntaxTree.RecordScope DO
  11657. bodyProcedure := scope.bodyProcedure;
  11658. ELSE
  11659. bodyProcedure := NIL;
  11660. END;
  11661. IF bodyProcedure # NIL THEN
  11662. NProcedure(bodyProcedure, prevSymbol)
  11663. END;
  11664. procedure := scope.firstProcedure;
  11665. WHILE procedure # NIL DO
  11666. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11667. procedure := procedure.nextProcedure;
  11668. END;
  11669. typeDeclaration := scope.firstTypeDeclaration;
  11670. WHILE typeDeclaration # NIL DO
  11671. NTypeDeclaration(typeDeclaration, prevSymbol);
  11672. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11673. END;
  11674. Char(section, sfScopeEnd); (* scope ends *)
  11675. END NScope;
  11676. BEGIN
  11677. NEW(indirectTypes, 32);
  11678. ArrayBlock(section,sizePC,"", FALSE);
  11679. startPC := section.pc;
  11680. NModule(module.module, -1);
  11681. PatchArray(section,sizePC,CurrentIndex());
  11682. END References;
  11683. (*
  11684. Command* = RECORD
  11685. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11686. name*: Name; (* name of the procedure *)
  11687. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11688. entryAdr* : ADDRESS; (* entry address of procedure *)
  11689. END;
  11690. *)
  11691. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11692. VAR
  11693. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11694. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11695. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11696. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11697. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11698. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11699. BEGIN
  11700. RETURN
  11701. (type = NIL) OR
  11702. (type.resolved IS SyntaxTree.RecordType) OR
  11703. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11704. (type.resolved IS SyntaxTree.AnyType);
  11705. END TypeAllowed;
  11706. BEGIN
  11707. numberParameters := procedureType.numberParameters;
  11708. RETURN
  11709. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11710. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11711. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11712. END GetProcedureAllowed;
  11713. PROCEDURE WriteType(type : SyntaxTree.Type);
  11714. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11715. name: Basic.SegmentedName; offset: LONGINT;
  11716. BEGIN
  11717. IF type = NIL THEN
  11718. Address(source,0);
  11719. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11720. Address(source,1);
  11721. ELSE
  11722. type := type.resolved;
  11723. IF type IS SyntaxTree.PointerType THEN
  11724. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11725. END;
  11726. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11727. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11728. name[0] := typeDeclaration.name; name[1] := -1;
  11729. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11730. ASSERT(section # NIL);
  11731. ELSE
  11732. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11733. (* TODO *)
  11734. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11735. END;
  11736. IF implementationVisitor.backend.cooperative THEN
  11737. offset := 0;
  11738. ELSE
  11739. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11740. END;
  11741. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11742. END;
  11743. END WriteType;
  11744. BEGIN
  11745. Info(source, "command array descriptor");
  11746. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11747. numberCommands := 0;
  11748. Info(source, "command array content");
  11749. FOR i := 0 TO module.allSections.Length() - 1 DO
  11750. p := module.allSections.GetSection(i);
  11751. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11752. procedure := p.symbol(SyntaxTree.Procedure);
  11753. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11754. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11755. procedure.GetName(name);
  11756. Name(source,name);
  11757. numberParameters := procedureType.numberParameters;
  11758. (* offset of type of first parameter *)
  11759. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11760. ELSE WriteType(procedureType.firstParameter.type)
  11761. END;
  11762. (* offset of type of return parameter *)
  11763. WriteType(procedureType.returnType);
  11764. (* command name *)
  11765. (* command code offset *)
  11766. Symbol(source,p,0,0);
  11767. INC(numberCommands);
  11768. IF Trace THEN
  11769. D.Ln;
  11770. END;
  11771. END;
  11772. END
  11773. END;
  11774. PatchArray(source,sizePC,numberCommands);
  11775. END CommandArray;
  11776. (* to prevent from double import of different module aliases *)
  11777. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11778. VAR i: SyntaxTree.Import;
  11779. BEGIN
  11780. i := module.module.moduleScope.firstImport;
  11781. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11782. i := i.nextImport;
  11783. END;
  11784. RETURN i = import
  11785. END IsFirstDirectOccurence;
  11786. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11787. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11788. BEGIN
  11789. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11790. ArrayBlock(source,pc,"", FALSE);
  11791. Info(source, "import module array data");
  11792. IF implementationVisitor.backend.cooperative THEN
  11793. offset := 0;
  11794. ELSE
  11795. IF module.system.addressType.sizeInBits = 64 THEN
  11796. (* change this when Heaps.HeapBlock is modified *)
  11797. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11798. ELSE
  11799. (* change this when Heaps.HeapBlock is modified *)
  11800. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11801. END;
  11802. END;
  11803. import := module.module.moduleScope.firstImport;
  11804. numberImports := 0;
  11805. WHILE import # NIL DO
  11806. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11807. Global.GetModuleSegmentedName(import.module,name);
  11808. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11809. NamedSymbol(source, name, NIL, 0, offset);
  11810. INC(numberImports);
  11811. END;
  11812. import := import.nextImport
  11813. END;
  11814. PatchArray(source,pc,numberImports);
  11815. END ImportsArray;
  11816. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11817. VAR
  11818. p: Sections.Section; sizePC, size, i: LONGINT;
  11819. BEGIN
  11820. Info(source, "Type info section");
  11821. size := 0;
  11822. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11823. FOR i := 0 TO module.allSections.Length() - 1 DO
  11824. p := module.allSections.GetSection(i);
  11825. WITH p: IntermediateCode.Section DO
  11826. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11827. Symbol(source,p,EmptyBlockOffset,0);
  11828. INC(size);
  11829. END;
  11830. END
  11831. END;
  11832. PatchArray(source,sizePC,size);
  11833. END TypeInfoSection;
  11834. (*
  11835. ProcTableEntry* = RECORD
  11836. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11837. noPtr*: LONGINT;
  11838. END;
  11839. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11840. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11841. *)
  11842. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11843. VAR
  11844. numberPointers: LONGINT;
  11845. procedure: SyntaxTree.Procedure;
  11846. BEGIN
  11847. Info(section,"pcFrom");
  11848. Symbol(section,procedureSection,0,0);
  11849. Info(section,"pcTo");
  11850. Symbol(section, procedureSection, procedureSection.pc, 0);
  11851. Info(section,"pointer to offsets array");
  11852. Symbol(section, section,section.pc+1,0);
  11853. Info(section,"offsets array");
  11854. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11855. PointerArray(section, procedure.procedureScope, numberPointers);
  11856. END ProcedureDescriptor;
  11857. (* only for tracing, the descriptor is otherwise not complete ! *)
  11858. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11859. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11860. BEGIN
  11861. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11862. name := procedureSection.name;
  11863. Basic.AppendToSegmentedName(name,".@Info");
  11864. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11865. Address(section,0);
  11866. Symbol(section,section,2,0);
  11867. (*
  11868. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11869. descSize: SIZE;
  11870. sentinel: ADDRESS; (* = MPO-4 *)
  11871. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11872. flags*: SET;
  11873. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11874. name*: Name;
  11875. END;
  11876. *)
  11877. Size(section, 0);
  11878. Address(section,0);
  11879. Address(section,0);
  11880. Set(section,{});
  11881. moduleSection := ModuleSection();
  11882. Symbol( section, moduleSection, moduleSection.pc,0);
  11883. IF procedureSection.symbol = NIL THEN
  11884. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11885. ELSE
  11886. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11887. END;
  11888. Name(section, infoName);
  11889. Size(section, 0);
  11890. RETURN section;
  11891. END MakeProcedureDescriptorTag;
  11892. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11893. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11894. BEGIN
  11895. name := procedureSection.name;
  11896. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11897. IF implementationVisitor.backend.cooperative THEN
  11898. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11899. Info(section, "TypeDescriptor");
  11900. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11901. NamedSymbol(dest, name,NIL, 0, 0);
  11902. BaseRecord(dest);
  11903. offset := 0;
  11904. ELSIF CreateProcedureDescInfo THEN
  11905. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11906. Address(dest,0);
  11907. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11908. offset := dest.pc;
  11909. ELSE
  11910. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11911. END;
  11912. ProcedureDescriptor(dest, procedureSection);
  11913. Symbol(section, dest, offset, 0);
  11914. END ProcedureDescriptorPointer;
  11915. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11916. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11917. BEGIN
  11918. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11919. numberProcs := 0;
  11920. FOR i := 0 TO module.allSections.Length() - 1 DO
  11921. destination := module.allSections.GetSection(i);
  11922. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11923. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11924. INC(numberProcs);
  11925. END
  11926. END;
  11927. PatchArray(section, sizePC, numberProcs);
  11928. END ProcedureDescriptorArray;
  11929. (*
  11930. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11931. VAR
  11932. next*: Module; (** once a module is published, all fields are read-only *)
  11933. name*: Name;
  11934. init, published: BOOLEAN;
  11935. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11936. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11937. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11938. command*: POINTER TO ARRAY OF Command;
  11939. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11940. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11941. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11942. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11943. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11944. data*, code*: Bytes;
  11945. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11946. export*: ExportDesc;
  11947. term*: TerminationHandler;
  11948. exTable*: ExceptionTable;
  11949. noProcs*: LONGINT;
  11950. firstProc*: ADDRESS; <- done by loader
  11951. maxPtrs*: LONGINT;
  11952. crc*: LONGINT;
  11953. *)
  11954. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11955. BEGIN
  11956. Info(section, "cycle");
  11957. Size(section,0);
  11958. Info(section, "references");
  11959. Size(section,0);
  11960. Info(section, "nextMarked");
  11961. Address(section,0);
  11962. Info(section, "nextWatched");
  11963. Address(section,0);
  11964. END BasePointer;
  11965. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11966. BEGIN
  11967. BasePointer(section);
  11968. Info(section, "action");
  11969. Address(section,0);
  11970. Info(section, "monitor");
  11971. Address(section,0);
  11972. END BaseObject;
  11973. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11974. BEGIN
  11975. BasePointer(section);
  11976. Info(section, "action");
  11977. Address(section,0);
  11978. Info(section, "monitor");
  11979. Address(section,0);
  11980. END BaseRecord;
  11981. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11982. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11983. pooledName: Basic.SegmentedName;
  11984. symbol: SyntaxTree.Symbol;
  11985. BEGIN
  11986. Global.GetModuleName(module.module,name);
  11987. Strings.Append(name,".@Module.@Descriptor");
  11988. Basic.ToSegmentedName(name, pooledName);
  11989. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11990. Symbol(section,descriptorSection,0,0);
  11991. Info(descriptorSection, "descriptor");
  11992. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11993. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11994. Address(descriptorSection,0);
  11995. Global.GetModuleName(module.module,name);
  11996. Strings.Append(name,".@Trace");
  11997. Basic.ToSegmentedName(name, pooledName);
  11998. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11999. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12000. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12001. END ModuleDescriptor;
  12002. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12003. VAR name: ARRAY 128 OF CHAR;
  12004. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12005. symbol: SyntaxTree.Symbol;
  12006. BEGIN
  12007. Global.GetModuleName(module.module,name);
  12008. Strings.Append(name,".@Module");
  12009. Basic.ToSegmentedName(name, pooledName);
  12010. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12011. moduleSection.SetExported(TRUE);
  12012. IF moduleSection.pc = 0 THEN
  12013. IF implementationVisitor.backend.cooperative THEN
  12014. Info(moduleSection, "descriptor");
  12015. ModuleDescriptor(moduleSection);
  12016. BaseObject(moduleSection);
  12017. implementationVisitor.CreateTraceModuleMethod(module.module);
  12018. ELSE
  12019. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12020. Info(moduleSection, "HeapBlock");
  12021. Symbol(moduleSection,moduleSection,2,0);
  12022. Info(moduleSection, "TypeDescriptor");
  12023. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12024. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12025. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12026. END;
  12027. END;
  12028. RETURN moduleSection;
  12029. END ModuleSection;
  12030. PROCEDURE NewModuleInfo();
  12031. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12032. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12033. sectionName: Basic.SectionName;
  12034. CONST MPO=-40000000H;
  12035. BEGIN
  12036. (*
  12037. TypeDesc* = POINTER TO RECORD
  12038. descSize: SIZE;
  12039. sentinel: LONGINT; (* = MPO-4 *)
  12040. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12041. flags*: SET;
  12042. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12043. name*: Name;
  12044. refsOffset: SIZE;
  12045. END;
  12046. *)
  12047. (*name is missing prefixes sometimes*)
  12048. Global.GetModuleSegmentedName(module.module,name);
  12049. Basic.AppendToSegmentedName(name,".@Info");
  12050. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12051. IF ~implementationVisitor.backend.cooperative THEN
  12052. Info(source, "HeapBlock");
  12053. Address(source,0); (* an empty heap block prevents GC marking *)
  12054. Info(source, "TypeDescriptor");
  12055. Address(source,0);
  12056. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12057. END;
  12058. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12059. Address(source,MPO-4);
  12060. Info(source, "type tag pointer");
  12061. Address( source,0);
  12062. Info(source, "type flags");
  12063. flags := {};
  12064. Set( source, flags);
  12065. Info(source, "pointer to module");
  12066. moduleSection := ModuleSection();
  12067. Symbol( source, moduleSection, moduleSection.pc,0);
  12068. Info(source, "type name");
  12069. i := 0;
  12070. sectionName := "@Self";
  12071. (*
  12072. Global.GetSymbolSegmentedName(td,name);
  12073. Basic.SegmentedNameToString(name, sectionName);
  12074. *)
  12075. Name(source,sectionName);
  12076. patchInfoPC := source.pc;
  12077. Size(source, 0);
  12078. END NewModuleInfo;
  12079. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12080. VAR
  12081. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12082. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12083. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12084. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12085. referenceSectionOffset : LONGINT;
  12086. name: Basic.SegmentedName; offset: LONGINT;
  12087. flags: SET;
  12088. BEGIN
  12089. NewModuleInfo();
  12090. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12091. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12092. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12093. ImportsArray(importSection);
  12094. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12095. CommandArray(commandsSection);
  12096. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12097. ExceptionArray(exceptionSection);
  12098. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12099. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12100. TypeInfoSection(typeInfoSection);
  12101. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12102. referenceSection.SetExported(TRUE);
  12103. References(referenceSection);
  12104. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12105. ProcedureDescriptorArray(procTableSection, numberProcs);
  12106. IF ProtectModulesPointers THEN
  12107. name := "Heaps.AnyPtr";
  12108. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12109. (* set base pointer *)
  12110. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12111. END;
  12112. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12113. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12114. moduleSection := ModuleSection();
  12115. Info(moduleSection, "nextRoot*: RootObject");
  12116. Address(moduleSection,0);
  12117. Info(moduleSection, "next*: Module");
  12118. Address(moduleSection,0);
  12119. Info(moduleSection, "name*: Name");
  12120. Name(moduleSection,moduleName);
  12121. Info(moduleSection, "init, published: BOOLEAN");
  12122. Boolean(moduleSection,FALSE);
  12123. Boolean(moduleSection,FALSE);
  12124. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12125. Boolean(moduleSection,FALSE);
  12126. Boolean(moduleSection,FALSE);
  12127. Info(moduleSection, "refcnt*: LONGINT");
  12128. Longint(moduleSection,0);
  12129. Info(moduleSection, "sb*: ADDRESS");
  12130. Address(moduleSection,0);
  12131. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12132. Address(moduleSection,0);
  12133. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12134. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12135. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12136. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12137. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12138. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12139. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12140. Symbol(moduleSection,importSection,importSectionOffset,0);
  12141. Info(moduleSection, "procTable*: ProcTable");
  12142. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12143. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12144. Address(moduleSection,0);
  12145. Address(moduleSection,0);
  12146. Address(moduleSection,0);
  12147. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12148. Info(moduleSection, "export*: ExportDesc");
  12149. ExportDesc(moduleSection);
  12150. Info(moduleSection, "term*: TerminationHandler");
  12151. Address(moduleSection,0);
  12152. Info(moduleSection, "exTable*: ExceptionTable");
  12153. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12154. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12155. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12156. Info(moduleSection, "crc*: LONGINT");
  12157. patchCRC:= moduleSection.pc;
  12158. Longint(moduleSection, 0); (*! must be implemented *)
  12159. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12160. Info(moduleSection, "body*: ADDRESS");
  12161. Symbol(moduleSection, bodyProc, 0,0);
  12162. Info(moduleSection, "module flags");
  12163. flags := {};
  12164. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12165. Set( moduleSection, flags);
  12166. IF implementationVisitor.backend.cooperative THEN
  12167. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12168. Info(moduleSection, "monitor.owner");
  12169. Address(moduleSection,0);
  12170. Info(moduleSection, "monitor.nestingLevel");
  12171. Address(moduleSection,0);
  12172. Info(moduleSection, "monitor.blockedQueue");
  12173. Address(moduleSection,0); Address(moduleSection,0);
  12174. Info(moduleSection, "monitor.waitingQueue");
  12175. Address(moduleSection,0); Address(moduleSection,0);
  12176. Info(moduleSection, "monitor.waitingSentinel");
  12177. Address(moduleSection,0);
  12178. END;
  12179. END Module;
  12180. PROCEDURE PatchCRC(crc: LONGINT);
  12181. BEGIN
  12182. IF ~simple THEN
  12183. PatchLongint(ModuleSection(), patchCRC, crc);
  12184. END;
  12185. END PatchCRC;
  12186. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12187. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12188. BEGIN
  12189. ArrayBlock(source,pc,"",FALSE);
  12190. Info(source, "pointer offsets array data");
  12191. IF scope IS SyntaxTree.RecordScope THEN
  12192. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12193. ELSIF scope IS SyntaxTree.CellScope THEN
  12194. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12195. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12196. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12197. WHILE variable # NIL DO
  12198. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12199. symbol := module.allSections.FindBySymbol(variable);
  12200. ASSERT(symbol # NIL);
  12201. Pointers(0,symbol, source,variable.type,numberPointers);
  12202. END;
  12203. variable := variable.nextVariable;
  12204. END;
  12205. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12206. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12207. WHILE parameter # NIL DO
  12208. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12209. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12210. END;
  12211. parameter := parameter.nextParameter;
  12212. END;
  12213. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12214. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12215. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12216. IF implementationVisitor.backend.preciseGC THEN
  12217. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12218. END;
  12219. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12220. END;
  12221. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12222. WHILE(variable # NIL) DO
  12223. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12224. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12225. END;
  12226. variable := variable.nextVariable
  12227. END;
  12228. END;
  12229. PatchArray(source,pc,numberPointers);
  12230. END PointerArray;
  12231. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12232. VAR
  12233. name: Basic.SegmentedName;
  12234. section: IntermediateCode.Section;
  12235. BEGIN
  12236. Global.GetSymbolSegmentedName(symbol,name);
  12237. Basic.AppendToSegmentedName(name,suffix);
  12238. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12239. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12240. Info(section, "HeapBlock");
  12241. Address(section,0); (* empty such that GC does not go on traversing *)
  12242. Info(section, suffix);
  12243. Address(section,0);
  12244. pc := section.pc;
  12245. RETURN section;
  12246. END SymbolSection;
  12247. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12248. VAR recordType: SyntaxTree.RecordType;
  12249. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12250. section: Sections.Section; cellType: SyntaxTree.CellType;
  12251. tdInfoOffset: LONGINT;
  12252. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12253. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12254. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12255. sectionName: Basic.SectionName;
  12256. CONST MPO=-40000000H;
  12257. BEGIN
  12258. (*
  12259. TypeDesc* = POINTER TO RECORD
  12260. descSize: SIZE;
  12261. sentinel: LONGINT; (* = MPO-4 *)
  12262. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12263. flags*: SET;
  12264. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12265. name*: Name;
  12266. refsOffset: SIZE;
  12267. END;
  12268. *)
  12269. (* source := module.sections.FindByName(...) *)
  12270. Global.GetSymbolSegmentedName(td,name);
  12271. Basic.AppendToSegmentedName(name,".@Info");
  12272. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12273. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12274. Address(source,0);
  12275. Info(source, "TypeDescriptor");
  12276. Address(source,0);
  12277. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12278. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12279. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12280. Info(source, "type tag pointer");
  12281. Symbol( source, tag, offset, 0);
  12282. Info(source, "type flags");
  12283. flags := {};
  12284. IF isProtected THEN INCL(flags,31) END;
  12285. Set( source, flags);
  12286. Info(source, "pointer to module");
  12287. moduleSection := ModuleSection();
  12288. Symbol( source, moduleSection, moduleSection.pc,0);
  12289. Info(source, "type name");
  12290. i := 0;
  12291. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12292. (*
  12293. Global.GetSymbolSegmentedName(td,name);
  12294. Basic.SegmentedNameToString(name, sectionName);
  12295. *)
  12296. Name(source,sectionName);
  12297. Size(source, 0);
  12298. RETURN source;
  12299. END NewTypeDescriptorInfo;
  12300. PROCEDURE NewTypeDescriptor;
  12301. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12302. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12303. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12304. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12305. CONST MPO=-40000000H;
  12306. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12307. VAR i: LONGINT;
  12308. PROCEDURE Td(record: SyntaxTree.RecordType);
  12309. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12310. BEGIN
  12311. IF record # NIL THEN
  12312. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12313. baseTD := record.typeDeclaration;
  12314. Global.GetSymbolSegmentedName(baseTD,name);
  12315. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12316. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12317. ELSE
  12318. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12319. END;
  12320. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12321. Symbol(source, tir, 0, offset);
  12322. IF reverse THEN Td(record.GetBaseRecord()) END;
  12323. END;
  12324. END Td;
  12325. BEGIN
  12326. Info(source, "tag table");
  12327. baseRecord := recordType;
  12328. i := 0;
  12329. WHILE baseRecord # NIL DO
  12330. INC(i);
  12331. baseRecord := baseRecord.GetBaseRecord();
  12332. END;
  12333. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12334. IF ~reverse THEN Td(recordType) END;
  12335. WHILE i < size DO
  12336. Address(source,0);
  12337. INC(i);
  12338. END;
  12339. IF reverse THEN Td(recordType) END;
  12340. END TdTable;
  12341. PROCEDURE MethodTable(reverse: BOOLEAN);
  12342. VAR i,methods: LONGINT;
  12343. BEGIN
  12344. Info(source, "method table");
  12345. IF recordType # NIL THEN
  12346. methods := recordType.recordScope.numberMethods;
  12347. IF reverse THEN
  12348. FOR i := methods-1 TO 0 BY -1 DO
  12349. procedure := recordType.recordScope.FindMethod(i);
  12350. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12351. NamedSymbol(source, name,procedure, 0,0);
  12352. END;
  12353. ELSE
  12354. FOR i := 0 TO methods-1 DO
  12355. procedure := recordType.recordScope.FindMethod(i);
  12356. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12357. NamedSymbol(source, name,procedure, 0,0);
  12358. END;
  12359. END;
  12360. END;
  12361. END MethodTable;
  12362. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12363. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12364. BEGIN
  12365. Info(source, "method table");
  12366. baseRecord := recordType;
  12367. WHILE baseRecord.baseType # NIL DO
  12368. baseRecord := baseRecord.GetBaseRecord ();
  12369. END;
  12370. GetRecordTypeName (baseRecord, name);
  12371. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12372. IF name = stackFrame THEN
  12373. start := 0;
  12374. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12375. baseRecord := recordType;
  12376. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12377. baseRecord := baseRecord.GetBaseRecord ();
  12378. END;
  12379. IF baseRecord # NIL THEN
  12380. GetRecordTypeName (baseRecord, name);
  12381. IF pointer & ~baseRecord.isObject THEN
  12382. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12383. END;
  12384. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12385. ELSIF recordType.isObject THEN
  12386. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12387. ELSIF pointer THEN
  12388. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12389. ELSE
  12390. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12391. END;
  12392. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12393. Symbol(source, tir, 0, 0);
  12394. start := 0;
  12395. baseRecord := recordType;
  12396. WHILE (baseRecord # NIL) DO
  12397. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12398. baseRecord := baseRecord.GetBaseRecord ();
  12399. END;
  12400. ELSE
  12401. (* explicit trace method: *)
  12402. procedure := recordType.recordScope.FindMethod(0);
  12403. IF ~procedure.isFinalizer THEN
  12404. Global.GetSymbolSegmentedName(procedure, name);
  12405. NamedSymbol(source, name,procedure, 0,0);
  12406. END;
  12407. start := 1;
  12408. END;
  12409. IF (name # stackFrame) & recordType.isObject THEN
  12410. baseRecord := recordType;
  12411. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12412. baseRecord := baseRecord.GetBaseRecord ();
  12413. END;
  12414. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12415. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12416. ELSE
  12417. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12418. END;
  12419. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12420. Symbol(source, tir, 0, 0);
  12421. END;
  12422. methods := recordType.recordScope.numberMethods;
  12423. FOR i := start TO methods-1 DO
  12424. procedure := recordType.recordScope.FindMethod(i);
  12425. IF ~procedure.isFinalizer THEN
  12426. Global.GetSymbolSegmentedName(procedure, name);
  12427. NamedSymbol(source, name,procedure, 0,0);
  12428. END;
  12429. END;
  12430. END CooperativeMethodTable;
  12431. BEGIN
  12432. Global.GetSymbolSegmentedName(td,name);
  12433. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12434. source.SetExported(IsExported(td));
  12435. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12436. IF implementationVisitor.backend.cooperative THEN
  12437. base := NIL;
  12438. baseRecord := recordType.GetBaseRecord();
  12439. IF baseRecord # NIL THEN
  12440. baseTD := baseRecord.typeDeclaration;
  12441. END;
  12442. IF ~recordType.isObject THEN
  12443. Info(source, "parent");
  12444. IF baseRecord # NIL THEN
  12445. Global.GetSymbolSegmentedName(baseTD,name);
  12446. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12447. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12448. ELSE
  12449. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12450. END;
  12451. Symbol(source, tir, 0, 0);
  12452. ELSE
  12453. Address(source,0);
  12454. END;
  12455. Info(source, "record size");
  12456. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12457. CooperativeMethodTable(FALSE);
  12458. base := source;
  12459. Global.GetSymbolSegmentedName(td,name);
  12460. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12461. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12462. source.SetExported(IsExported(td));
  12463. END;
  12464. Info(source, "parent");
  12465. IF baseRecord # NIL THEN
  12466. Global.GetSymbolSegmentedName(baseTD,name);
  12467. sym := baseTD;
  12468. IF ~recordType.isObject THEN
  12469. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12470. sym := NIL;
  12471. END;
  12472. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12473. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12474. ELSE
  12475. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12476. END;
  12477. Symbol(source, tir, 0, 0);
  12478. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12479. Address(source,0);
  12480. ELSE
  12481. IF recordType.isObject THEN
  12482. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12483. ELSE
  12484. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12485. END;
  12486. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12487. Symbol(source, tir, 0, 0);
  12488. END;
  12489. Info(source, "base record descriptor");
  12490. Symbol(source, base, 0, 0);
  12491. CooperativeMethodTable(TRUE);
  12492. IF recordType.hasPointers THEN
  12493. IF ~HasExplicitTraceMethod (recordType) THEN
  12494. implementationVisitor.CreateTraceMethod(recordType);
  12495. END;
  12496. implementationVisitor.CreateResetProcedure(recordType);
  12497. implementationVisitor.CreateAssignProcedure(recordType);
  12498. END;
  12499. ELSIF ~simple THEN
  12500. (*
  12501. MethodEnd = MPO
  12502. ---
  12503. methods (# methods)
  12504. ---
  12505. tags (16)
  12506. ---
  12507. TypeDesc = TypeInfoAdr
  12508. ---
  12509. td adr ---> rec size
  12510. ----
  12511. pointer offsets
  12512. ----
  12513. (padding)
  12514. -----
  12515. empty [2 addresses aligned]
  12516. empty
  12517. empty
  12518. numPtrs
  12519. ---
  12520. pointer offsets
  12521. ---
  12522. *)
  12523. Info(source, "MethodEnd = MPO");
  12524. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12525. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12526. MethodTable(TRUE);
  12527. TdTable(TypeTags, TRUE);
  12528. Info(source, "type descriptor info pointer");
  12529. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12530. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12531. IF (cellType # NIL) THEN
  12532. IF cellType.sizeInBits < 0 THEN
  12533. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12534. END;
  12535. Info(source, "cell size");
  12536. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12537. ELSE
  12538. Info(source, "record size");
  12539. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12540. END;
  12541. Info(source, "pointer offsets pointer");
  12542. padding := 1- source.pc MOD 2;
  12543. Symbol(source, source, source.pc+1+padding,0);
  12544. IF padding >0 THEN
  12545. Info(source, "padding");
  12546. FOR i := 1 TO padding DO Address(source,0) END;
  12547. END;
  12548. IF cellType # NIL THEN
  12549. PointerArray(source, cellType.cellScope, numberPointers);
  12550. ELSE
  12551. PointerArray(source, recordType.recordScope, numberPointers);
  12552. END;
  12553. ELSE
  12554. (*
  12555. simple:
  12556. td adr --> size
  12557. tag(1)
  12558. tag(2)
  12559. tag(3)
  12560. methods ->
  12561. *)
  12562. Info(source, "record size");
  12563. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12564. TdTable(TypeTags, FALSE);
  12565. MethodTable(FALSE);
  12566. END;
  12567. END NewTypeDescriptor;
  12568. BEGIN
  12569. x := x.resolved;
  12570. IF (x IS SyntaxTree.PointerType) THEN
  12571. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12572. END;
  12573. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12574. recordType := x(SyntaxTree.RecordType);
  12575. td := x.typeDeclaration;
  12576. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12577. ASSERT(td # NIL);
  12578. section := module.allSections.FindBySymbol(td); (* TODO *)
  12579. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12580. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12581. NewTypeDescriptor
  12582. END;
  12583. END;
  12584. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12585. cellType := x(SyntaxTree.CellType);
  12586. td := x.typeDeclaration;
  12587. section := module.allSections.FindBySymbol(td); (* TODO *)
  12588. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12589. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12590. NewTypeDescriptor
  12591. END;
  12592. END;
  12593. END
  12594. END CheckTypeDeclaration
  12595. END MetaDataGenerator;
  12596. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12597. VAR
  12598. trace-: BOOLEAN;
  12599. traceString-: SyntaxTree.IdentifierString;
  12600. traceModuleName-: SyntaxTree.IdentifierString;
  12601. profile-: BOOLEAN;
  12602. noRuntimeChecks: BOOLEAN;
  12603. simpleMetaData-: BOOLEAN;
  12604. noAsserts: BOOLEAN;
  12605. optimize-: BOOLEAN;
  12606. cooperative-: BOOLEAN;
  12607. preregisterStatic-: BOOLEAN;
  12608. dump-: Basic.Writer;
  12609. cellsAreObjects: BOOLEAN;
  12610. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12611. experiment: BOOLEAN;
  12612. PROCEDURE &InitIntermediateBackend*;
  12613. BEGIN
  12614. simpleMetaData := FALSE;
  12615. InitBackend;
  12616. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12617. SetTraceModuleName(DefaultTraceModuleName);
  12618. END InitIntermediateBackend;
  12619. (* must be overwritten by actual backend, if parameter registers should be used *)
  12620. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12621. BEGIN
  12622. RETURN 0; (* default case: no parameter registers *)
  12623. END NumberParameterRegisters;
  12624. (* must be overwritten by actual backend, if parameter registers should be used *)
  12625. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12626. BEGIN
  12627. HALT(100); (* abstract *)
  12628. END ParameterRegister;
  12629. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12630. VAR
  12631. declarationVisitor: DeclarationVisitor;
  12632. implementationVisitor: ImplementationVisitor;
  12633. module: Sections.Module;
  12634. name, platformName: SyntaxTree.IdentifierString;
  12635. meta: MetaDataGenerator;
  12636. crc: CRC.CRC32Stream;
  12637. BEGIN
  12638. ResetError;
  12639. Global.GetSymbolName(x,name);
  12640. NEW(module,x,system); (* backend structures *)
  12641. Global.GetModuleName(x, name);
  12642. module.SetModuleName(name);
  12643. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12644. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12645. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12646. declarationVisitor.Module(x,module);
  12647. IF ~meta.simple THEN
  12648. meta.Module(implementationVisitor.moduleBodySection);
  12649. END;
  12650. GetDescription(platformName);
  12651. module.SetPlatformName(platformName);
  12652. NEW(crc);
  12653. module.allSections.WriteRaw(crc);
  12654. crc.Update;
  12655. meta.PatchCRC(crc.GetCRC());
  12656. RETURN module
  12657. END GenerateIntermediate;
  12658. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12659. BEGIN RETURN TRUE
  12660. END SupportedImmediate;
  12661. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12662. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12663. END ProcessSyntaxTreeModule;
  12664. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12665. VAR
  12666. result: Sections.Module;
  12667. traceName: Basic.MessageString;
  12668. BEGIN
  12669. ASSERT(intermediateCodeModule IS Sections.Module);
  12670. result := intermediateCodeModule(Sections.Module);
  12671. IF trace THEN
  12672. traceName := "intermediate code trace: ";
  12673. Strings.Append(traceName,traceString);
  12674. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12675. IF (traceString="") OR (traceString="*") THEN
  12676. result.Dump(dump);
  12677. dump.Update
  12678. ELSE
  12679. Sections.DumpFiltered(dump, result, traceString);
  12680. END
  12681. END;
  12682. RETURN result
  12683. END ProcessIntermediateCodeModule;
  12684. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12685. BEGIN instructionSet := "Intermediate";
  12686. END GetDescription;
  12687. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12688. BEGIN
  12689. SELF.simpleMetaData := simpleMetaData;
  12690. END SetSimpleMetaData;
  12691. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12692. BEGIN COPY(name, traceModuleName)
  12693. END SetTraceModuleName;
  12694. PROCEDURE DefineOptions*(options: Options.Options);
  12695. BEGIN
  12696. DefineOptions^(options);
  12697. options.Add(0X,"trace",Options.String);
  12698. options.Add(0X,"builtinsModule",Options.String);
  12699. options.Add(0X,"traceModule",Options.String);
  12700. options.Add(0X,"profile",Options.Flag);
  12701. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12702. options.Add(0X,"noAsserts",Options.Flag);
  12703. options.Add(0X,"metaData",Options.String);
  12704. options.Add('o',"optimize", Options.Flag);
  12705. options.Add(0X,"preregisterStatic", Options.Flag);
  12706. options.Add(0X,"cellsAreObjects", Options.Flag);
  12707. options.Add(0X,"preciseGC", Options.Flag);
  12708. options.Add(0X,"trackLeave", Options.Flag);
  12709. options.Add(0X,"writeBarriers", Options.Flag);
  12710. options.Add(0X,"experiment", Options.Flag);
  12711. END DefineOptions;
  12712. PROCEDURE GetOptions*(options: Options.Options);
  12713. VAR name,string: SyntaxTree.IdentifierString;
  12714. BEGIN
  12715. GetOptions^(options);
  12716. trace := options.GetString("trace",traceString);
  12717. profile := options.GetFlag("profile");
  12718. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12719. noAsserts := options.GetFlag("noAsserts");
  12720. cooperative := options.GetFlag("cooperative");
  12721. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12722. simpleMetaData := TRUE
  12723. END;
  12724. IF options.GetString("metaData",string) THEN
  12725. IF string = "simple" THEN simpleMetaData := TRUE
  12726. ELSIF string ="full" THEN simpleMetaData := FALSE
  12727. END;
  12728. END;
  12729. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12730. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12731. optimize := options.GetFlag("optimize");
  12732. preregisterStatic := options.GetFlag("preregisterStatic");
  12733. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12734. preciseGC := options.GetFlag("preciseGC");
  12735. trackLeave := options.GetFlag("trackLeave");
  12736. writeBarriers := options.GetFlag("writeBarriers");
  12737. experiment := options.GetFlag("experiment");
  12738. END GetOptions;
  12739. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12740. BEGIN RETURN SymbolFileFormat.Get()
  12741. END DefaultSymbolFileFormat;
  12742. END IntermediateBackend;
  12743. (* ----------------------------------- register allocation ------------------------------------- *)
  12744. (* register mapping scheme
  12745. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12746. spill offset
  12747. part(n) --> ticket <--> physical register
  12748. spill offset
  12749. *)
  12750. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12751. emptyOperand: IntermediateCode.Operand;
  12752. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12753. statCoopResetVariables: LONGINT;
  12754. statCoopModifyAssignments: LONGINT;
  12755. modifyAssignmentsPC : LONGINT;
  12756. statCoopNilCheck: LONGINT;
  12757. statCoopSwitch: LONGINT;
  12758. statCoopAssignProcedure: LONGINT;
  12759. statCoopTraceMethod: LONGINT;
  12760. statCoopResetProcedure: LONGINT;
  12761. statCoopTraceModule: LONGINT;
  12762. PROCEDURE ResetStatistics*;
  12763. BEGIN
  12764. statCoopResetVariables := 0;
  12765. statCoopModifyAssignments := 0;
  12766. statCoopNilCheck:= 0;
  12767. statCoopSwitch:= 0;
  12768. statCoopAssignProcedure:= 0;
  12769. statCoopTraceMethod:= 0;
  12770. statCoopResetProcedure:= 0;
  12771. statCoopTraceModule:= 0;
  12772. END ResetStatistics;
  12773. PROCEDURE Statistics*;
  12774. BEGIN
  12775. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12776. TRACE(statCoopNilCheck, statCoopSwitch);
  12777. TRACE(statCoopAssignProcedure,
  12778. statCoopTraceMethod,
  12779. statCoopResetProcedure,
  12780. statCoopTraceModule)
  12781. END Statistics;
  12782. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12783. VAR h: LONGINT;
  12784. BEGIN
  12785. WHILE b # 0 DO
  12786. h := a MOD b;
  12787. a := b;
  12788. b := h;
  12789. END;
  12790. RETURN a
  12791. END GCD;
  12792. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12793. BEGIN
  12794. RETURN a*b DIV GCD(a,b)
  12795. END SCM;
  12796. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12797. BEGIN
  12798. (*TRACE(a,b);*)
  12799. IF a = 0 THEN RETURN b
  12800. ELSIF b = 0 THEN RETURN a
  12801. ELSE RETURN SCM(a,b)
  12802. END;
  12803. END CommonAlignment;
  12804. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12805. BEGIN
  12806. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12807. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12808. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12809. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12810. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12811. END
  12812. END PassBySingleReference;
  12813. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12814. BEGIN
  12815. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12816. END PassInRegister;
  12817. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12818. VAR new: RegisterEntry;
  12819. BEGIN
  12820. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12821. IF queue = NIL THEN
  12822. queue := new
  12823. ELSE
  12824. new.next := queue;
  12825. IF queue#NIL THEN queue.prev := new END;
  12826. queue := new
  12827. END;
  12828. END AddRegisterEntry;
  12829. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12830. VAR this: RegisterEntry;
  12831. BEGIN
  12832. this := queue;
  12833. WHILE (this # NIL) & (this.register # register) DO
  12834. this := this.next;
  12835. END;
  12836. IF this = NIL THEN
  12837. RETURN FALSE
  12838. END;
  12839. ASSERT(this # NIL);
  12840. IF this = queue THEN queue := queue.next END;
  12841. IF this.prev # NIL THEN this.prev.next := this.next END;
  12842. IF this.next # NIL THEN this.next.prev := this.prev END;
  12843. RETURN TRUE
  12844. END RemoveRegisterEntry;
  12845. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12846. BEGIN ASSERT(cond);
  12847. END Assert;
  12848. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12849. BEGIN
  12850. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12851. END ReusableRegister;
  12852. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12853. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12854. BEGIN
  12855. procedure := moduleScope.bodyProcedure;
  12856. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12857. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12858. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12859. procedure.SetScope(moduleScope);
  12860. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12861. procedure.SetAccess(SyntaxTree.Hidden);
  12862. moduleScope.SetBodyProcedure(procedure);
  12863. moduleScope.AddProcedure(procedure);
  12864. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12865. END;
  12866. END EnsureBodyProcedure;
  12867. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12868. VAR import: SyntaxTree.Import;
  12869. selfName: SyntaxTree.IdentifierString;
  12870. module: SyntaxTree.Module;
  12871. BEGIN
  12872. scope.ownerModule.GetName(selfName);
  12873. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12874. module := scope.ownerModule
  12875. ELSE
  12876. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12877. IF import = NIL THEN
  12878. RETURN NIL
  12879. ELSIF import.module = NIL THEN
  12880. RETURN NIL
  12881. ELSE module := import.module
  12882. END;
  12883. END;
  12884. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12885. END GetSymbol;
  12886. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12887. BEGIN
  12888. op.mode := mode;
  12889. IntermediateCode.InitOperand(op.op);
  12890. IntermediateCode.InitOperand(op.tag);
  12891. IntermediateCode.InitOperand(op.extra);
  12892. op.dimOffset := 0;
  12893. END InitOperand;
  12894. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12895. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12896. BEGIN RETURN IntermediateCode.GetType(system, type)
  12897. END GetType;
  12898. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12899. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12900. BEGIN
  12901. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12902. (*
  12903. UniqueId(name,module,name,adr);
  12904. *)
  12905. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12906. constant.SetValue(value);
  12907. constant.SetAccess(SyntaxTree.Hidden);
  12908. module.moduleScope.AddConstant(constant);
  12909. constant.SetScope(module.moduleScope);
  12910. RETURN constant
  12911. END BuildConstant;
  12912. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12913. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12914. BEGIN
  12915. variable := scope.firstVariable;
  12916. WHILE variable # NIL DO
  12917. IF variable.NeedsTrace() THEN
  12918. RETURN TRUE;
  12919. END;
  12920. variable := variable.nextVariable;
  12921. END;
  12922. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12923. WHILE parameter # NIL DO
  12924. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12925. RETURN TRUE;
  12926. END;
  12927. parameter := parameter.nextParameter;
  12928. END;
  12929. RETURN FALSE;
  12930. END HasPointers;
  12931. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12932. 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));
  12933. END IsVariableParameter;
  12934. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12935. VAR parameter: SyntaxTree.Parameter;
  12936. BEGIN
  12937. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12938. WHILE parameter # NIL DO
  12939. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12940. IF parameter.movable THEN RETURN TRUE END;
  12941. parameter := parameter.nextParameter;
  12942. END;
  12943. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12944. END HasVariableParameters;
  12945. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12946. BEGIN
  12947. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12948. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12949. END HasExplicitTraceMethod;
  12950. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12951. BEGIN
  12952. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12953. IF (expression IS SyntaxTree.IntegerValue) THEN
  12954. val := expression(SyntaxTree.IntegerValue).value;
  12955. RETURN TRUE
  12956. ELSE
  12957. RETURN FALSE
  12958. END;
  12959. END IsIntegerConstant;
  12960. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12961. BEGIN
  12962. IF val <= 0 THEN RETURN FALSE END;
  12963. exp := 0;
  12964. WHILE ~ODD(val) DO
  12965. val := val DIV 2;
  12966. INC(exp)
  12967. END;
  12968. RETURN val = 1
  12969. END PowerOf2;
  12970. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12971. VAR procedure: SyntaxTree.Procedure;
  12972. BEGIN
  12973. procedure := record.recordScope.constructor;
  12974. IF procedure = NIL THEN
  12975. record := record.GetBaseRecord();
  12976. IF record # NIL THEN
  12977. procedure := GetConstructor(record)
  12978. END;
  12979. END;
  12980. RETURN procedure;
  12981. END GetConstructor;
  12982. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12983. BEGIN
  12984. value := SHORT(op.intValue);
  12985. RETURN op.mode = IntermediateCode.ModeImmediate;
  12986. END IsIntegerImmediate;
  12987. (** whether a type strictily is a pointer to record or object type
  12988. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12989. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12990. BEGIN
  12991. IF type = NIL THEN
  12992. RETURN FALSE
  12993. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12994. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12995. ELSE
  12996. RETURN FALSE
  12997. END
  12998. END IsStrictlyPointerToRecord;
  12999. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13000. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13001. END IsUnsafePointer;
  13002. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13003. BEGIN type := type.resolved;
  13004. IF type IS SyntaxTree.PointerType THEN
  13005. type := type(SyntaxTree.PointerType).pointerBase;
  13006. type := type.resolved;
  13007. IF type IS SyntaxTree.RecordType THEN
  13008. recordType := type(SyntaxTree.RecordType);
  13009. RETURN TRUE
  13010. ELSE
  13011. RETURN FALSE
  13012. END
  13013. ELSIF type IS SyntaxTree.RecordType THEN
  13014. recordType := type(SyntaxTree.RecordType);
  13015. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13016. ELSIF type IS SyntaxTree.ObjectType THEN
  13017. RETURN TRUE
  13018. ELSIF type IS SyntaxTree.AnyType THEN
  13019. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13020. ELSE
  13021. RETURN FALSE
  13022. END;
  13023. END IsPointerToRecord;
  13024. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13025. BEGIN
  13026. type := type.resolved;
  13027. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13028. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13029. END IsArrayOfSystemByte;
  13030. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13031. BEGIN
  13032. IF type = NIL THEN RETURN FALSE END;
  13033. type := type.resolved;
  13034. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13035. END IsOpenArray;
  13036. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13037. BEGIN
  13038. IF type = NIL THEN RETURN FALSE END;
  13039. type := type.resolved;
  13040. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13041. END IsSemiDynamicArray;
  13042. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13043. BEGIN
  13044. IF type = NIL THEN RETURN FALSE END;
  13045. type := type.resolved;
  13046. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13047. END IsStaticArray;
  13048. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13049. BEGIN
  13050. IF type = NIL THEN RETURN FALSE END;
  13051. type := type.resolved;
  13052. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13053. END IsStaticMathArray;
  13054. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13055. BEGIN
  13056. WHILE (IsStaticMathArray(type)) DO
  13057. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13058. END;
  13059. RETURN type;
  13060. END StaticMathArrayBaseType;
  13061. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13062. VAR size: LONGINT;
  13063. BEGIN
  13064. size := 1;
  13065. WHILE (IsStaticArray(type)) DO
  13066. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13067. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13068. END;
  13069. RETURN size;
  13070. END StaticArrayNumElements;
  13071. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13072. VAR size: LONGINT;
  13073. BEGIN
  13074. size := 1;
  13075. WHILE (IsStaticMathArray(type)) DO
  13076. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13077. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13078. END;
  13079. RETURN size;
  13080. END StaticMathArrayNumElements;
  13081. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13082. BEGIN
  13083. WHILE (IsStaticArray(type)) DO
  13084. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13085. END;
  13086. RETURN type;
  13087. END StaticArrayBaseType;
  13088. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13089. BEGIN
  13090. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13091. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13092. END;
  13093. RETURN type;
  13094. END ArrayBaseType;
  13095. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13096. BEGIN
  13097. IF type = NIL THEN RETURN FALSE END;
  13098. type := type.resolved;
  13099. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13100. END IsDelegate;
  13101. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13102. VAR i: LONGINT;
  13103. BEGIN
  13104. i := 0; type := type.resolved;
  13105. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13106. INC(i);
  13107. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13108. END;
  13109. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13110. INC(i);
  13111. type := type(SyntaxTree.MathArrayType).arrayBase;
  13112. IF type # NIL THEN type := type.resolved END;
  13113. END;
  13114. RETURN i
  13115. END DynamicDim;
  13116. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13117. BEGIN
  13118. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13119. type := type(SyntaxTree.ArrayType).arrayBase;
  13120. END;
  13121. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13122. type := type(SyntaxTree.MathArrayType).arrayBase;
  13123. END;
  13124. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13125. END StaticSize;
  13126. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13127. BEGIN
  13128. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13129. END IsImmediate;
  13130. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13131. BEGIN
  13132. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13133. END IsAddress;
  13134. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13135. BEGIN
  13136. RETURN (x.mode = IntermediateCode.ModeRegister);
  13137. END IsRegister;
  13138. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13139. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13140. BEGIN
  13141. typeDeclaration := recordType.typeDeclaration;
  13142. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13143. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13144. END GetRecordTypeName;
  13145. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13146. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13147. BEGIN
  13148. parSize := 0;
  13149. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13150. parameter := procedureType.returnParameter;
  13151. INC(parSize,system.SizeOfParameter(parameter));
  13152. parSize := parSize + (-parSize) MOD system.addressSize;
  13153. END;
  13154. parameter :=procedureType.lastParameter;
  13155. WHILE (parameter # NIL) DO
  13156. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13157. INC(parSize, system.addressSize);
  13158. ELSE
  13159. INC(parSize,system.SizeOfParameter(parameter));
  13160. parSize := parSize + (-parSize) MOD system.addressSize;
  13161. END;
  13162. parameter := parameter.prevParameter;
  13163. END;
  13164. IF procedureType.selfParameter # NIL THEN
  13165. parameter := procedureType.selfParameter;
  13166. INC(parSize,system.SizeOfParameter(parameter));
  13167. parSize := parSize + (-parSize) MOD system.addressSize;
  13168. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13169. END; (* method => self pointer *)
  13170. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13171. RETURN ToMemoryUnits(system,parSize)
  13172. END ParametersSize;
  13173. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13174. BEGIN
  13175. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13176. END IsNested;
  13177. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13178. BEGIN
  13179. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13180. scope := scope.outerScope;
  13181. END;
  13182. RETURN scope # NIL;
  13183. END InCellScope;
  13184. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13185. BEGIN
  13186. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13187. END ProcedureParametersSize;
  13188. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13189. VAR dataUnit: LONGINT;
  13190. BEGIN dataUnit := system.dataUnit;
  13191. ASSERT(size MOD system.dataUnit = 0);
  13192. RETURN LONGINT(size DIV system.dataUnit)
  13193. END ToMemoryUnits;
  13194. PROCEDURE Get*(): Backend.Backend;
  13195. VAR backend: IntermediateBackend;
  13196. BEGIN NEW(backend); RETURN backend
  13197. END Get;
  13198. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13199. VAR instruction: IntermediateCode.Instruction;
  13200. BEGIN
  13201. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13202. RETURN instruction
  13203. END Nop;
  13204. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13205. VAR instruction: IntermediateCode.Instruction;
  13206. BEGIN
  13207. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13208. RETURN instruction
  13209. END Mov;
  13210. (* like Mov but ensures that no new register will be allocated for dest *)
  13211. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13212. VAR instruction: IntermediateCode.Instruction;
  13213. BEGIN
  13214. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13215. RETURN instruction
  13216. END MovReplace;
  13217. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13218. VAR instruction: IntermediateCode.Instruction;
  13219. BEGIN
  13220. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13221. RETURN instruction
  13222. END Conv;
  13223. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13224. VAR instruction: IntermediateCode.Instruction;
  13225. BEGIN
  13226. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13227. RETURN instruction
  13228. END Call;
  13229. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13230. VAR op1, op2, op3: IntermediateCode.Operand;
  13231. VAR instruction: IntermediateCode.Instruction;
  13232. BEGIN
  13233. IntermediateCode.InitNumber(op1,pcOffset);
  13234. IntermediateCode.InitNumber(op2,callingConvention);
  13235. IntermediateCode.InitNumber(op3,unwind);
  13236. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13237. RETURN instruction
  13238. END Exit;
  13239. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13240. VAR instruction: IntermediateCode.Instruction;
  13241. BEGIN
  13242. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13243. RETURN instruction
  13244. END Return;
  13245. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13246. VAR instruction: IntermediateCode.Instruction;
  13247. BEGIN
  13248. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13249. RETURN instruction
  13250. END Result;
  13251. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13252. VAR op1: IntermediateCode.Operand;
  13253. VAR instruction: IntermediateCode.Instruction;
  13254. BEGIN
  13255. IntermediateCode.InitNumber(op1,nr);
  13256. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13257. RETURN instruction
  13258. END Trap;
  13259. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13260. VAR instruction: IntermediateCode.Instruction;
  13261. BEGIN
  13262. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13263. RETURN instruction
  13264. END Br;
  13265. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13266. VAR instruction: IntermediateCode.Instruction;
  13267. BEGIN
  13268. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13269. RETURN instruction
  13270. END Breq;
  13271. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13272. VAR instruction: IntermediateCode.Instruction;
  13273. BEGIN
  13274. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13275. RETURN instruction
  13276. END Brne;
  13277. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13278. VAR instruction: IntermediateCode.Instruction;
  13279. BEGIN
  13280. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13281. RETURN instruction
  13282. END Brge;
  13283. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13284. VAR instruction: IntermediateCode.Instruction;
  13285. BEGIN
  13286. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13287. RETURN instruction
  13288. END Brlt;
  13289. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13290. VAR instruction: IntermediateCode.Instruction;
  13291. BEGIN
  13292. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13293. RETURN instruction
  13294. END Pop;
  13295. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13296. VAR instruction: IntermediateCode.Instruction;
  13297. BEGIN
  13298. ASSERT(op.mode # IntermediateCode.Undefined);
  13299. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13300. RETURN instruction
  13301. END Push;
  13302. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13303. VAR instruction: IntermediateCode.Instruction;
  13304. BEGIN
  13305. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13306. RETURN instruction
  13307. END Neg;
  13308. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13309. VAR instruction: IntermediateCode.Instruction;
  13310. BEGIN
  13311. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13312. RETURN instruction
  13313. END Not;
  13314. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13315. VAR instruction: IntermediateCode.Instruction;
  13316. BEGIN
  13317. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13318. RETURN instruction
  13319. END Abs;
  13320. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13321. VAR instruction: IntermediateCode.Instruction;
  13322. BEGIN
  13323. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13324. ASSERT(~IsImmediate(instruction.op1));
  13325. RETURN instruction
  13326. END Mul;
  13327. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13328. VAR instruction: IntermediateCode.Instruction;
  13329. BEGIN
  13330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13331. RETURN instruction
  13332. END Div;
  13333. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13334. VAR instruction: IntermediateCode.Instruction;
  13335. BEGIN
  13336. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13337. RETURN instruction
  13338. END Mod;
  13339. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13340. VAR instruction: IntermediateCode.Instruction;
  13341. BEGIN
  13342. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13343. RETURN instruction
  13344. END Sub;
  13345. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13346. VAR instruction: IntermediateCode.Instruction;
  13347. BEGIN
  13348. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13349. RETURN instruction
  13350. END Add;
  13351. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13352. VAR instruction: IntermediateCode.Instruction;
  13353. BEGIN
  13354. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13355. RETURN instruction
  13356. END And;
  13357. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13358. VAR instruction: IntermediateCode.Instruction;
  13359. BEGIN
  13360. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13361. RETURN instruction
  13362. END Or;
  13363. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13364. VAR instruction: IntermediateCode.Instruction;
  13365. BEGIN
  13366. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13367. RETURN instruction
  13368. END Xor;
  13369. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13370. VAR instruction: IntermediateCode.Instruction;
  13371. BEGIN
  13372. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13373. RETURN instruction
  13374. END Shl;
  13375. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13376. VAR instruction: IntermediateCode.Instruction;
  13377. BEGIN
  13378. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13379. RETURN instruction
  13380. END Shr;
  13381. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13382. VAR instruction: IntermediateCode.Instruction;
  13383. BEGIN
  13384. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13385. RETURN instruction
  13386. END Rol;
  13387. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13388. VAR instruction: IntermediateCode.Instruction;
  13389. BEGIN
  13390. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13391. RETURN instruction
  13392. END Ror;
  13393. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13394. VAR instruction: IntermediateCode.Instruction;
  13395. BEGIN
  13396. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13397. RETURN instruction
  13398. END Cas;
  13399. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13400. VAR instruction: IntermediateCode.Instruction;
  13401. BEGIN
  13402. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13403. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13404. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13405. RETURN instruction
  13406. END Copy;
  13407. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13408. VAR instruction: IntermediateCode.Instruction;
  13409. BEGIN
  13410. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13411. RETURN instruction
  13412. END Fill;
  13413. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13414. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13415. BEGIN
  13416. string := IntermediateCode.String(s);
  13417. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13418. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13419. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13420. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13421. RETURN instruction
  13422. END Asm;
  13423. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13424. VAR instruction: IntermediateCode.Instruction;
  13425. BEGIN
  13426. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13427. RETURN instruction
  13428. END Data;
  13429. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13430. VAR instruction: IntermediateCode.Instruction;
  13431. BEGIN
  13432. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13433. IntermediateCode.SetSubType(instruction, subtype);
  13434. RETURN instruction
  13435. END SpecialInstruction;
  13436. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13437. VAR op1: IntermediateCode.Operand;
  13438. VAR instruction: IntermediateCode.Instruction;
  13439. BEGIN
  13440. (*! generate a warning if size exceeds a certain limit *)
  13441. (*
  13442. ASSERT(bytes < 1000000); (* sanity check *)
  13443. *)
  13444. ASSERT(0 <= units); (* sanity check *)
  13445. IntermediateCode.InitNumber(op1,units);
  13446. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13447. RETURN instruction
  13448. END Reserve;
  13449. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13450. VAR op1: IntermediateCode.Operand;
  13451. VAR instruction: IntermediateCode.Instruction;
  13452. BEGIN
  13453. IntermediateCode.InitNumber(op1,position.start);
  13454. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13455. RETURN instruction
  13456. END LabelInstruction;
  13457. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13458. VAR pc: LONGINT;
  13459. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13460. BEGIN
  13461. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13462. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13463. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13464. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13465. IF instr.op1.type.form = IntermediateCode.Float THEN
  13466. RETURN instr.op1.floatValue = op.floatValue
  13467. ELSE
  13468. RETURN instr.op1.intValue = op.intValue
  13469. END;
  13470. END ProvidesValue;
  13471. BEGIN
  13472. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13473. pc := 0;
  13474. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13475. INC(pc);
  13476. END;
  13477. IF pc = data.pc THEN
  13478. data.Emit(Data(Basic.invalidPosition,vop));
  13479. END;
  13480. RETURN pc
  13481. END EnterImmediate;
  13482. PROCEDURE Init;
  13483. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13484. BEGIN
  13485. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13486. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13487. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13488. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13489. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13490. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13491. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13492. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13493. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13494. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13495. IntermediateCode.InitOperand(emptyOperand);
  13496. FOR i := 0 TO NumberSystemCalls-1 DO
  13497. name := "@SystemCall";
  13498. Basic.AppendNumber(name,i);
  13499. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13500. END;
  13501. END Init;
  13502. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13503. BEGIN
  13504. RETURN (symbol # NIL) & symbol.NeedsSection();
  13505. END IsExported;
  13506. BEGIN
  13507. Init;
  13508. END FoxIntermediateBackend.
  13509. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13510. # Release.Build --path="/temp/obg/" Win32 ~
  13511. # 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 ~
  13512. FStols.CloseFiles A2Z.exe ~
  13513. System.FreeDownTo FoxIntermediateBackend ~
  13514. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13515. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13516. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13517. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13518. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13519. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13520. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13521. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13522. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13523. GenericLinker.Mod Loader.Mod BootConsole.Mod