FoxIntermediateBackend.Mod 582 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686146871468814689146901469114692146931469414695146961469714698146991470014701147021470314704147051470614707147081470914710147111471214713147141471514716147171471814719147201472114722147231472414725147261472714728147291473014731147321473314734147351473614737147381473914740147411474214743147441474514746147471474814749147501475114752147531475414755147561475714758147591476014761147621476314764147651476614767147681476914770147711477214773147741477514776147771477814779147801478114782147831478414785147861478714788147891479014791147921479314794147951479614797147981479914800148011480214803148041480514806148071480814809148101481114812148131481414815148161481714818148191482014821148221482314824148251482614827148281482914830148311483214833148341483514836148371483814839148401484114842148431484414845148461484714848148491485014851148521485314854148551485614857148581485914860148611486214863148641486514866148671486814869148701487114872148731487414875148761487714878148791488014881148821488314884
  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. section.SetExported (TRUE);
  2325. IF dump # NIL THEN dump := section.comments END;
  2326. IF backend.hasLinkRegister THEN
  2327. Emit(Push(Basic.invalidPosition, lr));
  2328. END;
  2329. variable := recordType.recordScope.firstVariable;
  2330. WHILE variable # NIL DO
  2331. IF variable.NeedsTrace() THEN
  2332. dst := NewRegisterOperand (addressType);
  2333. src := NewRegisterOperand (addressType);
  2334. Emit (Mov(position, dst, parameter1));
  2335. Emit (Mov(position, src, parameter2));
  2336. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2337. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2338. CallAssignMethod(dst, src, variable.type);
  2339. ReleaseIntermediateOperand(src);
  2340. ReleaseIntermediateOperand(dst);
  2341. END;
  2342. variable := variable.nextVariable;
  2343. END;
  2344. recordBase := recordType.GetBaseRecord();
  2345. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2346. IF backend.hasLinkRegister THEN
  2347. Emit(Pop(Basic.invalidPosition, lr));
  2348. END;
  2349. GetRecordTypeName (recordBase,name);
  2350. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2351. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2352. Emit(Br(position,op));
  2353. ELSE
  2354. Emit(Exit(position,0,0, 0));
  2355. END;
  2356. IF ~recordType.isObject THEN
  2357. GetRecordTypeName (recordType,name);
  2358. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2359. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2360. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2361. section.SetExported (TRUE);
  2362. NEW(registerUsageCount);
  2363. usedRegisters := NIL;
  2364. dst := NewRegisterOperand (addressType);
  2365. src := NewRegisterOperand (addressType);
  2366. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2367. Emit(Mov(position, dst, parameter1));
  2368. Emit(Mov(position, src, parameter2));
  2369. label := NewLabel();
  2370. SetLabel(label);
  2371. Emit(Push(position, dst));
  2372. Emit(Push(position, src));
  2373. GetRecordTypeName (recordType,name);
  2374. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2375. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2376. Emit(Call(position, op, 0));
  2377. Emit(Pop(position, src));
  2378. Emit(Pop(position, dst));
  2379. Emit(Add(position, dst, dst, ofs));
  2380. Emit(Add(position, src, src, ofs));
  2381. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2382. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2383. Emit(Exit(position,0,0, 0));
  2384. END;
  2385. INC(statCoopAssignProcedure, section.pc);
  2386. ReturnToContext(context);
  2387. IF dump # NIL THEN dump := section.comments END;
  2388. END CreateAssignProcedure;
  2389. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2390. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2391. BEGIN
  2392. IF IsUnsafePointer (type) THEN
  2393. skip := NewLabel();
  2394. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2395. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2396. BreqL (skip, op, nil);
  2397. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2398. SetLabel (skip);
  2399. ELSIF SemanticChecker.IsPointerType (type) THEN
  2400. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2401. CallThis(position,"GarbageCollector","Mark", 1);
  2402. ELSIF type.IsRecordType() THEN
  2403. Emit (Push(position,register));
  2404. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2405. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2406. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2407. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2408. ELSIF IsStaticArray(type) THEN
  2409. size := StaticArrayNumElements(type);
  2410. base := StaticArrayBaseType(type);
  2411. IF base.IsRecordType() THEN
  2412. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2413. Emit (Push(position, register));
  2414. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2415. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2417. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2418. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2419. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2420. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2421. Emit (Push(position, register));
  2422. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2423. ELSE
  2424. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2425. Emit (Push(position, register));
  2426. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2427. ASSERT(base.IsPointer());
  2428. END;
  2429. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2430. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2431. CallThis(position,"GarbageCollector","Mark", 1);
  2432. ELSE HALT(100); (* missing ? *)
  2433. END;
  2434. END CallTraceMethod;
  2435. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2436. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2437. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2438. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2439. BEGIN
  2440. previousSection := section;
  2441. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2442. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2443. GetRecordTypeName (recordType,name);
  2444. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2445. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2446. section.SetExported (TRUE);
  2447. IF dump # NIL THEN dump := section.comments END;
  2448. IF backend.hasLinkRegister THEN
  2449. Emit(Push(Basic.invalidPosition, lr));
  2450. END;
  2451. variable := recordType.recordScope.firstVariable;
  2452. WHILE variable # NIL DO
  2453. IF variable.NeedsTrace() THEN
  2454. register := NewRegisterOperand (addressType);
  2455. Emit (Mov(position,register,parameter1));
  2456. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2457. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2458. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2459. END;
  2460. CallTraceMethod(register, variable.type);
  2461. ReleaseIntermediateOperand(register);
  2462. END;
  2463. variable := variable.nextVariable;
  2464. END;
  2465. recordBase := recordType.GetBaseRecord();
  2466. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2467. recordBase := recordBase.GetBaseRecord();
  2468. END;
  2469. IF recordBase # NIL THEN
  2470. IF backend.hasLinkRegister THEN
  2471. Emit(Pop(Basic.invalidPosition, lr));
  2472. END;
  2473. GetRecordTypeName (recordBase,name);
  2474. IF HasExplicitTraceMethod (recordBase) THEN
  2475. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2476. ELSE
  2477. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2478. END;
  2479. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2480. Emit(Br(position,op));
  2481. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2482. Emit(Exit(position,0,0,0));
  2483. ELSE
  2484. IF backend.hasLinkRegister THEN
  2485. Emit(Pop(Basic.invalidPosition, lr));
  2486. END;
  2487. IF recordType.isObject THEN
  2488. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2489. ELSE
  2490. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2491. END;
  2492. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2493. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2494. Emit(Br(position,op));
  2495. END;
  2496. IF ~recordType.isObject THEN
  2497. GetRecordTypeName (recordType,name);
  2498. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2499. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2500. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2501. section.SetExported (TRUE);
  2502. NEW(registerUsageCount);
  2503. usedRegisters := NIL;
  2504. IF dump # NIL THEN dump := section.comments END;
  2505. register := NewRegisterOperand (addressType);
  2506. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2507. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2508. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2509. END;
  2510. Emit (Push(position,register));
  2511. GetRecordTypeName (recordType,name);
  2512. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2513. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2514. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2515. ReleaseIntermediateOperand(register);
  2516. Emit(Exit(position,0,0,0));
  2517. GetRecordTypeName (recordType,name);
  2518. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2519. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2520. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2521. section.SetExported (TRUE);
  2522. NEW(registerUsageCount);
  2523. usedRegisters := NIL;
  2524. register := NewRegisterOperand (addressType);
  2525. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2526. Emit(Mov(position, register, parameter1));
  2527. label := NewLabel();
  2528. SetLabel(label);
  2529. Emit(Push(position, register));
  2530. GetRecordTypeName (recordType,name);
  2531. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2532. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2533. Emit(Call(position, op, 0));
  2534. Emit(Pop(position, register));
  2535. Emit(Add(position, register, register, ofs));
  2536. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2537. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2538. Emit(Exit(position,0,0,0));
  2539. END;
  2540. INC(statCoopTraceMethod, section.pc);
  2541. ReturnToContext(context);
  2542. IF dump # NIL THEN dump := section.comments END;
  2543. END CreateTraceMethod;
  2544. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2545. VAR name: Basic.SegmentedName;
  2546. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2547. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2548. context: Context;
  2549. BEGIN
  2550. IF recordType.isObject THEN RETURN END;
  2551. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2552. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2553. GetRecordTypeName (recordType,name);
  2554. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2555. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2556. section.SetExported (TRUE);
  2557. IF dump # NIL THEN dump := section.comments END;
  2558. IF backend.hasLinkRegister THEN
  2559. Emit(Push(Basic.invalidPosition, lr));
  2560. END;
  2561. variable := recordType.recordScope.firstVariable;
  2562. WHILE variable # NIL DO
  2563. IF variable.NeedsTrace() THEN
  2564. dst := NewRegisterOperand (addressType);
  2565. Emit (Mov(position, dst, parameter1));
  2566. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2567. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2568. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2569. END;
  2570. CallResetProcedure(dst, nil, variable.type);
  2571. ReleaseIntermediateOperand(dst);
  2572. END;
  2573. variable := variable.nextVariable;
  2574. END;
  2575. recordBase := recordType.GetBaseRecord();
  2576. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2577. IF backend.hasLinkRegister THEN
  2578. Emit(Pop(Basic.invalidPosition, lr));
  2579. END;
  2580. GetRecordTypeName (recordBase,name);
  2581. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2582. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2583. Emit(Br(position,op));
  2584. ELSE
  2585. Emit(Exit(position,0,0, 0));
  2586. END;
  2587. GetRecordTypeName (recordType,name);
  2588. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2589. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2590. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2591. section.SetExported (TRUE);
  2592. NEW(registerUsageCount);
  2593. usedRegisters := NIL;
  2594. dst := NewRegisterOperand (addressType);
  2595. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2596. Emit(Mov(position, dst, parameter1));
  2597. label := NewLabel();
  2598. SetLabel(label);
  2599. Emit(Push(position, dst));
  2600. GetRecordTypeName (recordType,name);
  2601. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2602. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2603. Emit(Call(position, op, 0));
  2604. Emit(Pop(position, dst));
  2605. Emit(Add(position, dst, dst, ofs));
  2606. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2607. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2608. Emit(Exit(position,0,0, 0));
  2609. INC(statCoopResetProcedure, section.pc);
  2610. ReturnToContext(context);
  2611. IF dump # NIL THEN dump := section.comments END;
  2612. END CreateResetProcedure;
  2613. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2614. VAR name: Basic.SegmentedName; context: Context;
  2615. BEGIN
  2616. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2617. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2618. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2619. IF dump # NIL THEN dump := section.comments END;
  2620. IF backend.hasLinkRegister THEN
  2621. Emit(Push(Basic.invalidPosition, lr));
  2622. END;
  2623. Emit(Push(position,fp));
  2624. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2625. ResetVariables(scope);
  2626. Emit(Pop(position,fp));
  2627. Emit(Exit(position,0,0, 0));
  2628. ReturnToContext(context);
  2629. IF dump # NIL THEN dump := section.comments END;
  2630. END CreateResetMethod;
  2631. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2632. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2633. BEGIN
  2634. IF SemanticChecker.IsPointerType (type) THEN
  2635. Emit (Push(position, dest));
  2636. CallThis(position,"GarbageCollector","Reset", 1);
  2637. ELSIF type.IsRecordType() THEN
  2638. Emit (Push(position, dest));
  2639. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2640. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2641. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2642. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2643. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2644. size := GetArrayLength(type, tag);
  2645. base := ArrayBaseType(type);
  2646. IF base.IsRecordType() THEN
  2647. Emit (Push(position, size));
  2648. Emit (Push(position, dest));
  2649. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2650. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2651. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2652. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2653. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2654. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2655. Emit (Push(position, size));
  2656. Emit (Push(position, dest));
  2657. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2658. ELSE
  2659. Emit (Push(position, size));
  2660. Emit (Push(position, dest));
  2661. CallThis(position,"GarbageCollector","ResetArray", 2);
  2662. ASSERT(ArrayBaseType(type).IsPointer());
  2663. END;
  2664. ReleaseIntermediateOperand(size);
  2665. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2666. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2667. Emit (Push(position, dest));
  2668. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2669. ELSE HALT(100); (* missing ? *)
  2670. END;
  2671. END CallResetProcedure;
  2672. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2673. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2674. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2675. VAR operand: Operand;
  2676. BEGIN
  2677. Symbol (symbol, operand);
  2678. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2679. ReleaseOperand(operand);
  2680. END Reset;
  2681. BEGIN
  2682. previousScope := currentScope;
  2683. currentScope := scope;
  2684. pc := section.pc;
  2685. prevOffset := MAX(SIZE);
  2686. variable := scope.firstVariable;
  2687. WHILE variable # NIL DO
  2688. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2689. Reset (variable);
  2690. prevOffset := variable.offsetInBits;
  2691. END;
  2692. variable := variable.nextVariable;
  2693. END;
  2694. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2695. WHILE parameter # NIL DO
  2696. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2697. Reset (parameter);
  2698. END;
  2699. parameter := parameter.nextParameter;
  2700. END;
  2701. INC(statCoopResetVariables, section.pc - pc);
  2702. currentScope := previousScope;
  2703. END ResetVariables;
  2704. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2705. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2706. BEGIN
  2707. type := symbol.type.resolved;
  2708. SaveRegisters();ReleaseUsedRegisters(saved);
  2709. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2710. Symbol(symbol, operand);
  2711. ToMemory(operand.op,addressType,0);
  2712. Emit(Push(position,operand.op));
  2713. IF refer THEN
  2714. CallThis(position,"Heaps","Refer",1);
  2715. ELSE
  2716. CallThis(position,"Heaps","Reset",1);
  2717. END;
  2718. ELSIF type.IsRecordType() THEN
  2719. Symbol(symbol, operand);
  2720. Emit(Push(position,operand.op));
  2721. Emit(Push(position,operand.tag)); (* type desc *)
  2722. IF refer THEN
  2723. CallThis(position,"Heaps","ReferRecord",2);
  2724. ELSE
  2725. CallThis(position,"Heaps","ResetRecord",2);
  2726. END;
  2727. ELSIF IsStaticArray(type) THEN
  2728. size := StaticArrayNumElements(type);
  2729. base := StaticArrayBaseType(type);
  2730. Symbol(symbol, operand);
  2731. arg := TypeDescriptorAdr(base);
  2732. Emit(Push(position,operand.op));
  2733. Emit(Push(position,arg));
  2734. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2735. ReleaseIntermediateOperand(arg);
  2736. IF refer THEN
  2737. CallThis(position,"Heaps","ReferArray",3);
  2738. ELSE
  2739. CallThis(position,"Heaps","ResetArray",3);
  2740. END;
  2741. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2742. size := StaticMathArrayNumElements(type);
  2743. base := StaticMathArrayBaseType(type);
  2744. Symbol(symbol, operand);
  2745. arg := TypeDescriptorAdr(base);
  2746. Emit(Push(position,operand.op));
  2747. Emit(Push(position,arg));
  2748. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2749. ReleaseIntermediateOperand(arg);
  2750. IF refer THEN
  2751. CallThis(position,"Heaps","ReferArray",3);
  2752. ELSE
  2753. CallThis(position,"Heaps","ResetArray",3);
  2754. END;
  2755. ELSIF type IS SyntaxTree.MathArrayType THEN
  2756. Symbol(symbol, operand);
  2757. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2758. Emit (Push(position, operand.op));
  2759. ELSE
  2760. Emit (Push(position, operand.tag));
  2761. END;
  2762. IF refer THEN
  2763. CallThis(position,"Heaps","ReferMathArray", 1);
  2764. ELSE
  2765. CallThis(position,"Heaps","ResetMathArray", 1);
  2766. END;
  2767. ELSIF type IS SyntaxTree.ProcedureType THEN
  2768. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2769. Symbol(symbol, operand);
  2770. Emit (Push(position, operand.tag));
  2771. IF refer THEN
  2772. CallThis(position,"Heaps","Refer", 1);
  2773. ELSE
  2774. CallThis(position,"Heaps","Reset", 1);
  2775. END;
  2776. ELSE HALT(100); (* missing ? *)
  2777. END;
  2778. ReleaseOperand(operand);
  2779. RestoreRegisters(saved);
  2780. END Reset;
  2781. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2782. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2783. BEGIN
  2784. previousScope := currentScope;
  2785. currentScope := scope;
  2786. pc := section.pc;
  2787. IF ~ refer THEN
  2788. variable := scope.firstVariable;
  2789. prevOffset := MAX(SIZE);
  2790. WHILE variable # NIL DO
  2791. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2792. Reset (variable,refer);
  2793. prevOffset := variable.offsetInBits;
  2794. END;
  2795. variable := variable.nextVariable;
  2796. END;
  2797. END;
  2798. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2799. WHILE parameter # NIL DO
  2800. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2801. Reset (parameter,refer);
  2802. END;
  2803. parameter := parameter.nextParameter;
  2804. END;
  2805. INC(statCoopResetVariables, section.pc - pc);
  2806. currentScope := previousScope;
  2807. END ResetVariables2;
  2808. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2809. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2810. VAR op: IntermediateCode.Operand; context: Context;
  2811. BEGIN
  2812. previousSection := section;
  2813. GetCodeSectionNameForSymbol(procedure, name);
  2814. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2815. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2816. IF dump # NIL THEN dump := section.comments END;
  2817. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2818. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2819. Emit(Data(position,op));
  2820. Emit(Data(position,nil));
  2821. IF HasPointers (procedure.procedureScope) THEN
  2822. GetCodeSectionNameForSymbol(procedure, name);
  2823. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2824. ELSE
  2825. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2826. END;
  2827. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2828. Emit(Data(position,op));
  2829. ReturnToContext(context);
  2830. IF dump # NIL THEN dump := section.comments END;
  2831. END CreateProcedureDescriptor;
  2832. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2833. VAR import: SyntaxTree.Import;
  2834. s: Basic.MessageString;
  2835. selfName: SyntaxTree.IdentifierString;
  2836. BEGIN
  2837. moduleScope.ownerModule.GetName(selfName);
  2838. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2839. module := moduleScope.ownerModule
  2840. ELSE
  2841. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2842. IF import = NIL THEN
  2843. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2844. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2845. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2846. s := "Module ";
  2847. Strings.Append(s,moduleName);
  2848. Strings.Append(s," cannot be imported.");
  2849. IF force THEN
  2850. Error(position,s);
  2851. ELSIF canBeLoaded THEN
  2852. IF WarningDynamicLoading THEN
  2853. Strings.Append(s, "=> no dynamic linking.");
  2854. Warning(position, s);
  2855. END;
  2856. canBeLoaded := FALSE;
  2857. END;
  2858. RETURN FALSE
  2859. ELSE
  2860. SELF.module.imports.AddName(moduleName)
  2861. END;
  2862. ELSIF import.module = NIL THEN (* already tried *)
  2863. RETURN FALSE
  2864. END;
  2865. module := import.module;
  2866. END;
  2867. RETURN TRUE
  2868. END AddImport;
  2869. (* needed for old binary object file format*)
  2870. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2871. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2872. BEGIN
  2873. IF AddImport(moduleName,module,TRUE) THEN
  2874. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2875. IF procedure = NIL THEN
  2876. s := "Instruction not supported on target, emulation procedure ";
  2877. Strings.Append(s,moduleName);
  2878. Strings.Append(s,".");
  2879. Strings.Append(s,procedureName);
  2880. Strings.Append(s," not present");
  2881. Error(position,s);
  2882. ELSE
  2883. StaticCallOperand(r,procedure);
  2884. ReleaseOperand(r);
  2885. fp := GetFingerprint(procedure);
  2886. END;
  2887. END;
  2888. END EnsureSymbol;
  2889. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2890. VAR exit: Label; trueL,falseL: Label;
  2891. BEGIN
  2892. trueL := NewLabel();
  2893. falseL := NewLabel();
  2894. exit := NewLabel();
  2895. Condition(x,trueL,falseL);
  2896. InitOperand(result,ModeValue);
  2897. SetLabel(trueL);
  2898. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2899. Emit(Mov(position,result.op,true));
  2900. BrL(exit);
  2901. SetLabel(falseL);
  2902. Emit(MovReplace(position,result.op,false));
  2903. SetLabel(exit);
  2904. END ConditionToValue;
  2905. PROCEDURE ValueToCondition(VAR op: Operand);
  2906. BEGIN
  2907. LoadValue(op,system.booleanType);
  2908. BrneL(trueLabel,op.op, false);
  2909. ReleaseOperand(op);
  2910. BrL(falseLabel);
  2911. END ValueToCondition;
  2912. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2913. VAR size: LONGINT;
  2914. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2915. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2916. BEGIN
  2917. ASSERT(type.form = SyntaxTree.Open);
  2918. baseType := type.arrayBase.resolved;
  2919. IF IsOpenArray(baseType) THEN
  2920. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2921. ELSE
  2922. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2923. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2924. END;
  2925. len := tag;
  2926. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2927. IntermediateCode.MakeMemory(len,addressType);
  2928. UseIntermediateOperand(len);
  2929. Reuse2(res,sizeOperand,len);
  2930. Emit(Mul(position,res,sizeOperand,len));
  2931. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2932. RETURN res
  2933. END GetArraySize;
  2934. BEGIN
  2935. type := type.resolved;
  2936. IF IsOpenArray(type) THEN
  2937. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2938. RETURN tag
  2939. ELSE
  2940. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2941. END;
  2942. ELSE
  2943. size := ToMemoryUnits(system,system.SizeOf(type));
  2944. RETURN IntermediateCode.Immediate(addressType,size)
  2945. END;
  2946. END GetDynamicSize;
  2947. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2948. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2949. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2950. BEGIN
  2951. ASSERT(type.form = SyntaxTree.Open);
  2952. baseType := type.arrayBase.resolved;
  2953. IF IsOpenArray(baseType) THEN
  2954. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2955. ELSE
  2956. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2957. END;
  2958. len := tag;
  2959. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2960. IntermediateCode.MakeMemory(len,addressType);
  2961. UseIntermediateOperand(len);
  2962. Reuse2(res,sizeOperand,len);
  2963. Emit(Mul(position,res,sizeOperand,len));
  2964. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2965. RETURN res
  2966. END GetLength;
  2967. BEGIN
  2968. type := type.resolved;
  2969. IF IsOpenArray(type) THEN
  2970. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2971. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2972. ELSIF type IS SyntaxTree.StringType THEN
  2973. RETURN tag;
  2974. ELSE
  2975. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2976. END;
  2977. END GetArrayLength;
  2978. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2979. VAR result: IntermediateCode.Operand;
  2980. BEGIN
  2981. IF backend.cooperative THEN
  2982. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2983. ELSE
  2984. MakeMemory(result, tag, addressType, 0);
  2985. END;
  2986. RETURN result
  2987. END GetSizeFromTag;
  2988. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2989. VAR parameter: SyntaxTree.Parameter;
  2990. BEGIN
  2991. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2992. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2993. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2994. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2995. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2996. END;
  2997. RETURN GetDynamicSize(e.type, tag);
  2998. END GetArrayOfBytesSize;
  2999. (*
  3000. to find imported symbol. not needed ?
  3001. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3002. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3003. BEGIN
  3004. IF AddImport(moduleName,importedModule,FALSE) THEN
  3005. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3006. RETURN symbol
  3007. ELSE
  3008. RETURN NIL
  3009. END
  3010. END SymbolByName;
  3011. *)
  3012. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3013. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3014. BEGIN
  3015. IF AddImport(moduleName,runtimeModule,force) THEN
  3016. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3017. IF procedure = NIL THEN
  3018. s := "Procedure ";
  3019. Strings.Append(s,moduleName);
  3020. Strings.Append(s,".");
  3021. Strings.Append(s,procedureName);
  3022. Strings.Append(s," not present");
  3023. Error(position,s);
  3024. RETURN FALSE
  3025. ELSE
  3026. RETURN TRUE
  3027. END;
  3028. ELSE RETURN FALSE
  3029. END;
  3030. END GetRuntimeProcedure;
  3031. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3032. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3033. s: Basic.MessageString;
  3034. BEGIN
  3035. Basic.InitSegmentedName(name);
  3036. name[0] := Basic.MakeString(moduleName);
  3037. name[1] := Basic.MakeString(typeName);
  3038. name[2] := -1;
  3039. IF AddImport(moduleName,importedModule, FALSE) THEN
  3040. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3041. IF symbol = NIL THEN
  3042. s := "type ";
  3043. Strings.Append(s,moduleName);
  3044. Strings.Append(s,".");
  3045. Strings.Append(s,typeName);
  3046. Strings.Append(s," not present");
  3047. Error(position,s);
  3048. END;
  3049. ELSE symbol := NIL;
  3050. END;
  3051. IF importedModule = moduleScope.ownerModule THEN
  3052. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3053. ELSE
  3054. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3055. END;
  3056. RETURN symbol
  3057. END GetTypeDescriptor;
  3058. (* 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. *)
  3059. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3060. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3061. pooledName: Basic.SegmentedName; size: LONGINT;
  3062. BEGIN
  3063. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3064. StaticCallOperand(result,procedure);
  3065. IF numberParameters < 0 THEN
  3066. size := ProcParametersSize(procedure);
  3067. ELSE
  3068. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3069. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3070. Error(position,"runtime call parameter count mismatch");
  3071. END;
  3072. END;
  3073. Emit(Call(position, result.op, size));
  3074. ReleaseOperand(result);
  3075. ELSE (* only static linking possible *)
  3076. ASSERT(numberParameters >= 0);
  3077. Basic.InitSegmentedName(pooledName);
  3078. pooledName[0] := Basic.MakeString(moduleName);
  3079. pooledName[1] := Basic.MakeString(procedureName);
  3080. pooledName[2] := -1;
  3081. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3082. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3083. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3084. END;
  3085. END CallThisChecked;
  3086. (* 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. *)
  3087. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3088. BEGIN
  3089. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3090. END CallThis;
  3091. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3092. VAR
  3093. left,right: Operand;
  3094. leftSize, rightSize: IntermediateCode.Operand;
  3095. saved: RegisterEntry;
  3096. reg: IntermediateCode.Operand;
  3097. procedureName: SyntaxTree.IdentifierString;
  3098. BEGIN
  3099. procedureName := "CompareString";
  3100. SaveRegisters();ReleaseUsedRegisters(saved);
  3101. Designate(leftExpression,left);
  3102. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3103. Emit(Push(position,leftSize));
  3104. ReleaseIntermediateOperand(leftSize);
  3105. Emit(Push(position,left.op));
  3106. ReleaseOperand(left);
  3107. Designate(rightExpression,right);
  3108. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3109. Emit(Push(position,rightSize));
  3110. ReleaseIntermediateOperand(rightSize);
  3111. Emit(Push(position,right.op));
  3112. ReleaseOperand(right);
  3113. CallThis(position,builtinsModuleName,procedureName, 4);
  3114. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3115. Emit(Result(position,reg));
  3116. (*
  3117. AcquireThisRegister(int8,IntermediateCode.Result);
  3118. *)
  3119. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3120. (*
  3121. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3122. *)
  3123. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3124. ReleaseIntermediateOperand(reg);
  3125. BrL(falseLabel);
  3126. END CompareString;
  3127. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3128. VAR
  3129. left,right: Operand;
  3130. leftSize, rightSize: IntermediateCode.Operand;
  3131. saved: RegisterEntry;
  3132. procedureName: SyntaxTree.IdentifierString;
  3133. BEGIN
  3134. procedureName := "CopyString";
  3135. SaveRegisters();ReleaseUsedRegisters(saved);
  3136. Designate(leftExpression,left);
  3137. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3138. Emit(Push(position,leftSize));
  3139. ReleaseIntermediateOperand(leftSize);
  3140. Emit(Push(position,left.op));
  3141. ReleaseOperand(left);
  3142. Designate(rightExpression,right);
  3143. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3144. Emit(Push(position,rightSize));
  3145. ReleaseIntermediateOperand(rightSize);
  3146. Emit(Push(position,right.op));
  3147. ReleaseOperand(right);
  3148. CallThis(position,builtinsModuleName,procedureName,4);
  3149. RestoreRegisters(saved);
  3150. END CopyString;
  3151. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3152. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3153. leftType,rightType: SyntaxTree.Type;
  3154. leftExpression,rightExpression : SyntaxTree.Expression;
  3155. componentType: IntermediateCode.Type;
  3156. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3157. size: LONGINT;
  3158. BEGIN
  3159. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3160. dest := destination; destination := emptyOperand;
  3161. leftType := x.left.type.resolved;
  3162. rightType := x.right.type.resolved;
  3163. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3164. CASE x.operator OF
  3165. Scanner.Or:
  3166. (* shortcut evaluation of left OR right *)
  3167. IF ~conditional THEN ConditionToValue(x);
  3168. ELSE
  3169. next := NewLabel();
  3170. Condition(x.left,trueLabel,next);
  3171. SetLabel(next);
  3172. Condition(x.right,trueLabel,falseLabel);
  3173. END;
  3174. |Scanner.And:
  3175. (* shortcut evaluation of left & right *)
  3176. IF ~conditional THEN ConditionToValue(x);
  3177. ELSE
  3178. next := NewLabel();
  3179. Condition(x.left,next,falseLabel);
  3180. SetLabel(next);
  3181. Condition(x.right,trueLabel,falseLabel);
  3182. END;
  3183. |Scanner.Is:
  3184. IF ~conditional THEN ConditionToValue(x);
  3185. ELSE
  3186. (* get type desc tag *)
  3187. IF IsPointerToRecord(leftType,recordType) THEN
  3188. Evaluate(x.left,left);
  3189. Dereference(left,recordType,IsUnsafePointer(leftType))
  3190. ELSE
  3191. Designate(x.left,left);
  3192. END;
  3193. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3194. ReleaseOperand(left);
  3195. END;
  3196. |Scanner.Plus:
  3197. Evaluate(x.left,left);
  3198. Evaluate(x.right,right);
  3199. IF leftType IS SyntaxTree.SetType THEN
  3200. InitOperand(result,ModeValue);
  3201. Reuse2a(result.op,left.op,right.op,dest);
  3202. Emit(Or(position,result.op,left.op,right.op));
  3203. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3204. InitOperand(result,ModeValue);
  3205. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3206. Reuse2(result.tag,left.tag,right.tag);
  3207. Emit(Add(position,result.op,left.op,right.op));
  3208. Emit(Add(position,result.tag,left.tag,right.tag))
  3209. ELSE
  3210. InitOperand(result,ModeValue);
  3211. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3212. AddInt(result.op, left.op, right.op) ;
  3213. ELSE
  3214. *)
  3215. Reuse2a(result.op,left.op,right.op,dest);
  3216. Emit(Add(position,result.op,left.op,right.op));
  3217. (*
  3218. END;
  3219. *)
  3220. END;
  3221. ReleaseOperand(left); ReleaseOperand(right);
  3222. |Scanner.Minus:
  3223. Evaluate(x.left,left);
  3224. Evaluate(x.right,right);
  3225. IF leftType IS SyntaxTree.SetType THEN
  3226. InitOperand(result,ModeValue);
  3227. Reuse1(result.op,right.op);
  3228. Emit(Not(position,result.op,right.op));
  3229. ReleaseOperand(right);
  3230. Emit(And(position,result.op,result.op,left.op));
  3231. ReleaseOperand(left);
  3232. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3233. InitOperand(result,ModeValue);
  3234. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3235. Reuse2(result.tag,left.tag,right.tag);
  3236. Emit(Sub(position,result.op,left.op,right.op));
  3237. Emit(Sub(position,result.tag,left.tag,right.tag));
  3238. ReleaseOperand(left); ReleaseOperand(right)
  3239. ELSE
  3240. InitOperand(result,ModeValue);
  3241. Reuse2a(result.op,left.op,right.op,dest);
  3242. Emit(Sub(position,result.op,left.op,right.op));
  3243. ReleaseOperand(left); ReleaseOperand(right);
  3244. END;
  3245. |Scanner.Times:
  3246. Evaluate(x.left,left);
  3247. Evaluate(x.right,right);
  3248. IF leftType IS SyntaxTree.SetType THEN
  3249. InitOperand(result,ModeValue);
  3250. Reuse2a(result.op,left.op,right.op,dest);
  3251. Emit(And(position,result.op,left.op,right.op));
  3252. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3253. InitOperand(result, ModeValue);
  3254. componentType := left.op.type;
  3255. (* TODO: review this *)
  3256. (*
  3257. result.op = left.op * right.op - left.tag * right.tag
  3258. result.tag = left.tag * right.op + left.op * right.tag
  3259. *)
  3260. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3261. Emit(Mul(position,result.op, left.op, right.op));
  3262. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3263. Emit(Mul(position,tempReg, left.tag, right.tag));
  3264. Emit(Sub(position,result.op, result.op, tempReg));
  3265. Reuse2(result.tag, left.tag, right.op);
  3266. Emit(Mul(position,result.tag, left.tag, right.op));
  3267. Emit(Mul(position,tempReg, left.op, right.tag));
  3268. Emit(Add(position,result.tag, result.tag, tempReg));
  3269. ReleaseIntermediateOperand(tempReg)
  3270. ELSE
  3271. InitOperand(result,ModeValue);
  3272. Reuse2a(result.op,left.op,right.op,dest);
  3273. Emit(Mul(position,result.op,left.op,right.op));
  3274. END;
  3275. ReleaseOperand(left); ReleaseOperand(right);
  3276. |Scanner.Div:
  3277. Evaluate(x.left,left);
  3278. Evaluate(x.right,right);
  3279. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3280. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3281. IF ~isUnchecked THEN
  3282. exit := NewLabel();
  3283. BrltL(exit,zero,right.op);
  3284. EmitTrap(position,NegativeDivisorTrap);
  3285. SetLabel(exit);
  3286. END;
  3287. END;
  3288. InitOperand(result,ModeValue);
  3289. Reuse2a(result.op,left.op,right.op,dest);
  3290. Emit(Div(position,result.op,left.op,right.op));
  3291. ReleaseOperand(left); ReleaseOperand(right);
  3292. |Scanner.Mod:
  3293. Evaluate(x.left,left);
  3294. Evaluate(x.right,right);
  3295. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3296. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3297. IF ~isUnchecked THEN
  3298. exit := NewLabel();
  3299. BrltL(exit,zero,right.op);
  3300. EmitTrap(position,NegativeDivisorTrap);
  3301. SetLabel(exit);
  3302. END;
  3303. END;
  3304. InitOperand(result,ModeValue);
  3305. Reuse2a(result.op,left.op,right.op,dest);
  3306. Emit(Mod(position,result.op,left.op,right.op));
  3307. ReleaseOperand(left); ReleaseOperand(right);
  3308. |Scanner.Slash:
  3309. Evaluate(x.left,left);
  3310. Evaluate(x.right,right);
  3311. IF leftType IS SyntaxTree.SetType THEN
  3312. InitOperand(result,ModeValue);
  3313. Reuse2a(result.op,left.op,right.op,dest);
  3314. Emit(Xor(position,result.op,left.op,right.op));
  3315. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3316. InitOperand(result,ModeValue);
  3317. componentType := left.op.type;
  3318. (* review this *)
  3319. (*
  3320. divisor = right.op * right.op + right.tag * right.tag
  3321. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3322. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3323. *)
  3324. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3325. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3326. Emit(Mul(position,tempReg, right.op, right.op));
  3327. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3328. Emit(Add(position,tempReg, tempReg, tempReg2));
  3329. result.op := tempReg2;
  3330. Emit(Mul(position,result.op, left.op, right.op));
  3331. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3332. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3333. Emit(Add(position,result.op, result.op, tempReg2));
  3334. Emit(Div(position,result.op, result.op, tempReg));
  3335. Reuse2(result.tag, left.tag, right.op);
  3336. Emit(Mul(position,result.tag, left.tag, right.op));
  3337. Emit(Mul(position,tempReg2, left.op, right.tag));
  3338. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3339. Emit(Div(position,result.tag, result.tag, tempReg));
  3340. ReleaseIntermediateOperand(tempReg);
  3341. ReleaseIntermediateOperand(tempReg2)
  3342. ELSE
  3343. InitOperand(result,ModeValue);
  3344. Reuse2a(result.op,left.op,right.op,dest);
  3345. Emit(Div(position,result.op,left.op,right.op));
  3346. END;
  3347. ReleaseOperand(left); ReleaseOperand(right);
  3348. |Scanner.Equal:
  3349. IF ~conditional THEN ConditionToValue(x);
  3350. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3351. CompareString(BreqL,x.left,x.right);
  3352. ELSE
  3353. Evaluate(x.left,left);
  3354. Evaluate(x.right,right);
  3355. IF leftType IS SyntaxTree.RangeType THEN
  3356. ASSERT(rightType IS SyntaxTree.RangeType);
  3357. BrneL(falseLabel, left.op, right.op); (* first *)
  3358. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3359. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3360. ReleaseOperand(left); ReleaseOperand(right);
  3361. BrL(trueLabel)
  3362. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3363. BrneL(falseLabel, left.op, right.op); (* first *)
  3364. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3365. ReleaseOperand(left); ReleaseOperand(right);
  3366. BrL(trueLabel)
  3367. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3368. (* TODO: review this *)
  3369. BrneL(falseLabel, left.op, right.op); (* real part *)
  3370. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3371. ReleaseOperand(left); ReleaseOperand(right);
  3372. BrL(trueLabel)
  3373. ELSE
  3374. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3375. ReleaseOperand(left); ReleaseOperand(right);
  3376. BrL(trueLabel);
  3377. END;
  3378. END;
  3379. |Scanner.LessEqual:
  3380. IF ~conditional THEN ConditionToValue(x);
  3381. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3382. CompareString(BrgeL,x.right,x.left);
  3383. ELSE
  3384. Evaluate(x.left,left);
  3385. Evaluate(x.right,right);
  3386. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3387. Reuse1(temp.op,right.op);
  3388. Emit(And(position,temp.op,left.op,right.op));
  3389. ReleaseOperand(right);
  3390. BreqL(trueLabel,temp.op,left.op);
  3391. BrL(falseLabel);
  3392. ReleaseOperand(temp);ReleaseOperand(left);
  3393. ELSE
  3394. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3395. ReleaseOperand(left); ReleaseOperand(right);
  3396. BrL(trueLabel);
  3397. END;
  3398. END;
  3399. |Scanner.Less:
  3400. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3401. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3402. leftExpression.SetType(system.booleanType);
  3403. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3404. rightExpression.SetType(system.booleanType);
  3405. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3406. leftExpression.SetType(system.booleanType);
  3407. Expression(leftExpression);
  3408. ELSIF ~conditional THEN ConditionToValue(x);
  3409. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3410. CompareString(BrltL,x.left,x.right);
  3411. ELSE
  3412. Evaluate(x.left,left);
  3413. Evaluate(x.right,right);
  3414. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3415. ReleaseOperand(left); ReleaseOperand(right);
  3416. BrL(trueLabel);
  3417. END;
  3418. |Scanner.Greater:
  3419. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3420. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3421. leftExpression.SetType(system.booleanType);
  3422. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3423. rightExpression.SetType(system.booleanType);
  3424. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3425. leftExpression.SetType(system.booleanType);
  3426. Expression(leftExpression);
  3427. ELSIF ~conditional THEN ConditionToValue(x);
  3428. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3429. CompareString(BrltL,x.right,x.left);
  3430. ELSE
  3431. Evaluate(x.left,left);
  3432. Evaluate(x.right,right);
  3433. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3434. ReleaseOperand(left); ReleaseOperand(right);
  3435. BrL(trueLabel);
  3436. END;
  3437. |Scanner.GreaterEqual:
  3438. IF ~conditional THEN ConditionToValue(x);
  3439. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3440. CompareString(BrgeL,x.left,x.right);
  3441. ELSE
  3442. Evaluate(x.left,left);
  3443. Evaluate(x.right,right);
  3444. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3445. Reuse1(temp.op,left.op);
  3446. Emit(And(position,temp.op,left.op,right.op));
  3447. ReleaseOperand(left);
  3448. BreqL(trueLabel, temp.op,right.op);
  3449. ReleaseOperand(temp); ReleaseOperand(right);
  3450. BrL(falseLabel);
  3451. ELSE
  3452. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3453. ReleaseOperand(left); ReleaseOperand(right);
  3454. BrL(trueLabel);
  3455. END;
  3456. END;
  3457. |Scanner.Unequal:
  3458. IF ~conditional THEN ConditionToValue(x);
  3459. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3460. CompareString(BrneL,x.left,x.right);
  3461. ELSE
  3462. Evaluate(x.left,left);
  3463. Evaluate(x.right,right);
  3464. IF leftType IS SyntaxTree.RangeType THEN
  3465. ASSERT(rightType IS SyntaxTree.RangeType);
  3466. BrneL(trueLabel, left.op, right.op); (* first *)
  3467. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3468. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3469. ReleaseOperand(left); ReleaseOperand(right);
  3470. BrL(falseLabel)
  3471. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3472. BrneL(trueLabel, left.op, right.op); (* first *)
  3473. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3474. ReleaseOperand(left); ReleaseOperand(right);
  3475. BrL(falseLabel)
  3476. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3477. (* TODO: review this *)
  3478. BrneL(trueLabel, left.op, right.op); (* real part *)
  3479. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3480. ReleaseOperand(left); ReleaseOperand(right);
  3481. BrL(falseLabel)
  3482. ELSE
  3483. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3484. ReleaseOperand(left); ReleaseOperand(right);
  3485. BrL(trueLabel);
  3486. END;
  3487. END;
  3488. |Scanner.In:
  3489. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3490. Evaluate(x.left,left);
  3491. Evaluate(x.right,right);
  3492. Convert(left.op,setType);
  3493. Convert(right.op,setType);
  3494. ReuseCopy(temp.op,right.op);
  3495. Emit(Shr(position,temp.op,temp.op,left.op));
  3496. ReleaseOperand(right); ReleaseOperand(left);
  3497. IntermediateCode.InitImmediate(one,setType,1);
  3498. Emit(And(position,temp.op,temp.op,one));
  3499. IF conditional THEN
  3500. IntermediateCode.InitImmediate(zero,setType,0);
  3501. BrneL(trueLabel,temp.op,zero);
  3502. ReleaseOperand(temp);
  3503. BrL(falseLabel);
  3504. ELSE
  3505. Convert(temp.op,bool);
  3506. result.mode := ModeValue;
  3507. result.op := temp.op;
  3508. result.tag := nil; (* may be left over from calls to evaluate *)
  3509. END;
  3510. ELSE
  3511. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3512. IF x.operator = Scanner.Questionmarks THEN
  3513. leftExpression := x.left;
  3514. rightExpression := x.right;
  3515. ELSE
  3516. leftExpression := x.right;
  3517. rightExpression := x.left;
  3518. END;
  3519. Evaluate(leftExpression, left);
  3520. Emit(Push(position,left.op));
  3521. ReleaseOperand(left);
  3522. Designate(rightExpression, right);
  3523. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3524. IF ~backend.cellsAreObjects THEN
  3525. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3526. END;
  3527. Emit(Push(position,right.op));
  3528. ReleaseOperand(right);
  3529. IF backend.cellsAreObjects THEN
  3530. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3531. ELSE
  3532. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3533. END;
  3534. InitOperand(result, ModeValue);
  3535. result.op := NewRegisterOperand(bool);
  3536. Emit(Result(position,result.op));
  3537. IF conditional THEN
  3538. IntermediateCode.InitImmediate(zero,setType,0);
  3539. BrneL(trueLabel,result.op,zero);
  3540. ReleaseOperand(result);
  3541. BrL(falseLabel);
  3542. END;
  3543. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3544. leftExpression := x.left;
  3545. rightExpression := x.right;
  3546. Evaluate(leftExpression, left);
  3547. Emit(Push(position,left.op));
  3548. ReleaseOperand(left);
  3549. Evaluate(rightExpression, right);
  3550. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3551. IF ~backend.cellsAreObjects THEN
  3552. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3553. END;
  3554. Emit(Push(position,right.op));
  3555. ReleaseOperand(right);
  3556. IF backend.cellsAreObjects THEN
  3557. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3558. ELSE
  3559. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3560. END;
  3561. InitOperand(result, ModeValue);
  3562. result.op := NewRegisterOperand(bool);
  3563. Emit(Result(position,result.op));
  3564. IF conditional THEN
  3565. IntermediateCode.InitImmediate(zero,setType,0);
  3566. BrneL(trueLabel,result.op,zero);
  3567. ReleaseOperand(result);
  3568. BrL(falseLabel);
  3569. END;
  3570. ELSE
  3571. HALT(100);
  3572. END;
  3573. END;
  3574. destination := dest;
  3575. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3576. END VisitBinaryExpression;
  3577. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3578. VAR localResult, operand: Operand;
  3579. BEGIN
  3580. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3581. InitOperand(localResult, ModeValue);
  3582. ASSERT(x.first # NIL);
  3583. Evaluate(x.first, operand);
  3584. localResult.op := operand.op;
  3585. ReleaseOperand(operand);
  3586. UseIntermediateOperand(localResult.op);
  3587. ASSERT(x.last # NIL);
  3588. Evaluate(x.last, operand);
  3589. localResult.tag := operand.op;
  3590. ReleaseOperand(operand);
  3591. UseIntermediateOperand(localResult.tag);
  3592. IF x.step # NIL THEN
  3593. Evaluate(x.step, operand);
  3594. localResult.extra := operand.op;
  3595. ReleaseOperand(operand);
  3596. UseIntermediateOperand(localResult.extra);
  3597. END;
  3598. result := localResult;
  3599. IF Trace THEN TraceExit("VisitRangeExpression") END
  3600. END VisitRangeExpression;
  3601. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3602. BEGIN
  3603. HALT(100); (* should never be evaluated *)
  3604. END VisitTensorRangeExpression;
  3605. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3606. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3607. BEGIN
  3608. IF Trace THEN TraceEnter("VisitConversion") END;
  3609. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3610. dest := destination; destination := emptyOperand;
  3611. Evaluate(x.expression,old);
  3612. InitOperand(result,ModeValue);
  3613. result.op := old.op;
  3614. ASSERT(result.op.mode # 0);
  3615. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3616. (* convert TO a complex number *)
  3617. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3618. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3619. ASSERT(result.op.mode # 0);
  3620. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3621. (* convert FROM a complex number TO a complex number*)
  3622. result.tag := old.tag;
  3623. ASSERT(result.tag.mode # 0);
  3624. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3625. ASSERT(result.tag.mode # 0)
  3626. ELSE
  3627. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3628. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3629. END
  3630. ELSE
  3631. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3632. ASSERT(result.op.mode # 0);
  3633. result.tag := old.tag; (*! probably never used *)
  3634. END;
  3635. destination := dest;
  3636. IF Trace THEN TraceExit("VisitConversion") END;
  3637. END VisitConversion;
  3638. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3639. BEGIN
  3640. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3641. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3642. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3643. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3644. END VisitTypeDeclaration;
  3645. (** designators (expressions) *)
  3646. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3647. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3648. BEGIN
  3649. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3650. IF x.left # NIL THEN Expression(x.left) END;
  3651. Symbol(x.symbol,result);
  3652. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3653. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3654. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3655. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3656. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3657. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3658. END;
  3659. END;
  3660. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3661. END VisitSymbolDesignator;
  3662. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3663. BEGIN
  3664. IF isUnchecked THEN RETURN END;
  3665. IF tagsAvailable THEN
  3666. TrapC(BrltL,index,length,IndexCheckTrap);
  3667. END;
  3668. END BoundCheck;
  3669. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3670. VAR d: IntermediateCode.Operand;
  3671. BEGIN
  3672. IF isUnchecked THEN RETURN END;
  3673. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3674. TrapC(op,dim,d,ArraySizeTrap);
  3675. ReleaseIntermediateOperand(d);
  3676. END DimensionCheck;
  3677. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3678. VAR
  3679. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3680. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3681. expression: SyntaxTree.Expression;
  3682. resultingType, leftType, baseType: SyntaxTree.Type;
  3683. skipLabel1: Label;
  3684. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3685. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3686. variableOp: Operand;
  3687. variable: SyntaxTree.Variable;
  3688. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3689. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3690. VAR e: SyntaxTree.Expression; i: LONGINT;
  3691. BEGIN
  3692. tensorFound := FALSE;
  3693. FOR i := 0 TO parameters.Length()-1 DO
  3694. e := parameters.GetExpression(i);
  3695. IF e IS SyntaxTree.TensorRangeExpression THEN
  3696. ASSERT(~tensorFound);
  3697. tensorFound := TRUE;
  3698. ELSIF e IS SyntaxTree.RangeExpression THEN
  3699. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3700. ELSE
  3701. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3702. END;
  3703. END;
  3704. END CountIndices;
  3705. BEGIN
  3706. ASSERT(tagsAvailable);
  3707. resultingType := x.type.resolved; (* resulting type *)
  3708. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3709. InitOperand(localResult, ModeReference);
  3710. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3711. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3712. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3713. (* a globally defined array destination tag is available -> use and invalidate it*)
  3714. localResult.tag := arrayDestinationTag;
  3715. IntermediateCode.InitOperand(arrayDestinationTag)
  3716. ELSE
  3717. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3718. (* the result is of array range type and thus does not provide any collectable pointers *)
  3719. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3720. Symbol(variable, variableOp);
  3721. ReuseCopy(localResult.tag, variableOp.op);
  3722. ReleaseOperand(variableOp);
  3723. END
  3724. END;
  3725. indexListSize := x.parameters.Length();
  3726. CountIndices(x.parameters);
  3727. (*ASSERT(tensorRangeCount <= 1);*)
  3728. (* designate the array to be indexed over, perform tensor range check if known *)
  3729. Designate(x.left, array);
  3730. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3731. Dereference(array, leftType,FALSE);
  3732. IF ~tensorFound THEN
  3733. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3734. END
  3735. END;
  3736. (* default base offset *)
  3737. srcDimOffset := 0;
  3738. destDimOffset := 0;
  3739. indexDim := 0;
  3740. (* use address of source array as basis *)
  3741. localResult.op := array.op;
  3742. UseIntermediateOperand(localResult.op);
  3743. (* go through the index list *)
  3744. FOR i := 0 TO indexListSize - 1 DO
  3745. expression := x.parameters.GetExpression(i);
  3746. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3747. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3748. srcDimOffset := -indexListSize;
  3749. destDimOffset := -suffixRanges;
  3750. ELSE
  3751. (* determine which dimension of source array is currently looked at *)
  3752. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3753. (* get the memory operand pointing to array descriptor dimension *)
  3754. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3755. (* make a reusable register from it *)
  3756. ReuseCopy(srcDim, tmp);
  3757. ReleaseIntermediateOperand(tmp);
  3758. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3759. ELSE
  3760. srcDim := IntermediateCode.Immediate(sizeType, i);
  3761. END;
  3762. (* get length and increment of source array for current dimension *)
  3763. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3764. Convert(sourceLength.op, sizeType);
  3765. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3766. Convert(sourceIncrement.op, sizeType);
  3767. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3768. ReleaseIntermediateOperand(srcDim);
  3769. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3770. (* SINGLE INDEX *)
  3771. Evaluate(expression, index);
  3772. ReleaseIntermediateOperand(index.tag);
  3773. index.tag := emptyOperand;
  3774. Convert(index.op, sizeType);
  3775. (* lower bound check *)
  3776. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3777. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3778. ELSIF isUnchecked THEN (* do nothing *)
  3779. ELSE
  3780. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3781. END;
  3782. (* upper bound check *)
  3783. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3784. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3785. ELSIF isUnchecked THEN (* do nothing *)
  3786. ELSE
  3787. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3788. END;
  3789. ReleaseOperand(sourceLength);
  3790. Convert(index.op, addressType);
  3791. summand := index.op;
  3792. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3793. (* RANGE OF INDICES *)
  3794. Evaluate(expression, range);
  3795. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3796. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3797. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3798. ReleaseOperand(range);
  3799. Convert(firstIndex, sizeType);
  3800. Convert(lastIndex, sizeType);
  3801. Convert(stepSize, sizeType);
  3802. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3803. if it is 'MAX(LONGINT)' *)
  3804. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3805. TransferToRegister(lastIndex, lastIndex);
  3806. skipLabel1 := NewLabel();
  3807. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3808. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3809. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3810. SetLabel(skipLabel1)
  3811. END;
  3812. (* check if step size is valid *)
  3813. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3814. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3815. ELSIF isUnchecked THEN (* do nothing *)
  3816. ELSE
  3817. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3818. END;
  3819. (* check lower bound check *)
  3820. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3821. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3822. ELSIF isUnchecked THEN (* do nothing *)
  3823. ELSE
  3824. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3825. END;
  3826. (* check upper bound check *)
  3827. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3828. (* statically open range: nothing to do *)
  3829. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3830. ASSERT(staticLastIndex < staticSourceLength)
  3831. ELSIF isUnchecked THEN (* do nothing *)
  3832. ELSE
  3833. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3834. END;
  3835. (* determine length of target array for current dimension *)
  3836. (* 1. incorporate last index: *)
  3837. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3838. (* last index is static *)
  3839. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3840. targetLength := sourceLength.op
  3841. ELSE
  3842. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3843. END;
  3844. UseIntermediateOperand(targetLength);
  3845. ELSE
  3846. (* targetLength := lastIndex + 1
  3847. Reuse1(targetLength, lastIndex);
  3848. *)
  3849. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3850. END;
  3851. ReleaseOperand(sourceLength);
  3852. ReleaseIntermediateOperand(lastIndex);
  3853. (* 2. incorporate first index: *)
  3854. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3855. (* first index and current target length are static *)
  3856. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3857. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3858. (* first index = 0: nothing to do *)
  3859. ELSE
  3860. (* targetLength := targetLength - firstIndex *)
  3861. TransferToRegister(targetLength, targetLength);
  3862. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3863. END;
  3864. (* clip negative lengths to 0 *)
  3865. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3866. IF staticTargetLength < 0 THEN
  3867. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3868. END
  3869. ELSE
  3870. skipLabel1 := NewLabel();
  3871. TransferToRegister(targetLength, targetLength);
  3872. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3873. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3874. SetLabel(skipLabel1)
  3875. END;
  3876. (* 3. incorporate index step size: *)
  3877. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3878. (*step size and current target length are static *)
  3879. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3880. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3881. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3882. (* step size = 1: nothing to do *)
  3883. ELSE
  3884. (* emit code for this:
  3885. targetLength := (targetLength-1) DIV stepSize +1;
  3886. *)
  3887. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3888. DivInt(targetLength, targetLength, stepSize);
  3889. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3890. END;
  3891. (* determine increment of target array for current dimension *)
  3892. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3893. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3894. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3895. (* step size = 1 *)
  3896. targetIncrement := sourceIncrement.op;
  3897. UseIntermediateOperand(targetIncrement)
  3898. ELSE
  3899. (* targetIncrement := sourceIncrement * stepSize *)
  3900. Reuse1(targetIncrement, stepSize);
  3901. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3902. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3903. END;
  3904. ReleaseIntermediateOperand(stepSize);
  3905. (* write length and increment of target array to descriptor *)
  3906. IF destDimOffset < 0 THEN
  3907. (* determine which dimension of target array is currently looked at *)
  3908. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3909. TransferToRegister(destDim, tmp);
  3910. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3911. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3912. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3913. ReleaseIntermediateOperand(destDim);
  3914. INC(destDimOffset);
  3915. ELSE
  3916. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3917. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3918. END;
  3919. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3920. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3921. INC(indexDim);
  3922. Convert(firstIndex, addressType);
  3923. TransferToRegister(summand, firstIndex);
  3924. ELSE HALT(100);
  3925. END;
  3926. (*
  3927. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3928. *)
  3929. Convert(sourceIncrement.op, addressType);
  3930. Convert(summand, addressType);
  3931. MulInt(summand, summand, sourceIncrement.op);
  3932. ReleaseIntermediateOperand(sourceIncrement.op);
  3933. AddInt(localResult.op, localResult.op, summand);
  3934. ReleaseIntermediateOperand(summand);
  3935. END
  3936. END;
  3937. result := localResult;
  3938. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3939. ReleaseIntermediateOperand(result.tag);
  3940. result.tag := TypeDescriptorAdr(resultingType);
  3941. ELSIF IsDelegate(resultingType) THEN
  3942. ReleaseIntermediateOperand(result.tag);
  3943. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3944. UseIntermediateOperand(result.tag);
  3945. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3946. ReleaseIntermediateOperand(result.tag);
  3947. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3948. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3949. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3950. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3951. (* finalize target array descriptor *)
  3952. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3953. (* write lengths and increments of target array for remaining dimensions *)
  3954. i := indexListSize;
  3955. WHILE indexDim < targetArrayDimensionality DO
  3956. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3957. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3958. ReleaseOperand(sourceLength);
  3959. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3960. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3961. ReleaseOperand(sourceIncrement);
  3962. INC(i); INC(indexDim);
  3963. END;
  3964. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3965. tmp := nil;
  3966. ELSE
  3967. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3968. END;
  3969. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3970. ReleaseIntermediateOperand(tmp);
  3971. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3972. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3973. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3974. ELSE
  3975. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3976. END;
  3977. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3978. ReleaseIntermediateOperand(tmp);
  3979. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3980. (* write dimensionality *)
  3981. IF targetArrayDimensionality # 0 THEN
  3982. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3983. END;
  3984. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3985. END;
  3986. ReleaseOperand(array);
  3987. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3988. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3989. END;
  3990. END MathIndexDesignator;
  3991. (* get the length of an array , trying to make use of static information *)
  3992. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3993. VAR res: IntermediateCode.Operand; size: LONGINT;
  3994. BEGIN
  3995. type := type.resolved;
  3996. IF type IS SyntaxTree.ArrayType THEN
  3997. WITH type: SyntaxTree.ArrayType DO
  3998. IF type.form = SyntaxTree.Static THEN
  3999. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4000. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4001. Evaluate(type.length, op);
  4002. ReleaseIntermediateOperand(op.tag);
  4003. RETURN op.op;*)
  4004. ELSE
  4005. res := tag;
  4006. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4007. IntermediateCode.MakeMemory(res,addressType);
  4008. UseIntermediateOperand(res);
  4009. RETURN res
  4010. END
  4011. END;
  4012. ELSE
  4013. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4014. RETURN IntermediateCode.Immediate(addressType,size);
  4015. END;
  4016. END ArrayLength;
  4017. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4018. BEGIN
  4019. IF IsImmediate(x) THEN
  4020. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4021. ELSE
  4022. IF ~ReusableRegister(res) THEN
  4023. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4024. ELSE
  4025. UseIntermediateOperand(res);
  4026. END;
  4027. Emit(Mov(position,res,x))
  4028. END;
  4029. END CopyInt;
  4030. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4031. BEGIN
  4032. ReleaseIntermediateOperand(res);
  4033. IF IsImmediate(x) & IsImmediate(y) THEN
  4034. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4035. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4036. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4037. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4038. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4039. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4040. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4041. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4042. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4043. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4044. UseIntermediateOperand(res);
  4045. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4046. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4047. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4048. UseIntermediateOperand(res);
  4049. ELSE
  4050. IF ~ReusableRegister(res) THEN
  4051. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4052. ELSE
  4053. UseIntermediateOperand(res);
  4054. END;
  4055. IF IsImmediate(x) & (x.intValue = 0) THEN
  4056. Emit(Mov(position,res,y))
  4057. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4058. Emit(Mov(position,res,x))
  4059. ELSE
  4060. Emit(Add(position,res, x, y));
  4061. END;
  4062. END;
  4063. END AddInt;
  4064. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4065. BEGIN
  4066. ReleaseIntermediateOperand(res);
  4067. IF IsImmediate(x) & IsImmediate(y) THEN
  4068. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4069. ELSE
  4070. IF ~ReusableRegister(res) THEN
  4071. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4072. ELSE UseIntermediateOperand(res);
  4073. END;
  4074. IF IsImmediate(x) & (x.intValue = 1) THEN
  4075. Emit(Mov(position,res,y))
  4076. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4077. Emit(Mov(position,res,x))
  4078. ELSE
  4079. Emit(Mul(position,res, x, y));
  4080. END;
  4081. END;
  4082. END MulInt;
  4083. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4084. BEGIN
  4085. ReleaseIntermediateOperand(res);
  4086. IF IsImmediate(x) & IsImmediate(y) THEN
  4087. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4088. ELSE
  4089. IF ~ReusableRegister(res) THEN
  4090. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4091. ELSE UseIntermediateOperand(res);
  4092. END;
  4093. IF IsImmediate(x) & (x.intValue = 1) THEN
  4094. Emit(Mov(position,res,y))
  4095. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4096. Emit(Mov(position,res,x))
  4097. ELSE
  4098. Emit(Div(position,res, x, y));
  4099. END;
  4100. END;
  4101. END DivInt;
  4102. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4103. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4104. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4105. BEGIN
  4106. type := x.left.type.resolved;
  4107. IF type IS SyntaxTree.StringType THEN
  4108. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4109. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4110. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4111. type := atype;
  4112. x.left.SetType(type);
  4113. END;
  4114. IntermediateCode.InitImmediate(res,addressType,0);
  4115. maxDim := x.parameters.Length()-1;
  4116. (*
  4117. computation rule:
  4118. a: ARRAY X,Y,Z OF Element with size S
  4119. a[i,j,k] -->
  4120. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4121. *)
  4122. FOR i := 0 TO maxDim DO
  4123. e := x.parameters.GetExpression(i);
  4124. Evaluate(e,index);
  4125. Convert(index.op,addressType);
  4126. AddInt(res, res, index.op);
  4127. IF i = 0 THEN
  4128. (*
  4129. ReuseCopy(res, index.op);
  4130. *)
  4131. Designate(x.left,array);
  4132. type := x.left.type.resolved;
  4133. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4134. Dereference(array, type, FALSE);
  4135. END;
  4136. (*
  4137. ELSE AddInt(res, res, index.op);
  4138. *)
  4139. END;
  4140. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4141. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4142. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4143. BoundCheck(index.op, length);
  4144. END;
  4145. ReleaseIntermediateOperand(length);
  4146. END;
  4147. ReleaseOperand(index);
  4148. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4149. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4150. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4151. MulInt(res,res,length);
  4152. END;
  4153. ReleaseIntermediateOperand(length);
  4154. END;
  4155. (* remaining open dimensions -- compute address *)
  4156. i := maxDim+1;
  4157. IF type IS SyntaxTree.ArrayType THEN
  4158. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4159. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4160. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4161. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4162. MulInt(res,res,length);
  4163. END;
  4164. ReleaseIntermediateOperand(length);
  4165. INC(i);
  4166. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4167. END;
  4168. END;
  4169. IF (type IS SyntaxTree.ArrayType) THEN
  4170. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4171. size := StaticSize(system, type);
  4172. IF size # 1 THEN
  4173. length := IntermediateCode.Immediate(addressType,size);
  4174. MulInt(res,res,length);
  4175. END;
  4176. ELSE
  4177. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4178. IF size # 1 THEN
  4179. length := IntermediateCode.Immediate(addressType,size);
  4180. MulInt(res,res,length);
  4181. END;
  4182. END;
  4183. END;
  4184. AddInt(res,res,array.op);
  4185. InitOperand(result,ModeReference);
  4186. result.op := res;
  4187. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4188. ReleaseIntermediateOperand(result.tag);
  4189. result.tag := TypeDescriptorAdr(type);
  4190. ELSIF IsDelegate(type) THEN
  4191. ReleaseIntermediateOperand(result.tag);
  4192. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4193. UseIntermediateOperand(result.tag);
  4194. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4195. ReleaseIntermediateOperand(result.tag);
  4196. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4197. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4198. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4199. END;
  4200. ReleaseOperand(array);
  4201. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4202. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4203. END;
  4204. END IndexDesignator;
  4205. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4206. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4207. BEGIN
  4208. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4209. dest := destination; destination := emptyOperand;
  4210. type := x.left.type.resolved;
  4211. IF type IS SyntaxTree.MathArrayType THEN
  4212. MathIndexDesignator(x);
  4213. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4214. IndexDesignator(x);
  4215. END;
  4216. destination := dest;
  4217. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4218. END VisitIndexDesignator;
  4219. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4220. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4221. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4222. procedure: SyntaxTree.Procedure;
  4223. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4224. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4225. BEGIN
  4226. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4227. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4228. parameters := expression.parameters;
  4229. moduleName := "FoxArrayBase";
  4230. procedureName := "CopyDescriptor";
  4231. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4232. SaveRegisters();ReleaseUsedRegisters(saved);
  4233. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4234. IF procedure = NIL THEN
  4235. s := "procedure ";
  4236. Strings.Append(s,moduleName);
  4237. Strings.Append(s,".");
  4238. Strings.Append(s,procedureName);
  4239. Strings.Append(s," not present");
  4240. Error(position,s);
  4241. ELSE
  4242. (* push address of temporary variable *)
  4243. Symbol(variable,destOperand);
  4244. Emit(Push(position,destOperand.op));
  4245. ReleaseOperand(destOperand);
  4246. (* push src *)
  4247. Evaluate(expression.left,srcOperand);
  4248. (*
  4249. Dereference(srcOperand,expression.type.resolved);
  4250. Emit(Push(position,srcOperand.tag));
  4251. *)
  4252. Emit(Push(position,srcOperand.op));
  4253. ReleaseOperand(srcOperand);
  4254. tensorFound := FALSE;
  4255. FOR i := 0 TO parameters.Length()-1 DO
  4256. e := parameters.GetExpression(i);
  4257. IF e IS SyntaxTree.TensorRangeExpression THEN
  4258. tensorFound := TRUE;
  4259. ELSIF e IS SyntaxTree.RangeExpression THEN
  4260. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4261. ELSE
  4262. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4263. END;
  4264. END;
  4265. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4266. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4267. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4268. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4269. StaticCallOperand(procOp,procedure);
  4270. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4271. ReleaseOperand(procOp);
  4272. END;
  4273. RestoreRegisters(saved);
  4274. END;
  4275. RETURN variable
  4276. END PrepareTensorDescriptor;
  4277. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4278. VAR
  4279. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4280. operand, tmpOperand, variableOp, variable2Op: Operand;
  4281. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4282. variable, variable2: SyntaxTree.Variable;
  4283. dim, i, size: LONGINT;
  4284. (* TODO: needed? *)
  4285. oldArrayDestinationTag: IntermediateCode.Operand;
  4286. oldArrayDestinationDimension: LONGINT;
  4287. position: Position;
  4288. saved: RegisterEntry;
  4289. arrayFlags: SET;
  4290. m, n: LONGINT;
  4291. PROCEDURE Pass(op: IntermediateCode.Operand);
  4292. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4293. BEGIN
  4294. IF numberRegister >= 0 THEN
  4295. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4296. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4297. Emit(Mov(position,parameterRegister, op));
  4298. ELSE
  4299. Emit(Push(position,op))
  4300. END
  4301. END Pass;
  4302. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4303. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4304. BEGIN
  4305. formalType := formalType.resolved; actualType := actualType.resolved;
  4306. IF IsOpenArray(formalType)THEN
  4307. IF actualType IS SyntaxTree.StringType THEN
  4308. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4309. RETURN;
  4310. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4311. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4312. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4313. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4314. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4315. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4316. ELSE
  4317. tmp := baseReg;
  4318. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4319. IntermediateCode.MakeMemory(tmp,addressType);
  4320. Pass((tmp));
  4321. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4322. END;
  4323. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4324. END;
  4325. END PushArrayLens;
  4326. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4327. BEGIN
  4328. CASE size OF
  4329. |2: INCL(flags,Size2Flag);
  4330. |3: INCL(flags,Size3Flag);
  4331. |4: INCL(flags,Size4Flag);
  4332. |5: INCL(flags,Size5Flag);
  4333. |6: INCL(flags,Size6Flag);
  4334. |7: INCL(flags,Size7Flag);
  4335. |8: INCL(flags,Size8Flag);
  4336. END;
  4337. END SetSmallArraySizeFlag;
  4338. BEGIN
  4339. IF Trace THEN TraceEnter("PushParameter") END;
  4340. position := expression.position;
  4341. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4342. type := expression.type.resolved;
  4343. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4344. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4345. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4346. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4347. );
  4348. (* TODO: needed? *)
  4349. oldArrayDestinationTag := arrayDestinationTag;
  4350. oldArrayDestinationDimension := arrayDestinationDimension;
  4351. IF IsArrayOfSystemByte(parameter.type) THEN
  4352. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4353. Designate(expression,operand);
  4354. ELSE
  4355. Evaluate(expression, tmpOperand);
  4356. (* array of system byte does not provide any pointers *)
  4357. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4358. Symbol(variable, operand);
  4359. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4360. Emit(Mov(position,tmp, tmpOperand.op));
  4361. ReleaseOperand(tmpOperand);
  4362. END;
  4363. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4364. ReleaseIntermediateOperand(operand.tag);
  4365. operand.tag := tmp;
  4366. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4367. Pass((operand.tag));
  4368. END;
  4369. Pass((operand.op));
  4370. ELSIF IsOpenArray(parameter.type) THEN
  4371. Designate(expression,operand);
  4372. baseReg := operand.tag;
  4373. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4374. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4375. END;
  4376. Pass((operand.op)); (* address of the array *)
  4377. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4378. (* case 1
  4379. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4380. *)
  4381. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4382. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4383. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4384. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4385. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4386. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4387. arrayDestinationTag := sp;
  4388. (* case 1b
  4389. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4390. *)
  4391. IF expression IS SyntaxTree.IndexDesignator THEN
  4392. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4393. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4394. arrayDestinationDimension := dim;
  4395. Designate(expression,operand);
  4396. (* case 1a
  4397. P(...,A,...) push: push array descriptor to stack
  4398. *)
  4399. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4400. Designate(expression,operand);
  4401. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4402. i := 0;
  4403. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4404. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4405. INC(i);
  4406. END;
  4407. type := expression.type.resolved;
  4408. WHILE (i<dim) DO (* remaining static dimensions *)
  4409. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4410. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4411. ReleaseOperand(tmpOperand);
  4412. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4413. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4414. ReleaseOperand(tmpOperand);
  4415. INC(i);
  4416. END;
  4417. dimOp := IntermediateCode.Immediate(addressType,dim);
  4418. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4419. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4420. (* case 1d
  4421. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4422. + case 1e
  4423. P(.. PT() ... );
  4424. *)
  4425. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4426. Designate(expression,operand);
  4427. Dereference(operand,type.resolved,FALSE);
  4428. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4429. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4430. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4431. (* case 1f
  4432. P(...,S,...) push: create array descriptor to S on stack
  4433. case 1g
  4434. P(... PS()...)
  4435. *)
  4436. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4437. Designate(expression,operand);
  4438. FOR i := 0 TO dim-1 DO
  4439. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4440. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4441. ReleaseOperand(tmpOperand);
  4442. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4443. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4444. ReleaseOperand(tmpOperand);
  4445. END;
  4446. (*******
  4447. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4448. *)
  4449. arrayFlags := {StaticFlag};
  4450. IF dim = 1 THEN
  4451. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4452. ReleaseOperand(tmpOperand);
  4453. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4454. m := LONGINT(tmpOperand.op.intValue);
  4455. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4456. ELSIF dim = 2 THEN
  4457. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4458. ReleaseOperand(tmpOperand);
  4459. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4460. m := LONGINT(tmpOperand.op.intValue);
  4461. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4462. ReleaseOperand(tmpOperand);
  4463. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4464. n := LONGINT(tmpOperand.op.intValue);
  4465. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4466. INCL(arrayFlags,SmallMatrixFlag);
  4467. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4468. END;
  4469. END;
  4470. (*******)
  4471. dimOp := IntermediateCode.Immediate(addressType,dim);
  4472. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4473. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4474. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4475. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4476. baseType := SemanticChecker.ArrayBase(type,dim);
  4477. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4478. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4479. ELSE HALT(100);
  4480. END;
  4481. (* case 2
  4482. procedure P([left args], var A: array [*,*] of Type, [right args])
  4483. *)
  4484. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4485. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4486. (* case 2b
  4487. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4488. push: push reference to pushed array descriptor
  4489. post: remove array descriptor.
  4490. *)
  4491. IF expression IS SyntaxTree.IndexDesignator THEN
  4492. descriptorType := GetMathArrayDescriptorType(dim);
  4493. (* range type : no allocation possible, should be untraced *)
  4494. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4495. Symbol(variable,variableOp);
  4496. arrayDestinationTag := variableOp.op;
  4497. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4498. arrayDestinationDimension := dim;
  4499. NeedDescriptor := TRUE;
  4500. Designate(expression,operand);
  4501. Pass((operand.tag));
  4502. NeedDescriptor := FALSE;
  4503. (* case 2a
  4504. P(...,A,...)
  4505. push: push reference to array descriptor on stack
  4506. *)
  4507. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4508. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4509. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4510. INC(i);
  4511. END;
  4512. IF i = dim THEN
  4513. Designate(expression,operand);
  4514. Pass((operand.tag));
  4515. ELSE (* open-static *)
  4516. type := expression.type.resolved;
  4517. descriptorType := GetMathArrayDescriptorType(dim);
  4518. (* static array , cannot be reallocated, untraced !*)
  4519. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4520. Symbol(variable,variableOp);
  4521. arrayDestinationTag := variableOp.op;
  4522. Designate(expression,operand);
  4523. FOR i := 0 TO dim-1 DO
  4524. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4525. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4526. ReleaseOperand(tmpOperand);
  4527. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4528. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4529. ReleaseOperand(tmpOperand);
  4530. END;
  4531. dimOp := IntermediateCode.Immediate(addressType,dim);
  4532. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4533. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4534. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4535. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4536. baseType := SemanticChecker.ArrayBase(type,dim);
  4537. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4538. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4539. Pass((arrayDestinationTag));
  4540. END;
  4541. (* case 2d
  4542. P(...,T,...) push: emit dimension check, push T
  4543. *)
  4544. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4545. Designate(expression,operand);
  4546. Dereference(operand,type.resolved,FALSE);
  4547. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4548. Pass((operand.tag));
  4549. (* case 2f
  4550. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4551. push: push reference to pushed array descriptor
  4552. post: remove array descriptor
  4553. *)
  4554. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4555. descriptorType := GetMathArrayDescriptorType(dim);
  4556. (* static array -- cannot be reallocatated, untraced *)
  4557. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4558. Symbol(variable,variableOp);
  4559. arrayDestinationTag := variableOp.op;
  4560. Designate(expression,operand);
  4561. FOR i := 0 TO dim-1 DO
  4562. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4563. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4564. ReleaseOperand(tmpOperand);
  4565. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4566. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4567. ReleaseOperand(tmpOperand);
  4568. END;
  4569. (*
  4570. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4571. *)
  4572. arrayFlags := {StaticFlag};
  4573. IF dim = 1 THEN
  4574. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4575. ReleaseOperand(tmpOperand);
  4576. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4577. m := LONGINT(tmpOperand.op.intValue);
  4578. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4579. ELSIF dim = 2 THEN
  4580. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4581. ReleaseOperand(tmpOperand);
  4582. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4583. m := LONGINT(tmpOperand.op.intValue);
  4584. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4585. ReleaseOperand(tmpOperand);
  4586. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4587. n := LONGINT(tmpOperand.op.intValue);
  4588. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4589. INCL(arrayFlags,SmallMatrixFlag);
  4590. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4591. END;
  4592. END;
  4593. (*******)
  4594. dimOp := IntermediateCode.Immediate(addressType,dim);
  4595. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4596. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4597. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4598. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4599. baseType := SemanticChecker.ArrayBase(type,dim);
  4600. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4601. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4602. Pass((arrayDestinationTag));
  4603. ELSE HALT(100);
  4604. END;
  4605. (* case 3
  4606. procedure P([left args], [const] A: array [?] of Type, [right args])
  4607. *)
  4608. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4609. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4610. (* case 3b
  4611. P(...,A[a..b,c..d],...)
  4612. *)
  4613. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4614. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4615. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4616. Symbol(variable,variableOp);
  4617. LoadValue(variableOp,system.addressType);
  4618. ELSE
  4619. descriptorType := GetMathArrayDescriptorType(dim);
  4620. (* range -- cannot be reallocated *)
  4621. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4622. Symbol(variable,variableOp);
  4623. END;
  4624. arrayDestinationTag := variableOp.op;
  4625. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4626. arrayDestinationDimension := 0;
  4627. Designate(expression,operand);
  4628. Pass((operand.tag));
  4629. (* case 3a
  4630. P(...,A,...)
  4631. *)
  4632. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4633. i := 0;
  4634. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4635. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4636. INC(i);
  4637. END;
  4638. IF i = dim THEN
  4639. Designate(expression,operand);
  4640. Pass((operand.tag));
  4641. ELSE (* open-static *)
  4642. type := expression.type.resolved;
  4643. descriptorType := GetMathArrayDescriptorType(dim);
  4644. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4645. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4646. Symbol(variable,variableOp);
  4647. arrayDestinationTag := variableOp.op;
  4648. Designate(expression,operand);
  4649. FOR i := 0 TO dim-1 DO
  4650. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4651. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4652. ReleaseOperand(tmpOperand);
  4653. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4654. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4655. ReleaseOperand(tmpOperand);
  4656. END;
  4657. dimOp := IntermediateCode.Immediate(addressType,dim);
  4658. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4659. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4660. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4661. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4662. baseType := SemanticChecker.ArrayBase(type,dim);
  4663. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4664. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4665. Pass((arrayDestinationTag));
  4666. END;
  4667. (* case 3d
  4668. P(...,T,...)
  4669. case 3e
  4670. P(...,PT(...),...)
  4671. *)
  4672. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4673. Designate(expression,operand);
  4674. Dereference(operand,type.resolved,FALSE);
  4675. Pass((operand.tag));
  4676. (* case 3f
  4677. P(...,S,...)
  4678. case 3g
  4679. P(...,PS(...),...)
  4680. *)
  4681. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4682. descriptorType := GetMathArrayDescriptorType(dim);
  4683. (* static array does not need to be traced *)
  4684. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4685. Symbol(variable,variableOp);
  4686. arrayDestinationTag := variableOp.op;
  4687. Designate(expression,operand);
  4688. IF operand.op.type.length >1 THEN (* vector register *)
  4689. (* static array does not need to be traced *)
  4690. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4691. Symbol(variable2, variable2Op);
  4692. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4693. Emit(Mov(position,tmp, operand.op));
  4694. ReleaseOperand(operand);
  4695. Symbol(variable2, operand);
  4696. END;
  4697. FOR i := 0 TO dim-1 DO
  4698. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4699. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4700. ReleaseOperand(tmpOperand);
  4701. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4702. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4703. ReleaseOperand(tmpOperand);
  4704. END;
  4705. dimOp := IntermediateCode.Immediate(addressType,dim);
  4706. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4707. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4708. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4709. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4710. baseType := SemanticChecker.ArrayBase(type,dim);
  4711. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4712. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4713. Pass((arrayDestinationTag));
  4714. ELSE HALT(100);
  4715. END;
  4716. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4717. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4718. (* case 4b
  4719. P(...,A[a..b,c..d],...)
  4720. *)
  4721. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4722. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4723. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4724. Symbol(variable,variableOp);
  4725. LoadValue(variableOp,system.addressType);
  4726. ELSE
  4727. descriptorType := GetMathArrayDescriptorType(dim);
  4728. (* range array -- cannot be allocated *)
  4729. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4730. Symbol(variable,variableOp);
  4731. END;
  4732. arrayDestinationTag := variableOp.op;
  4733. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4734. arrayDestinationDimension := 0;
  4735. Designate(expression,operand);
  4736. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4737. Symbol(variable,variableOp);
  4738. ELSE
  4739. (* alias to range -- untraced *)
  4740. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4741. Symbol(variable,variableOp);
  4742. MakeMemory(tmp,variableOp.op,addressType,0);
  4743. Emit(Mov(position,tmp,operand.tag));
  4744. ReleaseIntermediateOperand(tmp);
  4745. END;
  4746. Pass((variableOp.op));
  4747. ReleaseOperand(variableOp);
  4748. (* case 4a
  4749. P(...,A,...)
  4750. *)
  4751. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4752. i := 0;
  4753. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4754. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4755. INC(i);
  4756. END;
  4757. IF i = dim THEN
  4758. Designate(expression,operand);
  4759. arrayDestinationTag := operand.tag;
  4760. ELSE (* open-static *)
  4761. type := expression.type.resolved;
  4762. descriptorType := GetMathArrayDescriptorType(dim);
  4763. (* static array -- untraced *)
  4764. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4765. Symbol(variable,variableOp);
  4766. arrayDestinationTag := variableOp.op;
  4767. Designate(expression,operand);
  4768. FOR i := 0 TO dim-1 DO
  4769. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4770. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4771. ReleaseOperand(tmpOperand);
  4772. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4773. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4774. ReleaseOperand(tmpOperand);
  4775. END;
  4776. dimOp := IntermediateCode.Immediate(addressType,dim);
  4777. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4778. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4779. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4780. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4781. baseType := SemanticChecker.ArrayBase(type,dim);
  4782. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4783. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4784. END;
  4785. (* tensor alias to open array -- untraced *)
  4786. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4787. Symbol(variable,variableOp);
  4788. MakeMemory(tmp,variableOp.op,addressType,0);
  4789. Emit(Mov(position,tmp,arrayDestinationTag));
  4790. ReleaseIntermediateOperand(tmp);
  4791. Pass((variableOp.op));
  4792. ReleaseOperand(variableOp);
  4793. (* case 4d
  4794. P(...,T,...)
  4795. *)
  4796. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4797. Designate(expression,operand);
  4798. Pass((operand.op));
  4799. (* case 4f
  4800. P(...,S,...)
  4801. *)
  4802. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4803. descriptorType := GetMathArrayDescriptorType(dim);
  4804. (* static array -- cannot be reallocated, untraced *)
  4805. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4806. Symbol(variable,variableOp);
  4807. arrayDestinationTag := variableOp.op;
  4808. Designate(expression,operand);
  4809. FOR i := 0 TO dim-1 DO
  4810. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4811. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4812. ReleaseOperand(tmpOperand);
  4813. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4814. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4815. ReleaseOperand(tmpOperand);
  4816. END;
  4817. dimOp := IntermediateCode.Immediate(addressType,dim);
  4818. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4819. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4820. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4821. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4822. baseType := SemanticChecker.ArrayBase(type,dim);
  4823. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4824. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4825. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4826. Symbol(variable,variableOp);
  4827. MakeMemory(tmp,variableOp.op,addressType,0);
  4828. Emit(Mov(position,tmp,arrayDestinationTag));
  4829. ReleaseIntermediateOperand(tmp);
  4830. Pass((variableOp.op));
  4831. ReleaseOperand(variableOp);
  4832. ELSE HALT(100);
  4833. END;
  4834. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4835. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4836. Designate(expression,operand);
  4837. IF operand.op.type.length > 1 THEN
  4838. Emit(Push(position, operand.op));
  4839. ELSE
  4840. size := system.SizeOf(type);
  4841. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4842. size := ToMemoryUnits(system,size);
  4843. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4844. arrayDestinationTag := sp;
  4845. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4846. END;
  4847. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4848. Designate(expression,operand);
  4849. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4850. (* static array no pointer *)
  4851. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4852. Symbol(variable,variableOp);
  4853. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4854. Emit(Mov(position,tmp,operand.op));
  4855. Emit(Push(position,variableOp.op));
  4856. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4857. Pass((operand.op));
  4858. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4859. END;
  4860. ELSE HALT(200)
  4861. END;
  4862. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4863. IF parameter.kind = SyntaxTree.VarParameter THEN
  4864. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4865. Designate(expression, operand);
  4866. Pass((operand.op));
  4867. ELSE
  4868. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4869. Evaluate(expression, operand);
  4870. Pass((operand.extra)); (* step *)
  4871. Pass((operand.tag)); (* last *)
  4872. Pass((operand.op)) (* first *)
  4873. END
  4874. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4875. IF parameter.kind = SyntaxTree.VarParameter THEN
  4876. Designate(expression, operand);
  4877. Pass((operand.op));
  4878. ELSE
  4879. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4880. Evaluate(expression, operand);
  4881. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4882. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4883. Pass((operand.tag)); (* imaginary part *)
  4884. Pass((operand.op)) (* real part *)
  4885. ELSE
  4886. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4887. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4888. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4889. tmp := sp;
  4890. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4891. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4892. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4893. IntermediateCode.AddOffset(tmp,size);
  4894. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4895. END
  4896. END
  4897. ELSE
  4898. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4899. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4900. Designate(expression,operand);
  4901. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4902. (* stack allocation *)
  4903. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4904. (*! parameter alignment to be discussed ... *)
  4905. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4906. size := type(SyntaxTree.StringType).length;
  4907. END;
  4908. IF backend.cooperative & parameter.NeedsTrace() THEN
  4909. dst := NewRegisterOperand (addressType);
  4910. Emit(Mov(position,dst, sp));
  4911. IntermediateCode.InitImmediate(null, byteType, 0);
  4912. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4913. ReleaseIntermediateOperand(dst);
  4914. SaveRegisters();ReleaseUsedRegisters(saved);
  4915. (* register dst has been freed before SaveRegisters already *)
  4916. CallAssignMethod(dst, operand.op, parameter.type);
  4917. RestoreRegisters(saved);
  4918. END;
  4919. IF operand.op.type.length > 1 THEN (* vector *)
  4920. MakeMemory(tmp,sp,operand.op.type,0);
  4921. Emit(Mov(position, tmp, operand.op));
  4922. ELSE
  4923. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4924. END;
  4925. ELSIF IsOpenArray(parameter.type) THEN
  4926. Designate(expression,operand);
  4927. baseReg := operand.tag;
  4928. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4929. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4930. END;
  4931. Pass((operand.op)); (* address of the array *)
  4932. ELSIF IsDelegate(parameter.type) THEN
  4933. Evaluate(expression,operand);
  4934. IF backend.cooperative & parameter.NeedsTrace() THEN
  4935. Emit(Push(position, nil));
  4936. dst := NewRegisterOperand (addressType);
  4937. Emit(Mov(position,dst, sp));
  4938. ReleaseIntermediateOperand(dst);
  4939. SaveRegisters();ReleaseUsedRegisters(saved);
  4940. Emit(Push(position, dst));
  4941. (* register dst has been freed before SaveRegisters already *)
  4942. Emit(Push(position, operand.tag));
  4943. CallThis(position,"GarbageCollector","Assign",2);
  4944. RestoreRegisters(saved);
  4945. ELSE
  4946. Pass((operand.tag));
  4947. END;
  4948. Pass((operand.op));
  4949. ELSE
  4950. Evaluate(expression,operand);
  4951. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4952. Emit(Push(position, nil));
  4953. dst := NewRegisterOperand (addressType);
  4954. Emit(Mov(position,dst, sp));
  4955. ReleaseIntermediateOperand(dst);
  4956. SaveRegisters();ReleaseUsedRegisters(saved);
  4957. Emit(Push(position, dst));
  4958. (* register dst has been freed before SaveRegisters already *)
  4959. Emit(Push(position, operand.op));
  4960. CallThis(position,"GarbageCollector","Assign",2);
  4961. RestoreRegisters(saved);
  4962. ELSE
  4963. Pass((operand.op));
  4964. END;
  4965. END;
  4966. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4967. Evaluate(expression,operand);
  4968. Pass((operand.op));
  4969. ELSE (* var parameter *)
  4970. Designate(expression,operand);
  4971. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4972. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4973. Pass((operand.tag));
  4974. END;
  4975. END;
  4976. Pass((operand.op));
  4977. END;
  4978. END;
  4979. (* TODO: needed? *)
  4980. arrayDestinationTag := oldArrayDestinationTag;
  4981. arrayDestinationDimension := oldArrayDestinationDimension;
  4982. IF needsParameterBackup THEN
  4983. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4984. ReuseCopy(parameterBackup, operand.op)
  4985. END;
  4986. ReleaseOperand(operand);
  4987. IF Trace THEN TraceExit("PushParameter") END;
  4988. END PushParameter;
  4989. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4990. VAR prevConditional: BOOLEAN;
  4991. BEGIN
  4992. prevConditional := conditional;
  4993. conditional := FALSE;
  4994. 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
  4995. Expression(x.result); (* use register *)
  4996. END;
  4997. Statement(x.statement);
  4998. conditional := prevConditional;
  4999. IF x.result # NIL THEN Expression(x.result) END;
  5000. 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
  5001. ReleaseIntermediateOperand(result.op);
  5002. END;
  5003. END VisitStatementDesignator;
  5004. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5005. VAR
  5006. procedure: SyntaxTree.Procedure;
  5007. procedureType: SyntaxTree.ProcedureType;
  5008. wasInline: BOOLEAN;
  5009. actualParameters: SyntaxTree.ExpressionList;
  5010. formalParameter: SyntaxTree.Parameter;
  5011. actualParameter: SyntaxTree.Expression;
  5012. i: LONGINT;
  5013. localVariable: SyntaxTree.Variable;
  5014. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5015. src, dest: Operand;
  5016. prevInlineExit : Label;
  5017. prevMapper: SymbolMapper;
  5018. tooComplex: BOOLEAN;
  5019. resultDesignator: SyntaxTree.Expression;
  5020. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5021. BEGIN
  5022. IF e = NIL THEN RETURN TRUE
  5023. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5024. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5025. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5026. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5027. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5028. ELSE RETURN FALSE
  5029. END;
  5030. END SimpleExpression;
  5031. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5032. BEGIN
  5033. RETURN checker.CanPassInRegister(type)
  5034. END FitsInRegister;
  5035. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5036. VAR
  5037. variable: SyntaxTree.Variable;
  5038. variableDesignator: SyntaxTree.Designator;
  5039. BEGIN
  5040. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5041. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5042. variableDesignator.SetType(type);
  5043. RETURN variableDesignator
  5044. END GetTemp;
  5045. BEGIN
  5046. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5047. wasInline := currentIsInline;
  5048. prevInlineExit := currentInlineExit;
  5049. prevMapper := currentMapper;
  5050. currentInlineExit := NewLabel();
  5051. tooComplex := FALSE;
  5052. NEW(currentMapper);
  5053. currentIsInline := TRUE;
  5054. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5055. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5056. formalParameter := procedureType.firstParameter;
  5057. actualParameters := x.parameters;
  5058. i := 0;
  5059. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5060. actualParameter := actualParameters.GetExpression(i);
  5061. IF actualParameter.resolved # NIL THEN
  5062. actualParameter := actualParameter.resolved
  5063. END;
  5064. (*
  5065. if expression is simple and can be passed immediately
  5066. or if type fits in register then we can proceed
  5067. otherwise we escape to ordinary procedure call.
  5068. *)
  5069. (* cases where the expression can be mapped identically *)
  5070. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5071. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5072. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5073. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5074. (*
  5075. Assign(variableDesignator, actualParameter);
  5076. *)
  5077. Evaluate(actualParameter, src);
  5078. Designate(variableDesignator, dest);
  5079. Emit(Mov(x.position, dest.op, src.op));
  5080. ReleaseOperand(dest);
  5081. ReleaseOperand(src);
  5082. (* the src operand should now have been completely released ! *)
  5083. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5084. ELSE tooComplex := TRUE
  5085. END;
  5086. (*
  5087. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5088. currentMapper.Add(formalParameter, actualParameter, NIL);
  5089. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5090. variableDesignator := GetTemp(system.addressType, FALSE);
  5091. Designate(actualParameter, src);
  5092. Designate(variableDesignator, dest);
  5093. IntermediateCode.MakeMemory(dest.op,addressType);
  5094. Emit(Mov(x.position, dest.op, src.op));
  5095. ReleaseOperand(dest);
  5096. IF src.tag.mode # IntermediateCode.Undefined THEN
  5097. tagDesignator := GetTemp(system.addressType, FALSE);
  5098. Designate(tagDesignator, dest);
  5099. IntermediateCode.MakeMemory(dest.op,addressType);
  5100. Emit(Mov(x.position, dest.op, src.op));
  5101. END;
  5102. ReleaseOperand(dest); ReleaseOperand(src);
  5103. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5104. END;
  5105. *)
  5106. formalParameter := formalParameter.nextParameter;
  5107. INC(i);
  5108. END;
  5109. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5110. IF resultDesignator # NIL THEN
  5111. returnDesignator := resultDesignator
  5112. ELSE
  5113. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5114. END;
  5115. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5116. END;
  5117. localVariable := procedure.procedureScope.firstVariable;
  5118. WHILE ~tooComplex & (localVariable # NIL) DO
  5119. variableDesignator := GetTemp(localVariable.type, FALSE);
  5120. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5121. localVariable := localVariable.nextVariable;
  5122. END;
  5123. IF ~tooComplex THEN
  5124. VisitStatementBlock(procedure.procedureScope.body);
  5125. SetLabel(currentInlineExit);
  5126. IF procedureType.returnType # NIL THEN
  5127. Designate(returnDesignator, result);
  5128. IF conditional THEN
  5129. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5130. ValueToCondition(result)
  5131. END;
  5132. END;
  5133. END;
  5134. currentMapper := prevMapper;
  5135. currentInlineExit := prevInlineExit;
  5136. currentIsInline := wasInline;
  5137. RETURN ~tooComplex
  5138. END InlineProcedureCall;
  5139. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5140. VAR
  5141. parameters: SyntaxTree.ExpressionList;
  5142. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5143. designator: SyntaxTree.Designator;
  5144. procedureType: SyntaxTree.ProcedureType;
  5145. formalParameter: SyntaxTree.Parameter;
  5146. operand, returnValue: Operand;
  5147. reg, size, mask, dest: IntermediateCode.Operand;
  5148. saved,saved2: RegisterEntry;
  5149. symbol: SyntaxTree.Symbol;
  5150. variable: SyntaxTree.Variable;
  5151. i, parametersSize, returnTypeSize : LONGINT;
  5152. structuredReturnType: BOOLEAN;
  5153. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5154. tempVariableDesignator: SyntaxTree.Designator;
  5155. gap, alignment: LONGINT; (*fld*)
  5156. (* TODO: remove unnecessary backup variables *)
  5157. oldResult: Operand;
  5158. oldCurrentScope: SyntaxTree.Scope;
  5159. oldArrayDestinationTag: IntermediateCode.Operand;
  5160. oldArrayDestinationDimension: LONGINT;
  5161. oldConstantDeclaration: SyntaxTree.Symbol;
  5162. oldDestination: IntermediateCode.Operand;
  5163. oldCurrentLoop: Label;
  5164. oldConditional: BOOLEAN;
  5165. oldTrueLabel, oldFalseLabel: Label;
  5166. oldLocked: BOOLEAN;
  5167. usedRegisters,oldUsedRegisters: RegisterEntry;
  5168. return: IntermediateCode.Operand;
  5169. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5170. arg: IntermediateCode.Operand;
  5171. dummy: IntermediateCode.Operand;
  5172. recordType: SyntaxTree.RecordType;
  5173. operatorSelectionProcedureOperand: Operand;
  5174. operatorSelectionProcedure: SyntaxTree.Procedure;
  5175. fingerPrint: SyntaxTree.FingerPrint;
  5176. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5177. identifierNumber: LONGINT;
  5178. parameterRegisters: SIZE;
  5179. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5180. procedure: SyntaxTree.Procedure;
  5181. callingConvention: SyntaxTree.CallingConvention;
  5182. PROCEDURE BackupGlobalState;
  5183. BEGIN
  5184. oldResult := result;
  5185. oldCurrentScope := currentScope;
  5186. oldArrayDestinationTag := arrayDestinationTag;
  5187. oldArrayDestinationDimension := arrayDestinationDimension;
  5188. oldConstantDeclaration := constantDeclaration;
  5189. oldDestination := destination;
  5190. oldCurrentLoop := currentLoop;
  5191. oldConditional := conditional;
  5192. oldTrueLabel := trueLabel;
  5193. oldFalseLabel := falseLabel;
  5194. oldLocked := locked;
  5195. oldUsedRegisters := usedRegisters
  5196. END BackupGlobalState;
  5197. PROCEDURE RestoreGlobalState;
  5198. BEGIN
  5199. result := oldResult;
  5200. currentScope := oldCurrentScope;
  5201. arrayDestinationTag := oldArrayDestinationTag;
  5202. arrayDestinationDimension := oldArrayDestinationDimension;
  5203. constantDeclaration := oldConstantDeclaration;
  5204. destination := oldDestination;
  5205. currentLoop := oldCurrentLoop;
  5206. conditional := oldConditional;
  5207. trueLabel := oldTrueLabel;
  5208. falseLabel := oldFalseLabel;
  5209. locked := oldLocked;
  5210. usedRegisters := oldUsedRegisters
  5211. END RestoreGlobalState;
  5212. (** do preparations before parameter push for array-structured object types (ASOTs):
  5213. if ASOT is passed as VAR parameter:
  5214. - allocate temporary variable of math array type
  5215. - copy contents of ASOT to be passed to temporary variable
  5216. - use temporary variable as the actual parameter instead
  5217. - 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)
  5218. **)
  5219. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5220. VAR
  5221. expression: SyntaxTree.Expression;
  5222. BEGIN
  5223. IF actualParameter IS SyntaxTree.Designator THEN
  5224. designator := actualParameter(SyntaxTree.Designator);
  5225. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5226. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5227. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5228. ASSERT(checker # NIL);
  5229. checker.SetCurrentScope(currentScope);
  5230. (* allocate temporary variable *)
  5231. ASSERT(actualParameter.type # NIL);
  5232. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5233. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5234. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5235. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5236. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5237. ASSERT(tempVariableDesignator.type # NIL);
  5238. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5239. (* copy math array stored in actual parameter to temporary variable *)
  5240. BackupGlobalState;
  5241. AssignMathArray(tempVariableDesignator, actualParameter);
  5242. RestoreGlobalState;
  5243. (* use temporary variable as actual parameter instead of the original one *)
  5244. actualParameter := tempVariableDesignator;
  5245. (* create write-back call and store it in linked list *)
  5246. (* create new list entry *)
  5247. IF firstWriteBackCall = NIL THEN
  5248. NEW(firstWriteBackCall);
  5249. currentWriteBackCall := firstWriteBackCall
  5250. ELSE
  5251. ASSERT(currentWriteBackCall # NIL);
  5252. NEW(currentWriteBackCall.next);
  5253. currentWriteBackCall := currentWriteBackCall.next
  5254. END;
  5255. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5256. ASSERT(expression.type = NIL);
  5257. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5258. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5259. (* prepare writeback for any other "normal" indexer *)
  5260. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5261. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5262. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5263. Assign(tempVariableDesignator, actualParameter);
  5264. actualParameter := tempVariableDesignator;
  5265. IF firstWriteBackCall = NIL THEN
  5266. NEW(firstWriteBackCall);
  5267. currentWriteBackCall := firstWriteBackCall
  5268. ELSE
  5269. ASSERT(currentWriteBackCall # NIL);
  5270. NEW(currentWriteBackCall.next);
  5271. currentWriteBackCall := currentWriteBackCall.next
  5272. END;
  5273. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5274. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5275. END
  5276. END
  5277. END PrepareParameter;
  5278. BEGIN
  5279. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5280. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5281. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5282. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5283. IF InlineProcedureCall(x) THEN
  5284. RETURN
  5285. ELSE
  5286. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5287. END
  5288. END;
  5289. END;
  5290. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5291. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5292. callingConvention := procedureType.callingConvention;
  5293. dest := destination; destination := emptyOperand;
  5294. SaveRegisters();ReleaseUsedRegisters(saved);
  5295. parameters := x.parameters;
  5296. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5297. (* an operator is called *)
  5298. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5299. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5300. (* check if a dynamic operator call should be performed *)
  5301. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5302. ELSE
  5303. isCallOfDynamicOperator := FALSE
  5304. END;
  5305. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5306. Emit(Push(position, ap));
  5307. END;
  5308. alignment := procedureType.stackAlignment;
  5309. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5310. alignment := 16 (* bytes *);
  5311. END;
  5312. IF alignment > 1 THEN
  5313. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5314. Emit(Mov(position,reg, sp));
  5315. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5316. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5317. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5318. gap := 4*ToMemoryUnits(system,system.addressSize);
  5319. END;
  5320. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5321. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5322. IF gap < 0 THEN
  5323. gap := 0
  5324. END;
  5325. ELSE
  5326. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5327. END;
  5328. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5329. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5330. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5331. Emit(And(position,sp, sp, mask));
  5332. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5333. Emit(Push(position,reg));
  5334. ReleaseIntermediateOperand(reg);
  5335. END;
  5336. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5337. (* align stack to 16-byte boundary *)
  5338. IntermediateCode.InitImmediate(mask,addressType,-16);
  5339. Emit(And(position,sp, sp, mask));
  5340. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5341. IF gap # 0 THEN
  5342. IntermediateCode.InitImmediate(size,addressType,gap);
  5343. Emit(Sub(position,sp,sp,size))
  5344. END;
  5345. END;
  5346. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5347. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5348. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5349. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5350. ELSE
  5351. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5352. END;
  5353. Evaluate(x.left, operand);
  5354. IF symbol IS SyntaxTree.Procedure THEN
  5355. IF (procedureType.selfParameter # NIL) THEN
  5356. Emit(Push(position,operand.tag));
  5357. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5358. Emit(Push(position,operand.tag));
  5359. ELSIF (procedureType.isDelegate) THEN
  5360. Emit(Push(position,operand.tag));
  5361. END;
  5362. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5363. IF (procedureType.selfParameter # NIL) THEN
  5364. Emit(Push(position,operand.tag));
  5365. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5366. Emit(Push(position,operand.tag));
  5367. END;
  5368. ELSE HALT(200);
  5369. END;
  5370. ReleaseIntermediateOperand(operand.tag);
  5371. operand.tag := emptyOperand;
  5372. (* determine if a structured return type is needed *)
  5373. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5374. IF structuredReturnType THEN
  5375. IF resultDesignator # NIL THEN
  5376. d := resultDesignator;
  5377. ELSE
  5378. (* temporary result that might be allocated, must potentially be traced *)
  5379. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5380. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5381. d.SetType(variable.type);
  5382. END;
  5383. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5384. Designate(d,returnValue);
  5385. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5386. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5387. Emit(Push(position,size));
  5388. Emit(Push(position,returnValue.op));
  5389. ReleaseOperand(returnValue);
  5390. ELSE*)
  5391. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5392. (*
  5393. END;
  5394. *)
  5395. END;
  5396. firstWriteBackCall := NIL; (* reset write-back call list *)
  5397. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5398. parameterRegisters := backend.NumberParameterRegisters(callingConvention);
  5399. passByRegister := parameterRegisters > 0;
  5400. registerNumber := 0;
  5401. formalParameter := procedureType.lastParameter;
  5402. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5403. actualParameter := parameters.GetExpression(i);
  5404. PrepareParameter(actualParameter, formalParameter);
  5405. IF passByRegister & (i < parameterRegisters) THEN
  5406. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5407. Error(actualParameter.position,"cannot be passed by register")
  5408. ELSE
  5409. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5410. END;
  5411. INC(registerNumber);
  5412. ELSE
  5413. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5414. END;
  5415. formalParameter := formalParameter.prevParameter;
  5416. END;
  5417. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) THEN
  5418. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5419. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5420. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5421. END;
  5422. ELSE
  5423. hasDynamicOperands := FALSE;
  5424. formalParameter := procedureType.firstParameter;
  5425. FOR i := 0 TO parameters.Length() - 1 DO
  5426. actualParameter := parameters.GetExpression(i);
  5427. IF formalParameter # NIL THEN (* TENTATIVE *)
  5428. PrepareParameter(actualParameter, formalParameter);
  5429. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5430. ASSERT(i < 2);
  5431. hasDynamicOperands := TRUE;
  5432. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5433. ELSE
  5434. IF passByRegister & (registerNumber > 0) THEN
  5435. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5436. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5437. END;
  5438. passByRegister := FALSE;
  5439. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5440. END;
  5441. formalParameter := formalParameter.nextParameter;
  5442. END;
  5443. END;
  5444. END;
  5445. IF symbol IS SyntaxTree.Procedure THEN
  5446. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5447. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5448. Emit(Push(position,reg));
  5449. ReleaseIntermediateOperand(reg);
  5450. END;
  5451. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5452. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5453. parametersSize := ParametersSize(system,procedureType, FALSE);
  5454. END;
  5455. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5456. (*
  5457. dynamic operator overloading:
  5458. first push parameters, regularly:
  5459. [self]
  5460. par1
  5461. par2
  5462. then push parameters for GetOperator
  5463. identifier
  5464. ptr1
  5465. tag
  5466. ptr2
  5467. tag
  5468. call GetOperatorRuntimeProc
  5469. call Operator
  5470. *)
  5471. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5472. (* push ID *)
  5473. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5474. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5475. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5476. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5477. formalParameter := procedureType.firstParameter;
  5478. FOR i := 0 TO parameters.Length() - 1 DO
  5479. IF formalParameter.access # SyntaxTree.Hidden THEN
  5480. ASSERT(i < 2);
  5481. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5482. (* push pointer *)
  5483. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5484. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5485. (* add dereference *)
  5486. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5487. (*! better: do refer to stack above than using parameter backups !!*)
  5488. ReleaseIntermediateOperand(parameterBackups[i]);
  5489. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5490. END;
  5491. Emit(Push(position,parameterBackups[i]));
  5492. ReleaseIntermediateOperand(parameterBackups[i]);
  5493. (* push typetag *)
  5494. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5495. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5496. arg := TypeDescriptorAdr(recordType);
  5497. Emit(Push(position,arg));
  5498. ELSE
  5499. (* push 'NonPointer' *)
  5500. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5501. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5502. (* push fingerprint *)
  5503. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5504. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5505. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5506. END
  5507. END;
  5508. formalParameter := formalParameter.nextParameter
  5509. END;
  5510. (* for unary operators: complete the information for the second parameter *)
  5511. IF procedureType.numberParameters < 2 THEN
  5512. (* push 'NonPointer' *)
  5513. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5514. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5515. (* push 'NoType' *)
  5516. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5517. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5518. END;
  5519. (* call operator selection procedure *)
  5520. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5521. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5522. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5523. ReleaseOperand(operatorSelectionProcedureOperand);
  5524. (* use the address that the operator selection procedure returned as the target address of the call *)
  5525. InitOperand(operand, ModeValue);
  5526. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5527. Emit(Result(position,operand.op))
  5528. END
  5529. END;
  5530. ReleaseParameterRegisters();
  5531. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5532. SaveRegisters();ReleaseUsedRegisters(saved2);
  5533. CallThis(position,"Objects","LeaveA2",0);
  5534. RestoreRegisters(saved2);
  5535. END;
  5536. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5537. Emit(Call(position,operand.op,0));
  5538. ELSE
  5539. Emit(Call(position,operand.op,parametersSize));
  5540. END;
  5541. ReleaseOperand(operand);
  5542. IF procedureType.noReturn THEN
  5543. EmitTrap(position,NoReturnTrap);
  5544. END;
  5545. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5546. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5547. Emit(Result(position,return));
  5548. END;
  5549. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5550. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5551. Emit(Push(position, return));
  5552. CallThis(position,"Objects","ReenterA2",0);
  5553. Emit(Pop(position, return));
  5554. ELSE
  5555. CallThis(position,"Objects","ReenterA2",0);
  5556. END;
  5557. END;
  5558. (* === return parameter space === *)
  5559. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5560. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5561. (* cleanup all space for all parameters *)
  5562. IF parametersSize < 32 THEN
  5563. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5564. parametersSize := 32
  5565. END;
  5566. size := IntermediateCode.Immediate(addressType,parametersSize);
  5567. Emit(Add(position,sp,sp,size))
  5568. END;
  5569. IF (callingConvention IN SysvABI) THEN
  5570. IF passByRegister THEN
  5571. IF parameters.Length() > parameterRegisters THEN
  5572. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5573. ELSE
  5574. parametersSize := 0
  5575. END;
  5576. ELSE
  5577. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5578. INC( parametersSize, (-parametersSize) MOD 16 )
  5579. END;
  5580. IF parametersSize > 0 THEN
  5581. size := IntermediateCode.Immediate(addressType,parametersSize);
  5582. Emit(Add(position,sp,sp,size))
  5583. END;
  5584. END;
  5585. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5586. IF structuredReturnType THEN
  5587. (* stack pointer rewinding done by callee
  5588. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5589. Emit(Add(position,sp,sp,size));
  5590. *)
  5591. RestoreRegisters(saved);
  5592. InitOperand(result,ModeReference);
  5593. Symbol(variable,result);
  5594. ELSE
  5595. RestoreRegisters(saved);
  5596. InitOperand(result,ModeValue);
  5597. result.op := return;
  5598. END;
  5599. END;
  5600. IF alignment > 1 THEN
  5601. Emit(Pop(position,sp));
  5602. END;
  5603. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5604. Emit(Pop(position, ap));
  5605. END;
  5606. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5607. ValueToCondition(result);
  5608. END;
  5609. destination := dest;
  5610. (* perform all write-back calls in the list *)
  5611. BackupGlobalState;
  5612. currentWriteBackCall := firstWriteBackCall;
  5613. WHILE currentWriteBackCall # NIL DO
  5614. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5615. currentWriteBackCall := currentWriteBackCall.next
  5616. END;
  5617. RestoreGlobalState;
  5618. (* TENATIVE *)
  5619. (*
  5620. IF isOperatorCall THEN
  5621. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5622. END;
  5623. *)
  5624. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5625. END VisitProcedureCallDesignator;
  5626. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5627. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5628. td: SyntaxTree.Symbol;
  5629. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5630. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5631. BEGIN
  5632. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5633. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5634. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5635. variable.SetType(system.anyType);
  5636. scope.AddVariable(variable);
  5637. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5638. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5639. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5640. typeDeclaration.SetScope(module.module.moduleScope);
  5641. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5642. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5643. END;
  5644. RETURN hiddenPointerType;
  5645. END GetHiddenPointerType;
  5646. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5647. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5648. BEGIN
  5649. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5650. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5651. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5652. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5653. scope.AddVariable(variable);
  5654. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5655. variable.SetType(system.anyType);
  5656. scope.AddVariable(variable);
  5657. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5658. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5659. typeDeclaration.SetDeclaredType(delegatePointerType);
  5660. typeDeclaration.SetScope(module.module.moduleScope);
  5661. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5662. delegatePointerType.SetState(SyntaxTree.Resolved);
  5663. END;
  5664. RETURN delegatePointerType
  5665. END GetDelegateType;
  5666. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5667. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5668. such as in VAR a: RECORD ... END;
  5669. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5670. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5671. *)
  5672. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5673. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5674. BEGIN (* no code emission *)
  5675. source := NIL;
  5676. x := x.resolved;
  5677. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5678. x := GetHiddenPointerType();
  5679. ELSIF IsDelegate(x) THEN
  5680. x := GetDelegateType();
  5681. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5682. ELSE HALT(200);
  5683. END;
  5684. td := x.typeDeclaration;
  5685. IF td = NIL THEN
  5686. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5687. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5688. ASSERT(td # NIL);
  5689. END;
  5690. GetCodeSectionNameForSymbol(td,name);
  5691. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5692. meta.CheckTypeDeclaration(x);
  5693. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5694. ELSE
  5695. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5696. END;
  5697. IF backend.cooperative OR meta.simple THEN
  5698. offset := 0;
  5699. ELSE
  5700. IF x IS SyntaxTree.CellType THEN
  5701. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5702. IF baseRecord = NIL THEN
  5703. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5704. ELSE
  5705. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5706. END;
  5707. ELSE
  5708. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5709. END;
  5710. END;
  5711. RETURN td
  5712. END GetBackendType;
  5713. BEGIN
  5714. (*td := t.typeDeclaration;*)
  5715. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5716. (*
  5717. IF t IS SyntaxTree.PointerType THEN
  5718. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5719. ELSE
  5720. source := GetBackendType(t);
  5721. END;
  5722. *)
  5723. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5724. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5725. IntermediateCode.SetOffset(res,offset);
  5726. (*
  5727. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5728. make memory should be used when tag is used, not earlier
  5729. *)
  5730. RETURN res
  5731. END TypeDescriptorAdr;
  5732. (*
  5733. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5734. VAR result: IntermediateCode.Operand;
  5735. BEGIN
  5736. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5737. operand.tag := TypeDescriptorAdr(operand.type);
  5738. IntermediateCode.MakeMemory(operand.tag,addressType);
  5739. UseIntermediateOperand(operand.tag);
  5740. END;
  5741. END MakeTypeTag;
  5742. *)
  5743. PROCEDURE ProfilerInit;
  5744. VAR reg: IntermediateCode.Operand;
  5745. BEGIN
  5746. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5747. Emit(Call(position,reg,0));
  5748. END ProfilerInit;
  5749. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5750. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5751. BEGIN
  5752. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5753. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5754. THEN
  5755. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5756. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5757. Emit(Push(position,reg));
  5758. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5759. Emit(Push(position,reg));
  5760. StaticCallOperand(result,procedure);
  5761. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5762. ReleaseOperand(result);
  5763. END;
  5764. END ProfilerEnterExit;
  5765. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5766. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5767. BEGIN
  5768. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5769. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5770. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5771. profileInit.Emit(Push(position,reg));
  5772. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5773. profileInit.Emit(Push(position,reg));
  5774. NEW(string, LEN(name)); COPY(name, string^);
  5775. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5776. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5777. sv.SetType(type);
  5778. Designate(sv,result);
  5779. profileInit.Emit(Push(position,result.tag));
  5780. profileInit.Emit(Push(position,result.op));
  5781. StaticCallOperand(result,procedure);
  5782. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5783. ReleaseOperand(result);
  5784. END;
  5785. END ProfilerAddProcedure;
  5786. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5787. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5788. BEGIN
  5789. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5790. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5791. profileInit.Emit(Push(position,reg));
  5792. profileInitPatchPosition := profileInit.pc;
  5793. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5794. NEW(string, LEN(name)); COPY(name, string^);
  5795. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5796. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5797. sv.SetType(type);
  5798. Designate(sv,result);
  5799. profileInit.Emit(Push(position,result.tag));
  5800. profileInit.Emit(Push(position,result.op));
  5801. StaticCallOperand(result,procedure);
  5802. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5803. ReleaseOperand(result);
  5804. END;
  5805. END ProfilerAddModule;
  5806. PROCEDURE ProfilerPatchInit;
  5807. VAR reg: IntermediateCode.Operand;
  5808. BEGIN
  5809. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5810. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5811. EmitLeave(profileInit,position,NIL,0);
  5812. profileInit.Emit(Exit(position,0,0,0));
  5813. END ProfilerPatchInit;
  5814. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5815. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5816. VAR
  5817. id: LONGINT;
  5818. leftType, rightType: SyntaxTree.Type;
  5819. procedureType: SyntaxTree.ProcedureType;
  5820. runtimeProcedure: SyntaxTree.Procedure;
  5821. runtimeProcedureOperand, operatorOperand: Operand;
  5822. kind: SET;
  5823. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5824. VAR
  5825. arg: IntermediateCode.Operand;
  5826. recordType: SyntaxTree.RecordType;
  5827. fingerPrint: SyntaxTree.FingerPrint;
  5828. BEGIN
  5829. IF type = NIL THEN
  5830. (* no type: push 'NoType' *)
  5831. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5832. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5833. ELSIF IsStrictlyPointerToRecord(type) THEN
  5834. (* pointer to record type: push typetag *)
  5835. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5836. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5837. arg := TypeDescriptorAdr(recordType);
  5838. ELSE
  5839. (* non-pointer to record type: push fingerprint *)
  5840. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5841. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5842. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5843. END;
  5844. operatorInitializationCodeSection.Emit(Push(position,arg))
  5845. END PushTypeInfo;
  5846. BEGIN
  5847. ASSERT(operatorInitializationCodeSection # NIL);
  5848. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5849. procedureType := operator.type(SyntaxTree.ProcedureType);
  5850. (* determine types *)
  5851. leftType := procedureType.firstParameter.type;
  5852. IF procedureType.numberParameters = 2 THEN
  5853. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5854. rightType := procedureType.firstParameter.nextParameter.type;
  5855. ELSE
  5856. rightType := NIL
  5857. END;
  5858. (* determine operator kind *)
  5859. IF IsStrictlyPointerToRecord(leftType) THEN
  5860. kind := {LhsIsPointer}
  5861. ELSE
  5862. kind := {}
  5863. END;
  5864. IF IsStrictlyPointerToRecord(rightType) THEN
  5865. kind := kind + {RhsIsPointer}
  5866. END;
  5867. IF kind # {} THEN (* TODO: to be removed later on *)
  5868. (* at least one of the types is a pointer to record *)
  5869. (* emit a code that registers this specific operator in the runtime *)
  5870. dump := operatorInitializationCodeSection.comments;
  5871. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5872. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5873. (* push ID *)
  5874. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5875. id := Global.GetSymbol(module.module.case, operator.name);
  5876. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5877. (* push kind *)
  5878. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5879. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5880. (* push type infos *)
  5881. PushTypeInfo(leftType);
  5882. PushTypeInfo(rightType);
  5883. (* push operator address *)
  5884. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5885. StaticCallOperand(operatorOperand, operator);
  5886. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5887. ReleaseOperand(operatorOperand);
  5888. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5889. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5890. ReleaseOperand(runtimeProcedureOperand)
  5891. END
  5892. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5893. END
  5894. END RegisterDynamicOperator;
  5895. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5896. VAR
  5897. traceModule: SyntaxTree.Module;
  5898. procedure: SyntaxTree.Procedure;
  5899. procedureVariable: SyntaxTree.Variable;
  5900. s,msg: Basic.MessageString;
  5901. res: Operand;
  5902. i: LONGINT;
  5903. sv: SyntaxTree.StringValue;
  5904. type: SyntaxTree.Type;
  5905. recordType: SyntaxTree.RecordType;
  5906. printout: Printout.Printer;
  5907. stringWriter: Streams.StringWriter;
  5908. expression: SyntaxTree.Expression;
  5909. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5910. BEGIN
  5911. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5912. IF procedure = NIL THEN
  5913. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5914. END;
  5915. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5916. s := "procedure ";
  5917. Strings.Append(s,backend.traceModuleName);
  5918. Strings.Append(s,".");
  5919. Strings.Append(s,procedureName);
  5920. Strings.Append(s," not present");
  5921. Error(position,s);
  5922. RETURN FALSE
  5923. ELSE
  5924. RETURN TRUE
  5925. END;
  5926. END GetProcedure;
  5927. PROCEDURE CallProcedure;
  5928. VAR size: LONGINT;
  5929. BEGIN
  5930. IF procedure # NIL THEN
  5931. StaticCallOperand(result,procedure);
  5932. size := ProcParametersSize(procedure);
  5933. ELSE
  5934. Symbol(procedureVariable, result);
  5935. LoadValue(result, procedureVariable.type.resolved);
  5936. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5937. END;
  5938. Emit(Call(position,result.op,size));
  5939. END CallProcedure;
  5940. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5941. VAR res: Operand; string: SyntaxTree.String;
  5942. BEGIN
  5943. IF GetProcedure("String") THEN
  5944. NEW(string, LEN(s)); COPY(s, string^);
  5945. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5946. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5947. sv.SetType(type);
  5948. Designate(sv,res);
  5949. Emit(Push(position,res.tag));
  5950. Emit(Push(position,res.op));
  5951. ReleaseOperand(res);
  5952. CallProcedure;
  5953. END;
  5954. END String;
  5955. PROCEDURE Integer(op: IntermediateCode.Operand);
  5956. BEGIN
  5957. IF GetProcedure("Int") THEN
  5958. Emit(Push(position,op));
  5959. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5960. CallProcedure;
  5961. END;
  5962. END Integer;
  5963. PROCEDURE Float(op: IntermediateCode.Operand);
  5964. BEGIN
  5965. IF GetProcedure("HIntHex") THEN
  5966. Emit(Push(position,op));
  5967. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5968. CallProcedure;
  5969. END;
  5970. END Float;
  5971. PROCEDURE Set(op: IntermediateCode.Operand);
  5972. BEGIN
  5973. IF GetProcedure("Set") THEN
  5974. Emit(Push(position,op));
  5975. (*
  5976. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5977. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5978. *)
  5979. CallProcedure;
  5980. END;
  5981. END Set;
  5982. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5983. BEGIN
  5984. IF GetProcedure("Boolean") THEN
  5985. Emit(Push(position,op));
  5986. CallProcedure;
  5987. END;
  5988. END Boolean;
  5989. PROCEDURE Char(op: IntermediateCode.Operand);
  5990. BEGIN
  5991. IF GetProcedure("Char") THEN
  5992. Emit(Push(position,op));
  5993. CallProcedure;
  5994. END;
  5995. END Char;
  5996. PROCEDURE Address(op: IntermediateCode.Operand);
  5997. BEGIN
  5998. IF GetProcedure("Address") THEN
  5999. Emit(Push(position,op));
  6000. CallProcedure;
  6001. END;
  6002. END Address;
  6003. PROCEDURE Size(op: IntermediateCode.Operand);
  6004. BEGIN
  6005. IF GetProcedure("Size") THEN
  6006. Emit(Push(position,op));
  6007. CallProcedure;
  6008. END;
  6009. END Size;
  6010. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6011. VAR len: IntermediateCode.Operand;
  6012. BEGIN
  6013. IF GetProcedure("String") THEN
  6014. len := GetArrayLength(type, op.tag);
  6015. Emit(Push(position,len));
  6016. ReleaseIntermediateOperand(len);
  6017. Emit(Push(position,op.op));
  6018. CallProcedure;
  6019. END;
  6020. END StringOperand;
  6021. PROCEDURE Ln;
  6022. BEGIN
  6023. IF GetProcedure("Ln") THEN
  6024. CallProcedure;
  6025. END;
  6026. END Ln;
  6027. BEGIN
  6028. IF backend.traceModuleName = "" THEN RETURN END;
  6029. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6030. IF GetProcedure("Enter") THEN
  6031. CallProcedure
  6032. END;
  6033. NEW(stringWriter,LEN(s));
  6034. FOR i := 0 TO x.Length()-1 DO
  6035. msg := "";
  6036. expression := x.GetExpression(i);
  6037. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6038. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6039. ELSE
  6040. Global.GetModuleName(module.module, s);
  6041. END;
  6042. IF i = 0 THEN
  6043. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6044. stringWriter.String(":");
  6045. END;
  6046. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6047. IF ~(expression IS SyntaxTree.StringValue) THEN
  6048. printout.Expression(expression);
  6049. stringWriter.Get(s);
  6050. Strings.Append(msg,s);
  6051. Strings.Append(msg,"= ");
  6052. ELSE stringWriter.Get(s); (* remove from string writer *)
  6053. Strings.Append(msg, s);
  6054. END;
  6055. String(msg);
  6056. IF SemanticChecker.IsStringType(expression.type) THEN
  6057. Designate(expression,res);
  6058. StringOperand(res, expression.type);
  6059. ELSE
  6060. Evaluate(expression,res);
  6061. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6062. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6063. Convert(res.op,int64);
  6064. END;
  6065. Integer(res.op);
  6066. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6067. Boolean(res.op);
  6068. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6069. Set(res.op);
  6070. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6071. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6072. Convert(res.op,float64);
  6073. END;
  6074. Float(res.op);
  6075. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6076. Char(res.op);
  6077. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6078. Address(res.op);String("H");
  6079. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6080. Size(res.op);
  6081. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6082. Address(res.op);String("H");
  6083. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6084. Address(res.op);String("H");
  6085. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6086. String("NIL");
  6087. ELSE HALT(200);
  6088. END;
  6089. END;
  6090. ReleaseOperand(res);
  6091. String("; ");
  6092. END;
  6093. IF GetProcedure("Exit") THEN
  6094. CallProcedure
  6095. ELSE
  6096. Ln;
  6097. END;
  6098. END;
  6099. END SystemTrace;
  6100. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6101. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6102. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6103. BEGIN
  6104. type := type.resolved;
  6105. IF type IS SyntaxTree.RecordType THEN
  6106. WITH type: SyntaxTree.RecordType DO
  6107. baseType := type.baseType;
  6108. IF baseType # NIL THEN
  6109. baseType := baseType.resolved;
  6110. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6111. InitFields(baseType,adr,offset);
  6112. END;
  6113. variable := type.recordScope.firstVariable;
  6114. WHILE variable # NIL DO
  6115. IF variable.initializer # NIL THEN
  6116. Evaluate(variable.initializer,initializerOp);
  6117. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6118. Emit(Mov(position,mem,initializerOp.op));
  6119. ReleaseOperand(initializerOp);
  6120. ReleaseIntermediateOperand(mem);
  6121. END;
  6122. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6123. variable := variable.nextVariable
  6124. END;
  6125. END;
  6126. ELSIF type IS SyntaxTree.CellType THEN
  6127. WITH type: SyntaxTree.CellType DO
  6128. baseType := type.baseType;
  6129. IF baseType # NIL THEN
  6130. baseType := baseType.resolved;
  6131. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6132. InitFields(baseType,adr,offset);
  6133. END;
  6134. variable := type.cellScope.firstVariable;
  6135. WHILE variable # NIL DO
  6136. IF variable.initializer # NIL THEN
  6137. Evaluate(variable.initializer,initializerOp);
  6138. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6139. Emit(Mov(position,mem,initializerOp.op));
  6140. ReleaseOperand(initializerOp);
  6141. ReleaseIntermediateOperand(mem);
  6142. END;
  6143. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6144. variable := variable.nextVariable
  6145. END;
  6146. END;
  6147. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6148. WITH type: SyntaxTree.ArrayType DO
  6149. IF type.form = SyntaxTree.Static THEN
  6150. baseType := type.arrayBase;
  6151. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6152. FOR i := 0 TO type.staticLength-1 DO
  6153. InitFields(baseType,adr,offset+i*size);
  6154. END;
  6155. END;
  6156. END;
  6157. ELSIF type IS SyntaxTree.MathArrayType THEN
  6158. WITH type: SyntaxTree.MathArrayType DO
  6159. IF type.form = SyntaxTree.Open THEN
  6160. dim := DynamicDim(type);
  6161. imm := IntermediateCode.Immediate(addressType,dim);
  6162. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6163. baseType := SemanticChecker.ArrayBase(type,dim);
  6164. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6165. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6166. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6167. ReleaseIntermediateOperand(imm);
  6168. (* flags remain empty (=0) for open array *)
  6169. ELSIF type.form = SyntaxTree.Static THEN
  6170. baseType := type.arrayBase;
  6171. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6172. ASSERT(type.staticLength < 1024*1024*1024);
  6173. FOR i := 0 TO type.staticLength-1 DO
  6174. InitFields(baseType,adr,offset+i*size);
  6175. END;
  6176. END;
  6177. END;
  6178. END;
  6179. END InitFields;
  6180. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6181. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6182. saved: RegisterEntry;
  6183. BEGIN
  6184. type := variable.type.resolved;
  6185. IF (type IS SyntaxTree.MathArrayType) THEN
  6186. WITH type: SyntaxTree.MathArrayType DO
  6187. IF type.form = SyntaxTree.Open THEN
  6188. Symbol(variable,operand);
  6189. InitFields(type, operand.tag,0);
  6190. IF temporary THEN
  6191. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6192. END;
  6193. ELSIF type.form = SyntaxTree.Tensor THEN
  6194. IF temporary & backend.writeBarriers THEN
  6195. SaveRegisters();ReleaseUsedRegisters(saved);
  6196. Symbol(variable, operand);
  6197. Emit(Push(position,operand.op));
  6198. ReleaseOperand(operand);
  6199. Emit(Push(position,nil));
  6200. CallThis(position,"FoxArrayBase","Assign",2);
  6201. RestoreRegisters(saved);
  6202. ELSE
  6203. Symbol(variable, operand);
  6204. MakeMemory(tmp,operand.op,addressType,0);
  6205. ReleaseOperand(operand);
  6206. IF FALSE & temporary THEN
  6207. (* trick -- temporary object from array base *)
  6208. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6209. Symbol(symbol,operand);
  6210. MakeMemory(mem,operand.op,addressType,0);
  6211. ReleaseOperand(operand);
  6212. Emit(Mov(position,tmp, mem) );
  6213. ReleaseOperand(operand);
  6214. ELSE
  6215. Emit(Mov(position,tmp, nil ) );
  6216. END;
  6217. ReleaseIntermediateOperand(tmp)
  6218. END;
  6219. END;
  6220. END;
  6221. ELSE
  6222. Symbol(variable,operand);
  6223. IF variable.initializer # NIL THEN
  6224. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6225. reference.SetType(variable.type.resolved);
  6226. reference.SetAssignable(TRUE);
  6227. Assign(reference,variable.initializer);
  6228. ELSIF temporary THEN
  6229. IF SemanticChecker.IsPointerType(variable.type) THEN
  6230. IF backend.cooperative THEN
  6231. SaveRegisters();ReleaseUsedRegisters(saved);
  6232. Symbol(variable, operand);
  6233. CallAssignPointer(operand.op, nil);
  6234. ReleaseOperand(operand);
  6235. RestoreRegisters(saved);
  6236. ELSIF backend.writeBarriers THEN
  6237. SaveRegisters();ReleaseUsedRegisters(saved);
  6238. Symbol(variable, operand);
  6239. Emit(Push(position,operand.op));
  6240. ReleaseOperand(operand);
  6241. Emit(Push(position,nil));
  6242. CallThis(position,"Heaps","Assign",2);
  6243. RestoreRegisters(saved);
  6244. ELSE
  6245. Symbol(variable, operand);
  6246. MakeMemory(tmp,operand.op,addressType,0);
  6247. ReleaseOperand(operand);
  6248. Emit(Mov(position,tmp, nil ) );
  6249. ReleaseIntermediateOperand(tmp);
  6250. END;
  6251. END;
  6252. END;
  6253. InitFields(type, operand.op,0);
  6254. ReleaseOperand(operand);
  6255. END;
  6256. END InitVariable;
  6257. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6258. VAR end: Label;
  6259. BEGIN
  6260. IF type.form = SyntaxTree.Tensor THEN
  6261. InitOperand(result,ModeValue);
  6262. ReuseCopy(result.op,base);
  6263. end := NewLabel();
  6264. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6265. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6266. SetLabel(end);
  6267. Convert(result.op,lenType);
  6268. ELSE
  6269. InitOperand(result,ModeValue);
  6270. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6271. END
  6272. END MathArrayDim;
  6273. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6274. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6275. BEGIN
  6276. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6277. MakeMemory(mem,base,addressType,offset);
  6278. Emit(Mov(position,mem,value));
  6279. ReleaseIntermediateOperand(mem);
  6280. END PutMathArrayField;
  6281. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6282. VAR mem: IntermediateCode.Operand;
  6283. BEGIN
  6284. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6285. MakeMemory(mem,base,addressType,offset);
  6286. Emit(Mov(position,mem,value));
  6287. ReleaseIntermediateOperand(mem);
  6288. END PutMathArrayFieldOffset;
  6289. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6290. BEGIN
  6291. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6292. MakeMemory(value,base,addressType,offset);
  6293. END GetMathArrayField;
  6294. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6295. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6296. BEGIN
  6297. IF incr THEN
  6298. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6299. ELSE
  6300. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6301. END;
  6302. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6303. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6304. ELSE
  6305. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6306. Emit(Mov(position,reg,dim));
  6307. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6308. Emit(Add(position,reg,reg,base));
  6309. MakeMemory(mem, reg, addressType, offset);
  6310. ReleaseIntermediateOperand(reg);
  6311. Emit(Mov(position,mem,value));
  6312. ReleaseIntermediateOperand(mem);
  6313. END;
  6314. END PutMathArrayLenOrIncr;
  6315. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6316. BEGIN
  6317. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6318. END PutMathArrayLength;
  6319. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6320. BEGIN
  6321. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6322. END PutMathArrayIncrement;
  6323. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6324. BEGIN
  6325. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6326. END GetMathArrayIncrement;
  6327. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6328. BEGIN
  6329. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6330. END GetMathArrayLength;
  6331. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6332. VAR dimOp: IntermediateCode.Operand;
  6333. BEGIN
  6334. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6335. GetMathArrayLength(type, operand, dimOp, check, result);
  6336. END GetMathArrayLengthAt;
  6337. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6338. VAR dimOp: IntermediateCode.Operand;
  6339. BEGIN
  6340. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6341. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6342. END GetMathArrayIncrementAt;
  6343. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6344. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6345. offset: LONGINT;
  6346. BEGIN
  6347. IF increment THEN
  6348. offset := MathIncrOffset;
  6349. ELSE
  6350. offset := MathLenOffset;
  6351. END;
  6352. INC(offset,operand.dimOffset*2);
  6353. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6354. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6355. END;
  6356. (* static dimension *)
  6357. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6358. IF check & (type.form = SyntaxTree.Tensor) THEN
  6359. DimensionCheck(operand.tag,dim,BrltL);
  6360. END;
  6361. val := SHORT(dim.intValue);
  6362. IF type.form # SyntaxTree.Tensor THEN
  6363. t := SemanticChecker.ArrayBase(type,val);
  6364. type := t.resolved(SyntaxTree.MathArrayType);
  6365. IF type.form = SyntaxTree.Static THEN
  6366. IF increment THEN
  6367. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6368. ELSE
  6369. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6370. END;
  6371. InitOperand(result,ModeValue);
  6372. result.op := res;
  6373. RETURN;
  6374. END;
  6375. END;
  6376. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6377. MakeMemory(res,operand.tag,addressType,offset);
  6378. (*
  6379. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6380. *)
  6381. InitOperand(result,ModeValue);
  6382. result.op := res;
  6383. ELSE
  6384. Convert(dim,addressType);
  6385. IF check THEN
  6386. IF type.form = SyntaxTree.Tensor THEN
  6387. DimensionCheck(operand.tag,dim,BrltL);
  6388. ELSIF isUnchecked THEN (* do nothing *)
  6389. ELSE
  6390. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6391. END;
  6392. END;
  6393. end := NewLabel(); next := NIL;
  6394. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6395. Emit(Mov(position,res,dim));
  6396. Convert(res,sizeType);
  6397. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6398. WHILE t IS SyntaxTree.MathArrayType DO
  6399. type := t(SyntaxTree.MathArrayType);
  6400. IF type.form = SyntaxTree.Static THEN
  6401. imm := IntermediateCode.Immediate(sizeType,val);
  6402. next := NewLabel();
  6403. BrneL(next,imm,res);
  6404. IF increment THEN
  6405. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6406. ELSE
  6407. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6408. END;
  6409. Emit(MovReplace(position,res,imm));
  6410. BrL(end);
  6411. ELSE hasDynamicPart := TRUE;
  6412. END;
  6413. t := type.arrayBase.resolved;
  6414. val := val + 1;
  6415. IF next # NIL THEN SetLabel(next) END;
  6416. END;
  6417. IF hasDynamicPart THEN
  6418. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6419. Emit(Mov(position,res2,dim));
  6420. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6421. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6422. Emit(Add(position,res2,res2,imm));
  6423. Emit(Add(position,res2,res2,operand.tag));
  6424. IntermediateCode.MakeMemory(res2,sizeType);
  6425. Emit(MovReplace(position,res,res2));
  6426. ReleaseIntermediateOperand(res2);
  6427. END;
  6428. SetLabel(end);
  6429. Convert(res,sizeType);
  6430. InitOperand(result,ModeValue);
  6431. result.op := res;
  6432. END;
  6433. END MathArrayLenOrIncr;
  6434. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6435. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6436. offset: LONGINT;
  6437. BEGIN
  6438. offset := operand.dimOffset+DynamicDim(type)-1;
  6439. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6440. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6441. val := SHORT(dim.intValue);
  6442. t := SemanticChecker.ArrayBase(type,val);
  6443. type := t.resolved(SyntaxTree.ArrayType);
  6444. IF type.form = SyntaxTree.Static THEN
  6445. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6446. ELSE
  6447. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6448. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6449. END;
  6450. UseIntermediateOperand(res);
  6451. InitOperand(result,ModeValue);
  6452. result.op := res;
  6453. ELSE
  6454. Convert(dim,addressType);
  6455. IF ~isUnchecked THEN
  6456. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6457. END;
  6458. end := NewLabel(); next := NIL;
  6459. (* ReuseCopy(dim,res); *)
  6460. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6461. Emit(Mov(position,res,dim));
  6462. Convert(res,sizeType);
  6463. Convert(res,sizeType);
  6464. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6465. WHILE t IS SyntaxTree.ArrayType DO
  6466. type := t(SyntaxTree.ArrayType);
  6467. IF type.form = SyntaxTree.Static THEN
  6468. imm := IntermediateCode.Immediate(sizeType,val);
  6469. next := NewLabel();
  6470. BrneL(next,imm,res);
  6471. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6472. Emit(MovReplace(position,res,imm));
  6473. BrL(end);
  6474. ELSE hasDynamicPart := TRUE;
  6475. END;
  6476. t := type.arrayBase.resolved;
  6477. val := val + 1;
  6478. IF next # NIL THEN SetLabel(next) END;
  6479. END;
  6480. IF hasDynamicPart THEN
  6481. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6482. Convert(res2,addressType);
  6483. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6484. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6485. Emit(Sub(position,res2,imm,res2));
  6486. Emit(Add(position,res2,res2,operand.tag));
  6487. IntermediateCode.MakeMemory(res2,sizeType);
  6488. Emit(MovReplace(position,res,res2));
  6489. ReleaseIntermediateOperand(res2);
  6490. END;
  6491. SetLabel(end);
  6492. Convert(res,sizeType);
  6493. InitOperand(result,ModeValue);
  6494. result.op := res;
  6495. END;
  6496. END ArrayLen;
  6497. (**
  6498. create a temporary variable in current scope
  6499. **)
  6500. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6501. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6502. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6503. BEGIN
  6504. IF ~register THEN
  6505. v := temporaries.GetFreeVariable(type, untraced, index);
  6506. ELSE
  6507. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6508. END;
  6509. scope := currentScope;
  6510. (*
  6511. v := NIL; (* disable free variable managemenet for the time being *)
  6512. *)
  6513. name := temporaries.GetUID();
  6514. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6515. variable.SetType(type);
  6516. variable.SetAccess(SyntaxTree.Hidden);
  6517. variable.SetUntraced(untraced);
  6518. IF v = NIL THEN
  6519. temporaries.AddVariable(variable);
  6520. IF ~register THEN
  6521. IF scope.lastVariable # NIL THEN
  6522. offset := scope.lastVariable.offsetInBits;
  6523. ELSE
  6524. offset := 0;
  6525. END;
  6526. DEC(offset,system.SizeOf(variable.type));
  6527. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6528. variable(SyntaxTree.Variable).SetOffset(offset);
  6529. scope.AddVariable(variable(SyntaxTree.Variable));
  6530. scope.EnterSymbol(variable, duplicate);
  6531. ASSERT(~duplicate);
  6532. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6533. ELSE
  6534. variable.SetUseRegister(TRUE);
  6535. variable(SyntaxTree.Variable).SetOffset(0);
  6536. END;
  6537. ELSE (* v # NIL *)
  6538. (* reuse slot for new variable, do not create new slot ! *)
  6539. temporaries.SetVariable(index, variable);
  6540. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6541. ASSERT(~register);
  6542. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6543. ASSERT(v.offsetInBits # 0);
  6544. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6545. scope.EnterSymbol(variable, duplicate);
  6546. ASSERT(~duplicate);
  6547. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6548. END;
  6549. RETURN variable(SyntaxTree.Variable)
  6550. END GetTemporaryVariable;
  6551. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6552. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6553. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6554. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6555. i: LONGINT; duplicate: BOOLEAN;
  6556. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6557. VAR variable: SyntaxTree.Variable;
  6558. BEGIN
  6559. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6560. variable.SetType(type);
  6561. recordScope.AddVariable(variable);
  6562. END AddVariable;
  6563. BEGIN
  6564. name := "@ArrayDescriptor";
  6565. Basic.AppendNumber(name,dimensions);
  6566. identifier := SyntaxTree.NewIdentifier(name);
  6567. parentScope := module.module.moduleScope;
  6568. symbol := parentScope.FindSymbol(identifier);
  6569. IF symbol # NIL THEN
  6570. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6571. type := typeDeclaration.declaredType;
  6572. ELSE
  6573. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6574. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6575. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6576. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6577. recordType.SetTypeDeclaration(typeDeclaration);
  6578. recordType.SetState(SyntaxTree.Resolved);
  6579. typeDeclaration.SetDeclaredType(recordType);
  6580. AddVariable("@ptr",system.anyType);
  6581. AddVariable("@adr",system.addressType);
  6582. AddVariable("@flags",system.addressType);
  6583. AddVariable("@dim",system.addressType);
  6584. AddVariable("@elementSize",system.addressType);
  6585. FOR i := 0 TO dimensions-1 DO
  6586. name := "@len";
  6587. Basic.AppendNumber(name,i);
  6588. AddVariable(name,system.addressType);
  6589. name := "@incr";
  6590. Basic.AppendNumber(name,i);
  6591. AddVariable(name,system.addressType);
  6592. END;
  6593. parentScope.AddTypeDeclaration(typeDeclaration);
  6594. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6595. ASSERT(~duplicate);
  6596. type := recordType;
  6597. END;
  6598. RETURN type
  6599. END GetMathArrayDescriptorType;
  6600. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6601. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6602. BEGIN
  6603. type := GetMathArrayDescriptorType(dimensions);
  6604. Emit(Push(position,op.op));
  6605. (* push type descriptor *)
  6606. reg := TypeDescriptorAdr(type);
  6607. Emit(Push(position,reg));
  6608. ReleaseIntermediateOperand(reg);
  6609. (* push realtime flag: false by default *)
  6610. Emit(Push(position,false));
  6611. CallThis(position,"Heaps","NewRec",3);
  6612. END NewMathArrayDescriptor;
  6613. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6614. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6615. BEGIN
  6616. NEW(string, LEN(s)); COPY(s, string^);
  6617. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6618. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6619. sv.SetType(type);
  6620. Designate(sv,res);
  6621. Emit(Push(position,res.tag));
  6622. Emit(Push(position,res.op));
  6623. ReleaseOperand(res);
  6624. END PushConstString;
  6625. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6626. BEGIN
  6627. IF b THEN
  6628. Emit(Push(Basic.invalidPosition, true));
  6629. ELSE
  6630. Emit(Push(Basic.invalidPosition, false));
  6631. END;
  6632. END PushConstBoolean;
  6633. PROCEDURE PushConstSet(v: SET);
  6634. VAR value: SyntaxTree.Value; op: Operand;
  6635. BEGIN
  6636. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6637. value.SetType(system.setType);
  6638. Evaluate(value, op);
  6639. Emit(Push(Basic.invalidPosition, op.op));
  6640. ReleaseOperand(op);
  6641. END PushConstSet;
  6642. PROCEDURE PushConstInteger(v: LONGINT);
  6643. VAR value: SyntaxTree.Value; op: Operand;
  6644. BEGIN
  6645. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6646. value.SetType(system.longintType);
  6647. Evaluate(value, op);
  6648. Emit(Push(Basic.invalidPosition, op.op));
  6649. ReleaseOperand(op);
  6650. END PushConstInteger;
  6651. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6652. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6653. section: IntermediateCode.Section;
  6654. BEGIN
  6655. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6656. Global.GetSymbolSegmentedName(symbol, name);
  6657. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6658. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6659. procedure.SetScope(moduleScope);
  6660. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6661. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6662. procedure.SetAccess(SyntaxTree.Hidden);
  6663. currentScope := procedureScope;
  6664. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6665. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6666. RETURN section;
  6667. END OpenInitializer;
  6668. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6669. BEGIN
  6670. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6671. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6672. section := prev;
  6673. END CloseInitializer;
  6674. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6675. VAR name: SyntaxTree.IdentifierString;
  6676. variable: SyntaxTree.Variable;
  6677. parameter: SyntaxTree.Parameter;
  6678. type: SyntaxTree.Type;
  6679. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6680. BEGIN
  6681. InitOperand(op,ModeReference);
  6682. op.op := fp;
  6683. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6684. Dereference(op, x, FALSE);
  6685. result := op;
  6686. Symbol(symbol, op);
  6687. END Field;
  6688. PROCEDURE Direction(direction: LONGINT): SET;
  6689. BEGIN
  6690. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6691. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6692. ELSE HALT(100);
  6693. END;
  6694. END Direction;
  6695. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6696. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6697. BEGIN
  6698. Field(port, op);
  6699. ToMemory(op.op,addressType,0);
  6700. Emit(Push(Basic.invalidPosition, op.op));
  6701. ReleaseOperand(op);
  6702. Basic.GetString(modifier.identifier, name);
  6703. PushConstString(name);
  6704. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6705. ASSERT(SemanticChecker.IsStringType(value.type));
  6706. Designate(value, op);
  6707. Emit(Push(modifier.position, op.tag));
  6708. Emit(Push(modifier.position, op.op));
  6709. ReleaseOperand(op);
  6710. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6711. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6712. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6713. Evaluate(value, op);
  6714. Emit(Push(modifier.position, op.op));
  6715. ReleaseOperand(op);
  6716. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6717. ELSE
  6718. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6719. END;
  6720. END AddPortProperty;
  6721. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6722. VAR modifier: SyntaxTree.Modifier;
  6723. BEGIN
  6724. modifier := parameter.modifiers;
  6725. WHILE modifier # NIL DO
  6726. AddPortProperty(parameter,modifier, modifier.expression);
  6727. modifier := modifier.nextModifier;
  6728. END;
  6729. END AddPortProperties;
  6730. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6731. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6732. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6733. PROCEDURE PushLens(type: SyntaxTree.Type);
  6734. BEGIN
  6735. IF IsSemiDynamicArray(type) THEN
  6736. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6737. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6738. Emit(Push(Basic.invalidPosition, op.op));
  6739. ReleaseOperand(op);
  6740. INC(dim);
  6741. ELSIF IsStaticArray(type) THEN
  6742. len := len * type(SyntaxTree.ArrayType).staticLength;
  6743. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6744. INC(dim);
  6745. ELSE
  6746. baseType := type;
  6747. END;
  6748. END PushLens;
  6749. BEGIN
  6750. (* cell *)
  6751. IF parameter.type IS SyntaxTree.ArrayType THEN
  6752. type := parameter.type;
  6753. dim := 0;
  6754. len := 1;
  6755. PushLens(type);
  6756. portType := baseType.resolved(SyntaxTree.PortType);
  6757. ELSE
  6758. portType := parameter.type(SyntaxTree.PortType);
  6759. END;
  6760. PushSelfPointer();
  6761. (* port / array of ports *)
  6762. IF IsStaticArray(type) THEN
  6763. PushConstInteger(len);
  6764. END;
  6765. Field(parameter, op);
  6766. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6767. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6768. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6769. Designate(d, op);*)
  6770. Emit(Push(Basic.invalidPosition, op.op));
  6771. ReleaseOperand(op);
  6772. (* name *)
  6773. PushConstString(name);
  6774. (* inout *)
  6775. PushConstSet(Direction(portType.direction));
  6776. (* width *)
  6777. PushConstInteger(portType.sizeInBits);
  6778. IF parameter.type IS SyntaxTree.PortType THEN
  6779. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6780. AddPortProperties(parameter);
  6781. ELSIF IsStaticArray(type)THEN
  6782. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6783. ELSIF IsSemiDynamicArray(type) THEN
  6784. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6785. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6786. Emit(Add(position,reg, sp, size));
  6787. (* dim *)
  6788. PushConstInteger(dim);
  6789. (* len array *)
  6790. Emit(Push(position, reg));
  6791. ReleaseIntermediateOperand(reg);
  6792. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6793. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6794. Emit(Add(position, sp,sp, size));
  6795. ELSE
  6796. HALT(100);
  6797. END;
  6798. END Parameter;
  6799. BEGIN
  6800. IF backend.cellsAreObjects THEN
  6801. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6802. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6803. END;
  6804. parameter := x.firstParameter;
  6805. WHILE (parameter # NIL) DO
  6806. type := parameter.type.resolved;
  6807. WHILE (type IS SyntaxTree.ArrayType) DO
  6808. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6809. END;
  6810. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6811. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6812. Parameter(name,parameter);
  6813. END;
  6814. parameter := parameter.nextParameter;
  6815. END;
  6816. ELSE HALT(200)
  6817. END;
  6818. END AddPorts;
  6819. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6820. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6821. BEGIN
  6822. Symbol(cell,op);
  6823. ToMemory(op.op,addressType,0);
  6824. Emit(Push(position,op.op));
  6825. ReleaseOperand(op);
  6826. property.GetName(name);
  6827. (* does not work when inheritance is used:
  6828. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6829. *)
  6830. PushConstString(name);
  6831. IF (value # NIL) THEN
  6832. ASSERT(
  6833. SemanticChecker.IsStringType(property.type)
  6834. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6835. OR (property.type.resolved IS SyntaxTree.FloatType)
  6836. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6837. OR (property.type.resolved IS SyntaxTree.SetType)
  6838. );
  6839. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6840. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6841. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6842. Designate(d, op);
  6843. IF SemanticChecker.IsStringType(property.type) THEN
  6844. Emit(Push(Basic.invalidPosition, op.tag))
  6845. END;
  6846. Emit(Push(Basic.invalidPosition, op.op));
  6847. ReleaseOperand(op);
  6848. END;
  6849. IF value = NIL THEN
  6850. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6851. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6852. ASSERT(SemanticChecker.IsStringType(value.type));
  6853. Designate(value, op);
  6854. PushString(op, value.type);
  6855. ReleaseOperand(op);
  6856. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6857. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6858. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6859. Evaluate(value, op);
  6860. Emit(Push(property.position, op.op));
  6861. ReleaseOperand(op);
  6862. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6863. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6864. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6865. Evaluate(value, op);
  6866. Emit(Push(property.position, op.op));
  6867. ReleaseOperand(op);
  6868. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6869. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6870. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6871. Evaluate(value, op);
  6872. Emit(Push(property.position, op.op));
  6873. ReleaseOperand(op);
  6874. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6875. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6876. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6877. Evaluate(value, op);
  6878. Emit(Push(property.position, op.op));
  6879. ReleaseOperand(op);
  6880. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6881. ELSE
  6882. HALT(200);
  6883. END;
  6884. END AddProperty;
  6885. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6886. VAR symbol: SyntaxTree.Symbol;
  6887. BEGIN
  6888. WHILE modifier # NIL DO
  6889. symbol := cellType.FindProperty(modifier.identifier);
  6890. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6891. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6892. modifier := modifier.nextModifier;
  6893. END;
  6894. END AddModifiers;
  6895. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6896. VAR last: SyntaxTree.Modifier;
  6897. BEGIN
  6898. IF to = NIL THEN
  6899. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6900. ELSE
  6901. last := to;
  6902. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6903. last := last.nextModifier;
  6904. END;
  6905. IF last.identifier # this.identifier THEN
  6906. ASSERT(last.nextModifier = NIL);
  6907. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6908. END;
  6909. END;
  6910. END AppendModifier;
  6911. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6912. BEGIN
  6913. WHILE this # NIL DO
  6914. AppendModifier(to, this);
  6915. this := this.nextModifier;
  6916. END;
  6917. END AppendModifiers;
  6918. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6919. VAR base: SyntaxTree.Type;
  6920. BEGIN
  6921. AppendModifiers(to, c.modifiers);
  6922. base := c.GetBaseValueType();
  6923. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6924. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6925. END;
  6926. END AppendCellTypeModifiers;
  6927. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6928. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6929. BEGIN
  6930. Basic.GetString(modifier.identifier, name);
  6931. PushConstString(name);
  6932. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6933. ASSERT(SemanticChecker.IsStringType(value.type));
  6934. Designate(value, op);
  6935. PushString(op, value.type);
  6936. ReleaseOperand(op);
  6937. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6938. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6939. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6940. Evaluate(value, op);
  6941. Emit(Push(modifier.position, op.op));
  6942. ReleaseOperand(op);
  6943. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6944. ELSE
  6945. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6946. END;
  6947. END AddPortProperty;
  6948. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6949. BEGIN
  6950. WHILE modifier # NIL DO
  6951. AddPortProperty(modifier, modifier.expression);
  6952. modifier := modifier.nextModifier;
  6953. END;
  6954. END AddPortProperties;
  6955. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6956. VAR op: Operand;
  6957. BEGIN
  6958. Evaluate(p, op);
  6959. Emit(Push(p.position, op.op));
  6960. ReleaseOperand(op);
  6961. IF p IS SyntaxTree.Designator THEN
  6962. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6963. END;
  6964. END PushPort;
  6965. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6966. VAR tmp: IntermediateCode.Operand;
  6967. BEGIN
  6968. actualType := actualType.resolved;
  6969. IF actualType IS SyntaxTree.StringType THEN
  6970. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6971. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6972. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6973. ELSE
  6974. tmp := op.tag;
  6975. IntermediateCode.MakeMemory(tmp,addressType);
  6976. Emit(Push(position,tmp));
  6977. END;
  6978. Emit(Push(position,op.op))
  6979. END PushString;
  6980. (* conservative check if x is potentially on the heap, excluding the module heap
  6981. required for generational garbage collector
  6982. *)
  6983. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6984. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6985. BEGIN
  6986. RETURN TRUE;
  6987. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6988. passed by reference.
  6989. pos := x.position.start;
  6990. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6991. x := x(SyntaxTree.Designator).left;
  6992. END;
  6993. RETURN x # NIL;
  6994. *)
  6995. END OnHeap;
  6996. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6997. VAR
  6998. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6999. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7000. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7001. tmp:IntermediateCode.Operand;
  7002. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  7003. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7004. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7005. dest: IntermediateCode.Operand;
  7006. staticLength: LONGINT; itype: IntermediateCode.Type;
  7007. convert,isTensor: BOOLEAN;
  7008. recordType: SyntaxTree.RecordType;
  7009. baseType: SyntaxTree.Type;
  7010. flags: SET;
  7011. left: SyntaxTree.Expression;
  7012. call: SyntaxTree.Designator;
  7013. procedure: SyntaxTree.Procedure;
  7014. temporaryVariable: SyntaxTree.Variable;
  7015. dummy: IntermediateCode.Operand;
  7016. customBuiltin: SyntaxTree.CustomBuiltin;
  7017. isVarPar: ARRAY 3 OF BOOLEAN;
  7018. callsection: Sections.Section;
  7019. segmentedName: Basic.SegmentedName;
  7020. needsTrace: BOOLEAN;
  7021. n: ARRAY 256 OF CHAR;
  7022. modifier: SyntaxTree.Modifier;
  7023. previous, init: IntermediateCode.Section;
  7024. prevScope: SyntaxTree.Scope;
  7025. firstPar: LONGINT;
  7026. saved: RegisterEntry;
  7027. callingConvention: SyntaxTree.CallingConvention;
  7028. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7029. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7030. priority: IntermediateCode.Operand;
  7031. op,callop: Operand;
  7032. BEGIN
  7033. IF type = NIL THEN RETURN END;
  7034. type := type.resolved;
  7035. IF type IS SyntaxTree.PointerType THEN
  7036. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7037. END;
  7038. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7039. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7040. recordScope := type(SyntaxTree.RecordType).recordScope;
  7041. IF recordScope.bodyProcedure # NIL THEN
  7042. procedure := recordScope.bodyProcedure;
  7043. body := procedure.procedureScope.body;
  7044. Emit(Push(position,self));
  7045. IF body.isActive THEN
  7046. StaticCallOperand(callop,procedure);
  7047. Emit(Push(position,callop.op));
  7048. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7049. Convert(priority,sizeType);
  7050. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7051. END;
  7052. Emit(Push(position,priority));
  7053. ReleaseIntermediateOperand(priority);
  7054. IF backend.cooperative THEN
  7055. Emit(Push(position,self));
  7056. CallThis(position,"Activities","Create",3)
  7057. ELSE
  7058. flags := 0;
  7059. IF body.isSafe THEN
  7060. flags := 1;
  7061. END;
  7062. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7063. Emit(Push(position,self));
  7064. CallThis(position,"Objects","CreateProcess",4)
  7065. END;
  7066. ELSE
  7067. Emit(Push(position,self));
  7068. StaticCallOperand(callop,procedure);
  7069. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7070. END;
  7071. Emit(Pop(position,self));
  7072. END;
  7073. END CallBodies;
  7074. PROCEDURE PushTD(type: SyntaxTree.Type);
  7075. VAR op: IntermediateCode.Operand;
  7076. BEGIN
  7077. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7078. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7079. ELSE
  7080. IF type.resolved IS SyntaxTree.PointerType THEN
  7081. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7082. END;
  7083. op := TypeDescriptorAdr(type.resolved);
  7084. Emit(Push(position,op));
  7085. END
  7086. END PushTD;
  7087. BEGIN
  7088. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7089. dest := destination; destination := emptyOperand;
  7090. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7091. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7092. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7093. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7094. CASE x.id OF
  7095. (* ---- COPY ----- *)
  7096. |Global.Copy:
  7097. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7098. (* ---- EXCL, INCL----- *)
  7099. |Global.Excl,Global.Incl:
  7100. Evaluate(p0,s0);
  7101. Evaluate(p1,s1);
  7102. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7103. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7104. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7105. END;
  7106. ReuseCopy(res,s0.op);
  7107. ReleaseOperand(s0);
  7108. Reuse1(tmp,s1.op);
  7109. ReleaseOperand(s1);
  7110. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7111. IF x.id = Global.Excl THEN
  7112. Emit(Not(position,tmp,tmp));
  7113. Emit(And(position,res,res,tmp));
  7114. ELSE
  7115. Emit(Or(position,res,res,tmp));
  7116. END;
  7117. ReleaseIntermediateOperand(tmp);
  7118. Designate(p0,s0);
  7119. ToMemory(s0.op,s1.op.type,0);
  7120. Emit(Mov(position,s0.op,res));
  7121. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7122. (* ---- DISPOSE ----- *)
  7123. |Global.Dispose:
  7124. Designate(p0,s0);
  7125. Emit(Push(position,s0.op));
  7126. ReleaseOperand(s0);
  7127. CallThis(position,"Runtime","Dispose", 1);
  7128. (* ---- GETPROCEDURE ----- *)
  7129. |Global.GetProcedure:
  7130. Designate(p0,s0);
  7131. PushString(s0,p0.type);
  7132. Designate(p1,s1);
  7133. PushString(s1,p1.type);
  7134. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7135. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7136. ELSE PushTD(procedureType.firstParameter.type)
  7137. END;
  7138. PushTD(procedureType.returnType);
  7139. Designate(p2,s2);
  7140. Emit(Push(position,s2.op));
  7141. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7142. CallThis(position,"Modules","GetProcedure", 7);
  7143. (* ---- ASH, LSH, ROT ----- *)
  7144. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7145. Evaluate(p0,s0);
  7146. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7147. (* make unsigned arguments in order to produced a logical shift *)
  7148. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7149. convert:= TRUE;
  7150. itype := s0.op.type;
  7151. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7152. Convert(s0.op,itype);
  7153. ELSE
  7154. convert := FALSE;
  7155. END;
  7156. END;
  7157. Evaluate(p1,s1);
  7158. IF IsIntegerConstant(p1,hint) THEN
  7159. ReuseCopy(reg,s0.op);
  7160. IF hint > 0 THEN
  7161. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7162. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7163. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7164. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7165. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7166. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7167. END;
  7168. ELSIF hint < 0 THEN
  7169. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7170. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7171. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7172. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7173. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7174. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7175. END;
  7176. END;
  7177. ReleaseOperand(s0); ReleaseOperand(s1);
  7178. ELSE
  7179. exit := NewLabel();
  7180. end := NewLabel();
  7181. ReuseCopy(reg,s0.op);
  7182. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7183. Reuse1(tmp,s1.op);
  7184. Emit(Neg(position,tmp,s1.op));
  7185. Convert(tmp,s1.op.type);
  7186. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7187. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7188. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7189. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7190. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7191. END;
  7192. ReleaseIntermediateOperand(tmp);
  7193. BrL(end);
  7194. SetLabel(exit);
  7195. ReuseCopy(tmp,s1.op);
  7196. Convert(tmp,s1.op.type);
  7197. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7198. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7199. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7200. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7201. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7202. END;
  7203. ReleaseIntermediateOperand(tmp);
  7204. SetLabel(end);
  7205. ReleaseOperand(s0); ReleaseOperand(s1);
  7206. END;
  7207. InitOperand(result,ModeValue);
  7208. IF convert THEN
  7209. itype := reg.type;
  7210. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7211. Convert(reg,itype);
  7212. END;
  7213. result.op := reg;
  7214. (* ---- CAP ----- *)
  7215. |Global.Cap:
  7216. Evaluate(p0,result);
  7217. ReuseCopy(reg,result.op);
  7218. ReleaseIntermediateOperand(result.op);
  7219. ignore := NewLabel();
  7220. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7221. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7222. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7223. SetLabel(ignore);
  7224. result.op := reg;
  7225. (* ---- CHR ----- *)
  7226. |Global.Chr, Global.Chr32:
  7227. Evaluate(p0,result);
  7228. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7229. |Global.Entier, Global.EntierH:
  7230. Evaluate(p0,result);
  7231. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7232. (* ---- MIN and MAX ----- *)
  7233. |Global.Max,Global.Min:
  7234. Evaluate(p0,s0);
  7235. Evaluate(p1,s1);
  7236. Reuse2(res,s0.op,s1.op);
  7237. else := NewLabel();
  7238. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7239. ELSE BrltL(else,s1.op,s0.op) END;
  7240. Emit(Mov(position,res,s0.op));
  7241. ReleaseOperand(s0);
  7242. end := NewLabel();
  7243. BrL(end);
  7244. SetLabel(else);
  7245. Emit(MovReplace(position,res,s1.op));
  7246. SetLabel(end);
  7247. ReleaseOperand(s1);
  7248. InitOperand(result,ModeValue);
  7249. result.op := res;
  7250. (* ---- ODD ----- *)
  7251. |Global.Odd:
  7252. IF ~conditional THEN
  7253. ConditionToValue(x)
  7254. ELSE
  7255. Evaluate(p0,result);
  7256. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7257. Reuse1(res,result.op);
  7258. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7259. ReleaseIntermediateOperand(result.op);
  7260. result.op := res;
  7261. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7262. ReleaseOperand(result);
  7263. BrL(falseLabel);
  7264. END;
  7265. (* ---- ORD ----- *)
  7266. |Global.Ord, Global.Ord32:
  7267. Evaluate(p0,result);
  7268. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7269. (* ---- SHORT, LONG ----- *)
  7270. |Global.Short, Global.Long:
  7271. Evaluate(p0,result);
  7272. IF x.type IS SyntaxTree.ComplexType THEN
  7273. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7274. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7275. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7276. ELSE
  7277. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7278. END
  7279. (* ---- HALT, SYSTEM.HALT----- *)
  7280. |Global.Halt, Global.systemHalt:
  7281. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7282. EmitTrap (position, val);
  7283. (* ---- ASSERT ----- *)
  7284. |Global.Assert:
  7285. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7286. trueL := NewLabel();
  7287. falseL := NewLabel();
  7288. Condition(p0,trueL,falseL);
  7289. IF p1 = NIL THEN val := AssertTrap
  7290. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7291. END;
  7292. SetLabel(falseL);
  7293. EmitTrap(position,val);
  7294. SetLabel(trueL);
  7295. END;
  7296. (*
  7297. Emit(TrapC(result.op,val);
  7298. *)
  7299. (* ---- INC, DEC----- *)
  7300. |Global.Inc,Global.Dec:
  7301. Expression(p0); adr := result.op;
  7302. LoadValue(result,p0.type); l := result;
  7303. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7304. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7305. END;
  7306. IF x.id = Global.Inc THEN
  7307. Emit(Add(position,l.op,l.op,r.op));
  7308. ELSE
  7309. Emit(Sub(position,l.op,l.op,r.op));
  7310. END;
  7311. ReleaseOperand(l); ReleaseOperand(r);
  7312. (* ---- LEN ----- *)
  7313. |Global.Len: (* dynamic length, static length done by checker *)
  7314. Designate(p0,operand);
  7315. IF p1 = NIL THEN
  7316. InitOperand(l,ModeValue);
  7317. l.op := IntermediateCode.Immediate(sizeType,0);
  7318. ELSE
  7319. Evaluate(p1,l);
  7320. END;
  7321. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7322. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7323. Dereference(operand, p0.type.resolved, FALSE);
  7324. END;
  7325. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7326. ReleaseOperand(operand); ReleaseOperand(l);
  7327. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7328. ASSERT(p1 # NIL);
  7329. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7330. Dereference(operand,p0.type.resolved,FALSE);
  7331. END;
  7332. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7333. ReleaseOperand(operand); ReleaseOperand(l);
  7334. ELSE HALT(100);
  7335. END;
  7336. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7337. (* ---- FIRST ---- *)
  7338. |Global.First:
  7339. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7340. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7341. ELSE
  7342. Designate(p0, result)
  7343. END
  7344. (* ---- LAST ---- *)
  7345. |Global.Last:
  7346. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7347. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7348. ELSE
  7349. Designate(p0, result);
  7350. (* make sure result.op is a register *)
  7351. tmp := result.op;
  7352. ReuseCopy(result.op, result.op);
  7353. ReleaseIntermediateOperand(tmp);
  7354. (* add offset to result.op *)
  7355. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7356. END
  7357. (* ---- STEP ---- *)
  7358. |Global.Step:
  7359. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7360. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7361. ELSE
  7362. Designate(p0, result);
  7363. (* make sure result.op is a register *)
  7364. tmp := result.op;
  7365. ReuseCopy(result.op, result.op);
  7366. ReleaseIntermediateOperand(tmp);
  7367. (* add offset to result.op *)
  7368. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7369. END
  7370. (* ---- RE ---- *)
  7371. |Global.Re:
  7372. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7373. Designate(p0, result)
  7374. ELSE
  7375. Evaluate(p0, result)
  7376. END
  7377. (* ---- IM ---- *)
  7378. |Global.Im:
  7379. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7380. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7381. Designate(p0, result);
  7382. (* make sure result.op is a register *)
  7383. tmp := result.op;
  7384. ReuseCopy(result.op, result.op);
  7385. ReleaseIntermediateOperand(tmp);
  7386. (* add offset to result.op *)
  7387. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7388. (* ---- ABS ----- *)
  7389. |Global.Abs:
  7390. Evaluate(p0,operand);
  7391. type := p0.type.resolved;
  7392. InitOperand(result,ModeValue);
  7393. Reuse1a(result.op,operand.op,dest);
  7394. Emit(Abs(position,result.op,operand.op));
  7395. ReleaseOperand(operand);
  7396. (* ---- WAIT ----- *)
  7397. |Global.Wait:
  7398. Evaluate(p0,operand);
  7399. Emit(Push(position,operand.op));
  7400. ReleaseOperand(operand);
  7401. CallThis(position,"Activities","Wait", 1);
  7402. (* ---- NEW ----- *)
  7403. |Global.New:
  7404. (*! the following code is only correct for "standard" Oberon calling convention *)
  7405. IF x.type # NIL THEN
  7406. type := x.type.resolved;
  7407. firstPar := 0;
  7408. ELSE
  7409. type := p0.type.resolved;
  7410. firstPar := 1;
  7411. END;
  7412. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7413. THEN
  7414. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7415. IF backend.cooperative THEN
  7416. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7417. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7418. IF recordType.isObject THEN
  7419. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7420. IF recordType.IsActive() THEN
  7421. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7422. END;
  7423. IF recordType.IsProtected() THEN
  7424. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7425. END;
  7426. ELSE
  7427. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7428. END;
  7429. END;
  7430. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7431. CallThis(position,"Runtime","New", 1);
  7432. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7433. Emit(Result(position, pointer));
  7434. exit := NewLabel();
  7435. BreqL(exit,pointer,nil);
  7436. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7437. GetRecordTypeName (recordType,name);
  7438. IF ~recordType.isObject THEN
  7439. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7440. END;
  7441. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7442. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7443. IF recordType.isObject THEN
  7444. IF recordType.IsProtected() THEN
  7445. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7446. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7447. END;
  7448. IF recordType.IsActive() THEN
  7449. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7450. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7451. END;
  7452. END;
  7453. END;
  7454. (* initialize fields *)
  7455. IF type(SyntaxTree.PointerType).isPlain THEN
  7456. size := 0;
  7457. ELSIF recordType.isObject THEN
  7458. size := BaseObjectTypeSize;
  7459. ELSE
  7460. size := BaseRecordTypeSize;
  7461. END;
  7462. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7463. (* call initializer *)
  7464. constructor := GetConstructor(recordType);
  7465. IF constructor # NIL THEN
  7466. (*! should be unified with ProcedureCallDesignator *)
  7467. Emit(Push(position,pointer));
  7468. ReleaseIntermediateOperand(pointer);
  7469. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7470. FOR i := firstPar TO x.parameters.Length()-1 DO
  7471. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7472. formalParameter := formalParameter.nextParameter;
  7473. END;
  7474. (* static call of the constructor *)
  7475. GetCodeSectionNameForSymbol(constructor,name);
  7476. ASSERT(~constructor.isInline);
  7477. IF constructor.scope.ownerModule # module.module THEN
  7478. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7479. ELSE
  7480. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7481. END;
  7482. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7483. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7484. Emit(Pop(position,pointer));
  7485. END;
  7486. (* call bodies *)
  7487. CallBodies(pointer,type);
  7488. SetLabel(exit);
  7489. needsTrace := p0.NeedsTrace();
  7490. IF needsTrace THEN ModifyAssignments(true) END;
  7491. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7492. Emit(Push(position, pointer));
  7493. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7494. Emit(Pop(position, pointer));
  7495. END;
  7496. Designate(p0,l);
  7497. IF needsTrace THEN
  7498. CallAssignPointer(l.op, pointer);
  7499. ELSE
  7500. ToMemory(l.op,addressType,0);
  7501. Emit(Mov(position,l.op,pointer));
  7502. END;
  7503. ReleaseIntermediateOperand(pointer);
  7504. ReleaseOperand(l);
  7505. IF needsTrace THEN ModifyAssignments(false) END;
  7506. ELSE (* not cooperative backend *)
  7507. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7508. IF temporaryVariable # NIL THEN
  7509. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7510. ELSE
  7511. Designate(p0,l);
  7512. END;
  7513. (* l.op contains address of pointer to record *)
  7514. Emit(Push(position,l.op)); (* address for use after syscall *)
  7515. Emit(Push(position,l.op));
  7516. ReleaseOperand(l);
  7517. (* push type descriptor *)
  7518. reg := TypeDescriptorAdr(recordType);
  7519. Emit(Push(position,reg));
  7520. ReleaseIntermediateOperand(reg);
  7521. (* push realtime flag *)
  7522. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7523. ELSE Emit(Push(position,false));
  7524. END;
  7525. CallThis(position,"Heaps","NewRec", 3);
  7526. (* check allocation success, if not successful then do not call initializers and bodies *)
  7527. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7528. Emit(Pop(position,pointer));
  7529. MakeMemory(reg,pointer,addressType,0);
  7530. ReleaseIntermediateOperand(pointer);
  7531. pointer := reg;
  7532. exit := NewLabel();
  7533. BreqL(exit,pointer,nil);
  7534. Emit(Push(position,pointer));
  7535. (* initialize fields *)
  7536. InitFields(recordType, pointer,0);
  7537. (* call initializer *)
  7538. constructor := GetConstructor(recordType);
  7539. IF constructor # NIL THEN
  7540. (*! should be unified with ProcedureCallDesignator *)
  7541. Emit(Push(position,pointer));
  7542. ReleaseIntermediateOperand(pointer);
  7543. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7544. FOR i := firstPar TO x.parameters.Length()-1 DO
  7545. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7546. formalParameter := formalParameter.nextParameter;
  7547. END;
  7548. (* static call of the constructor *)
  7549. GetCodeSectionNameForSymbol(constructor,name);
  7550. ASSERT(~constructor.isInline);
  7551. IF constructor.scope.ownerModule # module.module THEN
  7552. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7553. ELSE
  7554. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7555. END;
  7556. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7557. ELSE
  7558. ReleaseIntermediateOperand(pointer);
  7559. END;
  7560. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7561. Emit(Pop(position,pointer));
  7562. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7563. Designate(p0,l);
  7564. IF backend.writeBarriers & OnHeap(p0) THEN
  7565. SaveRegisters();ReleaseUsedRegisters(saved);
  7566. Emit(Push(position,l.op));
  7567. Emit(Push(position,pointer));
  7568. CallThis(position,"Heaps","Assign",2);
  7569. RestoreRegisters(saved);
  7570. ELSE
  7571. ToMemory(l.op,addressType,0);
  7572. Emit(Mov(position,l.op,pointer));
  7573. END;
  7574. ReleaseOperand(l);
  7575. result.tag := emptyOperand;
  7576. ELSIF (x.type # NIL) THEN
  7577. result := l; (* temporary variable is the result of NEW Type() *)
  7578. END;
  7579. (* call bodies *)
  7580. CallBodies(pointer,type);
  7581. ReleaseIntermediateOperand(pointer);
  7582. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7583. end := NewLabel();
  7584. BrL(end);
  7585. SetLabel(exit);
  7586. Designate(p0,l);
  7587. ToMemory(l.op,addressType,0);
  7588. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7589. ReleaseOperand(l);
  7590. SetLabel(end);
  7591. ELSE
  7592. SetLabel(exit);
  7593. END;
  7594. END;
  7595. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7596. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7597. IF ~backend.cooperative THEN (* simpler version *)
  7598. (*
  7599. push len0
  7600. push len1
  7601. push len2
  7602. push len_size
  7603. push len_adr
  7604. push tag
  7605. push static elements
  7606. push element size
  7607. push adr
  7608. *)
  7609. dim := 0;
  7610. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7611. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7612. parameter := x.parameters.GetExpression(i);
  7613. Evaluate(parameter,r);
  7614. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7615. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7616. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7617. END;
  7618. Emit(Push(position,r.op));
  7619. ReleaseOperand(r);
  7620. INC(dim);
  7621. END;
  7622. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7623. Emit(Mov(position, adr, sp));
  7624. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7625. Emit(Push(position, adr));
  7626. ReleaseIntermediateOperand(adr);
  7627. openDim := dim;
  7628. staticLength := 1;
  7629. IF type IS SyntaxTree.ArrayType THEN
  7630. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7631. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7632. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7633. END;
  7634. END;
  7635. IF SemanticChecker.ContainsPointer(type) THEN
  7636. tmp := TypeDescriptorAdr(type);
  7637. ELSE
  7638. tmp := nil;
  7639. END;
  7640. Emit(Push(position,tmp)); (* type descriptor *)
  7641. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7642. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7643. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7644. Designate(p0,l);
  7645. Emit(Push(position,l.op)); (* address *)
  7646. ReleaseOperand(l);
  7647. CallThis(position,"Heaps","NewArray", 6);
  7648. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7649. Emit(Add(position,sp,sp,tmp));
  7650. ELSE
  7651. dim := 0;
  7652. IntermediateCode.InitOperand(reg);
  7653. IF p1 # NIL THEN
  7654. FOR i := firstPar TO x.parameters.Length()-1 DO
  7655. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7656. parameter := x.parameters.GetExpression(i);
  7657. Evaluate(parameter,r);
  7658. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7659. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7660. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7661. END;
  7662. Emit(Push(position,r.op));
  7663. IF i=1 THEN
  7664. CopyInt(reg,r.op);
  7665. ELSE
  7666. MulInt(reg, reg, r.op);
  7667. END;
  7668. ReleaseOperand(r);
  7669. INC(dim);
  7670. END;
  7671. Convert(reg,addressType);
  7672. ELSE
  7673. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7674. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7675. END;
  7676. openDim := dim;
  7677. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7678. IF backend.cooperative THEN
  7679. size := ToMemoryUnits(system,system.SizeOf(type));
  7680. WHILE type IS SyntaxTree.ArrayType DO
  7681. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7682. END;
  7683. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7684. IF (size # 1) THEN
  7685. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7686. END;
  7687. Emit(Push(position,reg));
  7688. size := ToMemoryUnits(system,system.SizeOf(type));
  7689. IF (size # 1) THEN
  7690. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7691. END;
  7692. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7693. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7694. Emit(Push(position,reg));
  7695. ReleaseIntermediateOperand(reg);
  7696. CallThis(position,"Runtime","New", 1);
  7697. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7698. Emit(Result(position, pointer));
  7699. exit := NewLabel();
  7700. else := NewLabel();
  7701. BreqL(else,pointer,nil);
  7702. IF ~type.hasPointers THEN
  7703. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7704. ELSIF type IS SyntaxTree.RecordType THEN
  7705. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7706. ELSIF type IS SyntaxTree.ProcedureType THEN
  7707. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7708. ELSE
  7709. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7710. END;
  7711. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7712. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7713. 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))));
  7714. IF type IS SyntaxTree.RecordType THEN
  7715. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7716. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7717. ELSE
  7718. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7719. END;
  7720. i := openDim;
  7721. WHILE i > 0 DO
  7722. DEC (i);
  7723. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7724. END;
  7725. needsTrace := p0.NeedsTrace();
  7726. IF needsTrace THEN ModifyAssignments(true) END;
  7727. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7728. Emit(Push(position, pointer));
  7729. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7730. Emit(Pop(position, pointer));
  7731. END;
  7732. Designate(p0,l);
  7733. IF needsTrace THEN
  7734. CallAssignPointer(l.op, pointer);
  7735. ModifyAssignments(false);
  7736. ELSE
  7737. ToMemory(l.op,addressType,0);
  7738. Emit(Mov(position,l.op,pointer));
  7739. END;
  7740. ReleaseIntermediateOperand(pointer);
  7741. ReleaseOperand(l);
  7742. BrL(exit);
  7743. SetLabel(else);
  7744. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7745. Designate(p0,l);
  7746. IF needsTrace THEN
  7747. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7748. ELSE
  7749. ToMemory(l.op,addressType,0);
  7750. Emit(Mov(position,l.op,pointer));
  7751. END;
  7752. ReleaseOperand(l);
  7753. SetLabel(exit);
  7754. ELSE
  7755. (*! the following code is only correct for "standard" Oberon calling convention *)
  7756. IF SemanticChecker.ContainsPointer(type) THEN
  7757. IF type IS SyntaxTree.ArrayType THEN
  7758. staticLength := 1;
  7759. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7760. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7761. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7762. END;
  7763. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7764. MulInt(reg,reg,tmp);
  7765. END;
  7766. Designate(p0,l);
  7767. IF openDim > 0 THEN
  7768. Emit(Push(position,l.op)); (* address for use after syscall *)
  7769. END;
  7770. Emit(Push(position,l.op)); (* address *)
  7771. ReleaseOperand(l);
  7772. tmp := TypeDescriptorAdr(type);
  7773. Emit(Push(position,tmp)); (* type descriptor *)
  7774. ReleaseIntermediateOperand(tmp);
  7775. Emit(Push(position,reg)); (* number Elements *)
  7776. ReleaseIntermediateOperand(reg);
  7777. tmp := IntermediateCode.Immediate(addressType,dim);
  7778. Emit(Push(position,tmp)); (* dimensions *)
  7779. (* push realtime flag *)
  7780. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7781. ELSE Emit(Push(position,false));
  7782. END;
  7783. CallThis(position,"Heaps","NewArr",5)
  7784. ELSE
  7785. size := ToMemoryUnits(system,system.SizeOf(type));
  7786. IF (size # 1) THEN
  7787. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7788. (*
  7789. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7790. *)
  7791. END;
  7792. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7793. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7794. AddInt(reg, reg, tmp);
  7795. (*
  7796. Emit(Add(position,reg,reg,tmp));
  7797. *)
  7798. Designate(p0,l);
  7799. IF openDim >0 THEN
  7800. Emit(Push(position,l.op)); (* address for use after syscall *)
  7801. END;
  7802. Emit(Push(position,l.op)); (* address for syscall *)
  7803. ReleaseOperand(l); (* pointer address *)
  7804. Emit(Push(position,reg)); (* size *)
  7805. ReleaseIntermediateOperand(reg);
  7806. (* push realtime flag *)
  7807. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7808. ELSE Emit(Push(position,false));
  7809. END;
  7810. CallThis(position,"Heaps","NewSys", 3)
  7811. END;
  7812. IF openDim > 0 THEN
  7813. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7814. Emit(Pop(position,adr));
  7815. ToMemory(adr,addressType,0);
  7816. ReuseCopy(tmp,adr);
  7817. ReleaseIntermediateOperand(adr);
  7818. adr := tmp;
  7819. else := NewLabel();
  7820. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7821. i := openDim-1;
  7822. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7823. WHILE (i >= 0) DO
  7824. Emit(Pop(position,reg));
  7825. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7826. Emit(Mov(position,res,reg));
  7827. DEC(i);
  7828. END;
  7829. ReleaseIntermediateOperand(adr);
  7830. ReleaseIntermediateOperand(reg);
  7831. exit := NewLabel();
  7832. BrL(exit);
  7833. SetLabel(else);
  7834. (* else part: array could not be allocated *)
  7835. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7836. Emit(Add(position,sp,sp,tmp));
  7837. SetLabel(exit);
  7838. END;
  7839. END;
  7840. END;
  7841. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7842. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7843. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7844. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7845. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7846. callingConvention := procedureType.callingConvention;
  7847. left.SetType(procedure.type);
  7848. formalParameter := procedureType.firstParameter;
  7849. (* push array to allocate *)
  7850. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7851. formalParameter :=formalParameter.nextParameter;
  7852. (* push length array *)
  7853. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7854. (* push size *)
  7855. type := t0;
  7856. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7857. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7858. END;
  7859. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7860. Emit(Push(position,tmp));
  7861. (* *)
  7862. IF SemanticChecker.ContainsPointer(type) THEN
  7863. tmp := TypeDescriptorAdr(type);
  7864. ELSE
  7865. tmp := IntermediateCode.Immediate(addressType, 0);
  7866. END;
  7867. Emit(Push(position,tmp)); (* type descriptor *)
  7868. StaticCallOperand(result,procedure);
  7869. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7870. ReleaseOperand(result);
  7871. END;
  7872. (*
  7873. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7874. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7875. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7876. *)
  7877. ELSE
  7878. (*
  7879. push len0
  7880. push len1
  7881. push len2
  7882. push size
  7883. push len_adr
  7884. push element_size
  7885. push tag
  7886. push adr
  7887. *)
  7888. dim := 0;
  7889. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7890. isTensor := TRUE;
  7891. ELSE
  7892. isTensor := FALSE;
  7893. END;
  7894. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7895. IF ~isTensor THEN
  7896. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7897. END;
  7898. parameter := x.parameters.GetExpression(i);
  7899. Evaluate(parameter,r);
  7900. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7901. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7902. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7903. END;
  7904. Emit(Push(position,r.op));
  7905. ReleaseOperand(r);
  7906. INC(dim);
  7907. END;
  7908. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7909. Emit(Mov(position, adr, sp));
  7910. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7911. Emit(Push(position, adr));
  7912. ReleaseIntermediateOperand(adr);
  7913. openDim := dim;
  7914. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7915. IF isTensor THEN
  7916. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7917. ELSE
  7918. baseType := SemanticChecker.ArrayBase(type,openDim);
  7919. END;
  7920. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7921. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7922. IF SemanticChecker.ContainsPointer(baseType) THEN
  7923. tmp := TypeDescriptorAdr(baseType);
  7924. ELSE
  7925. tmp := nil;
  7926. END;
  7927. Emit(Push(position,tmp)); (* type descriptor *)
  7928. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7929. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7930. ELSE (* error message has already been emited *)
  7931. RETURN;
  7932. END;
  7933. Designate(p0,l);
  7934. IF isTensor THEN
  7935. Emit(Push(position,l.op)); (* address *)
  7936. ELSE
  7937. Emit(Push(position,l.tag)); (* address *)
  7938. END;
  7939. ReleaseOperand(l);
  7940. StaticCallOperand(result,procedure);
  7941. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7942. ReleaseOperand(result);
  7943. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7944. Emit(Add(position,sp,sp,tmp));
  7945. END;
  7946. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7947. THEN
  7948. IF ~backend.cellsAreObjects THEN RETURN END;
  7949. IF InCellScope(currentScope) THEN
  7950. PushSelfPointer()
  7951. ELSE
  7952. Emit(Push(position, nil));
  7953. END;
  7954. (* push temp address *)
  7955. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7956. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7957. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7958. (* l.op contains address of pointer to record *)
  7959. Emit(Push(position,l.op)); (* address for use after syscall *)
  7960. ReleaseOperand(l);
  7961. (* push type descriptor *)
  7962. reg := TypeDescriptorAdr(baseType);
  7963. Emit(Push(position,reg));
  7964. ReleaseIntermediateOperand(reg);
  7965. (* push name *)
  7966. (*Global.GetSymbolName(p0, n);*)
  7967. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7968. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7969. ELSE
  7970. Global.GetModuleName(module.module, n);
  7971. END;
  7972. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7973. (*type.typeDeclaration.GetName(n);*)
  7974. PushConstString(n);
  7975. (* push cellnet boolean *)
  7976. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7977. (* push engine boolean *)
  7978. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7979. (* allocate *)
  7980. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7981. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7982. (* l.op contains address of pointer to record *)
  7983. ToMemory(l.op,addressType,0);
  7984. (* l.op contains value of pointer to record *)
  7985. InitFields(baseType, l.op,0);
  7986. (* add capabilities *)
  7987. modifier := p0(SyntaxTree.Designator).modifiers;
  7988. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7989. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7990. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7991. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7992. END;
  7993. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7994. (*
  7995. modifier := baseType(SyntaxTree.CellType).modifiers;
  7996. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7997. modifier := p0(SyntaxTree.Designator).modifiers;
  7998. *)
  7999. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8000. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8001. (* l.op contains address of pointer to record *)
  8002. ToMemory(l.op,addressType,0);
  8003. (* l.op contains value of pointer to record *)
  8004. Emit(Push(position,l.op)); (* address for use after syscall *)
  8005. ReleaseOperand(l);
  8006. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8007. prevScope := currentScope;
  8008. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8009. previous := section;
  8010. section := init;
  8011. (* add ports *)
  8012. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8013. CloseInitializer(previous);
  8014. currentScope := prevScope;
  8015. Symbol(temporaryVariable,l);
  8016. ToMemory(l.op,addressType,0);
  8017. Emit(Push(position,l.op));
  8018. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8019. (*
  8020. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8021. IF constructor # NIL THEN
  8022. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8023. FOR i := 1 TO x.parameters.Length()-1 DO
  8024. p := x.parameters.GetExpression(i);
  8025. Global.GetSymbolName(parameter,name);
  8026. Evaluate(p, value);
  8027. ASSERT(value.type # NIL);
  8028. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8029. par := instance.AddParameter(name);
  8030. par.SetInteger(value.integer);
  8031. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8032. par := instance.AddParameter(name);
  8033. par.SetBoolean(value.boolean);
  8034. ELSE Error(x.position,NotYetImplemented)
  8035. END;
  8036. parameter := parameter.nextParameter
  8037. END;
  8038. END;
  8039. *)
  8040. (* call initializer *)
  8041. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8042. IF constructor # NIL THEN
  8043. (*! should be unified with ProcedureCallDesignator *)
  8044. IF backend.cellsAreObjects THEN
  8045. Symbol(temporaryVariable,l);
  8046. ToMemory(l.op,addressType,0);
  8047. Emit(Push(position,l.op));
  8048. ReleaseOperand(l);
  8049. END;
  8050. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8051. FOR i := firstPar TO x.parameters.Length()-1 DO
  8052. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8053. formalParameter := formalParameter.nextParameter;
  8054. END;
  8055. (* static call of the constructor *)
  8056. Global.GetSymbolSegmentedName(constructor,name);
  8057. ASSERT(~constructor.isInline);
  8058. IF constructor.scope.ownerModule # module.module THEN
  8059. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8060. ELSE
  8061. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8062. END;
  8063. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8064. (*ELSE
  8065. ReleaseIntermediateOperand(pointer);*)
  8066. END;
  8067. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8068. ToMemory(l.op, addressType, 0);
  8069. Designate(p0,s0);
  8070. ToMemory(s0.op,addressType,0);
  8071. Emit(Mov(position,s0.op,l.op));
  8072. ReleaseOperand(l);
  8073. ReleaseOperand(s0);
  8074. result.tag := emptyOperand;
  8075. (* start *)
  8076. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8077. (* push cell *)
  8078. Symbol(temporaryVariable, l);
  8079. ToMemory(l.op,addressType,0);
  8080. Emit(Push(Basic.invalidPosition,l.op));
  8081. (* push delegate *)
  8082. Emit(Push(Basic.invalidPosition,l.op));
  8083. ReleaseOperand(l);
  8084. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8085. Emit(Push(position, s1.op));
  8086. ReleaseOperand(s1);
  8087. CallThis(position,"ActiveCellsRuntime","Start",3);
  8088. END;
  8089. (*IF temporaryVariable # NIL THEN
  8090. end := NewLabel();
  8091. BrL(end);
  8092. SetLabel(exit);
  8093. Designate(p0,l);
  8094. ToMemory(l.op,addressType,0);
  8095. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8096. ReleaseOperand(l);
  8097. SetLabel(end);
  8098. ELSE
  8099. SetLabel(exit);
  8100. END;
  8101. *)
  8102. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8103. ELSE (* no pointer to record, no pointer to array *)
  8104. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8105. (* ignore new statement *)
  8106. Warning(p0.position, "cannot run on final hardware");
  8107. ELSE
  8108. HALT(200);
  8109. END;
  8110. END;
  8111. (* ---- ADDRESSOF----- *)
  8112. |Global.systemAdr:
  8113. Designate(p0,s0);
  8114. s0.mode := ModeValue;
  8115. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8116. ReleaseIntermediateOperand(s0.op);
  8117. s0.op := s0.tag;
  8118. IntermediateCode.InitOperand(s0.tag);
  8119. END;
  8120. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8121. result := s0;
  8122. (* ---- BIT ----- *)
  8123. |Global.systemBit:
  8124. Evaluate(p0,s0);
  8125. ToMemory(s0.op,addressType,0);
  8126. ReuseCopy(res,s0.op);
  8127. ReleaseOperand(s0);
  8128. Evaluate(p1,s1);
  8129. Emit(Ror(position,res,res,s1.op));
  8130. ReleaseOperand(s1);
  8131. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8132. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8133. IF ~conditional THEN
  8134. InitOperand(result,ModeValue); result.op := res;
  8135. ELSE
  8136. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8137. BrL(falseLabel);
  8138. ReleaseIntermediateOperand(res);
  8139. END;
  8140. (* --- MSK ----*)
  8141. |Global.systemMsk:
  8142. Evaluate(p0,s0);
  8143. Evaluate(p1,s1);
  8144. ReuseCopy(res,s0.op);
  8145. ReleaseOperand(s0);
  8146. Emit(And(position,res,res,s1.op));
  8147. ReleaseOperand(s1);
  8148. InitOperand(result,ModeValue);
  8149. result.op := res;
  8150. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8151. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8152. Evaluate(p0,s0);
  8153. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8154. ReleaseOperand(s0);
  8155. InitOperand(result,ModeValue);
  8156. result.op := res;
  8157. (* ---- SYSTEM.GetStackPointer ----- *)
  8158. |Global.systemGetStackPointer:
  8159. InitOperand(result,ModeValue);
  8160. result.op := sp;
  8161. (* ---- SYSTEM.GetFramePointer ----- *)
  8162. |Global.systemGetFramePointer:
  8163. InitOperand(result,ModeValue);
  8164. result.op := fp;
  8165. (* ---- SYSTEM.GetActivity ----- *)
  8166. |Global.systemGetActivity:
  8167. ASSERT(backend.cooperative);
  8168. InitOperand(result,ModeValue);
  8169. result.op := ap;
  8170. (* ---- SYSTEM.SetStackPointer ----- *)
  8171. |Global.systemSetStackPointer:
  8172. Evaluate(p0,s0); (* *)
  8173. Emit(Mov(position,sp,s0.op));
  8174. ReleaseOperand(s0);
  8175. (* ---- SYSTEM.SetFramePointer ----- *)
  8176. |Global.systemSetFramePointer:
  8177. Evaluate(p0,s0); (* *)
  8178. Emit(Mov(position,fp,s0.op));
  8179. ReleaseOperand(s0);
  8180. (* ---- SYSTEM.Activity ----- *)
  8181. |Global.systemSetActivity:
  8182. ASSERT(backend.cooperative);
  8183. Evaluate(p0,s0); (* *)
  8184. Emit(Mov(position,ap,s0.op));
  8185. ReleaseOperand(s0);
  8186. (* ---- SYSTEM.VAL ----- *)
  8187. |Global.systemVal:
  8188. Expression(p1);
  8189. s1 := result;
  8190. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8191. IF s1.mode = ModeReference THEN
  8192. (* nothing to be done if not record type, just take over new type *)
  8193. IF (type IS SyntaxTree.RecordType) THEN
  8194. ReleaseIntermediateOperand(s1.tag);
  8195. s1.tag := TypeDescriptorAdr(type);
  8196. UseIntermediateOperand(s1.tag);
  8197. END;
  8198. result := s1;
  8199. ELSE (* copy over result to different type, may not use convert *)
  8200. itype := IntermediateCode.GetType(system,type);
  8201. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8202. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8203. Emit(Mov(position,s0.op,s1.op));
  8204. ReleaseOperand(s1);
  8205. InitOperand(result,ModeValue);
  8206. result.op := s0.op;
  8207. ELSE (* different size, must convert *)
  8208. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8209. Convert(s1.op, IntermediateCode.GetType(system,type));
  8210. result := s1;
  8211. END;
  8212. END;
  8213. (* ---- SYSTEM.GET ----- *)
  8214. |Global.systemGet:
  8215. Evaluate(p0,s0); (* adr *)
  8216. Designate(p1,s1); (* variable *)
  8217. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8218. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8219. Emit(Mov(position,s1.op,s0.op));
  8220. ReleaseOperand(s1);
  8221. ReleaseOperand(s0);
  8222. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8223. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8224. Evaluate(p0,s0); (* *)
  8225. Evaluate(p1,s1); (* variable *)
  8226. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8227. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8228. (* real part *)
  8229. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8230. Emit(Mov(position,res, s1.op));
  8231. ReleaseIntermediateOperand(res);
  8232. (* imaginary part *)
  8233. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8234. Emit(Mov(position,res, s1.tag));
  8235. ReleaseIntermediateOperand(res);
  8236. ReleaseOperand(s1);
  8237. ReleaseOperand(s0);
  8238. ELSE
  8239. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8240. ReleaseOperand(s0);
  8241. Emit(Mov(position,res,s1.op));
  8242. ReleaseIntermediateOperand(res);
  8243. ReleaseOperand(s1);
  8244. END;
  8245. (* ---- SYSTEM.MOVE ----- *)
  8246. |Global.systemMove:
  8247. Evaluate(p0,s0);
  8248. Evaluate(p1,s1);
  8249. Evaluate(p2,s2);
  8250. Emit(Copy(position,s1.op,s0.op,s2.op));
  8251. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8252. (* ---- SYSTEM.NEW ----- *)
  8253. |Global.systemNew:
  8254. Designate(p0,s0);
  8255. Emit(Push(position,s0.op));
  8256. ReleaseOperand(s0);
  8257. Evaluate(p1,s1);
  8258. Emit(Push(position,s1.op));
  8259. ReleaseOperand(s1);
  8260. (* push realtime flag: false by default *)
  8261. Emit(Push(position,false));
  8262. CallThis(position,"Heaps","NewSys",3);
  8263. (* ---- SYSTEM.CALL ----- *)
  8264. |Global.systemRef:
  8265. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8266. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8267. s0.mode := ModeValue;
  8268. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8269. result := s0
  8270. (* ---- INCR ----- *)
  8271. |Global.Incr:
  8272. Designate(p0,operand);
  8273. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8274. Dereference(operand,p0.type.resolved,FALSE);
  8275. END;
  8276. ASSERT(p1 # NIL);
  8277. Evaluate(p1,l);
  8278. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8279. ReleaseOperand(operand); ReleaseOperand(l);
  8280. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8281. (* ---- SUM ----- *)
  8282. |Global.Sum: HALT(200);
  8283. (* ---- ALL ----- *)
  8284. |Global.All: HALT(200);
  8285. (* ---- CAS ----- *)
  8286. |Global.Cas:
  8287. needsTrace := p0.NeedsTrace();
  8288. IF needsTrace THEN ModifyAssignments(true) END;
  8289. Designate(p0,s0);
  8290. Evaluate(p1,s1);
  8291. Evaluate(p2,s2);
  8292. IF needsTrace THEN
  8293. Emit(Push(position, s0.op));
  8294. Emit(Push(position, s1.op));
  8295. Emit(Push(position, s2.op));
  8296. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8297. ELSE
  8298. Emit(Cas(position,s0.op,s1.op,s2.op));
  8299. END;
  8300. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8301. IF needsTrace THEN ModifyAssignments(false) END;
  8302. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8303. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8304. IF conditional THEN
  8305. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8306. BrL(falseLabel);
  8307. ReleaseIntermediateOperand(res);
  8308. END;
  8309. (* ---- DIM ----- *)
  8310. |Global.Dim:
  8311. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8312. Designate(p0,s0);
  8313. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8314. Dereference(s0,p0.type.resolved,FALSE);
  8315. END;
  8316. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8317. ReleaseOperand(s0);
  8318. (* ---- RESHAPE ----- *)
  8319. |Global.Reshape:
  8320. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8321. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8322. left.SetType(procedure.type);
  8323. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8324. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8325. END;
  8326. (* ---- SYSTEM.TYPECODE ----- *)
  8327. |Global.systemTypeCode:
  8328. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8329. IF type.resolved IS SyntaxTree.PointerType THEN
  8330. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8331. END;
  8332. result.op := TypeDescriptorAdr(type);
  8333. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8334. result.mode := ModeValue;
  8335. (* ---- SYSTEM.TRACE ----- *)
  8336. |Global.systemTrace:
  8337. SystemTrace(x.parameters, x.position);
  8338. (* ----- CONNECT ------*)
  8339. |Global.Connect:
  8340. IF backend.cellsAreObjects THEN
  8341. PushPort(p0);
  8342. PushPort(p1);
  8343. IF p2 # NIL THEN
  8344. Evaluate(p2, s2);
  8345. Emit(Push(p2.position, s2.op));
  8346. ReleaseOperand(s2);
  8347. ELSE
  8348. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8349. END;
  8350. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8351. ELSE
  8352. Warning(x.position, "cannot run on final hardware");
  8353. END;
  8354. (* ----- DELEGATE ------*)
  8355. |Global.Delegate:
  8356. IF backend.cellsAreObjects THEN
  8357. PushPort(p0);
  8358. PushPort(p1);
  8359. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8360. ELSE
  8361. Warning(x.position, "cannot run on final hardware");
  8362. END;
  8363. (* ----- SEND ------*)
  8364. |Global.Send:
  8365. Evaluate(p0,s0);
  8366. Evaluate(p1,s1);
  8367. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8368. Emit(Push(position,s0.op));
  8369. Emit(Push(position,s1.op));
  8370. (*
  8371. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8372. *)
  8373. IF ~backend.cellsAreObjects THEN
  8374. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8375. END;
  8376. ReleaseOperand(s0);
  8377. ReleaseOperand(s1);
  8378. IF backend.cellsAreObjects THEN
  8379. CallThis(position,"ActiveCellsRuntime","Send",2);
  8380. ELSE
  8381. CallThis(position,ChannelModuleName,"Send",2);
  8382. END;
  8383. (* ----- RECEIVE ------*)
  8384. |Global.Receive:
  8385. Evaluate(p0,s0);
  8386. Emit(Push(position,s0.op));
  8387. Designate(p1,s1);
  8388. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8389. Emit(Push(position,s1.op));
  8390. IF p2 # NIL THEN
  8391. Designate(p2,s2);
  8392. Emit(Push(position,s2.op));
  8393. END;
  8394. (*
  8395. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8396. *)
  8397. IF ~backend.cellsAreObjects THEN
  8398. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8399. END;
  8400. ReleaseOperand(s0);
  8401. ReleaseOperand(s1);
  8402. ReleaseOperand(s2);
  8403. IF backend.cellsAreObjects THEN
  8404. IF p2 = NIL THEN
  8405. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8406. ELSE
  8407. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8408. END;
  8409. ELSE
  8410. IF p2 = NIL THEN
  8411. CallThis(position,ChannelModuleName,"Receive",2)
  8412. ELSE
  8413. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8414. END;
  8415. END;
  8416. | Global.systemSpecial:
  8417. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8418. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8419. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8420. (* determine if parameters are of the VAR kind *)
  8421. ASSERT(x.parameters.Length() <= 3);
  8422. formalParameter := procedureType.firstParameter;
  8423. FOR i := 0 TO x.parameters.Length() - 1 DO
  8424. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8425. formalParameter := formalParameter.nextParameter
  8426. END;
  8427. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8428. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8429. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8430. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8431. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8432. IF procedureType.returnType # NIL THEN
  8433. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8434. Emit(Result(position, res));
  8435. (*InitOperand(result,ModeValue);
  8436. result.op := res;
  8437. *)
  8438. IF ~conditional THEN
  8439. InitOperand(result,ModeValue); result.op := res;
  8440. ELSE
  8441. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8442. BrL(falseLabel);
  8443. ReleaseIntermediateOperand(res);
  8444. END;
  8445. END
  8446. ELSE (* function not yet implemented *)
  8447. Error(position,"not yet implemented");
  8448. END;
  8449. destination := dest;
  8450. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8451. END VisitBuiltinCallDesignator;
  8452. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8453. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8454. BEGIN
  8455. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8456. dest := destination; destination := emptyOperand;
  8457. Expression(x.left);
  8458. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8459. ELSIF isUnchecked THEN (* no check *)
  8460. ELSE
  8461. trueL := NewLabel();
  8462. falseL := NewLabel();
  8463. IF IsPointerToRecord(x.left.type,recordType) THEN
  8464. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8465. Emit(Mov(position,tag, result.op));
  8466. IF result.mode # ModeValue THEN
  8467. ptr := tag;
  8468. IntermediateCode.MakeMemory(ptr,addressType);
  8469. Emit(Mov(position,tag, ptr));
  8470. END;
  8471. IF ~backend.cooperative THEN
  8472. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8473. END;
  8474. IntermediateCode.MakeMemory(tag,addressType);
  8475. ELSE
  8476. tag := result.tag;
  8477. UseIntermediateOperand(tag);
  8478. END;
  8479. TypeTest(tag,x.type,trueL,falseL);
  8480. ReleaseIntermediateOperand(tag);
  8481. SetLabel(falseL);
  8482. EmitTrap(position,TypeCheckTrap);
  8483. SetLabel(trueL);
  8484. END;
  8485. destination := dest;
  8486. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8487. END VisitTypeGuardDesignator;
  8488. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8489. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8490. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8491. VAR label: Label; pc: LONGINT;
  8492. BEGIN
  8493. IF backend.cooperative & ~isUnchecked THEN
  8494. pc := section.pc;
  8495. label := NewLabel();
  8496. BrneL(label, operand.op, nil);
  8497. EmitTrap(position, NilPointerTrap);
  8498. SetLabel(label);
  8499. INC(statCoopNilCheck, section.pc - pc);
  8500. END;
  8501. END NilCheck;
  8502. BEGIN
  8503. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8504. ReuseCopy(dereferenced,operand.op);
  8505. ReleaseOperand(operand);
  8506. operand.mode := ModeReference;
  8507. operand.op := dereferenced;
  8508. operand.tag := dereferenced;
  8509. UseIntermediateOperand(operand.tag);
  8510. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8511. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8512. ReleaseIntermediateOperand(operand.tag);
  8513. operand.tag := TypeDescriptorAdr(type);
  8514. ELSE
  8515. IF ~backend.cooperative THEN
  8516. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8517. END;
  8518. IntermediateCode.MakeMemory(operand.tag,addressType);
  8519. END;
  8520. NilCheck(operand.op);
  8521. ELSIF type IS SyntaxTree.ArrayType THEN
  8522. IF isUnsafe THEN
  8523. NilCheck(operand.op);
  8524. ReleaseIntermediateOperand(operand.tag);
  8525. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8526. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8527. ELSE
  8528. operand.tag := emptyOperand;
  8529. END;
  8530. ELSE
  8531. NilCheck(operand.op);
  8532. IF backend.cooperative THEN
  8533. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8534. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8535. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8536. ELSE
  8537. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8538. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8539. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8540. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8541. END;
  8542. END;
  8543. ELSIF type IS SyntaxTree.MathArrayType THEN
  8544. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8545. IntermediateCode.MakeMemory(operand.op,addressType);
  8546. ELSE HALT(100);
  8547. END;
  8548. END Dereference;
  8549. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8550. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8551. BEGIN
  8552. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8553. dest := destination; destination := emptyOperand;
  8554. Evaluate(x.left,d);
  8555. type := x.type.resolved;
  8556. prevIsUnchecked := isUnchecked;
  8557. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8558. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8559. END;
  8560. Dereference(d,type,IsUnsafePointer(x.left.type));
  8561. isUnchecked := prevIsUnchecked;
  8562. result := d;
  8563. 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
  8564. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8565. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8566. END;
  8567. END;
  8568. destination := dest;
  8569. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8570. END VisitDereferenceDesignator;
  8571. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8572. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8573. BEGIN
  8574. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8575. dest := destination; destination := emptyOperand;
  8576. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8577. tag := result.op;
  8578. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8579. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8580. StaticCallOperand(result,procedure.super);
  8581. ReleaseIntermediateOperand(result.tag);
  8582. UseIntermediateOperand(tag); (* necessary ? *)
  8583. result.tag := tag;
  8584. destination := dest;
  8585. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8586. END VisitSupercallDesignator;
  8587. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8588. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8589. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8590. name: Basic.SegmentedName;
  8591. procedure: SyntaxTree.Procedure;
  8592. procedureType: SyntaxTree.ProcedureType;
  8593. BEGIN
  8594. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8595. dest := destination; destination := emptyOperand;
  8596. scope := currentScope;
  8597. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8598. scope := scope.outerScope;
  8599. END;
  8600. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8601. moduleSection := meta.ModuleSection();
  8602. IF backend.cooperative THEN
  8603. moduleOffset := 0;
  8604. ELSE
  8605. moduleOffset := moduleSection.pc;
  8606. END;
  8607. result.mode := ModeValue;
  8608. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8609. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8610. result.mode := ModeValue;
  8611. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8612. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8613. ELSE
  8614. GetBaseRegister(basereg,currentScope,scope);
  8615. InitOperand(result,ModeReference);
  8616. result.op := basereg;
  8617. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8618. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8619. parametersSize := ProcParametersSize(procedure);
  8620. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8621. IF backend.cooperative THEN
  8622. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8623. END;
  8624. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8625. MakeMemory(result.op, result.op, addressType, 0);
  8626. END;
  8627. (* tag must be loaded when dereferencing SELF pointer *)
  8628. END;
  8629. destination := dest;
  8630. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8631. END VisitSelfDesignator;
  8632. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8633. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8634. BEGIN
  8635. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8636. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8637. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8638. parameter := procedureType.returnParameter;
  8639. IF currentIsInline THEN
  8640. map := currentMapper.Get(NIL);
  8641. IF map # NIL THEN
  8642. Designate(map.to, result);
  8643. ELSE
  8644. HALT(200);
  8645. END;
  8646. RETURN;
  8647. END;
  8648. VisitParameter(parameter);
  8649. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8650. END VisitResultDesignator;
  8651. (** values *)
  8652. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8653. BEGIN
  8654. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8655. IF conditional THEN
  8656. IF x.value THEN BrL(trueLabel)
  8657. ELSE BrL(falseLabel)
  8658. END;
  8659. ELSE
  8660. InitOperand(result,ModeValue);
  8661. IF x.value THEN result.op := true ELSE result.op := false END;
  8662. END;
  8663. END VisitBooleanValue;
  8664. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8665. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8666. BEGIN
  8667. Global.GetModuleSegmentedName(module.module, name);
  8668. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8669. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8670. RETURN section
  8671. END GetDataSection;
  8672. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8673. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8674. BEGIN
  8675. type := vop.type;
  8676. data := GetDataSection();
  8677. pc := EnterImmediate(data,vop);
  8678. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8679. IntermediateCode.MakeMemory(vop, type);
  8680. END GetImmediateMem;
  8681. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8682. BEGIN
  8683. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8684. InitOperand(result,ModeValue);
  8685. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8686. IF ~supportedImmediate(result.op) &~inData THEN
  8687. GetImmediateMem(result.op)
  8688. END;
  8689. END VisitIntegerValue;
  8690. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8691. BEGIN
  8692. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8693. InitOperand(result,ModeValue);
  8694. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8695. END VisitCharacterValue;
  8696. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8697. BEGIN
  8698. IF Trace THEN TraceEnter("VisitSetValue") END;
  8699. InitOperand(result,ModeValue);
  8700. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8701. END VisitSetValue;
  8702. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8703. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8704. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8705. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8706. BEGIN
  8707. numberElements := x.elements.Length();
  8708. FOR i := 0 TO numberElements-1 DO
  8709. expression := x.elements.GetExpression(i);
  8710. IF expression IS SyntaxTree.MathArrayExpression THEN
  8711. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8712. ELSE
  8713. inData := TRUE;
  8714. Evaluate(expression,op);
  8715. irv.Emit(Data(position,op.op));
  8716. inData := FALSE;
  8717. ReleaseOperand(op);
  8718. END;
  8719. END;
  8720. END RecursiveData;
  8721. BEGIN
  8722. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8723. IF ~TryConstantDeclaration() THEN
  8724. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8725. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8726. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8727. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8728. ELSE
  8729. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8730. END;
  8731. RecursiveData(x.array);
  8732. InitOperand(result,ModeReference);
  8733. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8734. END
  8735. END VisitMathArrayValue;
  8736. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8737. VAR constant: Sections.Section;
  8738. BEGIN
  8739. IF constantDeclaration = NIL THEN
  8740. RETURN FALSE
  8741. ELSE
  8742. (* Is a constant in this module: did we generate it already? *)
  8743. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8744. IF constant # NIL THEN
  8745. InitOperand(result,ModeReference);
  8746. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8747. RETURN TRUE;
  8748. END;
  8749. END;
  8750. RETURN FALSE
  8751. END TryConstantDeclaration;
  8752. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8753. BEGIN
  8754. constantDeclaration := x;
  8755. x.value.resolved.Accept(SELF);
  8756. END VisitConstant;
  8757. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8758. BEGIN
  8759. IF Trace THEN TraceEnter("VisitRealValue") END;
  8760. InitOperand(result,ModeValue);
  8761. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8762. END VisitRealValue;
  8763. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8764. VAR
  8765. componentType: SyntaxTree.Type;
  8766. BEGIN
  8767. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8768. ASSERT(x.type IS SyntaxTree.ComplexType);
  8769. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8770. InitOperand(result,ModeValue);
  8771. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8772. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8773. END VisitComplexValue;
  8774. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8775. VAR i: LONGINT; name: Basic.SegmentedName;
  8776. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8777. BEGIN
  8778. IF Trace THEN TraceEnter("VisitStringValue") END;
  8779. IF ~TryConstantDeclaration() THEN
  8780. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8781. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8782. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8783. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8784. ELSE
  8785. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8786. END;
  8787. FOR i := 0 TO x.length-1 DO
  8788. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8789. irv.Emit(Data(position,op));
  8790. END;
  8791. InitOperand(result,ModeReference);
  8792. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8793. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8794. END
  8795. END VisitStringValue;
  8796. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8797. BEGIN
  8798. IF Trace THEN TraceEnter("VisitNilValue") END;
  8799. InitOperand(result,ModeValue);
  8800. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8801. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8802. END VisitNilValue;
  8803. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8804. BEGIN
  8805. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8806. InitOperand(result,ModeValue);
  8807. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8808. END VisitEnumerationValue;
  8809. (** symbols *)
  8810. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8811. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8812. END VisitImport;
  8813. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8814. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8815. BEGIN
  8816. IF scope # baseScope THEN
  8817. (* left := [fp+8] *)
  8818. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8819. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8820. ReuseCopy(left,right);
  8821. ReleaseIntermediateOperand(right);
  8822. scope := scope.outerScope; DEC(level);
  8823. (* { left := [left+8] } *)
  8824. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8825. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8826. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8827. Emit(Mov(position,left,right));
  8828. scope := scope.outerScope; DEC(level);
  8829. END;
  8830. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8831. result := left;
  8832. ELSE
  8833. result := fp;
  8834. END;
  8835. END GetBaseRegister;
  8836. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8837. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8838. BEGIN
  8839. IF Trace THEN TraceEnter("VisitVariable"); END;
  8840. type := x.type.resolved;
  8841. IF (x.useRegister) THEN
  8842. InitOperand(result, ModeValue);
  8843. IF x.registerNumber < 0 THEN
  8844. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8845. reg := x.registerNumber;
  8846. ELSE
  8847. reg := registerUsageCount.Map(x.registerNumber);
  8848. UseRegister(reg);
  8849. END;
  8850. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8851. ELSIF x.externalName # NIL THEN
  8852. InitOperand(result,ModeReference);
  8853. Basic.ToSegmentedName(x.externalName^, name);
  8854. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8855. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8856. InitOperand(result,ModeReference);
  8857. GetBaseRegister(result.op,currentScope,x.scope);
  8858. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8859. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8860. InitOperand(result,ModeReference);
  8861. GetCodeSectionNameForSymbol(x,name);
  8862. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8863. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8864. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8865. InitOperand(result,ModeReference);
  8866. GetCodeSectionNameForSymbol(x,name);
  8867. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8868. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8869. ELSE (* field, left designator must have been emitted *)
  8870. ASSERT(result.mode = ModeReference);
  8871. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8872. ReuseCopy(temp,result.op);
  8873. ReleaseIntermediateOperand(result.op);
  8874. result.op := temp;
  8875. END;
  8876. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8877. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8878. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8879. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8880. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8881. END;
  8882. END;
  8883. END;
  8884. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8885. ValueToCondition(result);
  8886. ELSIF type IS SyntaxTree.ProcedureType THEN
  8887. ReleaseIntermediateOperand(result.tag);
  8888. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8889. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8890. UseIntermediateOperand(result.tag);
  8891. ELSE
  8892. result.tag := nil; (* nil *)
  8893. END;
  8894. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8895. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8896. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8897. ReleaseIntermediateOperand(result.tag);
  8898. Global.GetSymbolSegmentedName(x,name);
  8899. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8900. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8901. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8902. ELSE
  8903. END;
  8904. ELSE
  8905. ReleaseIntermediateOperand(result.tag);
  8906. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8907. END;
  8908. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8909. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8910. ReleaseIntermediateOperand(result.tag);
  8911. result.tag := result.op;
  8912. UseIntermediateOperand(result.tag);
  8913. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8914. IntermediateCode.MakeMemory(result.op,addressType);
  8915. END;
  8916. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8917. ReleaseIntermediateOperand(result.tag);
  8918. result.tag := TypeDescriptorAdr(type);
  8919. UseIntermediateOperand(result.tag);
  8920. (* tag for pointer type computed not here but during dereferencing *)
  8921. END;
  8922. IF Trace THEN TraceExit("VisitVariable") END;
  8923. END VisitVariable;
  8924. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8925. BEGIN
  8926. VisitVariable(property);
  8927. END VisitProperty;
  8928. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8929. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8930. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8931. BEGIN
  8932. type := x.type.resolved;
  8933. IF Trace THEN TraceEnter("VisitParameter") END;
  8934. IF x.ownerType IS SyntaxTree.CellType THEN
  8935. ptype := x.type.resolved;
  8936. IF backend.cellsAreObjects THEN
  8937. ASSERT(result.mode = ModeReference);
  8938. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8939. ReuseCopy(temp,result.op);
  8940. ReleaseIntermediateOperand(result.op);
  8941. result.op := temp;
  8942. END;
  8943. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8944. RETURN;
  8945. ELSE
  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. END;
  8952. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8953. InitOperand(result,ModeReference);
  8954. GetCodeSectionNameForSymbol(x,name);
  8955. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8956. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8957. RETURN
  8958. ELSE
  8959. GetBaseRegister(basereg,currentScope,x.scope);
  8960. InitOperand(result,ModeReference);
  8961. result.op := basereg;
  8962. END;
  8963. IF IsOpenArray(type) THEN
  8964. result.tag := basereg;
  8965. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8966. IntermediateCode.MakeMemory(result.op,addressType);
  8967. IF Global.IsOberonProcedure(x.ownerType) THEN
  8968. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8969. UseIntermediateOperand(result.tag);
  8970. ELSE
  8971. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8972. END;
  8973. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8974. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8975. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8976. ELSIF IsStaticArray(type) THEN
  8977. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8978. IntermediateCode.MakeMemory(result.op,addressType);
  8979. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8980. ELSIF type IS SyntaxTree.MathArrayType THEN
  8981. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8982. WITH type: SyntaxTree.MathArrayType DO
  8983. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8984. IF type.form = SyntaxTree.Tensor THEN
  8985. ELSIF type.form = SyntaxTree.Open THEN
  8986. result.tag := result.op;
  8987. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8988. IntermediateCode.MakeMemory(result.op,addressType);
  8989. UseIntermediateOperand(result.tag);
  8990. ELSIF type.form = SyntaxTree.Static THEN
  8991. IF x.kind = SyntaxTree.ConstParameter THEN
  8992. IntermediateCode.MakeMemory(result.op,addressType);
  8993. END;
  8994. ELSE HALT(100)
  8995. END;
  8996. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8997. IF type.form = SyntaxTree.Tensor THEN
  8998. ToMemory(result.op,addressType,0);
  8999. ELSIF type.form = SyntaxTree.Open THEN
  9000. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9001. ReuseCopy(result.tag, mem);
  9002. ReleaseIntermediateOperand(mem);
  9003. ReleaseIntermediateOperand(result.op);
  9004. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9005. ELSIF type.form = SyntaxTree.Static THEN
  9006. IntermediateCode.MakeMemory(result.op,addressType);
  9007. ELSE HALT(100)
  9008. END;
  9009. ELSE HALT(100)
  9010. END;
  9011. END;
  9012. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9013. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9014. IntermediateCode.MakeMemory(result.op,addressType);
  9015. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9016. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9017. END;
  9018. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  9019. ValueToCondition(result);
  9020. ELSIF type IS SyntaxTree.ProcedureType THEN
  9021. ReleaseIntermediateOperand(result.tag);
  9022. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9023. IF x.kind = SyntaxTree.VarParameter THEN
  9024. ReuseCopy(result.tag,result.op);
  9025. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9026. IntermediateCode.MakeMemory(result.tag,addressType);
  9027. ELSE
  9028. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9029. UseIntermediateOperand(result.tag);
  9030. END;
  9031. ELSE
  9032. result.tag := nil;
  9033. END;
  9034. (* tag for pointer type computed not here but during dereferencing *)
  9035. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9036. ReleaseIntermediateOperand(result.tag);
  9037. result.tag := basereg;
  9038. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9039. IntermediateCode.MakeMemory(result.tag,addressType);
  9040. UseIntermediateOperand(result.tag);
  9041. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9042. ReleaseIntermediateOperand(result.tag);
  9043. result.tag := TypeDescriptorAdr(type);
  9044. UseIntermediateOperand(result.tag);
  9045. END;
  9046. IF Trace THEN TraceExit("VisitParameter") END;
  9047. END VisitParameter;
  9048. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9049. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9050. BEGIN
  9051. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9052. (* left.p: left already emitted *)
  9053. tag := result.op; (* value of pointer to left *)
  9054. (* get type desc *)
  9055. tmp := result.tag;
  9056. IntermediateCode.MakeMemory(tmp,addressType);
  9057. (* get method adr *)
  9058. Reuse1(reg,tmp);
  9059. ReleaseIntermediateOperand(tmp);
  9060. IF backend.cooperative THEN
  9061. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9062. WHILE recordType.baseType # NIL DO
  9063. recordType := recordType.GetBaseRecord ();
  9064. END;
  9065. GetRecordTypeName (recordType,name);
  9066. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9067. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9068. offset := 0;
  9069. ELSE
  9070. offset := 2;
  9071. END;
  9072. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9073. ELSIF meta.simple THEN
  9074. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9075. ELSE
  9076. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9077. END;
  9078. InitOperand(operand,ModeReference);
  9079. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9080. operand.op := reg;
  9081. operand.tag := tag;
  9082. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9083. END DynamicCallOperand;
  9084. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9085. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9086. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9087. BEGIN
  9088. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9089. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9090. tag := operand.op;
  9091. ReleaseIntermediateOperand(operand.tag);
  9092. ELSE tag := nil
  9093. END;
  9094. IF x.isInline THEN
  9095. sectionType := Sections.InlineCodeSection;
  9096. ELSE
  9097. sectionType := Sections.CodeSection;
  9098. END;
  9099. IF x.externalName # NIL THEN
  9100. Basic.ToSegmentedName(x.externalName^, name);
  9101. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9102. ELSE
  9103. GetCodeSectionNameForSymbol(x, name);
  9104. IF (x.scope.ownerModule = module.module) THEN
  9105. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9106. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9107. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9108. IF source.pc = 0 THEN (* no code yet *)
  9109. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9110. END;
  9111. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9112. bits := x.procedureScope.body.code.inlineCode;
  9113. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9114. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9115. binary.CopyBits(bits, 0, bits.GetSize());
  9116. source.SetResolved(binary);
  9117. ELSE
  9118. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9119. END;
  9120. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9121. END;
  9122. InitOperand(operand,ModeValue);
  9123. operand.op := reg;
  9124. operand.tag := tag;
  9125. IF Trace THEN TraceExit("StaticCallOperand") END;
  9126. END StaticCallOperand;
  9127. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9128. (* handle expressions of the form designator.procedure or procedure *)
  9129. BEGIN
  9130. IF Trace THEN TraceEnter("VisitProcedure") END;
  9131. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9132. DynamicCallOperand(result,x);
  9133. ELSIF x.isInline THEN
  9134. StaticCallOperand(result,x);
  9135. ELSE
  9136. StaticCallOperand(result,x);
  9137. END;
  9138. IF Trace THEN TraceExit("VisitProcedure") END;
  9139. END VisitProcedure;
  9140. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9141. BEGIN
  9142. VisitProcedure(x);
  9143. END VisitOperator;
  9144. (** statements *)
  9145. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9146. BEGIN
  9147. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9148. Expression(x.call);
  9149. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9150. ReleaseOperand(result)
  9151. END;
  9152. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9153. END VisitProcedureCallStatement;
  9154. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9155. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9156. leftBase, rightBase: SyntaxTree.Type;
  9157. procedureName,s: SyntaxTree.IdentifierString;
  9158. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9159. size: LONGINT; rightKind: LONGINT;
  9160. dummy: IntermediateCode.Operand;
  9161. CONST moduleName = "FoxArrayBase";
  9162. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9163. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9164. BEGIN
  9165. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9166. IF base IS SyntaxTree.MathArrayType THEN
  9167. base := OpenArray(base(SyntaxTree.MathArrayType));
  9168. END;
  9169. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9170. result.SetArrayBase(base);
  9171. RETURN result
  9172. END OpenArray;
  9173. BEGIN
  9174. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9175. SaveRegisters();ReleaseUsedRegisters(saved);
  9176. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9177. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9178. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9179. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9180. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9181. IF leftType.form = SyntaxTree.Tensor THEN
  9182. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9183. ELSIF leftType.form = SyntaxTree.Open THEN
  9184. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9185. ELSIF leftType.form = SyntaxTree.Static THEN
  9186. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9187. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9188. END;
  9189. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9190. IF procedure = NIL THEN
  9191. s := "Instruction not supported on target, emulation procedure ";
  9192. Strings.Append(s,moduleName);
  9193. Strings.Append(s,".");
  9194. Strings.Append(s,procedureName);
  9195. Strings.Append(s," not present");
  9196. Error(position,s);
  9197. ELSE
  9198. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9199. parameter.SetType(leftType);
  9200. parameter.SetAccess(SyntaxTree.Internal);
  9201. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9202. parameter.SetKind(rightKind);
  9203. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9204. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9205. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9206. StaticCallOperand(result,procedure);
  9207. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9208. ReleaseOperand(result);
  9209. END;
  9210. RestoreRegisters(saved);
  9211. END;
  9212. END AssignMathArray;
  9213. VAR modifyAssignmentCounter := 0: LONGINT;
  9214. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9215. VAR processor,mem,dst: IntermediateCode.Operand;
  9216. BEGIN
  9217. IF value.intValue = true.intValue THEN
  9218. INC(modifyAssignmentCounter);
  9219. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9220. modifyAssignmentsPC := section.pc;
  9221. ELSE
  9222. DEC(modifyAssignmentCounter);
  9223. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9224. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9225. END;
  9226. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9227. dst := NewRegisterOperand (addressType);
  9228. Emit(Mov(position,dst, processor));
  9229. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9230. Emit(Mov(position,mem, value));
  9231. ReleaseIntermediateOperand(dst);
  9232. END ModifyAssignments;
  9233. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9234. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9235. BEGIN
  9236. type := left.type.resolved;
  9237. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9238. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9239. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9240. IF procedureType.returnParameter = parameter THEN
  9241. (* this is the only case where the destination can be dynamically smaller than the source
  9242. in all other cases the dynamic size has to be taken
  9243. *)
  9244. IF backend.cooperative THEN
  9245. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9246. ELSE
  9247. MakeMemory(mem, tag, addressType, 0);
  9248. END;
  9249. RETURN mem;
  9250. END;
  9251. END;
  9252. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9253. END CopySize;
  9254. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9255. VAR
  9256. leftO, rightO: Operand;
  9257. arg,mem, sizeOp: IntermediateCode.Operand;
  9258. leftType, rightType, componentType, base: SyntaxTree.Type;
  9259. size: LONGINT;
  9260. parameters: SyntaxTree.ExpressionList;
  9261. procedure: SyntaxTree.Procedure;
  9262. call: SyntaxTree.ProcedureCallDesignator;
  9263. designator: SyntaxTree.Designator;
  9264. saved: RegisterEntry;
  9265. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9266. VAR procedureType: SyntaxTree.ProcedureType;
  9267. BEGIN
  9268. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9269. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9270. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9271. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9272. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9273. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9274. IF right.id = Global.Reshape THEN RETURN TRUE
  9275. END;
  9276. END;
  9277. END;
  9278. END;
  9279. RETURN FALSE
  9280. END CanPassAsResultParameter;
  9281. BEGIN
  9282. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9283. leftType := left.type.resolved; rightType:= right.type.resolved;
  9284. IF backend.cooperative & left.NeedsTrace() THEN
  9285. ModifyAssignments(true);
  9286. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9287. Designate(right, rightO);
  9288. Designate(left, leftO);
  9289. ASSERT(leftO.mode = ModeReference);
  9290. TransferToRegister(leftO.op, leftO.op);
  9291. TransferToRegister(rightO.op, rightO.op);
  9292. Emit(Push(position, leftO.op));
  9293. Emit(Push(position, rightO.op));
  9294. CallAssignMethod(leftO.op, rightO.op, left.type);
  9295. Emit(Pop(position, rightO.op));
  9296. Emit(Pop(position, leftO.op));
  9297. sizeOp := CopySize(left, leftO.tag);
  9298. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9299. ReleaseIntermediateOperand(sizeOp);
  9300. ReleaseOperand(leftO);
  9301. ReleaseOperand(rightO);
  9302. ELSE
  9303. Evaluate(right,rightO);
  9304. Designate(left,leftO);
  9305. ASSERT(leftO.mode = ModeReference);
  9306. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9307. (* copy procedure address first *)
  9308. MakeMemory(mem,leftO.op,addressType,0);
  9309. Emit(Mov(position,mem,rightO.op));
  9310. ReleaseIntermediateOperand(mem);
  9311. (* copy pointer address *)
  9312. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9313. CallAssignPointer(leftO.tag, rightO.tag);
  9314. ELSE
  9315. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9316. CallAssignPointer(leftO.op, rightO.op);
  9317. END;
  9318. ReleaseOperand(leftO);
  9319. ReleaseOperand(rightO);
  9320. END;
  9321. ModifyAssignments(false);
  9322. RETURN;
  9323. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9324. SaveRegisters();ReleaseUsedRegisters(saved);
  9325. IF SemanticChecker.IsPointerType(leftType) THEN
  9326. Evaluate(right,rightO);
  9327. Designate(left,leftO);
  9328. Emit(Push(position,leftO.op));
  9329. ReleaseOperand(leftO);
  9330. Emit(Push(position,rightO.op));
  9331. ReleaseOperand(rightO);
  9332. CallThis(position,"Heaps","Assign",2);
  9333. ELSIF leftType.IsRecordType() THEN
  9334. Designate(right,rightO);
  9335. Designate(left,leftO);
  9336. Emit(Push(position,leftO.op));
  9337. Emit(Push(position,leftO.tag)); (* type desc *)
  9338. ReleaseOperand(leftO);
  9339. Emit(Push(position,rightO.op));
  9340. ReleaseOperand(rightO);
  9341. CallThis(position,"Heaps","AssignRecord",3);
  9342. ELSIF IsStaticArray(leftType) THEN
  9343. size := StaticArrayNumElements(leftType);
  9344. base := StaticArrayBaseType(leftType);
  9345. Designate(right,rightO);
  9346. Designate(left,leftO);
  9347. Emit(Push(position,leftO.op));
  9348. ReleaseOperand(leftO);
  9349. arg := TypeDescriptorAdr(base);
  9350. Emit(Push(position,arg));
  9351. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9352. Emit(Push(position,rightO.op));
  9353. ReleaseOperand(rightO);
  9354. CallThis(position,"Heaps","AssignArray",4);
  9355. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9356. size := StaticMathArrayNumElements(leftType);
  9357. base := StaticMathArrayBaseType(leftType);
  9358. Designate(right,rightO);
  9359. Designate(left,leftO);
  9360. Emit(Push(position,leftO.op));
  9361. ReleaseOperand(leftO);
  9362. arg := TypeDescriptorAdr(base);
  9363. Emit(Push(position,arg));
  9364. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9365. Emit(Push(position,rightO.op));
  9366. ReleaseOperand(rightO);
  9367. CallThis(position,"Heaps","AssignArray",4);
  9368. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9369. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9370. Evaluate(right,rightO);
  9371. Designate(left,leftO);
  9372. MakeMemory(mem,leftO.op,addressType,0);
  9373. Emit(Mov(position,mem,rightO.op));
  9374. ReleaseIntermediateOperand(mem);
  9375. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9376. Emit (Push(position, leftO.tag));
  9377. ReleaseOperand(leftO);
  9378. Emit (Push(position, rightO.tag));
  9379. ReleaseOperand(rightO);
  9380. CallThis(position,"Heaps","Assign", 2);
  9381. ELSE HALT(100); (* missing ? *)
  9382. END;
  9383. RestoreRegisters(saved);
  9384. RETURN;
  9385. END;
  9386. IF CanPassAsResultParameter(right) THEN
  9387. procedureResultDesignator := left(SyntaxTree.Designator);
  9388. Expression(right);
  9389. procedureResultDesignator := NIL;
  9390. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9391. (* left <-- ALIAS OF right: zerocopy *)
  9392. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9393. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9394. designator.SetType(procedure.type);
  9395. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9396. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9397. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9398. END;
  9399. ELSIF leftType IS SyntaxTree.RangeType THEN
  9400. (* LHS is of array range type *)
  9401. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9402. Evaluate(right, rightO);
  9403. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9404. (* first *)
  9405. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9406. Emit(Mov(position,mem, rightO.op));
  9407. ReleaseIntermediateOperand(mem);
  9408. (* last *)
  9409. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9410. Emit(Mov(position,mem, rightO.tag));
  9411. ReleaseIntermediateOperand(mem);
  9412. (* step *)
  9413. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9414. Emit(Mov(position,mem, rightO.extra));
  9415. ReleaseIntermediateOperand(mem);
  9416. ReleaseOperand(rightO);
  9417. ReleaseOperand(leftO)
  9418. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9419. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9420. Evaluate(right, rightO);
  9421. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9422. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9423. (* real part *)
  9424. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9425. Emit(Mov(position,mem, rightO.op));
  9426. ReleaseIntermediateOperand(mem);
  9427. (* imaginary part *)
  9428. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9429. Emit(Mov(position,mem, rightO.tag));
  9430. ReleaseIntermediateOperand(mem);
  9431. ReleaseOperand(rightO);
  9432. ReleaseOperand(leftO)
  9433. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9434. OR (leftType IS SyntaxTree.PortType) THEN
  9435. (* rightO := leftO;*)
  9436. Evaluate(right,rightO);
  9437. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9438. Designate(left,leftO);
  9439. IF leftO.mode = ModeReference THEN
  9440. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9441. destination := mem;
  9442. ELSE
  9443. destination := leftO.op;
  9444. END;
  9445. ReleaseOperand(leftO);
  9446. IF destination.mode # IntermediateCode.Undefined THEN
  9447. Emit(Mov(position,destination,rightO.op));
  9448. END;
  9449. ReleaseOperand(rightO);
  9450. ReleaseIntermediateOperand(mem);
  9451. IntermediateCode.InitOperand(destination);
  9452. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9453. Evaluate(right,rightO);
  9454. Designate(left,leftO);
  9455. MakeMemory(mem,leftO.op,addressType,0);
  9456. Emit(Mov(position,mem,rightO.op));
  9457. ReleaseIntermediateOperand(mem);
  9458. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9459. (* delegate *)
  9460. (*
  9461. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9462. *)
  9463. Emit(Mov(position,leftO.tag,rightO.tag));
  9464. END;
  9465. ReleaseOperand(leftO);
  9466. ReleaseOperand(rightO);
  9467. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9468. Designate(right,rightO);
  9469. Designate(left,leftO);
  9470. sizeOp := CopySize(left, leftO.tag);
  9471. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9472. ReleaseIntermediateOperand(sizeOp);
  9473. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9474. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9475. IF (rightType IS SyntaxTree.StringType) THEN
  9476. CopyString(left,right);
  9477. 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
  9478. Designate(right,rightO);
  9479. Designate(left,leftO);
  9480. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9481. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9482. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9483. ELSE
  9484. HALT(201)
  9485. END;
  9486. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9487. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9488. Designate(right,rightO);
  9489. Designate(left,leftO);
  9490. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9491. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9492. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9493. Emit(Mov(position, leftO.op, mem));
  9494. ReleaseIntermediateOperand(mem);
  9495. ELSE
  9496. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9497. END;
  9498. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9499. ELSE
  9500. AssignMathArray(left,right);
  9501. END;
  9502. ELSE
  9503. HALT(200);
  9504. END;
  9505. END Assign;
  9506. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9507. BEGIN
  9508. IF Trace THEN TraceEnter("VisitAssignment") END;
  9509. Assign(x.left,x.right);
  9510. IF Trace THEN TraceExit("VisitAssignment") END;
  9511. END VisitAssignment;
  9512. PROCEDURE EmitCooperativeSwitch;
  9513. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9514. BEGIN
  9515. ASSERT (cooperativeSwitches);
  9516. pc := section.pc;
  9517. IF lastSwitchPC = section.pc THEN RETURN END;
  9518. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9519. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9520. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9521. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9522. INC(statCoopSwitch, section.pc - pc);
  9523. END EmitCooperativeSwitch;
  9524. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9525. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9526. BEGIN
  9527. p0 := communication.left; p1 := communication.right;
  9528. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9529. Evaluate(p0,s0);
  9530. Evaluate(p1,s1);
  9531. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9532. Emit(Push(position,s0.op));
  9533. Emit(Push(position,s1.op));
  9534. (*
  9535. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9536. *)
  9537. IF ~backend.cellsAreObjects THEN
  9538. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9539. END;
  9540. ReleaseOperand(s0);
  9541. ReleaseOperand(s1);
  9542. IF backend.cellsAreObjects THEN
  9543. CallThis(position,"ActiveCellsRuntime","Send",2);
  9544. ELSE
  9545. CallThis(position,ChannelModuleName,"Send",2);
  9546. END;
  9547. (* ----- RECEIVE ------*)
  9548. ELSE
  9549. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9550. tmp := p0; p0 := p1; p1 := tmp;
  9551. END;
  9552. Evaluate(p0,s0);
  9553. Emit(Push(position,s0.op));
  9554. Designate(p1,s1);
  9555. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9556. Emit(Push(position,s1.op));
  9557. (*
  9558. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9559. *)
  9560. IF ~backend.cellsAreObjects THEN
  9561. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9562. END;
  9563. ReleaseOperand(s0);
  9564. ReleaseOperand(s1);
  9565. IF backend.cellsAreObjects THEN
  9566. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9567. ELSE
  9568. CallThis(position,ChannelModuleName,"Receive",2)
  9569. END;
  9570. END;
  9571. END VisitCommunicationStatement;
  9572. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9573. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9574. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9575. VAR true, false: Label; condition, value: BOOLEAN;
  9576. BEGIN
  9577. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9578. IF condition THEN
  9579. true := NewLabel();
  9580. false := NewLabel();
  9581. Condition(if.condition,true,false);
  9582. SetLabel(true);
  9583. StatementSequence(if.statements);
  9584. BrL(end);
  9585. SetLabel(false);
  9586. ELSE
  9587. IF value THEN (* always true *)
  9588. escape := TRUE;
  9589. StatementSequence(if.statements);
  9590. (* no branch necessary -- rest skipped *)
  9591. END;
  9592. END;
  9593. END IfPart;
  9594. BEGIN
  9595. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9596. end := NewLabel();
  9597. elsifs := x.ElsifParts();
  9598. IfPart(x.ifPart);
  9599. FOR i := 0 TO elsifs-1 DO
  9600. IF ~escape THEN
  9601. elsif := x.GetElsifPart(i);
  9602. IfPart(elsif);
  9603. END;
  9604. END;
  9605. IF (x.elsePart # NIL) & ~escape THEN
  9606. StatementSequence(x.elsePart);
  9607. END;
  9608. SetLabel(end);
  9609. IF Trace THEN TraceExit("VisitIfStatement") END;
  9610. END VisitIfStatement;
  9611. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9612. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9613. BEGIN
  9614. (*IF x.variable.type.resolved = x.type.resolved THEN
  9615. (* always true, do nothing *)
  9616. ELSE*)
  9617. Designate(x.variable,res);
  9618. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9619. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9620. END;
  9621. trueL := NewLabel();
  9622. TypeTest(res.tag,x.type,trueL,falseL);
  9623. ReleaseOperand(res);
  9624. SetLabel(trueL);
  9625. StatementSequence(x.statements);
  9626. BrL(endL);
  9627. END WithPart;
  9628. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9629. VAR endL,falseL: Label;i: LONGINT;
  9630. BEGIN
  9631. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9632. endL := NewLabel();
  9633. FOR i := 0 TO x.WithParts()-1 DO
  9634. falseL := NewLabel();
  9635. WithPart(x.GetWithPart(i),falseL,endL);
  9636. SetLabel(falseL);
  9637. END;
  9638. IF x.elsePart = NIL THEN
  9639. IF ~isUnchecked THEN
  9640. EmitTrap(position,WithTrap);
  9641. END;
  9642. ELSE
  9643. StatementSequence(x.elsePart)
  9644. END;
  9645. SetLabel(endL);
  9646. IF Trace THEN TraceExit("VisitWithStatement") END;
  9647. END VisitWithStatement;
  9648. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9649. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9650. out,else: Label; label: Label;
  9651. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9652. symbol: SyntaxTree.Symbol;
  9653. BEGIN
  9654. (*! split case statement into if-elsif statements for large case label lists *)
  9655. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9656. range := x.max-x.min+1;
  9657. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9658. END;
  9659. size := LONGINT(range);
  9660. Evaluate(x.variable,var);
  9661. ReuseCopy(tmp,var.op);
  9662. ReleaseIntermediateOperand(var.op);
  9663. var.op := tmp;
  9664. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9665. Convert(var.op,addressType);
  9666. else := NewLabel();
  9667. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9668. (*
  9669. UniqueId(name,module.module,"case",caseId);
  9670. *)
  9671. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9672. Global.GetModuleSegmentedName(module.module, name);
  9673. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9674. symbol := SyntaxTree.NewSymbol(name[1]);
  9675. symbol.SetScope(moduleScope);
  9676. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9677. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9678. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9679. ReuseCopy(res,var.op);
  9680. ReleaseOperand(var);
  9681. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9682. Emit(Add(position,res,res,jmp));
  9683. IntermediateCode.MakeMemory(res,addressType);
  9684. Emit(Br(position,res));
  9685. ReleaseIntermediateOperand(res);
  9686. out := NewLabel();
  9687. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9688. part := x.GetCasePart(i);
  9689. constant := part.firstConstant;
  9690. label := NewLabel();
  9691. SetLabel(label);
  9692. WHILE(constant # NIL) DO (* case labels for this case part *)
  9693. FOR j := constant.min TO constant.max DO
  9694. fixups[j-x.min] := label;
  9695. END;
  9696. constant := constant.next;
  9697. END;
  9698. StatementSequence(part.statements);
  9699. BrL(out);
  9700. END;
  9701. SetLabel(else);
  9702. FOR i := 0 TO size-1 DO
  9703. IF fixups[i] = NIL THEN
  9704. fixups[i] := else;
  9705. END;
  9706. END;
  9707. IF x.elsePart # NIL THEN
  9708. StatementSequence(x.elsePart);
  9709. ELSIF ~isUnchecked THEN
  9710. EmitTrap(position,CaseTrap);
  9711. END;
  9712. SetLabel(out);
  9713. FOR i := 0 TO size-1 DO
  9714. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9715. section.Emit(Data(position,op));
  9716. END;
  9717. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9718. END VisitCaseStatement;
  9719. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9720. VAR start: Label; true,false: Label;
  9721. BEGIN
  9722. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9723. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9724. start := NewLabel();
  9725. true := NewLabel();
  9726. false := NewLabel();
  9727. SetLabel(start);
  9728. Condition(x.condition,true,false);
  9729. SetLabel(true);
  9730. StatementSequence(x.statements);
  9731. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9732. BrL(start);
  9733. SetLabel(false);
  9734. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9735. END VisitWhileStatement;
  9736. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9737. VAR false,true: Label;
  9738. BEGIN
  9739. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9740. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9741. true := NewLabel();
  9742. false := NewLabel();
  9743. SetLabel(false);
  9744. StatementSequence(x.statements);
  9745. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9746. Condition(x.condition,true,false);
  9747. SetLabel(true);
  9748. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9749. END VisitRepeatStatement;
  9750. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9751. VAR
  9752. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9753. temporaryVariable: SyntaxTree.Variable;
  9754. temporaryVariableDesignator : SyntaxTree.Designator;
  9755. BEGIN
  9756. IF Trace THEN TraceEnter("VisitForStatement") END;
  9757. true := NewLabel();
  9758. false := NewLabel();
  9759. start := NewLabel();
  9760. Assign(x.variable,x.from);
  9761. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9762. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9763. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9764. Assign(temporaryVariableDesignator,x.to);
  9765. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9766. IF by > 0 THEN
  9767. cmp := Scanner.LessEqual
  9768. ELSE
  9769. cmp := Scanner.GreaterEqual
  9770. END;
  9771. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9772. binary.SetType(system.booleanType);
  9773. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9774. SetLabel(start);
  9775. Condition(binary,true,false);
  9776. SetLabel(true);
  9777. StatementSequence(x.statements);
  9778. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9779. binary.SetType(x.variable.type);
  9780. Assign(x.variable,binary);
  9781. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9782. BrL(start);
  9783. SetLabel(false);
  9784. IF Trace THEN TraceExit("VisitForStatement") END;
  9785. END VisitForStatement;
  9786. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9787. VAR prevLoop: Label;
  9788. BEGIN
  9789. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9790. prevLoop := currentLoop;
  9791. currentLoop := NewLabel();
  9792. StatementSequence(x.statements);
  9793. SetLabel(currentLoop);
  9794. currentLoop := prevLoop;
  9795. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9796. END VisitExitableBlock;
  9797. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9798. VAR prevLoop,start: Label;
  9799. BEGIN
  9800. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9801. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9802. start := NewLabel();
  9803. prevLoop := currentLoop;
  9804. SetLabel(start);
  9805. currentLoop := NewLabel();
  9806. StatementSequence(x.statements);
  9807. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9808. BrL(start);
  9809. SetLabel(currentLoop);
  9810. currentLoop := prevLoop;
  9811. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9812. END VisitLoopStatement;
  9813. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9814. VAR outer: SyntaxTree.Statement;
  9815. BEGIN
  9816. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9817. IF locked THEN (* r if we jump out of an exclusive block *)
  9818. outer := x.outer;
  9819. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9820. outer := outer.outer;
  9821. END;
  9822. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9823. Lock(FALSE);
  9824. END;
  9825. END;
  9826. BrL(currentLoop);
  9827. IF Trace THEN TraceExit("VisitExitStatement") END;
  9828. END VisitExitStatement;
  9829. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9830. VAR
  9831. expression, parameterDesignator: SyntaxTree.Expression;
  9832. type, componentType: SyntaxTree.Type;
  9833. res, right: Operand;
  9834. left, mem, reg: IntermediateCode.Operand;
  9835. parameter: SyntaxTree.Parameter;
  9836. procedure: SyntaxTree.Procedure;
  9837. procedureType: SyntaxTree.ProcedureType;
  9838. returnTypeOffset: LONGINT;
  9839. delegate: BOOLEAN;
  9840. map: SymbolMap;
  9841. callingConvention, parametersSize: LONGINT;
  9842. BEGIN
  9843. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9844. expression := x.returnValue;
  9845. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9846. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9847. IF currentIsInline THEN
  9848. IF expression # NIL THEN
  9849. map := currentMapper.Get(NIL);
  9850. IF map # NIL THEN
  9851. Assign(map.to, expression);
  9852. ELSE
  9853. Evaluate(expression,res);
  9854. Emit(Return(position,res.op));
  9855. ReleaseOperand(res);
  9856. END;
  9857. END;
  9858. BrL(currentInlineExit);
  9859. RETURN;
  9860. END;
  9861. IF expression # NIL THEN
  9862. type := expression.type.resolved;
  9863. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9864. IF locked THEN Lock(FALSE) END;
  9865. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9866. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9867. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9868. 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
  9869. (* return without structured return parameter *)
  9870. Evaluate(expression,res);
  9871. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9872. IF locked OR profile THEN
  9873. Emit(Push(position,res.op));
  9874. IF delegate THEN HALT(200) END;
  9875. ReleaseOperand(res);
  9876. IF locked THEN Lock(FALSE) END;
  9877. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9878. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9879. reg := NewRegisterOperand(res.op.type);
  9880. Emit(Pop(position,reg));
  9881. Emit(Return(position,reg));
  9882. ReleaseIntermediateOperand(reg);
  9883. ELSE
  9884. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9885. Emit(Return(position,res.op));
  9886. ReleaseOperand(res);
  9887. END;
  9888. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9889. THEN
  9890. (* return using structured return parameter *)
  9891. 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)
  9892. OR SemanticChecker.IsPointerType(type));
  9893. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9894. parameter :=procedureType.returnParameter;
  9895. ASSERT(parameter # NIL);
  9896. returnTypeOffset := parameter.offsetInBits;
  9897. (*
  9898. IF parameter# NIL THEN
  9899. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9900. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9901. ELSE
  9902. returnTypeOffset := system.offsetFirstParameter
  9903. END;
  9904. *)
  9905. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9906. IF type IS SyntaxTree.RangeType THEN
  9907. (* array range type *)
  9908. Evaluate(expression, right);
  9909. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9910. Emit(Mov(position,mem, right.op)); (* first *)
  9911. ReleaseIntermediateOperand(mem);
  9912. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9913. Emit(Mov(position,mem, right.tag)); (* last *)
  9914. ReleaseIntermediateOperand(mem);
  9915. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9916. Emit(Mov(position,mem, right.extra)); (* step *)
  9917. ReleaseIntermediateOperand(mem);
  9918. ReleaseOperand(right);
  9919. ELSIF type IS SyntaxTree.ComplexType THEN
  9920. Evaluate(expression, right);
  9921. componentType := type(SyntaxTree.ComplexType).componentType;
  9922. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9923. Emit(Mov(position,mem, right.op)); (* real part *)
  9924. ReleaseIntermediateOperand(mem);
  9925. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9926. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9927. ReleaseIntermediateOperand(mem);
  9928. ReleaseOperand(right);
  9929. ELSE (* covers cases: pointer / record / array *)
  9930. parameter := procedureType.returnParameter;
  9931. checker.SetCurrentScope(currentScope);
  9932. ASSERT(parameter # NIL);
  9933. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9934. Assign(parameterDesignator,expression);
  9935. END;
  9936. ReleaseIntermediateOperand(left);
  9937. IF locked THEN Lock(FALSE) END;
  9938. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9939. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9940. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9941. parameter := procedureType.returnParameter;
  9942. checker.SetCurrentScope(currentScope);
  9943. IF parameter = NIL THEN
  9944. Error(procedure.position, "structured return of parameter of procedure not found");
  9945. ELSE
  9946. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9947. Assign(parameterDesignator,expression);
  9948. END;
  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. ELSE
  9953. HALT(200);
  9954. END;
  9955. ELSE
  9956. IF locked THEN Lock(FALSE) END;
  9957. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9958. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9959. END;
  9960. IF backend.cooperative THEN
  9961. BrL(exitLabel);
  9962. ELSE
  9963. callingConvention := procedureType.callingConvention;
  9964. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9965. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9966. ELSE
  9967. parametersSize := 0;
  9968. END;
  9969. EmitLeave(section, position,procedure, callingConvention);
  9970. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  9971. END;
  9972. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9973. END VisitReturnStatement;
  9974. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9975. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9976. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9977. statements: SyntaxTree.StatementSequence;
  9978. name, suffix: SyntaxTree.IdentifierString;
  9979. BEGIN
  9980. Strings.IntToStr(awaitProcCounter,suffix);
  9981. Strings.Concat("@AwaitProcedure",suffix,name);
  9982. identifier := SyntaxTree.NewIdentifier(name);
  9983. INC(awaitProcCounter);
  9984. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9985. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9986. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9987. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9988. procedure.SetAccess(SyntaxTree.Hidden);
  9989. procedure.SetScope(currentScope);
  9990. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9991. procedureType.SetReturnType(system.booleanType);
  9992. procedure.SetType(procedureType);
  9993. body := SyntaxTree.NewBody(x.position,procedureScope);
  9994. procedureScope.SetBody(body);
  9995. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9996. returnStatement.SetReturnValue(x.condition);
  9997. statements := SyntaxTree.NewStatementSequence();
  9998. statements.AddStatement(returnStatement);
  9999. body.SetStatementSequence(statements);
  10000. currentScope.AddProcedure(procedure);
  10001. RETURN procedure
  10002. END MakeAwaitProcedure;
  10003. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10004. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10005. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  10006. BEGIN
  10007. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10008. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10009. IF backend.cooperative THEN
  10010. start := NewLabel();
  10011. true := NewLabel();
  10012. false := NewLabel();
  10013. SetLabel(start);
  10014. Condition(x.condition,true,false);
  10015. SetLabel(false);
  10016. PushSelfPointer();
  10017. CallThis(position,"ExclusiveBlocks","Await",1);
  10018. BrL(start);
  10019. SetLabel(true);
  10020. PushSelfPointer();
  10021. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10022. ELSE
  10023. proc := MakeAwaitProcedure(x);
  10024. Emit(Push(position,fp));
  10025. GetCodeSectionNameForSymbol(proc,name);
  10026. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10027. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10028. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10029. Emit(Call(position,call,ProcParametersSize(proc)));
  10030. Emit(Result(position,res));
  10031. (*
  10032. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10033. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10034. *)
  10035. InitOperand(result,ModeValue);
  10036. result.op := res;
  10037. label := NewLabel();
  10038. BreqL(label, result.op, SELF.true);
  10039. ReleaseOperand(result);
  10040. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10041. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10042. Emit(Push(position,res));
  10043. Emit(Push(position,fp));
  10044. PushSelfPointer();
  10045. Emit(Push(position,nil));
  10046. CallThis(position,"Objects","Await",4);
  10047. SetLabel(label);
  10048. END;
  10049. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10050. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10051. END VisitAwaitStatement;
  10052. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10053. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10054. BEGIN
  10055. FOR i := 0 TO x.Length() - 1 DO
  10056. statement := x.GetStatement( i );
  10057. Statement(statement);
  10058. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10059. END;
  10060. END StatementSequence;
  10061. PROCEDURE PushSelfPointer;
  10062. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10063. procedureType: SyntaxTree.ProcedureType;
  10064. BEGIN
  10065. scope := currentScope;
  10066. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10067. scope := scope.outerScope;
  10068. END;
  10069. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10070. moduleSection := meta.ModuleSection();
  10071. IF backend.cooperative THEN
  10072. moduleOffset := 0;
  10073. ELSE
  10074. moduleOffset := moduleSection.pc;
  10075. END;
  10076. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10077. ELSE
  10078. GetBaseRegister(op.op,currentScope,scope);
  10079. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10080. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10081. parametersSize := ProcParametersSize(procedure);
  10082. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10083. IF backend.cooperative THEN
  10084. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10085. END;
  10086. IntermediateCode.MakeMemory(op.op,addressType);
  10087. END;
  10088. Emit(Push(position,op.op));
  10089. ReleaseOperand(op);
  10090. END PushSelfPointer;
  10091. PROCEDURE Lock(lock: BOOLEAN);
  10092. BEGIN
  10093. IF Trace THEN TraceEnter("Lock") END;
  10094. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10095. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10096. ASSERT(modifyAssignmentCounter = 0);
  10097. IF dump # NIL THEN
  10098. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10099. dump.Ln;dump.Update;
  10100. END;
  10101. PushSelfPointer;
  10102. IF backend.cooperative THEN
  10103. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10104. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10105. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10106. END;
  10107. ELSE
  10108. Emit(Push(position,true));
  10109. IF lock THEN CallThis(position,"Objects","Lock",2)
  10110. ELSE CallThis(position,"Objects","Unlock",2);
  10111. END;
  10112. END;
  10113. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10114. IF Trace THEN TraceExit("Lock") END;
  10115. END Lock;
  10116. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10117. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10118. BEGIN
  10119. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10120. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10121. previouslyUnchecked := isUnchecked;
  10122. isUnchecked := isUnchecked OR x.isUnchecked;
  10123. previouslyCooperativeSwitches := cooperativeSwitches;
  10124. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10125. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10126. IF x.statements # NIL THEN
  10127. StatementSequence(x.statements);
  10128. END;
  10129. IF (x IS SyntaxTree.Body) THEN
  10130. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10131. section.SetFinally(section.pc);
  10132. StatementSequence(x(SyntaxTree.Body).finally)
  10133. ELSIF x.isExclusive THEN
  10134. end := NewLabel();
  10135. BrL(end);
  10136. section.SetFinally(section.pc);
  10137. Lock(FALSE);
  10138. EmitTrap(position,RethrowTrap);
  10139. SetLabel(end);
  10140. END;
  10141. END;
  10142. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10143. isUnchecked := previouslyUnchecked;
  10144. cooperativeSwitches := previouslyCooperativeSwitches;
  10145. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10146. END VisitStatementBlock;
  10147. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10148. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10149. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10150. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10151. procedure: SyntaxTree.Procedure;
  10152. map: SymbolMap;
  10153. callingConvention, parametersSize: LONGINT;
  10154. BEGIN
  10155. scope := currentScope;
  10156. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10157. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10158. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10159. return := emptyOperand;
  10160. IF Trace THEN TraceEnter("VisitCode") END;
  10161. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10162. NEW(in, x.inRules.Length());
  10163. FOR i := 0 TO LEN(in)-1 DO
  10164. statement := x.inRules.GetStatement(i);
  10165. WITH statement: SyntaxTree.Assignment DO
  10166. Evaluate(statement.right, operand);
  10167. result := operand.op;
  10168. NEW(str, 64);
  10169. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10170. in[i] := result; IntermediateCode.SetString(in[i], str);
  10171. ReleaseIntermediateOperand(operand.tag);
  10172. END;
  10173. END;
  10174. ELSE in := NIL
  10175. END;
  10176. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10177. NEW(out, x.outRules.Length());
  10178. FOR i := 0 TO LEN(out)-1 DO
  10179. statement := x.outRules.GetStatement(i);
  10180. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10181. WITH statement: SyntaxTree.Assignment DO
  10182. Designate(statement.left, operand);
  10183. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10184. NEW(str, 64);
  10185. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10186. out[i] := result; IntermediateCode.SetString(out[i], str);
  10187. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10188. |statement: SyntaxTree.ReturnStatement DO
  10189. NEW(str, 64);
  10190. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10191. IF currentIsInline THEN
  10192. map := currentMapper.Get(NIL);
  10193. Designate(map.to, operand);
  10194. IF map.isAddress THEN
  10195. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10196. ELSE
  10197. result := operand.op;
  10198. END;
  10199. (*! only if it does not fit into register
  10200. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10201. *)
  10202. (*Evaluate(map.to, operand);*)
  10203. out[i] := result;
  10204. ELSE
  10205. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10206. END;
  10207. IntermediateCode.SetString(out[i], str);
  10208. ReleaseIntermediateOperand(operand.tag);
  10209. return := out[i];
  10210. ELSE
  10211. END;
  10212. END;
  10213. ELSE out := NIL
  10214. END;
  10215. Emit(Asm(x.position,x.sourceCode, in, out));
  10216. IF in # NIL THEN
  10217. FOR i := 0 TO LEN(in)-1 DO
  10218. ReleaseIntermediateOperand(in[i]);
  10219. END;
  10220. END;
  10221. IF out # NIL THEN
  10222. FOR i := 0 TO LEN(out)-1 DO
  10223. WITH statement: SyntaxTree.Assignment DO
  10224. ReleaseIntermediateOperand(out[i]);
  10225. |statement: SyntaxTree.ReturnStatement DO
  10226. (* release happens below *)
  10227. ELSE
  10228. END;
  10229. statement := x.outRules.GetStatement(i);
  10230. END;
  10231. END;
  10232. IF return.mode # IntermediateCode.Undefined THEN
  10233. IF currentIsInline THEN
  10234. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10235. Symbol(procedureType.returnParameter, par);
  10236. MakeMemory(mem, par.op, return.type, 0);
  10237. ReleaseOperand(par);
  10238. Emit(Mov(position, mem, return));
  10239. ReleaseIntermediateOperand(mem);
  10240. ELSE
  10241. Emit(Return(position,return));
  10242. END;
  10243. ReleaseIntermediateOperand(return);
  10244. IF currentIsInline THEN RETURN END;
  10245. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10246. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10247. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10248. ELSE
  10249. parametersSize := 0;
  10250. END;
  10251. EmitLeave(section, position,procedure, callingConvention);
  10252. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10253. END;
  10254. IF Trace THEN TraceExit("VisitCode") END;
  10255. END VisitCode;
  10256. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10257. BEGIN
  10258. RETURN ProcedureParametersSize(system, procedure);
  10259. END ProcParametersSize;
  10260. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10261. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10262. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10263. const, call: IntermediateCode.Operand;
  10264. parameterDesignator: SyntaxTree.Expression;
  10265. saved: RegisterEntry;
  10266. name: Basic.SegmentedName;
  10267. BEGIN
  10268. IF Trace THEN TraceEnter("ParameterCopies") END;
  10269. parameter := x.firstParameter;
  10270. WHILE parameter # NIL DO
  10271. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10272. type := parameter.type.resolved;
  10273. IF IsOpenArray(type) THEN
  10274. VisitParameter(parameter);
  10275. op := result;
  10276. IF backend.cooperative & parameter.NeedsTrace() THEN
  10277. length := GetArrayLength(type, op.tag);
  10278. size := NewRegisterOperand(addressType);
  10279. base := ArrayBaseType(type);
  10280. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10281. Emit(Mul(position, size, length, const));
  10282. dst := NewRegisterOperand (addressType);
  10283. Emit(Mov(position, dst, size));
  10284. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10285. Emit(Sub(position,dst,sp,dst));
  10286. Emit(And(position,dst,dst,const));
  10287. Emit(Mov(position,sp,dst));
  10288. par := fp;
  10289. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10290. IntermediateCode.InitImmediate(null, byteType, 0);
  10291. Emit(Fill(position, dst, size, null));
  10292. ReleaseIntermediateOperand(dst);
  10293. ReleaseIntermediateOperand(length);
  10294. SaveRegisters();ReleaseUsedRegisters(saved);
  10295. (* register dst has been freed before SaveRegisters already *)
  10296. base := ArrayBaseType(type);
  10297. (* assign method of open array *)
  10298. IF base.IsRecordType() THEN
  10299. Emit (Push(position, length));
  10300. Emit (Push(position, dst));
  10301. Emit (Push(position, op.op));
  10302. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10304. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10305. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10306. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10307. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10308. Emit (Push(position,length));
  10309. Emit (Push(position, dst));
  10310. Emit (Push(position, length));
  10311. Emit (Push(position, op.op));
  10312. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10313. ELSE
  10314. Emit (Push(position, length));
  10315. Emit (Push(position, dst));
  10316. Emit (Push(position, length));
  10317. Emit (Push(position, op.op));
  10318. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10319. ASSERT(ArrayBaseType(type).IsPointer());
  10320. END;
  10321. RestoreRegisters(saved);
  10322. ELSE
  10323. temp := GetDynamicSize(type,op.tag);
  10324. ReuseCopy(size,temp);
  10325. ReleaseIntermediateOperand(temp);
  10326. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10327. Emit(Sub(position,size,sp,size));
  10328. Emit(And(position,size,size,const));
  10329. Emit(Mov(position,sp,size));
  10330. par := fp;
  10331. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10332. ReleaseIntermediateOperand(size);
  10333. size := GetDynamicSize(type,op.tag);
  10334. END;
  10335. Emit(Copy(position,sp,op.op,size));
  10336. ReleaseIntermediateOperand(size);
  10337. ReleaseOperand(op);
  10338. IntermediateCode.MakeMemory(par,addressType);
  10339. Emit(Mov(position,par,sp));
  10340. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10341. checker.SetCurrentScope(currentScope);
  10342. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10343. Assign(parameterDesignator,parameterDesignator);
  10344. END;
  10345. END;
  10346. parameter := parameter.nextParameter;
  10347. END;
  10348. IF Trace THEN TraceExit("ParameterCopies") END;
  10349. END ParameterCopies;
  10350. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10351. VAR x: SyntaxTree.Variable;
  10352. BEGIN
  10353. x := scope.firstVariable;
  10354. WHILE x # NIL DO
  10355. InitVariable(x,FALSE);
  10356. x := x.nextVariable;
  10357. END;
  10358. END InitVariables;
  10359. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10360. BEGIN
  10361. IF (symbol # NIL) THEN
  10362. RETURN fingerPrinter.SymbolFP(symbol).public
  10363. ELSE
  10364. RETURN 0
  10365. END;
  10366. END GetFingerprint;
  10367. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10368. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10369. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10370. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10371. name: Basic.SegmentedName;
  10372. offset: LONGINT;
  10373. BEGIN
  10374. IF Trace THEN TraceEnter("Body") END;
  10375. ReleaseUsedRegisters(saved); (* just in case ... *)
  10376. section := ir;
  10377. exitLabel := NewLabel ();
  10378. IF moduleBody THEN moduleBodySection := section END;
  10379. IF ir.comments # NIL THEN
  10380. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10381. commentPrintout.SingleStatement(TRUE);
  10382. dump := ir.comments;
  10383. ELSE
  10384. commentPrintout := NIL;
  10385. dump := NIL;
  10386. END;
  10387. prevScope := currentScope;
  10388. currentScope := scope;
  10389. lastSwitchPC := 0;
  10390. cooperativeSwitches := backend.cooperative;
  10391. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10392. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10393. IF x # NIL THEN
  10394. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10395. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10396. IF moduleBody THEN
  10397. ProfilerInit();
  10398. ELSE
  10399. Basic.SegmentedNameToString(ir.name, string);
  10400. ProfilerAddProcedure(numberProcedures,string);
  10401. ProfilerEnterExit(numberProcedures,TRUE);
  10402. END;
  10403. END;
  10404. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10405. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10406. END;
  10407. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10408. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10409. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10410. IF procedure = cellScope.bodyProcedure THEN
  10411. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10412. StaticCallOperand(op, cellScope.constructor);
  10413. Emit(Call(position,op.op,0));
  10414. END;
  10415. END;
  10416. END;
  10417. InitVariables(scope);
  10418. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10419. GetCodeSectionNameForSymbol(procedure, name);
  10420. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10421. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10422. IF ProtectModulesPointers THEN
  10423. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10424. ELSE
  10425. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10426. END;
  10427. IntermediateCode.SetOffset(right,offset); (* tag *)
  10428. IntermediateCode.InitMemory(left,addressType,fp,0);
  10429. Emit(Mov(position, left, right));
  10430. END;
  10431. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10432. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10433. ParameterCopies(procedureType);
  10434. IF x.code = NIL THEN
  10435. VisitStatementBlock(x);
  10436. ELSE
  10437. VisitCode(x.code)
  10438. END;
  10439. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10440. IF ~backend.cooperative THEN
  10441. ProfilerEnterExit(numberProcedures,FALSE);
  10442. END;
  10443. INC(numberProcedures);
  10444. END;
  10445. END;
  10446. IF backend.cooperative THEN
  10447. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10448. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10449. END;
  10450. IF x # NIL THEN
  10451. SELF.position := x.position;
  10452. END;
  10453. CheckRegistersFree();
  10454. ASSERT(modifyAssignmentCounter = 0);
  10455. currentScope := prevScope;
  10456. IF Trace THEN TraceExit("Body") END;
  10457. END Body;
  10458. END ImplementationVisitor;
  10459. MetaDataGenerator=OBJECT
  10460. VAR
  10461. implementationVisitor: ImplementationVisitor;
  10462. declarationVisitor: DeclarationVisitor;
  10463. module: Sections.Module;
  10464. moduleName: ARRAY 128 OF CHAR;
  10465. moduleNamePool: Basic.HashTableInt;
  10466. moduleNamePoolSection: IntermediateCode.Section;
  10467. modulePointerSection: IntermediateCode.Section;
  10468. modulePointerSizePC: LONGINT;
  10469. modulePointerSectionOffset: LONGINT;
  10470. modulePointers: LONGINT;
  10471. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10472. RecordBaseOffset: LONGINT;
  10473. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10474. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10475. TypeTags: LONGINT; (* type extension level support *)
  10476. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10477. patchInfoPC: LONGINT;
  10478. patchCRC: LONGINT;
  10479. CONST
  10480. EmptyBlockOffset = 2;
  10481. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10482. BEGIN
  10483. IF implementationVisitor.backend.cooperative THEN
  10484. TypeTags := MAX(LONGINT);
  10485. BaseTypesTableOffset := 0;
  10486. MethodTableOffset := 2;
  10487. TypeRecordBaseOffset := 0;
  10488. RecordBaseOffset := 0;
  10489. ELSIF simple THEN
  10490. TypeTags := 3; (* only 3 extensions allowed *)
  10491. BaseTypesTableOffset := 1;
  10492. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10493. TypeRecordBaseOffset := 0;
  10494. RecordBaseOffset := 1;
  10495. ELSE
  10496. TypeTags := 16;
  10497. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10498. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10499. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10500. (* change this when Heaps.HeapBlock is modified *)
  10501. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10502. RecordBaseOffset := 8; (* addresses *)
  10503. ELSE
  10504. RecordBaseOffset := 9; (* addresses *)
  10505. END;
  10506. END;
  10507. SELF.simple := simple;
  10508. SELF.implementationVisitor := implementationVisitor;
  10509. SELF.declarationVisitor := declarationVisitor;
  10510. implementationVisitor.meta := SELF;
  10511. declarationVisitor.meta := SELF;
  10512. END InitMetaDataGenerator;
  10513. PROCEDURE SetModule(module: Sections.Module);
  10514. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10515. BEGIN
  10516. SELF.module := module;
  10517. Global.GetModuleName(module.module,moduleName);
  10518. Global.GetSymbolSegmentedName(module.module, name);
  10519. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10520. NEW(moduleNamePool, 32);
  10521. (*! require GC protection *)
  10522. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10523. IF ProtectModulesPointers THEN
  10524. name := "Heaps.AnyPtr";
  10525. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10526. (* set base pointer *)
  10527. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10528. END;
  10529. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10530. modulePointers := 0;
  10531. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10532. AddPointer(moduleNamePoolSection, namePoolOffset);
  10533. END;
  10534. END SetModule;
  10535. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10536. BEGIN
  10537. IF ~implementationVisitor.backend.cooperative THEN
  10538. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10539. INC(modulePointers);
  10540. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10541. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10542. END;
  10543. END AddPointer;
  10544. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10545. BEGIN
  10546. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10547. END GetTypeRecordBaseOffset;
  10548. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10549. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10550. BEGIN
  10551. (* change this when Heaps.HeapBlock is modified *)
  10552. INC(dataAdrOffset,7);
  10553. Info(section,"headerAdr");
  10554. Address(section,0);
  10555. Info(section,"typeDesc");
  10556. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10557. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10558. NamedSymbol(section, name, symbol, 0, offset);
  10559. Info(section,"mark: LONGINT;");
  10560. Longint(section,-1);
  10561. Info(section,"refCount: LONGINT;");
  10562. Longint(section,0);
  10563. (*
  10564. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10565. *)
  10566. Info(section,"dataAdr-: ADDRESS");
  10567. Symbol(section,section, dataAdrOffset,0);
  10568. Info(section,"size-: SIZE");
  10569. Address(section,0);
  10570. Info(section,"nextMark: HeapBlock;");
  10571. Address(section,0);
  10572. END HeapBlock;
  10573. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10574. VAR i: LONGINT;
  10575. BEGIN
  10576. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10577. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10578. Info(section,"count*: LONGINT");
  10579. Longint(section,0);
  10580. Info(section,"locked*: BOOLEAN");
  10581. Longint(section,0);
  10582. Info(section,"awaitingLock*: ProcessQueue");
  10583. Address(section,0);
  10584. Address(section,0);
  10585. Info(section,"awaitingCond*: ProcessQueue");
  10586. Address(section,0);
  10587. Address(section,0);
  10588. Info(section,"lockedBy*: ANY");
  10589. Address(section,0);
  10590. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10591. Longint(section,1);
  10592. FOR i := 2 TO 6 DO
  10593. Longint(section,0);
  10594. END;
  10595. Info(section,"lock*: ANY");
  10596. Address(section,0);
  10597. END ProtectedHeapBlock;
  10598. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10599. BEGIN
  10600. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10601. END Info;
  10602. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10603. VAR op: IntermediateCode.Operand;
  10604. BEGIN
  10605. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10606. section.Emit(Data(Basic.invalidPosition,op));
  10607. END Address;
  10608. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10609. VAR op: IntermediateCode.Operand;
  10610. BEGIN
  10611. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10612. section.Emit(Data(Basic.invalidPosition,op));
  10613. END Size;
  10614. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10615. VAR op: IntermediateCode.Operand;
  10616. BEGIN
  10617. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10618. section.Emit(Data(Basic.invalidPosition,op));
  10619. END Set;
  10620. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10621. VAR op: IntermediateCode.Operand;
  10622. BEGIN
  10623. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10624. section.Emit(Data(Basic.invalidPosition,op));
  10625. END Longint;
  10626. PROCEDURE PatchAddress(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.addressType),value);
  10631. section.PatchOperands(pc,op,noOperand,noOperand);
  10632. END PatchAddress;
  10633. PROCEDURE PatchSize(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.sizeType),value);
  10638. section.PatchOperands(pc,op,noOperand,noOperand);
  10639. END PatchSize;
  10640. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10641. VAR op,noOperand: IntermediateCode.Operand;
  10642. BEGIN
  10643. IntermediateCode.InitOperand(noOperand);
  10644. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10645. section.PatchOperands(pc,op,noOperand,noOperand);
  10646. END PatchLongint;
  10647. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10648. VAR op, noOperand: IntermediateCode.Operand;
  10649. BEGIN
  10650. IntermediateCode.InitOperand(noOperand);
  10651. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10652. section.PatchOperands(pc,op,noOperand,noOperand);
  10653. END PatchSymbol;
  10654. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10655. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10656. BEGIN
  10657. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10658. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10659. section.Emit(Data(Basic.invalidPosition,op));
  10660. END Boolean;
  10661. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10662. VAR op: IntermediateCode.Operand;
  10663. BEGIN
  10664. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10665. section.Emit(Data(Basic.invalidPosition,op));
  10666. END Char;
  10667. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10668. VAR op: IntermediateCode.Operand;
  10669. BEGIN
  10670. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10671. section.Emit(Data(Basic.invalidPosition,op));
  10672. END Integer;
  10673. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10674. VAR i: LONGINT;
  10675. BEGIN
  10676. Info(section,str);
  10677. i := 0;
  10678. WHILE(str[i] # 0X) DO
  10679. Char(section,str[i]);
  10680. INC(i);
  10681. END;
  10682. Char(section,0X);
  10683. END String;
  10684. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10685. VAR s: Basic.SectionName;
  10686. BEGIN
  10687. StringPool.GetString(str, s);
  10688. String(section, s);
  10689. END String0;
  10690. PROCEDURE NamedSymbol(section: IntermediateCode.Section; 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.Emit(Data(Basic.invalidPosition,op));
  10696. END NamedSymbol;
  10697. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10698. VAR op: IntermediateCode.Operand;
  10699. BEGIN
  10700. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10701. IntermediateCode.SetOffset(op,realOffset);
  10702. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10703. END NamedSymbolAt;
  10704. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10705. BEGIN
  10706. IF symbol= NIL THEN
  10707. Address( section, realOffset);
  10708. ASSERT(virtualOffset = 0);
  10709. ELSE
  10710. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10711. END;
  10712. END Symbol;
  10713. (* OutPointers delivers
  10714. {pointerOffset}
  10715. *)
  10716. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10717. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10718. BEGIN
  10719. type := type.resolved;
  10720. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10721. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10722. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10723. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10724. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10725. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10726. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10727. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10728. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10729. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10730. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10731. ELSIF (type IS SyntaxTree.RecordType) THEN
  10732. (* never treat a record like a pointer, even if the pointer field is set! *)
  10733. WITH type: SyntaxTree.RecordType DO
  10734. base := type.GetBaseRecord();
  10735. IF base # NIL THEN
  10736. Pointers(offset,symbol,section, base,numberPointers);
  10737. END;
  10738. variable := type.recordScope.firstVariable;
  10739. WHILE(variable # NIL) DO
  10740. IF ~(variable.untraced) THEN
  10741. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10742. END;
  10743. variable := variable.nextVariable;
  10744. END;
  10745. END;
  10746. ELSIF (type IS SyntaxTree.CellType) THEN
  10747. WITH type: SyntaxTree.CellType DO
  10748. base := type.GetBaseRecord();
  10749. IF base # NIL THEN
  10750. Pointers(offset,symbol,section, base,numberPointers);
  10751. END;
  10752. variable := type.cellScope.firstVariable;
  10753. WHILE(variable # NIL) DO
  10754. IF ~(variable.untraced) THEN
  10755. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10756. END;
  10757. variable := variable.nextVariable;
  10758. END;
  10759. property := type.firstProperty;
  10760. WHILE(property # NIL) DO
  10761. IF ~(property.untraced) THEN
  10762. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10763. END;
  10764. property := property.nextProperty;
  10765. END;
  10766. parameter := type.firstParameter;
  10767. WHILE(parameter # NIL) DO
  10768. IF ~(parameter.untraced) THEN
  10769. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10770. END;
  10771. parameter := parameter.nextParameter;
  10772. END;
  10773. END;
  10774. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10775. WITH type: SyntaxTree.ArrayType DO
  10776. IF type.form= SyntaxTree.Static THEN
  10777. n := type.staticLength;
  10778. base := type.arrayBase.resolved;
  10779. WHILE(base IS SyntaxTree.ArrayType) DO
  10780. type := base(SyntaxTree.ArrayType);
  10781. n := n* type.staticLength;
  10782. base := type.arrayBase.resolved;
  10783. END;
  10784. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10785. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10786. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10787. FOR i := 0 TO n-1 DO
  10788. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10789. END;
  10790. END;
  10791. ELSE
  10792. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10793. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10794. END;
  10795. END;
  10796. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10797. WITH type: SyntaxTree.MathArrayType DO
  10798. IF type.form = SyntaxTree.Static THEN
  10799. n := type.staticLength;
  10800. base := type.arrayBase.resolved;
  10801. WHILE(base IS SyntaxTree.MathArrayType) DO
  10802. type := base(SyntaxTree.MathArrayType);
  10803. n := n* type.staticLength;
  10804. base := type.arrayBase.resolved;
  10805. END;
  10806. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10807. IF SemanticChecker.ContainsPointer(base) THEN
  10808. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10809. FOR i := 0 TO n-1 DO
  10810. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10811. END;
  10812. END;
  10813. ELSE
  10814. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10815. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10816. END
  10817. END;
  10818. (* ELSE no pointers in type *)
  10819. END;
  10820. END Pointers;
  10821. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10822. VAR position,i: LONGINT; ch: CHAR;
  10823. BEGIN
  10824. IF pool.Has(index) THEN
  10825. RETURN pool.GetInt(index)
  10826. ELSE
  10827. position := source.pc;
  10828. pool.PutInt(index, position);
  10829. Info(source, name);
  10830. i := 0;
  10831. REPEAT
  10832. ch := name[i]; INC(i);
  10833. Char( source, ch);
  10834. UNTIL ch = 0X;
  10835. END;
  10836. RETURN position;
  10837. END EnterDynamicName;
  10838. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10839. VAR name: Basic.SectionName; position: LONGINT;
  10840. BEGIN
  10841. IF pool.Has(index) THEN
  10842. RETURN pool.GetInt(index)
  10843. ELSE
  10844. StringPool.GetString(index, name);
  10845. position := EnterDynamicName(source,name,index, pool);
  10846. END;
  10847. RETURN position;
  10848. END DynamicName;
  10849. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10850. VAR section: IntermediateCode.Section;
  10851. BEGIN
  10852. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10853. IF implementationVisitor.backend.cooperative THEN
  10854. Info(section, "TypeDescriptor");
  10855. Basic.ToSegmentedName("BaseTypes.Array", name);
  10856. NamedSymbol(section, name,NIL, 0, 0);
  10857. BasePointer(section);
  10858. offset := 0;
  10859. ELSE
  10860. IF ProtectModulesPointers THEN
  10861. HeapBlock(mName,typeName,section,2);
  10862. END;
  10863. Info(section, "HeapBlock");
  10864. IF ProtectModulesPointers THEN
  10865. Symbol(section,section,2,0);
  10866. ELSE
  10867. Address(section,0);
  10868. END;
  10869. Info(section, "TypeDescriptor");
  10870. Address(section,0);
  10871. offset := section.pc;
  10872. END;
  10873. RETURN section
  10874. END NamedBlock;
  10875. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10876. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10877. BEGIN
  10878. COPY(moduleName,name);
  10879. Strings.Append(name,suffix);
  10880. Basic.ToSegmentedName(name, pooledName);
  10881. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10882. END Block;
  10883. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10884. VAR name: Basic.SegmentedName;
  10885. BEGIN
  10886. Info(source,"ArrayHeader");
  10887. IF implementationVisitor.backend.cooperative THEN
  10888. sizePC := source.pc;
  10889. Address(source,0);
  10890. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10891. IF baseType # "" THEN
  10892. Basic.ToSegmentedName(baseType, name);
  10893. NamedSymbol(source, name,NIL, 0, 0);
  10894. ELSE
  10895. Address(source,0);
  10896. END;
  10897. Address(source,0);
  10898. ELSE
  10899. Address(source,0);
  10900. Address(source,0);
  10901. (* first pointer for GC *)
  10902. IF hasPointer THEN
  10903. (* points to first element in the array, this is NOT the base type descriptor *)
  10904. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10905. ELSE
  10906. Address(source,0);
  10907. END;
  10908. sizePC := source.pc;
  10909. Address(source,0);
  10910. Info(source,"array data");
  10911. END;
  10912. END ArrayBlock;
  10913. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10914. BEGIN
  10915. IF implementationVisitor.backend.cooperative THEN
  10916. PatchSize(section, pc, size);
  10917. PatchSize(section, pc + 3, size);
  10918. ELSE
  10919. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10920. PatchSize(section, pc, size);
  10921. END;
  10922. END PatchArray;
  10923. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10924. VAR
  10925. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10926. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10927. poolMap: Basic.HashTableInt;
  10928. namePool: IntermediateCode.Section;
  10929. namePoolOffset: LONGINT;
  10930. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10931. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10932. BEGIN
  10933. Basic.SegmentedNameToString(s1.name,n1);
  10934. Basic.SegmentedNameToString(s2.name,n2);
  10935. index := 0;
  10936. ch1 := n1[index];
  10937. ch2 := n2[index];
  10938. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10939. INC(index);
  10940. ch1 := n1[index];
  10941. ch2 := n2[index];
  10942. END;
  10943. RETURN ch1 < ch2;
  10944. END Compare;
  10945. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10946. VAR
  10947. i, j: LONGINT;
  10948. x, t: Sections.Section;
  10949. BEGIN
  10950. IF lo < hi THEN
  10951. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10952. WHILE i <= j DO
  10953. WHILE Compare(list[i], x) DO INC(i) END;
  10954. WHILE Compare(x, list[j]) DO DEC(j) END;
  10955. IF i <= j THEN
  10956. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10957. INC(i); DEC(j)
  10958. END
  10959. END;
  10960. IF lo < j THEN QuickSort(list, lo, j) END;
  10961. IF i < hi THEN QuickSort(list, i, hi) END
  10962. END;
  10963. END QuickSort;
  10964. (*
  10965. ExportDesc* = RECORD
  10966. fp*: ADDRESS;
  10967. name* {UNTRACED}: DynamicName;
  10968. adr*: ADDRESS;
  10969. exports*: LONGINT;
  10970. dsc* {UNTRACED}: ExportArray
  10971. END;
  10972. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10973. *)
  10974. PROCEDURE ExportDesc2(
  10975. source: IntermediateCode.Section;
  10976. namePool: IntermediateCode.Section;
  10977. fingerPrinter: FingerPrinter.FingerPrinter;
  10978. symbol: Sections.Section;
  10979. name: StringPool.Index;
  10980. VAR patchAdr: LONGINT
  10981. ): BOOLEAN;
  10982. VAR fingerPrint: SyntaxTree.FingerPrint;
  10983. BEGIN
  10984. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10985. & (symbol.type # Sections.InlineCodeSection)
  10986. THEN
  10987. *)
  10988. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10989. & (symbol.type # Sections.ExitCodeSection)
  10990. & (symbol.type # Sections.InlineCodeSection))
  10991. THEN
  10992. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10993. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10994. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10995. Longint(source,fingerPrint.public);
  10996. ELSE
  10997. Longint(source, 0);
  10998. END;
  10999. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11000. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11001. Symbol(source, symbol,0,0);
  11002. patchAdr := source.pc;
  11003. Longint(source, 0);
  11004. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11005. Address(source,0);
  11006. END;
  11007. RETURN TRUE
  11008. ELSE
  11009. RETURN FALSE
  11010. END;
  11011. END ExportDesc2;
  11012. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11013. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11014. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11015. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11016. nextPatch: LONGINT;
  11017. TYPE
  11018. Scope = RECORD
  11019. elements: LONGINT;
  11020. gelements: LONGINT;
  11021. section: IntermediateCode.Section;
  11022. patchAdr: LONGINT;
  11023. arraySizePC: LONGINT;
  11024. beginPC: LONGINT; (* current scope start pc *)
  11025. END;
  11026. BEGIN
  11027. Basic.InitSegmentedName(prev);
  11028. olevel := -1;
  11029. scopes[0].section := source;
  11030. scopes[0].arraySizePC := MIN(LONGINT);
  11031. FOR s := 0 TO LEN(sections)-1 DO
  11032. symbol := sections[s];
  11033. 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
  11034. this := sections[s].name;
  11035. level := 0;
  11036. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11037. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11038. INC(level);
  11039. END;
  11040. WHILE level < olevel DO
  11041. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11042. IF olevel > 0 THEN
  11043. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11044. nextPatch := scopes[olevel-1].patchAdr+1;
  11045. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11046. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11047. END;
  11048. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11049. DEC(olevel);
  11050. END;
  11051. IF (level < LEN(this)) & (this[level] > 0) THEN
  11052. IF level > olevel THEN
  11053. (*TRACE("opening",level); *)
  11054. IF scopes[level].section = NIL THEN
  11055. arrayName := ".@ExportArray";
  11056. Strings.AppendInt(arrayName, level);
  11057. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11058. AddPointer(scopes[level].section,offset);
  11059. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11060. END;
  11061. scopes[level].beginPC := scopes[level].section.pc;
  11062. olevel := level;
  11063. scopes[olevel].elements := 0;
  11064. END;
  11065. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11066. sym := sections[s];
  11067. ELSE
  11068. sym := NIL;
  11069. END;
  11070. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11071. THEN
  11072. INC(scopes[olevel].elements);
  11073. END;
  11074. (* enter string in scope *)
  11075. INC(level);
  11076. END;
  11077. END;
  11078. Basic.SegmentedNameToString(this, name);
  11079. prev := this;
  11080. END;
  11081. END;
  11082. WHILE 0 <= olevel DO
  11083. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11084. IF olevel > 0 THEN
  11085. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11086. nextPatch := scopes[olevel-1].patchAdr+1;
  11087. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11088. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11089. END;
  11090. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11091. DEC(olevel);
  11092. END;
  11093. level := 0;
  11094. WHILE (level < LEN(scopes)) DO
  11095. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11096. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11097. END;
  11098. INC(level);
  11099. END;
  11100. END Export;
  11101. BEGIN
  11102. NEW(fingerPrinter);
  11103. NEW(poolMap, 64);
  11104. (* 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 *)
  11105. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11106. NEW(sectionArray, module.allSections.Length());
  11107. FOR i := 0 TO module.allSections.Length() - 1 DO
  11108. section := module.allSections.GetSection(i);
  11109. sectionArray[i] := section;
  11110. END;
  11111. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11112. Export(sectionArray^);
  11113. END ExportDesc;
  11114. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11115. VAR
  11116. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11117. BEGIN
  11118. Info(source, "exception table offsets array descriptor");
  11119. size := 0;
  11120. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11121. Info(source, "exception table content");
  11122. FOR i := 0 TO module.allSections.Length() - 1 DO
  11123. p := module.allSections.GetSection(i);
  11124. IF p.type = Sections.CodeSection THEN
  11125. finallyPC := p(IntermediateCode.Section).finally;
  11126. IF finallyPC>=0 THEN
  11127. Symbol( source, p, 0,0);
  11128. Symbol( source, p, finallyPC, 0);
  11129. Symbol( source, p, finallyPC,0);
  11130. INC(size);
  11131. END;
  11132. END
  11133. END;
  11134. PatchArray(source,sizePC,size);
  11135. END ExceptionArray;
  11136. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11137. VAR i: LONGINT; ch: CHAR;
  11138. BEGIN
  11139. i := 0;
  11140. REPEAT
  11141. ch := name[i]; INC(i);
  11142. Char( section, ch);
  11143. UNTIL ch = 0X;
  11144. WHILE i < 32 DO
  11145. Char( section, 0X); INC(i);
  11146. END;
  11147. END Name;
  11148. PROCEDURE References(section: IntermediateCode.Section);
  11149. CONST
  11150. sfTypeNone = 0X;
  11151. sfTypeCHAR = 01X;
  11152. sfTypeCHAR8 = 02X;
  11153. sfTypeCHAR16 = 03X;
  11154. sfTypeCHAR32 = 04X;
  11155. sfTypeRANGE = 05X;
  11156. sfTypeSHORTINT = 06X;
  11157. sfTypeINTEGER = 07X;
  11158. sfTypeLONGINT = 08X;
  11159. sfTypeHUGEINT = 09X;
  11160. sfTypeWORD = 0AX;
  11161. sfTypeLONGWORD = 0BX;
  11162. sfTypeSIGNED8 = 0CX;
  11163. sfTypeSIGNED16 = 0DX;
  11164. sfTypeSIGNED32 = 0EX;
  11165. sfTypeSIGNED64 = 0FX;
  11166. sfTypeUNSIGNED8 = 10X;
  11167. sfTypeUNSIGNED16 = 11X;
  11168. sfTypeUNSIGNED32 = 12X;
  11169. sfTypeUNSIGNED64 = 13X;
  11170. sfTypeREAL = 14X;
  11171. sfTypeLONGREAL = 15X;
  11172. sfTypeCOMPLEX = 16X;
  11173. sfTypeLONGCOMPLEX = 17X;
  11174. sfTypeBOOLEAN = 18X;
  11175. sfTypeSET = 19X;
  11176. sfTypeANY = 1AX;
  11177. sfTypeOBJECT = 1BX;
  11178. sfTypeBYTE = 1CX;
  11179. sfTypeADDRESS = 1DX;
  11180. sfTypeSIZE = 1EX;
  11181. sfTypeIndirect = 1FX;
  11182. sfTypeRecord = 20X;
  11183. sfTypePointerToRecord = 21X;
  11184. sfTypePointerToArray = 22X;
  11185. sfTypeOpenArray = 23X;
  11186. sfTypeStaticArray = 24X;
  11187. sfTypeDynamicArray = 25X;
  11188. sfTypeMathStaticArray = 26X;
  11189. sfTypeMathOpenArray = 27X;
  11190. sfTypeMathTensor = 28X;
  11191. sfTypeProcedure = 29X;
  11192. sfTypeDelegate = 2AX;
  11193. sfTypeENUM = 2BX;
  11194. sfTypeCELL = 2CX;
  11195. sfTypePORT = 2DX;
  11196. sfIN = 0X;
  11197. sfOUT = 1X;
  11198. flagDelegate = 0;
  11199. flagConstructor = 1;
  11200. (* variable / parameter addressing modes *)
  11201. sfAbsolute = 0X; (* global vars *)
  11202. sfRelative = 1X; (* variables, value parameters *)
  11203. sfIndirect = 2X; (* var parameters *)
  11204. sfScopeBegin = 0F0X;
  11205. sfScopeEnd = 0F1X;
  11206. sfProcedure = 0F2X;
  11207. sfVariable = 0F3X;
  11208. sfTypeDeclaration = 0F4X;
  11209. sfModule = 0FFX;
  11210. RefInfo = TRUE;
  11211. VAR
  11212. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11213. indirectTypes: Basic.HashTable;
  11214. PROCEDURE CurrentIndex(): LONGINT;
  11215. VAR i: LONGINT;
  11216. BEGIN
  11217. FOR i := startPC TO section.pc -1 DO
  11218. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11219. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11220. END;
  11221. startPC := section.pc;
  11222. RETURN lastOffset;
  11223. END CurrentIndex;
  11224. (*
  11225. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11226. Module = sfModule prevSymbol:SIZE name:String Scope.
  11227. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11228. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11229. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11230. Type =
  11231. sfTypePointerToRecord
  11232. | sfTypePointerToArray Type
  11233. | sfTypeOpenArray Type
  11234. | sfTypeDynamicArray Type
  11235. | sfTypeStaticArray length:SIZE Type
  11236. | sfTypeMathOpenArray Type
  11237. | sfTypeMathStaticArray length:SIZE Type
  11238. | sfTypeMathTensor Type
  11239. | sfTypeRecord tdAdr:ADDRESS
  11240. | sfTypeProcedure {Parameter} return:Type
  11241. | sfTypeDelegate {Parameter} return:Type
  11242. | sfTypePort (sfIN | sfOUT)
  11243. | sfTypeBOOLEAN
  11244. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11245. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11246. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11247. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11248. | sfTypeWORD | sfTypeLONGWORD
  11249. | sfTypeREAL | sfTypeLONGREAL
  11250. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11251. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11252. | sfTypeIndirect offset:SIZE.
  11253. *)
  11254. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11255. VAR offset: SIZE;
  11256. BEGIN
  11257. IF indirectTypes.Has(type) THEN
  11258. offset := indirectTypes.GetInt(type);
  11259. Char(section, sfTypeIndirect);
  11260. Size(section, offset);
  11261. RETURN TRUE;
  11262. ELSE
  11263. indirectTypes.PutInt(type, CurrentIndex());
  11264. RETURN FALSE;
  11265. END;
  11266. END Indirect;
  11267. PROCEDURE NType(type: SyntaxTree.Type);
  11268. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11269. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11270. BEGIN
  11271. IF type = NIL THEN
  11272. Char(section, sfTypeNone)
  11273. ELSE
  11274. type := type.resolved;
  11275. size := type.sizeInBits;
  11276. WITH type:SyntaxTree.PointerType DO
  11277. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11278. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11279. Char(section, sfTypePointerToRecord);
  11280. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11281. ELSE
  11282. IF RefInfo THEN Info(section,"PointerToArray") END;
  11283. Char(section, sfTypePointerToArray);
  11284. NType(type.pointerBase);
  11285. END;
  11286. | type: SyntaxTree.ArrayType DO
  11287. IF ~Indirect(type) THEN
  11288. IF type.form = SyntaxTree.Open THEN
  11289. IF RefInfo THEN Info(section,"OpenArray") END;
  11290. Char(section, sfTypeOpenArray);
  11291. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11292. IF RefInfo THEN Info(section,"DynamicArray") END;
  11293. Char(section, sfTypeDynamicArray);
  11294. ELSIF type.form = SyntaxTree.Static THEN
  11295. IF RefInfo THEN Info(section,"StaticArray") END;
  11296. Char(section, sfTypeStaticArray);
  11297. Size(section, type.staticLength);
  11298. ELSE
  11299. HALT(100);
  11300. END;
  11301. NType(type.arrayBase);
  11302. END;
  11303. | type: SyntaxTree.MathArrayType DO
  11304. IF ~Indirect(type) THEN
  11305. IF type.form = SyntaxTree.Open THEN
  11306. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11307. Char(section, sfTypeMathOpenArray);
  11308. ELSIF type.form = SyntaxTree.Static THEN
  11309. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11310. Char(section, sfTypeMathStaticArray);
  11311. Size(section, type.staticLength);
  11312. ELSIF type.form = SyntaxTree.Tensor THEN
  11313. IF RefInfo THEN Info(section,"MathTensor") END;
  11314. Char(section, sfTypeMathTensor);
  11315. ELSE
  11316. HALT(100);
  11317. END;
  11318. NType(type.arrayBase);
  11319. END;
  11320. | type: SyntaxTree.RecordType DO
  11321. IF ~Indirect(type) THEN
  11322. IF type.pointerType # NIL (* OBJECT *) THEN
  11323. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11324. Char(section, sfTypePointerToRecord)
  11325. ELSE
  11326. IF RefInfo THEN Info(section,"Record") END;
  11327. Char(section, sfTypeRecord);
  11328. td := type.typeDeclaration;
  11329. IF RefInfo THEN Info(section,"TD") END;
  11330. IF (td # NIL) THEN
  11331. Global.GetSymbolSegmentedName(td,segmentedName);
  11332. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11333. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11334. ELSE
  11335. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11336. END;
  11337. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11338. Symbol(section, tir, 0, offset);
  11339. ELSE
  11340. Address(section, 0);
  11341. END;
  11342. END;
  11343. END;
  11344. | type: SyntaxTree.CellType DO
  11345. IF ~Indirect(type) THEN
  11346. IF RefInfo THEN Info(section,"Record") END;
  11347. Char(section, sfTypeRecord);
  11348. td := type.typeDeclaration;
  11349. IF RefInfo THEN Info(section,"TD") END;
  11350. IF (td # NIL) THEN
  11351. Global.GetSymbolSegmentedName(td,segmentedName);
  11352. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11353. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11354. ELSE
  11355. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11356. END;
  11357. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11358. Symbol(section, tir, 0, offset);
  11359. ELSE
  11360. Address(section, 0);
  11361. END;
  11362. END;
  11363. | type: SyntaxTree.PortType DO
  11364. Char(section, sfTypePORT);
  11365. IF type.direction = SyntaxTree.OutPort THEN
  11366. Char(section, sfOUT)
  11367. ELSE
  11368. Char(section, sfIN)
  11369. END;
  11370. | type: SyntaxTree.ProcedureType DO
  11371. IF ~Indirect(type) THEN
  11372. IF type.isDelegate THEN
  11373. Char(section, sfTypeDelegate);
  11374. ELSE
  11375. Char(section, sfTypeProcedure);
  11376. END;
  11377. parameter := type.firstParameter;
  11378. WHILE(parameter # NIL) DO
  11379. NParameter(parameter, -1);
  11380. parameter := parameter.nextParameter;
  11381. END;
  11382. NType(type.returnType);
  11383. END;
  11384. | type:SyntaxTree.EnumerationType DO
  11385. Char(section, sfTypeENUM);
  11386. | type: SyntaxTree.BasicType DO
  11387. WITH type: SyntaxTree.BooleanType DO
  11388. IF RefInfo THEN Info(section,"Boolean") END;
  11389. Char(section, sfTypeBOOLEAN);
  11390. | type: SyntaxTree.CharacterType DO
  11391. IF type = module.system.characterType THEN
  11392. IF RefInfo THEN Info(section,"CHAR") END;
  11393. Char(section, sfTypeCHAR);
  11394. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11395. IF RefInfo THEN Info(section,"CHAR8") END;
  11396. Char(section, sfTypeCHAR8)
  11397. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11398. IF RefInfo THEN Info(section,"CHAR16") END;
  11399. Char(section, sfTypeCHAR16);
  11400. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11401. IF RefInfo THEN Info(section,"CHAR32") END;
  11402. Char(section, sfTypeCHAR32);
  11403. ELSE
  11404. HALT(100);
  11405. END;
  11406. |type: SyntaxTree.IntegerType DO
  11407. IF type(SyntaxTree.IntegerType).signed THEN
  11408. IF (type = module.system.shortintType) THEN
  11409. IF RefInfo THEN Info(section,"SHORTINT") END;
  11410. Char(section, sfTypeSHORTINT)
  11411. ELSIF (type = module.system.integerType) THEN
  11412. IF RefInfo THEN Info(section,"INTEGER") END;
  11413. Char(section, sfTypeINTEGER)
  11414. ELSIF (type = module.system.longintType) THEN
  11415. IF RefInfo THEN Info(section,"LONGINT") END;
  11416. Char(section, sfTypeLONGINT)
  11417. ELSIF (type = module.system.hugeintType) THEN
  11418. IF RefInfo THEN Info(section,"HUGEINT") END;
  11419. Char(section, sfTypeHUGEINT)
  11420. ELSIF (type = module.system.wordType) THEN
  11421. IF RefInfo THEN Info(section,"WORD") END;
  11422. Char(section, sfTypeWORD)
  11423. ELSIF (type = module.system.longWordType) THEN
  11424. IF RefInfo THEN Info(section,"LONGWORD") END;
  11425. Char(section, sfTypeLONGWORD);
  11426. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11427. IF RefInfo THEN Info(section,"SIGNED8") END;
  11428. Char(section, sfTypeSIGNED8)
  11429. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11430. IF RefInfo THEN Info(section,"SIGNED16") END;
  11431. Char(section, sfTypeSIGNED16)
  11432. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11433. IF RefInfo THEN Info(section,"SIGNED32") END;
  11434. Char(section, sfTypeSIGNED32)
  11435. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11436. IF RefInfo THEN Info(section,"SIGNED64") END;
  11437. Char(section, sfTypeSIGNED64)
  11438. ELSE
  11439. HALT(100);
  11440. END
  11441. ELSE (* unsigned *)
  11442. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11443. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11444. Char(section, sfTypeUNSIGNED8)
  11445. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11446. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11447. Char(section, sfTypeUNSIGNED16)
  11448. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11449. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11450. Char(section, sfTypeUNSIGNED32)
  11451. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11452. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11453. Char(section, sfTypeUNSIGNED64)
  11454. ELSE
  11455. HALT(100)
  11456. END
  11457. END;
  11458. | type: SyntaxTree.FloatType DO
  11459. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11460. IF RefInfo THEN Info(section,"REAL") END;
  11461. Char(section, sfTypeREAL);
  11462. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11463. IF RefInfo THEN Info(section,"LONGREAL") END;
  11464. Char(section, sfTypeLONGREAL);
  11465. ELSE
  11466. HALT(100);
  11467. END;
  11468. |type: SyntaxTree.ComplexType DO
  11469. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11470. IF RefInfo THEN Info(section,"COMPLEX") END;
  11471. Char(section, sfTypeCOMPLEX);
  11472. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11473. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11474. Char(section, sfTypeLONGCOMPLEX);
  11475. ELSE
  11476. HALT(100);
  11477. END;
  11478. |type:SyntaxTree.SetType DO
  11479. IF RefInfo THEN Info(section,"SET") END;
  11480. Char(section, sfTypeSET);
  11481. |type:SyntaxTree.AnyType DO
  11482. IF RefInfo THEN Info(section,"ANY") END;
  11483. Char(section, sfTypeANY);
  11484. |type:SyntaxTree.ObjectType DO
  11485. IF RefInfo THEN Info(section,"OBJECT") END;
  11486. Char(section, sfTypeOBJECT);
  11487. |type:SyntaxTree.ByteType DO
  11488. IF RefInfo THEN Info(section,"BYTE") END;
  11489. Char(section, sfTypeBYTE);
  11490. |type:SyntaxTree.RangeType DO
  11491. IF RefInfo THEN Info(section,"RANGE") END;
  11492. Char(section, sfTypeRANGE)
  11493. |type:SyntaxTree.AddressType DO
  11494. IF RefInfo THEN Info(section,"ADDRESS") END;
  11495. Char(section, sfTypeADDRESS)
  11496. |type:SyntaxTree.SizeType DO
  11497. IF RefInfo THEN Info(section,"SIZE") END;
  11498. Char(section, sfTypeSIZE)
  11499. ELSE
  11500. HALT(100)
  11501. END;
  11502. ELSE HALT(101);
  11503. END;
  11504. END;
  11505. END NType;
  11506. (*
  11507. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11508. *)
  11509. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11510. VAR pos: LONGINT; type: SyntaxTree.Type;
  11511. BEGIN
  11512. IF RefInfo THEN Info(section, "Parameter") END;
  11513. Char(section, sfVariable);
  11514. Size(section, procOffset);
  11515. String0(section, parameter.name);
  11516. type := parameter.type.resolved;
  11517. IF parameter.kind = SyntaxTree.VarParameter THEN
  11518. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11519. ELSE Char(section, sfIndirect)
  11520. END;
  11521. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11522. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11523. Char(section, sfIndirect);
  11524. ELSE
  11525. Char(section, sfRelative);
  11526. END;
  11527. ELSE
  11528. Char(section, sfRelative);
  11529. END;
  11530. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11531. NType(parameter.type);
  11532. END NParameter;
  11533. (*
  11534. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11535. *)
  11536. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11537. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11538. flags: SET;
  11539. BEGIN
  11540. IF procedure.externalName # NIL THEN RETURN END;
  11541. IF RefInfo THEN Info(section, "Procedure") END;
  11542. pos := CurrentIndex();
  11543. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11544. Char(section, sfProcedure);
  11545. Size(section, scopeOffset);
  11546. String0(section,procedure.name);
  11547. s := module.allSections.FindBySymbol(procedure);
  11548. Symbol(section,s,0,0); (* start *)
  11549. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11550. flags := {};
  11551. IF procedureType.isDelegate THEN
  11552. INCL(flags, flagDelegate);
  11553. END;
  11554. IF procedure.isConstructor THEN
  11555. INCL(flags, flagConstructor);
  11556. END;
  11557. Set(section, flags);
  11558. IF RefInfo THEN Info(section, "Parameters") END;
  11559. parameter := procedureType.firstParameter;
  11560. WHILE(parameter # NIL) DO
  11561. NParameter(parameter, pos);
  11562. parameter := parameter.nextParameter;
  11563. END;
  11564. IF procedureType.returnParameter # NIL THEN
  11565. NParameter(procedureType.returnParameter, pos);
  11566. END;
  11567. IF procedureType.selfParameter # NIL THEN
  11568. NParameter(procedureType.selfParameter, pos);
  11569. END;
  11570. IF RefInfo THEN Info(section, "ReturnType") END;
  11571. NType(procedureType.returnType);
  11572. NScope(procedure.procedureScope, pos);
  11573. END NProcedure;
  11574. (*
  11575. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11576. *)
  11577. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11578. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11579. BEGIN
  11580. IF RefInfo THEN Info(section, "Variable") END;
  11581. pos := CurrentIndex();
  11582. Char(section, sfVariable);
  11583. Size(section, scopeOffset);
  11584. String0(section, variable.name);
  11585. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11586. Char(section, sfAbsolute);
  11587. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11588. NamedSymbol(section, sn,variable, 0,0);
  11589. ELSE
  11590. Char(section, sfRelative);
  11591. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11592. END;
  11593. NType(variable.type);
  11594. s := module.allSections.FindBySymbol(variable);
  11595. END NVariable;
  11596. (*
  11597. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11598. *)
  11599. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11600. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11601. BEGIN
  11602. IF typeDeclaration = NIL THEN RETURN END;
  11603. pos := CurrentIndex();
  11604. s := module.allSections.FindBySymbol(typeDeclaration);
  11605. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11606. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11607. Char(section, sfTypeDeclaration);
  11608. Size(section, scopeOffset);
  11609. String0(section, typeDeclaration.name);
  11610. declared := typeDeclaration.declaredType.resolved;
  11611. IF (declared IS SyntaxTree.PointerType) THEN
  11612. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11613. END;
  11614. WITH declared: SyntaxTree.RecordType DO
  11615. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11616. Symbol(section, s, 0, offset);
  11617. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11618. Basic.AppendToSegmentedName(name,".@Info");
  11619. s := module.allSections.FindByName(name);
  11620. IF s # NIL THEN (* does not work for coop *)
  11621. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11622. END;
  11623. NScope(declared.recordScope, pos);
  11624. |declared: SyntaxTree.CellType DO
  11625. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11626. Symbol(section, s, 0, offset);
  11627. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11628. Basic.AppendToSegmentedName(name,".@Info");
  11629. s := module.allSections.FindByName(name);
  11630. IF s # NIL THEN
  11631. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11632. END;
  11633. NScope(declared.cellScope, pos);
  11634. ELSE
  11635. Address(section, 0);
  11636. END;
  11637. END NTypeDeclaration;
  11638. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11639. VAR pos: LONGINT;
  11640. BEGIN
  11641. pos := CurrentIndex();
  11642. Char(section,sfModule);
  11643. Size(section, prevSymbol);
  11644. String0(section, module.name);
  11645. NScope(module.moduleScope, pos);
  11646. END NModule;
  11647. (*
  11648. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11649. *)
  11650. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11651. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11652. BEGIN
  11653. IF scope = NIL THEN RETURN END;
  11654. IF RefInfo THEN Info(section, "Scope") END;
  11655. Char(section, sfScopeBegin);
  11656. variable := scope.firstVariable;
  11657. WHILE (variable # NIL) DO
  11658. NVariable(variable, prevSymbol);
  11659. variable := variable.nextVariable;
  11660. END;
  11661. WITH scope: SyntaxTree.ModuleScope DO
  11662. bodyProcedure := scope.bodyProcedure;
  11663. |scope: SyntaxTree.RecordScope DO
  11664. bodyProcedure := scope.bodyProcedure;
  11665. ELSE
  11666. bodyProcedure := NIL;
  11667. END;
  11668. IF bodyProcedure # NIL THEN
  11669. NProcedure(bodyProcedure, prevSymbol)
  11670. END;
  11671. procedure := scope.firstProcedure;
  11672. WHILE procedure # NIL DO
  11673. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11674. procedure := procedure.nextProcedure;
  11675. END;
  11676. typeDeclaration := scope.firstTypeDeclaration;
  11677. WHILE typeDeclaration # NIL DO
  11678. NTypeDeclaration(typeDeclaration, prevSymbol);
  11679. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11680. END;
  11681. Char(section, sfScopeEnd); (* scope ends *)
  11682. END NScope;
  11683. BEGIN
  11684. NEW(indirectTypes, 32);
  11685. ArrayBlock(section,sizePC,"", FALSE);
  11686. startPC := section.pc;
  11687. NModule(module.module, -1);
  11688. PatchArray(section,sizePC,CurrentIndex());
  11689. END References;
  11690. (*
  11691. Command* = RECORD
  11692. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11693. name*: Name; (* name of the procedure *)
  11694. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11695. entryAdr* : ADDRESS; (* entry address of procedure *)
  11696. END;
  11697. *)
  11698. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11699. VAR
  11700. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11701. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11702. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11703. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11704. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11705. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11706. BEGIN
  11707. RETURN
  11708. (type = NIL) OR
  11709. (type.resolved IS SyntaxTree.RecordType) OR
  11710. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11711. (type.resolved IS SyntaxTree.AnyType);
  11712. END TypeAllowed;
  11713. BEGIN
  11714. numberParameters := procedureType.numberParameters;
  11715. RETURN
  11716. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11717. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11718. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11719. END GetProcedureAllowed;
  11720. PROCEDURE WriteType(type : SyntaxTree.Type);
  11721. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11722. name: Basic.SegmentedName; offset: LONGINT;
  11723. BEGIN
  11724. IF type = NIL THEN
  11725. Address(source,0);
  11726. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11727. Address(source,1);
  11728. ELSE
  11729. type := type.resolved;
  11730. IF type IS SyntaxTree.PointerType THEN
  11731. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11732. END;
  11733. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11734. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11735. name[0] := typeDeclaration.name; name[1] := -1;
  11736. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11737. ASSERT(section # NIL);
  11738. ELSE
  11739. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11740. (* TODO *)
  11741. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11742. END;
  11743. IF implementationVisitor.backend.cooperative THEN
  11744. offset := 0;
  11745. ELSE
  11746. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11747. END;
  11748. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11749. END;
  11750. END WriteType;
  11751. BEGIN
  11752. Info(source, "command array descriptor");
  11753. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11754. numberCommands := 0;
  11755. Info(source, "command array content");
  11756. FOR i := 0 TO module.allSections.Length() - 1 DO
  11757. p := module.allSections.GetSection(i);
  11758. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11759. procedure := p.symbol(SyntaxTree.Procedure);
  11760. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11761. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11762. procedure.GetName(name);
  11763. Name(source,name);
  11764. numberParameters := procedureType.numberParameters;
  11765. (* offset of type of first parameter *)
  11766. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11767. ELSE WriteType(procedureType.firstParameter.type)
  11768. END;
  11769. (* offset of type of return parameter *)
  11770. WriteType(procedureType.returnType);
  11771. (* command name *)
  11772. (* command code offset *)
  11773. Symbol(source,p,0,0);
  11774. INC(numberCommands);
  11775. IF Trace THEN
  11776. D.Ln;
  11777. END;
  11778. END;
  11779. END
  11780. END;
  11781. PatchArray(source,sizePC,numberCommands);
  11782. END CommandArray;
  11783. (* to prevent from double import of different module aliases *)
  11784. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11785. VAR i: SyntaxTree.Import;
  11786. BEGIN
  11787. i := module.module.moduleScope.firstImport;
  11788. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11789. i := i.nextImport;
  11790. END;
  11791. RETURN i = import
  11792. END IsFirstDirectOccurence;
  11793. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11794. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11795. BEGIN
  11796. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11797. ArrayBlock(source,pc,"", FALSE);
  11798. Info(source, "import module array data");
  11799. IF implementationVisitor.backend.cooperative THEN
  11800. offset := 0;
  11801. ELSE
  11802. IF module.system.addressType.sizeInBits = 64 THEN
  11803. (* change this when Heaps.HeapBlock is modified *)
  11804. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11805. ELSE
  11806. (* change this when Heaps.HeapBlock is modified *)
  11807. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11808. END;
  11809. END;
  11810. import := module.module.moduleScope.firstImport;
  11811. numberImports := 0;
  11812. WHILE import # NIL DO
  11813. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11814. Global.GetModuleSegmentedName(import.module,name);
  11815. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11816. NamedSymbol(source, name, NIL, 0, offset);
  11817. INC(numberImports);
  11818. END;
  11819. import := import.nextImport
  11820. END;
  11821. PatchArray(source,pc,numberImports);
  11822. END ImportsArray;
  11823. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11824. VAR
  11825. p: Sections.Section; sizePC, size, i: LONGINT;
  11826. BEGIN
  11827. Info(source, "Type info section");
  11828. size := 0;
  11829. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11830. FOR i := 0 TO module.allSections.Length() - 1 DO
  11831. p := module.allSections.GetSection(i);
  11832. WITH p: IntermediateCode.Section DO
  11833. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11834. Symbol(source,p,EmptyBlockOffset,0);
  11835. INC(size);
  11836. END;
  11837. END
  11838. END;
  11839. PatchArray(source,sizePC,size);
  11840. END TypeInfoSection;
  11841. (*
  11842. ProcTableEntry* = RECORD
  11843. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11844. noPtr*: LONGINT;
  11845. END;
  11846. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11847. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11848. *)
  11849. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11850. VAR
  11851. numberPointers: LONGINT;
  11852. procedure: SyntaxTree.Procedure;
  11853. BEGIN
  11854. Info(section,"pcFrom");
  11855. Symbol(section,procedureSection,0,0);
  11856. Info(section,"pcTo");
  11857. Symbol(section, procedureSection, procedureSection.pc, 0);
  11858. Info(section,"pointer to offsets array");
  11859. Symbol(section, section,section.pc+1,0);
  11860. Info(section,"offsets array");
  11861. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11862. PointerArray(section, procedure.procedureScope, numberPointers);
  11863. END ProcedureDescriptor;
  11864. (* only for tracing, the descriptor is otherwise not complete ! *)
  11865. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11866. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11867. BEGIN
  11868. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11869. name := procedureSection.name;
  11870. Basic.AppendToSegmentedName(name,".@Info");
  11871. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11872. Address(section,0);
  11873. Symbol(section,section,2,0);
  11874. (*
  11875. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11876. descSize: SIZE;
  11877. sentinel: ADDRESS; (* = MPO-4 *)
  11878. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11879. flags*: SET;
  11880. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11881. name*: Name;
  11882. END;
  11883. *)
  11884. Size(section, 0);
  11885. Address(section,0);
  11886. Address(section,0);
  11887. Set(section,{});
  11888. moduleSection := ModuleSection();
  11889. Symbol( section, moduleSection, moduleSection.pc,0);
  11890. IF procedureSection.symbol = NIL THEN
  11891. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11892. ELSE
  11893. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11894. END;
  11895. Name(section, infoName);
  11896. Size(section, 0);
  11897. RETURN section;
  11898. END MakeProcedureDescriptorTag;
  11899. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11900. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11901. BEGIN
  11902. name := procedureSection.name;
  11903. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11904. IF implementationVisitor.backend.cooperative THEN
  11905. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11906. Info(section, "TypeDescriptor");
  11907. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11908. NamedSymbol(dest, name,NIL, 0, 0);
  11909. BaseRecord(dest);
  11910. offset := 0;
  11911. ELSIF CreateProcedureDescInfo THEN
  11912. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11913. Address(dest,0);
  11914. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11915. offset := dest.pc;
  11916. ELSE
  11917. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11918. END;
  11919. ProcedureDescriptor(dest, procedureSection);
  11920. Symbol(section, dest, offset, 0);
  11921. END ProcedureDescriptorPointer;
  11922. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11923. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11924. BEGIN
  11925. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11926. numberProcs := 0;
  11927. FOR i := 0 TO module.allSections.Length() - 1 DO
  11928. destination := module.allSections.GetSection(i);
  11929. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11930. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11931. INC(numberProcs);
  11932. END
  11933. END;
  11934. PatchArray(section, sizePC, numberProcs);
  11935. END ProcedureDescriptorArray;
  11936. (*
  11937. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11938. VAR
  11939. next*: Module; (** once a module is published, all fields are read-only *)
  11940. name*: Name;
  11941. init, published: BOOLEAN;
  11942. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11943. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11944. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11945. command*: POINTER TO ARRAY OF Command;
  11946. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11947. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11948. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11949. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11950. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11951. data*, code*: Bytes;
  11952. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11953. export*: ExportDesc;
  11954. term*: TerminationHandler;
  11955. exTable*: ExceptionTable;
  11956. noProcs*: LONGINT;
  11957. firstProc*: ADDRESS; <- done by loader
  11958. maxPtrs*: LONGINT;
  11959. crc*: LONGINT;
  11960. *)
  11961. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11962. BEGIN
  11963. Info(section, "cycle");
  11964. Size(section,0);
  11965. Info(section, "references");
  11966. Size(section,0);
  11967. Info(section, "nextMarked");
  11968. Address(section,0);
  11969. Info(section, "nextWatched");
  11970. Address(section,0);
  11971. END BasePointer;
  11972. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11973. BEGIN
  11974. BasePointer(section);
  11975. Info(section, "action");
  11976. Address(section,0);
  11977. Info(section, "monitor");
  11978. Address(section,0);
  11979. END BaseObject;
  11980. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11981. BEGIN
  11982. BasePointer(section);
  11983. Info(section, "action");
  11984. Address(section,0);
  11985. Info(section, "monitor");
  11986. Address(section,0);
  11987. END BaseRecord;
  11988. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11989. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11990. pooledName: Basic.SegmentedName;
  11991. symbol: SyntaxTree.Symbol;
  11992. BEGIN
  11993. Global.GetModuleName(module.module,name);
  11994. Strings.Append(name,".@Module.@Descriptor");
  11995. Basic.ToSegmentedName(name, pooledName);
  11996. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11997. Symbol(section,descriptorSection,0,0);
  11998. Info(descriptorSection, "descriptor");
  11999. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12000. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12001. Address(descriptorSection,0);
  12002. Global.GetModuleName(module.module,name);
  12003. Strings.Append(name,".@Trace");
  12004. Basic.ToSegmentedName(name, pooledName);
  12005. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12006. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12007. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12008. END ModuleDescriptor;
  12009. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12010. VAR name: ARRAY 128 OF CHAR;
  12011. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12012. symbol: SyntaxTree.Symbol;
  12013. BEGIN
  12014. Global.GetModuleName(module.module,name);
  12015. Strings.Append(name,".@Module");
  12016. Basic.ToSegmentedName(name, pooledName);
  12017. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12018. moduleSection.SetExported(TRUE);
  12019. IF moduleSection.pc = 0 THEN
  12020. IF implementationVisitor.backend.cooperative THEN
  12021. Info(moduleSection, "descriptor");
  12022. ModuleDescriptor(moduleSection);
  12023. BaseObject(moduleSection);
  12024. implementationVisitor.CreateTraceModuleMethod(module.module);
  12025. ELSE
  12026. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12027. Info(moduleSection, "HeapBlock");
  12028. Symbol(moduleSection,moduleSection,2,0);
  12029. Info(moduleSection, "TypeDescriptor");
  12030. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12031. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12032. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12033. END;
  12034. END;
  12035. RETURN moduleSection;
  12036. END ModuleSection;
  12037. PROCEDURE NewModuleInfo();
  12038. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12039. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12040. sectionName: Basic.SectionName;
  12041. CONST MPO=-40000000H;
  12042. BEGIN
  12043. (*
  12044. TypeDesc* = POINTER TO RECORD
  12045. descSize: SIZE;
  12046. sentinel: LONGINT; (* = MPO-4 *)
  12047. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12048. flags*: SET;
  12049. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12050. name*: Name;
  12051. refsOffset: SIZE;
  12052. END;
  12053. *)
  12054. (*name is missing prefixes sometimes*)
  12055. Global.GetModuleSegmentedName(module.module,name);
  12056. Basic.AppendToSegmentedName(name,".@Info");
  12057. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12058. IF ~implementationVisitor.backend.cooperative THEN
  12059. Info(source, "HeapBlock");
  12060. Address(source,0); (* an empty heap block prevents GC marking *)
  12061. Info(source, "TypeDescriptor");
  12062. Address(source,0);
  12063. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12064. END;
  12065. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12066. Address(source,MPO-4);
  12067. Info(source, "type tag pointer");
  12068. Address( source,0);
  12069. Info(source, "type flags");
  12070. flags := {};
  12071. Set( source, flags);
  12072. Info(source, "pointer to module");
  12073. moduleSection := ModuleSection();
  12074. Symbol( source, moduleSection, moduleSection.pc,0);
  12075. Info(source, "type name");
  12076. i := 0;
  12077. sectionName := "@Self";
  12078. (*
  12079. Global.GetSymbolSegmentedName(td,name);
  12080. Basic.SegmentedNameToString(name, sectionName);
  12081. *)
  12082. Name(source,sectionName);
  12083. patchInfoPC := source.pc;
  12084. Size(source, 0);
  12085. END NewModuleInfo;
  12086. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12087. VAR
  12088. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12089. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12090. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12091. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12092. referenceSectionOffset : LONGINT;
  12093. name: Basic.SegmentedName; offset: LONGINT;
  12094. flags: SET;
  12095. BEGIN
  12096. NewModuleInfo();
  12097. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12098. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12099. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12100. ImportsArray(importSection);
  12101. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12102. CommandArray(commandsSection);
  12103. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12104. ExceptionArray(exceptionSection);
  12105. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12106. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12107. TypeInfoSection(typeInfoSection);
  12108. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12109. referenceSection.SetExported(TRUE);
  12110. References(referenceSection);
  12111. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12112. ProcedureDescriptorArray(procTableSection, numberProcs);
  12113. IF ProtectModulesPointers THEN
  12114. name := "Heaps.AnyPtr";
  12115. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12116. (* set base pointer *)
  12117. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12118. END;
  12119. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12120. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12121. moduleSection := ModuleSection();
  12122. Info(moduleSection, "nextRoot*: RootObject");
  12123. Address(moduleSection,0);
  12124. Info(moduleSection, "next*: Module");
  12125. Address(moduleSection,0);
  12126. Info(moduleSection, "name*: Name");
  12127. Name(moduleSection,moduleName);
  12128. Info(moduleSection, "init, published: BOOLEAN");
  12129. Boolean(moduleSection,FALSE);
  12130. Boolean(moduleSection,FALSE);
  12131. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12132. Boolean(moduleSection,FALSE);
  12133. Boolean(moduleSection,FALSE);
  12134. Info(moduleSection, "refcnt*: LONGINT");
  12135. Longint(moduleSection,0);
  12136. Info(moduleSection, "sb*: ADDRESS");
  12137. Address(moduleSection,0);
  12138. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12139. Address(moduleSection,0);
  12140. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12141. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12142. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12143. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12144. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12145. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12146. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12147. Symbol(moduleSection,importSection,importSectionOffset,0);
  12148. Info(moduleSection, "procTable*: ProcTable");
  12149. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12150. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12151. Address(moduleSection,0);
  12152. Address(moduleSection,0);
  12153. Address(moduleSection,0);
  12154. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12155. Info(moduleSection, "export*: ExportDesc");
  12156. ExportDesc(moduleSection);
  12157. Info(moduleSection, "term*: TerminationHandler");
  12158. Address(moduleSection,0);
  12159. Info(moduleSection, "exTable*: ExceptionTable");
  12160. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12161. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12162. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12163. Info(moduleSection, "crc*: LONGINT");
  12164. patchCRC:= moduleSection.pc;
  12165. Longint(moduleSection, 0); (*! must be implemented *)
  12166. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12167. Info(moduleSection, "body*: ADDRESS");
  12168. Symbol(moduleSection, bodyProc, 0,0);
  12169. Info(moduleSection, "module flags");
  12170. flags := {};
  12171. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12172. Set( moduleSection, flags);
  12173. IF implementationVisitor.backend.cooperative THEN
  12174. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12175. Info(moduleSection, "monitor.owner");
  12176. Address(moduleSection,0);
  12177. Info(moduleSection, "monitor.nestingLevel");
  12178. Address(moduleSection,0);
  12179. Info(moduleSection, "monitor.blockedQueue");
  12180. Address(moduleSection,0); Address(moduleSection,0);
  12181. Info(moduleSection, "monitor.waitingQueue");
  12182. Address(moduleSection,0); Address(moduleSection,0);
  12183. Info(moduleSection, "monitor.waitingSentinel");
  12184. Address(moduleSection,0);
  12185. END;
  12186. END Module;
  12187. PROCEDURE PatchCRC(crc: LONGINT);
  12188. BEGIN
  12189. IF ~simple THEN
  12190. PatchLongint(ModuleSection(), patchCRC, crc);
  12191. END;
  12192. END PatchCRC;
  12193. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12194. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12195. BEGIN
  12196. ArrayBlock(source,pc,"",FALSE);
  12197. Info(source, "pointer offsets array data");
  12198. IF scope IS SyntaxTree.RecordScope THEN
  12199. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12200. ELSIF scope IS SyntaxTree.CellScope THEN
  12201. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12202. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12203. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12204. WHILE variable # NIL DO
  12205. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12206. symbol := module.allSections.FindBySymbol(variable);
  12207. ASSERT(symbol # NIL);
  12208. Pointers(0,symbol, source,variable.type,numberPointers);
  12209. END;
  12210. variable := variable.nextVariable;
  12211. END;
  12212. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12213. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12214. WHILE parameter # NIL DO
  12215. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12216. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12217. END;
  12218. parameter := parameter.nextParameter;
  12219. END;
  12220. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12221. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12222. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12223. IF implementationVisitor.backend.preciseGC THEN
  12224. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12225. END;
  12226. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12227. END;
  12228. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12229. WHILE(variable # NIL) DO
  12230. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12231. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12232. END;
  12233. variable := variable.nextVariable
  12234. END;
  12235. END;
  12236. PatchArray(source,pc,numberPointers);
  12237. END PointerArray;
  12238. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12239. VAR
  12240. name: Basic.SegmentedName;
  12241. section: IntermediateCode.Section;
  12242. BEGIN
  12243. Global.GetSymbolSegmentedName(symbol,name);
  12244. Basic.AppendToSegmentedName(name,suffix);
  12245. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12246. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12247. Info(section, "HeapBlock");
  12248. Address(section,0); (* empty such that GC does not go on traversing *)
  12249. Info(section, suffix);
  12250. Address(section,0);
  12251. pc := section.pc;
  12252. RETURN section;
  12253. END SymbolSection;
  12254. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12255. VAR recordType: SyntaxTree.RecordType;
  12256. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12257. section: Sections.Section; cellType: SyntaxTree.CellType;
  12258. tdInfoOffset: LONGINT;
  12259. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12260. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12261. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12262. sectionName: Basic.SectionName;
  12263. CONST MPO=-40000000H;
  12264. BEGIN
  12265. (*
  12266. TypeDesc* = POINTER TO RECORD
  12267. descSize: SIZE;
  12268. sentinel: LONGINT; (* = MPO-4 *)
  12269. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12270. flags*: SET;
  12271. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12272. name*: Name;
  12273. refsOffset: SIZE;
  12274. END;
  12275. *)
  12276. (* source := module.sections.FindByName(...) *)
  12277. Global.GetSymbolSegmentedName(td,name);
  12278. Basic.AppendToSegmentedName(name,".@Info");
  12279. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12280. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12281. Address(source,0);
  12282. Info(source, "TypeDescriptor");
  12283. Address(source,0);
  12284. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12285. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12286. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12287. Info(source, "type tag pointer");
  12288. Symbol( source, tag, offset, 0);
  12289. Info(source, "type flags");
  12290. flags := {};
  12291. IF isProtected THEN INCL(flags,31) END;
  12292. Set( source, flags);
  12293. Info(source, "pointer to module");
  12294. moduleSection := ModuleSection();
  12295. Symbol( source, moduleSection, moduleSection.pc,0);
  12296. Info(source, "type name");
  12297. i := 0;
  12298. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12299. (*
  12300. Global.GetSymbolSegmentedName(td,name);
  12301. Basic.SegmentedNameToString(name, sectionName);
  12302. *)
  12303. Name(source,sectionName);
  12304. Size(source, 0);
  12305. RETURN source;
  12306. END NewTypeDescriptorInfo;
  12307. PROCEDURE NewTypeDescriptor;
  12308. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12309. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12310. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12311. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12312. CONST MPO=-40000000H;
  12313. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12314. VAR i: LONGINT;
  12315. PROCEDURE Td(record: SyntaxTree.RecordType);
  12316. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12317. BEGIN
  12318. IF record # NIL THEN
  12319. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12320. baseTD := record.typeDeclaration;
  12321. Global.GetSymbolSegmentedName(baseTD,name);
  12322. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12323. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12324. ELSE
  12325. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12326. END;
  12327. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12328. Symbol(source, tir, 0, offset);
  12329. IF reverse THEN Td(record.GetBaseRecord()) END;
  12330. END;
  12331. END Td;
  12332. BEGIN
  12333. Info(source, "tag table");
  12334. baseRecord := recordType;
  12335. i := 0;
  12336. WHILE baseRecord # NIL DO
  12337. INC(i);
  12338. baseRecord := baseRecord.GetBaseRecord();
  12339. END;
  12340. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12341. IF ~reverse THEN Td(recordType) END;
  12342. WHILE i < size DO
  12343. Address(source,0);
  12344. INC(i);
  12345. END;
  12346. IF reverse THEN Td(recordType) END;
  12347. END TdTable;
  12348. PROCEDURE MethodTable(reverse: BOOLEAN);
  12349. VAR i,methods: LONGINT;
  12350. BEGIN
  12351. Info(source, "method table");
  12352. IF recordType # NIL THEN
  12353. methods := recordType.recordScope.numberMethods;
  12354. IF reverse THEN
  12355. FOR i := methods-1 TO 0 BY -1 DO
  12356. procedure := recordType.recordScope.FindMethod(i);
  12357. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12358. NamedSymbol(source, name,procedure, 0,0);
  12359. END;
  12360. ELSE
  12361. FOR i := 0 TO methods-1 DO
  12362. procedure := recordType.recordScope.FindMethod(i);
  12363. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12364. NamedSymbol(source, name,procedure, 0,0);
  12365. END;
  12366. END;
  12367. END;
  12368. END MethodTable;
  12369. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12370. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12371. BEGIN
  12372. Info(source, "method table");
  12373. baseRecord := recordType;
  12374. WHILE baseRecord.baseType # NIL DO
  12375. baseRecord := baseRecord.GetBaseRecord ();
  12376. END;
  12377. GetRecordTypeName (baseRecord, name);
  12378. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12379. IF name = stackFrame THEN
  12380. start := 0;
  12381. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12382. baseRecord := recordType;
  12383. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12384. baseRecord := baseRecord.GetBaseRecord ();
  12385. END;
  12386. IF baseRecord # NIL THEN
  12387. GetRecordTypeName (baseRecord, name);
  12388. IF pointer & ~baseRecord.isObject THEN
  12389. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12390. END;
  12391. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12392. ELSIF recordType.isObject THEN
  12393. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12394. ELSIF pointer THEN
  12395. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12396. ELSE
  12397. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12398. END;
  12399. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12400. Symbol(source, tir, 0, 0);
  12401. start := 0;
  12402. baseRecord := recordType;
  12403. WHILE (baseRecord # NIL) DO
  12404. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12405. baseRecord := baseRecord.GetBaseRecord ();
  12406. END;
  12407. ELSE
  12408. (* explicit trace method: *)
  12409. procedure := recordType.recordScope.FindMethod(0);
  12410. IF ~procedure.isFinalizer THEN
  12411. Global.GetSymbolSegmentedName(procedure, name);
  12412. NamedSymbol(source, name,procedure, 0,0);
  12413. END;
  12414. start := 1;
  12415. END;
  12416. IF (name # stackFrame) & recordType.isObject THEN
  12417. baseRecord := recordType;
  12418. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12419. baseRecord := baseRecord.GetBaseRecord ();
  12420. END;
  12421. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12422. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12423. ELSE
  12424. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12425. END;
  12426. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12427. Symbol(source, tir, 0, 0);
  12428. END;
  12429. methods := recordType.recordScope.numberMethods;
  12430. FOR i := start TO methods-1 DO
  12431. procedure := recordType.recordScope.FindMethod(i);
  12432. IF ~procedure.isFinalizer THEN
  12433. Global.GetSymbolSegmentedName(procedure, name);
  12434. NamedSymbol(source, name,procedure, 0,0);
  12435. END;
  12436. END;
  12437. END CooperativeMethodTable;
  12438. BEGIN
  12439. Global.GetSymbolSegmentedName(td,name);
  12440. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12441. source.SetExported(IsExported(td));
  12442. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12443. IF implementationVisitor.backend.cooperative THEN
  12444. base := NIL;
  12445. baseRecord := recordType.GetBaseRecord();
  12446. IF baseRecord # NIL THEN
  12447. baseTD := baseRecord.typeDeclaration;
  12448. END;
  12449. IF ~recordType.isObject THEN
  12450. Info(source, "parent");
  12451. IF baseRecord # NIL THEN
  12452. Global.GetSymbolSegmentedName(baseTD,name);
  12453. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12454. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12455. ELSE
  12456. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12457. END;
  12458. Symbol(source, tir, 0, 0);
  12459. ELSE
  12460. Address(source,0);
  12461. END;
  12462. Info(source, "record size");
  12463. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12464. CooperativeMethodTable(FALSE);
  12465. base := source;
  12466. Global.GetSymbolSegmentedName(td,name);
  12467. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12468. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12469. source.SetExported(IsExported(td));
  12470. END;
  12471. Info(source, "parent");
  12472. IF baseRecord # NIL THEN
  12473. Global.GetSymbolSegmentedName(baseTD,name);
  12474. sym := baseTD;
  12475. IF ~recordType.isObject THEN
  12476. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12477. sym := NIL;
  12478. END;
  12479. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12480. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12481. ELSE
  12482. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12483. END;
  12484. Symbol(source, tir, 0, 0);
  12485. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12486. Address(source,0);
  12487. ELSE
  12488. IF recordType.isObject THEN
  12489. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12490. ELSE
  12491. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12492. END;
  12493. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12494. Symbol(source, tir, 0, 0);
  12495. END;
  12496. Info(source, "base record descriptor");
  12497. Symbol(source, base, 0, 0);
  12498. CooperativeMethodTable(TRUE);
  12499. IF recordType.hasPointers THEN
  12500. IF ~HasExplicitTraceMethod (recordType) THEN
  12501. implementationVisitor.CreateTraceMethod(recordType);
  12502. END;
  12503. implementationVisitor.CreateResetProcedure(recordType);
  12504. implementationVisitor.CreateAssignProcedure(recordType);
  12505. END;
  12506. ELSIF ~simple THEN
  12507. (*
  12508. MethodEnd = MPO
  12509. ---
  12510. methods (# methods)
  12511. ---
  12512. tags (16)
  12513. ---
  12514. TypeDesc = TypeInfoAdr
  12515. ---
  12516. td adr ---> rec size
  12517. ----
  12518. pointer offsets
  12519. ----
  12520. (padding)
  12521. -----
  12522. empty [2 addresses aligned]
  12523. empty
  12524. empty
  12525. numPtrs
  12526. ---
  12527. pointer offsets
  12528. ---
  12529. *)
  12530. Info(source, "MethodEnd = MPO");
  12531. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12532. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12533. MethodTable(TRUE);
  12534. TdTable(TypeTags, TRUE);
  12535. Info(source, "type descriptor info pointer");
  12536. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12537. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12538. IF (cellType # NIL) THEN
  12539. IF cellType.sizeInBits < 0 THEN
  12540. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12541. END;
  12542. Info(source, "cell size");
  12543. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12544. ELSE
  12545. Info(source, "record size");
  12546. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12547. END;
  12548. Info(source, "pointer offsets pointer");
  12549. padding := 1- source.pc MOD 2;
  12550. Symbol(source, source, source.pc+1+padding,0);
  12551. IF padding >0 THEN
  12552. Info(source, "padding");
  12553. FOR i := 1 TO padding DO Address(source,0) END;
  12554. END;
  12555. IF cellType # NIL THEN
  12556. PointerArray(source, cellType.cellScope, numberPointers);
  12557. ELSE
  12558. PointerArray(source, recordType.recordScope, numberPointers);
  12559. END;
  12560. ELSE
  12561. (*
  12562. simple:
  12563. td adr --> size
  12564. tag(1)
  12565. tag(2)
  12566. tag(3)
  12567. methods ->
  12568. *)
  12569. Info(source, "record size");
  12570. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12571. TdTable(TypeTags, FALSE);
  12572. MethodTable(FALSE);
  12573. END;
  12574. END NewTypeDescriptor;
  12575. BEGIN
  12576. x := x.resolved;
  12577. IF (x IS SyntaxTree.PointerType) THEN
  12578. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12579. END;
  12580. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12581. recordType := x(SyntaxTree.RecordType);
  12582. td := x.typeDeclaration;
  12583. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12584. ASSERT(td # NIL);
  12585. section := module.allSections.FindBySymbol(td); (* TODO *)
  12586. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12587. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12588. NewTypeDescriptor
  12589. END;
  12590. END;
  12591. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12592. cellType := x(SyntaxTree.CellType);
  12593. td := x.typeDeclaration;
  12594. section := module.allSections.FindBySymbol(td); (* TODO *)
  12595. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12596. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12597. NewTypeDescriptor
  12598. END;
  12599. END;
  12600. END
  12601. END CheckTypeDeclaration
  12602. END MetaDataGenerator;
  12603. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12604. VAR
  12605. trace-: BOOLEAN;
  12606. traceString-: SyntaxTree.IdentifierString;
  12607. traceModuleName-: SyntaxTree.IdentifierString;
  12608. profile-: BOOLEAN;
  12609. noRuntimeChecks: BOOLEAN;
  12610. simpleMetaData-: BOOLEAN;
  12611. noAsserts: BOOLEAN;
  12612. optimize-: BOOLEAN;
  12613. cooperative-: BOOLEAN;
  12614. preregisterStatic-: BOOLEAN;
  12615. dump-: Basic.Writer;
  12616. cellsAreObjects: BOOLEAN;
  12617. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12618. experiment: BOOLEAN;
  12619. PROCEDURE &InitIntermediateBackend*;
  12620. BEGIN
  12621. simpleMetaData := FALSE;
  12622. InitBackend;
  12623. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12624. SetTraceModuleName(DefaultTraceModuleName);
  12625. END InitIntermediateBackend;
  12626. (* must be overwritten by actual backend, if parameter registers should be used *)
  12627. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12628. BEGIN
  12629. RETURN 0; (* default case: no parameter registers *)
  12630. END NumberParameterRegisters;
  12631. (* must be overwritten by actual backend, if parameter registers should be used *)
  12632. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12633. BEGIN
  12634. HALT(100); (* abstract *)
  12635. END ParameterRegister;
  12636. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12637. VAR
  12638. declarationVisitor: DeclarationVisitor;
  12639. implementationVisitor: ImplementationVisitor;
  12640. module: Sections.Module;
  12641. name, platformName: SyntaxTree.IdentifierString;
  12642. meta: MetaDataGenerator;
  12643. crc: CRC.CRC32Stream;
  12644. BEGIN
  12645. ResetError;
  12646. Global.GetSymbolName(x,name);
  12647. NEW(module,x,system); (* backend structures *)
  12648. Global.GetModuleName(x, name);
  12649. module.SetModuleName(name);
  12650. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12651. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12652. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12653. declarationVisitor.Module(x,module);
  12654. IF ~meta.simple THEN
  12655. meta.Module(implementationVisitor.moduleBodySection);
  12656. END;
  12657. GetDescription(platformName);
  12658. module.SetPlatformName(platformName);
  12659. NEW(crc);
  12660. module.allSections.WriteRaw(crc);
  12661. crc.Update;
  12662. meta.PatchCRC(crc.GetCRC());
  12663. RETURN module
  12664. END GenerateIntermediate;
  12665. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12666. BEGIN RETURN TRUE
  12667. END SupportedImmediate;
  12668. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12669. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12670. END ProcessSyntaxTreeModule;
  12671. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12672. VAR
  12673. result: Sections.Module;
  12674. traceName: Basic.MessageString;
  12675. BEGIN
  12676. ASSERT(intermediateCodeModule IS Sections.Module);
  12677. result := intermediateCodeModule(Sections.Module);
  12678. IF trace THEN
  12679. traceName := "intermediate code trace: ";
  12680. Strings.Append(traceName,traceString);
  12681. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12682. IF (traceString="") OR (traceString="*") THEN
  12683. result.Dump(dump);
  12684. dump.Update
  12685. ELSE
  12686. Sections.DumpFiltered(dump, result, traceString);
  12687. END
  12688. END;
  12689. RETURN result
  12690. END ProcessIntermediateCodeModule;
  12691. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12692. BEGIN instructionSet := "Intermediate";
  12693. END GetDescription;
  12694. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12695. BEGIN
  12696. SELF.simpleMetaData := simpleMetaData;
  12697. END SetSimpleMetaData;
  12698. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12699. BEGIN COPY(name, traceModuleName)
  12700. END SetTraceModuleName;
  12701. PROCEDURE DefineOptions*(options: Options.Options);
  12702. BEGIN
  12703. DefineOptions^(options);
  12704. options.Add(0X,"trace",Options.String);
  12705. options.Add(0X,"builtinsModule",Options.String);
  12706. options.Add(0X,"traceModule",Options.String);
  12707. options.Add(0X,"profile",Options.Flag);
  12708. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12709. options.Add(0X,"noAsserts",Options.Flag);
  12710. options.Add(0X,"metaData",Options.String);
  12711. options.Add('o',"optimize", Options.Flag);
  12712. options.Add(0X,"preregisterStatic", Options.Flag);
  12713. options.Add(0X,"cellsAreObjects", Options.Flag);
  12714. options.Add(0X,"preciseGC", Options.Flag);
  12715. options.Add(0X,"trackLeave", Options.Flag);
  12716. options.Add(0X,"writeBarriers", Options.Flag);
  12717. options.Add(0X,"experiment", Options.Flag);
  12718. END DefineOptions;
  12719. PROCEDURE GetOptions*(options: Options.Options);
  12720. VAR name,string: SyntaxTree.IdentifierString;
  12721. BEGIN
  12722. GetOptions^(options);
  12723. trace := options.GetString("trace",traceString);
  12724. profile := options.GetFlag("profile");
  12725. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12726. noAsserts := options.GetFlag("noAsserts");
  12727. cooperative := options.GetFlag("cooperative");
  12728. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12729. simpleMetaData := TRUE
  12730. END;
  12731. IF options.GetString("metaData",string) THEN
  12732. IF string = "simple" THEN simpleMetaData := TRUE
  12733. ELSIF string ="full" THEN simpleMetaData := FALSE
  12734. END;
  12735. END;
  12736. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12737. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12738. optimize := options.GetFlag("optimize");
  12739. preregisterStatic := options.GetFlag("preregisterStatic");
  12740. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12741. preciseGC := options.GetFlag("preciseGC");
  12742. trackLeave := options.GetFlag("trackLeave");
  12743. writeBarriers := options.GetFlag("writeBarriers");
  12744. experiment := options.GetFlag("experiment");
  12745. END GetOptions;
  12746. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12747. BEGIN RETURN SymbolFileFormat.Get()
  12748. END DefaultSymbolFileFormat;
  12749. END IntermediateBackend;
  12750. (* ----------------------------------- register allocation ------------------------------------- *)
  12751. (* register mapping scheme
  12752. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12753. spill offset
  12754. part(n) --> ticket <--> physical register
  12755. spill offset
  12756. *)
  12757. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12758. emptyOperand: IntermediateCode.Operand;
  12759. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12760. statCoopResetVariables: LONGINT;
  12761. statCoopModifyAssignments: LONGINT;
  12762. modifyAssignmentsPC : LONGINT;
  12763. statCoopNilCheck: LONGINT;
  12764. statCoopSwitch: LONGINT;
  12765. statCoopAssignProcedure: LONGINT;
  12766. statCoopTraceMethod: LONGINT;
  12767. statCoopResetProcedure: LONGINT;
  12768. statCoopTraceModule: LONGINT;
  12769. PROCEDURE ResetStatistics*;
  12770. BEGIN
  12771. statCoopResetVariables := 0;
  12772. statCoopModifyAssignments := 0;
  12773. statCoopNilCheck:= 0;
  12774. statCoopSwitch:= 0;
  12775. statCoopAssignProcedure:= 0;
  12776. statCoopTraceMethod:= 0;
  12777. statCoopResetProcedure:= 0;
  12778. statCoopTraceModule:= 0;
  12779. END ResetStatistics;
  12780. PROCEDURE Statistics*;
  12781. BEGIN
  12782. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12783. TRACE(statCoopNilCheck, statCoopSwitch);
  12784. TRACE(statCoopAssignProcedure,
  12785. statCoopTraceMethod,
  12786. statCoopResetProcedure,
  12787. statCoopTraceModule)
  12788. END Statistics;
  12789. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12790. VAR h: LONGINT;
  12791. BEGIN
  12792. WHILE b # 0 DO
  12793. h := a MOD b;
  12794. a := b;
  12795. b := h;
  12796. END;
  12797. RETURN a
  12798. END GCD;
  12799. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12800. BEGIN
  12801. RETURN a*b DIV GCD(a,b)
  12802. END SCM;
  12803. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12804. BEGIN
  12805. (*TRACE(a,b);*)
  12806. IF a = 0 THEN RETURN b
  12807. ELSIF b = 0 THEN RETURN a
  12808. ELSE RETURN SCM(a,b)
  12809. END;
  12810. END CommonAlignment;
  12811. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12812. BEGIN
  12813. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12814. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12815. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12816. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12817. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12818. END
  12819. END PassBySingleReference;
  12820. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12821. BEGIN
  12822. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12823. END PassInRegister;
  12824. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12825. VAR new: RegisterEntry;
  12826. BEGIN
  12827. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12828. IF queue = NIL THEN
  12829. queue := new
  12830. ELSE
  12831. new.next := queue;
  12832. IF queue#NIL THEN queue.prev := new END;
  12833. queue := new
  12834. END;
  12835. END AddRegisterEntry;
  12836. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12837. VAR this: RegisterEntry;
  12838. BEGIN
  12839. this := queue;
  12840. WHILE (this # NIL) & (this.register # register) DO
  12841. this := this.next;
  12842. END;
  12843. IF this = NIL THEN
  12844. RETURN FALSE
  12845. END;
  12846. ASSERT(this # NIL);
  12847. IF this = queue THEN queue := queue.next END;
  12848. IF this.prev # NIL THEN this.prev.next := this.next END;
  12849. IF this.next # NIL THEN this.next.prev := this.prev END;
  12850. RETURN TRUE
  12851. END RemoveRegisterEntry;
  12852. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12853. BEGIN ASSERT(cond);
  12854. END Assert;
  12855. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12856. BEGIN
  12857. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12858. END ReusableRegister;
  12859. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12860. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12861. BEGIN
  12862. procedure := moduleScope.bodyProcedure;
  12863. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12864. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12865. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12866. procedure.SetScope(moduleScope);
  12867. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12868. procedure.SetAccess(SyntaxTree.Hidden);
  12869. moduleScope.SetBodyProcedure(procedure);
  12870. moduleScope.AddProcedure(procedure);
  12871. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12872. END;
  12873. END EnsureBodyProcedure;
  12874. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12875. VAR import: SyntaxTree.Import;
  12876. selfName: SyntaxTree.IdentifierString;
  12877. module: SyntaxTree.Module;
  12878. BEGIN
  12879. scope.ownerModule.GetName(selfName);
  12880. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12881. module := scope.ownerModule
  12882. ELSE
  12883. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12884. IF import = NIL THEN
  12885. RETURN NIL
  12886. ELSIF import.module = NIL THEN
  12887. RETURN NIL
  12888. ELSE module := import.module
  12889. END;
  12890. END;
  12891. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12892. END GetSymbol;
  12893. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12894. BEGIN
  12895. op.mode := mode;
  12896. IntermediateCode.InitOperand(op.op);
  12897. IntermediateCode.InitOperand(op.tag);
  12898. IntermediateCode.InitOperand(op.extra);
  12899. op.dimOffset := 0;
  12900. END InitOperand;
  12901. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12902. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12903. BEGIN RETURN IntermediateCode.GetType(system, type)
  12904. END GetType;
  12905. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12906. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12907. BEGIN
  12908. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12909. (*
  12910. UniqueId(name,module,name,adr);
  12911. *)
  12912. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12913. constant.SetValue(value);
  12914. constant.SetAccess(SyntaxTree.Hidden);
  12915. module.moduleScope.AddConstant(constant);
  12916. constant.SetScope(module.moduleScope);
  12917. RETURN constant
  12918. END BuildConstant;
  12919. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12920. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12921. BEGIN
  12922. variable := scope.firstVariable;
  12923. WHILE variable # NIL DO
  12924. IF variable.NeedsTrace() THEN
  12925. RETURN TRUE;
  12926. END;
  12927. variable := variable.nextVariable;
  12928. END;
  12929. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12930. WHILE parameter # NIL DO
  12931. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12932. RETURN TRUE;
  12933. END;
  12934. parameter := parameter.nextParameter;
  12935. END;
  12936. RETURN FALSE;
  12937. END HasPointers;
  12938. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12939. 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));
  12940. END IsVariableParameter;
  12941. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12942. VAR parameter: SyntaxTree.Parameter;
  12943. BEGIN
  12944. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12945. WHILE parameter # NIL DO
  12946. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12947. IF parameter.movable THEN RETURN TRUE END;
  12948. parameter := parameter.nextParameter;
  12949. END;
  12950. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12951. END HasVariableParameters;
  12952. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12953. BEGIN
  12954. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12955. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12956. END HasExplicitTraceMethod;
  12957. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12958. BEGIN
  12959. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12960. IF (expression IS SyntaxTree.IntegerValue) THEN
  12961. val := expression(SyntaxTree.IntegerValue).value;
  12962. RETURN TRUE
  12963. ELSE
  12964. RETURN FALSE
  12965. END;
  12966. END IsIntegerConstant;
  12967. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12968. BEGIN
  12969. IF val <= 0 THEN RETURN FALSE END;
  12970. exp := 0;
  12971. WHILE ~ODD(val) DO
  12972. val := val DIV 2;
  12973. INC(exp)
  12974. END;
  12975. RETURN val = 1
  12976. END PowerOf2;
  12977. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12978. VAR procedure: SyntaxTree.Procedure;
  12979. BEGIN
  12980. procedure := record.recordScope.constructor;
  12981. IF procedure = NIL THEN
  12982. record := record.GetBaseRecord();
  12983. IF record # NIL THEN
  12984. procedure := GetConstructor(record)
  12985. END;
  12986. END;
  12987. RETURN procedure;
  12988. END GetConstructor;
  12989. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12990. BEGIN
  12991. value := SHORT(op.intValue);
  12992. RETURN op.mode = IntermediateCode.ModeImmediate;
  12993. END IsIntegerImmediate;
  12994. (** whether a type strictily is a pointer to record or object type
  12995. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12996. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12997. BEGIN
  12998. IF type = NIL THEN
  12999. RETURN FALSE
  13000. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13001. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13002. ELSE
  13003. RETURN FALSE
  13004. END
  13005. END IsStrictlyPointerToRecord;
  13006. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13007. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13008. END IsUnsafePointer;
  13009. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13010. BEGIN type := type.resolved;
  13011. IF type IS SyntaxTree.PointerType THEN
  13012. type := type(SyntaxTree.PointerType).pointerBase;
  13013. type := type.resolved;
  13014. IF type IS SyntaxTree.RecordType THEN
  13015. recordType := type(SyntaxTree.RecordType);
  13016. RETURN TRUE
  13017. ELSE
  13018. RETURN FALSE
  13019. END
  13020. ELSIF type IS SyntaxTree.RecordType THEN
  13021. recordType := type(SyntaxTree.RecordType);
  13022. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13023. ELSIF type IS SyntaxTree.ObjectType THEN
  13024. RETURN TRUE
  13025. ELSIF type IS SyntaxTree.AnyType THEN
  13026. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13027. ELSE
  13028. RETURN FALSE
  13029. END;
  13030. END IsPointerToRecord;
  13031. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13032. BEGIN
  13033. type := type.resolved;
  13034. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13035. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13036. END IsArrayOfSystemByte;
  13037. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13038. BEGIN
  13039. IF type = NIL THEN RETURN FALSE END;
  13040. type := type.resolved;
  13041. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13042. END IsOpenArray;
  13043. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13044. BEGIN
  13045. IF type = NIL THEN RETURN FALSE END;
  13046. type := type.resolved;
  13047. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13048. END IsSemiDynamicArray;
  13049. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13050. BEGIN
  13051. IF type = NIL THEN RETURN FALSE END;
  13052. type := type.resolved;
  13053. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13054. END IsStaticArray;
  13055. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13056. BEGIN
  13057. IF type = NIL THEN RETURN FALSE END;
  13058. type := type.resolved;
  13059. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13060. END IsStaticMathArray;
  13061. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13062. BEGIN
  13063. WHILE (IsStaticMathArray(type)) DO
  13064. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13065. END;
  13066. RETURN type;
  13067. END StaticMathArrayBaseType;
  13068. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13069. VAR size: LONGINT;
  13070. BEGIN
  13071. size := 1;
  13072. WHILE (IsStaticArray(type)) DO
  13073. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13074. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13075. END;
  13076. RETURN size;
  13077. END StaticArrayNumElements;
  13078. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13079. VAR size: LONGINT;
  13080. BEGIN
  13081. size := 1;
  13082. WHILE (IsStaticMathArray(type)) DO
  13083. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13084. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13085. END;
  13086. RETURN size;
  13087. END StaticMathArrayNumElements;
  13088. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13089. BEGIN
  13090. WHILE (IsStaticArray(type)) DO
  13091. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13092. END;
  13093. RETURN type;
  13094. END StaticArrayBaseType;
  13095. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13096. BEGIN
  13097. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13098. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13099. END;
  13100. RETURN type;
  13101. END ArrayBaseType;
  13102. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13103. BEGIN
  13104. IF type = NIL THEN RETURN FALSE END;
  13105. type := type.resolved;
  13106. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13107. END IsDelegate;
  13108. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13109. VAR i: LONGINT;
  13110. BEGIN
  13111. i := 0; type := type.resolved;
  13112. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13113. INC(i);
  13114. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13115. END;
  13116. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13117. INC(i);
  13118. type := type(SyntaxTree.MathArrayType).arrayBase;
  13119. IF type # NIL THEN type := type.resolved END;
  13120. END;
  13121. RETURN i
  13122. END DynamicDim;
  13123. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13124. BEGIN
  13125. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13126. type := type(SyntaxTree.ArrayType).arrayBase;
  13127. END;
  13128. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13129. type := type(SyntaxTree.MathArrayType).arrayBase;
  13130. END;
  13131. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13132. END StaticSize;
  13133. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13134. BEGIN
  13135. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13136. END IsImmediate;
  13137. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13138. BEGIN
  13139. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13140. END IsAddress;
  13141. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13142. BEGIN
  13143. RETURN (x.mode = IntermediateCode.ModeRegister);
  13144. END IsRegister;
  13145. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13146. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13147. BEGIN
  13148. typeDeclaration := recordType.typeDeclaration;
  13149. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13150. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13151. END GetRecordTypeName;
  13152. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13153. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13154. BEGIN
  13155. parSize := 0;
  13156. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13157. parameter := procedureType.returnParameter;
  13158. INC(parSize,system.SizeOfParameter(parameter));
  13159. parSize := parSize + (-parSize) MOD system.addressSize;
  13160. END;
  13161. parameter :=procedureType.lastParameter;
  13162. WHILE (parameter # NIL) DO
  13163. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13164. INC(parSize, system.addressSize);
  13165. ELSE
  13166. INC(parSize,system.SizeOfParameter(parameter));
  13167. parSize := parSize + (-parSize) MOD system.addressSize;
  13168. END;
  13169. parameter := parameter.prevParameter;
  13170. END;
  13171. IF procedureType.selfParameter # NIL THEN
  13172. parameter := procedureType.selfParameter;
  13173. INC(parSize,system.SizeOfParameter(parameter));
  13174. parSize := parSize + (-parSize) MOD system.addressSize;
  13175. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13176. END; (* method => self pointer *)
  13177. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13178. RETURN ToMemoryUnits(system,parSize)
  13179. END ParametersSize;
  13180. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13181. BEGIN
  13182. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13183. END IsNested;
  13184. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13185. BEGIN
  13186. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13187. scope := scope.outerScope;
  13188. END;
  13189. RETURN scope # NIL;
  13190. END InCellScope;
  13191. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13192. BEGIN
  13193. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13194. END ProcedureParametersSize;
  13195. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13196. VAR dataUnit: LONGINT;
  13197. BEGIN dataUnit := system.dataUnit;
  13198. ASSERT(size MOD system.dataUnit = 0);
  13199. RETURN LONGINT(size DIV system.dataUnit)
  13200. END ToMemoryUnits;
  13201. PROCEDURE Get*(): Backend.Backend;
  13202. VAR backend: IntermediateBackend;
  13203. BEGIN NEW(backend); RETURN backend
  13204. END Get;
  13205. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13206. VAR instruction: IntermediateCode.Instruction;
  13207. BEGIN
  13208. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13209. RETURN instruction
  13210. END Nop;
  13211. PROCEDURE Mov(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,emptyOperand);
  13215. RETURN instruction
  13216. END Mov;
  13217. (* like Mov but ensures that no new register will be allocated for dest *)
  13218. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13219. VAR instruction: IntermediateCode.Instruction;
  13220. BEGIN
  13221. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13222. RETURN instruction
  13223. END MovReplace;
  13224. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13225. VAR instruction: IntermediateCode.Instruction;
  13226. BEGIN
  13227. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13228. RETURN instruction
  13229. END Conv;
  13230. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13231. VAR instruction: IntermediateCode.Instruction;
  13232. BEGIN
  13233. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13234. RETURN instruction
  13235. END Call;
  13236. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13237. VAR op1, op2, op3: IntermediateCode.Operand;
  13238. VAR instruction: IntermediateCode.Instruction;
  13239. BEGIN
  13240. IntermediateCode.InitNumber(op1,pcOffset);
  13241. IntermediateCode.InitNumber(op2,callingConvention);
  13242. IntermediateCode.InitNumber(op3,unwind);
  13243. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13244. RETURN instruction
  13245. END Exit;
  13246. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13247. VAR instruction: IntermediateCode.Instruction;
  13248. BEGIN
  13249. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13250. RETURN instruction
  13251. END Return;
  13252. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13253. VAR instruction: IntermediateCode.Instruction;
  13254. BEGIN
  13255. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13256. RETURN instruction
  13257. END Result;
  13258. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13259. VAR op1: IntermediateCode.Operand;
  13260. VAR instruction: IntermediateCode.Instruction;
  13261. BEGIN
  13262. IntermediateCode.InitNumber(op1,nr);
  13263. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13264. RETURN instruction
  13265. END Trap;
  13266. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13267. VAR instruction: IntermediateCode.Instruction;
  13268. BEGIN
  13269. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13270. RETURN instruction
  13271. END Br;
  13272. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13273. VAR instruction: IntermediateCode.Instruction;
  13274. BEGIN
  13275. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13276. RETURN instruction
  13277. END Breq;
  13278. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13279. VAR instruction: IntermediateCode.Instruction;
  13280. BEGIN
  13281. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13282. RETURN instruction
  13283. END Brne;
  13284. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13285. VAR instruction: IntermediateCode.Instruction;
  13286. BEGIN
  13287. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13288. RETURN instruction
  13289. END Brge;
  13290. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13291. VAR instruction: IntermediateCode.Instruction;
  13292. BEGIN
  13293. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13294. RETURN instruction
  13295. END Brlt;
  13296. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13297. VAR instruction: IntermediateCode.Instruction;
  13298. BEGIN
  13299. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13300. RETURN instruction
  13301. END Pop;
  13302. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13303. VAR instruction: IntermediateCode.Instruction;
  13304. BEGIN
  13305. ASSERT(op.mode # IntermediateCode.Undefined);
  13306. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13307. RETURN instruction
  13308. END Push;
  13309. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13310. VAR instruction: IntermediateCode.Instruction;
  13311. BEGIN
  13312. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13313. RETURN instruction
  13314. END Neg;
  13315. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13316. VAR instruction: IntermediateCode.Instruction;
  13317. BEGIN
  13318. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13319. RETURN instruction
  13320. END Not;
  13321. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13322. VAR instruction: IntermediateCode.Instruction;
  13323. BEGIN
  13324. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13325. RETURN instruction
  13326. END Abs;
  13327. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13328. VAR instruction: IntermediateCode.Instruction;
  13329. BEGIN
  13330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13331. ASSERT(~IsImmediate(instruction.op1));
  13332. RETURN instruction
  13333. END Mul;
  13334. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13335. VAR instruction: IntermediateCode.Instruction;
  13336. BEGIN
  13337. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13338. RETURN instruction
  13339. END Div;
  13340. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13341. VAR instruction: IntermediateCode.Instruction;
  13342. BEGIN
  13343. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13344. RETURN instruction
  13345. END Mod;
  13346. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13347. VAR instruction: IntermediateCode.Instruction;
  13348. BEGIN
  13349. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13350. RETURN instruction
  13351. END Sub;
  13352. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13353. VAR instruction: IntermediateCode.Instruction;
  13354. BEGIN
  13355. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13356. RETURN instruction
  13357. END Add;
  13358. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13359. VAR instruction: IntermediateCode.Instruction;
  13360. BEGIN
  13361. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13362. RETURN instruction
  13363. END And;
  13364. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13365. VAR instruction: IntermediateCode.Instruction;
  13366. BEGIN
  13367. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13368. RETURN instruction
  13369. END Or;
  13370. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13371. VAR instruction: IntermediateCode.Instruction;
  13372. BEGIN
  13373. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13374. RETURN instruction
  13375. END Xor;
  13376. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13377. VAR instruction: IntermediateCode.Instruction;
  13378. BEGIN
  13379. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13380. RETURN instruction
  13381. END Shl;
  13382. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13383. VAR instruction: IntermediateCode.Instruction;
  13384. BEGIN
  13385. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13386. RETURN instruction
  13387. END Shr;
  13388. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13389. VAR instruction: IntermediateCode.Instruction;
  13390. BEGIN
  13391. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13392. RETURN instruction
  13393. END Rol;
  13394. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13395. VAR instruction: IntermediateCode.Instruction;
  13396. BEGIN
  13397. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13398. RETURN instruction
  13399. END Ror;
  13400. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13401. VAR instruction: IntermediateCode.Instruction;
  13402. BEGIN
  13403. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13404. RETURN instruction
  13405. END Cas;
  13406. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13407. VAR instruction: IntermediateCode.Instruction;
  13408. BEGIN
  13409. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13410. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13411. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13412. RETURN instruction
  13413. END Copy;
  13414. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13415. VAR instruction: IntermediateCode.Instruction;
  13416. BEGIN
  13417. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13418. RETURN instruction
  13419. END Fill;
  13420. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13421. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13422. BEGIN
  13423. string := IntermediateCode.String(s);
  13424. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13425. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13426. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13427. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13428. RETURN instruction
  13429. END Asm;
  13430. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13431. VAR instruction: IntermediateCode.Instruction;
  13432. BEGIN
  13433. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13434. RETURN instruction
  13435. END Data;
  13436. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13437. VAR instruction: IntermediateCode.Instruction;
  13438. BEGIN
  13439. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13440. IntermediateCode.SetSubType(instruction, subtype);
  13441. RETURN instruction
  13442. END SpecialInstruction;
  13443. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13444. VAR op1: IntermediateCode.Operand;
  13445. VAR instruction: IntermediateCode.Instruction;
  13446. BEGIN
  13447. (*! generate a warning if size exceeds a certain limit *)
  13448. (*
  13449. ASSERT(bytes < 1000000); (* sanity check *)
  13450. *)
  13451. ASSERT(0 <= units); (* sanity check *)
  13452. IntermediateCode.InitNumber(op1,units);
  13453. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13454. RETURN instruction
  13455. END Reserve;
  13456. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13457. VAR op1: IntermediateCode.Operand;
  13458. VAR instruction: IntermediateCode.Instruction;
  13459. BEGIN
  13460. IntermediateCode.InitNumber(op1,position.start);
  13461. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13462. RETURN instruction
  13463. END LabelInstruction;
  13464. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13465. VAR pc: LONGINT;
  13466. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13467. BEGIN
  13468. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13469. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13470. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13471. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13472. IF instr.op1.type.form = IntermediateCode.Float THEN
  13473. RETURN instr.op1.floatValue = op.floatValue
  13474. ELSE
  13475. RETURN instr.op1.intValue = op.intValue
  13476. END;
  13477. END ProvidesValue;
  13478. BEGIN
  13479. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13480. pc := 0;
  13481. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13482. INC(pc);
  13483. END;
  13484. IF pc = data.pc THEN
  13485. data.Emit(Data(Basic.invalidPosition,vop));
  13486. END;
  13487. RETURN pc
  13488. END EnterImmediate;
  13489. PROCEDURE Init;
  13490. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13491. BEGIN
  13492. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13493. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13494. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13495. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13496. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13497. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13498. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13499. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13500. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13501. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13502. IntermediateCode.InitOperand(emptyOperand);
  13503. FOR i := 0 TO NumberSystemCalls-1 DO
  13504. name := "@SystemCall";
  13505. Basic.AppendNumber(name,i);
  13506. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13507. END;
  13508. END Init;
  13509. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13510. BEGIN
  13511. RETURN (symbol # NIL) & symbol.NeedsSection();
  13512. END IsExported;
  13513. BEGIN
  13514. Init;
  13515. END FoxIntermediateBackend.
  13516. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13517. # Release.Build --path="/temp/obg/" Win32 ~
  13518. # 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 ~
  13519. FStols.CloseFiles A2Z.exe ~
  13520. System.FreeDownTo FoxIntermediateBackend ~
  13521. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13522. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13523. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13524. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13525. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13526. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13527. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13528. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13529. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13530. GenericLinker.Mod Loader.Mod BootConsole.Mod