FoxIntermediateBackend.Mod 614 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807148081480914810148111481214813148141481514816148171481814819148201482114822148231482414825148261482714828148291483014831148321483314834148351483614837148381483914840148411484214843148441484514846148471484814849148501485114852148531485414855148561485714858148591486014861148621486314864148651486614867148681486914870148711487214873148741487514876148771487814879148801488114882148831488414885148861488714888148891489014891148921489314894148951489614897148981489914900149011490214903149041490514906149071490814909149101491114912149131491414915149161491714918149191492014921149221492314924149251492614927149281492914930149311493214933149341493514936149371493814939149401494114942149431494414945149461494714948149491495014951149521495314954149551495614957149581495914960149611496214963149641496514966149671496814969149701497114972149731497414975149761497714978149791498014981149821498314984149851498614987149881498914990149911499214993149941499514996149971499814999150001500115002150031500415005150061500715008150091501015011150121501315014150151501615017150181501915020150211502215023150241502515026150271502815029150301503115032150331503415035150361503715038150391504015041150421504315044150451504615047150481504915050150511505215053150541505515056150571505815059150601506115062150631506415065150661506715068150691507015071150721507315074150751507615077150781507915080150811508215083150841508515086150871508815089150901509115092150931509415095150961509715098150991510015101151021510315104151051510615107151081510915110151111511215113151141511515116151171511815119151201512115122151231512415125151261512715128151291513015131151321513315134151351513615137151381513915140151411514215143151441514515146151471514815149151501515115152151531515415155151561515715158151591516015161151621516315164151651516615167151681516915170151711517215173151741517515176151771517815179151801518115182151831518415185151861518715188151891519015191151921519315194151951519615197151981519915200152011520215203152041520515206152071520815209152101521115212152131521415215152161521715218152191522015221152221522315224152251522615227152281522915230152311523215233152341523515236152371523815239152401524115242152431524415245152461524715248152491525015251152521525315254152551525615257152581525915260152611526215263152641526515266152671526815269152701527115272152731527415275152761527715278152791528015281152821528315284152851528615287152881528915290152911529215293152941529515296152971529815299153001530115302153031530415305153061530715308153091531015311153121531315314153151531615317153181531915320153211532215323153241532515326153271532815329153301533115332153331533415335153361533715338153391534015341153421534315344153451534615347153481534915350153511535215353153541535515356153571535815359153601536115362153631536415365153661536715368153691537015371153721537315374153751537615377153781537915380153811538215383153841538515386153871538815389153901539115392153931539415395153961539715398153991540015401154021540315404154051540615407154081540915410154111541215413154141541515416154171541815419154201542115422154231542415425154261542715428154291543015431154321543315434154351543615437154381543915440154411544215443154441544515446154471544815449154501545115452154531545415455154561545715458154591546015461154621546315464154651546615467154681546915470154711547215473154741547515476154771547815479154801548115482154831548415485154861548715488154891549015491154921549315494154951549615497154981549915500155011550215503155041550515506155071550815509155101551115512155131551415515155161551715518155191552015521155221552315524155251552615527155281552915530155311553215533155341553515536155371553815539155401554115542155431554415545155461554715548155491555015551155521555315554155551555615557155581555915560155611556215563155641556515566155671556815569155701557115572155731557415575155761557715578155791558015581155821558315584155851558615587155881558915590155911559215593155941559515596155971559815599156001560115602156031560415605156061560715608156091561015611156121561315614156151561615617156181561915620156211562215623156241562515626156271562815629156301563115632156331563415635156361563715638156391564015641156421564315644156451564615647156481564915650156511565215653156541565515656156571565815659156601566115662156631566415665156661566715668156691567015671156721567315674156751567615677156781567915680156811568215683156841568515686156871568815689156901569115692156931569415695156961569715698156991570015701157021570315704157051570615707157081570915710157111571215713157141571515716157171571815719157201572115722157231572415725157261572715728157291573015731157321573315734157351573615737157381573915740157411574215743157441574515746157471574815749157501575115752157531575415755157561575715758157591576015761157621576315764157651576615767157681576915770157711577215773157741577515776157771577815779157801578115782157831578415785157861578715788157891579015791157921579315794157951579615797157981579915800158011580215803158041580515806158071580815809158101581115812158131581415815158161581715818158191582015821
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. BasePointerTypeSize = 5;
  59. BaseArrayTypeSize = BasePointerTypeSize + 3;
  60. LengthOffset = BasePointerTypeSize + 0;
  61. DataOffset = BasePointerTypeSize + 1;
  62. DescriptorOffset = BasePointerTypeSize + 2;
  63. BaseRecordTypeSize = BasePointerTypeSize + 2;
  64. ActionOffset = BasePointerTypeSize + 0;
  65. MonitorOffset = BasePointerTypeSize + 1;
  66. BaseObjectTypeSize = BaseRecordTypeSize;
  67. ActionTypeSize = 3;
  68. MonitorTypeSize = 7;
  69. ProcessorOffset = BaseObjectTypeSize + 1;
  70. StackLimitOffset* = BaseObjectTypeSize + 3;
  71. QuantumOffset = BaseObjectTypeSize + 4;
  72. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  73. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  74. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  75. Size2Flag = 4; (* size = 2 *)
  76. Size3Flag = 5; (* size = 3 *)
  77. Size4Flag = 6; (* size = 4 *)
  78. Size5Flag = 7; (* size = 5 *)
  79. Size6Flag = 8; (* size = 6 *)
  80. Size7Flag = 9; (* size = 7 *)
  81. Size8Flag = 10; (* size = 8 *)
  82. ReflectionSupport = TRUE;
  83. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  84. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  85. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  86. *)
  87. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  88. ProtectModulesPointers = FALSE;
  89. CreateProcedureDescInfo = TRUE;
  90. WarningDynamicLoading = FALSE;
  91. SysvABI = {SyntaxTree.CCallingConvention};
  92. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.WinAPICallingConvention};
  93. TYPE
  94. Position=SyntaxTree.Position;
  95. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  96. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  97. WriteBackCall = POINTER TO RECORD
  98. call: SyntaxTree.ProcedureCallDesignator;
  99. next: WriteBackCall;
  100. END;
  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. availability: WORD; (* index *)
  108. END;
  109. Fixup= POINTER TO RECORD
  110. pc: LONGINT;
  111. nextFixup: Fixup;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  164. END Error;
  165. (** types **)
  166. PROCEDURE Type(x: SyntaxTree.Type);
  167. BEGIN
  168. WITH x:
  169. SyntaxTree.QualifiedType DO QualifiedType(x)
  170. |SyntaxTree.MathArrayType DO meta.CheckTypeDeclaration(x)
  171. |SyntaxTree.PointerType DO meta.CheckTypeDeclaration(x) (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  172. |SyntaxTree.RecordType DO RecordType(x)
  173. |SyntaxTree.CellType DO CellType(x)
  174. ELSE
  175. END;
  176. END Type;
  177. PROCEDURE QualifiedType(x: SyntaxTree.QualifiedType);
  178. VAR type: SyntaxTree.Type;
  179. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  180. type := x.resolved;
  181. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  182. meta.CheckTypeDeclaration(type);
  183. END;
  184. END QualifiedType;
  185. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  186. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  187. BEGIN
  188. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  189. WHILE (this # NIL) & (this.identifier# id) DO
  190. this := this.nextModifier;
  191. END;
  192. RETURN this # NIL
  193. END HasFlag;
  194. PROCEDURE RecordType(x: SyntaxTree.RecordType);
  195. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  196. BEGIN (* no code emission *)
  197. meta.CheckTypeDeclaration(x);
  198. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  199. IF x.pointerType.typeDeclaration # NIL THEN
  200. td := x.pointerType.typeDeclaration
  201. ELSE
  202. td := x.typeDeclaration
  203. END;
  204. Global.GetSymbolName(td,name);
  205. (* code section for object *)
  206. END;
  207. Scope(x.recordScope);
  208. END RecordType;
  209. PROCEDURE CellType(x: SyntaxTree.CellType);
  210. VAR capabilities: SET;
  211. BEGIN
  212. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  213. capabilities := {};
  214. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  215. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  216. backend.SetCapabilities(capabilities);
  217. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  218. Scope(x.cellScope);
  219. END;
  220. END CellType;
  221. (* symbols *)
  222. PROCEDURE Variable(x: SyntaxTree.Variable);
  223. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  224. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  225. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  226. BEGIN
  227. type := type.resolved;
  228. IF type IS SyntaxTree.RecordType THEN
  229. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  230. ELSIF (type IS SyntaxTree.ArrayType) THEN
  231. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  232. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  233. END;
  234. ELSIF type IS SyntaxTree.MathArrayType THEN
  235. WITH type: SyntaxTree.MathArrayType DO
  236. IF type.form = SyntaxTree.Open THEN
  237. RETURN TRUE
  238. ELSIF type.form = SyntaxTree.Static THEN
  239. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  240. END;
  241. END;
  242. END;
  243. RETURN FALSE
  244. END TypeNeedsInitialization;
  245. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  246. VAR variable: SyntaxTree.Variable;
  247. BEGIN
  248. variable := scope.firstVariable;
  249. WHILE variable # NIL DO
  250. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  251. IF variable.initializer # NIL THEN RETURN TRUE END;
  252. variable := variable.nextVariable;
  253. END;
  254. RETURN FALSE
  255. END ScopeNeedsInitialization;
  256. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  257. VAR size: LONGINT;
  258. BEGIN
  259. size := offset - lastUpdated;
  260. IF size > 0 THEN
  261. irv.Emit(Reserve(x.position,size));
  262. END;
  263. irv.Emit(Data(x.position, op));
  264. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  265. END SingleInitialize;
  266. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  267. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  268. BEGIN
  269. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  270. WITH type:
  271. SyntaxTree.RecordType DO
  272. baseType := type.baseType;
  273. IF baseType # NIL THEN
  274. baseType := baseType.resolved;
  275. IF baseType IS SyntaxTree.PointerType THEN
  276. baseType := baseType(SyntaxTree.PointerType).pointerBase
  277. END;
  278. Initialize(baseType,NIL, offset);
  279. END;
  280. variable := type.recordScope.firstVariable;
  281. WHILE variable # NIL DO
  282. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  283. variable := variable.nextVariable
  284. END;
  285. | SyntaxTree.ArrayType DO
  286. IF type.form = SyntaxTree.Static THEN
  287. baseType := type.arrayBase;
  288. IF TypeNeedsInitialization(baseType) THEN
  289. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  290. FOR i := 0 TO type.staticLength-1 DO
  291. Initialize(baseType,NIL,offset+i*size);
  292. END;
  293. END;
  294. END;
  295. | SyntaxTree.MathArrayType DO
  296. IF type.form = SyntaxTree.Open THEN
  297. dim := DynamicDim(type);
  298. baseType := SemanticChecker.ArrayBase(type,dim);
  299. imm := IntermediateCode.Immediate(addressType,dim);
  300. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  301. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  302. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  303. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  304. (* flags remain empty (=0) for open array *)
  305. ELSIF type.form = SyntaxTree.Static THEN
  306. baseType := type.arrayBase;
  307. IF TypeNeedsInitialization(baseType) THEN
  308. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  309. ASSERT(type.staticLength < 1024*1024*1024);
  310. FOR i := 0 TO type.staticLength-1 DO
  311. Initialize(baseType,NIL,offset+i*size);
  312. END;
  313. END;
  314. END;
  315. ELSE
  316. IF initializer # NIL THEN
  317. implementationVisitor.Evaluate(initializer, op);
  318. SingleInitialize(op.op, offset);
  319. END;
  320. END;
  321. END Initialize;
  322. BEGIN
  323. IF x.externalName # NIL THEN RETURN END;
  324. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  325. (* code section for variable *)
  326. Global.GetSymbolSegmentedName(x,name);
  327. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  328. irv.SetExported(IsExported(x));
  329. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  330. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  331. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  332. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  333. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  334. FOR i := 0 TO DynamicDim(x.type)-1 DO
  335. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  336. END;
  337. ELSE
  338. lastUpdated:= 0;
  339. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  340. Initialize(x.type, x.initializer, 0);
  341. END;
  342. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  343. IF size > 0 THEN
  344. irv.Emit(Reserve(x.position,size));
  345. END;
  346. IF ~x.fixed THEN
  347. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  348. ELSE
  349. align := x.alignment;
  350. END;
  351. irv.SetPositionOrAlignment(x.fixed, align);
  352. meta.CheckTypeDeclaration(x.type);
  353. END;
  354. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  355. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  356. END;
  357. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  358. END Variable;
  359. PROCEDURE Parameter(x: SyntaxTree.Parameter);
  360. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  361. size: LONGINT; lastUpdated: LONGINT;
  362. BEGIN
  363. ASSERT(currentScope IS SyntaxTree.CellScope);
  364. Global.GetSymbolSegmentedName(x,name);
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  366. irv.SetExported(IsExported(x));
  367. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  368. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  369. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  370. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  371. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  372. FOR i := 0 TO DynamicDim(x.type)-1 DO
  373. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  374. END;
  375. ELSE
  376. lastUpdated:= 0;
  377. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  378. IF size > 0 THEN
  379. irv.Emit(Reserve(x.position,size));
  380. END;
  381. IF ~x.fixed THEN
  382. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  383. ELSE
  384. align := x.alignment;
  385. END;
  386. irv.SetPositionOrAlignment(x.fixed, align);
  387. meta.CheckTypeDeclaration(x.type);
  388. END;
  389. END Parameter;
  390. PROCEDURE TypeDeclaration(x: SyntaxTree.TypeDeclaration);
  391. BEGIN
  392. Type(x.declaredType); (* => code in objects *)
  393. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  394. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  395. END;
  396. END TypeDeclaration;
  397. PROCEDURE Constant(x: SyntaxTree.Constant);
  398. BEGIN
  399. IF (SyntaxTree.Public * x.access # {}) THEN
  400. implementationVisitor.VisitConstant(x);
  401. END;
  402. END Constant;
  403. PROCEDURE Scope(x: SyntaxTree.Scope);
  404. VAR procedure: SyntaxTree.Procedure;
  405. constant: SyntaxTree.Constant;
  406. variable: SyntaxTree.Variable;
  407. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  408. cell: SyntaxTree.CellType;
  409. parameter: SyntaxTree.Parameter;
  410. property: SyntaxTree.Property;
  411. BEGIN
  412. prevScope := currentScope;
  413. currentScope := x;
  414. (* constants treated in implementation visitor *)
  415. WITH x: SyntaxTree.CellScope DO
  416. cell := x.ownerCell;
  417. parameter := cell.firstParameter;
  418. WHILE parameter # NIL DO
  419. Parameter(parameter);
  420. parameter := parameter.nextParameter;
  421. END;
  422. property := cell.firstProperty;
  423. WHILE property # NIL DO
  424. Variable(property);
  425. property := property.nextProperty;
  426. END;
  427. ELSE
  428. END;
  429. typeDeclaration := x.firstTypeDeclaration;
  430. WHILE typeDeclaration # NIL DO
  431. TypeDeclaration(typeDeclaration);
  432. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  433. END;
  434. variable := x.firstVariable;
  435. WHILE variable # NIL DO
  436. Variable(variable);
  437. variable := variable.nextVariable;
  438. END;
  439. procedure := x.firstProcedure;
  440. WHILE procedure # NIL DO
  441. Procedure(procedure);
  442. procedure := procedure.nextProcedure;
  443. END;
  444. constant := x.firstConstant;
  445. WHILE constant # NIL DO
  446. Constant(constant);
  447. constant := constant.nextConstant;
  448. END;
  449. currentScope := prevScope;
  450. END Scope;
  451. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  452. VAR parameter: SyntaxTree.Parameter;
  453. BEGIN
  454. parameter := first;
  455. WHILE parameter # NIL DO
  456. Parameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. END Parameters;
  460. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  461. VAR scope: SyntaxTree.ProcedureScope;
  462. prevScope: SyntaxTree.Scope;
  463. inline, finalizer: BOOLEAN;
  464. procedureType: SyntaxTree.ProcedureType;
  465. pc: LONGINT;
  466. memorySize: Basic.Integer; stackSize: LONGINT;
  467. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  468. null,size,src,dest,fp,res: IntermediateCode.Operand;
  469. callingConvention: LONGINT;
  470. cellType: SyntaxTree.CellType;
  471. register: WORD;
  472. registerClass: IntermediateCode.RegisterClass;
  473. type: IntermediateCode.Type;
  474. formalParameter: SyntaxTree.Parameter;
  475. recordType: SyntaxTree.RecordType;
  476. isModuleBody: BOOLEAN;
  477. parametersSize: LONGINT;
  478. position: LONGINT;
  479. variable: SyntaxTree.Variable;
  480. nonParameterRegisters: WORD;
  481. PROCEDURE Signature;
  482. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  483. BEGIN
  484. procedureType := x.type(SyntaxTree.ProcedureType);
  485. returnType := procedureType.returnType;
  486. IF returnType # NIL THEN
  487. meta.CheckTypeDeclaration(returnType)
  488. END;
  489. parameter := procedureType.firstParameter;
  490. WHILE parameter # NIL DO
  491. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  492. parameter := parameter.nextParameter;
  493. END;
  494. END Signature;
  495. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  496. VAR result: BOOLEAN;
  497. BEGIN
  498. result := FALSE;
  499. IF x = SyntaxTree.invalidExpression THEN
  500. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  501. result := TRUE;
  502. value := x.resolved(SyntaxTree.IntegerValue).value;
  503. ELSE
  504. Error(x.position,"expression is not an integer constant");
  505. END;
  506. RETURN result;
  507. END CheckIntegerValue;
  508. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  509. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  510. BEGIN
  511. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  512. WHILE (this # NIL) & (this.identifier # id) DO
  513. this := this.nextModifier;
  514. END;
  515. IF this # NIL THEN
  516. IF this.expression = NIL THEN
  517. Error(this.position,"expected expression value");
  518. ELSIF CheckIntegerValue(this.expression,value) THEN
  519. END;
  520. RETURN TRUE
  521. ELSE RETURN FALSE
  522. END;
  523. END HasValue;
  524. CONST DefaultDataMemorySize=512;
  525. BEGIN
  526. IF x.externalName # NIL THEN RETURN END;
  527. (*
  528. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  529. *)
  530. (* code section for this procedure *)
  531. position := x.position.start;
  532. scope := x.procedureScope;
  533. prevScope := currentScope;
  534. currentScope := scope;
  535. procedureType := x.type(SyntaxTree.ProcedureType);
  536. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  537. implementationVisitor.temporaries.Clear;
  538. implementationVisitor.usedRegisters := NIL;
  539. implementationVisitor.registerUsageCount.Init;
  540. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  541. IF (scope.body # NIL) & (x.isInline) THEN
  542. inline := TRUE;
  543. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  544. ir.SetExported(IsExported(x));
  545. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  546. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  547. IF backend.cellsAreObjects THEN
  548. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  549. ir.SetExported(IsExported(x));
  550. ELSE
  551. RETURN; (* cellnet cannot be compiled for final static hardware *)
  552. END;
  553. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  554. inline := FALSE;
  555. AddBodyCallStub(x);
  556. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  557. ir.SetExported(IsExported(x));
  558. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  559. inline := FALSE;
  560. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  561. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  562. AddBodyCallStub(x);
  563. AddStackAllocation(x,memorySize);
  564. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  565. ir.SetExported(IsExported(x));
  566. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  567. inline := FALSE;
  568. Parameters(procedureType.firstParameter);
  569. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  570. ir.SetExported(IsExported(x));
  571. ELSE
  572. inline := FALSE;
  573. IF x.isEntry OR x.isExit THEN
  574. IF x.isEntry THEN
  575. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  576. ELSE
  577. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  578. END;
  579. ir.SetExported(TRUE);
  580. ELSE
  581. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  582. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  583. END;
  584. END;
  585. callingConvention := procedureType.callingConvention;
  586. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  587. parametersSize := ProcedureParametersSize(backend.system,x);
  588. ELSE
  589. parametersSize := 0;
  590. END;
  591. IF scope.body # NIL THEN
  592. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  593. IF ~inline THEN
  594. IF scope.lastVariable = NIL THEN
  595. stackSize := 0
  596. ELSE
  597. stackSize := scope.lastVariable.offsetInBits;
  598. IF stackSize <0 THEN stackSize := -stackSize END;
  599. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  600. END;
  601. (*
  602. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  603. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  604. *)
  605. (*
  606. ir.Emit(Nop(position)); (* placeholder for fill *)
  607. *)
  608. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  609. backend.ResetParameterRegisters();
  610. (* assumption: registers are passed left to right and left parameters are in registers *)
  611. formalParameter := procedureType.firstParameter;
  612. WHILE (formalParameter # NIL) DO
  613. IF PassInRegister(formalParameter, callingConvention) THEN
  614. IF formalParameter.type.IsRecordType() THEN
  615. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  616. type := addressType;
  617. ELSE
  618. type := GetType(system, formalParameter.type);
  619. END;
  620. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  621. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  622. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  623. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  624. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  625. implementationVisitor.ReleaseIntermediateOperand(src);
  626. END;
  627. END;
  628. formalParameter := formalParameter.nextParameter;
  629. END;
  630. END;
  631. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  632. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  633. END;
  634. pc := ir.pc-1;
  635. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  636. backend.ResetParameterRegisters();
  637. nonParameterRegisters := 0;
  638. (* assumption: registers are passed left to right and left parameters are in registers *)
  639. formalParameter := procedureType.firstParameter;
  640. WHILE (formalParameter # NIL) DO
  641. IF PassInRegister(formalParameter, callingConvention) THEN
  642. IF formalParameter.type.IsRecordType() THEN
  643. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  644. type := addressType;
  645. ELSE
  646. type := GetType(system, formalParameter.type);
  647. END;
  648. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  649. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  650. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  651. implementationVisitor.currentScope := currentScope;
  652. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  653. formalParameter.SetOffset(variable.offsetInBits);
  654. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  655. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  656. implementationVisitor.ReleaseIntermediateOperand(src);
  657. ELSE
  658. INC(nonParameterRegisters);
  659. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  660. END;
  661. END;
  662. formalParameter := formalParameter.nextParameter;
  663. END;
  664. END;
  665. END;
  666. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  667. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  668. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  669. IF scope.lastVariable # NIL THEN
  670. stackSize := scope.lastVariable.offsetInBits;
  671. IF stackSize <0 THEN stackSize := -stackSize END;
  672. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  673. END;
  674. END;
  675. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  676. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  677. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  678. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  679. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  680. ir.EmitAt(pc,Push(size));
  681. implementationVisitor.StaticCallOperand(result,procedure);
  682. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  683. END;
  684. *)
  685. END;
  686. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  687. IF stackSize > 0 THEN
  688. IF (stackSize MOD system.addressSize = 0) THEN
  689. null := IntermediateCode.Immediate(addressType,0);
  690. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  691. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  692. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  693. ELSE
  694. null := IntermediateCode.Immediate(int8,0);
  695. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  696. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  697. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  698. END;
  699. (*! should potentially be called by backend -- enter might initialize
  700. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  701. *)
  702. END;
  703. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  704. parametersSize := ProcedureParametersSize(backend.system,x);
  705. ELSE
  706. parametersSize := 0;
  707. END;
  708. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  709. finalizer := FALSE;
  710. IF backend.cooperative & x.isFinalizer THEN
  711. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  712. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  713. GetRecordTypeName(recordType,name);
  714. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  715. END;
  716. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  717. IF backend.cooperative THEN
  718. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  719. IF implementationVisitor.profile & ~isModuleBody THEN
  720. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  721. END;
  722. ELSE
  723. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  724. END;
  725. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  726. IF finalizer THEN
  727. IF backend.hasLinkRegister THEN
  728. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  729. END;
  730. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  731. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  732. ir.Emit(Br(x.position,dest));
  733. ELSE
  734. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  735. END;
  736. ELSE
  737. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  738. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  739. END;
  740. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  741. IF backend.cooperative THEN
  742. IF HasPointers (scope) THEN
  743. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  744. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  745. ir.Emit(Result(x.position, res));
  746. ir.Emit(Push(x.position, res));
  747. implementationVisitor.ResetVariables(scope);
  748. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  749. ir.Emit(Pop(x.position, res));
  750. ir.Emit(Return(x.position, res));
  751. ELSE
  752. implementationVisitor.ResetVariables(scope);
  753. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  754. END;
  755. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  756. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  757. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  758. ir.Emit(Result(x.position, res));
  759. ir.Emit(Push(x.position, res));
  760. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  761. ir.Emit(Pop(x.position, res));
  762. ir.Emit(Return(x.position, res));
  763. ELSE
  764. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  765. END;
  766. END;
  767. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  768. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  769. ELSE
  770. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  771. ir.Emit(Nop(x.position));
  772. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  773. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  774. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  775. END;
  776. END;
  777. END
  778. END;
  779. ELSE (* force body for procedures *)
  780. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  781. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  782. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  783. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  784. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  785. END;
  786. Scope(scope);
  787. Signature;
  788. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  789. currentScope := prevScope;
  790. END Procedure;
  791. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  792. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  793. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  794. BEGIN
  795. ASSERT (bodyProcedure # NIL);
  796. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  797. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  798. procedure.SetScope(bodyProcedure.scope);
  799. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  800. procedure.SetAccess(SyntaxTree.Hidden);
  801. Global.GetSymbolSegmentedName (procedure,name);
  802. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  803. ir.SetExported(TRUE);
  804. Global.GetSymbolSegmentedName (bodyProcedure,name);
  805. IF ~meta.simple THEN
  806. implementationVisitor.currentScope := module.module.moduleScope;
  807. implementationVisitor.section := ir;
  808. implementationVisitor.PushSelfPointer();
  809. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  810. ELSIF backend.preregisterStatic THEN
  811. implementationVisitor.currentScope := module.module.moduleScope;
  812. implementationVisitor.section := ir;
  813. implementationVisitor.PushSelfPointer();
  814. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  815. ELSE
  816. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  817. ir.Emit(Call(bodyProcedure.position,op, 0));
  818. END;
  819. END AddBodyCallStub;
  820. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  821. VAR name: Basic.SegmentedName;
  822. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  823. BEGIN
  824. Global.GetSymbolSegmentedName (symbol,name);
  825. Basic.RemoveSuffix(name);
  826. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  827. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  828. ir.SetExported(TRUE);
  829. IntermediateCode.InitImmediate(op,addressType,initStack);
  830. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  831. END AddStackAllocation;
  832. (** entry function to visit a complete module *)
  833. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  834. VAR
  835. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  836. hasDynamicOperatorDeclarations: BOOLEAN;
  837. operator: SyntaxTree.Operator;
  838. import: SyntaxTree.Import;
  839. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  840. BEGIN
  841. type := type.resolved;
  842. IF type IS SyntaxTree.RecordType THEN
  843. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  844. ELSIF (type IS SyntaxTree.ArrayType) THEN
  845. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  846. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  847. END;
  848. ELSIF type IS SyntaxTree.MathArrayType THEN
  849. WITH type: SyntaxTree.MathArrayType DO
  850. IF type.form = SyntaxTree.Open THEN
  851. RETURN TRUE
  852. ELSIF type.form = SyntaxTree.Static THEN
  853. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  854. END;
  855. END;
  856. END;
  857. RETURN FALSE
  858. END TypeNeedsInitialization;
  859. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  860. VAR variable: SyntaxTree.Variable;
  861. BEGIN
  862. variable := scope.firstVariable;
  863. WHILE variable # NIL DO
  864. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  865. IF variable.initializer # NIL THEN RETURN TRUE END;
  866. variable := variable.nextVariable;
  867. END;
  868. RETURN FALSE
  869. END ScopeNeedsInitialization;
  870. BEGIN
  871. ASSERT(x # NIL); ASSERT(module # NIL);
  872. SELF.module := module;
  873. (* add import names to the generated Sections.Module *)
  874. import := x.moduleScope.firstImport;
  875. WHILE import # NIL DO
  876. import.module.GetName(idstr);
  877. module.imports.AddName(idstr);
  878. import := import.nextImport
  879. END;
  880. implementationVisitor.module := module;
  881. implementationVisitor.moduleScope := x.moduleScope;
  882. implementationVisitor.moduleSelf := moduleSelf;
  883. implementationVisitor.canBeLoaded := TRUE;
  884. meta.SetModule(module);
  885. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  886. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  887. END;
  888. IF backend.profile THEN
  889. EnsureBodyProcedure(x.moduleScope);
  890. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  891. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  892. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  893. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  894. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  895. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  896. Global.GetModuleName(module.module,idstr);
  897. implementationVisitor.ProfilerAddModule(idstr);
  898. implementationVisitor.numberProcedures := 0;
  899. END;
  900. implementationVisitor.profile := backend.profile;
  901. (* check if there is at least one dynamic operator locally defined *)
  902. hasDynamicOperatorDeclarations := FALSE;
  903. operator := x.moduleScope.firstOperator;
  904. WHILE operator # NIL DO
  905. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  906. operator := operator.nextOperator
  907. END;
  908. (* add operator initialization code section *)
  909. IF hasDynamicOperatorDeclarations THEN
  910. EnsureBodyProcedure(x.moduleScope);
  911. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  912. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  913. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  914. END;
  915. Scope(x.moduleScope);
  916. IF hasDynamicOperatorDeclarations THEN
  917. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  918. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  919. END;
  920. IF backend.profile THEN
  921. implementationVisitor.ProfilerPatchInit;
  922. END;
  923. END Module;
  924. END DeclarationVisitor;
  925. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  926. RegisterUsageCount*=OBJECT
  927. VAR used: UsedArray; count: LONGINT;
  928. PROCEDURE &Init;
  929. VAR i: LONGINT;
  930. BEGIN
  931. count := 0;
  932. IF used = NIL THEN NEW(used,64); END;
  933. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  934. END Init;
  935. PROCEDURE Grow;
  936. VAR new: UsedArray; size,i: LONGINT;
  937. BEGIN
  938. size := LEN(used)*2;
  939. NEW(new,size);
  940. FOR i := 0 TO LEN(used)-1 DO
  941. new[i].count := used[i].count;
  942. new[i].type := used[i].type;
  943. new[i].map := used[i].map
  944. END;
  945. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  946. used := new
  947. END Grow;
  948. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  949. BEGIN
  950. INC(count);
  951. IF count = LEN(used) THEN Grow END;
  952. used[count].type := type;
  953. used[count].class := class;
  954. used[count].map := count;
  955. RETURN count;
  956. END Next;
  957. PROCEDURE IncUse(register: LONGINT);
  958. BEGIN
  959. INC(used[register].count);
  960. (*
  961. IF (register = 1) & (count > 30) THEN
  962. D.TraceBack;
  963. END;
  964. *)
  965. END IncUse;
  966. PROCEDURE DecUse(register: LONGINT);
  967. BEGIN
  968. DEC(used[register].count);
  969. END DecUse;
  970. PROCEDURE Map(register: LONGINT): LONGINT;
  971. VAR map : LONGINT;
  972. BEGIN
  973. IF register > 0 THEN
  974. map := used[register].map;
  975. WHILE register # map DO register := map; map := used[register].map END;
  976. END;
  977. RETURN register
  978. END Map;
  979. PROCEDURE Use(register: LONGINT): LONGINT;
  980. BEGIN
  981. IF register< LEN(used) THEN
  982. RETURN used[register].count
  983. ELSE
  984. RETURN 0
  985. END
  986. END Use;
  987. END RegisterUsageCount;
  988. RegisterEntry = POINTER TO RECORD
  989. prev,next: RegisterEntry;
  990. register: LONGINT;
  991. registerClass: IntermediateCode.RegisterClass;
  992. type: IntermediateCode.Type;
  993. END;
  994. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  995. Variables = OBJECT (Basic.List)
  996. VAR
  997. inUse: VariableUse;
  998. registerIndex: LONGINT;
  999. nameIndex: LONGINT;
  1000. PROCEDURE & Init;
  1001. VAR i: LONGINT;
  1002. BEGIN
  1003. InitList(16);
  1004. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1005. registerIndex := 1024;
  1006. nameIndex := 0;
  1007. END Init;
  1008. PROCEDURE Clear*;
  1009. VAR i: LONGINT;
  1010. BEGIN
  1011. Clear^;
  1012. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1013. registerIndex := 1024;
  1014. nameIndex := 0;
  1015. END Clear;
  1016. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1017. VAR string: SyntaxTree.IdentifierString ;
  1018. BEGIN
  1019. COPY("@hiddenIRVar",string);
  1020. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1021. RETURN SyntaxTree.NewIdentifier(string);
  1022. END GetUID;
  1023. PROCEDURE GetUsage(VAR use: VariableUse);
  1024. BEGIN
  1025. use := inUse;
  1026. END GetUsage;
  1027. PROCEDURE SetUsage(CONST use: VariableUse);
  1028. BEGIN
  1029. inUse := use;
  1030. END SetUsage;
  1031. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1032. VAR any: ANY;
  1033. BEGIN
  1034. any := Get(i);
  1035. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1036. END GetVariable;
  1037. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1038. BEGIN
  1039. Set(pos, v);
  1040. END SetVariable;
  1041. PROCEDURE Occupy(pos: LONGINT);
  1042. BEGIN
  1043. INCL(inUse[pos DIV 32], pos MOD 32);
  1044. END Occupy;
  1045. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1046. BEGIN
  1047. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1048. END Occupied;
  1049. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1050. BEGIN
  1051. Occupy(Length());
  1052. Add(v);
  1053. END AddVariable;
  1054. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1055. BEGIN
  1056. t1 := t1.resolved;
  1057. t2 := t2.resolved;
  1058. (*RETURN t1.SameType(t2); *)
  1059. RETURN
  1060. (t1.SameType(t2))
  1061. OR
  1062. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1063. OR
  1064. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1065. OR
  1066. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1067. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1068. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1069. OR
  1070. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1071. (DynamicDim(t1) = DynamicDim(t2))
  1072. );
  1073. END CompatibleType;
  1074. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1075. VAR var : SyntaxTree.Variable; i: LONGINT;
  1076. BEGIN
  1077. pos := Length();
  1078. FOR i := 0 TO pos-1 DO
  1079. IF ~(Occupied(i)) THEN
  1080. var := GetVariable(i);
  1081. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1082. pos := i;
  1083. Occupy(i);
  1084. RETURN var;
  1085. END;
  1086. END;
  1087. END;
  1088. RETURN NIL
  1089. END GetFreeVariable;
  1090. END Variables;
  1091. SymbolMap = POINTER TO RECORD
  1092. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1093. isAddress: BOOLEAN;
  1094. END;
  1095. SymbolMapper = OBJECT
  1096. VAR
  1097. first: SymbolMap;
  1098. PROCEDURE & Init;
  1099. BEGIN
  1100. first := NIL;
  1101. END Init;
  1102. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1103. VAR new: SymbolMap;
  1104. BEGIN
  1105. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1106. new.next := first; first := new;
  1107. END Add;
  1108. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1109. VAR s: SymbolMap;
  1110. BEGIN
  1111. s := first;
  1112. WHILE (s # NIL) & (s.this # this) DO
  1113. s := s.next
  1114. END;
  1115. RETURN s
  1116. END Get;
  1117. END SymbolMapper;
  1118. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1119. VAR
  1120. system: Global.System;
  1121. section: IntermediateCode.Section;
  1122. module: Sections.Module;
  1123. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1124. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1125. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1126. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1127. checker: SemanticChecker.Checker;
  1128. backend: IntermediateBackend;
  1129. meta: MetaDataGenerator;
  1130. position: Position;
  1131. moduleSelf: SyntaxTree.Variable;
  1132. (* variables for hand over of variables / temporary state *)
  1133. currentScope: SyntaxTree.Scope;
  1134. constantDeclaration : SyntaxTree.Symbol;
  1135. result: Operand; (* result of the most recent expression / statement *)
  1136. destination: IntermediateCode.Operand;
  1137. arrayDestinationTag: IntermediateCode.Operand;
  1138. arrayDestinationDimension:LONGINT;
  1139. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1140. exitLabel: Label;
  1141. locked: BOOLEAN;
  1142. (*
  1143. usedRegisters: Registers;
  1144. *)
  1145. registerUsageCount: RegisterUsageCount;
  1146. usedRegisters: RegisterEntry;
  1147. (* useful operands and types *)
  1148. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1149. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1150. commentPrintout: Printout.Printer;
  1151. dump: Streams.Writer;
  1152. tagsAvailable : BOOLEAN;
  1153. supportedInstruction: SupportedInstructionProcedure;
  1154. supportedImmediate: SupportedImmediateProcedure;
  1155. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1156. emitLabels: BOOLEAN;
  1157. builtinsModuleName : SyntaxTree.IdentifierString;
  1158. indexCounter: LONGINT;
  1159. profile: BOOLEAN;
  1160. profileId, profileInit: IntermediateCode.Section;
  1161. profileInitPatchPosition: LONGINT;
  1162. numberProcedures: LONGINT;
  1163. procedureResultDesignator : SyntaxTree.Designator;
  1164. operatorInitializationCodeSection: IntermediateCode.Section;
  1165. fingerPrinter: FingerPrinter.FingerPrinter;
  1166. temporaries: Variables;
  1167. canBeLoaded : BOOLEAN;
  1168. currentIsInline: BOOLEAN;
  1169. currentMapper: SymbolMapper;
  1170. currentInlineExit: Label;
  1171. moduleBodySection: IntermediateCode.Section;
  1172. NeedDescriptor : BOOLEAN;
  1173. cooperativeSwitches: BOOLEAN;
  1174. lastSwitchPC: LONGINT;
  1175. isUnchecked: BOOLEAN;
  1176. (* EXPERIMENTAL *)
  1177. availableSymbols: ARRAY 1024 OF
  1178. RECORD
  1179. symbol: SyntaxTree.Symbol;
  1180. inMemory, inRegister: BOOLEAN;
  1181. register: IntermediateCode.Operand;
  1182. memory: IntermediateCode.Operand;
  1183. END;
  1184. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1185. BEGIN
  1186. SELF.system := system;
  1187. SELF.builtinsModuleName := runtime;
  1188. currentScope := NIL;
  1189. hiddenPointerType := NIL;
  1190. delegatePointerType := NIL;
  1191. awaitProcCounter := 0;
  1192. labelId := 0; constId := 0; labelId := 0;
  1193. SELF.checker := checker;
  1194. SELF.backend := backend;
  1195. position := Basic.invalidPosition;
  1196. locked := FALSE;
  1197. InitOperand(result,ModeUndefined);
  1198. addressType := IntermediateCode.GetType(system,system.addressType);
  1199. setType := IntermediateCode.GetType(system,system.setType);
  1200. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1201. lenType := IntermediateCode.GetType(system, system.lenType);
  1202. byteType := IntermediateCode.GetType(system, system.byteType);
  1203. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1204. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1205. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1206. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1207. nil := IntermediateCode.Immediate(addressType,0);
  1208. one := IntermediateCode.Immediate(addressType,1);
  1209. IntermediateCode.InitOperand(destination);
  1210. tagsAvailable := TRUE;
  1211. supportedInstruction := supportedInstructionProcedure;
  1212. supportedImmediate := supportedImmediateProcedure;
  1213. inData := FALSE;
  1214. SELF.emitLabels := emitLabels;
  1215. IntermediateCode.InitOperand(arrayDestinationTag);
  1216. bool := IntermediateCode.GetType(system,system.booleanType);
  1217. IntermediateCode.InitImmediate(false,bool,0);
  1218. IntermediateCode.InitImmediate(true,bool,1);
  1219. indexCounter := 0;
  1220. NEW(registerUsageCount);
  1221. usedRegisters := NIL;
  1222. procedureResultDesignator := NIL;
  1223. NEW(fingerPrinter);
  1224. NEW(temporaries);
  1225. currentIsInline := FALSE;
  1226. NeedDescriptor := FALSE;
  1227. isUnchecked := backend.noRuntimeChecks;
  1228. END Init;
  1229. TYPE Context = RECORD
  1230. section: IntermediateCode.Section;
  1231. registerUsageCount: RegisterUsageCount;
  1232. usedRegisters: RegisterEntry;
  1233. temporaries: Variables;
  1234. END;
  1235. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1236. VAR context: Context;
  1237. BEGIN
  1238. context.section := section;
  1239. context.registerUsageCount := registerUsageCount;
  1240. context.usedRegisters := usedRegisters;
  1241. context.temporaries := temporaries;
  1242. section := new;
  1243. NEW(registerUsageCount);
  1244. NEW(temporaries);
  1245. usedRegisters := NIL;
  1246. RETURN context;
  1247. END SwitchContext;
  1248. PROCEDURE ReturnToContext(context: Context);
  1249. BEGIN
  1250. section := context.section;
  1251. registerUsageCount := context.registerUsageCount;
  1252. usedRegisters := context.usedRegisters;
  1253. temporaries := context.temporaries;
  1254. END ReturnToContext;
  1255. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1256. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1257. BEGIN
  1258. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1259. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1260. END;
  1261. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1262. section.SetExported(IsExported(syntaxTreeSymbol));
  1263. RETURN section
  1264. END NewSection;
  1265. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1266. VAR new: LONGINT;
  1267. BEGIN
  1268. new := registerUsageCount.Next(type,class);
  1269. UseRegister(new);
  1270. RETURN new
  1271. END AcquireRegister;
  1272. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1273. VAR
  1274. fingerPrint: SyntaxTree.FingerPrint;
  1275. fingerPrintString: ARRAY 32 OF CHAR;
  1276. BEGIN
  1277. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1278. string := "[";
  1279. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1280. Strings.Append(string, fingerPrintString);
  1281. Strings.Append(string, "]");
  1282. END GetFingerprintString;
  1283. (** get the name for the code section that represens a certain symbol
  1284. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1285. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1286. VAR string: ARRAY 32 OF CHAR;
  1287. BEGIN
  1288. Global.GetSymbolSegmentedName(symbol, name);
  1289. (* if the symbol is an operator, then append the fingerprint to the name *)
  1290. IF symbol IS SyntaxTree.Operator THEN
  1291. GetFingerprintString(symbol, string);
  1292. Basic.AppendToSegmentedName(name,string);
  1293. END
  1294. END GetCodeSectionNameForSymbol;
  1295. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1296. BEGIN
  1297. IF dump # NIL THEN
  1298. dump.String("enter "); dump.String(s); dump.Ln;
  1299. END;
  1300. END TraceEnter;
  1301. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1302. BEGIN
  1303. IF dump # NIL THEN
  1304. dump.String("exit "); dump.String(s); dump.Ln;
  1305. END;
  1306. END TraceExit;
  1307. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1308. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1309. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1310. VAR i: LONGINT;
  1311. BEGIN
  1312. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1313. IF op.rule # NIL THEN
  1314. FOR i := 0 TO LEN(op.rule)-1 DO
  1315. CheckRegister(op.rule[i])
  1316. END;
  1317. END;
  1318. END CheckRegister;
  1319. BEGIN
  1320. CheckRegister(instruction.op1);
  1321. CheckRegister(instruction.op2);
  1322. CheckRegister(instruction.op3);
  1323. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1324. ELSE section.Emit(instruction);
  1325. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1326. END;
  1327. END Emit;
  1328. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1329. VAR saved: RegisterEntry;
  1330. BEGIN
  1331. IF backend.cooperative THEN
  1332. ReleaseUsedRegisters(saved);
  1333. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1334. CallThis(position,"Runtime","Trap",1);
  1335. RestoreRegisterUse(saved);
  1336. ELSE
  1337. Emit(Trap(position,trapNo));
  1338. END;
  1339. END EmitTrap;
  1340. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1341. VAR name: Basic.SegmentedName;
  1342. VAR op1, op2, reg: IntermediateCode.Operand;
  1343. VAR call, nocall: Label;
  1344. VAR parametersSize: LONGINT;
  1345. VAR prevSection: IntermediateCode.Section;
  1346. VAR prevDump: Streams.Writer;
  1347. VAR body: SyntaxTree.Body;
  1348. VAR procedureType: SyntaxTree.ProcedureType;
  1349. BEGIN
  1350. IF procedure # NIL THEN
  1351. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1352. ELSE procedureType := NIL;
  1353. END;
  1354. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1355. prevSection := SELF.section;
  1356. SELF.section := section;
  1357. prevDump := dump;
  1358. dump := section.comments;
  1359. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1360. IF backend.hasLinkRegister THEN
  1361. Emit(Push(Basic.invalidPosition, lr));
  1362. END;
  1363. Emit(Push(Basic.invalidPosition,fp));
  1364. IF procedure # NIL THEN
  1365. body := procedure.procedureScope.body;
  1366. ELSE
  1367. body := NIL;
  1368. END;
  1369. IF backend.cooperative THEN
  1370. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1371. GetCodeSectionNameForSymbol(procedure, name);
  1372. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1373. ELSE
  1374. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1375. END;
  1376. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1377. IntermediateCode.AddOffset(op1, 1);
  1378. Emit(Push(Basic.invalidPosition,op1));
  1379. Emit(Mov(Basic.invalidPosition,fp, sp));
  1380. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1381. NEW(call, section);
  1382. NEW(nocall, section);
  1383. reg := NewRegisterOperand(addressType);
  1384. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1385. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1386. BrltL(call, sp, reg);
  1387. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1388. BrgeL(nocall, sp, op2);
  1389. call.Resolve(section.pc);
  1390. Emit(Push(Basic.invalidPosition, reg));
  1391. ReleaseIntermediateOperand(reg);
  1392. parametersSize := ProcParametersSize(procedure);
  1393. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1394. Emit(Push(Basic.invalidPosition, op2));
  1395. CallThis(position, "Activities","ExpandStack",2);
  1396. Emit(Result(Basic.invalidPosition, sp));
  1397. nocall.Resolve(section.pc);
  1398. END;
  1399. ELSE
  1400. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1401. Emit(Push(Basic.invalidPosition, one)) ;
  1402. procedureType.SetParametersOffset(1);
  1403. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1404. END;
  1405. Emit(Mov(Basic.invalidPosition, fp, sp));
  1406. END;
  1407. END;
  1408. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1409. SELF.section := prevSection;
  1410. dump := prevDump;
  1411. END EmitEnter;
  1412. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1413. VAR op1,op2: IntermediateCode.Operand;
  1414. VAR instruction: IntermediateCode.Instruction;
  1415. BEGIN
  1416. IntermediateCode.InitNumber(op1,callconv);
  1417. IntermediateCode.InitNumber(op2,varSize);
  1418. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1419. RETURN instruction
  1420. END Enter;
  1421. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1422. VAR op1: IntermediateCode.Operand;
  1423. VAR instruction: IntermediateCode.Instruction;
  1424. BEGIN
  1425. IntermediateCode.InitNumber(op1,callconv);
  1426. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1427. RETURN instruction
  1428. END Leave;
  1429. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1430. VAR prevSection: IntermediateCode.Section;
  1431. VAR op2: IntermediateCode.Operand;
  1432. VAR body: SyntaxTree.Body;
  1433. BEGIN
  1434. prevSection := SELF.section;
  1435. SELF.section := section;
  1436. Emit(Leave(position, callconv));
  1437. IF procedure # NIL THEN
  1438. body := procedure.procedureScope.body;
  1439. ELSE
  1440. body := NIL;
  1441. END;
  1442. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1443. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1444. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1445. Emit(Add(position, sp, fp, op2));
  1446. ELSE
  1447. Emit(Mov(position, sp, fp));
  1448. END;
  1449. Emit(Pop(position, fp));
  1450. END;
  1451. SELF.section := prevSection;
  1452. END EmitLeave;
  1453. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1454. VAR m: SymbolMap;
  1455. BEGIN
  1456. position := x.position;
  1457. IF currentIsInline THEN
  1458. m := currentMapper.Get(x);
  1459. IF m # NIL THEN
  1460. (*
  1461. Printout.Info("mapping from", x);
  1462. Printout.Info("mapping to ", m.to);
  1463. *)
  1464. VExpression(m.to);
  1465. op := result;
  1466. IF m.tag # NIL THEN
  1467. ReleaseIntermediateOperand(result.tag);
  1468. VExpression(m.tag);
  1469. op.tag := result.op;
  1470. ReleaseIntermediateOperand(result.tag);
  1471. END;
  1472. RETURN
  1473. END;
  1474. END;
  1475. VSymbol(x);
  1476. op := result;
  1477. END Symbol;
  1478. PROCEDURE Expression(x: SyntaxTree.Expression);
  1479. BEGIN
  1480. position := x.position;
  1481. constantDeclaration := NIL;
  1482. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1483. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1484. END;
  1485. IF x.resolved # NIL THEN
  1486. VExpression(x.resolved);
  1487. ELSE
  1488. VExpression(x);
  1489. END;
  1490. (* check this, was commented out in ActiveCells3 *)
  1491. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1492. Error(x.position, "unsupported modifier");
  1493. END;
  1494. END Expression;
  1495. (*
  1496. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1497. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1498. BEGIN
  1499. temporaries.GetUsage(current);
  1500. FOR i := 0 TO LEN(current)-1 DO
  1501. set := current[i] - previous[i];
  1502. IF set # {} THEN
  1503. FOR j := 0 TO MAX(SET)-1 DO
  1504. IF j IN set THEN
  1505. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1506. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1507. Symbol(variable, op);
  1508. MakeMemory(tmp,op.op,addressType,0);
  1509. ReleaseOperand(op);
  1510. Emit(Mov(position,tmp, nil ) );
  1511. ReleaseIntermediateOperand(tmp);
  1512. END;
  1513. END;
  1514. END;
  1515. END;
  1516. END;
  1517. END ResetUsedTemporaries;
  1518. *)
  1519. PROCEDURE Statement(x: SyntaxTree.Statement);
  1520. VAR use: VariableUse;
  1521. BEGIN
  1522. temporaries.GetUsage(use);
  1523. position := x.position;
  1524. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1525. IF commentPrintout # NIL THEN
  1526. commentPrintout.Statement(x);
  1527. dump.Ln;
  1528. (*dump.Update;*)
  1529. END;
  1530. VStatement(x);
  1531. (*
  1532. CheckRegistersFree();
  1533. *)
  1534. (*ResetUsedTemporaries(use);*)
  1535. temporaries.SetUsage(use);
  1536. END Statement;
  1537. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1538. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1539. *)
  1540. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1541. BEGIN
  1542. ASSERT(op.mode # IntermediateCode.Undefined);
  1543. IF op.mode = IntermediateCode.ModeMemory THEN
  1544. ReuseCopy(res,op);
  1545. ELSE
  1546. res := op;
  1547. UseIntermediateOperand(res);
  1548. END;
  1549. IntermediateCode.AddOffset(res,offset);
  1550. IntermediateCode.MakeMemory(res,type);
  1551. END MakeMemory;
  1552. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1553. VAR mem: IntermediateCode.Operand;
  1554. BEGIN
  1555. MakeMemory(mem,res,type,offset);
  1556. ReleaseIntermediateOperand(res);
  1557. res := mem;
  1558. END ToMemory;
  1559. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1560. VAR mem: IntermediateCode.Operand;
  1561. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1562. componentType: SyntaxTree.Type;
  1563. BEGIN
  1564. type := type.resolved;
  1565. IF operand.mode = ModeReference THEN
  1566. IF type IS SyntaxTree.RangeType THEN
  1567. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1568. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1569. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1570. ReleaseOperand(operand);
  1571. operand.op := firstOp;
  1572. operand.tag := lastOp;
  1573. operand.extra := stepOp;
  1574. ELSIF type IS SyntaxTree.ComplexType THEN
  1575. componentType := type(SyntaxTree.ComplexType).componentType;
  1576. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1577. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1578. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1579. ReleaseOperand(operand);
  1580. operand.op := firstOp;
  1581. operand.tag := lastOp
  1582. ELSE
  1583. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1584. ReleaseIntermediateOperand(operand.op);
  1585. (* EXPERIMENTAL *)
  1586. IF operand.availability >= 0 THEN
  1587. IF availableSymbols[operand.availability].inRegister THEN
  1588. operand.op := availableSymbols[operand.availability].register;
  1589. UseIntermediateOperand(operand.op);
  1590. ELSE
  1591. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1592. availableSymbols[operand.availability].memory := mem;
  1593. operand.op := availableSymbols[operand.availability].register;
  1594. Emit(Mov(position, operand.op, mem));
  1595. availableSymbols[operand.availability].inRegister := TRUE;
  1596. END;
  1597. ReleaseIntermediateOperand(mem);
  1598. ELSE
  1599. operand.op := mem;
  1600. END;
  1601. END;
  1602. operand.mode := ModeValue;
  1603. END;
  1604. ASSERT(operand.mode = ModeValue);
  1605. END LoadValue;
  1606. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1607. BEGIN
  1608. InitOperand(result, ModeUndefined);
  1609. Expression(x);
  1610. op := result;
  1611. LoadValue(op,x.type.resolved);
  1612. END Evaluate;
  1613. PROCEDURE EvaluateX(CONST x: SyntaxTree.Expression; VAR result: Operand);
  1614. VAR operand: Operand; type: SyntaxTree.Type; symbol: SyntaxTree.Symbol;
  1615. BEGIN
  1616. Evaluate(x, result); RETURN;
  1617. IF (x.resolved # NIL) & (x.resolved # x) THEN EvaluateX(x.resolved, result); RETURN END;
  1618. WITH x:
  1619. SyntaxTree.UnaryExpression DO
  1620. EvaluateUnaryExpression(x, result);
  1621. RETURN;
  1622. |SyntaxTree.BinaryExpression DO
  1623. EvaluateBinaryExpression(x, result);
  1624. RETURN;
  1625. |SyntaxTree.Set DO
  1626. EvaluateSet(x, result);
  1627. RETURN;
  1628. |SyntaxTree.RangeExpression DO
  1629. InitOperand(result, ModeValue);
  1630. ASSERT(x.first # NIL);
  1631. EvaluateX(x.first, operand);
  1632. result.op := operand.op;
  1633. UseIntermediateOperand(result.op);
  1634. ReleaseOperand(operand);
  1635. ASSERT(x.last # NIL);
  1636. EvaluateX(x.last, operand);
  1637. result.tag := operand.op;
  1638. UseIntermediateOperand(result.tag);
  1639. ReleaseOperand(operand);
  1640. IF x.step # NIL THEN
  1641. EvaluateX(x.step, operand);
  1642. result.extra := operand.op;
  1643. UseIntermediateOperand(result.extra);
  1644. ReleaseOperand(operand);
  1645. END;
  1646. |SyntaxTree.SymbolDesignator DO
  1647. symbol := x.symbol;
  1648. WITH symbol: SyntaxTree.Constant DO
  1649. EvaluateX(symbol.value, result);
  1650. RETURN
  1651. ELSE (* designate and load --> below *)
  1652. END;
  1653. |SyntaxTree.BuiltinCallDesignator DO
  1654. EvaluateBuiltinCallDesignator(x,result);
  1655. (*
  1656. |SyntaxTree.Conversion DO
  1657. |SyntaxTree.ProcedureCallDesignator
  1658. |SyntaxTree.TypeGuardDesignator
  1659. |SyntaxTree.DereferenceDesignator
  1660. |SyntaxTree.SupercallDesignator
  1661. |SyntaxTree.SelfDesignator
  1662. *)
  1663. |SyntaxTree.BooleanValue DO
  1664. InitOperand(result,ModeValue);
  1665. IF x.value THEN result.op := true ELSE result.op := false END;
  1666. RETURN;
  1667. |SyntaxTree.IntegerValue DO
  1668. InitOperand(result,ModeValue);
  1669. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1670. IF ~supportedImmediate(result.op) &~inData THEN
  1671. GetImmediateMem(result.op)
  1672. END;
  1673. RETURN;
  1674. |SyntaxTree.CharacterValue DO
  1675. InitOperand(result,ModeValue);
  1676. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  1677. RETURN;
  1678. |SyntaxTree.RealValue DO
  1679. InitOperand(result,ModeValue);
  1680. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1681. RETURN;
  1682. |SyntaxTree.ComplexValue DO
  1683. ASSERT(x.type IS SyntaxTree.ComplexType);
  1684. type := x.type(SyntaxTree.ComplexType).componentType;
  1685. InitOperand(result,ModeValue);
  1686. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,type),x.realValue); (* real part *)
  1687. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,type),x.imagValue); (* imaginary part *)
  1688. RETURN;
  1689. |SyntaxTree.NilValue DO
  1690. InitOperand(result,ModeValue);
  1691. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1692. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1693. RETURN;
  1694. |SyntaxTree.EnumerationValue DO
  1695. InitOperand(result,ModeValue);
  1696. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  1697. RETURN;
  1698. ELSE (* other designators *)
  1699. END;
  1700. Designate(x, result);
  1701. LoadValue(result, x.type);
  1702. END EvaluateX;
  1703. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1704. BEGIN
  1705. InitOperand(result,ModeUndefined);
  1706. Expression(x);
  1707. (* ASSERT(x.mode = ModeReference *)
  1708. op := result;
  1709. END Designate;
  1710. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1711. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1712. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1713. leftExpression, rightExpression: SyntaxTree.Expression;
  1714. BEGIN
  1715. ASSERT(label # NIL);
  1716. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1717. WITH x:
  1718. SyntaxTree.UnaryExpression DO
  1719. CASE x.operator OF
  1720. Scanner.Not:
  1721. Condition(x.left,label,~reason);
  1722. RETURN;
  1723. ELSE
  1724. END;
  1725. | SyntaxTree.BinaryExpression DO
  1726. leftType := x.left.type.resolved;
  1727. rightType := x.right.type.resolved;
  1728. CASE x.operator OF
  1729. Scanner.Or:
  1730. (* shortcut evaluation of left OR right *)
  1731. IF reason THEN (*left or right*)
  1732. Condition(x.left,label,TRUE);
  1733. Condition(x.right,label,TRUE);
  1734. ELSE (* ~ (left or right) = ~left & ~right *)
  1735. skip := NewLabel();
  1736. Condition(x.left,skip,TRUE);
  1737. Condition(x.right,label,FALSE);
  1738. SetLabel(skip);
  1739. END;
  1740. RETURN;
  1741. |Scanner.And:
  1742. (* shortcut evaluation of left & right *)
  1743. IF reason THEN (* left and right *)
  1744. skip := NewLabel();
  1745. Condition(x.left,skip,FALSE);
  1746. Condition(x.right,label,TRUE);
  1747. SetLabel(skip);
  1748. ELSE (* ~(left and right) = ~left or ~right *)
  1749. Condition(x.left,label,FALSE);
  1750. Condition(x.right,label,FALSE);
  1751. END;
  1752. RETURN;
  1753. |Scanner.Is:
  1754. (* get type desc tag *)
  1755. IF IsPointerToRecord(x.left.type,recordType) THEN
  1756. EvaluateX(x.left, left);
  1757. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1758. ELSE
  1759. Designate(x.left,left);
  1760. END;
  1761. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1762. ReleaseOperand(left);
  1763. RETURN;
  1764. |Scanner.Equal:
  1765. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1766. IF reason THEN
  1767. CompareString(BreqL,label,x.left,x.right);
  1768. ELSE
  1769. CompareString(BrneL,label,x.left,x.right);
  1770. END;
  1771. ELSE
  1772. Evaluate(x.left,left);
  1773. Evaluate(x.right,right);
  1774. IF leftType IS SyntaxTree.RangeType THEN
  1775. ASSERT(rightType IS SyntaxTree.RangeType);
  1776. IF reason THEN
  1777. skip := NewLabel();
  1778. BrneL(skip, left.op, right.op); (* first *)
  1779. BrneL(skip, left.tag, right.tag); (* last *)
  1780. BreqL(label, left.extra, right.extra); (* step *)
  1781. SetLabel(skip);
  1782. ELSE
  1783. BrneL(label, left.op, right.op); (* first *)
  1784. BrneL(label, left.tag, right.tag); (* last *)
  1785. BrneL(label, left.extra, right.extra); (* step *)
  1786. END;
  1787. ReleaseOperand(left); ReleaseOperand(right);
  1788. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1789. IF reason THEN
  1790. skip := NewLabel();
  1791. BrneL(skip, left.op, right.op); (* first *)
  1792. BreqL(label, left.tag, right.tag); (* last *)
  1793. SetLabel(skip);
  1794. ELSE
  1795. BrneL(label, left.op, right.op); (* first *)
  1796. BrneL(label, left.tag, right.tag); (* last *)
  1797. END;
  1798. ReleaseOperand(left); ReleaseOperand(right);
  1799. ELSE
  1800. IF reason THEN
  1801. BreqL(label,left.op,right.op);
  1802. ELSE
  1803. BrneL(label,left.op,right.op);
  1804. END;
  1805. ReleaseOperand(left); ReleaseOperand(right);
  1806. END;
  1807. END;
  1808. RETURN;
  1809. |Scanner.LessEqual:
  1810. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1811. IF reason THEN
  1812. CompareString(BrgeL,label,x.right,x.left);
  1813. ELSE
  1814. CompareString(BrltL,label,x.right,x.left);
  1815. END;
  1816. ELSE
  1817. Evaluate(x.left,left);
  1818. Evaluate(x.right,right);
  1819. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1820. Reuse1(temp,right.op);
  1821. Emit(And(position,temp,left.op,right.op));
  1822. ReleaseOperand(right);
  1823. IF reason THEN
  1824. BreqL(label,temp,left.op);
  1825. ELSE
  1826. BrneL(label,temp,left.op);
  1827. END;
  1828. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1829. ELSE
  1830. IF reason THEN
  1831. BrgeL(label,right.op,left.op);
  1832. ELSE
  1833. BrltL(label,right.op,left.op);
  1834. END;
  1835. ReleaseOperand(left); ReleaseOperand(right);
  1836. END;
  1837. END;
  1838. RETURN;
  1839. |Scanner.Less:
  1840. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1841. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1842. leftExpression.SetType(system.booleanType);
  1843. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1844. rightExpression.SetType(system.booleanType);
  1845. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1846. leftExpression.SetType(system.booleanType);
  1847. Condition(leftExpression,label,reason);
  1848. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1849. IF reason THEN
  1850. CompareString(BrltL,label,x.left,x.right);
  1851. ELSE
  1852. CompareString(BrgeL,label,x.left,x.right);
  1853. END;
  1854. ELSE
  1855. Evaluate(x.left,left);
  1856. Evaluate(x.right,right);
  1857. IF reason THEN
  1858. BrltL(label,left.op,right.op);
  1859. ELSE
  1860. BrgeL(label,left.op,right.op);
  1861. END;
  1862. ReleaseOperand(left); ReleaseOperand(right);
  1863. END;
  1864. RETURN;
  1865. |Scanner.Greater:
  1866. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1867. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1868. leftExpression.SetType(system.booleanType);
  1869. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1870. rightExpression.SetType(system.booleanType);
  1871. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1872. leftExpression.SetType(system.booleanType);
  1873. Condition(leftExpression,label,reason);
  1874. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1875. IF reason THEN
  1876. CompareString(BrltL,label,x.right,x.left);
  1877. ELSE
  1878. CompareString(BrgeL,label,x.right,x.left);
  1879. END;
  1880. ELSE
  1881. Evaluate(x.left,left);
  1882. Evaluate(x.right,right);
  1883. IF reason THEN
  1884. BrltL(label, right.op,left.op);
  1885. ELSE
  1886. BrgeL(label, right.op,left.op);
  1887. END;
  1888. ReleaseOperand(left); ReleaseOperand(right);
  1889. END;
  1890. RETURN;
  1891. |Scanner.GreaterEqual:
  1892. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1893. IF reason THEN
  1894. CompareString(BrgeL,label,x.left,x.right);
  1895. ELSE
  1896. CompareString(BrltL,label,x.left,x.right);
  1897. END;
  1898. ELSE
  1899. Evaluate(x.left,left);
  1900. Evaluate(x.right,right);
  1901. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1902. Reuse1(temp,left.op);
  1903. Emit(And(position,temp,left.op,right.op));
  1904. ReleaseOperand(left);
  1905. IF reason THEN
  1906. BreqL(label, temp, right.op);
  1907. ELSE
  1908. BrneL(label, temp, right.op);
  1909. END;
  1910. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1911. ELSE
  1912. IF reason THEN
  1913. BrgeL(label,left.op,right.op);
  1914. ELSE
  1915. BrltL(label, left.op,right.op);
  1916. END;
  1917. ReleaseOperand(left); ReleaseOperand(right);
  1918. END;
  1919. END;
  1920. RETURN;
  1921. |Scanner.Unequal:
  1922. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1923. IF reason THEN
  1924. CompareString(BrneL,label,x.left,x.right);
  1925. ELSE
  1926. CompareString(BreqL,label,x.left,x.right);
  1927. END
  1928. ELSE
  1929. Evaluate(x.left,left);
  1930. Evaluate(x.right,right);
  1931. IF leftType IS SyntaxTree.RangeType THEN
  1932. ASSERT(rightType IS SyntaxTree.RangeType);
  1933. IF ~reason THEN
  1934. skip := NewLabel();
  1935. BrneL(skip, left.op, right.op); (* first *)
  1936. BrneL(skip, left.tag, right.tag); (* last *)
  1937. BreqL(label, left.extra, right.extra); (* step *)
  1938. SetLabel(skip);
  1939. ELSE
  1940. BrneL(label, left.op, right.op); (* first *)
  1941. BrneL(label, left.tag, right.tag); (* last *)
  1942. BrneL(label, left.extra, right.extra); (* step *)
  1943. END;
  1944. ReleaseOperand(left); ReleaseOperand(right);
  1945. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1946. IF reason THEN
  1947. BrneL(label, left.op, right.op);
  1948. BrneL(label, left.tag, right.tag);
  1949. ELSE
  1950. skip := NewLabel();
  1951. BrneL(skip, left.op, right.op);
  1952. BreqL(label, left.tag, right.tag);
  1953. SetLabel(skip);
  1954. END;
  1955. ReleaseOperand(left); ReleaseOperand(right);
  1956. ELSE
  1957. IF reason THEN
  1958. BrneL(label,left.op,right.op);
  1959. ELSE
  1960. BreqL(label,left.op,right.op);
  1961. END;
  1962. ReleaseOperand(left); ReleaseOperand(right);
  1963. END;
  1964. END;
  1965. RETURN;
  1966. ELSE (* case *)
  1967. END;
  1968. |SyntaxTree.BooleanValue DO
  1969. IF reason = x.value THEN BrL(label) END;
  1970. RETURN;
  1971. ELSE (* with *)
  1972. END;
  1973. (* default case: evaluate and compare result *)
  1974. EvaluateX(x,left);
  1975. IF reason THEN
  1976. BrneL(label,left.op, false);
  1977. ELSE
  1978. BreqL(label,left.op, false);
  1979. END;
  1980. ReleaseOperand(left);
  1981. END Condition;
  1982. PROCEDURE EvaluateUnaryExpression(x: SyntaxTree.UnaryExpression; VAR result: Operand);
  1983. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1984. BEGIN
  1985. IF Trace THEN TraceEnter("EvaluateUnaryExpression") END;
  1986. dest := destination; destination := emptyOperand;
  1987. CASE x.operator OF
  1988. Scanner.Not:
  1989. EvaluateX(x.left, operand);
  1990. InitOperand(result,ModeValue);
  1991. Reuse1a(result.op,operand.op,dest);
  1992. Emit(Xor(position,result.op,operand.op,true));
  1993. ReleaseOperand(operand);
  1994. |Scanner.Minus:
  1995. EvaluateX(x.left, operand);
  1996. InitOperand(result,ModeValue);
  1997. Reuse1a(result.op,operand.op,dest);
  1998. type := x.left.type.resolved;
  1999. IF type IS SyntaxTree.SetType THEN
  2000. Emit(Not(position,result.op,operand.op));
  2001. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2002. Reuse1(result.tag,operand.tag);
  2003. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2004. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2005. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2006. Emit(Neg(position,result.op,operand.op));
  2007. ELSE HALT(200)
  2008. END;
  2009. ReleaseOperand(operand);
  2010. |Scanner.Address:
  2011. Designate(x.left,result);
  2012. result.mode := ModeValue;
  2013. t0 := x.left.type.resolved;
  2014. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2015. ReleaseIntermediateOperand(result.op);
  2016. result.op := result.tag;
  2017. IntermediateCode.InitOperand(result.tag);
  2018. END;
  2019. Convert(result.op,IntermediateCode.GetType(system,x.type));
  2020. END;
  2021. destination := dest;
  2022. IF Trace THEN TraceExit("UnaryExpression") END;
  2023. END EvaluateUnaryExpression;
  2024. PROCEDURE EvaluateBinaryExpression(x: SyntaxTree.BinaryExpression; VAR result: Operand);
  2025. VAR left,right: Operand;zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2026. leftType,rightType: SyntaxTree.Type;
  2027. leftExpression,rightExpression : SyntaxTree.Expression;
  2028. componentType: IntermediateCode.Type;
  2029. exit: Label; dest: IntermediateCode.Operand;
  2030. size: LONGINT;
  2031. BEGIN
  2032. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2033. dest := destination; destination := emptyOperand;
  2034. leftType := x.left.type.resolved;
  2035. rightType := x.right.type.resolved;
  2036. CASE x.operator OF
  2037. Scanner.Or, Scanner.And, Scanner.Is:
  2038. result := ConditionValue(x);
  2039. |Scanner.Plus:
  2040. EvaluateX(x.left,left);
  2041. EvaluateX(x.right,right);
  2042. IF leftType IS SyntaxTree.SetType THEN
  2043. InitOperand(result,ModeValue);
  2044. Reuse2a(result.op,left.op,right.op,dest);
  2045. Emit(Or(position,result.op,left.op,right.op));
  2046. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2047. InitOperand(result,ModeValue);
  2048. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2049. Reuse2(result.tag,left.tag,right.tag);
  2050. Emit(Add(position,result.op,left.op,right.op));
  2051. Emit(Add(position,result.tag,left.tag,right.tag))
  2052. ELSE
  2053. InitOperand(result,ModeValue);
  2054. Reuse2a(result.op,left.op,right.op,dest);
  2055. Emit(Add(position,result.op,left.op,right.op));
  2056. END;
  2057. ReleaseOperand(left); ReleaseOperand(right);
  2058. |Scanner.Minus:
  2059. EvaluateX(x.left,left);
  2060. EvaluateX(x.right,right);
  2061. IF leftType IS SyntaxTree.SetType THEN
  2062. InitOperand(result,ModeValue);
  2063. Reuse1(result.op,right.op);
  2064. Emit(Not(position,result.op,right.op));
  2065. ReleaseOperand(right);
  2066. Emit(And(position,result.op,result.op,left.op));
  2067. ReleaseOperand(left);
  2068. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2069. InitOperand(result,ModeValue);
  2070. Reuse2a(result.op,left.op,right.op,dest);
  2071. Reuse2(result.tag,left.tag,right.tag);
  2072. Emit(Sub(position,result.op,left.op,right.op));
  2073. Emit(Sub(position,result.tag,left.tag,right.tag));
  2074. ReleaseOperand(left); ReleaseOperand(right)
  2075. ELSE
  2076. InitOperand(result,ModeValue);
  2077. Reuse2a(result.op,left.op,right.op,dest);
  2078. Emit(Sub(position,result.op,left.op,right.op));
  2079. ReleaseOperand(left); ReleaseOperand(right);
  2080. END;
  2081. |Scanner.Times:
  2082. EvaluateX(x.left, left);
  2083. EvaluateX(x.right, right);
  2084. IF leftType IS SyntaxTree.SetType THEN
  2085. InitOperand(result,ModeValue);
  2086. Reuse2a(result.op,left.op,right.op,dest);
  2087. Emit(And(position,result.op,left.op,right.op));
  2088. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2089. InitOperand(result, ModeValue);
  2090. componentType := left.op.type;
  2091. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2092. Emit(Mul(position,result.op, left.op, right.op));
  2093. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2094. Emit(Mul(position,tempReg, left.tag, right.tag));
  2095. Emit(Sub(position,result.op, result.op, tempReg));
  2096. Reuse2(result.tag, left.tag, right.op);
  2097. Emit(Mul(position,result.tag, left.tag, right.op));
  2098. Emit(Mul(position,tempReg, left.op, right.tag));
  2099. Emit(Add(position,result.tag, result.tag, tempReg));
  2100. ReleaseIntermediateOperand(tempReg)
  2101. ELSE
  2102. InitOperand(result,ModeValue);
  2103. Reuse2a(result.op,left.op,right.op,dest);
  2104. Emit(Mul(position,result.op,left.op,right.op));
  2105. END;
  2106. ReleaseOperand(left); ReleaseOperand(right);
  2107. |Scanner.Div:
  2108. EvaluateX(x.left, left);
  2109. EvaluateX(x.right, right);
  2110. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2111. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2112. IF ~isUnchecked THEN
  2113. exit := NewLabel();
  2114. BrltL(exit,zero,right.op);
  2115. EmitTrap(position,NegativeDivisorTrap);
  2116. SetLabel(exit);
  2117. END;
  2118. END;
  2119. InitOperand(result,ModeValue);
  2120. Reuse2a(result.op,left.op,right.op,dest);
  2121. Emit(Div(position,result.op,left.op,right.op));
  2122. ReleaseOperand(left); ReleaseOperand(right);
  2123. |Scanner.Mod:
  2124. EvaluateX(x.left, left);
  2125. EvaluateX(x.right, right);
  2126. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2127. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2128. IF ~isUnchecked THEN
  2129. exit := NewLabel();
  2130. BrltL(exit,zero,right.op);
  2131. EmitTrap(position,NegativeDivisorTrap);
  2132. SetLabel(exit);
  2133. END;
  2134. END;
  2135. InitOperand(result,ModeValue);
  2136. Reuse2a(result.op,left.op,right.op,dest);
  2137. Emit(Mod(position,result.op,left.op,right.op));
  2138. ReleaseOperand(left); ReleaseOperand(right);
  2139. |Scanner.Slash:
  2140. EvaluateX(x.left, left);
  2141. EvaluateX(x.right, right);
  2142. IF leftType IS SyntaxTree.SetType THEN
  2143. InitOperand(result,ModeValue);
  2144. Reuse2a(result.op,left.op,right.op,dest);
  2145. Emit(Xor(position,result.op,left.op,right.op));
  2146. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2147. InitOperand(result,ModeValue);
  2148. componentType := left.op.type;
  2149. (*
  2150. divisor = right.op * right.op + right.tag * right.tag
  2151. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2152. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2153. *)
  2154. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2155. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2156. Emit(Mul(position,tempReg, right.op, right.op));
  2157. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2158. Emit(Add(position,tempReg, tempReg, tempReg2));
  2159. result.op := tempReg2;
  2160. Emit(Mul(position,result.op, left.op, right.op));
  2161. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2162. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2163. Emit(Add(position,result.op, result.op, tempReg2));
  2164. Emit(Div(position,result.op, result.op, tempReg));
  2165. Reuse2(result.tag, left.tag, right.op);
  2166. Emit(Mul(position,result.tag, left.tag, right.op));
  2167. Emit(Mul(position,tempReg2, left.op, right.tag));
  2168. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2169. Emit(Div(position,result.tag, result.tag, tempReg));
  2170. ReleaseIntermediateOperand(tempReg);
  2171. ReleaseIntermediateOperand(tempReg2)
  2172. ELSE
  2173. InitOperand(result,ModeValue);
  2174. Reuse2a(result.op,left.op,right.op,dest);
  2175. Emit(Div(position,result.op,left.op,right.op));
  2176. END;
  2177. ReleaseOperand(left); ReleaseOperand(right);
  2178. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  2179. result := ConditionValue(x);
  2180. |Scanner.In:
  2181. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  2182. EvaluateX(x.left, left);
  2183. EvaluateX(x.right, right);
  2184. Convert(left.op,setType);
  2185. Convert(right.op,setType);
  2186. result.mode := ModeValue;
  2187. result.tag := nil; (* may be left over from calls to evaluate *)
  2188. ReuseCopy(result.op,right.op);
  2189. Emit(Shr(position,result.op,result.op,left.op));
  2190. ReleaseOperand(right); ReleaseOperand(left);
  2191. IntermediateCode.InitImmediate(one,setType,1);
  2192. Emit(And(position,result.op,result.op,one));
  2193. Convert(result.op,bool);
  2194. ELSE
  2195. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  2196. IF x.operator = Scanner.Questionmarks THEN
  2197. leftExpression := x.left;
  2198. rightExpression := x.right;
  2199. ELSE
  2200. leftExpression := x.right;
  2201. rightExpression := x.left;
  2202. END;
  2203. EvaluateX(leftExpression, left);
  2204. Emit(Push(position,left.op));
  2205. ReleaseOperand(left);
  2206. Designate(rightExpression, right);
  2207. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2208. IF ~backend.cellsAreObjects THEN
  2209. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  2210. END;
  2211. Emit(Push(position,right.op));
  2212. ReleaseOperand(right);
  2213. IF backend.cellsAreObjects THEN
  2214. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  2215. ELSE
  2216. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  2217. END;
  2218. InitOperand(result, ModeValue);
  2219. result.op := NewRegisterOperand(bool);
  2220. Emit(Result(position,result.op));
  2221. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  2222. leftExpression := x.left;
  2223. rightExpression := x.right;
  2224. EvaluateX(leftExpression, left);
  2225. Emit(Push(position,left.op));
  2226. ReleaseOperand(left);
  2227. EvaluateX(rightExpression, right);
  2228. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2229. IF ~backend.cellsAreObjects THEN
  2230. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  2231. END;
  2232. Emit(Push(position,right.op));
  2233. ReleaseOperand(right);
  2234. IF backend.cellsAreObjects THEN
  2235. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  2236. ELSE
  2237. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  2238. END;
  2239. InitOperand(result, ModeValue);
  2240. result.op := NewRegisterOperand(bool);
  2241. Emit(Result(position,result.op));
  2242. ELSE
  2243. HALT(100);
  2244. END;
  2245. END;
  2246. destination := dest;
  2247. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  2248. END EvaluateBinaryExpression;
  2249. PROCEDURE EvaluateSet(x: SyntaxTree.Set; VAR result: Operand);
  2250. VAR
  2251. operand: Operand;
  2252. temp, one, noBits, dest: IntermediateCode.Operand;
  2253. expression: SyntaxTree.Expression;
  2254. i: LONGINT;
  2255. BEGIN
  2256. IF Trace THEN TraceEnter("VisitSet") END;
  2257. dest := destination;
  2258. destination := emptyOperand;
  2259. noBits := IntermediateCode.Immediate(setType, 0);
  2260. one := IntermediateCode.Immediate(setType, 1);
  2261. (* start off with the empty set *)
  2262. InitOperand(result, ModeValue);
  2263. IntermediateCode.InitRegister(result.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2264. Emit(Mov(position,result.op, noBits));
  2265. FOR i := 0 TO x.elements.Length() - 1 DO
  2266. expression := x.elements.GetExpression(i);
  2267. IF expression IS SyntaxTree.RangeExpression THEN
  2268. (* range of set elements *)
  2269. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2270. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2271. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2272. ReleaseIntermediateOperand(temp)
  2273. ELSE
  2274. (* singelton element *)
  2275. Evaluate(expression, operand);
  2276. Convert(operand.op, setType);
  2277. CheckSetElement(operand.op);
  2278. (* create subset containing single element *)
  2279. Reuse1(temp, operand.op);
  2280. Emit(Shl(position,temp, one, operand.op));
  2281. ReleaseOperand(operand);
  2282. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2283. ReleaseIntermediateOperand(temp);
  2284. END
  2285. END;
  2286. destination := dest;
  2287. IF Trace THEN TraceExit("VisitSet") END;
  2288. END EvaluateSet;
  2289. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  2290. VAR op: IntermediateCode.Operand; reg: LONGINT;
  2291. BEGIN
  2292. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  2293. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  2294. RETURN op
  2295. END NewRegisterOperand;
  2296. PROCEDURE UnuseRegister(register: LONGINT);
  2297. BEGIN
  2298. IF (register > 0) THEN
  2299. register := registerUsageCount.Map(register);
  2300. registerUsageCount.DecUse(register);
  2301. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2302. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2303. END;
  2304. IF registerUsageCount.Use(register)=0 THEN
  2305. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  2306. Warning(position, "register cannot be removed");
  2307. END;
  2308. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2309. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  2310. END;
  2311. ELSIF registerUsageCount.Use(register)<0 THEN
  2312. Warning(position, "register removed too often");
  2313. IF dump # NIL THEN
  2314. dump.String("register removed too often"); dump.Ln; dump.Update;
  2315. END;
  2316. END;
  2317. END;
  2318. END UnuseRegister;
  2319. PROCEDURE UseRegister(register: LONGINT);
  2320. BEGIN
  2321. IF (register > 0) THEN
  2322. register := registerUsageCount.Map(register);
  2323. registerUsageCount.IncUse(register);
  2324. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2325. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2326. END;
  2327. IF registerUsageCount.Use(register)=1 THEN
  2328. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  2329. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2330. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  2331. END;
  2332. END;
  2333. END;
  2334. END UseRegister;
  2335. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2336. BEGIN
  2337. UnuseRegister(op.register)
  2338. END ReleaseIntermediateOperand;
  2339. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2340. BEGIN
  2341. UseRegister(op.register)
  2342. END UseIntermediateOperand;
  2343. PROCEDURE ReleaseOperand(CONST op: Operand);
  2344. BEGIN
  2345. UnuseRegister(op.op.register);
  2346. UnuseRegister(op.tag.register);
  2347. UnuseRegister(op.extra.register);
  2348. END ReleaseOperand;
  2349. (* save registers marked in array "markedRegisters" to the stack
  2350. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  2351. *)
  2352. PROCEDURE SaveRegisters();
  2353. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  2354. BEGIN
  2355. entry := usedRegisters;
  2356. WHILE entry # NIL DO
  2357. type := registerUsageCount.used[entry.register].type;
  2358. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  2359. Emit(Push(position,op));
  2360. entry := entry.next;
  2361. END;
  2362. END SaveRegisters;
  2363. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  2364. BEGIN
  2365. saved := usedRegisters;
  2366. usedRegisters := NIL;
  2367. END ReleaseUsedRegisters;
  2368. (** remove parameter registers from used queue *)
  2369. PROCEDURE ReleaseParameterRegisters;
  2370. VAR entry,prev,next: RegisterEntry;
  2371. BEGIN
  2372. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  2373. WHILE entry # NIL DO
  2374. next := entry.next;
  2375. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  2376. registerUsageCount.DecUse(entry.register);
  2377. ASSERT(registerUsageCount.Use(entry.register)=0);
  2378. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2379. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  2380. END;
  2381. ELSIF prev = NIL THEN
  2382. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  2383. ELSE
  2384. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  2385. END;
  2386. entry := next;
  2387. END;
  2388. END ReleaseParameterRegisters;
  2389. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  2390. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  2391. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2392. BEGIN
  2393. entry := saved;
  2394. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2395. entry := prev;
  2396. WHILE entry # NIL DO
  2397. prev := entry.prev;
  2398. type := entry.type;
  2399. class := entry.registerClass;
  2400. IntermediateCode.InitRegister(op,type,class,entry.register);
  2401. Emit(Pop(position,op));
  2402. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2403. entry := prev;
  2404. END;
  2405. END RestoreRegisters;
  2406. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2407. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2408. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2409. BEGIN
  2410. entry := saved;
  2411. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2412. entry := prev;
  2413. WHILE entry # NIL DO
  2414. prev := entry.prev;
  2415. type := entry.type;
  2416. class := entry.registerClass;
  2417. IntermediateCode.InitRegister(op,type,class,entry.register);
  2418. Emit(Mov(position,op,op));
  2419. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2420. entry := prev;
  2421. END;
  2422. END RestoreRegisterUse;
  2423. PROCEDURE CheckRegistersFree;
  2424. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2425. BEGIN
  2426. IF usedRegisters # NIL THEN
  2427. r := usedRegisters;
  2428. WHILE r # NIL DO
  2429. warning := "register ";
  2430. Strings.AppendInt(warning, r.register);
  2431. Strings.Append(warning, " not released.");
  2432. Warning(position,warning);
  2433. r := r .next;
  2434. END;
  2435. END;
  2436. FOR i := 0 TO registerUsageCount.count-1 DO
  2437. IF registerUsageCount.used[i].count < 0 THEN
  2438. warning := "register ";
  2439. Strings.AppendInt(warning, i);
  2440. Strings.Append(warning, " unused too often.");
  2441. Warning(position,warning);
  2442. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2443. warning := "register ";
  2444. Strings.AppendInt(warning, i);
  2445. Strings.Append(warning, " not unused often enough.");
  2446. Warning(position,warning);
  2447. END;
  2448. END;
  2449. END CheckRegistersFree;
  2450. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2451. Otherwise allocate a new register.
  2452. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2453. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2454. BEGIN
  2455. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2456. UseIntermediateOperand(result);
  2457. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2458. UseIntermediateOperand(result);
  2459. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2460. END;
  2461. END Reuse2;
  2462. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2463. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2464. If not then allocate a new register.
  2465. Does NOT necessarily keep the content of src1 or src2 in result!
  2466. *)
  2467. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2468. BEGIN
  2469. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2470. UseIntermediateOperand(result);
  2471. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2472. UseIntermediateOperand(result);
  2473. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2474. result := alternative; alternative := emptyOperand;
  2475. UseIntermediateOperand(result);
  2476. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2477. END;
  2478. END Reuse2a;
  2479. (* like reuse2 but only one source *)
  2480. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2481. BEGIN
  2482. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2483. UseIntermediateOperand(result);
  2484. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2485. END;
  2486. END Reuse1;
  2487. (* like reuse2a but only one source *)
  2488. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2489. BEGIN
  2490. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2491. UseIntermediateOperand(result);
  2492. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2493. UseIntermediateOperand(result);
  2494. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2495. END;
  2496. END Reuse1a;
  2497. (* like reuse1 but guarantees that content of src1 is in result *)
  2498. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2499. BEGIN
  2500. IF ReusableRegister(src1) THEN
  2501. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2502. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2503. UseIntermediateOperand(result);
  2504. ELSE
  2505. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2506. Emit(Mov(position,result,src1));
  2507. END
  2508. END ReuseCopy;
  2509. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2510. BEGIN
  2511. IF ReusableRegister(src) THEN
  2512. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2513. ELSE
  2514. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2515. Emit(Mov(position,result,src));
  2516. ReleaseIntermediateOperand(src);
  2517. END
  2518. END TransferToRegister;
  2519. (** labels and branches **)
  2520. PROCEDURE NewLabel(): Label;
  2521. VAR label: Label;
  2522. BEGIN
  2523. NEW(label,section); RETURN label;
  2524. END NewLabel;
  2525. (* EXPERIMENTAL *)
  2526. PROCEDURE EndBasicBlock;
  2527. VAR i: LONGINT;
  2528. BEGIN
  2529. i := 0;
  2530. WHILE (availableSymbols[i].symbol # NIL) DO
  2531. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2532. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2533. END;
  2534. availableSymbols[i].symbol := NIL;
  2535. INC(i);
  2536. END;
  2537. END EndBasicBlock;
  2538. (* EXPERIMENTAL *)
  2539. PROCEDURE BeginBasicBlock;
  2540. BEGIN
  2541. ASSERT(availableSymbols[0].symbol = NIL);
  2542. END BeginBasicBlock;
  2543. PROCEDURE SetLabel(label: Label);
  2544. BEGIN
  2545. (* EXPERIMENTAL *)
  2546. EndBasicBlock;
  2547. BeginBasicBlock;
  2548. label.Resolve(section.pc);
  2549. END SetLabel;
  2550. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2551. BEGIN
  2552. ASSERT(label # NIL);
  2553. IF label.pc < 0 THEN (* label not yet set *)
  2554. label.AddFixup(section.pc);
  2555. END;
  2556. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2557. END LabelOperand;
  2558. PROCEDURE BrL(label: Label);
  2559. BEGIN
  2560. (* EXPERIMENTAL *)
  2561. EndBasicBlock;
  2562. Emit(Br(position,LabelOperand(label)));
  2563. END BrL;
  2564. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2565. BEGIN
  2566. Emit(Brge(position,LabelOperand(label),left,right));
  2567. END BrgeL;
  2568. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2569. BEGIN
  2570. Emit(Brlt(position,LabelOperand(label),left,right));
  2571. END BrltL;
  2572. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2573. BEGIN
  2574. Emit(Breq(position,LabelOperand(label),left,right));
  2575. END BreqL;
  2576. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2577. BEGIN
  2578. Emit(Brne(position,LabelOperand(label),left,right));
  2579. END BrneL;
  2580. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2581. VAR new: IntermediateCode.Operand;
  2582. BEGIN
  2583. IF Trace THEN TraceEnter("Convert") END;
  2584. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2585. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2586. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2587. & (operand.offset = 0)
  2588. THEN
  2589. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2590. Emit(Conv(position,new,operand));
  2591. ELSE
  2592. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2593. Emit(Conv(position,new,operand));
  2594. ReleaseIntermediateOperand(operand);
  2595. END;
  2596. operand := new;
  2597. 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
  2598. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2599. ELSE
  2600. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2601. Emit(Conv(position,new,operand));
  2602. ReleaseIntermediateOperand(operand);
  2603. operand := new;
  2604. END;
  2605. IF Trace THEN TraceExit("Convert") END;
  2606. END Convert;
  2607. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2608. VAR exit: Label;
  2609. BEGIN
  2610. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2611. exit := NewLabel();
  2612. br(exit,left,right);
  2613. EmitTrap(position,trapNo);
  2614. SetLabel(exit);
  2615. END TrapC;
  2616. (** expressions *)
  2617. (** emit necessary runtime check for set elements **)
  2618. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2619. VAR max: IntermediateCode.Operand;
  2620. BEGIN
  2621. IF isUnchecked THEN RETURN END;
  2622. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2623. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2624. TrapC(BrgeL, max, o, SetElementTrap);
  2625. END;
  2626. END CheckSetElement;
  2627. (** the set that a range represents **)
  2628. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2629. VAR
  2630. operand: Operand;
  2631. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2632. BEGIN
  2633. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2634. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2635. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2636. one := IntermediateCode.Immediate(setType, 1);
  2637. Evaluate(x, operand);
  2638. Convert(operand.op, setType);
  2639. Convert(operand.tag, setType);
  2640. CheckSetElement(operand.op);
  2641. CheckSetElement(operand.tag);
  2642. (* create mask for lower bound
  2643. i.e. shift 11111111 to the left by the value of the lower bound
  2644. *)
  2645. Reuse1(temp, operand.op);
  2646. Emit(Shl(position,temp, allBits, operand.op));
  2647. ReleaseIntermediateOperand(operand.op);
  2648. operand.op := temp;
  2649. (* create mask for upper bound
  2650. i.e. shift 11111111 to the right by the difference between the
  2651. upper bound and the maximum number of set elements
  2652. *)
  2653. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2654. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2655. Reuse1(temp, operand.tag);
  2656. ELSE
  2657. Reuse1(temp, operand.tag);
  2658. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2659. Emit(Sub(position,temp, size, operand.tag));
  2660. END;
  2661. Emit(Shr(position,temp, allBits, operand.tag));
  2662. ReleaseIntermediateOperand(operand.tag);
  2663. operand.tag := temp;
  2664. Reuse2(resultingSet, operand.op, operand.tag);
  2665. (* intersect the two masks *)
  2666. Emit(And(position,resultingSet, operand.op, operand.tag));
  2667. ReleaseOperand(operand);
  2668. RETURN resultingSet
  2669. END SetFromRange;
  2670. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2671. VAR
  2672. res, operand: Operand;
  2673. temp, one, noBits, dest: IntermediateCode.Operand;
  2674. expression: SyntaxTree.Expression;
  2675. i: LONGINT;
  2676. BEGIN
  2677. IF Trace THEN TraceEnter("VisitSet") END;
  2678. dest := destination;
  2679. destination := emptyOperand;
  2680. noBits := IntermediateCode.Immediate(setType, 0);
  2681. one := IntermediateCode.Immediate(setType, 1);
  2682. (* start off with the empty set *)
  2683. InitOperand(res, ModeValue);
  2684. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2685. Emit(Mov(position,res.op, noBits));
  2686. FOR i := 0 TO x.elements.Length() - 1 DO
  2687. expression := x.elements.GetExpression(i);
  2688. IF expression IS SyntaxTree.RangeExpression THEN
  2689. (* range of set elements *)
  2690. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2691. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2692. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2693. ReleaseIntermediateOperand(temp)
  2694. ELSE
  2695. (* singelton element *)
  2696. Evaluate(expression, operand);
  2697. Convert(operand.op, setType);
  2698. CheckSetElement(operand.op);
  2699. (* create subset containing single element *)
  2700. Reuse1(temp, operand.op);
  2701. Emit(Shl(position,temp, one, operand.op));
  2702. ReleaseOperand(operand);
  2703. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2704. ReleaseIntermediateOperand(temp);
  2705. END
  2706. END;
  2707. result := res;
  2708. destination := dest;
  2709. IF Trace THEN TraceExit("VisitSet") END;
  2710. END VisitSet;
  2711. (* math arrays of the form [a,b,c]
  2712. x is a static array and thus does not provide any pointers
  2713. *)
  2714. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2715. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2716. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2717. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2718. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2719. element: SyntaxTree.IntegerValue;
  2720. BEGIN
  2721. numberElements := x.elements.Length();
  2722. expression := index.parameters.GetExpression(dim);
  2723. element := expression(SyntaxTree.IntegerValue);
  2724. FOR i := 0 TO numberElements-1 DO
  2725. expression := x.elements.GetExpression(i);
  2726. element.SetValue(i);
  2727. IF expression IS SyntaxTree.MathArrayExpression THEN
  2728. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2729. ELSE
  2730. Assign(index,expression);
  2731. END;
  2732. END;
  2733. END RecursiveAssignment;
  2734. PROCEDURE Dimension(): LONGINT;
  2735. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2736. BEGIN
  2737. dim := 0;
  2738. expression := x;
  2739. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2740. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2741. INC(dim);
  2742. END;
  2743. RETURN dim;
  2744. END Dimension;
  2745. BEGIN
  2746. (*static math array not providing pointers anyway *)
  2747. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2748. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2749. designator.SetType(variable.type);
  2750. dim := Dimension();
  2751. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2752. FOR i := 0 TO dim-1 DO
  2753. element := SyntaxTree.NewIntegerValue(x.position,0);
  2754. element.SetType(system.longintType);
  2755. index.parameters.AddExpression(element);
  2756. END;
  2757. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2758. RecursiveAssignment(x,0);
  2759. Expression(designator);
  2760. END VisitMathArrayExpression;
  2761. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2762. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2763. BEGIN
  2764. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2765. dest := destination; destination := emptyOperand;
  2766. IF x.operator = Scanner.Not THEN
  2767. Evaluate(x.left,operand);
  2768. InitOperand(result,ModeValue);
  2769. Reuse1a(result.op,operand.op,dest);
  2770. Emit(Xor(position,result.op,operand.op,true));
  2771. ReleaseOperand(operand);
  2772. ELSIF x.operator = Scanner.Minus THEN
  2773. Evaluate(x.left,operand);
  2774. InitOperand(result,ModeValue);
  2775. Reuse1a(result.op,operand.op,dest);
  2776. type := x.left.type.resolved;
  2777. IF type IS SyntaxTree.SetType THEN
  2778. Emit(Not(position,result.op,operand.op));
  2779. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2780. Reuse1(result.tag,operand.tag);
  2781. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2782. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2783. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2784. Emit(Neg(position,result.op,operand.op));
  2785. ELSE HALT(200)
  2786. END;
  2787. ReleaseOperand(operand);
  2788. ELSIF x.operator = Scanner.Address THEN
  2789. Designate(x.left,operand);
  2790. operand.mode := ModeValue;
  2791. t0 := x.left.type.resolved;
  2792. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2793. ReleaseIntermediateOperand(operand.op);
  2794. operand.op := operand.tag;
  2795. IntermediateCode.InitOperand(operand.tag);
  2796. END;
  2797. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2798. result := operand;
  2799. ELSE HALT(100)
  2800. END;
  2801. destination := dest;
  2802. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2803. END VisitUnaryExpression;
  2804. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2805. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2806. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2807. BEGIN
  2808. type := type.resolved;
  2809. originalType := type;
  2810. IF type IS SyntaxTree.PointerType THEN
  2811. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2812. END;
  2813. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2814. BrL(label);
  2815. ELSE
  2816. ASSERT(type IS SyntaxTree.RecordType);
  2817. (*
  2818. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2819. *)
  2820. IF withPart THEN
  2821. left := tag;
  2822. ELSE
  2823. ReuseCopy(left,tag);
  2824. END;
  2825. right := TypeDescriptorAdr(type);
  2826. IF backend.cooperative THEN
  2827. repeatL := NewLabel();
  2828. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2829. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2830. END;
  2831. SetLabel(repeatL);
  2832. IF reason THEN
  2833. BreqL(label,left,right);
  2834. ELSE
  2835. skip := NewLabel();
  2836. BreqL(skip,left,right);
  2837. END;
  2838. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2839. BrneL(repeatL,left,nil);
  2840. IF ~reason THEN
  2841. BrL(label);
  2842. SetLabel(skip);
  2843. END;
  2844. ELSIF meta.simple THEN
  2845. level := type(SyntaxTree.RecordType).Level();
  2846. (* get type desc tag of level relative to base tag *)
  2847. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2848. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2849. IntermediateCode.MakeMemory(left,addressType);
  2850. IF reason THEN
  2851. BreqL(label,left,right);
  2852. ELSE
  2853. BrneL(label,left,right);
  2854. END;
  2855. ELSE
  2856. level := type(SyntaxTree.RecordType).Level();
  2857. (* get type desc tag of level relative to base tag *)
  2858. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2859. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2860. IntermediateCode.MakeMemory(left,addressType);
  2861. IF reason THEN
  2862. BreqL(label,left,right);
  2863. ELSE
  2864. BrneL(label,left,right);
  2865. END;
  2866. END;
  2867. IF ~withPart THEN
  2868. ReleaseIntermediateOperand(left);
  2869. END;
  2870. ReleaseIntermediateOperand(right);
  2871. END;
  2872. END TypeTest;
  2873. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2874. BEGIN
  2875. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2876. IF dump # NIL THEN
  2877. dump.String(s); dump.Ln;
  2878. END;
  2879. END Error;
  2880. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2881. BEGIN
  2882. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2883. IF dump # NIL THEN
  2884. dump.String(s); dump.Ln; dump.Update;
  2885. END;
  2886. END Warning;
  2887. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2888. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2889. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2890. operand:Operand;
  2891. BEGIN
  2892. previousSection := section;
  2893. Global.GetModuleName(mod,name);
  2894. Strings.Append(name,".@Trace");
  2895. Basic.ToSegmentedName(name, pooledName);
  2896. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2897. IF dump # NIL THEN dump := section.comments END;
  2898. IF backend.hasLinkRegister THEN
  2899. Emit(Push(Basic.invalidPosition, lr));
  2900. END;
  2901. variable := mod.moduleScope.firstVariable;
  2902. WHILE variable # NIL DO
  2903. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2904. Symbol(variable, operand);
  2905. register := operand.op;
  2906. CallTraceMethod(register, variable.type);
  2907. ReleaseIntermediateOperand(register);
  2908. END;
  2909. variable := variable.nextVariable;
  2910. END;
  2911. IF backend.hasLinkRegister THEN
  2912. Emit(Pop(Basic.invalidPosition, lr));
  2913. END;
  2914. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2915. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2916. Emit(Br(position,op));
  2917. INC(statCoopTraceModule, section.pc);
  2918. section := previousSection;
  2919. IF dump # NIL THEN dump := section.comments END;
  2920. END CreateTraceModuleMethod;
  2921. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2922. BEGIN
  2923. Emit (Push(position, dst));
  2924. Emit (Push(position, src));
  2925. CallThis(position,"GarbageCollector","Assign", 2);
  2926. END CallAssignPointer;
  2927. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2928. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2929. BEGIN
  2930. IF SemanticChecker.IsPointerType (type) THEN
  2931. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2932. ELSIF type.IsRecordType() THEN
  2933. Emit (Push(position,dst));
  2934. Emit (Push(position,src));
  2935. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2936. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2937. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2938. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2939. ELSIF IsStaticArray(type) THEN
  2940. size := StaticArrayNumElements(type);
  2941. base := StaticArrayBaseType(type);
  2942. IF base.IsRecordType() THEN
  2943. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2944. Emit (Push(position, dst));
  2945. Emit (Push(position, src));
  2946. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2947. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2948. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2949. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2950. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2951. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2952. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2953. Emit (Push(position, dst));
  2954. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2955. Emit (Push(position, src));
  2956. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2957. ELSE
  2958. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2959. Emit (Push(position, dst));
  2960. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2961. Emit (Push(position, src));
  2962. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2963. ASSERT(StaticArrayBaseType(type).IsPointer());
  2964. END;
  2965. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2966. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2967. Emit (Push(position, dst));
  2968. Emit (Push(position, src));
  2969. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2970. ELSE HALT(100); (* missing ? *)
  2971. END;
  2972. END CallAssignMethod;
  2973. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2974. VAR name: Basic.SegmentedName;
  2975. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2976. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2977. context: Context;
  2978. BEGIN
  2979. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2980. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2981. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2982. GetRecordTypeName (recordType,name);
  2983. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2984. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2985. section.SetExported (TRUE);
  2986. IF dump # NIL THEN dump := section.comments END;
  2987. IF backend.hasLinkRegister THEN
  2988. Emit(Push(Basic.invalidPosition, lr));
  2989. END;
  2990. variable := recordType.recordScope.firstVariable;
  2991. WHILE variable # NIL DO
  2992. IF variable.NeedsTrace() THEN
  2993. dst := NewRegisterOperand (addressType);
  2994. src := NewRegisterOperand (addressType);
  2995. Emit (Mov(position, dst, parameter1));
  2996. Emit (Mov(position, src, parameter2));
  2997. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2998. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2999. CallAssignMethod(dst, src, variable.type);
  3000. ReleaseIntermediateOperand(src);
  3001. ReleaseIntermediateOperand(dst);
  3002. END;
  3003. variable := variable.nextVariable;
  3004. END;
  3005. recordBase := recordType.GetBaseRecord();
  3006. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3007. IF backend.hasLinkRegister THEN
  3008. Emit(Pop(Basic.invalidPosition, lr));
  3009. END;
  3010. GetRecordTypeName (recordBase,name);
  3011. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3012. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3013. Emit(Br(position,op));
  3014. ELSE
  3015. Emit(Exit(position,0,0, 0));
  3016. END;
  3017. IF ~recordType.isObject THEN
  3018. GetRecordTypeName (recordType,name);
  3019. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3020. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3021. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3022. section.SetExported (TRUE);
  3023. NEW(registerUsageCount);
  3024. usedRegisters := NIL;
  3025. dst := NewRegisterOperand (addressType);
  3026. src := NewRegisterOperand (addressType);
  3027. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3028. Emit(Mov(position, dst, parameter1));
  3029. Emit(Mov(position, src, parameter2));
  3030. label := NewLabel();
  3031. SetLabel(label);
  3032. Emit(Push(position, dst));
  3033. Emit(Push(position, src));
  3034. GetRecordTypeName (recordType,name);
  3035. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3036. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3037. Emit(Call(position, op, 0));
  3038. Emit(Pop(position, src));
  3039. Emit(Pop(position, dst));
  3040. Emit(Add(position, dst, dst, ofs));
  3041. Emit(Add(position, src, src, ofs));
  3042. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3043. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3044. Emit(Exit(position,0,0, 0));
  3045. END;
  3046. INC(statCoopAssignProcedure, section.pc);
  3047. ReturnToContext(context);
  3048. IF dump # NIL THEN dump := section.comments END;
  3049. END CreateAssignProcedure;
  3050. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  3051. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  3052. BEGIN
  3053. IF IsUnsafePointer (type) THEN
  3054. skip := NewLabel();
  3055. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  3056. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  3057. BreqL (skip, op, nil);
  3058. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  3059. SetLabel (skip);
  3060. ELSIF SemanticChecker.IsPointerType (type) THEN
  3061. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  3062. CallThis(position,"GarbageCollector","Mark", 1);
  3063. ELSIF type.IsRecordType() THEN
  3064. Emit (Push(position,register));
  3065. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3066. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3067. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3068. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3069. ELSIF IsStaticArray(type) THEN
  3070. size := StaticArrayNumElements(type);
  3071. base := StaticArrayBaseType(type);
  3072. IF base.IsRecordType() THEN
  3073. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3074. Emit (Push(position, register));
  3075. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  3076. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3077. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3078. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3079. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  3080. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3081. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3082. Emit (Push(position, register));
  3083. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  3084. ELSE
  3085. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3086. Emit (Push(position, register));
  3087. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  3088. ASSERT(base.IsPointer());
  3089. END;
  3090. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3091. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  3092. CallThis(position,"GarbageCollector","Mark", 1);
  3093. ELSE HALT(100); (* missing ? *)
  3094. END;
  3095. END CallTraceMethod;
  3096. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  3097. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  3098. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3099. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  3100. BEGIN
  3101. previousSection := section;
  3102. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3103. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3104. GetRecordTypeName (recordType,name);
  3105. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3106. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3107. section.SetExported (TRUE);
  3108. IF dump # NIL THEN dump := section.comments END;
  3109. IF backend.hasLinkRegister THEN
  3110. Emit(Push(Basic.invalidPosition, lr));
  3111. END;
  3112. variable := recordType.recordScope.firstVariable;
  3113. WHILE variable # NIL DO
  3114. IF variable.NeedsTrace() THEN
  3115. register := NewRegisterOperand (addressType);
  3116. Emit (Mov(position,register,parameter1));
  3117. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  3118. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3119. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3120. END;
  3121. CallTraceMethod(register, variable.type);
  3122. ReleaseIntermediateOperand(register);
  3123. END;
  3124. variable := variable.nextVariable;
  3125. END;
  3126. recordBase := recordType.GetBaseRecord();
  3127. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  3128. recordBase := recordBase.GetBaseRecord();
  3129. END;
  3130. IF recordBase # NIL THEN
  3131. IF backend.hasLinkRegister THEN
  3132. Emit(Pop(Basic.invalidPosition, lr));
  3133. END;
  3134. GetRecordTypeName (recordBase,name);
  3135. IF HasExplicitTraceMethod (recordBase) THEN
  3136. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  3137. ELSE
  3138. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3139. END;
  3140. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3141. Emit(Br(position,op));
  3142. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  3143. Emit(Exit(position,0,0,0));
  3144. ELSE
  3145. IF backend.hasLinkRegister THEN
  3146. Emit(Pop(Basic.invalidPosition, lr));
  3147. END;
  3148. IF recordType.isObject THEN
  3149. Basic.ToSegmentedName ("BaseTypes.Object",name);
  3150. ELSE
  3151. Basic.ToSegmentedName ("BaseTypes.Record",name);
  3152. END;
  3153. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3154. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3155. Emit(Br(position,op));
  3156. END;
  3157. IF ~recordType.isObject THEN
  3158. GetRecordTypeName (recordType,name);
  3159. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  3160. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3161. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3162. section.SetExported (TRUE);
  3163. NEW(registerUsageCount);
  3164. usedRegisters := NIL;
  3165. IF dump # NIL THEN dump := section.comments END;
  3166. register := NewRegisterOperand (addressType);
  3167. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  3168. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  3169. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3170. END;
  3171. Emit (Push(position,register));
  3172. GetRecordTypeName (recordType,name);
  3173. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3174. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3175. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3176. ReleaseIntermediateOperand(register);
  3177. Emit(Exit(position,0,0,0));
  3178. GetRecordTypeName (recordType,name);
  3179. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3180. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3181. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3182. section.SetExported (TRUE);
  3183. NEW(registerUsageCount);
  3184. usedRegisters := NIL;
  3185. register := NewRegisterOperand (addressType);
  3186. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3187. Emit(Mov(position, register, parameter1));
  3188. label := NewLabel();
  3189. SetLabel(label);
  3190. Emit(Push(position, register));
  3191. GetRecordTypeName (recordType,name);
  3192. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3193. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3194. Emit(Call(position, op, 0));
  3195. Emit(Pop(position, register));
  3196. Emit(Add(position, register, register, ofs));
  3197. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3198. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3199. Emit(Exit(position,0,0,0));
  3200. END;
  3201. INC(statCoopTraceMethod, section.pc);
  3202. ReturnToContext(context);
  3203. IF dump # NIL THEN dump := section.comments END;
  3204. END CreateTraceMethod;
  3205. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  3206. VAR name: Basic.SegmentedName;
  3207. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3208. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  3209. context: Context;
  3210. BEGIN
  3211. IF recordType.isObject THEN RETURN END;
  3212. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3213. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3214. GetRecordTypeName (recordType,name);
  3215. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3216. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3217. section.SetExported (TRUE);
  3218. IF dump # NIL THEN dump := section.comments END;
  3219. IF backend.hasLinkRegister THEN
  3220. Emit(Push(Basic.invalidPosition, lr));
  3221. END;
  3222. variable := recordType.recordScope.firstVariable;
  3223. WHILE variable # NIL DO
  3224. IF variable.NeedsTrace() THEN
  3225. dst := NewRegisterOperand (addressType);
  3226. Emit (Mov(position, dst, parameter1));
  3227. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3228. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3229. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3230. END;
  3231. CallResetProcedure(dst, nil, variable.type);
  3232. ReleaseIntermediateOperand(dst);
  3233. END;
  3234. variable := variable.nextVariable;
  3235. END;
  3236. recordBase := recordType.GetBaseRecord();
  3237. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3238. IF backend.hasLinkRegister THEN
  3239. Emit(Pop(Basic.invalidPosition, lr));
  3240. END;
  3241. GetRecordTypeName (recordBase,name);
  3242. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3243. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3244. Emit(Br(position,op));
  3245. ELSE
  3246. Emit(Exit(position,0,0, 0));
  3247. END;
  3248. GetRecordTypeName (recordType,name);
  3249. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3250. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3251. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3252. section.SetExported (TRUE);
  3253. NEW(registerUsageCount);
  3254. usedRegisters := NIL;
  3255. dst := NewRegisterOperand (addressType);
  3256. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3257. Emit(Mov(position, dst, parameter1));
  3258. label := NewLabel();
  3259. SetLabel(label);
  3260. Emit(Push(position, dst));
  3261. GetRecordTypeName (recordType,name);
  3262. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3263. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3264. Emit(Call(position, op, 0));
  3265. Emit(Pop(position, dst));
  3266. Emit(Add(position, dst, dst, ofs));
  3267. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3268. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3269. Emit(Exit(position,0,0, 0));
  3270. INC(statCoopResetProcedure, section.pc);
  3271. ReturnToContext(context);
  3272. IF dump # NIL THEN dump := section.comments END;
  3273. END CreateResetProcedure;
  3274. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  3275. VAR name: Basic.SegmentedName; context: Context;
  3276. BEGIN
  3277. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  3278. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3279. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3280. IF dump # NIL THEN dump := section.comments END;
  3281. IF backend.hasLinkRegister THEN
  3282. Emit(Push(Basic.invalidPosition, lr));
  3283. END;
  3284. Emit(Push(position,fp));
  3285. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  3286. ResetVariables(scope);
  3287. Emit(Pop(position,fp));
  3288. Emit(Exit(position,0,0, 0));
  3289. ReturnToContext(context);
  3290. IF dump # NIL THEN dump := section.comments END;
  3291. END CreateResetMethod;
  3292. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  3293. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  3294. BEGIN
  3295. IF SemanticChecker.IsPointerType (type) THEN
  3296. Emit (Push(position, dest));
  3297. CallThis(position,"GarbageCollector","Reset", 1);
  3298. ELSIF type.IsRecordType() THEN
  3299. Emit (Push(position, dest));
  3300. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3301. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3302. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3303. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3304. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  3305. size := GetArrayLength(type, tag);
  3306. base := ArrayBaseType(type);
  3307. IF base.IsRecordType() THEN
  3308. Emit (Push(position, size));
  3309. Emit (Push(position, dest));
  3310. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  3311. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3312. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3313. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3314. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  3315. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3316. Emit (Push(position, size));
  3317. Emit (Push(position, dest));
  3318. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  3319. ELSE
  3320. Emit (Push(position, size));
  3321. Emit (Push(position, dest));
  3322. CallThis(position,"GarbageCollector","ResetArray", 2);
  3323. ASSERT(ArrayBaseType(type).IsPointer());
  3324. END;
  3325. ReleaseIntermediateOperand(size);
  3326. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3327. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  3328. Emit (Push(position, dest));
  3329. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  3330. ELSE HALT(100); (* missing ? *)
  3331. END;
  3332. END CallResetProcedure;
  3333. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  3334. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  3335. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  3336. VAR operand: Operand;
  3337. BEGIN
  3338. Symbol (symbol, operand);
  3339. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  3340. ReleaseOperand(operand);
  3341. END Reset;
  3342. BEGIN
  3343. previousScope := currentScope;
  3344. currentScope := scope;
  3345. pc := section.pc;
  3346. prevOffset := MAX(SIZE);
  3347. variable := scope.firstVariable;
  3348. WHILE variable # NIL DO
  3349. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3350. Reset (variable);
  3351. prevOffset := variable.offsetInBits;
  3352. END;
  3353. variable := variable.nextVariable;
  3354. END;
  3355. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3356. WHILE parameter # NIL DO
  3357. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  3358. Reset (parameter);
  3359. END;
  3360. parameter := parameter.nextParameter;
  3361. END;
  3362. INC(statCoopResetVariables, section.pc - pc);
  3363. currentScope := previousScope;
  3364. END ResetVariables;
  3365. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  3366. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  3367. BEGIN
  3368. type := symbol.type.resolved;
  3369. SaveRegisters();ReleaseUsedRegisters(saved);
  3370. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  3371. Symbol(symbol, operand);
  3372. ToMemory(operand.op,addressType,0);
  3373. Emit(Push(position,operand.op));
  3374. IF refer THEN
  3375. CallThis(position,"Heaps","Refer",1);
  3376. ELSE
  3377. CallThis(position,"Heaps","Reset",1);
  3378. END;
  3379. ELSIF type.IsRecordType() THEN
  3380. Symbol(symbol, operand);
  3381. Emit(Push(position,operand.op));
  3382. Emit(Push(position,operand.tag)); (* type desc *)
  3383. IF refer THEN
  3384. CallThis(position,"Heaps","ReferRecord",2);
  3385. ELSE
  3386. CallThis(position,"Heaps","ResetRecord",2);
  3387. END;
  3388. ELSIF IsStaticArray(type) THEN
  3389. size := StaticArrayNumElements(type);
  3390. base := StaticArrayBaseType(type);
  3391. Symbol(symbol, operand);
  3392. arg := TypeDescriptorAdr(base);
  3393. Emit(Push(position,operand.op));
  3394. Emit(Push(position,arg));
  3395. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3396. ReleaseIntermediateOperand(arg);
  3397. IF refer THEN
  3398. CallThis(position,"Heaps","ReferArray",3);
  3399. ELSE
  3400. CallThis(position,"Heaps","ResetArray",3);
  3401. END;
  3402. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  3403. size := StaticMathArrayNumElements(type);
  3404. base := StaticMathArrayBaseType(type);
  3405. Symbol(symbol, operand);
  3406. arg := TypeDescriptorAdr(base);
  3407. Emit(Push(position,operand.op));
  3408. Emit(Push(position,arg));
  3409. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3410. ReleaseIntermediateOperand(arg);
  3411. IF refer THEN
  3412. CallThis(position,"Heaps","ReferArray",3);
  3413. ELSE
  3414. CallThis(position,"Heaps","ResetArray",3);
  3415. END;
  3416. ELSIF type IS SyntaxTree.MathArrayType THEN
  3417. Symbol(symbol, operand);
  3418. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3419. Emit (Push(position, operand.op));
  3420. ELSE
  3421. Emit (Push(position, operand.tag));
  3422. END;
  3423. IF refer THEN
  3424. CallThis(position,"Heaps","ReferMathArray", 1);
  3425. ELSE
  3426. CallThis(position,"Heaps","ResetMathArray", 1);
  3427. END;
  3428. ELSIF type IS SyntaxTree.ProcedureType THEN
  3429. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  3430. Symbol(symbol, operand);
  3431. Emit (Push(position, operand.tag));
  3432. IF refer THEN
  3433. CallThis(position,"Heaps","Refer", 1);
  3434. ELSE
  3435. CallThis(position,"Heaps","Reset", 1);
  3436. END;
  3437. ELSE HALT(100); (* missing ? *)
  3438. END;
  3439. ReleaseOperand(operand);
  3440. RestoreRegisters(saved);
  3441. END Reset;
  3442. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  3443. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  3444. BEGIN
  3445. previousScope := currentScope;
  3446. currentScope := scope;
  3447. pc := section.pc;
  3448. IF ~ refer THEN
  3449. variable := scope.firstVariable;
  3450. prevOffset := MAX(SIZE);
  3451. WHILE variable # NIL DO
  3452. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3453. Reset (variable,refer);
  3454. prevOffset := variable.offsetInBits;
  3455. END;
  3456. variable := variable.nextVariable;
  3457. END;
  3458. END;
  3459. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3460. WHILE parameter # NIL DO
  3461. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  3462. Reset (parameter,refer);
  3463. END;
  3464. parameter := parameter.nextParameter;
  3465. END;
  3466. INC(statCoopResetVariables, section.pc - pc);
  3467. currentScope := previousScope;
  3468. END ResetVariables2;
  3469. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  3470. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  3471. VAR op: IntermediateCode.Operand; context: Context;
  3472. BEGIN
  3473. previousSection := section;
  3474. GetCodeSectionNameForSymbol(procedure, name);
  3475. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3476. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3477. IF dump # NIL THEN dump := section.comments END;
  3478. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3479. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3480. Emit(Data(position,op));
  3481. Emit(Data(position,nil));
  3482. IF HasPointers (procedure.procedureScope) THEN
  3483. GetCodeSectionNameForSymbol(procedure, name);
  3484. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3485. ELSE
  3486. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3487. END;
  3488. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3489. Emit(Data(position,op));
  3490. ReturnToContext(context);
  3491. IF dump # NIL THEN dump := section.comments END;
  3492. END CreateProcedureDescriptor;
  3493. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3494. VAR import: SyntaxTree.Import;
  3495. s: Basic.MessageString;
  3496. selfName: SyntaxTree.IdentifierString;
  3497. BEGIN
  3498. moduleScope.ownerModule.GetName(selfName);
  3499. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3500. module := moduleScope.ownerModule
  3501. ELSE
  3502. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3503. IF import = NIL THEN
  3504. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3505. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3506. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3507. s := "Module ";
  3508. Strings.Append(s,moduleName);
  3509. Strings.Append(s," cannot be imported.");
  3510. IF force THEN
  3511. Error(position,s);
  3512. ELSIF canBeLoaded THEN
  3513. IF WarningDynamicLoading THEN
  3514. Strings.Append(s, "=> no dynamic linking.");
  3515. Warning(position, s);
  3516. END;
  3517. canBeLoaded := FALSE;
  3518. END;
  3519. RETURN FALSE
  3520. ELSE
  3521. SELF.module.imports.AddName(moduleName)
  3522. END;
  3523. ELSIF import.module = NIL THEN (* already tried *)
  3524. RETURN FALSE
  3525. END;
  3526. module := import.module;
  3527. END;
  3528. RETURN TRUE
  3529. END AddImport;
  3530. (* needed for old binary object file format*)
  3531. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3532. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  3533. BEGIN
  3534. IF AddImport(moduleName,module,TRUE) THEN
  3535. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3536. IF procedure = NIL THEN
  3537. s := "Instruction not supported on target, emulation procedure ";
  3538. Strings.Append(s,moduleName);
  3539. Strings.Append(s,".");
  3540. Strings.Append(s,procedureName);
  3541. Strings.Append(s," not present");
  3542. Error(position,s);
  3543. ELSE
  3544. StaticCallOperand(r,procedure);
  3545. ReleaseOperand(r);
  3546. fp := GetFingerprint(procedure);
  3547. END;
  3548. END;
  3549. END EnsureSymbol;
  3550. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3551. VAR trueL, exitL: Label; op: Operand;
  3552. BEGIN
  3553. InitOperand(op,ModeValue);
  3554. trueL := NewLabel();
  3555. exitL := NewLabel();
  3556. Condition(x,trueL,TRUE);
  3557. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3558. Emit(Mov(position,op.op,false));
  3559. BrL(exitL);
  3560. SetLabel(trueL);
  3561. Emit(MovReplace(position,op.op,true));
  3562. SetLabel(exitL);
  3563. RETURN op;
  3564. END ConditionValue;
  3565. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3566. VAR size: LONGINT;
  3567. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3568. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3569. BEGIN
  3570. ASSERT(type.form = SyntaxTree.Open);
  3571. baseType := type.arrayBase.resolved;
  3572. IF IsOpenArray(baseType) THEN
  3573. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3574. ELSE
  3575. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3576. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3577. END;
  3578. len := tag;
  3579. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3580. IntermediateCode.MakeMemory(len,addressType);
  3581. UseIntermediateOperand(len);
  3582. Reuse2(res,sizeOperand,len);
  3583. Emit(Mul(position,res,sizeOperand,len));
  3584. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3585. RETURN res
  3586. END GetArraySize;
  3587. BEGIN
  3588. type := type.resolved;
  3589. IF IsOpenArray(type) THEN
  3590. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3591. RETURN tag
  3592. ELSE
  3593. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3594. END;
  3595. ELSE
  3596. size := ToMemoryUnits(system,system.SizeOf(type));
  3597. RETURN IntermediateCode.Immediate(addressType,size)
  3598. END;
  3599. END GetDynamicSize;
  3600. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3601. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3602. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3603. BEGIN
  3604. ASSERT(type.form = SyntaxTree.Open);
  3605. baseType := type.arrayBase.resolved;
  3606. IF IsOpenArray(baseType) THEN
  3607. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3608. ELSE
  3609. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3610. END;
  3611. len := tag;
  3612. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3613. IntermediateCode.MakeMemory(len,addressType);
  3614. UseIntermediateOperand(len);
  3615. Reuse2(res,sizeOperand,len);
  3616. Emit(Mul(position,res,sizeOperand,len));
  3617. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3618. RETURN res
  3619. END GetLength;
  3620. BEGIN
  3621. type := type.resolved;
  3622. IF IsOpenArray(type) THEN
  3623. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3624. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3625. ELSIF type IS SyntaxTree.StringType THEN
  3626. RETURN tag;
  3627. ELSE
  3628. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3629. END;
  3630. END GetArrayLength;
  3631. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3632. VAR result: IntermediateCode.Operand;
  3633. BEGIN
  3634. IF backend.cooperative THEN
  3635. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3636. ELSE
  3637. MakeMemory(result, tag, addressType, 0);
  3638. END;
  3639. RETURN result
  3640. END GetSizeFromTag;
  3641. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3642. VAR parameter: SyntaxTree.Parameter;
  3643. BEGIN
  3644. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3645. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3646. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3647. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3648. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3649. END;
  3650. RETURN GetDynamicSize(e.type, tag);
  3651. END GetArrayOfBytesSize;
  3652. (*
  3653. to find imported symbol. not needed ?
  3654. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3655. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3656. BEGIN
  3657. IF AddImport(moduleName,importedModule,FALSE) THEN
  3658. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3659. RETURN symbol
  3660. ELSE
  3661. RETURN NIL
  3662. END
  3663. END SymbolByName;
  3664. *)
  3665. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3666. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3667. BEGIN
  3668. IF AddImport(moduleName,runtimeModule,force) THEN
  3669. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3670. IF procedure = NIL THEN
  3671. s := "Procedure ";
  3672. Strings.Append(s,moduleName);
  3673. Strings.Append(s,".");
  3674. Strings.Append(s,procedureName);
  3675. Strings.Append(s," not present");
  3676. Error(position,s);
  3677. RETURN FALSE
  3678. ELSE
  3679. RETURN TRUE
  3680. END;
  3681. ELSE RETURN FALSE
  3682. END;
  3683. END GetRuntimeProcedure;
  3684. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3685. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3686. s: Basic.MessageString;
  3687. BEGIN
  3688. Basic.InitSegmentedName(name);
  3689. name[0] := Basic.MakeString(moduleName);
  3690. name[1] := Basic.MakeString(typeName);
  3691. name[2] := -1;
  3692. IF AddImport(moduleName,importedModule, FALSE) THEN
  3693. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3694. IF symbol = NIL THEN
  3695. s := "type ";
  3696. Strings.Append(s,moduleName);
  3697. Strings.Append(s,".");
  3698. Strings.Append(s,typeName);
  3699. Strings.Append(s," not present");
  3700. Error(position,s);
  3701. END;
  3702. ELSE symbol := NIL;
  3703. END;
  3704. IF importedModule = moduleScope.ownerModule THEN
  3705. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3706. ELSE
  3707. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3708. END;
  3709. RETURN symbol
  3710. END GetTypeDescriptor;
  3711. (* 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. *)
  3712. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3713. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3714. pooledName: Basic.SegmentedName; size: LONGINT;
  3715. BEGIN
  3716. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3717. StaticCallOperand(result,procedure);
  3718. IF numberParameters < 0 THEN
  3719. size := ProcParametersSize(procedure);
  3720. ELSE
  3721. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3722. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3723. Error(position,"runtime call parameter count mismatch");
  3724. END;
  3725. END;
  3726. Emit(Call(position, result.op, size));
  3727. ReleaseOperand(result);
  3728. ELSE (* only static linking possible *)
  3729. ASSERT(numberParameters >= 0);
  3730. Basic.InitSegmentedName(pooledName);
  3731. pooledName[0] := Basic.MakeString(moduleName);
  3732. pooledName[1] := Basic.MakeString(procedureName);
  3733. pooledName[2] := -1;
  3734. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3735. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3736. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3737. END;
  3738. END CallThisChecked;
  3739. (* 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. *)
  3740. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3741. BEGIN
  3742. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3743. END CallThis;
  3744. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3745. VAR
  3746. left,right: Operand;
  3747. leftSize, rightSize: IntermediateCode.Operand;
  3748. saved: RegisterEntry;
  3749. reg: IntermediateCode.Operand;
  3750. procedureName: SyntaxTree.IdentifierString;
  3751. BEGIN
  3752. procedureName := "CompareString";
  3753. SaveRegisters();ReleaseUsedRegisters(saved);
  3754. Designate(leftExpression,left);
  3755. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3756. Emit(Push(position,leftSize));
  3757. ReleaseIntermediateOperand(leftSize);
  3758. Emit(Push(position,left.op));
  3759. ReleaseOperand(left);
  3760. Designate(rightExpression,right);
  3761. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3762. Emit(Push(position,rightSize));
  3763. ReleaseIntermediateOperand(rightSize);
  3764. Emit(Push(position,right.op));
  3765. ReleaseOperand(right);
  3766. CallThis(position,builtinsModuleName,procedureName, 4);
  3767. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3768. Emit(Result(position,reg));
  3769. RestoreRegisters(saved);
  3770. br(label,reg,IntermediateCode.Immediate(int8,0));
  3771. ReleaseIntermediateOperand(reg);
  3772. END CompareString;
  3773. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3774. VAR
  3775. left,right: Operand;
  3776. leftSize, rightSize: IntermediateCode.Operand;
  3777. saved: RegisterEntry;
  3778. procedureName: SyntaxTree.IdentifierString;
  3779. BEGIN
  3780. procedureName := "CopyString";
  3781. SaveRegisters();ReleaseUsedRegisters(saved);
  3782. Designate(leftExpression,left);
  3783. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3784. Emit(Push(position,leftSize));
  3785. ReleaseIntermediateOperand(leftSize);
  3786. Emit(Push(position,left.op));
  3787. ReleaseOperand(left);
  3788. Designate(rightExpression,right);
  3789. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3790. Emit(Push(position,rightSize));
  3791. ReleaseIntermediateOperand(rightSize);
  3792. Emit(Push(position,right.op));
  3793. ReleaseOperand(right);
  3794. CallThis(position,builtinsModuleName,procedureName,4);
  3795. RestoreRegisters(saved);
  3796. END CopyString;
  3797. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3798. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3799. leftType,rightType: SyntaxTree.Type;
  3800. leftExpression,rightExpression : SyntaxTree.Expression;
  3801. componentType: IntermediateCode.Type;
  3802. exit: Label; dest: IntermediateCode.Operand;
  3803. size: LONGINT;
  3804. BEGIN
  3805. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3806. dest := destination; destination := emptyOperand;
  3807. leftType := x.left.type.resolved;
  3808. rightType := x.right.type.resolved;
  3809. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3810. CASE x.operator OF
  3811. Scanner.Or, Scanner.And, Scanner.Is:
  3812. result := ConditionValue(x);
  3813. |Scanner.Plus:
  3814. Evaluate(x.left,left);
  3815. Evaluate(x.right,right);
  3816. IF leftType IS SyntaxTree.SetType THEN
  3817. InitOperand(result,ModeValue);
  3818. Reuse2a(result.op,left.op,right.op,dest);
  3819. Emit(Or(position,result.op,left.op,right.op));
  3820. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3821. InitOperand(result,ModeValue);
  3822. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3823. Reuse2(result.tag,left.tag,right.tag);
  3824. Emit(Add(position,result.op,left.op,right.op));
  3825. Emit(Add(position,result.tag,left.tag,right.tag))
  3826. ELSE
  3827. InitOperand(result,ModeValue);
  3828. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3829. AddInt(result.op, left.op, right.op) ;
  3830. ELSE
  3831. *)
  3832. Reuse2a(result.op,left.op,right.op,dest);
  3833. Emit(Add(position,result.op,left.op,right.op));
  3834. (*
  3835. END;
  3836. *)
  3837. END;
  3838. ReleaseOperand(left); ReleaseOperand(right);
  3839. |Scanner.Minus:
  3840. Evaluate(x.left,left);
  3841. Evaluate(x.right,right);
  3842. IF leftType IS SyntaxTree.SetType THEN
  3843. InitOperand(result,ModeValue);
  3844. Reuse1(result.op,right.op);
  3845. Emit(Not(position,result.op,right.op));
  3846. ReleaseOperand(right);
  3847. Emit(And(position,result.op,result.op,left.op));
  3848. ReleaseOperand(left);
  3849. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3850. InitOperand(result,ModeValue);
  3851. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3852. Reuse2(result.tag,left.tag,right.tag);
  3853. Emit(Sub(position,result.op,left.op,right.op));
  3854. Emit(Sub(position,result.tag,left.tag,right.tag));
  3855. ReleaseOperand(left); ReleaseOperand(right)
  3856. ELSE
  3857. InitOperand(result,ModeValue);
  3858. Reuse2a(result.op,left.op,right.op,dest);
  3859. Emit(Sub(position,result.op,left.op,right.op));
  3860. ReleaseOperand(left); ReleaseOperand(right);
  3861. END;
  3862. |Scanner.Times:
  3863. Evaluate(x.left,left);
  3864. Evaluate(x.right,right);
  3865. IF leftType IS SyntaxTree.SetType THEN
  3866. InitOperand(result,ModeValue);
  3867. Reuse2a(result.op,left.op,right.op,dest);
  3868. Emit(And(position,result.op,left.op,right.op));
  3869. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3870. InitOperand(result, ModeValue);
  3871. componentType := left.op.type;
  3872. (* TODO: review this *)
  3873. (*
  3874. result.op = left.op * right.op - left.tag * right.tag
  3875. result.tag = left.tag * right.op + left.op * right.tag
  3876. *)
  3877. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3878. Emit(Mul(position,result.op, left.op, right.op));
  3879. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3880. Emit(Mul(position,tempReg, left.tag, right.tag));
  3881. Emit(Sub(position,result.op, result.op, tempReg));
  3882. Reuse2(result.tag, left.tag, right.op);
  3883. Emit(Mul(position,result.tag, left.tag, right.op));
  3884. Emit(Mul(position,tempReg, left.op, right.tag));
  3885. Emit(Add(position,result.tag, result.tag, tempReg));
  3886. ReleaseIntermediateOperand(tempReg)
  3887. ELSE
  3888. InitOperand(result,ModeValue);
  3889. Reuse2a(result.op,left.op,right.op,dest);
  3890. Emit(Mul(position,result.op,left.op,right.op));
  3891. END;
  3892. ReleaseOperand(left); ReleaseOperand(right);
  3893. |Scanner.Div:
  3894. Evaluate(x.left,left);
  3895. Evaluate(x.right,right);
  3896. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3897. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3898. IF ~isUnchecked THEN
  3899. exit := NewLabel();
  3900. BrltL(exit,zero,right.op);
  3901. EmitTrap(position,NegativeDivisorTrap);
  3902. SetLabel(exit);
  3903. END;
  3904. END;
  3905. InitOperand(result,ModeValue);
  3906. Reuse2a(result.op,left.op,right.op,dest);
  3907. Emit(Div(position,result.op,left.op,right.op));
  3908. ReleaseOperand(left); ReleaseOperand(right);
  3909. |Scanner.Mod:
  3910. Evaluate(x.left,left);
  3911. Evaluate(x.right,right);
  3912. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3913. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3914. IF ~isUnchecked THEN
  3915. exit := NewLabel();
  3916. BrltL(exit,zero,right.op);
  3917. EmitTrap(position,NegativeDivisorTrap);
  3918. SetLabel(exit);
  3919. END;
  3920. END;
  3921. InitOperand(result,ModeValue);
  3922. Reuse2a(result.op,left.op,right.op,dest);
  3923. Emit(Mod(position,result.op,left.op,right.op));
  3924. ReleaseOperand(left); ReleaseOperand(right);
  3925. |Scanner.Slash:
  3926. Evaluate(x.left,left);
  3927. Evaluate(x.right,right);
  3928. IF leftType IS SyntaxTree.SetType THEN
  3929. InitOperand(result,ModeValue);
  3930. Reuse2a(result.op,left.op,right.op,dest);
  3931. Emit(Xor(position,result.op,left.op,right.op));
  3932. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3933. InitOperand(result,ModeValue);
  3934. componentType := left.op.type;
  3935. (* review this *)
  3936. (*
  3937. divisor = right.op * right.op + right.tag * right.tag
  3938. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3939. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3940. *)
  3941. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3942. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3943. Emit(Mul(position,tempReg, right.op, right.op));
  3944. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3945. Emit(Add(position,tempReg, tempReg, tempReg2));
  3946. result.op := tempReg2;
  3947. Emit(Mul(position,result.op, left.op, right.op));
  3948. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3949. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3950. Emit(Add(position,result.op, result.op, tempReg2));
  3951. Emit(Div(position,result.op, result.op, tempReg));
  3952. Reuse2(result.tag, left.tag, right.op);
  3953. Emit(Mul(position,result.tag, left.tag, right.op));
  3954. Emit(Mul(position,tempReg2, left.op, right.tag));
  3955. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3956. Emit(Div(position,result.tag, result.tag, tempReg));
  3957. ReleaseIntermediateOperand(tempReg);
  3958. ReleaseIntermediateOperand(tempReg2)
  3959. ELSE
  3960. InitOperand(result,ModeValue);
  3961. Reuse2a(result.op,left.op,right.op,dest);
  3962. Emit(Div(position,result.op,left.op,right.op));
  3963. END;
  3964. ReleaseOperand(left); ReleaseOperand(right);
  3965. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3966. result := ConditionValue(x);
  3967. |Scanner.In:
  3968. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3969. Evaluate(x.left,left);
  3970. Evaluate(x.right,right);
  3971. Convert(left.op,setType);
  3972. Convert(right.op,setType);
  3973. ReuseCopy(temp.op,right.op);
  3974. Emit(Shr(position,temp.op,temp.op,left.op));
  3975. ReleaseOperand(right); ReleaseOperand(left);
  3976. IntermediateCode.InitImmediate(one,setType,1);
  3977. Emit(And(position,temp.op,temp.op,one));
  3978. Convert(temp.op,bool);
  3979. result.mode := ModeValue;
  3980. result.op := temp.op;
  3981. result.tag := nil; (* may be left over from calls to evaluate *)
  3982. ELSE
  3983. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3984. IF x.operator = Scanner.Questionmarks THEN
  3985. leftExpression := x.left;
  3986. rightExpression := x.right;
  3987. ELSE
  3988. leftExpression := x.right;
  3989. rightExpression := x.left;
  3990. END;
  3991. Evaluate(leftExpression, left);
  3992. Emit(Push(position,left.op));
  3993. ReleaseOperand(left);
  3994. Designate(rightExpression, right);
  3995. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3996. IF ~backend.cellsAreObjects THEN
  3997. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3998. END;
  3999. Emit(Push(position,right.op));
  4000. ReleaseOperand(right);
  4001. IF backend.cellsAreObjects THEN
  4002. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  4003. ELSE
  4004. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  4005. END;
  4006. InitOperand(result, ModeValue);
  4007. result.op := NewRegisterOperand(bool);
  4008. Emit(Result(position,result.op));
  4009. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  4010. leftExpression := x.left;
  4011. rightExpression := x.right;
  4012. Evaluate(leftExpression, left);
  4013. Emit(Push(position,left.op));
  4014. ReleaseOperand(left);
  4015. Evaluate(rightExpression, right);
  4016. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4017. IF ~backend.cellsAreObjects THEN
  4018. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  4019. END;
  4020. Emit(Push(position,right.op));
  4021. ReleaseOperand(right);
  4022. IF backend.cellsAreObjects THEN
  4023. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  4024. ELSE
  4025. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  4026. END;
  4027. InitOperand(result, ModeValue);
  4028. result.op := NewRegisterOperand(bool);
  4029. Emit(Result(position,result.op));
  4030. ELSE
  4031. HALT(100);
  4032. END;
  4033. END;
  4034. destination := dest;
  4035. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  4036. END VisitBinaryExpression;
  4037. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  4038. VAR localResult, operand: Operand;
  4039. BEGIN
  4040. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  4041. InitOperand(localResult, ModeValue);
  4042. ASSERT(x.first # NIL);
  4043. Evaluate(x.first, operand);
  4044. localResult.op := operand.op;
  4045. ReleaseOperand(operand);
  4046. UseIntermediateOperand(localResult.op);
  4047. ASSERT(x.last # NIL);
  4048. Evaluate(x.last, operand);
  4049. localResult.tag := operand.op;
  4050. ReleaseOperand(operand);
  4051. UseIntermediateOperand(localResult.tag);
  4052. IF x.step # NIL THEN
  4053. Evaluate(x.step, operand);
  4054. localResult.extra := operand.op;
  4055. ReleaseOperand(operand);
  4056. UseIntermediateOperand(localResult.extra);
  4057. END;
  4058. result := localResult;
  4059. IF Trace THEN TraceExit("VisitRangeExpression") END
  4060. END VisitRangeExpression;
  4061. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  4062. BEGIN
  4063. HALT(100); (* should never be evaluated *)
  4064. END VisitTensorRangeExpression;
  4065. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  4066. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  4067. BEGIN
  4068. IF Trace THEN TraceEnter("VisitConversion") END;
  4069. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  4070. dest := destination; destination := emptyOperand;
  4071. Evaluate(x.expression,old);
  4072. InitOperand(result,ModeValue);
  4073. result.op := old.op;
  4074. ASSERT(result.op.mode # 0);
  4075. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  4076. (* convert TO a complex number *)
  4077. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  4078. Convert(result.op,IntermediateCode.GetType(system, componentType));
  4079. ASSERT(result.op.mode # 0);
  4080. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  4081. (* convert FROM a complex number TO a complex number*)
  4082. result.tag := old.tag;
  4083. ASSERT(result.tag.mode # 0);
  4084. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  4085. ASSERT(result.tag.mode # 0)
  4086. ELSE
  4087. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  4088. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  4089. END
  4090. ELSE
  4091. Convert(result.op,IntermediateCode.GetType(system,x.type));
  4092. ASSERT(result.op.mode # 0);
  4093. result.tag := old.tag; (*! probably never used *)
  4094. END;
  4095. destination := dest;
  4096. IF Trace THEN TraceExit("VisitConversion") END;
  4097. END VisitConversion;
  4098. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  4099. BEGIN
  4100. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  4101. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  4102. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  4103. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  4104. END VisitTypeDeclaration;
  4105. (** designators (expressions) *)
  4106. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  4107. VAR ownerType, designatorType: SyntaxTree.RecordType;
  4108. BEGIN
  4109. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  4110. IF x.left # NIL THEN Expression(x.left) END;
  4111. Symbol(x.symbol,result);
  4112. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  4113. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  4114. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  4115. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  4116. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  4117. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  4118. END;
  4119. END;
  4120. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  4121. END VisitSymbolDesignator;
  4122. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  4123. BEGIN
  4124. IF isUnchecked THEN RETURN END;
  4125. IF tagsAvailable THEN
  4126. TrapC(BrltL,index,length,IndexCheckTrap);
  4127. END;
  4128. END BoundCheck;
  4129. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  4130. VAR d: IntermediateCode.Operand;
  4131. BEGIN
  4132. IF isUnchecked THEN RETURN END;
  4133. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  4134. TrapC(op,dim,d,ArraySizeTrap);
  4135. ReleaseIntermediateOperand(d);
  4136. END DimensionCheck;
  4137. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  4138. VAR
  4139. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  4140. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  4141. expression: SyntaxTree.Expression;
  4142. resultingType, leftType, baseType: SyntaxTree.Type;
  4143. skipLabel1: Label;
  4144. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  4145. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  4146. variableOp: Operand;
  4147. variable: SyntaxTree.Variable;
  4148. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  4149. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  4150. VAR e: SyntaxTree.Expression; i: LONGINT;
  4151. BEGIN
  4152. tensorFound := FALSE;
  4153. FOR i := 0 TO parameters.Length()-1 DO
  4154. e := parameters.GetExpression(i);
  4155. IF e IS SyntaxTree.TensorRangeExpression THEN
  4156. ASSERT(~tensorFound);
  4157. tensorFound := TRUE;
  4158. ELSIF e IS SyntaxTree.RangeExpression THEN
  4159. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4160. ELSE
  4161. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4162. END;
  4163. END;
  4164. END CountIndices;
  4165. BEGIN
  4166. ASSERT(tagsAvailable);
  4167. resultingType := x.type.resolved; (* resulting type *)
  4168. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  4169. InitOperand(localResult, ModeReference);
  4170. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4171. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  4172. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  4173. (* a globally defined array destination tag is available -> use and invalidate it*)
  4174. localResult.tag := arrayDestinationTag;
  4175. IntermediateCode.InitOperand(arrayDestinationTag)
  4176. ELSE
  4177. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  4178. (* the result is of array range type and thus does not provide any collectable pointers *)
  4179. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  4180. Symbol(variable, variableOp);
  4181. ReuseCopy(localResult.tag, variableOp.op);
  4182. ReleaseOperand(variableOp);
  4183. END
  4184. END;
  4185. indexListSize := x.parameters.Length();
  4186. CountIndices(x.parameters);
  4187. (*ASSERT(tensorRangeCount <= 1);*)
  4188. (* designate the array to be indexed over, perform tensor range check if known *)
  4189. Designate(x.left, array);
  4190. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4191. Dereference(array, leftType,FALSE);
  4192. IF ~tensorFound THEN
  4193. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  4194. END
  4195. END;
  4196. (* default base offset *)
  4197. srcDimOffset := 0;
  4198. destDimOffset := 0;
  4199. indexDim := 0;
  4200. (* use address of source array as basis *)
  4201. localResult.op := array.op;
  4202. UseIntermediateOperand(localResult.op);
  4203. (* go through the index list *)
  4204. FOR i := 0 TO indexListSize - 1 DO
  4205. expression := x.parameters.GetExpression(i);
  4206. IF expression IS SyntaxTree.TensorRangeExpression THEN
  4207. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  4208. srcDimOffset := -indexListSize;
  4209. destDimOffset := -suffixRanges;
  4210. ELSE
  4211. (* determine which dimension of source array is currently looked at *)
  4212. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  4213. (* get the memory operand pointing to array descriptor dimension *)
  4214. GetMathArrayField(tmp, array.tag, MathDimOffset);
  4215. (* make a reusable register from it *)
  4216. ReuseCopy(srcDim, tmp);
  4217. ReleaseIntermediateOperand(tmp);
  4218. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  4219. ELSE
  4220. srcDim := IntermediateCode.Immediate(sizeType, i);
  4221. END;
  4222. (* get length and increment of source array for current dimension *)
  4223. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  4224. Convert(sourceLength.op, sizeType);
  4225. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  4226. Convert(sourceIncrement.op, sizeType);
  4227. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  4228. ReleaseIntermediateOperand(srcDim);
  4229. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  4230. (* SINGLE INDEX *)
  4231. Evaluate(expression, index);
  4232. ReleaseIntermediateOperand(index.tag);
  4233. index.tag := emptyOperand;
  4234. Convert(index.op, sizeType);
  4235. (* lower bound check *)
  4236. IF IsIntegerImmediate(index.op, staticIndex) THEN
  4237. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  4238. ELSIF isUnchecked THEN (* do nothing *)
  4239. ELSE
  4240. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4241. END;
  4242. (* upper bound check *)
  4243. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4244. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  4245. ELSIF isUnchecked THEN (* do nothing *)
  4246. ELSE
  4247. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  4248. END;
  4249. ReleaseOperand(sourceLength);
  4250. Convert(index.op, addressType);
  4251. summand := index.op;
  4252. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  4253. (* RANGE OF INDICES *)
  4254. Evaluate(expression, range);
  4255. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  4256. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  4257. stepSize := range.extra; UseIntermediateOperand(stepSize);
  4258. ReleaseOperand(range);
  4259. Convert(firstIndex, sizeType);
  4260. Convert(lastIndex, sizeType);
  4261. Convert(stepSize, sizeType);
  4262. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  4263. if it is 'MAX(LONGINT)' *)
  4264. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4265. TransferToRegister(lastIndex, lastIndex);
  4266. skipLabel1 := NewLabel();
  4267. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  4268. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  4269. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  4270. SetLabel(skipLabel1)
  4271. END;
  4272. (* check if step size is valid *)
  4273. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  4274. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  4275. ELSIF isUnchecked THEN (* do nothing *)
  4276. ELSE
  4277. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  4278. END;
  4279. (* check lower bound check *)
  4280. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  4281. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  4282. ELSIF isUnchecked THEN (* do nothing *)
  4283. ELSE
  4284. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4285. END;
  4286. (* check upper bound check *)
  4287. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4288. (* statically open range: nothing to do *)
  4289. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4290. ASSERT(staticLastIndex < staticSourceLength)
  4291. ELSIF isUnchecked THEN (* do nothing *)
  4292. ELSE
  4293. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  4294. END;
  4295. (* determine length of target array for current dimension *)
  4296. (* 1. incorporate last index: *)
  4297. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4298. (* last index is static *)
  4299. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4300. targetLength := sourceLength.op
  4301. ELSE
  4302. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  4303. END;
  4304. UseIntermediateOperand(targetLength);
  4305. ELSE
  4306. (* targetLength := lastIndex + 1
  4307. Reuse1(targetLength, lastIndex);
  4308. *)
  4309. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  4310. END;
  4311. ReleaseOperand(sourceLength);
  4312. ReleaseIntermediateOperand(lastIndex);
  4313. (* 2. incorporate first index: *)
  4314. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4315. (* first index and current target length are static *)
  4316. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  4317. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  4318. (* first index = 0: nothing to do *)
  4319. ELSE
  4320. (* targetLength := targetLength - firstIndex *)
  4321. TransferToRegister(targetLength, targetLength);
  4322. Emit(Sub(position,targetLength, targetLength, firstIndex))
  4323. END;
  4324. (* clip negative lengths to 0 *)
  4325. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4326. IF staticTargetLength < 0 THEN
  4327. targetLength := IntermediateCode.Immediate(sizeType, 0)
  4328. END
  4329. ELSE
  4330. skipLabel1 := NewLabel();
  4331. TransferToRegister(targetLength, targetLength);
  4332. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  4333. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  4334. SetLabel(skipLabel1)
  4335. END;
  4336. (* 3. incorporate index step size: *)
  4337. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4338. (*step size and current target length are static *)
  4339. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  4340. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  4341. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4342. (* step size = 1: nothing to do *)
  4343. ELSE
  4344. (* emit code for this:
  4345. targetLength := (targetLength-1) DIV stepSize +1;
  4346. *)
  4347. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  4348. DivInt(targetLength, targetLength, stepSize);
  4349. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  4350. END;
  4351. (* determine increment of target array for current dimension *)
  4352. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  4353. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  4354. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4355. (* step size = 1 *)
  4356. targetIncrement := sourceIncrement.op;
  4357. UseIntermediateOperand(targetIncrement)
  4358. ELSE
  4359. (* targetIncrement := sourceIncrement * stepSize *)
  4360. Reuse1(targetIncrement, stepSize);
  4361. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  4362. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  4363. END;
  4364. ReleaseIntermediateOperand(stepSize);
  4365. (* write length and increment of target array to descriptor *)
  4366. IF destDimOffset < 0 THEN
  4367. (* determine which dimension of target array is currently looked at *)
  4368. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  4369. TransferToRegister(destDim, tmp);
  4370. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  4371. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  4372. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  4373. ReleaseIntermediateOperand(destDim);
  4374. INC(destDimOffset);
  4375. ELSE
  4376. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  4377. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  4378. END;
  4379. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  4380. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  4381. INC(indexDim);
  4382. Convert(firstIndex, addressType);
  4383. TransferToRegister(summand, firstIndex);
  4384. ELSE HALT(100);
  4385. END;
  4386. (*
  4387. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  4388. *)
  4389. Convert(sourceIncrement.op, addressType);
  4390. Convert(summand, addressType);
  4391. MulInt(summand, summand, sourceIncrement.op);
  4392. ReleaseIntermediateOperand(sourceIncrement.op);
  4393. AddInt(localResult.op, localResult.op, summand);
  4394. ReleaseIntermediateOperand(summand);
  4395. END
  4396. END;
  4397. result := localResult;
  4398. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4399. ReleaseIntermediateOperand(result.tag);
  4400. result.tag := TypeDescriptorAdr(resultingType);
  4401. ELSIF IsDelegate(resultingType) THEN
  4402. ReleaseIntermediateOperand(result.tag);
  4403. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4404. UseIntermediateOperand(result.tag);
  4405. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4406. ReleaseIntermediateOperand(result.tag);
  4407. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4408. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4409. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4410. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4411. (* finalize target array descriptor *)
  4412. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4413. (* write lengths and increments of target array for remaining dimensions *)
  4414. i := indexListSize;
  4415. WHILE indexDim < targetArrayDimensionality DO
  4416. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4417. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4418. ReleaseOperand(sourceLength);
  4419. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4420. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4421. ReleaseOperand(sourceIncrement);
  4422. INC(i); INC(indexDim);
  4423. END;
  4424. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4425. tmp := nil;
  4426. ELSE
  4427. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4428. END;
  4429. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4430. ReleaseIntermediateOperand(tmp);
  4431. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4432. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4433. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4434. ELSE
  4435. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4436. END;
  4437. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4438. ReleaseIntermediateOperand(tmp);
  4439. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4440. (* write dimensionality *)
  4441. IF targetArrayDimensionality # 0 THEN
  4442. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4443. END;
  4444. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4445. END;
  4446. ReleaseOperand(array);
  4447. END MathIndexDesignator;
  4448. (* get the length of an array , trying to make use of static information *)
  4449. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4450. VAR res: IntermediateCode.Operand; size: LONGINT;
  4451. BEGIN
  4452. type := type.resolved;
  4453. IF type IS SyntaxTree.ArrayType THEN
  4454. WITH type: SyntaxTree.ArrayType DO
  4455. IF type.form = SyntaxTree.Static THEN
  4456. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4457. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4458. Evaluate(type.length, op);
  4459. ReleaseIntermediateOperand(op.tag);
  4460. RETURN op.op;*)
  4461. ELSE
  4462. res := tag;
  4463. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4464. IntermediateCode.MakeMemory(res,addressType);
  4465. UseIntermediateOperand(res);
  4466. RETURN res
  4467. END
  4468. END;
  4469. ELSE
  4470. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4471. RETURN IntermediateCode.Immediate(addressType,size);
  4472. END;
  4473. END ArrayLength;
  4474. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4475. BEGIN
  4476. IF IsImmediate(x) THEN
  4477. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4478. ELSE
  4479. IF ~ReusableRegister(res) THEN
  4480. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4481. ELSE
  4482. UseIntermediateOperand(res);
  4483. END;
  4484. Emit(Mov(position,res,x))
  4485. END;
  4486. END CopyInt;
  4487. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4488. BEGIN
  4489. ReleaseIntermediateOperand(res);
  4490. IF IsImmediate(x) & IsImmediate(y) THEN
  4491. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4492. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4493. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4494. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4495. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4496. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4497. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4498. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4499. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4500. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4501. UseIntermediateOperand(res);
  4502. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4503. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4504. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4505. UseIntermediateOperand(res);
  4506. ELSE
  4507. IF ~ReusableRegister(res) THEN
  4508. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4509. ELSE
  4510. UseIntermediateOperand(res);
  4511. END;
  4512. IF IsImmediate(x) & (x.intValue = 0) THEN
  4513. Emit(Mov(position,res,y))
  4514. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4515. Emit(Mov(position,res,x))
  4516. ELSE
  4517. Emit(Add(position,res, x, y));
  4518. END;
  4519. END;
  4520. END AddInt;
  4521. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4522. BEGIN
  4523. ReleaseIntermediateOperand(res);
  4524. IF IsImmediate(x) & IsImmediate(y) THEN
  4525. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4526. ELSE
  4527. IF ~ReusableRegister(res) THEN
  4528. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4529. ELSE UseIntermediateOperand(res);
  4530. END;
  4531. IF IsImmediate(x) & (x.intValue = 1) THEN
  4532. Emit(Mov(position,res,y))
  4533. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4534. Emit(Mov(position,res,x))
  4535. ELSE
  4536. Emit(Mul(position,res, x, y));
  4537. END;
  4538. END;
  4539. END MulInt;
  4540. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4541. BEGIN
  4542. ReleaseIntermediateOperand(res);
  4543. IF IsImmediate(x) & IsImmediate(y) THEN
  4544. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4545. ELSE
  4546. IF ~ReusableRegister(res) THEN
  4547. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4548. ELSE UseIntermediateOperand(res);
  4549. END;
  4550. IF IsImmediate(x) & (x.intValue = 1) THEN
  4551. Emit(Mov(position,res,y))
  4552. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4553. Emit(Mov(position,res,x))
  4554. ELSE
  4555. Emit(Div(position,res, x, y));
  4556. END;
  4557. END;
  4558. END DivInt;
  4559. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4560. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4561. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4562. BEGIN
  4563. type := x.left.type.resolved;
  4564. IF type IS SyntaxTree.StringType THEN
  4565. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4566. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4567. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4568. type := atype;
  4569. x.left.SetType(type);
  4570. END;
  4571. IntermediateCode.InitImmediate(res,addressType,0);
  4572. maxDim := x.parameters.Length()-1;
  4573. (*
  4574. computation rule:
  4575. a: ARRAY X,Y,Z OF Element with size S
  4576. a[i,j,k] -->
  4577. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4578. *)
  4579. FOR i := 0 TO maxDim DO
  4580. e := x.parameters.GetExpression(i);
  4581. Evaluate(e,index);
  4582. Convert(index.op,addressType);
  4583. AddInt(res, res, index.op);
  4584. IF i = 0 THEN
  4585. (*
  4586. ReuseCopy(res, index.op);
  4587. *)
  4588. Designate(x.left,array);
  4589. type := x.left.type.resolved;
  4590. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4591. Dereference(array, type, FALSE);
  4592. END;
  4593. (*
  4594. ELSE AddInt(res, res, index.op);
  4595. *)
  4596. END;
  4597. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4598. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4599. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4600. BoundCheck(index.op, length);
  4601. END;
  4602. ReleaseIntermediateOperand(length);
  4603. END;
  4604. ReleaseOperand(index);
  4605. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4606. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4607. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4608. MulInt(res,res,length);
  4609. END;
  4610. ReleaseIntermediateOperand(length);
  4611. END;
  4612. (* remaining open dimensions -- compute address *)
  4613. i := maxDim+1;
  4614. IF type IS SyntaxTree.ArrayType THEN
  4615. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4616. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4617. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4618. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4619. MulInt(res,res,length);
  4620. END;
  4621. ReleaseIntermediateOperand(length);
  4622. INC(i);
  4623. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4624. END;
  4625. END;
  4626. IF (type IS SyntaxTree.ArrayType) THEN
  4627. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4628. size := StaticSize(system, type);
  4629. IF size # 1 THEN
  4630. length := IntermediateCode.Immediate(addressType,size);
  4631. MulInt(res,res,length);
  4632. END;
  4633. ELSE
  4634. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4635. IF size # 1 THEN
  4636. length := IntermediateCode.Immediate(addressType,size);
  4637. MulInt(res,res,length);
  4638. END;
  4639. END;
  4640. END;
  4641. AddInt(res,res,array.op);
  4642. InitOperand(result,ModeReference);
  4643. result.op := res;
  4644. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4645. ReleaseIntermediateOperand(result.tag);
  4646. result.tag := TypeDescriptorAdr(type);
  4647. ELSIF IsDelegate(type) THEN
  4648. ReleaseIntermediateOperand(result.tag);
  4649. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4650. UseIntermediateOperand(result.tag);
  4651. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4652. ReleaseIntermediateOperand(result.tag);
  4653. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4654. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4655. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4656. END;
  4657. ReleaseOperand(array);
  4658. END IndexDesignator;
  4659. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4660. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4661. BEGIN
  4662. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4663. dest := destination; destination := emptyOperand;
  4664. type := x.left.type.resolved;
  4665. IF type IS SyntaxTree.MathArrayType THEN
  4666. MathIndexDesignator(x);
  4667. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4668. IndexDesignator(x);
  4669. END;
  4670. destination := dest;
  4671. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4672. END VisitIndexDesignator;
  4673. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4674. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4675. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4676. procedure: SyntaxTree.Procedure;
  4677. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4678. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4679. BEGIN
  4680. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4681. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4682. parameters := expression.parameters;
  4683. moduleName := "FoxArrayBase";
  4684. procedureName := "CopyDescriptor";
  4685. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4686. SaveRegisters();ReleaseUsedRegisters(saved);
  4687. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4688. IF procedure = NIL THEN
  4689. s := "procedure ";
  4690. Strings.Append(s,moduleName);
  4691. Strings.Append(s,".");
  4692. Strings.Append(s,procedureName);
  4693. Strings.Append(s," not present");
  4694. Error(position,s);
  4695. ELSE
  4696. (* push address of temporary variable *)
  4697. Symbol(variable,destOperand);
  4698. Emit(Push(position,destOperand.op));
  4699. ReleaseOperand(destOperand);
  4700. (* push src *)
  4701. Evaluate(expression.left,srcOperand);
  4702. (*
  4703. Dereference(srcOperand,expression.type.resolved);
  4704. Emit(Push(position,srcOperand.tag));
  4705. *)
  4706. Emit(Push(position,srcOperand.op));
  4707. ReleaseOperand(srcOperand);
  4708. tensorFound := FALSE;
  4709. FOR i := 0 TO parameters.Length()-1 DO
  4710. e := parameters.GetExpression(i);
  4711. IF e IS SyntaxTree.TensorRangeExpression THEN
  4712. tensorFound := TRUE;
  4713. ELSIF e IS SyntaxTree.RangeExpression THEN
  4714. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4715. ELSE
  4716. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4717. END;
  4718. END;
  4719. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4720. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4721. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4722. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4723. StaticCallOperand(procOp,procedure);
  4724. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4725. ReleaseOperand(procOp);
  4726. END;
  4727. RestoreRegisters(saved);
  4728. END;
  4729. RETURN variable
  4730. END PrepareTensorDescriptor;
  4731. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4732. VAR
  4733. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4734. operand, tmpOperand, variableOp, variable2Op: Operand;
  4735. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4736. variable, variable2: SyntaxTree.Variable;
  4737. dim, i, size: LONGINT;
  4738. (* TODO: needed? *)
  4739. oldArrayDestinationTag: IntermediateCode.Operand;
  4740. oldArrayDestinationDimension: LONGINT;
  4741. position: Position;
  4742. saved: RegisterEntry;
  4743. arrayFlags: SET;
  4744. m, n: LONGINT;
  4745. PROCEDURE Pass(op: IntermediateCode.Operand);
  4746. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4747. BEGIN
  4748. IF register >= 0 THEN
  4749. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4750. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4751. Emit(Mov(position,parameterRegister, op));
  4752. ELSE
  4753. Emit(Push(position,op))
  4754. END
  4755. END Pass;
  4756. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4757. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4758. BEGIN
  4759. formalType := formalType.resolved; actualType := actualType.resolved;
  4760. IF IsOpenArray(formalType)THEN
  4761. IF actualType IS SyntaxTree.StringType THEN
  4762. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4763. RETURN;
  4764. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4765. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4766. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4767. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4768. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4769. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4770. ELSE
  4771. tmp := baseReg;
  4772. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4773. IntermediateCode.MakeMemory(tmp,addressType);
  4774. Pass((tmp));
  4775. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4776. END;
  4777. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4778. END;
  4779. END PushArrayLens;
  4780. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4781. BEGIN
  4782. CASE size OF
  4783. |2: INCL(flags,Size2Flag);
  4784. |3: INCL(flags,Size3Flag);
  4785. |4: INCL(flags,Size4Flag);
  4786. |5: INCL(flags,Size5Flag);
  4787. |6: INCL(flags,Size6Flag);
  4788. |7: INCL(flags,Size7Flag);
  4789. |8: INCL(flags,Size8Flag);
  4790. END;
  4791. END SetSmallArraySizeFlag;
  4792. BEGIN
  4793. IF Trace THEN TraceEnter("PushParameter") END;
  4794. position := expression.position;
  4795. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4796. type := expression.type.resolved;
  4797. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4798. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4799. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4800. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4801. );
  4802. (* TODO: needed? *)
  4803. oldArrayDestinationTag := arrayDestinationTag;
  4804. oldArrayDestinationDimension := arrayDestinationDimension;
  4805. IF IsArrayOfSystemByte(parameter.type) THEN
  4806. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4807. Designate(expression,operand);
  4808. ELSE
  4809. Evaluate(expression, tmpOperand);
  4810. (* array of system byte does not provide any pointers *)
  4811. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4812. Symbol(variable, operand);
  4813. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4814. Emit(Mov(position,tmp, tmpOperand.op));
  4815. ReleaseOperand(tmpOperand);
  4816. END;
  4817. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4818. ReleaseIntermediateOperand(operand.tag);
  4819. operand.tag := tmp;
  4820. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4821. Pass((operand.tag));
  4822. END;
  4823. Pass((operand.op));
  4824. ELSIF IsOpenArray(parameter.type) THEN
  4825. Designate(expression,operand);
  4826. baseReg := operand.tag;
  4827. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4828. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4829. END;
  4830. Pass((operand.op)); (* address of the array *)
  4831. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4832. (* case 1
  4833. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4834. *)
  4835. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4836. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4837. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4838. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4839. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4840. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4841. arrayDestinationTag := sp;
  4842. (* case 1b
  4843. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4844. *)
  4845. IF expression IS SyntaxTree.IndexDesignator THEN
  4846. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4847. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4848. arrayDestinationDimension := dim;
  4849. Designate(expression,operand);
  4850. (* case 1a
  4851. P(...,A,...) push: push array descriptor to stack
  4852. *)
  4853. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4854. Designate(expression,operand);
  4855. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4856. i := 0;
  4857. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4858. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4859. INC(i);
  4860. END;
  4861. type := expression.type.resolved;
  4862. WHILE (i<dim) DO (* remaining static dimensions *)
  4863. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4864. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4865. ReleaseOperand(tmpOperand);
  4866. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4867. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4868. ReleaseOperand(tmpOperand);
  4869. INC(i);
  4870. END;
  4871. dimOp := IntermediateCode.Immediate(addressType,dim);
  4872. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4873. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4874. (* case 1d
  4875. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4876. + case 1e
  4877. P(.. PT() ... );
  4878. *)
  4879. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4880. Designate(expression,operand);
  4881. Dereference(operand,type.resolved,FALSE);
  4882. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4883. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4884. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4885. (* case 1f
  4886. P(...,S,...) push: create array descriptor to S on stack
  4887. case 1g
  4888. P(... PS()...)
  4889. *)
  4890. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4891. Designate(expression,operand);
  4892. FOR i := 0 TO dim-1 DO
  4893. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4894. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4895. ReleaseOperand(tmpOperand);
  4896. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4897. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4898. ReleaseOperand(tmpOperand);
  4899. END;
  4900. (*******
  4901. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4902. *)
  4903. arrayFlags := {StaticFlag};
  4904. IF dim = 1 THEN
  4905. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4906. ReleaseOperand(tmpOperand);
  4907. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4908. m := LONGINT(tmpOperand.op.intValue);
  4909. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4910. ELSIF dim = 2 THEN
  4911. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4912. ReleaseOperand(tmpOperand);
  4913. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4914. m := LONGINT(tmpOperand.op.intValue);
  4915. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4916. ReleaseOperand(tmpOperand);
  4917. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4918. n := LONGINT(tmpOperand.op.intValue);
  4919. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4920. INCL(arrayFlags,SmallMatrixFlag);
  4921. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4922. END;
  4923. END;
  4924. (*******)
  4925. dimOp := IntermediateCode.Immediate(addressType,dim);
  4926. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4927. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4928. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4929. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4930. baseType := SemanticChecker.ArrayBase(type,dim);
  4931. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4932. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4933. ELSE HALT(100);
  4934. END;
  4935. (* case 2
  4936. procedure P([left args], var A: array [*,*] of Type, [right args])
  4937. *)
  4938. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4939. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4940. (* case 2b
  4941. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4942. push: push reference to pushed array descriptor
  4943. post: remove array descriptor.
  4944. *)
  4945. IF expression IS SyntaxTree.IndexDesignator THEN
  4946. descriptorType := GetMathArrayDescriptorType(dim);
  4947. (* range type : no allocation possible, should be untraced *)
  4948. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4949. Symbol(variable,variableOp);
  4950. arrayDestinationTag := variableOp.op;
  4951. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4952. arrayDestinationDimension := dim;
  4953. NeedDescriptor := TRUE;
  4954. Designate(expression,operand);
  4955. Pass((operand.tag));
  4956. NeedDescriptor := FALSE;
  4957. (* case 2a
  4958. P(...,A,...)
  4959. push: push reference to array descriptor on stack
  4960. *)
  4961. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4962. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4963. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4964. INC(i);
  4965. END;
  4966. IF i = dim THEN
  4967. Designate(expression,operand);
  4968. Pass((operand.tag));
  4969. ELSE (* open-static *)
  4970. type := expression.type.resolved;
  4971. descriptorType := GetMathArrayDescriptorType(dim);
  4972. (* static array , cannot be reallocated, untraced !*)
  4973. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4974. Symbol(variable,variableOp);
  4975. arrayDestinationTag := variableOp.op;
  4976. Designate(expression,operand);
  4977. FOR i := 0 TO dim-1 DO
  4978. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4979. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4980. ReleaseOperand(tmpOperand);
  4981. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4982. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4983. ReleaseOperand(tmpOperand);
  4984. END;
  4985. dimOp := IntermediateCode.Immediate(addressType,dim);
  4986. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4987. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4988. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4989. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4990. baseType := SemanticChecker.ArrayBase(type,dim);
  4991. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4992. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4993. Pass((arrayDestinationTag));
  4994. END;
  4995. (* case 2d
  4996. P(...,T,...) push: emit dimension check, push T
  4997. *)
  4998. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4999. Designate(expression,operand);
  5000. Dereference(operand,type.resolved,FALSE);
  5001. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  5002. Pass((operand.tag));
  5003. (* case 2f
  5004. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  5005. push: push reference to pushed array descriptor
  5006. post: remove array descriptor
  5007. *)
  5008. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5009. descriptorType := GetMathArrayDescriptorType(dim);
  5010. (* static array -- cannot be reallocatated, untraced *)
  5011. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5012. Symbol(variable,variableOp);
  5013. arrayDestinationTag := variableOp.op;
  5014. Designate(expression,operand);
  5015. FOR i := 0 TO dim-1 DO
  5016. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5017. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5018. ReleaseOperand(tmpOperand);
  5019. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5020. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5021. ReleaseOperand(tmpOperand);
  5022. END;
  5023. (*
  5024. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  5025. *)
  5026. arrayFlags := {StaticFlag};
  5027. IF dim = 1 THEN
  5028. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5029. ReleaseOperand(tmpOperand);
  5030. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5031. m := LONGINT(tmpOperand.op.intValue);
  5032. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  5033. ELSIF dim = 2 THEN
  5034. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5035. ReleaseOperand(tmpOperand);
  5036. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5037. m := LONGINT(tmpOperand.op.intValue);
  5038. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  5039. ReleaseOperand(tmpOperand);
  5040. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5041. n := LONGINT(tmpOperand.op.intValue);
  5042. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  5043. INCL(arrayFlags,SmallMatrixFlag);
  5044. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  5045. END;
  5046. END;
  5047. (*******)
  5048. dimOp := IntermediateCode.Immediate(addressType,dim);
  5049. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5050. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5051. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5052. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  5053. baseType := SemanticChecker.ArrayBase(type,dim);
  5054. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5055. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5056. Pass((arrayDestinationTag));
  5057. ELSE HALT(100);
  5058. END;
  5059. (* case 3
  5060. procedure P([left args], [const] A: array [?] of Type, [right args])
  5061. *)
  5062. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  5063. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5064. (* case 3b
  5065. P(...,A[a..b,c..d],...)
  5066. *)
  5067. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5068. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5069. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5070. Symbol(variable,variableOp);
  5071. LoadValue(variableOp,system.addressType);
  5072. ELSE
  5073. descriptorType := GetMathArrayDescriptorType(dim);
  5074. (* range -- cannot be reallocated *)
  5075. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5076. Symbol(variable,variableOp);
  5077. END;
  5078. arrayDestinationTag := variableOp.op;
  5079. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5080. arrayDestinationDimension := 0;
  5081. Designate(expression,operand);
  5082. Pass((operand.tag));
  5083. (* case 3a
  5084. P(...,A,...)
  5085. *)
  5086. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5087. i := 0;
  5088. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5089. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5090. INC(i);
  5091. END;
  5092. IF i = dim THEN
  5093. Designate(expression,operand);
  5094. Pass((operand.tag));
  5095. ELSE (* open-static *)
  5096. type := expression.type.resolved;
  5097. descriptorType := GetMathArrayDescriptorType(dim);
  5098. (* static array -- cannot be reallocated -- no pointer to be traced *)
  5099. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5100. Symbol(variable,variableOp);
  5101. arrayDestinationTag := variableOp.op;
  5102. Designate(expression,operand);
  5103. FOR i := 0 TO dim-1 DO
  5104. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5105. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5106. ReleaseOperand(tmpOperand);
  5107. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5108. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5109. ReleaseOperand(tmpOperand);
  5110. END;
  5111. dimOp := IntermediateCode.Immediate(addressType,dim);
  5112. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5113. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5114. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5115. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  5116. baseType := SemanticChecker.ArrayBase(type,dim);
  5117. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5118. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5119. Pass((arrayDestinationTag));
  5120. END;
  5121. (* case 3d
  5122. P(...,T,...)
  5123. case 3e
  5124. P(...,PT(...),...)
  5125. *)
  5126. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5127. Designate(expression,operand);
  5128. Dereference(operand,type.resolved,FALSE);
  5129. Pass((operand.tag));
  5130. (* case 3f
  5131. P(...,S,...)
  5132. case 3g
  5133. P(...,PS(...),...)
  5134. *)
  5135. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5136. descriptorType := GetMathArrayDescriptorType(dim);
  5137. (* static array does not need to be traced *)
  5138. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5139. Symbol(variable,variableOp);
  5140. arrayDestinationTag := variableOp.op;
  5141. Designate(expression,operand);
  5142. IF operand.op.type.length >1 THEN (* vector register *)
  5143. (* static array does not need to be traced *)
  5144. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  5145. Symbol(variable2, variable2Op);
  5146. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  5147. Emit(Mov(position,tmp, operand.op));
  5148. ReleaseOperand(operand);
  5149. Symbol(variable2, operand);
  5150. END;
  5151. FOR i := 0 TO dim-1 DO
  5152. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5153. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5154. ReleaseOperand(tmpOperand);
  5155. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5156. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5157. ReleaseOperand(tmpOperand);
  5158. END;
  5159. dimOp := IntermediateCode.Immediate(addressType,dim);
  5160. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5161. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5162. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5163. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5164. baseType := SemanticChecker.ArrayBase(type,dim);
  5165. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5166. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5167. Pass((arrayDestinationTag));
  5168. ELSE HALT(100);
  5169. END;
  5170. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  5171. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5172. (* case 4b
  5173. P(...,A[a..b,c..d],...)
  5174. *)
  5175. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5176. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5177. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5178. Symbol(variable,variableOp);
  5179. LoadValue(variableOp,system.addressType);
  5180. ELSE
  5181. descriptorType := GetMathArrayDescriptorType(dim);
  5182. (* range array -- cannot be allocated *)
  5183. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5184. Symbol(variable,variableOp);
  5185. END;
  5186. arrayDestinationTag := variableOp.op;
  5187. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5188. arrayDestinationDimension := 0;
  5189. Designate(expression,operand);
  5190. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5191. Symbol(variable,variableOp);
  5192. ELSE
  5193. (* alias to range -- untraced *)
  5194. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5195. Symbol(variable,variableOp);
  5196. MakeMemory(tmp,variableOp.op,addressType,0);
  5197. Emit(Mov(position,tmp,operand.tag));
  5198. ReleaseIntermediateOperand(tmp);
  5199. END;
  5200. Pass((variableOp.op));
  5201. ReleaseOperand(variableOp);
  5202. (* case 4a
  5203. P(...,A,...)
  5204. *)
  5205. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5206. i := 0;
  5207. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5208. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5209. INC(i);
  5210. END;
  5211. IF i = dim THEN
  5212. Designate(expression,operand);
  5213. arrayDestinationTag := operand.tag;
  5214. ELSE (* open-static *)
  5215. type := expression.type.resolved;
  5216. descriptorType := GetMathArrayDescriptorType(dim);
  5217. (* static array -- untraced *)
  5218. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5219. Symbol(variable,variableOp);
  5220. arrayDestinationTag := variableOp.op;
  5221. Designate(expression,operand);
  5222. FOR i := 0 TO dim-1 DO
  5223. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5224. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5225. ReleaseOperand(tmpOperand);
  5226. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5227. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5228. ReleaseOperand(tmpOperand);
  5229. END;
  5230. dimOp := IntermediateCode.Immediate(addressType,dim);
  5231. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5232. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5233. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5234. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  5235. baseType := SemanticChecker.ArrayBase(type,dim);
  5236. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5237. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5238. END;
  5239. (* tensor alias to open array -- untraced *)
  5240. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5241. Symbol(variable,variableOp);
  5242. MakeMemory(tmp,variableOp.op,addressType,0);
  5243. Emit(Mov(position,tmp,arrayDestinationTag));
  5244. ReleaseIntermediateOperand(tmp);
  5245. Pass((variableOp.op));
  5246. ReleaseOperand(variableOp);
  5247. (* case 4d
  5248. P(...,T,...)
  5249. *)
  5250. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5251. Designate(expression,operand);
  5252. Pass((operand.op));
  5253. (* case 4f
  5254. P(...,S,...)
  5255. *)
  5256. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5257. descriptorType := GetMathArrayDescriptorType(dim);
  5258. (* static array -- cannot be reallocated, untraced *)
  5259. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5260. Symbol(variable,variableOp);
  5261. arrayDestinationTag := variableOp.op;
  5262. Designate(expression,operand);
  5263. FOR i := 0 TO dim-1 DO
  5264. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5265. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5266. ReleaseOperand(tmpOperand);
  5267. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5268. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5269. ReleaseOperand(tmpOperand);
  5270. END;
  5271. dimOp := IntermediateCode.Immediate(addressType,dim);
  5272. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5273. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5274. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5275. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5276. baseType := SemanticChecker.ArrayBase(type,dim);
  5277. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5278. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5279. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5280. Symbol(variable,variableOp);
  5281. MakeMemory(tmp,variableOp.op,addressType,0);
  5282. Emit(Mov(position,tmp,arrayDestinationTag));
  5283. ReleaseIntermediateOperand(tmp);
  5284. Pass((variableOp.op));
  5285. ReleaseOperand(variableOp);
  5286. ELSE HALT(100);
  5287. END;
  5288. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  5289. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  5290. Designate(expression,operand);
  5291. IF operand.op.type.length > 1 THEN
  5292. Emit(Push(position, operand.op));
  5293. ELSE
  5294. size := system.SizeOf(type);
  5295. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  5296. size := ToMemoryUnits(system,size);
  5297. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5298. arrayDestinationTag := sp;
  5299. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  5300. END;
  5301. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  5302. Designate(expression,operand);
  5303. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  5304. (* static array no pointer *)
  5305. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5306. Symbol(variable,variableOp);
  5307. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  5308. Emit(Mov(position,tmp,operand.op));
  5309. Emit(Push(position,variableOp.op));
  5310. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5311. Pass((operand.op));
  5312. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  5313. END;
  5314. ELSE HALT(200)
  5315. END;
  5316. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  5317. IF parameter.kind = SyntaxTree.VarParameter THEN
  5318. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  5319. Designate(expression, operand);
  5320. Pass((operand.op));
  5321. ELSE
  5322. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5323. Evaluate(expression, operand);
  5324. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  5325. Pass((operand.extra)); (* step *)
  5326. Pass((operand.tag)); (* last *)
  5327. Pass((operand.op)); (* first *)
  5328. ELSE
  5329. (* pass range as structure in order to comply with the variable alignment of its components *)
  5330. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5331. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  5332. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5333. tmp := sp;
  5334. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5335. Emit(Mov(position,tmp,operand.op)); (* first *)
  5336. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  5337. IntermediateCode.AddOffset(tmp,size);
  5338. Emit(Mov(position,tmp,operand.tag)); (* last *)
  5339. IntermediateCode.AddOffset(tmp,size);
  5340. Emit(Mov(position,tmp,operand.extra)); (* step *)
  5341. END;
  5342. END
  5343. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  5344. IF parameter.kind = SyntaxTree.VarParameter THEN
  5345. Designate(expression, operand);
  5346. Pass((operand.op));
  5347. ELSE
  5348. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5349. Evaluate(expression, operand);
  5350. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  5351. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  5352. Pass((operand.tag)); (* imaginary part *)
  5353. Pass((operand.op)) (* real part *)
  5354. ELSE
  5355. (* pass complex as structure in order to comply with the variable alignment of its components *)
  5356. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5357. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  5358. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5359. tmp := sp;
  5360. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5361. Emit(Mov(position,tmp,operand.op)); (* real part *)
  5362. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  5363. IntermediateCode.AddOffset(tmp,size);
  5364. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  5365. END
  5366. END
  5367. ELSE
  5368. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5369. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  5370. Designate(expression,operand);
  5371. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  5372. (* stack allocation *)
  5373. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  5374. (*! parameter alignment to be discussed ... *)
  5375. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  5376. size := type(SyntaxTree.StringType).length;
  5377. END;
  5378. IF backend.cooperative & parameter.NeedsTrace() THEN
  5379. dst := NewRegisterOperand (addressType);
  5380. Emit(Mov(position,dst, sp));
  5381. IntermediateCode.InitImmediate(null, byteType, 0);
  5382. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  5383. ReleaseIntermediateOperand(dst);
  5384. SaveRegisters();ReleaseUsedRegisters(saved);
  5385. (* register dst has been freed before SaveRegisters already *)
  5386. CallAssignMethod(dst, operand.op, parameter.type);
  5387. RestoreRegisters(saved);
  5388. END;
  5389. IF operand.op.type.length > 1 THEN (* vector *)
  5390. MakeMemory(tmp,sp,operand.op.type,0);
  5391. Emit(Mov(position, tmp, operand.op));
  5392. ELSE
  5393. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5394. END;
  5395. ELSIF IsOpenArray(parameter.type) THEN
  5396. Designate(expression,operand);
  5397. baseReg := operand.tag;
  5398. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5399. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5400. END;
  5401. Pass((operand.op)); (* address of the array *)
  5402. ELSIF IsDelegate(parameter.type) THEN
  5403. Evaluate(expression,operand);
  5404. IF backend.cooperative & parameter.NeedsTrace() THEN
  5405. Emit(Push(position, nil));
  5406. dst := NewRegisterOperand (addressType);
  5407. Emit(Mov(position,dst, sp));
  5408. ReleaseIntermediateOperand(dst);
  5409. SaveRegisters();ReleaseUsedRegisters(saved);
  5410. Emit(Push(position, dst));
  5411. (* register dst has been freed before SaveRegisters already *)
  5412. Emit(Push(position, operand.tag));
  5413. CallThis(position,"GarbageCollector","Assign",2);
  5414. RestoreRegisters(saved);
  5415. ELSE
  5416. Pass((operand.tag));
  5417. END;
  5418. Pass((operand.op));
  5419. ELSE
  5420. Evaluate(expression,operand);
  5421. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5422. Emit(Push(position, nil));
  5423. dst := NewRegisterOperand (addressType);
  5424. Emit(Mov(position,dst, sp));
  5425. ReleaseIntermediateOperand(dst);
  5426. SaveRegisters();ReleaseUsedRegisters(saved);
  5427. Emit(Push(position, dst));
  5428. (* register dst has been freed before SaveRegisters already *)
  5429. Emit(Push(position, operand.op));
  5430. CallThis(position,"GarbageCollector","Assign",2);
  5431. RestoreRegisters(saved);
  5432. ELSE
  5433. Pass((operand.op));
  5434. END;
  5435. END;
  5436. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5437. Evaluate(expression,operand);
  5438. Pass((operand.op));
  5439. ELSE (* var parameter *)
  5440. Designate(expression,operand);
  5441. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5442. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5443. Pass((operand.tag));
  5444. END;
  5445. END;
  5446. Pass((operand.op));
  5447. END;
  5448. END;
  5449. (* TODO: needed? *)
  5450. arrayDestinationTag := oldArrayDestinationTag;
  5451. arrayDestinationDimension := oldArrayDestinationDimension;
  5452. IF needsParameterBackup THEN
  5453. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5454. ReuseCopy(parameterBackup, operand.op)
  5455. END;
  5456. ReleaseOperand(operand);
  5457. IF Trace THEN TraceExit("PushParameter") END;
  5458. END PushParameter;
  5459. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5460. BEGIN
  5461. 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
  5462. Expression(x.result); (* use register *)
  5463. END;
  5464. Statement(x.statement);
  5465. IF x.result # NIL THEN Expression(x.result) END;
  5466. 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
  5467. ReleaseIntermediateOperand(result.op);
  5468. END;
  5469. END VisitStatementDesignator;
  5470. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5471. VAR
  5472. procedure: SyntaxTree.Procedure;
  5473. procedureType: SyntaxTree.ProcedureType;
  5474. wasInline: BOOLEAN;
  5475. actualParameters: SyntaxTree.ExpressionList;
  5476. formalParameter: SyntaxTree.Parameter;
  5477. actualParameter: SyntaxTree.Expression;
  5478. i: LONGINT;
  5479. localVariable: SyntaxTree.Variable;
  5480. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5481. src, dest: Operand;
  5482. prevInlineExit : Label;
  5483. prevMapper: SymbolMapper;
  5484. tooComplex: BOOLEAN;
  5485. resultDesignator: SyntaxTree.Expression;
  5486. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5487. BEGIN
  5488. IF e = NIL THEN RETURN TRUE
  5489. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5490. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5491. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5492. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5493. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5494. ELSE RETURN FALSE
  5495. END;
  5496. END SimpleExpression;
  5497. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5498. BEGIN
  5499. RETURN checker.CanPassInRegister(type)
  5500. END FitsInRegister;
  5501. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5502. VAR
  5503. variable: SyntaxTree.Variable;
  5504. variableDesignator: SyntaxTree.Designator;
  5505. BEGIN
  5506. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5507. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5508. variableDesignator.SetType(type);
  5509. RETURN variableDesignator
  5510. END GetTemp;
  5511. BEGIN
  5512. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5513. wasInline := currentIsInline;
  5514. prevInlineExit := currentInlineExit;
  5515. prevMapper := currentMapper;
  5516. currentInlineExit := NewLabel();
  5517. tooComplex := FALSE;
  5518. NEW(currentMapper);
  5519. currentIsInline := TRUE;
  5520. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5521. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5522. formalParameter := procedureType.firstParameter;
  5523. actualParameters := x.parameters;
  5524. i := 0;
  5525. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5526. actualParameter := actualParameters.GetExpression(i);
  5527. IF actualParameter.resolved # NIL THEN
  5528. actualParameter := actualParameter.resolved
  5529. END;
  5530. (*
  5531. if expression is simple and can be passed immediately
  5532. or if type fits in register then we can proceed
  5533. otherwise we escape to ordinary procedure call.
  5534. *)
  5535. (* cases where the expression can be mapped identically *)
  5536. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5537. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5538. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5539. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5540. (*
  5541. Assign(variableDesignator, actualParameter);
  5542. *)
  5543. Evaluate(actualParameter, src);
  5544. Designate(variableDesignator, dest);
  5545. Emit(Mov(x.position, dest.op, src.op));
  5546. ReleaseOperand(dest);
  5547. ReleaseOperand(src);
  5548. (* the src operand should now have been completely released ! *)
  5549. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5550. ELSE tooComplex := TRUE
  5551. END;
  5552. (*
  5553. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5554. currentMapper.Add(formalParameter, actualParameter, NIL);
  5555. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5556. variableDesignator := GetTemp(system.addressType, FALSE);
  5557. Designate(actualParameter, src);
  5558. Designate(variableDesignator, dest);
  5559. IntermediateCode.MakeMemory(dest.op,addressType);
  5560. Emit(Mov(x.position, dest.op, src.op));
  5561. ReleaseOperand(dest);
  5562. IF src.tag.mode # IntermediateCode.Undefined THEN
  5563. tagDesignator := GetTemp(system.addressType, FALSE);
  5564. Designate(tagDesignator, dest);
  5565. IntermediateCode.MakeMemory(dest.op,addressType);
  5566. Emit(Mov(x.position, dest.op, src.op));
  5567. END;
  5568. ReleaseOperand(dest); ReleaseOperand(src);
  5569. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5570. END;
  5571. *)
  5572. formalParameter := formalParameter.nextParameter;
  5573. INC(i);
  5574. END;
  5575. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5576. IF resultDesignator # NIL THEN
  5577. returnDesignator := resultDesignator
  5578. ELSE
  5579. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5580. END;
  5581. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5582. END;
  5583. localVariable := procedure.procedureScope.firstVariable;
  5584. WHILE ~tooComplex & (localVariable # NIL) DO
  5585. variableDesignator := GetTemp(localVariable.type, FALSE);
  5586. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5587. localVariable := localVariable.nextVariable;
  5588. END;
  5589. IF ~tooComplex THEN
  5590. VisitStatementBlock(procedure.procedureScope.body);
  5591. SetLabel(currentInlineExit);
  5592. IF procedureType.returnType # NIL THEN
  5593. Designate(returnDesignator, result);
  5594. END;
  5595. END;
  5596. currentMapper := prevMapper;
  5597. currentInlineExit := prevInlineExit;
  5598. currentIsInline := wasInline;
  5599. RETURN ~tooComplex
  5600. END InlineProcedureCall;
  5601. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5602. VAR
  5603. parameters: SyntaxTree.ExpressionList;
  5604. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5605. procedureType: SyntaxTree.ProcedureType;
  5606. formalParameter: SyntaxTree.Parameter;
  5607. operand: Operand;
  5608. reg, size, mask, dest: IntermediateCode.Operand;
  5609. saved,saved2: RegisterEntry;
  5610. symbol: SyntaxTree.Symbol;
  5611. variable: SyntaxTree.Variable;
  5612. i, parametersSize : LONGINT;
  5613. structuredReturnType: BOOLEAN;
  5614. gap, alignment: LONGINT; (*fld*)
  5615. return: IntermediateCode.Operand;
  5616. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5617. arg: IntermediateCode.Operand;
  5618. dummy: IntermediateCode.Operand;
  5619. recordType: SyntaxTree.RecordType;
  5620. operatorSelectionProcedureOperand: Operand;
  5621. operatorSelectionProcedure: SyntaxTree.Procedure;
  5622. fingerPrint: SyntaxTree.FingerPrint;
  5623. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5624. identifierNumber: LONGINT;
  5625. parameterRegisters: SIZE;
  5626. registers: ARRAY 64 OF WORD;
  5627. procedure: SyntaxTree.Procedure;
  5628. callingConvention: SyntaxTree.CallingConvention;
  5629. type: IntermediateCode.Type;
  5630. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5631. (** do preparations before parameter push for array-structured object types (ASOTs):
  5632. if ASOT is passed as VAR parameter:
  5633. - allocate temporary variable of math array type
  5634. - copy contents of ASOT to be passed to temporary variable
  5635. - use temporary variable as the actual parameter instead
  5636. - 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)
  5637. **)
  5638. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5639. VAR
  5640. expression, left: SyntaxTree.Expression; tempVariableDesignator : SyntaxTree.Designator;
  5641. BEGIN
  5642. IF (formalParameter.kind = SyntaxTree.VarParameter) & SemanticChecker.IsIndexOperator(actualParameter) THEN
  5643. WITH actualParameter: SyntaxTree.ProcedureCallDesignator DO
  5644. (* prepare writeback for any other "normal" indexer *)
  5645. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5646. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5647. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5648. Assign(tempVariableDesignator, actualParameter);
  5649. IF firstWriteBackCall = NIL THEN
  5650. NEW(firstWriteBackCall);
  5651. currentWriteBackCall := firstWriteBackCall
  5652. ELSE
  5653. ASSERT(currentWriteBackCall # NIL);
  5654. NEW(currentWriteBackCall.next);
  5655. currentWriteBackCall := currentWriteBackCall.next
  5656. END;
  5657. (* a [^] . P[] ()*)
  5658. left := actualParameter.left; (* procedure call designator --> procedure call *)
  5659. left := left(SyntaxTree.Designator).left; (* procedure call --> caller object *)
  5660. IF left IS SyntaxTree.DereferenceDesignator THEN (* dereference, if required *)
  5661. left := left(SyntaxTree.Designator).left;
  5662. END;
  5663. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, left, 0, actualParameter.parameters, tempVariableDesignator);
  5664. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5665. END;
  5666. actualParameter := tempVariableDesignator;
  5667. END
  5668. END PrepareParameter;
  5669. BEGIN
  5670. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5671. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5672. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5673. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5674. IF InlineProcedureCall(x) THEN
  5675. RETURN
  5676. ELSE
  5677. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5678. END
  5679. END;
  5680. END;
  5681. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5682. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5683. callingConvention := procedureType.callingConvention;
  5684. dest := destination; destination := emptyOperand;
  5685. SaveRegisters();ReleaseUsedRegisters(saved);
  5686. parameters := x.parameters;
  5687. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5688. (* an operator is called *)
  5689. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5690. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5691. (* check if a dynamic operator call should be performed *)
  5692. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5693. ELSE
  5694. isCallOfDynamicOperator := FALSE
  5695. END;
  5696. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5697. Emit(Push(position, ap));
  5698. END;
  5699. alignment := procedureType.stackAlignment;
  5700. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5701. alignment := 16 (* bytes *);
  5702. END;
  5703. IF alignment > 1 THEN
  5704. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5705. Emit(Mov(position,reg, sp));
  5706. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5707. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5708. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5709. gap := 4*ToMemoryUnits(system,system.addressSize);
  5710. END;
  5711. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5712. backend.ResetParameterRegisters();
  5713. formalParameter := procedureType.firstParameter;
  5714. FOR i := 0 TO parameters.Length()-1 DO
  5715. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5716. type := addressType;
  5717. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5718. type := addressType;
  5719. ELSE
  5720. type := GetType(system, formalParameter.type);
  5721. END;
  5722. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5723. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5724. END;
  5725. formalParameter := formalParameter.nextParameter;
  5726. END;
  5727. IF gap < 0 THEN
  5728. gap := 0
  5729. END;
  5730. ELSE
  5731. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5732. END;
  5733. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5734. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5735. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5736. Emit(And(position,sp, sp, mask));
  5737. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5738. Emit(Push(position,reg));
  5739. ReleaseIntermediateOperand(reg);
  5740. END;
  5741. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5742. (* align stack to 16-byte boundary *)
  5743. IntermediateCode.InitImmediate(mask,addressType,-16);
  5744. Emit(And(position,sp, sp, mask));
  5745. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5746. IF gap # 0 THEN
  5747. IntermediateCode.InitImmediate(size,addressType,gap);
  5748. Emit(Sub(position,sp,sp,size))
  5749. END;
  5750. END;
  5751. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5752. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5753. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5754. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5755. ELSE
  5756. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5757. END;
  5758. IF procedureType.selfParameter # NIL THEN (* type bound procedure in a record *)
  5759. Designate(x.left(SyntaxTree.Designator).left, operand);
  5760. Emit(Push(position, operand.tag));
  5761. Emit(Push(position, operand.op));
  5762. Symbol(symbol, operand);
  5763. LoadValue(operand, symbol.type);
  5764. (*
  5765. PushParameter(x.left(SyntaxTree.Designator).left, procedureType.selfParameter, callingConvention, FALSE, dummy,-1);
  5766. Evaluate(x.left, operand);
  5767. *)
  5768. ELSE
  5769. Evaluate(x.left, operand);
  5770. IF symbol IS SyntaxTree.Procedure THEN
  5771. IF (procedureType.selfParameter # NIL) THEN
  5772. Emit(Push(position,operand.tag));
  5773. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5774. Emit(Push(position,operand.tag));
  5775. ELSIF (procedureType.isDelegate) THEN
  5776. Emit(Push(position,operand.tag));
  5777. END;
  5778. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5779. IF (procedureType.selfParameter # NIL) THEN
  5780. Emit(Push(position,operand.tag));
  5781. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5782. Emit(Push(position,operand.tag));
  5783. END;
  5784. ELSE HALT(200);
  5785. END;
  5786. END;
  5787. ReleaseIntermediateOperand(operand.tag);
  5788. operand.tag := emptyOperand;
  5789. (* determine if a structured return type is needed *)
  5790. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5791. IF structuredReturnType THEN
  5792. IF resultDesignator # NIL THEN
  5793. d := resultDesignator;
  5794. ELSE
  5795. (* temporary result that might be allocated, must potentially be traced *)
  5796. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5797. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5798. d.SetType(variable.type);
  5799. END;
  5800. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5801. Designate(d,returnValue);
  5802. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5803. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5804. Emit(Push(position,size));
  5805. Emit(Push(position,returnValue.op));
  5806. ReleaseOperand(returnValue);
  5807. ELSE*)
  5808. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5809. (*
  5810. END;
  5811. *)
  5812. END;
  5813. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5814. parameterRegisters := 0;
  5815. backend.ResetParameterRegisters();
  5816. formalParameter := procedureType.firstParameter;
  5817. FOR i := 0 TO parameters.Length()-1 DO
  5818. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5819. type := addressType;
  5820. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5821. type := addressType;
  5822. ELSE
  5823. type := GetType(system, formalParameter.type);
  5824. END;
  5825. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5826. INC(parameterRegisters);
  5827. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5828. Error(actualParameter.position,"cannot be passed by register")
  5829. END;
  5830. ELSE
  5831. registers[i] := -1;
  5832. END;
  5833. formalParameter := formalParameter.nextParameter;
  5834. END;
  5835. formalParameter := procedureType.lastParameter;
  5836. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5837. actualParameter := parameters.GetExpression(i);
  5838. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5839. formalParameter := formalParameter.prevParameter;
  5840. END;
  5841. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5842. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5843. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5844. END;
  5845. ELSE
  5846. hasDynamicOperands := FALSE;
  5847. formalParameter := procedureType.firstParameter;
  5848. FOR i := 0 TO parameters.Length() - 1 DO
  5849. actualParameter := parameters.GetExpression(i);
  5850. PrepareParameter(actualParameter, formalParameter);
  5851. IF formalParameter # NIL THEN (* TENTATIVE *)
  5852. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5853. ASSERT(i < 2);
  5854. hasDynamicOperands := TRUE;
  5855. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5856. ELSE
  5857. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5858. END;
  5859. formalParameter := formalParameter.nextParameter;
  5860. END;
  5861. END;
  5862. END;
  5863. IF symbol IS SyntaxTree.Procedure THEN
  5864. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5865. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5866. Emit(Push(position,reg));
  5867. ReleaseIntermediateOperand(reg);
  5868. END;
  5869. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5870. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5871. parametersSize := ParametersSize(system,procedureType, FALSE);
  5872. END;
  5873. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5874. (*
  5875. dynamic operator overloading:
  5876. first push parameters, regularly:
  5877. [self]
  5878. par1
  5879. par2
  5880. then push parameters for GetOperator
  5881. identifier
  5882. ptr1
  5883. tag
  5884. ptr2
  5885. tag
  5886. call GetOperatorRuntimeProc
  5887. call Operator
  5888. *)
  5889. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5890. (* push ID *)
  5891. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5892. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5893. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5894. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5895. formalParameter := procedureType.firstParameter;
  5896. FOR i := 0 TO parameters.Length() - 1 DO
  5897. IF formalParameter.access # SyntaxTree.Hidden THEN
  5898. ASSERT(i < 2);
  5899. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5900. (* push pointer *)
  5901. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5902. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5903. (* add dereference *)
  5904. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5905. (*! better: do refer to stack above than using parameter backups !!*)
  5906. ReleaseIntermediateOperand(parameterBackups[i]);
  5907. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5908. END;
  5909. Emit(Push(position,parameterBackups[i]));
  5910. ReleaseIntermediateOperand(parameterBackups[i]);
  5911. (* push typetag *)
  5912. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5913. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5914. arg := TypeDescriptorAdr(recordType);
  5915. Emit(Push(position,arg));
  5916. ELSE
  5917. (* push 'NonPointer' *)
  5918. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5919. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5920. (* push fingerprint *)
  5921. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5922. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5923. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5924. END
  5925. END;
  5926. formalParameter := formalParameter.nextParameter
  5927. END;
  5928. (* for unary operators: complete the information for the second parameter *)
  5929. IF procedureType.numberParameters < 2 THEN
  5930. (* push 'NonPointer' *)
  5931. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5932. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5933. (* push 'NoType' *)
  5934. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5935. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5936. END;
  5937. (* call operator selection procedure *)
  5938. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5939. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5940. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5941. ReleaseOperand(operatorSelectionProcedureOperand);
  5942. (* use the address that the operator selection procedure returned as the target address of the call *)
  5943. InitOperand(operand, ModeValue);
  5944. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5945. Emit(Result(position,operand.op))
  5946. END
  5947. END;
  5948. ReleaseParameterRegisters();
  5949. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5950. SaveRegisters();ReleaseUsedRegisters(saved2);
  5951. CallThis(position,"Objects","LeaveA2",0);
  5952. RestoreRegisters(saved2);
  5953. END;
  5954. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5955. Emit(Call(position,operand.op,0));
  5956. ELSE
  5957. Emit(Call(position,operand.op,parametersSize));
  5958. END;
  5959. ReleaseOperand(operand);
  5960. IF procedureType.noReturn THEN
  5961. EmitTrap(position,NoReturnTrap);
  5962. END;
  5963. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5964. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5965. Emit(Result(position,return));
  5966. END;
  5967. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5968. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5969. Emit(Push(position, return));
  5970. CallThis(position,"Objects","ReenterA2",0);
  5971. Emit(Pop(position, return));
  5972. ELSE
  5973. CallThis(position,"Objects","ReenterA2",0);
  5974. END;
  5975. END;
  5976. (* === return parameter space === *)
  5977. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5978. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5979. (* cleanup all space for all parameters *)
  5980. IF parametersSize < 32 THEN
  5981. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5982. parametersSize := 32
  5983. END;
  5984. size := IntermediateCode.Immediate(addressType,parametersSize);
  5985. Emit(Add(position,sp,sp,size))
  5986. END;
  5987. IF (callingConvention IN SysvABI) THEN
  5988. IF parameterRegisters > 0 THEN
  5989. IF parameters.Length() > parameterRegisters THEN
  5990. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5991. ELSE
  5992. parametersSize := 0
  5993. END;
  5994. ELSE
  5995. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5996. INC( parametersSize, (-parametersSize) MOD 16 )
  5997. END;
  5998. IF parametersSize > 0 THEN
  5999. size := IntermediateCode.Immediate(addressType,parametersSize);
  6000. Emit(Add(position,sp,sp,size))
  6001. END;
  6002. END;
  6003. IF alignment > 1 THEN
  6004. Emit(Pop(position,sp));
  6005. END;
  6006. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  6007. Emit(Pop(position, ap));
  6008. END;
  6009. IF firstWriteBackCall # NIL THEN
  6010. SaveRegisters(); ReleaseUsedRegisters(saved2);
  6011. (* perform all write-back calls in the list *)
  6012. currentWriteBackCall := firstWriteBackCall;
  6013. WHILE currentWriteBackCall # NIL DO
  6014. VisitProcedureCallDesignator(currentWriteBackCall.call);
  6015. currentWriteBackCall := currentWriteBackCall.next
  6016. END;
  6017. RestoreRegisters(saved2);
  6018. END;
  6019. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  6020. IF structuredReturnType THEN
  6021. RestoreRegisters(saved);
  6022. InitOperand(result,ModeReference);
  6023. Symbol(variable,result);
  6024. ELSE
  6025. RestoreRegisters(saved);
  6026. InitOperand(result,ModeValue);
  6027. result.op := return;
  6028. END;
  6029. END;
  6030. destination := dest;
  6031. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  6032. END VisitProcedureCallDesignator;
  6033. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  6034. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  6035. td: SyntaxTree.Symbol;
  6036. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  6037. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6038. BEGIN
  6039. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6040. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6041. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6042. variable.SetType(system.anyType);
  6043. scope.AddVariable(variable);
  6044. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6045. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  6046. typeDeclaration.SetDeclaredType(hiddenPointerType);
  6047. typeDeclaration.SetScope(module.module.moduleScope);
  6048. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  6049. hiddenPointerType.SetState(SyntaxTree.Resolved);
  6050. END;
  6051. RETURN hiddenPointerType;
  6052. END GetHiddenPointerType;
  6053. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  6054. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6055. BEGIN
  6056. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6057. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6058. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  6059. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  6060. scope.AddVariable(variable);
  6061. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6062. variable.SetType(system.anyType);
  6063. scope.AddVariable(variable);
  6064. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6065. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  6066. typeDeclaration.SetDeclaredType(delegatePointerType);
  6067. typeDeclaration.SetScope(module.module.moduleScope);
  6068. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  6069. delegatePointerType.SetState(SyntaxTree.Resolved);
  6070. END;
  6071. RETURN delegatePointerType
  6072. END GetDelegateType;
  6073. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  6074. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  6075. such as in VAR a: RECORD ... END;
  6076. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  6077. and variables, constants and procedures the same mechanism can be used for fixups etc.
  6078. *)
  6079. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  6080. baseRecord: SyntaxTree.RecordType;
  6081. BEGIN (* no code emission *)
  6082. source := NIL;
  6083. x := x.resolved;
  6084. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  6085. x := GetHiddenPointerType();
  6086. ELSIF IsDelegate(x) THEN
  6087. x := GetDelegateType();
  6088. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  6089. ELSE HALT(200);
  6090. END;
  6091. td := x.typeDeclaration;
  6092. IF td = NIL THEN
  6093. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  6094. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  6095. ASSERT(td # NIL);
  6096. END;
  6097. GetCodeSectionNameForSymbol(td,name);
  6098. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  6099. meta.CheckTypeDeclaration(x);
  6100. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  6101. ELSE
  6102. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  6103. END;
  6104. IF backend.cooperative OR meta.simple THEN
  6105. offset := 0;
  6106. ELSE
  6107. IF x IS SyntaxTree.CellType THEN
  6108. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  6109. IF baseRecord = NIL THEN
  6110. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  6111. ELSE
  6112. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  6113. END;
  6114. ELSE
  6115. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  6116. END;
  6117. END;
  6118. RETURN td
  6119. END GetBackendType;
  6120. BEGIN
  6121. (*td := t.typeDeclaration;*)
  6122. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  6123. (*
  6124. IF t IS SyntaxTree.PointerType THEN
  6125. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  6126. ELSE
  6127. source := GetBackendType(t);
  6128. END;
  6129. *)
  6130. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  6131. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  6132. IntermediateCode.SetOffset(res,offset);
  6133. (*
  6134. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  6135. make memory should be used when tag is used, not earlier
  6136. *)
  6137. RETURN res
  6138. END TypeDescriptorAdr;
  6139. (*
  6140. PROCEDURE MakeTypeTag(VAR operand: Operand);
  6141. VAR result: IntermediateCode.Operand;
  6142. BEGIN
  6143. IF operand.tag.mode = IntermediateCode.Undefined THEN
  6144. operand.tag := TypeDescriptorAdr(operand.type);
  6145. IntermediateCode.MakeMemory(operand.tag,addressType);
  6146. UseIntermediateOperand(operand.tag);
  6147. END;
  6148. END MakeTypeTag;
  6149. *)
  6150. PROCEDURE ProfilerInit;
  6151. VAR reg: IntermediateCode.Operand;
  6152. BEGIN
  6153. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  6154. Emit(Call(position,reg,0));
  6155. END ProfilerInit;
  6156. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  6157. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  6158. BEGIN
  6159. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  6160. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  6161. THEN
  6162. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6163. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6164. Emit(Push(position,reg));
  6165. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6166. Emit(Push(position,reg));
  6167. StaticCallOperand(result,procedure);
  6168. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6169. ReleaseOperand(result);
  6170. END;
  6171. END ProfilerEnterExit;
  6172. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  6173. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  6174. BEGIN
  6175. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  6176. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6177. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6178. profileInit.Emit(Push(position,reg));
  6179. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6180. profileInit.Emit(Push(position,reg));
  6181. NEW(string, LEN(name)); COPY(name, string^);
  6182. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6183. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6184. sv.SetType(type);
  6185. Designate(sv,result);
  6186. profileInit.Emit(Push(position,result.tag));
  6187. profileInit.Emit(Push(position,result.op));
  6188. StaticCallOperand(result,procedure);
  6189. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6190. ReleaseOperand(result);
  6191. END;
  6192. END ProfilerAddProcedure;
  6193. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  6194. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  6195. BEGIN
  6196. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  6197. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6198. profileInit.Emit(Push(position,reg));
  6199. profileInitPatchPosition := profileInit.pc;
  6200. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  6201. NEW(string, LEN(name)); COPY(name, string^);
  6202. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  6203. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6204. sv.SetType(type);
  6205. Designate(sv,result);
  6206. profileInit.Emit(Push(position,result.tag));
  6207. profileInit.Emit(Push(position,result.op));
  6208. StaticCallOperand(result,procedure);
  6209. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6210. ReleaseOperand(result);
  6211. END;
  6212. END ProfilerAddModule;
  6213. PROCEDURE ProfilerPatchInit;
  6214. VAR reg: IntermediateCode.Operand;
  6215. BEGIN
  6216. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  6217. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  6218. EmitLeave(profileInit,position,NIL,0);
  6219. profileInit.Emit(Exit(position,0,0,0));
  6220. END ProfilerPatchInit;
  6221. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  6222. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  6223. VAR
  6224. id: LONGINT;
  6225. leftType, rightType: SyntaxTree.Type;
  6226. procedureType: SyntaxTree.ProcedureType;
  6227. runtimeProcedure: SyntaxTree.Procedure;
  6228. runtimeProcedureOperand, operatorOperand: Operand;
  6229. kind: SET;
  6230. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  6231. VAR
  6232. arg: IntermediateCode.Operand;
  6233. recordType: SyntaxTree.RecordType;
  6234. fingerPrint: SyntaxTree.FingerPrint;
  6235. BEGIN
  6236. IF type = NIL THEN
  6237. (* no type: push 'NoType' *)
  6238. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6239. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  6240. ELSIF IsStrictlyPointerToRecord(type) THEN
  6241. (* pointer to record type: push typetag *)
  6242. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6243. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6244. arg := TypeDescriptorAdr(recordType);
  6245. ELSE
  6246. (* non-pointer to record type: push fingerprint *)
  6247. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6248. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  6249. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  6250. END;
  6251. operatorInitializationCodeSection.Emit(Push(position,arg))
  6252. END PushTypeInfo;
  6253. BEGIN
  6254. ASSERT(operatorInitializationCodeSection # NIL);
  6255. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  6256. procedureType := operator.type(SyntaxTree.ProcedureType);
  6257. (* determine types *)
  6258. leftType := procedureType.firstParameter.type;
  6259. IF procedureType.numberParameters = 2 THEN
  6260. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  6261. rightType := procedureType.firstParameter.nextParameter.type;
  6262. ELSE
  6263. rightType := NIL
  6264. END;
  6265. (* determine operator kind *)
  6266. IF IsStrictlyPointerToRecord(leftType) THEN
  6267. kind := {LhsIsPointer}
  6268. ELSE
  6269. kind := {}
  6270. END;
  6271. IF IsStrictlyPointerToRecord(rightType) THEN
  6272. kind := kind + {RhsIsPointer}
  6273. END;
  6274. IF kind # {} THEN (* TODO: to be removed later on *)
  6275. (* at least one of the types is a pointer to record *)
  6276. (* emit a code that registers this specific operator in the runtime *)
  6277. dump := operatorInitializationCodeSection.comments;
  6278. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6279. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  6280. (* push ID *)
  6281. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6282. id := Global.GetSymbol(module.module.case, operator.name);
  6283. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  6284. (* push kind *)
  6285. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6286. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  6287. (* push type infos *)
  6288. PushTypeInfo(leftType);
  6289. PushTypeInfo(rightType);
  6290. (* push operator address *)
  6291. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6292. StaticCallOperand(operatorOperand, operator);
  6293. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  6294. ReleaseOperand(operatorOperand);
  6295. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  6296. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  6297. ReleaseOperand(runtimeProcedureOperand)
  6298. END
  6299. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  6300. END
  6301. END RegisterDynamicOperator;
  6302. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  6303. VAR
  6304. traceModule: SyntaxTree.Module;
  6305. procedure: SyntaxTree.Procedure;
  6306. procedureVariable: SyntaxTree.Variable;
  6307. s,msg: Basic.MessageString;
  6308. res: Operand;
  6309. i: LONGINT;
  6310. sv: SyntaxTree.StringValue;
  6311. type: SyntaxTree.Type;
  6312. recordType: SyntaxTree.RecordType;
  6313. printout: Printout.Printer;
  6314. stringWriter: Streams.StringWriter;
  6315. expression: SyntaxTree.Expression;
  6316. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  6317. BEGIN
  6318. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  6319. IF procedure = NIL THEN
  6320. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  6321. END;
  6322. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  6323. s := "procedure ";
  6324. Strings.Append(s,backend.traceModuleName);
  6325. Strings.Append(s,".");
  6326. Strings.Append(s,procedureName);
  6327. Strings.Append(s," not present");
  6328. Error(position,s);
  6329. RETURN FALSE
  6330. ELSE
  6331. RETURN TRUE
  6332. END;
  6333. END GetProcedure;
  6334. PROCEDURE CallProcedure;
  6335. VAR size: LONGINT;
  6336. BEGIN
  6337. IF procedure # NIL THEN
  6338. StaticCallOperand(result,procedure);
  6339. size := ProcParametersSize(procedure);
  6340. ELSE
  6341. Symbol(procedureVariable, result);
  6342. LoadValue(result, procedureVariable.type.resolved);
  6343. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6344. END;
  6345. Emit(Call(position,result.op,size));
  6346. END CallProcedure;
  6347. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6348. VAR res: Operand; string: SyntaxTree.String;
  6349. BEGIN
  6350. IF GetProcedure("String") THEN
  6351. NEW(string, LEN(s)); COPY(s, string^);
  6352. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6353. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6354. sv.SetType(type);
  6355. Designate(sv,res);
  6356. Emit(Push(position,res.tag));
  6357. Emit(Push(position,res.op));
  6358. ReleaseOperand(res);
  6359. CallProcedure;
  6360. END;
  6361. END String;
  6362. PROCEDURE Integer(op: IntermediateCode.Operand);
  6363. BEGIN
  6364. IF GetProcedure("Int") THEN
  6365. Emit(Push(position,op));
  6366. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6367. CallProcedure;
  6368. END;
  6369. END Integer;
  6370. PROCEDURE Float(op: IntermediateCode.Operand);
  6371. BEGIN
  6372. IF GetProcedure("HIntHex") THEN
  6373. Emit(Push(position,op));
  6374. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6375. CallProcedure;
  6376. END;
  6377. END Float;
  6378. PROCEDURE Set(op: IntermediateCode.Operand);
  6379. BEGIN
  6380. IF GetProcedure("Set") THEN
  6381. Emit(Push(position,op));
  6382. (*
  6383. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6384. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6385. *)
  6386. CallProcedure;
  6387. END;
  6388. END Set;
  6389. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6390. BEGIN
  6391. IF GetProcedure("Boolean") THEN
  6392. Emit(Push(position,op));
  6393. CallProcedure;
  6394. END;
  6395. END Boolean;
  6396. PROCEDURE Char(op: IntermediateCode.Operand);
  6397. BEGIN
  6398. IF GetProcedure("Char") THEN
  6399. Emit(Push(position,op));
  6400. CallProcedure;
  6401. END;
  6402. END Char;
  6403. PROCEDURE Address(op: IntermediateCode.Operand);
  6404. BEGIN
  6405. IF GetProcedure("Address") THEN
  6406. Emit(Push(position,op));
  6407. CallProcedure;
  6408. END;
  6409. END Address;
  6410. PROCEDURE Size(op: IntermediateCode.Operand);
  6411. BEGIN
  6412. IF GetProcedure("Size") THEN
  6413. Emit(Push(position,op));
  6414. CallProcedure;
  6415. END;
  6416. END Size;
  6417. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6418. VAR len: IntermediateCode.Operand;
  6419. BEGIN
  6420. IF GetProcedure("String") THEN
  6421. len := GetArrayLength(type, op.tag);
  6422. Emit(Push(position,len));
  6423. ReleaseIntermediateOperand(len);
  6424. Emit(Push(position,op.op));
  6425. CallProcedure;
  6426. END;
  6427. END StringOperand;
  6428. PROCEDURE Ln;
  6429. BEGIN
  6430. IF GetProcedure("Ln") THEN
  6431. CallProcedure;
  6432. END;
  6433. END Ln;
  6434. BEGIN
  6435. IF backend.traceModuleName = "" THEN RETURN END;
  6436. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6437. IF GetProcedure("Enter") THEN
  6438. CallProcedure
  6439. END;
  6440. NEW(stringWriter,LEN(s));
  6441. FOR i := 0 TO x.Length()-1 DO
  6442. msg := "";
  6443. expression := x.GetExpression(i);
  6444. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6445. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6446. ELSE
  6447. Global.GetModuleName(module.module, s);
  6448. END;
  6449. IF i = 0 THEN
  6450. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6451. stringWriter.String(":");
  6452. END;
  6453. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6454. IF ~(expression IS SyntaxTree.StringValue) THEN
  6455. printout.Expression(expression);
  6456. stringWriter.Get(s);
  6457. Strings.Append(msg,s);
  6458. Strings.Append(msg,"= ");
  6459. ELSE stringWriter.Get(s); (* remove from string writer *)
  6460. Strings.Append(msg, s);
  6461. END;
  6462. String(msg);
  6463. IF SemanticChecker.IsStringType(expression.type) THEN
  6464. Designate(expression,res);
  6465. StringOperand(res, expression.type);
  6466. ELSE
  6467. Evaluate(expression,res);
  6468. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6469. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6470. Convert(res.op,int64);
  6471. END;
  6472. Integer(res.op);
  6473. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6474. Boolean(res.op);
  6475. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6476. Set(res.op);
  6477. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6478. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6479. Convert(res.op,float64);
  6480. END;
  6481. Float(res.op);
  6482. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6483. Char(res.op);
  6484. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6485. Address(res.op);String("H");
  6486. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6487. Size(res.op);
  6488. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6489. Address(res.op);String("H");
  6490. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6491. Address(res.op);String("H");
  6492. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6493. String("NIL");
  6494. ELSE HALT(200);
  6495. END;
  6496. END;
  6497. ReleaseOperand(res);
  6498. String("; ");
  6499. END;
  6500. IF GetProcedure("Exit") THEN
  6501. CallProcedure
  6502. ELSE
  6503. Ln;
  6504. END;
  6505. END;
  6506. END SystemTrace;
  6507. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6508. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6509. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6510. BEGIN
  6511. type := type.resolved;
  6512. IF type IS SyntaxTree.RecordType THEN
  6513. WITH type: SyntaxTree.RecordType DO
  6514. baseType := type.baseType;
  6515. IF baseType # NIL THEN
  6516. baseType := baseType.resolved;
  6517. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6518. InitFields(baseType,adr,offset);
  6519. END;
  6520. variable := type.recordScope.firstVariable;
  6521. WHILE variable # NIL DO
  6522. IF variable.initializer # NIL THEN
  6523. Evaluate(variable.initializer,initializerOp);
  6524. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6525. Emit(Mov(position,mem,initializerOp.op));
  6526. ReleaseOperand(initializerOp);
  6527. ReleaseIntermediateOperand(mem);
  6528. END;
  6529. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6530. variable := variable.nextVariable
  6531. END;
  6532. END;
  6533. ELSIF type IS SyntaxTree.CellType THEN
  6534. WITH type: SyntaxTree.CellType DO
  6535. baseType := type.baseType;
  6536. IF baseType # NIL THEN
  6537. baseType := baseType.resolved;
  6538. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6539. InitFields(baseType,adr,offset);
  6540. END;
  6541. variable := type.cellScope.firstVariable;
  6542. WHILE variable # NIL DO
  6543. IF variable.initializer # NIL THEN
  6544. Evaluate(variable.initializer,initializerOp);
  6545. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6546. Emit(Mov(position,mem,initializerOp.op));
  6547. ReleaseOperand(initializerOp);
  6548. ReleaseIntermediateOperand(mem);
  6549. END;
  6550. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6551. variable := variable.nextVariable
  6552. END;
  6553. END;
  6554. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6555. WITH type: SyntaxTree.ArrayType DO
  6556. IF type.form = SyntaxTree.Static THEN
  6557. baseType := type.arrayBase;
  6558. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6559. FOR i := 0 TO type.staticLength-1 DO
  6560. InitFields(baseType,adr,offset+i*size);
  6561. END;
  6562. END;
  6563. END;
  6564. ELSIF type IS SyntaxTree.MathArrayType THEN
  6565. WITH type: SyntaxTree.MathArrayType DO
  6566. IF type.form = SyntaxTree.Open THEN
  6567. dim := DynamicDim(type);
  6568. imm := IntermediateCode.Immediate(addressType,dim);
  6569. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6570. baseType := SemanticChecker.ArrayBase(type,dim);
  6571. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6572. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6573. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6574. ReleaseIntermediateOperand(imm);
  6575. (* flags remain empty (=0) for open array *)
  6576. ELSIF type.form = SyntaxTree.Static THEN
  6577. baseType := type.arrayBase;
  6578. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6579. ASSERT(type.staticLength < 1024*1024*1024);
  6580. FOR i := 0 TO type.staticLength-1 DO
  6581. InitFields(baseType,adr,offset+i*size);
  6582. END;
  6583. END;
  6584. END;
  6585. END;
  6586. END InitFields;
  6587. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6588. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6589. saved: RegisterEntry;
  6590. BEGIN
  6591. type := variable.type.resolved;
  6592. IF (type IS SyntaxTree.MathArrayType) THEN
  6593. WITH type: SyntaxTree.MathArrayType DO
  6594. IF type.form = SyntaxTree.Open THEN
  6595. Symbol(variable,operand);
  6596. InitFields(type, operand.tag,0);
  6597. IF temporary THEN
  6598. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6599. END;
  6600. ELSIF type.form = SyntaxTree.Tensor THEN
  6601. IF temporary & backend.writeBarriers THEN
  6602. SaveRegisters();ReleaseUsedRegisters(saved);
  6603. Symbol(variable, operand);
  6604. Emit(Push(position,operand.op));
  6605. ReleaseOperand(operand);
  6606. Emit(Push(position,nil));
  6607. CallThis(position,"FoxArrayBase","Assign",2);
  6608. RestoreRegisters(saved);
  6609. ELSE
  6610. Symbol(variable, operand);
  6611. MakeMemory(tmp,operand.op,addressType,0);
  6612. ReleaseOperand(operand);
  6613. IF FALSE & temporary THEN
  6614. (* trick -- temporary object from array base *)
  6615. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6616. Symbol(symbol,operand);
  6617. MakeMemory(mem,operand.op,addressType,0);
  6618. ReleaseOperand(operand);
  6619. Emit(Mov(position,tmp, mem) );
  6620. ReleaseOperand(operand);
  6621. ELSE
  6622. Emit(Mov(position,tmp, nil ) );
  6623. END;
  6624. ReleaseIntermediateOperand(tmp)
  6625. END;
  6626. END;
  6627. END;
  6628. ELSE
  6629. Symbol(variable,operand);
  6630. IF variable.initializer # NIL THEN
  6631. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6632. reference.SetType(variable.type.resolved);
  6633. reference.SetAssignable(TRUE);
  6634. Assign(reference,variable.initializer);
  6635. ELSIF temporary THEN
  6636. IF SemanticChecker.IsPointerType(variable.type) THEN
  6637. IF backend.cooperative THEN
  6638. SaveRegisters();ReleaseUsedRegisters(saved);
  6639. Symbol(variable, operand);
  6640. CallAssignPointer(operand.op, nil);
  6641. ReleaseOperand(operand);
  6642. RestoreRegisters(saved);
  6643. ELSIF backend.writeBarriers THEN
  6644. SaveRegisters();ReleaseUsedRegisters(saved);
  6645. Symbol(variable, operand);
  6646. Emit(Push(position,operand.op));
  6647. ReleaseOperand(operand);
  6648. Emit(Push(position,nil));
  6649. CallThis(position,"Heaps","Assign",2);
  6650. RestoreRegisters(saved);
  6651. ELSE
  6652. Symbol(variable, operand);
  6653. MakeMemory(tmp,operand.op,addressType,0);
  6654. ReleaseOperand(operand);
  6655. Emit(Mov(position,tmp, nil ) );
  6656. ReleaseIntermediateOperand(tmp);
  6657. END;
  6658. END;
  6659. END;
  6660. InitFields(type, operand.op,0);
  6661. ReleaseOperand(operand);
  6662. END;
  6663. END InitVariable;
  6664. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6665. VAR end: Label;
  6666. BEGIN
  6667. IF type.form = SyntaxTree.Tensor THEN
  6668. InitOperand(result,ModeValue);
  6669. ReuseCopy(result.op,base);
  6670. end := NewLabel();
  6671. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6672. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6673. SetLabel(end);
  6674. Convert(result.op,lenType);
  6675. ELSE
  6676. InitOperand(result,ModeValue);
  6677. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6678. END
  6679. END MathArrayDim;
  6680. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6681. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6682. BEGIN
  6683. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6684. MakeMemory(mem,base,addressType,offset);
  6685. Emit(Mov(position,mem,value));
  6686. ReleaseIntermediateOperand(mem);
  6687. END PutMathArrayField;
  6688. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6689. VAR mem: IntermediateCode.Operand;
  6690. BEGIN
  6691. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6692. MakeMemory(mem,base,addressType,offset);
  6693. Emit(Mov(position,mem,value));
  6694. ReleaseIntermediateOperand(mem);
  6695. END PutMathArrayFieldOffset;
  6696. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6697. BEGIN
  6698. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6699. MakeMemory(value,base,addressType,offset);
  6700. END GetMathArrayField;
  6701. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6702. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6703. BEGIN
  6704. IF incr THEN
  6705. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6706. ELSE
  6707. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6708. END;
  6709. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6710. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6711. ELSE
  6712. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6713. Emit(Mov(position,reg,dim));
  6714. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6715. Emit(Add(position,reg,reg,base));
  6716. MakeMemory(mem, reg, addressType, offset);
  6717. ReleaseIntermediateOperand(reg);
  6718. Emit(Mov(position,mem,value));
  6719. ReleaseIntermediateOperand(mem);
  6720. END;
  6721. END PutMathArrayLenOrIncr;
  6722. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6723. BEGIN
  6724. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6725. END PutMathArrayLength;
  6726. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6727. BEGIN
  6728. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6729. END PutMathArrayIncrement;
  6730. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6731. BEGIN
  6732. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6733. END GetMathArrayIncrement;
  6734. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6735. BEGIN
  6736. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6737. END GetMathArrayLength;
  6738. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6739. VAR dimOp: IntermediateCode.Operand;
  6740. BEGIN
  6741. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6742. GetMathArrayLength(type, operand, dimOp, check, result);
  6743. END GetMathArrayLengthAt;
  6744. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6745. VAR dimOp: IntermediateCode.Operand;
  6746. BEGIN
  6747. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6748. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6749. END GetMathArrayIncrementAt;
  6750. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6751. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6752. offset: LONGINT;
  6753. BEGIN
  6754. IF increment THEN
  6755. offset := MathIncrOffset;
  6756. ELSE
  6757. offset := MathLenOffset;
  6758. END;
  6759. INC(offset,operand.dimOffset*2);
  6760. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6761. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6762. END;
  6763. (* static dimension *)
  6764. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6765. IF check & (type.form = SyntaxTree.Tensor) THEN
  6766. DimensionCheck(operand.tag,dim,BrltL);
  6767. END;
  6768. val := SHORT(dim.intValue);
  6769. IF type.form # SyntaxTree.Tensor THEN
  6770. t := SemanticChecker.ArrayBase(type,val);
  6771. type := t.resolved(SyntaxTree.MathArrayType);
  6772. IF type.form = SyntaxTree.Static THEN
  6773. IF increment THEN
  6774. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6775. ELSE
  6776. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6777. END;
  6778. InitOperand(result,ModeValue);
  6779. result.op := res;
  6780. RETURN;
  6781. END;
  6782. END;
  6783. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6784. MakeMemory(res,operand.tag,addressType,offset);
  6785. (*
  6786. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6787. *)
  6788. InitOperand(result,ModeValue);
  6789. result.op := res;
  6790. ELSE
  6791. Convert(dim,addressType);
  6792. IF check THEN
  6793. IF type.form = SyntaxTree.Tensor THEN
  6794. DimensionCheck(operand.tag,dim,BrltL);
  6795. ELSIF isUnchecked THEN (* do nothing *)
  6796. ELSE
  6797. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6798. END;
  6799. END;
  6800. end := NewLabel(); next := NIL;
  6801. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6802. Emit(Mov(position,res,dim));
  6803. Convert(res,sizeType);
  6804. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6805. WHILE t IS SyntaxTree.MathArrayType DO
  6806. type := t(SyntaxTree.MathArrayType);
  6807. IF type.form = SyntaxTree.Static THEN
  6808. imm := IntermediateCode.Immediate(sizeType,val);
  6809. next := NewLabel();
  6810. BrneL(next,imm,res);
  6811. IF increment THEN
  6812. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6813. ELSE
  6814. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6815. END;
  6816. Emit(MovReplace(position,res,imm));
  6817. BrL(end);
  6818. ELSE hasDynamicPart := TRUE;
  6819. END;
  6820. t := type.arrayBase.resolved;
  6821. val := val + 1;
  6822. IF next # NIL THEN SetLabel(next) END;
  6823. END;
  6824. IF hasDynamicPart THEN
  6825. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6826. Emit(Mov(position,res2,dim));
  6827. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6828. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6829. Emit(Add(position,res2,res2,imm));
  6830. Emit(Add(position,res2,res2,operand.tag));
  6831. IntermediateCode.MakeMemory(res2,sizeType);
  6832. Emit(MovReplace(position,res,res2));
  6833. ReleaseIntermediateOperand(res2);
  6834. END;
  6835. SetLabel(end);
  6836. Convert(res,sizeType);
  6837. InitOperand(result,ModeValue);
  6838. result.op := res;
  6839. END;
  6840. END MathArrayLenOrIncr;
  6841. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6842. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6843. offset: LONGINT;
  6844. BEGIN
  6845. offset := operand.dimOffset+DynamicDim(type)-1;
  6846. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6847. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6848. val := SHORT(dim.intValue);
  6849. t := SemanticChecker.ArrayBase(type,val);
  6850. type := t.resolved(SyntaxTree.ArrayType);
  6851. IF type.form = SyntaxTree.Static THEN
  6852. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6853. ELSE
  6854. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6855. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6856. END;
  6857. UseIntermediateOperand(res);
  6858. InitOperand(result,ModeValue);
  6859. result.op := res;
  6860. ELSE
  6861. Convert(dim,addressType);
  6862. IF ~isUnchecked THEN
  6863. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6864. END;
  6865. end := NewLabel(); next := NIL;
  6866. (* ReuseCopy(dim,res); *)
  6867. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6868. Emit(Mov(position,res,dim));
  6869. Convert(res,sizeType);
  6870. Convert(res,sizeType);
  6871. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6872. WHILE t IS SyntaxTree.ArrayType DO
  6873. type := t(SyntaxTree.ArrayType);
  6874. IF type.form = SyntaxTree.Static THEN
  6875. imm := IntermediateCode.Immediate(sizeType,val);
  6876. next := NewLabel();
  6877. BrneL(next,imm,res);
  6878. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6879. Emit(MovReplace(position,res,imm));
  6880. BrL(end);
  6881. ELSE hasDynamicPart := TRUE;
  6882. END;
  6883. t := type.arrayBase.resolved;
  6884. val := val + 1;
  6885. IF next # NIL THEN SetLabel(next) END;
  6886. END;
  6887. IF hasDynamicPart THEN
  6888. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6889. Convert(res2,addressType);
  6890. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6891. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6892. Emit(Sub(position,res2,imm,res2));
  6893. Emit(Add(position,res2,res2,operand.tag));
  6894. IntermediateCode.MakeMemory(res2,sizeType);
  6895. Emit(MovReplace(position,res,res2));
  6896. ReleaseIntermediateOperand(res2);
  6897. END;
  6898. SetLabel(end);
  6899. Convert(res,sizeType);
  6900. InitOperand(result,ModeValue);
  6901. result.op := res;
  6902. END;
  6903. END ArrayLen;
  6904. (**
  6905. create a temporary variable in current scope
  6906. **)
  6907. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6908. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6909. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6910. BEGIN
  6911. IF ~register THEN
  6912. v := temporaries.GetFreeVariable(type, untraced, index);
  6913. ELSE
  6914. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6915. END;
  6916. scope := currentScope;
  6917. (*
  6918. v := NIL; (* disable free variable managemenet for the time being *)
  6919. *)
  6920. name := temporaries.GetUID();
  6921. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6922. variable.SetType(type);
  6923. variable.SetAccess(SyntaxTree.Hidden);
  6924. variable.SetUntraced(untraced);
  6925. IF v = NIL THEN
  6926. temporaries.AddVariable(variable);
  6927. IF ~register THEN
  6928. IF scope.lastVariable # NIL THEN
  6929. offset := scope.lastVariable.offsetInBits;
  6930. ELSE
  6931. offset := 0;
  6932. END;
  6933. DEC(offset,system.SizeOf(variable.type));
  6934. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6935. variable(SyntaxTree.Variable).SetOffset(offset);
  6936. scope.AddVariable(variable(SyntaxTree.Variable));
  6937. scope.EnterSymbol(variable, duplicate);
  6938. ASSERT(~duplicate);
  6939. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6940. ELSE
  6941. variable.SetUseRegister(TRUE);
  6942. variable(SyntaxTree.Variable).SetOffset(0);
  6943. END;
  6944. ELSE (* v # NIL *)
  6945. (* reuse slot for new variable, do not create new slot ! *)
  6946. temporaries.SetVariable(index, variable);
  6947. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6948. ASSERT(~register);
  6949. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6950. ASSERT(v.offsetInBits # 0);
  6951. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6952. scope.EnterSymbol(variable, duplicate);
  6953. ASSERT(~duplicate);
  6954. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6955. END;
  6956. RETURN variable(SyntaxTree.Variable)
  6957. END GetTemporaryVariable;
  6958. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6959. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6960. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6961. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6962. i: LONGINT; duplicate: BOOLEAN;
  6963. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6964. VAR variable: SyntaxTree.Variable;
  6965. BEGIN
  6966. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6967. variable.SetType(type);
  6968. recordScope.AddVariable(variable);
  6969. END AddVariable;
  6970. BEGIN
  6971. name := "@ArrayDescriptor";
  6972. Basic.AppendNumber(name,dimensions);
  6973. identifier := SyntaxTree.NewIdentifier(name);
  6974. parentScope := module.module.moduleScope;
  6975. symbol := parentScope.FindSymbol(identifier);
  6976. IF symbol # NIL THEN
  6977. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6978. type := typeDeclaration.declaredType;
  6979. ELSE
  6980. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6981. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6982. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6983. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6984. recordType.SetTypeDeclaration(typeDeclaration);
  6985. recordType.SetState(SyntaxTree.Resolved);
  6986. typeDeclaration.SetDeclaredType(recordType);
  6987. AddVariable("@ptr",system.anyType);
  6988. AddVariable("@adr",system.addressType);
  6989. AddVariable("@flags",system.addressType);
  6990. AddVariable("@dim",system.addressType);
  6991. AddVariable("@elementSize",system.addressType);
  6992. FOR i := 0 TO dimensions-1 DO
  6993. name := "@len";
  6994. Basic.AppendNumber(name,i);
  6995. AddVariable(name,system.addressType);
  6996. name := "@incr";
  6997. Basic.AppendNumber(name,i);
  6998. AddVariable(name,system.addressType);
  6999. END;
  7000. parentScope.AddTypeDeclaration(typeDeclaration);
  7001. parentScope.EnterSymbol(typeDeclaration,duplicate);
  7002. ASSERT(~duplicate);
  7003. type := recordType;
  7004. END;
  7005. RETURN type
  7006. END GetMathArrayDescriptorType;
  7007. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  7008. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  7009. BEGIN
  7010. NEW(string, LEN(s)); COPY(s, string^);
  7011. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  7012. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  7013. sv.SetType(type);
  7014. Designate(sv,res);
  7015. Emit(Push(position,res.tag));
  7016. Emit(Push(position,res.op));
  7017. ReleaseOperand(res);
  7018. END PushConstString;
  7019. PROCEDURE PushConstBoolean(b: BOOLEAN);
  7020. BEGIN
  7021. IF b THEN
  7022. Emit(Push(Basic.invalidPosition, true));
  7023. ELSE
  7024. Emit(Push(Basic.invalidPosition, false));
  7025. END;
  7026. END PushConstBoolean;
  7027. PROCEDURE PushConstSet(v: SET);
  7028. VAR value: SyntaxTree.Value; op: Operand;
  7029. BEGIN
  7030. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  7031. value.SetType(system.setType);
  7032. Evaluate(value, op);
  7033. Emit(Push(Basic.invalidPosition, op.op));
  7034. ReleaseOperand(op);
  7035. END PushConstSet;
  7036. PROCEDURE PushConstInteger(v: LONGINT);
  7037. VAR value: SyntaxTree.Value; op: Operand;
  7038. BEGIN
  7039. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  7040. value.SetType(system.longintType);
  7041. Evaluate(value, op);
  7042. Emit(Push(Basic.invalidPosition, op.op));
  7043. ReleaseOperand(op);
  7044. END PushConstInteger;
  7045. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  7046. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  7047. section: IntermediateCode.Section;
  7048. BEGIN
  7049. procedureScope := SyntaxTree.NewProcedureScope(scope);
  7050. Global.GetSymbolSegmentedName(symbol, name);
  7051. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  7052. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  7053. procedure.SetScope(moduleScope);
  7054. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  7055. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  7056. procedure.SetAccess(SyntaxTree.Hidden);
  7057. currentScope := procedureScope;
  7058. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  7059. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  7060. RETURN section;
  7061. END OpenInitializer;
  7062. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  7063. BEGIN
  7064. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  7065. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  7066. section := prev;
  7067. END CloseInitializer;
  7068. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  7069. VAR name: SyntaxTree.IdentifierString;
  7070. parameter: SyntaxTree.Parameter;
  7071. type: SyntaxTree.Type;
  7072. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  7073. BEGIN
  7074. InitOperand(op,ModeReference);
  7075. op.op := fp;
  7076. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  7077. Dereference(op, x, FALSE);
  7078. result := op;
  7079. Symbol(symbol, op);
  7080. END Field;
  7081. PROCEDURE Direction(direction: LONGINT): SET;
  7082. BEGIN
  7083. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  7084. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  7085. ELSE HALT(100);
  7086. END;
  7087. END Direction;
  7088. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7089. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7090. BEGIN
  7091. Field(port, op);
  7092. ToMemory(op.op,addressType,0);
  7093. Emit(Push(Basic.invalidPosition, op.op));
  7094. ReleaseOperand(op);
  7095. Basic.GetString(modifier.identifier, name);
  7096. PushConstString(name);
  7097. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7098. ASSERT(SemanticChecker.IsStringType(value.type));
  7099. Designate(value, op);
  7100. Emit(Push(modifier.position, op.tag));
  7101. Emit(Push(modifier.position, op.op));
  7102. ReleaseOperand(op);
  7103. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  7104. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7105. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7106. Evaluate(value, op);
  7107. Emit(Push(modifier.position, op.op));
  7108. ReleaseOperand(op);
  7109. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  7110. ELSE
  7111. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  7112. END;
  7113. END AddPortProperty;
  7114. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  7115. VAR modifier: SyntaxTree.Modifier;
  7116. BEGIN
  7117. modifier := parameter.modifiers;
  7118. WHILE modifier # NIL DO
  7119. AddPortProperty(parameter,modifier, modifier.expression);
  7120. modifier := modifier.nextModifier;
  7121. END;
  7122. END AddPortProperties;
  7123. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  7124. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  7125. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  7126. PROCEDURE PushLens(type: SyntaxTree.Type);
  7127. BEGIN
  7128. IF IsSemiDynamicArray(type) THEN
  7129. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7130. Evaluate(type(SyntaxTree.ArrayType).length, op);
  7131. Emit(Push(Basic.invalidPosition, op.op));
  7132. ReleaseOperand(op);
  7133. INC(dim);
  7134. ELSIF IsStaticArray(type) THEN
  7135. len := len * type(SyntaxTree.ArrayType).staticLength;
  7136. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7137. INC(dim);
  7138. ELSE
  7139. baseType := type;
  7140. END;
  7141. END PushLens;
  7142. BEGIN
  7143. (* cell *)
  7144. IF parameter.type IS SyntaxTree.ArrayType THEN
  7145. type := parameter.type;
  7146. dim := 0;
  7147. len := 1;
  7148. PushLens(type);
  7149. portType := baseType.resolved(SyntaxTree.PortType);
  7150. ELSE
  7151. portType := parameter.type(SyntaxTree.PortType);
  7152. END;
  7153. PushSelfPointer();
  7154. (* port / array of ports *)
  7155. IF IsStaticArray(type) THEN
  7156. PushConstInteger(len);
  7157. END;
  7158. Field(parameter, op);
  7159. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7160. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  7161. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  7162. Designate(d, op);*)
  7163. Emit(Push(Basic.invalidPosition, op.op));
  7164. ReleaseOperand(op);
  7165. (* name *)
  7166. PushConstString(name);
  7167. (* inout *)
  7168. PushConstSet(Direction(portType.direction));
  7169. (* width *)
  7170. PushConstInteger(portType.sizeInBits);
  7171. IF parameter.type IS SyntaxTree.PortType THEN
  7172. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  7173. AddPortProperties(parameter);
  7174. ELSIF IsStaticArray(type)THEN
  7175. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  7176. ELSIF IsSemiDynamicArray(type) THEN
  7177. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7178. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  7179. Emit(Add(position,reg, sp, size));
  7180. (* dim *)
  7181. PushConstInteger(dim);
  7182. (* len array *)
  7183. Emit(Push(position, reg));
  7184. ReleaseIntermediateOperand(reg);
  7185. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  7186. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  7187. Emit(Add(position, sp,sp, size));
  7188. ELSE
  7189. HALT(100);
  7190. END;
  7191. END Parameter;
  7192. BEGIN
  7193. IF backend.cellsAreObjects THEN
  7194. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  7195. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  7196. END;
  7197. parameter := x.firstParameter;
  7198. WHILE (parameter # NIL) DO
  7199. type := parameter.type.resolved;
  7200. WHILE (type IS SyntaxTree.ArrayType) DO
  7201. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7202. END;
  7203. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  7204. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  7205. Parameter(name,parameter);
  7206. END;
  7207. parameter := parameter.nextParameter;
  7208. END;
  7209. ELSE HALT(200)
  7210. END;
  7211. END AddPorts;
  7212. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  7213. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  7214. BEGIN
  7215. Symbol(cell,op);
  7216. ToMemory(op.op,addressType,0);
  7217. Emit(Push(position,op.op));
  7218. ReleaseOperand(op);
  7219. property.GetName(name);
  7220. (* does not work when inheritance is used:
  7221. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  7222. *)
  7223. PushConstString(name);
  7224. IF (value # NIL) THEN
  7225. ASSERT(
  7226. SemanticChecker.IsStringType(property.type)
  7227. OR (property.type.resolved IS SyntaxTree.IntegerType)
  7228. OR (property.type.resolved IS SyntaxTree.FloatType)
  7229. OR (property.type.resolved IS SyntaxTree.BooleanType)
  7230. OR (property.type.resolved IS SyntaxTree.SetType)
  7231. );
  7232. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7233. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  7234. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  7235. Designate(d, op);
  7236. IF SemanticChecker.IsStringType(property.type) THEN
  7237. Emit(Push(Basic.invalidPosition, op.tag))
  7238. END;
  7239. Emit(Push(Basic.invalidPosition, op.op));
  7240. ReleaseOperand(op);
  7241. END;
  7242. IF value = NIL THEN
  7243. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  7244. ELSIF SemanticChecker.IsStringType(property.type) THEN
  7245. ASSERT(SemanticChecker.IsStringType(value.type));
  7246. Designate(value, op);
  7247. PushString(op, value.type);
  7248. ReleaseOperand(op);
  7249. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  7250. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  7251. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7252. Evaluate(value, op);
  7253. Emit(Push(property.position, op.op));
  7254. ReleaseOperand(op);
  7255. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  7256. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  7257. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  7258. Evaluate(value, op);
  7259. Emit(Push(property.position, op.op));
  7260. ReleaseOperand(op);
  7261. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  7262. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  7263. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  7264. Evaluate(value, op);
  7265. Emit(Push(property.position, op.op));
  7266. ReleaseOperand(op);
  7267. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  7268. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  7269. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  7270. Evaluate(value, op);
  7271. Emit(Push(property.position, op.op));
  7272. ReleaseOperand(op);
  7273. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  7274. ELSE
  7275. HALT(200);
  7276. END;
  7277. END AddProperty;
  7278. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  7279. VAR symbol: SyntaxTree.Symbol;
  7280. BEGIN
  7281. WHILE modifier # NIL DO
  7282. symbol := cellType.FindProperty(modifier.identifier);
  7283. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  7284. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  7285. modifier := modifier.nextModifier;
  7286. END;
  7287. END AddModifiers;
  7288. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7289. VAR last: SyntaxTree.Modifier;
  7290. BEGIN
  7291. IF to = NIL THEN
  7292. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  7293. ELSE
  7294. last := to;
  7295. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  7296. last := last.nextModifier;
  7297. END;
  7298. IF last.identifier # this.identifier THEN
  7299. ASSERT(last.nextModifier = NIL);
  7300. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  7301. END;
  7302. END;
  7303. END AppendModifier;
  7304. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7305. BEGIN
  7306. WHILE this # NIL DO
  7307. AppendModifier(to, this);
  7308. this := this.nextModifier;
  7309. END;
  7310. END AppendModifiers;
  7311. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  7312. VAR base: SyntaxTree.Type;
  7313. BEGIN
  7314. AppendModifiers(to, c.modifiers);
  7315. base := c.GetBaseValueType();
  7316. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  7317. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  7318. END;
  7319. END AppendCellTypeModifiers;
  7320. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7321. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7322. BEGIN
  7323. Basic.GetString(modifier.identifier, name);
  7324. PushConstString(name);
  7325. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7326. ASSERT(SemanticChecker.IsStringType(value.type));
  7327. Designate(value, op);
  7328. PushString(op, value.type);
  7329. ReleaseOperand(op);
  7330. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7331. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7332. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7333. Evaluate(value, op);
  7334. Emit(Push(modifier.position, op.op));
  7335. ReleaseOperand(op);
  7336. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7337. ELSE
  7338. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7339. END;
  7340. END AddPortProperty;
  7341. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7342. BEGIN
  7343. WHILE modifier # NIL DO
  7344. AddPortProperty(modifier, modifier.expression);
  7345. modifier := modifier.nextModifier;
  7346. END;
  7347. END AddPortProperties;
  7348. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7349. VAR op: Operand;
  7350. BEGIN
  7351. Evaluate(p, op);
  7352. Emit(Push(p.position, op.op));
  7353. ReleaseOperand(op);
  7354. IF p IS SyntaxTree.Designator THEN
  7355. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7356. END;
  7357. END PushPort;
  7358. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7359. VAR tmp: IntermediateCode.Operand;
  7360. BEGIN
  7361. actualType := actualType.resolved;
  7362. IF actualType IS SyntaxTree.StringType THEN
  7363. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7364. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7365. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7366. ELSE
  7367. tmp := op.tag;
  7368. IntermediateCode.MakeMemory(tmp,addressType);
  7369. Emit(Push(position,tmp));
  7370. END;
  7371. Emit(Push(position,op.op))
  7372. END PushString;
  7373. (* conservative check if x is potentially on the heap, excluding the module heap
  7374. required for generational garbage collector
  7375. *)
  7376. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7377. BEGIN
  7378. RETURN TRUE;
  7379. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7380. passed by reference.
  7381. pos := x.position.start;
  7382. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7383. x := x(SyntaxTree.Designator).left;
  7384. END;
  7385. RETURN x # NIL;
  7386. *)
  7387. END OnHeap;
  7388. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7389. VAR
  7390. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7391. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7392. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7393. tmp:IntermediateCode.Operand;
  7394. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,ignore: Label;
  7395. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7396. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7397. dest: IntermediateCode.Operand;
  7398. staticLength: LONGINT; itype: IntermediateCode.Type;
  7399. convert,isTensor: BOOLEAN;
  7400. recordType: SyntaxTree.RecordType;
  7401. baseType: SyntaxTree.Type;
  7402. left: SyntaxTree.Expression;
  7403. call: SyntaxTree.Designator;
  7404. procedure: SyntaxTree.Procedure;
  7405. temporaryVariable: SyntaxTree.Variable;
  7406. dummy: IntermediateCode.Operand;
  7407. customBuiltin: SyntaxTree.CustomBuiltin;
  7408. isVarPar: ARRAY 3 OF BOOLEAN;
  7409. callsection: Sections.Section;
  7410. segmentedName: Basic.SegmentedName;
  7411. needsTrace: BOOLEAN;
  7412. n: ARRAY 256 OF CHAR;
  7413. modifier: SyntaxTree.Modifier;
  7414. previous, init: IntermediateCode.Section;
  7415. prevScope: SyntaxTree.Scope;
  7416. firstPar: LONGINT;
  7417. saved: RegisterEntry;
  7418. callingConvention: SyntaxTree.CallingConvention;
  7419. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7420. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7421. priority: IntermediateCode.Operand;
  7422. op,callop: Operand;
  7423. BEGIN
  7424. IF type = NIL THEN RETURN END;
  7425. type := type.resolved;
  7426. IF type IS SyntaxTree.PointerType THEN
  7427. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7428. END;
  7429. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7430. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7431. recordScope := type(SyntaxTree.RecordType).recordScope;
  7432. IF recordScope.bodyProcedure # NIL THEN
  7433. procedure := recordScope.bodyProcedure;
  7434. body := procedure.procedureScope.body;
  7435. Emit(Push(position,self));
  7436. IF body.isActive THEN
  7437. StaticCallOperand(callop,procedure);
  7438. Emit(Push(position,callop.op));
  7439. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7440. Convert(priority,sizeType);
  7441. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7442. END;
  7443. Emit(Push(position,priority));
  7444. ReleaseIntermediateOperand(priority);
  7445. IF backend.cooperative THEN
  7446. Emit(Push(position,self));
  7447. CallThis(position,"Activities","Create",3)
  7448. ELSE
  7449. flags := 0;
  7450. IF body.isSafe THEN
  7451. flags := 1;
  7452. END;
  7453. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7454. Emit(Push(position,self));
  7455. CallThis(position,"Objects","CreateProcess",4)
  7456. END;
  7457. ELSE
  7458. Emit(Push(position,self));
  7459. StaticCallOperand(callop,procedure);
  7460. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7461. END;
  7462. Emit(Pop(position,self));
  7463. END;
  7464. END CallBodies;
  7465. PROCEDURE PushTD(type: SyntaxTree.Type);
  7466. VAR op: IntermediateCode.Operand;
  7467. BEGIN
  7468. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7469. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7470. ELSE
  7471. IF type.resolved IS SyntaxTree.PointerType THEN
  7472. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7473. END;
  7474. op := TypeDescriptorAdr(type.resolved);
  7475. Emit(Push(position,op));
  7476. END
  7477. END PushTD;
  7478. BEGIN
  7479. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7480. dest := destination; destination := emptyOperand;
  7481. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7482. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7483. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7484. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7485. CASE x.id OF
  7486. (* ---- COPY ----- *)
  7487. |Global.Copy:
  7488. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7489. (* ---- EXCL, INCL----- *)
  7490. |Global.Excl,Global.Incl:
  7491. Evaluate(p0,s0);
  7492. Evaluate(p1,s1);
  7493. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7494. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7495. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7496. END;
  7497. ReuseCopy(res,s0.op);
  7498. ReleaseOperand(s0);
  7499. Reuse1(tmp,s1.op);
  7500. ReleaseOperand(s1);
  7501. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7502. IF x.id = Global.Excl THEN
  7503. Emit(Not(position,tmp,tmp));
  7504. Emit(And(position,res,res,tmp));
  7505. ELSE
  7506. Emit(Or(position,res,res,tmp));
  7507. END;
  7508. ReleaseIntermediateOperand(tmp);
  7509. Designate(p0,s0);
  7510. ToMemory(s0.op,s1.op.type,0);
  7511. Emit(Mov(position,s0.op,res));
  7512. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7513. (* ---- DISPOSE ----- *)
  7514. |Global.Dispose:
  7515. Designate(p0,s0);
  7516. Emit(Push(position,s0.op));
  7517. ReleaseOperand(s0);
  7518. CallThis(position,"Runtime","Dispose", 1);
  7519. (* ---- GETPROCEDURE ----- *)
  7520. |Global.GetProcedure:
  7521. Designate(p0,s0);
  7522. PushString(s0,p0.type);
  7523. Designate(p1,s1);
  7524. PushString(s1,p1.type);
  7525. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7526. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7527. ELSE PushTD(procedureType.firstParameter.type)
  7528. END;
  7529. PushTD(procedureType.returnType);
  7530. Designate(p2,s2);
  7531. Emit(Push(position,s2.op));
  7532. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7533. CallThis(position,"Modules","GetProcedure", 7);
  7534. (* ---- ASH, LSH, ROT ----- *)
  7535. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7536. Evaluate(p0,s0);
  7537. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7538. (* make unsigned arguments in order to produced a logical shift *)
  7539. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7540. convert:= TRUE;
  7541. itype := s0.op.type;
  7542. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7543. Convert(s0.op,itype);
  7544. ELSE
  7545. convert := FALSE;
  7546. END;
  7547. END;
  7548. Evaluate(p1,s1);
  7549. IF IsIntegerConstant(p1,hint) THEN
  7550. ReuseCopy(reg,s0.op);
  7551. IF hint > 0 THEN
  7552. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7553. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7554. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7555. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7556. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7557. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7558. END;
  7559. ELSIF hint < 0 THEN
  7560. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7561. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7562. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7563. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7564. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7565. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7566. END;
  7567. END;
  7568. ReleaseOperand(s0); ReleaseOperand(s1);
  7569. ELSE
  7570. exit := NewLabel();
  7571. end := NewLabel();
  7572. ReuseCopy(reg,s0.op);
  7573. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7574. Reuse1(tmp,s1.op);
  7575. Emit(Neg(position,tmp,s1.op));
  7576. Convert(tmp,s1.op.type);
  7577. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7578. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7579. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7580. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7581. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7582. END;
  7583. ReleaseIntermediateOperand(tmp);
  7584. BrL(end);
  7585. SetLabel(exit);
  7586. ReuseCopy(tmp,s1.op);
  7587. Convert(tmp,s1.op.type);
  7588. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7589. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7590. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7591. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7592. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7593. END;
  7594. ReleaseIntermediateOperand(tmp);
  7595. SetLabel(end);
  7596. ReleaseOperand(s0); ReleaseOperand(s1);
  7597. END;
  7598. InitOperand(result,ModeValue);
  7599. IF convert THEN
  7600. itype := reg.type;
  7601. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7602. Convert(reg,itype);
  7603. END;
  7604. result.op := reg;
  7605. (* ---- CAP ----- *)
  7606. |Global.Cap:
  7607. Evaluate(p0,result);
  7608. ReuseCopy(reg,result.op);
  7609. ReleaseIntermediateOperand(result.op);
  7610. ignore := NewLabel();
  7611. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7612. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7613. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7614. SetLabel(ignore);
  7615. result.op := reg;
  7616. (* ---- CHR ----- *)
  7617. |Global.Chr, Global.Chr32:
  7618. Evaluate(p0,result);
  7619. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7620. |Global.Entier, Global.EntierH:
  7621. Evaluate(p0,result);
  7622. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7623. (* ---- MIN and MAX ----- *)
  7624. |Global.Max,Global.Min:
  7625. Evaluate(p0,s0);
  7626. Evaluate(p1,s1);
  7627. Reuse2(res,s0.op,s1.op);
  7628. else := NewLabel();
  7629. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7630. ELSE BrltL(else,s1.op,s0.op) END;
  7631. Emit(Mov(position,res,s0.op));
  7632. ReleaseOperand(s0);
  7633. end := NewLabel();
  7634. BrL(end);
  7635. SetLabel(else);
  7636. Emit(MovReplace(position,res,s1.op));
  7637. SetLabel(end);
  7638. ReleaseOperand(s1);
  7639. InitOperand(result,ModeValue);
  7640. result.op := res;
  7641. (* ---- ODD ----- *)
  7642. |Global.Odd:
  7643. Evaluate(p0,result);
  7644. Reuse1(res,result.op);
  7645. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7646. ReleaseIntermediateOperand(result.op);
  7647. result.op := res;
  7648. Convert(result.op,bool);
  7649. (* ---- ORD ----- *)
  7650. |Global.Ord, Global.Ord32:
  7651. Evaluate(p0,result);
  7652. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7653. (* ---- SHORT, LONG ----- *)
  7654. |Global.Short, Global.Long:
  7655. Evaluate(p0,result);
  7656. IF x.type IS SyntaxTree.ComplexType THEN
  7657. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7658. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7659. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7660. ELSE
  7661. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7662. END
  7663. (* ---- HALT, SYSTEM.HALT----- *)
  7664. |Global.Halt, Global.systemHalt:
  7665. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7666. EmitTrap (position, val);
  7667. (* ---- ASSERT ----- *)
  7668. |Global.Assert:
  7669. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7670. trueL := NewLabel();
  7671. Condition(p0,trueL,TRUE);
  7672. IF p1 = NIL THEN val := AssertTrap
  7673. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7674. END;
  7675. EmitTrap(position,val);
  7676. SetLabel(trueL);
  7677. END;
  7678. (*
  7679. Emit(TrapC(result.op,val);
  7680. *)
  7681. (* ---- INC, DEC----- *)
  7682. |Global.Inc,Global.Dec:
  7683. Expression(p0); adr := result.op;
  7684. s0 := result;
  7685. LoadValue(result,p0.type);
  7686. (* EXPERIMENTAL *)
  7687. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7688. availableSymbols[s0.availability].inMemory := FALSE;
  7689. END;
  7690. l := result;
  7691. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7692. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7693. END;
  7694. IF x.id = Global.Inc THEN
  7695. Emit(Add(position,l.op,l.op,r.op));
  7696. ELSE
  7697. Emit(Sub(position,l.op,l.op,r.op));
  7698. END;
  7699. ReleaseOperand(l); ReleaseOperand(r);
  7700. (* ---- LEN ----- *)
  7701. |Global.Len: (* dynamic length, static length done by checker *)
  7702. Designate(p0,operand);
  7703. IF p1 = NIL THEN
  7704. InitOperand(l,ModeValue);
  7705. l.op := IntermediateCode.Immediate(sizeType,0);
  7706. ELSE
  7707. Evaluate(p1,l);
  7708. END;
  7709. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7710. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7711. Dereference(operand, p0.type.resolved, FALSE);
  7712. END;
  7713. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7714. ReleaseOperand(operand); ReleaseOperand(l);
  7715. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7716. ASSERT(p1 # NIL);
  7717. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7718. Dereference(operand,p0.type.resolved,FALSE);
  7719. END;
  7720. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7721. ReleaseOperand(operand); ReleaseOperand(l);
  7722. ELSE HALT(100);
  7723. END;
  7724. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7725. (* ---- FIRST ---- *)
  7726. |Global.First:
  7727. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7728. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7729. ELSE
  7730. Designate(p0, result)
  7731. END
  7732. (* ---- LAST ---- *)
  7733. |Global.Last:
  7734. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7735. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7736. ELSE
  7737. Designate(p0, result);
  7738. (* make sure result.op is a register *)
  7739. tmp := result.op;
  7740. ReuseCopy(result.op, result.op);
  7741. ReleaseIntermediateOperand(tmp);
  7742. (* add offset to result.op *)
  7743. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7744. END
  7745. (* ---- STEP ---- *)
  7746. |Global.Step:
  7747. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7748. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7749. ELSE
  7750. Designate(p0, result);
  7751. (* make sure result.op is a register *)
  7752. tmp := result.op;
  7753. ReuseCopy(result.op, result.op);
  7754. ReleaseIntermediateOperand(tmp);
  7755. (* add offset to result.op *)
  7756. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7757. END
  7758. (* ---- RE ---- *)
  7759. |Global.Re:
  7760. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7761. Designate(p0, result)
  7762. ELSE
  7763. Evaluate(p0, result)
  7764. END
  7765. (* ---- IM ---- *)
  7766. |Global.Im:
  7767. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7768. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7769. Designate(p0, result);
  7770. (* make sure result.op is a register *)
  7771. tmp := result.op;
  7772. ReuseCopy(result.op, result.op);
  7773. ReleaseIntermediateOperand(tmp);
  7774. (* add offset to result.op *)
  7775. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7776. (* ---- ABS ----- *)
  7777. |Global.Abs:
  7778. Evaluate(p0,operand);
  7779. type := p0.type.resolved;
  7780. InitOperand(result,ModeValue);
  7781. Reuse1a(result.op,operand.op,dest);
  7782. Emit(Abs(position,result.op,operand.op));
  7783. ReleaseOperand(operand);
  7784. (* ---- WAIT ----- *)
  7785. |Global.Wait:
  7786. Evaluate(p0,operand);
  7787. Emit(Push(position,operand.op));
  7788. ReleaseOperand(operand);
  7789. CallThis(position,"Activities","Wait", 1);
  7790. (* ---- NEW ----- *)
  7791. |Global.New:
  7792. (*! the following code is only correct for "standard" Oberon calling convention *)
  7793. IF x.type # NIL THEN
  7794. type := x.type.resolved;
  7795. firstPar := 0;
  7796. ELSE
  7797. type := p0.type.resolved;
  7798. firstPar := 1;
  7799. END;
  7800. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7801. THEN
  7802. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7803. IF backend.cooperative THEN
  7804. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7805. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7806. IF recordType.isObject THEN
  7807. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7808. IF recordType.IsActive() THEN
  7809. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7810. END;
  7811. IF recordType.IsProtected() THEN
  7812. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7813. END;
  7814. ELSE
  7815. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7816. END;
  7817. END;
  7818. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7819. CallThis(position,"Runtime","New", 1);
  7820. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7821. Emit(Result(position, pointer));
  7822. exit := NewLabel();
  7823. BreqL(exit,pointer,nil);
  7824. GetRecordTypeName (recordType,name);
  7825. IF ~recordType.isObject THEN
  7826. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7827. END;
  7828. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7829. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7830. IF recordType.isObject THEN
  7831. IF recordType.IsProtected() THEN
  7832. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7833. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7834. END;
  7835. IF recordType.IsActive() THEN
  7836. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7837. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7838. END;
  7839. END;
  7840. (* initialize fields *)
  7841. IF type(SyntaxTree.PointerType).isPlain THEN
  7842. size := 0;
  7843. ELSIF recordType.isObject THEN
  7844. size := BaseObjectTypeSize;
  7845. ELSE
  7846. size := BaseRecordTypeSize;
  7847. END;
  7848. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7849. (* call initializer *)
  7850. constructor := GetConstructor(recordType);
  7851. IF constructor # NIL THEN
  7852. (*! should be unified with ProcedureCallDesignator *)
  7853. Emit(Push(position,pointer));
  7854. ReleaseIntermediateOperand(pointer);
  7855. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7856. FOR i := firstPar TO x.parameters.Length()-1 DO
  7857. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7858. formalParameter := formalParameter.nextParameter;
  7859. END;
  7860. (* static call of the constructor *)
  7861. GetCodeSectionNameForSymbol(constructor,name);
  7862. ASSERT(~constructor.isInline);
  7863. IF constructor.scope.ownerModule # module.module THEN
  7864. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7865. ELSE
  7866. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7867. END;
  7868. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7869. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7870. Emit(Pop(position,pointer));
  7871. END;
  7872. (* call bodies *)
  7873. CallBodies(pointer,type);
  7874. SetLabel(exit);
  7875. needsTrace := p0.NeedsTrace();
  7876. IF needsTrace THEN ModifyAssignments(true) END;
  7877. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7878. Emit(Push(position, pointer));
  7879. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7880. Emit(Pop(position, pointer));
  7881. END;
  7882. Designate(p0,l);
  7883. IF needsTrace THEN
  7884. CallAssignPointer(l.op, pointer);
  7885. ELSE
  7886. ToMemory(l.op,addressType,0);
  7887. Emit(Mov(position,l.op,pointer));
  7888. END;
  7889. ReleaseIntermediateOperand(pointer);
  7890. ReleaseOperand(l);
  7891. IF needsTrace THEN ModifyAssignments(false) END;
  7892. ELSE (* not cooperative backend *)
  7893. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7894. IF temporaryVariable # NIL THEN
  7895. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7896. ELSE
  7897. Designate(p0,l);
  7898. END;
  7899. (* l.op contains address of pointer to record *)
  7900. Emit(Push(position,l.op)); (* address for use after syscall *)
  7901. Emit(Push(position,l.op));
  7902. ReleaseOperand(l);
  7903. (* push type descriptor *)
  7904. reg := TypeDescriptorAdr(recordType);
  7905. Emit(Push(position,reg));
  7906. ReleaseIntermediateOperand(reg);
  7907. (* push realtime flag *)
  7908. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7909. ELSE Emit(Push(position,false));
  7910. END;
  7911. CallThis(position,"Heaps","NewRec", 3);
  7912. (* check allocation success, if not successful then do not call initializers and bodies *)
  7913. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7914. Emit(Pop(position,pointer));
  7915. MakeMemory(reg,pointer,addressType,0);
  7916. ReleaseIntermediateOperand(pointer);
  7917. pointer := reg;
  7918. exit := NewLabel();
  7919. BreqL(exit,pointer,nil);
  7920. Emit(Push(position,pointer));
  7921. (* initialize fields *)
  7922. InitFields(recordType, pointer,0);
  7923. (* call initializer *)
  7924. constructor := GetConstructor(recordType);
  7925. IF constructor # NIL THEN
  7926. (*! should be unified with ProcedureCallDesignator *)
  7927. Emit(Push(position,pointer));
  7928. ReleaseIntermediateOperand(pointer);
  7929. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7930. FOR i := firstPar TO x.parameters.Length()-1 DO
  7931. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7932. formalParameter := formalParameter.nextParameter;
  7933. END;
  7934. (* static call of the constructor *)
  7935. GetCodeSectionNameForSymbol(constructor,name);
  7936. ASSERT(~constructor.isInline);
  7937. IF constructor.scope.ownerModule # module.module THEN
  7938. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7939. ELSE
  7940. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7941. END;
  7942. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7943. ELSE
  7944. ReleaseIntermediateOperand(pointer);
  7945. END;
  7946. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7947. Emit(Pop(position,pointer));
  7948. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7949. Designate(p0,l);
  7950. IF backend.writeBarriers & OnHeap(p0) THEN
  7951. SaveRegisters();ReleaseUsedRegisters(saved);
  7952. Emit(Push(position,l.op));
  7953. Emit(Push(position,pointer));
  7954. CallThis(position,"Heaps","Assign",2);
  7955. RestoreRegisters(saved);
  7956. ELSE
  7957. ToMemory(l.op,addressType,0);
  7958. Emit(Mov(position,l.op,pointer));
  7959. END;
  7960. ReleaseOperand(l);
  7961. result.tag := emptyOperand;
  7962. ELSIF (x.type # NIL) THEN
  7963. result := l; (* temporary variable is the result of NEW Type() *)
  7964. END;
  7965. (* call bodies *)
  7966. CallBodies(pointer,type);
  7967. ReleaseIntermediateOperand(pointer);
  7968. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7969. end := NewLabel();
  7970. BrL(end);
  7971. SetLabel(exit);
  7972. Designate(p0,l);
  7973. ToMemory(l.op,addressType,0);
  7974. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7975. ReleaseOperand(l);
  7976. SetLabel(end);
  7977. ELSE
  7978. SetLabel(exit);
  7979. END;
  7980. END;
  7981. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7982. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7983. IF ~backend.cooperative THEN (* simpler version *)
  7984. (*
  7985. push len0
  7986. push len1
  7987. push len2
  7988. push len_size
  7989. push len_adr
  7990. push tag
  7991. push static elements
  7992. push element size
  7993. push adr
  7994. *)
  7995. dim := 0;
  7996. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7997. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7998. parameter := x.parameters.GetExpression(i);
  7999. Evaluate(parameter,r);
  8000. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8001. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8002. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8003. END;
  8004. Emit(Push(position,r.op));
  8005. ReleaseOperand(r);
  8006. INC(dim);
  8007. END;
  8008. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8009. Emit(Mov(position, adr, sp));
  8010. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8011. Emit(Push(position, adr));
  8012. ReleaseIntermediateOperand(adr);
  8013. openDim := dim;
  8014. staticLength := 1;
  8015. IF type IS SyntaxTree.ArrayType THEN
  8016. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8017. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8018. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8019. END;
  8020. END;
  8021. IF SemanticChecker.ContainsPointer(type) THEN
  8022. tmp := TypeDescriptorAdr(type);
  8023. ELSE
  8024. tmp := nil;
  8025. END;
  8026. Emit(Push(position,tmp)); (* type descriptor *)
  8027. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  8028. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  8029. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  8030. Designate(p0,l);
  8031. Emit(Push(position,l.op)); (* address *)
  8032. ReleaseOperand(l);
  8033. CallThis(position,"Heaps","NewArray", 6);
  8034. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8035. Emit(Add(position,sp,sp,tmp));
  8036. ELSE
  8037. dim := 0;
  8038. IntermediateCode.InitOperand(reg);
  8039. IF p1 # NIL THEN
  8040. FOR i := firstPar TO x.parameters.Length()-1 DO
  8041. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8042. parameter := x.parameters.GetExpression(i);
  8043. Evaluate(parameter,r);
  8044. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8045. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8046. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8047. END;
  8048. Emit(Push(position,r.op));
  8049. IF i=1 THEN
  8050. CopyInt(reg,r.op);
  8051. ELSE
  8052. MulInt(reg, reg, r.op);
  8053. END;
  8054. ReleaseOperand(r);
  8055. INC(dim);
  8056. END;
  8057. Convert(reg,addressType);
  8058. ELSE
  8059. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8060. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  8061. END;
  8062. openDim := dim;
  8063. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  8064. IF backend.cooperative THEN
  8065. size := ToMemoryUnits(system,system.SizeOf(type));
  8066. WHILE type IS SyntaxTree.ArrayType DO
  8067. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8068. END;
  8069. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  8070. IF (size # 1) THEN
  8071. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8072. END;
  8073. Emit(Push(position,reg));
  8074. size := ToMemoryUnits(system,system.SizeOf(type));
  8075. IF (size # 1) THEN
  8076. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8077. END;
  8078. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  8079. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  8080. Emit(Push(position,reg));
  8081. ReleaseIntermediateOperand(reg);
  8082. CallThis(position,"Runtime","New", 1);
  8083. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8084. Emit(Result(position, pointer));
  8085. exit := NewLabel();
  8086. else := NewLabel();
  8087. BreqL(else,pointer,nil);
  8088. IF ~type.hasPointers THEN
  8089. Basic.ToSegmentedName ("BaseTypes.Array",name);
  8090. ELSIF type IS SyntaxTree.RecordType THEN
  8091. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  8092. ELSIF type IS SyntaxTree.ProcedureType THEN
  8093. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  8094. ELSE
  8095. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  8096. END;
  8097. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  8098. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  8099. 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))));
  8100. IF type IS SyntaxTree.RecordType THEN
  8101. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  8102. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  8103. ELSE
  8104. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  8105. END;
  8106. i := openDim;
  8107. WHILE i > 0 DO
  8108. DEC (i);
  8109. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  8110. END;
  8111. needsTrace := p0.NeedsTrace();
  8112. IF needsTrace THEN ModifyAssignments(true) END;
  8113. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  8114. Emit(Push(position, pointer));
  8115. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  8116. Emit(Pop(position, pointer));
  8117. END;
  8118. Designate(p0,l);
  8119. IF needsTrace THEN
  8120. CallAssignPointer(l.op, pointer);
  8121. ModifyAssignments(false);
  8122. ELSE
  8123. ToMemory(l.op,addressType,0);
  8124. Emit(Mov(position,l.op,pointer));
  8125. END;
  8126. ReleaseIntermediateOperand(pointer);
  8127. ReleaseOperand(l);
  8128. BrL(exit);
  8129. SetLabel(else);
  8130. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  8131. Designate(p0,l);
  8132. IF needsTrace THEN
  8133. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  8134. ELSE
  8135. ToMemory(l.op,addressType,0);
  8136. Emit(Mov(position,l.op,pointer));
  8137. END;
  8138. ReleaseOperand(l);
  8139. SetLabel(exit);
  8140. ELSE
  8141. (*! the following code is only correct for "standard" Oberon calling convention *)
  8142. IF SemanticChecker.ContainsPointer(type) THEN
  8143. IF type IS SyntaxTree.ArrayType THEN
  8144. staticLength := 1;
  8145. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8146. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8147. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8148. END;
  8149. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  8150. MulInt(reg,reg,tmp);
  8151. END;
  8152. Designate(p0,l);
  8153. IF openDim > 0 THEN
  8154. Emit(Push(position,l.op)); (* address for use after syscall *)
  8155. END;
  8156. Emit(Push(position,l.op)); (* address *)
  8157. ReleaseOperand(l);
  8158. tmp := TypeDescriptorAdr(type);
  8159. Emit(Push(position,tmp)); (* type descriptor *)
  8160. ReleaseIntermediateOperand(tmp);
  8161. Emit(Push(position,reg)); (* number Elements *)
  8162. ReleaseIntermediateOperand(reg);
  8163. tmp := IntermediateCode.Immediate(addressType,dim);
  8164. Emit(Push(position,tmp)); (* dimensions *)
  8165. (* push realtime flag *)
  8166. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8167. ELSE Emit(Push(position,false));
  8168. END;
  8169. CallThis(position,"Heaps","NewArr",5)
  8170. ELSE
  8171. size := ToMemoryUnits(system,system.SizeOf(type));
  8172. IF (size # 1) THEN
  8173. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  8174. (*
  8175. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  8176. *)
  8177. END;
  8178. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  8179. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  8180. AddInt(reg, reg, tmp);
  8181. (*
  8182. Emit(Add(position,reg,reg,tmp));
  8183. *)
  8184. Designate(p0,l);
  8185. IF openDim >0 THEN
  8186. Emit(Push(position,l.op)); (* address for use after syscall *)
  8187. END;
  8188. Emit(Push(position,l.op)); (* address for syscall *)
  8189. ReleaseOperand(l); (* pointer address *)
  8190. Emit(Push(position,reg)); (* size *)
  8191. ReleaseIntermediateOperand(reg);
  8192. (* push realtime flag *)
  8193. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8194. ELSE Emit(Push(position,false));
  8195. END;
  8196. CallThis(position,"Heaps","NewSys", 3)
  8197. END;
  8198. IF openDim > 0 THEN
  8199. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8200. Emit(Pop(position,adr));
  8201. ToMemory(adr,addressType,0);
  8202. ReuseCopy(tmp,adr);
  8203. ReleaseIntermediateOperand(adr);
  8204. adr := tmp;
  8205. else := NewLabel();
  8206. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  8207. i := openDim-1;
  8208. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8209. WHILE (i >= 0) DO
  8210. Emit(Pop(position,reg));
  8211. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  8212. Emit(Mov(position,res,reg));
  8213. DEC(i);
  8214. END;
  8215. ReleaseIntermediateOperand(adr);
  8216. ReleaseIntermediateOperand(reg);
  8217. exit := NewLabel();
  8218. BrL(exit);
  8219. SetLabel(else);
  8220. (* else part: array could not be allocated *)
  8221. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  8222. Emit(Add(position,sp,sp,tmp));
  8223. SetLabel(exit);
  8224. END;
  8225. END;
  8226. END;
  8227. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8228. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  8229. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  8230. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8231. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8232. callingConvention := procedureType.callingConvention;
  8233. left.SetType(procedure.type);
  8234. formalParameter := procedureType.firstParameter;
  8235. (* push array to allocate *)
  8236. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  8237. formalParameter :=formalParameter.nextParameter;
  8238. (* push length array *)
  8239. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  8240. (* push size *)
  8241. type := t0;
  8242. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  8243. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8244. END;
  8245. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  8246. Emit(Push(position,tmp));
  8247. (* *)
  8248. IF SemanticChecker.ContainsPointer(type) THEN
  8249. tmp := TypeDescriptorAdr(type);
  8250. ELSE
  8251. tmp := IntermediateCode.Immediate(addressType, 0);
  8252. END;
  8253. Emit(Push(position,tmp)); (* type descriptor *)
  8254. StaticCallOperand(result,procedure);
  8255. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8256. ReleaseOperand(result);
  8257. END;
  8258. (*
  8259. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  8260. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  8261. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  8262. *)
  8263. ELSE
  8264. (*
  8265. push len0
  8266. push len1
  8267. push len2
  8268. push size
  8269. push len_adr
  8270. push element_size
  8271. push tag
  8272. push adr
  8273. *)
  8274. dim := 0;
  8275. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8276. isTensor := TRUE;
  8277. ELSE
  8278. isTensor := FALSE;
  8279. END;
  8280. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8281. IF ~isTensor THEN
  8282. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8283. END;
  8284. parameter := x.parameters.GetExpression(i);
  8285. Evaluate(parameter,r);
  8286. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8287. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8288. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8289. END;
  8290. Emit(Push(position,r.op));
  8291. ReleaseOperand(r);
  8292. INC(dim);
  8293. END;
  8294. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8295. Emit(Mov(position, adr, sp));
  8296. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8297. Emit(Push(position, adr));
  8298. ReleaseIntermediateOperand(adr);
  8299. openDim := dim;
  8300. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  8301. IF isTensor THEN
  8302. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  8303. ELSE
  8304. baseType := SemanticChecker.ArrayBase(type,openDim);
  8305. END;
  8306. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  8307. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  8308. IF SemanticChecker.ContainsPointer(baseType) THEN
  8309. tmp := TypeDescriptorAdr(baseType);
  8310. ELSE
  8311. tmp := nil;
  8312. END;
  8313. Emit(Push(position,tmp)); (* type descriptor *)
  8314. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  8315. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  8316. ELSE (* error message has already been emited *)
  8317. RETURN;
  8318. END;
  8319. Designate(p0,l);
  8320. IF isTensor THEN
  8321. Emit(Push(position,l.op)); (* address *)
  8322. ELSE
  8323. Emit(Push(position,l.tag)); (* address *)
  8324. END;
  8325. ReleaseOperand(l);
  8326. StaticCallOperand(result,procedure);
  8327. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8328. ReleaseOperand(result);
  8329. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8330. Emit(Add(position,sp,sp,tmp));
  8331. END;
  8332. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8333. THEN
  8334. IF ~backend.cellsAreObjects THEN RETURN END;
  8335. IF InCellScope(currentScope) THEN
  8336. PushSelfPointer()
  8337. ELSE
  8338. Emit(Push(position, nil));
  8339. END;
  8340. (* push temp address *)
  8341. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8342. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8343. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8344. (* l.op contains address of pointer to record *)
  8345. Emit(Push(position,l.op)); (* address for use after syscall *)
  8346. ReleaseOperand(l);
  8347. (* push type descriptor *)
  8348. reg := TypeDescriptorAdr(baseType);
  8349. Emit(Push(position,reg));
  8350. ReleaseIntermediateOperand(reg);
  8351. (* push name *)
  8352. (*Global.GetSymbolName(p0, n);*)
  8353. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8354. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8355. ELSE
  8356. Global.GetModuleName(module.module, n);
  8357. END;
  8358. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8359. (*type.typeDeclaration.GetName(n);*)
  8360. PushConstString(n);
  8361. (* push cellnet boolean *)
  8362. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8363. (* push engine boolean *)
  8364. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8365. (* allocate *)
  8366. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8367. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8368. (* l.op contains address of pointer to record *)
  8369. ToMemory(l.op,addressType,0);
  8370. (* l.op contains value of pointer to record *)
  8371. InitFields(baseType, l.op,0);
  8372. (* add capabilities *)
  8373. modifier := p0(SyntaxTree.Designator).modifiers;
  8374. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8375. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8376. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8377. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8378. END;
  8379. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8380. (*
  8381. modifier := baseType(SyntaxTree.CellType).modifiers;
  8382. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8383. modifier := p0(SyntaxTree.Designator).modifiers;
  8384. *)
  8385. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8386. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8387. (* l.op contains address of pointer to record *)
  8388. ToMemory(l.op,addressType,0);
  8389. (* l.op contains value of pointer to record *)
  8390. Emit(Push(position,l.op)); (* address for use after syscall *)
  8391. ReleaseOperand(l);
  8392. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8393. prevScope := currentScope;
  8394. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8395. previous := section;
  8396. section := init;
  8397. (* add ports *)
  8398. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8399. CloseInitializer(previous);
  8400. currentScope := prevScope;
  8401. Symbol(temporaryVariable,l);
  8402. ToMemory(l.op,addressType,0);
  8403. Emit(Push(position,l.op));
  8404. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8405. (*
  8406. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8407. IF constructor # NIL THEN
  8408. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8409. FOR i := 1 TO x.parameters.Length()-1 DO
  8410. p := x.parameters.GetExpression(i);
  8411. Global.GetSymbolName(parameter,name);
  8412. Evaluate(p, value);
  8413. ASSERT(value.type # NIL);
  8414. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8415. par := instance.AddParameter(name);
  8416. par.SetInteger(value.integer);
  8417. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8418. par := instance.AddParameter(name);
  8419. par.SetBoolean(value.boolean);
  8420. ELSE Error(x.position,NotYetImplemented)
  8421. END;
  8422. parameter := parameter.nextParameter
  8423. END;
  8424. END;
  8425. *)
  8426. (* call initializer *)
  8427. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8428. IF constructor # NIL THEN
  8429. (*! should be unified with ProcedureCallDesignator *)
  8430. IF backend.cellsAreObjects THEN
  8431. Symbol(temporaryVariable,l);
  8432. ToMemory(l.op,addressType,0);
  8433. Emit(Push(position,l.op));
  8434. ReleaseOperand(l);
  8435. END;
  8436. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8437. FOR i := firstPar TO x.parameters.Length()-1 DO
  8438. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8439. formalParameter := formalParameter.nextParameter;
  8440. END;
  8441. (* static call of the constructor *)
  8442. Global.GetSymbolSegmentedName(constructor,name);
  8443. ASSERT(~constructor.isInline);
  8444. IF constructor.scope.ownerModule # module.module THEN
  8445. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8446. ELSE
  8447. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8448. END;
  8449. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8450. (*ELSE
  8451. ReleaseIntermediateOperand(pointer);*)
  8452. END;
  8453. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8454. ToMemory(l.op, addressType, 0);
  8455. Designate(p0,s0);
  8456. ToMemory(s0.op,addressType,0);
  8457. Emit(Mov(position,s0.op,l.op));
  8458. ReleaseOperand(l);
  8459. ReleaseOperand(s0);
  8460. result.tag := emptyOperand;
  8461. (* start *)
  8462. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8463. (* push cell *)
  8464. Symbol(temporaryVariable, l);
  8465. ToMemory(l.op,addressType,0);
  8466. Emit(Push(Basic.invalidPosition,l.op));
  8467. (* push delegate *)
  8468. Emit(Push(Basic.invalidPosition,l.op));
  8469. ReleaseOperand(l);
  8470. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8471. Emit(Push(position, s1.op));
  8472. ReleaseOperand(s1);
  8473. CallThis(position,"ActiveCellsRuntime","Start",3);
  8474. END;
  8475. (*IF temporaryVariable # NIL THEN
  8476. end := NewLabel();
  8477. BrL(end);
  8478. SetLabel(exit);
  8479. Designate(p0,l);
  8480. ToMemory(l.op,addressType,0);
  8481. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8482. ReleaseOperand(l);
  8483. SetLabel(end);
  8484. ELSE
  8485. SetLabel(exit);
  8486. END;
  8487. *)
  8488. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8489. ELSE (* no pointer to record, no pointer to array *)
  8490. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8491. (* ignore new statement *)
  8492. Warning(p0.position, "cannot run on final hardware");
  8493. ELSE
  8494. HALT(200);
  8495. END;
  8496. END;
  8497. (* ---- ADDRESSOF----- *)
  8498. |Global.systemAdr:
  8499. Designate(p0,s0);
  8500. s0.mode := ModeValue;
  8501. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8502. ReleaseIntermediateOperand(s0.op);
  8503. s0.op := s0.tag;
  8504. IntermediateCode.InitOperand(s0.tag);
  8505. END;
  8506. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8507. result := s0;
  8508. (* ---- BIT ----- *)
  8509. |Global.systemBit:
  8510. Evaluate(p0,s0);
  8511. ToMemory(s0.op,addressType,0);
  8512. ReuseCopy(res,s0.op);
  8513. ReleaseOperand(s0);
  8514. Evaluate(p1,s1);
  8515. Emit(Ror(position,res,res,s1.op));
  8516. ReleaseOperand(s1);
  8517. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8518. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8519. InitOperand(result,ModeValue);
  8520. result.op := res;
  8521. (* --- MSK ----*)
  8522. |Global.systemMsk:
  8523. Evaluate(p0,s0);
  8524. Evaluate(p1,s1);
  8525. ReuseCopy(res,s0.op);
  8526. ReleaseOperand(s0);
  8527. Emit(And(position,res,res,s1.op));
  8528. ReleaseOperand(s1);
  8529. InitOperand(result,ModeValue);
  8530. result.op := res;
  8531. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8532. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8533. Evaluate(p0,s0);
  8534. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8535. ReleaseOperand(s0);
  8536. InitOperand(result,ModeValue);
  8537. result.op := res;
  8538. (* ---- SYSTEM.GetStackPointer ----- *)
  8539. |Global.systemGetStackPointer:
  8540. InitOperand(result,ModeValue);
  8541. result.op := sp;
  8542. (* ---- SYSTEM.GetFramePointer ----- *)
  8543. |Global.systemGetFramePointer:
  8544. InitOperand(result,ModeValue);
  8545. result.op := fp;
  8546. (* ---- SYSTEM.GetActivity ----- *)
  8547. |Global.systemGetActivity:
  8548. ASSERT(backend.cooperative);
  8549. InitOperand(result,ModeValue);
  8550. result.op := ap;
  8551. (* ---- SYSTEM.SetStackPointer ----- *)
  8552. |Global.systemSetStackPointer:
  8553. Evaluate(p0,s0); (* *)
  8554. Emit(Mov(position,sp,s0.op));
  8555. ReleaseOperand(s0);
  8556. (* ---- SYSTEM.SetFramePointer ----- *)
  8557. |Global.systemSetFramePointer:
  8558. Evaluate(p0,s0); (* *)
  8559. Emit(Mov(position,fp,s0.op));
  8560. ReleaseOperand(s0);
  8561. (* ---- SYSTEM.Activity ----- *)
  8562. |Global.systemSetActivity:
  8563. ASSERT(backend.cooperative);
  8564. Evaluate(p0,s0); (* *)
  8565. Emit(Mov(position,ap,s0.op));
  8566. ReleaseOperand(s0);
  8567. (* ---- SYSTEM.VAL ----- *)
  8568. |Global.systemVal:
  8569. Expression(p1);
  8570. s1 := result;
  8571. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8572. IF s1.mode = ModeReference THEN
  8573. (* nothing to be done if not record type, just take over new type *)
  8574. IF (type IS SyntaxTree.RecordType) THEN
  8575. ReleaseIntermediateOperand(s1.tag);
  8576. s1.tag := TypeDescriptorAdr(type);
  8577. UseIntermediateOperand(s1.tag);
  8578. END;
  8579. result := s1;
  8580. ELSE (* copy over result to different type, may not use convert *)
  8581. itype := IntermediateCode.GetType(system,type);
  8582. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8583. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8584. Emit(Mov(position,s0.op,s1.op));
  8585. ReleaseOperand(s1);
  8586. InitOperand(result,ModeValue);
  8587. result.op := s0.op;
  8588. ELSE (* different size, must convert *)
  8589. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8590. Convert(s1.op, IntermediateCode.GetType(system,type));
  8591. result := s1;
  8592. END;
  8593. END;
  8594. (* ---- SYSTEM.GET ----- *)
  8595. |Global.systemGet:
  8596. Evaluate(p0,s0); (* adr *)
  8597. Designate(p1,s1); (* variable *)
  8598. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8599. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8600. Emit(Mov(position,s1.op,s0.op));
  8601. ReleaseOperand(s1);
  8602. ReleaseOperand(s0);
  8603. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8604. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8605. Evaluate(p0,s0); (* *)
  8606. Evaluate(p1,s1); (* variable *)
  8607. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8608. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8609. (* real part *)
  8610. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8611. Emit(Mov(position,res, s1.op));
  8612. ReleaseIntermediateOperand(res);
  8613. (* imaginary part *)
  8614. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8615. Emit(Mov(position,res, s1.tag));
  8616. ReleaseIntermediateOperand(res);
  8617. ReleaseOperand(s1);
  8618. ReleaseOperand(s0);
  8619. ELSE
  8620. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8621. ReleaseOperand(s0);
  8622. Emit(Mov(position,res,s1.op));
  8623. ReleaseIntermediateOperand(res);
  8624. ReleaseOperand(s1);
  8625. END;
  8626. (* ---- SYSTEM.MOVE ----- *)
  8627. |Global.systemMove:
  8628. Evaluate(p0,s0);
  8629. Evaluate(p1,s1);
  8630. Evaluate(p2,s2);
  8631. Emit(Copy(position,s1.op,s0.op,s2.op));
  8632. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8633. (* ---- SYSTEM.NEW ----- *)
  8634. |Global.systemNew:
  8635. Designate(p0,s0);
  8636. Emit(Push(position,s0.op));
  8637. ReleaseOperand(s0);
  8638. Evaluate(p1,s1);
  8639. Emit(Push(position,s1.op));
  8640. ReleaseOperand(s1);
  8641. (* push realtime flag: false by default *)
  8642. Emit(Push(position,false));
  8643. CallThis(position,"Heaps","NewSys",3);
  8644. (* ---- SYSTEM.CALL ----- *)
  8645. |Global.systemRef:
  8646. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8647. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8648. s0.mode := ModeValue;
  8649. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8650. result := s0
  8651. (* ---- INCR ----- *)
  8652. |Global.Incr:
  8653. Designate(p0,operand);
  8654. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8655. Dereference(operand,p0.type.resolved,FALSE);
  8656. END;
  8657. ASSERT(p1 # NIL);
  8658. Evaluate(p1,l);
  8659. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8660. ReleaseOperand(operand); ReleaseOperand(l);
  8661. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8662. (* ---- SUM ----- *)
  8663. |Global.Sum: HALT(200);
  8664. (* ---- ALL ----- *)
  8665. |Global.All: HALT(200);
  8666. (* ---- CAS ----- *)
  8667. |Global.Cas:
  8668. needsTrace := p0.NeedsTrace();
  8669. IF needsTrace THEN ModifyAssignments(true) END;
  8670. Designate(p0,s0);
  8671. Evaluate(p1,s1);
  8672. Evaluate(p2,s2);
  8673. IF needsTrace THEN
  8674. Emit(Push(position, s0.op));
  8675. Emit(Push(position, s1.op));
  8676. Emit(Push(position, s2.op));
  8677. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8678. ELSE
  8679. Emit(Cas(position,s0.op,s1.op,s2.op));
  8680. END;
  8681. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8682. IF needsTrace THEN ModifyAssignments(false) END;
  8683. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8684. Emit(Result(position, res));
  8685. result.op := res;
  8686. result.mode := ModeValue;
  8687. (*
  8688. IF conditional THEN
  8689. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8690. BrL(falseLabel);
  8691. ReleaseIntermediateOperand(res);
  8692. END;
  8693. *)
  8694. (* ---- DIM ----- *)
  8695. |Global.Dim:
  8696. Designate(p0,s0);
  8697. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8698. Dereference(s0,p0.type.resolved,FALSE);
  8699. END;
  8700. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8701. ReleaseOperand(s0);
  8702. (* ---- RESHAPE ----- *)
  8703. |Global.Reshape:
  8704. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8705. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8706. left.SetType(procedure.type);
  8707. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8708. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8709. END;
  8710. (* ---- SYSTEM.TYPECODE ----- *)
  8711. |Global.systemTypeCode:
  8712. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8713. IF type.resolved IS SyntaxTree.PointerType THEN
  8714. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8715. END;
  8716. result.op := TypeDescriptorAdr(type);
  8717. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8718. result.mode := ModeValue;
  8719. (* ---- SYSTEM.TRACE ----- *)
  8720. |Global.systemTrace:
  8721. SystemTrace(x.parameters, x.position);
  8722. (* ----- CONNECT ------*)
  8723. |Global.Connect:
  8724. IF backend.cellsAreObjects THEN
  8725. PushPort(p0);
  8726. PushPort(p1);
  8727. IF p2 # NIL THEN
  8728. Evaluate(p2, s2);
  8729. Emit(Push(p2.position, s2.op));
  8730. ReleaseOperand(s2);
  8731. ELSE
  8732. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8733. END;
  8734. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8735. ELSE
  8736. Warning(x.position, "cannot run on final hardware");
  8737. END;
  8738. (* ----- DELEGATE ------*)
  8739. |Global.Delegate:
  8740. IF backend.cellsAreObjects THEN
  8741. PushPort(p0);
  8742. PushPort(p1);
  8743. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8744. ELSE
  8745. Warning(x.position, "cannot run on final hardware");
  8746. END;
  8747. (* ----- SEND ------*)
  8748. |Global.Send:
  8749. Evaluate(p0,s0);
  8750. Evaluate(p1,s1);
  8751. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8752. Emit(Push(position,s0.op));
  8753. Emit(Push(position,s1.op));
  8754. (*
  8755. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8756. *)
  8757. IF ~backend.cellsAreObjects THEN
  8758. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8759. END;
  8760. ReleaseOperand(s0);
  8761. ReleaseOperand(s1);
  8762. IF backend.cellsAreObjects THEN
  8763. CallThis(position,"ActiveCellsRuntime","Send",2);
  8764. ELSE
  8765. CallThis(position,ChannelModuleName,"Send",2);
  8766. END;
  8767. (* ----- RECEIVE ------*)
  8768. |Global.Receive:
  8769. Evaluate(p0,s0);
  8770. Emit(Push(position,s0.op));
  8771. Designate(p1,s1);
  8772. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8773. Emit(Push(position,s1.op));
  8774. IF p2 # NIL THEN
  8775. Designate(p2,s2);
  8776. Emit(Push(position,s2.op));
  8777. END;
  8778. (*
  8779. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8780. *)
  8781. IF ~backend.cellsAreObjects THEN
  8782. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8783. END;
  8784. ReleaseOperand(s0);
  8785. ReleaseOperand(s1);
  8786. ReleaseOperand(s2);
  8787. IF backend.cellsAreObjects THEN
  8788. IF p2 = NIL THEN
  8789. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8790. ELSE
  8791. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8792. END;
  8793. ELSE
  8794. IF p2 = NIL THEN
  8795. CallThis(position,ChannelModuleName,"Receive",2)
  8796. ELSE
  8797. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8798. END;
  8799. END;
  8800. | Global.systemSpecial:
  8801. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8802. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8803. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8804. (* determine if parameters are of the VAR kind *)
  8805. ASSERT(x.parameters.Length() <= 3);
  8806. formalParameter := procedureType.firstParameter;
  8807. FOR i := 0 TO x.parameters.Length() - 1 DO
  8808. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8809. formalParameter := formalParameter.nextParameter
  8810. END;
  8811. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8812. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8813. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8814. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8815. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8816. IF procedureType.returnType # NIL THEN
  8817. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8818. Emit(Result(position, res));
  8819. (*InitOperand(result,ModeValue);
  8820. result.op := res;
  8821. *)
  8822. InitOperand(result,ModeValue); result.op := res;
  8823. END
  8824. ELSE (* function not yet implemented *)
  8825. Error(position,"not yet implemented");
  8826. END;
  8827. destination := dest;
  8828. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8829. END VisitBuiltinCallDesignator;
  8830. PROCEDURE EvaluateBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator; VAR result: Operand);
  8831. VAR
  8832. p0,p1,p2: SyntaxTree.Expression; len: LONGINT; l: Operand; res,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8833. s0,s1,s2: Operand; hint: HUGEINT;
  8834. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  8835. tmp:IntermediateCode.Operand;
  8836. t0,t1,t2: SyntaxTree.Type; ignore: Label;
  8837. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  8838. operand: Operand;
  8839. dest: IntermediateCode.Operand;
  8840. itype: IntermediateCode.Type;
  8841. convert: BOOLEAN;
  8842. customBuiltin: SyntaxTree.CustomBuiltin;
  8843. isVarPar: ARRAY 3 OF BOOLEAN;
  8844. callsection: Sections.Section;
  8845. segmentedName: Basic.SegmentedName;
  8846. needsTrace: BOOLEAN;
  8847. BEGIN
  8848. IF Trace THEN TraceEnter("EvaluateBuiltinCallDesignator") END;
  8849. dest := destination; destination := emptyOperand;
  8850. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  8851. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  8852. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  8853. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  8854. CASE x.id OF
  8855. (* ---- ASH, LSH, ROT ----- *)
  8856. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  8857. EvaluateX(p0, s0);
  8858. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  8859. (* make unsigned arguments in order to produced a logical shift *)
  8860. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  8861. convert:= TRUE;
  8862. itype := s0.op.type;
  8863. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  8864. Convert(s0.op,itype);
  8865. ELSE
  8866. convert := FALSE;
  8867. END;
  8868. END;
  8869. EvaluateX(p1,s1);
  8870. IF IsIntegerConstant(p1,hint) THEN
  8871. ReuseCopy(reg,s0.op);
  8872. IF hint > 0 THEN
  8873. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  8874. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  8875. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  8876. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  8877. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  8878. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  8879. END;
  8880. ELSIF hint < 0 THEN
  8881. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  8882. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  8883. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  8884. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  8885. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  8886. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  8887. END;
  8888. END;
  8889. ReleaseOperand(s0); ReleaseOperand(s1);
  8890. ELSE
  8891. exit := NewLabel();
  8892. end := NewLabel();
  8893. ReuseCopy(reg,s0.op);
  8894. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  8895. Reuse1(tmp,s1.op);
  8896. Emit(Neg(position,tmp,s1.op));
  8897. Convert(tmp,s1.op.type);
  8898. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  8899. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  8900. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  8901. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  8902. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  8903. END;
  8904. ReleaseIntermediateOperand(tmp);
  8905. BrL(end);
  8906. SetLabel(exit);
  8907. ReuseCopy(tmp,s1.op);
  8908. Convert(tmp,s1.op.type);
  8909. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  8910. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  8911. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  8912. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  8913. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  8914. END;
  8915. ReleaseIntermediateOperand(tmp);
  8916. SetLabel(end);
  8917. ReleaseOperand(s0); ReleaseOperand(s1);
  8918. END;
  8919. InitOperand(result,ModeValue);
  8920. IF convert THEN
  8921. itype := reg.type;
  8922. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  8923. Convert(reg,itype);
  8924. END;
  8925. result.op := reg;
  8926. (* ---- CAP ----- *)
  8927. |Global.Cap:
  8928. EvaluateX(p0,result);
  8929. ReuseCopy(reg,result.op);
  8930. ReleaseIntermediateOperand(result.op);
  8931. ignore := NewLabel();
  8932. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  8933. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  8934. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  8935. SetLabel(ignore);
  8936. result.op := reg;
  8937. (* ---- CHR ----- *)
  8938. |Global.Chr, Global.Chr32:
  8939. EvaluateX(p0, result);
  8940. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8941. |Global.Entier, Global.EntierH:
  8942. EvaluateX(p0, result);
  8943. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8944. (* ---- MIN and MAX ----- *)
  8945. |Global.Max,Global.Min:
  8946. EvaluateX(p0, s0);
  8947. EvaluateX(p1, s1);
  8948. Reuse2(res,s0.op,s1.op);
  8949. else := NewLabel();
  8950. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  8951. ELSE BrltL(else,s1.op,s0.op) END;
  8952. Emit(Mov(position,res,s0.op));
  8953. ReleaseOperand(s0);
  8954. end := NewLabel();
  8955. BrL(end);
  8956. SetLabel(else);
  8957. Emit(MovReplace(position,res,s1.op));
  8958. SetLabel(end);
  8959. ReleaseOperand(s1);
  8960. InitOperand(result,ModeValue);
  8961. result.op := res;
  8962. (* ---- ODD ----- *)
  8963. |Global.Odd:
  8964. EvaluateX(p0, result);
  8965. Reuse1(res,result.op);
  8966. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8967. ReleaseIntermediateOperand(result.op);
  8968. result.op := res;
  8969. Convert(result.op,bool);
  8970. (* ---- ORD ----- *)
  8971. |Global.Ord, Global.Ord32:
  8972. EvaluateX(p0, result);
  8973. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8974. (* ---- SHORT, LONG ----- *)
  8975. |Global.Short, Global.Long:
  8976. EvaluateX(p0, result);
  8977. IF x.type IS SyntaxTree.ComplexType THEN
  8978. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8979. Convert(result.op, IntermediateCode.GetType(system, componentType));
  8980. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  8981. ELSE
  8982. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8983. END
  8984. (* ---- LEN ----- *)
  8985. |Global.Len: (* dynamic length, static length done by checker *)
  8986. Designate(p0,operand);
  8987. IF p1 = NIL THEN
  8988. InitOperand(l,ModeValue);
  8989. l.op := IntermediateCode.Immediate(sizeType,0);
  8990. ELSE
  8991. Evaluate(p1,l);
  8992. END;
  8993. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  8994. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  8995. Dereference(operand, p0.type.resolved, FALSE);
  8996. END;
  8997. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  8998. ReleaseOperand(operand); ReleaseOperand(l);
  8999. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  9000. ASSERT(p1 # NIL);
  9001. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9002. Dereference(operand,p0.type.resolved,FALSE);
  9003. END;
  9004. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  9005. ReleaseOperand(operand); ReleaseOperand(l);
  9006. ELSE HALT(100);
  9007. END;
  9008. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9009. (* ---- FIRST ---- *)
  9010. |Global.First:
  9011. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9012. EvaluateX(p0(SyntaxTree.RangeExpression).first, result)
  9013. ELSE
  9014. Designate(p0, result)
  9015. END
  9016. (* ---- LAST ---- *)
  9017. |Global.Last:
  9018. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9019. EvaluateX(p0(SyntaxTree.RangeExpression).last, result)
  9020. ELSE
  9021. Designate(p0, result);
  9022. (* make sure result.op is a register *)
  9023. tmp := result.op;
  9024. ReuseCopy(result.op, result.op);
  9025. ReleaseIntermediateOperand(tmp);
  9026. (* add offset to result.op *)
  9027. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9028. END
  9029. (* ---- STEP ---- *)
  9030. |Global.Step:
  9031. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9032. EvaluateX(p0(SyntaxTree.RangeExpression).step, result)
  9033. ELSE
  9034. Designate(p0, result);
  9035. (* make sure result.op is a register *)
  9036. tmp := result.op;
  9037. ReuseCopy(result.op, result.op);
  9038. ReleaseIntermediateOperand(tmp);
  9039. (* add offset to result.op *)
  9040. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9041. END
  9042. (* ---- RE ---- *)
  9043. |Global.Re:
  9044. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  9045. Designate(p0, result)
  9046. ELSE
  9047. EvaluateX(p0, result)
  9048. END
  9049. (* ---- IM ---- *)
  9050. |Global.Im:
  9051. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  9052. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  9053. Designate(p0, result);
  9054. (* make sure result.op is a register *)
  9055. tmp := result.op;
  9056. ReuseCopy(result.op, result.op);
  9057. ReleaseIntermediateOperand(tmp);
  9058. (* add offset to result.op *)
  9059. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  9060. (* ---- ABS ----- *)
  9061. |Global.Abs:
  9062. EvaluateX(p0,operand);
  9063. type := p0.type.resolved;
  9064. InitOperand(result,ModeValue);
  9065. Reuse1a(result.op,operand.op,dest);
  9066. Emit(Abs(position,result.op,operand.op));
  9067. ReleaseOperand(operand);
  9068. (* ---- ADDRESSOF----- *)
  9069. |Global.systemAdr:
  9070. Designate(p0,s0);
  9071. s0.mode := ModeValue;
  9072. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  9073. ReleaseIntermediateOperand(s0.op);
  9074. s0.op := s0.tag;
  9075. IntermediateCode.InitOperand(s0.tag);
  9076. END;
  9077. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  9078. result := s0;
  9079. (* ---- BIT ----- *)
  9080. |Global.systemBit:
  9081. EvaluateX(p0,s0);
  9082. ToMemory(s0.op,addressType,0);
  9083. ReuseCopy(res,s0.op);
  9084. ReleaseOperand(s0);
  9085. EvaluateX(p1, s1);
  9086. Emit(Ror(position,res,res,s1.op));
  9087. ReleaseOperand(s1);
  9088. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  9089. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  9090. InitOperand(result,ModeValue);
  9091. result.op := res;
  9092. (* --- MSK ----*)
  9093. |Global.systemMsk:
  9094. EvaluateX(p0, s0);
  9095. EvaluateX(p1, s1);
  9096. ReuseCopy(res,s0.op);
  9097. ReleaseOperand(s0);
  9098. Emit(And(position,res,res,s1.op));
  9099. ReleaseOperand(s1);
  9100. InitOperand(result,ModeValue);
  9101. result.op := res;
  9102. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  9103. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  9104. EvaluateX(p0, s0);
  9105. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  9106. ReleaseOperand(s0);
  9107. InitOperand(result,ModeValue);
  9108. result.op := res;
  9109. (* ---- SYSTEM.GetStackPointer ----- *)
  9110. |Global.systemGetStackPointer:
  9111. InitOperand(result,ModeValue);
  9112. result.op := sp;
  9113. (* ---- SYSTEM.GetFramePointer ----- *)
  9114. |Global.systemGetFramePointer:
  9115. InitOperand(result,ModeValue);
  9116. result.op := fp;
  9117. (* ---- SYSTEM.GetActivity ----- *)
  9118. |Global.systemGetActivity:
  9119. ASSERT(backend.cooperative);
  9120. InitOperand(result,ModeValue);
  9121. result.op := ap;
  9122. (* ---- SYSTEM.SetStackPointer ----- *)
  9123. |Global.systemSetStackPointer:
  9124. Evaluate(p0,s0); (* *)
  9125. Emit(Mov(position,sp,s0.op));
  9126. ReleaseOperand(s0);
  9127. (* ---- SYSTEM.SetFramePointer ----- *)
  9128. |Global.systemSetFramePointer:
  9129. Evaluate(p0,s0); (* *)
  9130. Emit(Mov(position,fp,s0.op));
  9131. ReleaseOperand(s0);
  9132. (* ---- SYSTEM.Activity ----- *)
  9133. |Global.systemSetActivity:
  9134. ASSERT(backend.cooperative);
  9135. Evaluate(p0,s0); (* *)
  9136. Emit(Mov(position,ap,s0.op));
  9137. ReleaseOperand(s0);
  9138. (* ---- SYSTEM.VAL ----- *)
  9139. |Global.systemVal:
  9140. Expression(p1);
  9141. s1 := result;
  9142. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9143. IF s1.mode = ModeReference THEN
  9144. (* nothing to be done if not record type, just take over new type *)
  9145. IF (type IS SyntaxTree.RecordType) THEN
  9146. ReleaseIntermediateOperand(s1.tag);
  9147. s1.tag := TypeDescriptorAdr(type);
  9148. UseIntermediateOperand(s1.tag);
  9149. END;
  9150. result := s1;
  9151. ELSE (* copy over result to different type, may not use convert *)
  9152. itype := IntermediateCode.GetType(system,type);
  9153. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  9154. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  9155. Emit(Mov(position,s0.op,s1.op));
  9156. ReleaseOperand(s1);
  9157. InitOperand(result,ModeValue);
  9158. result.op := s0.op;
  9159. ELSE (* different size, must convert *)
  9160. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  9161. Convert(s1.op, IntermediateCode.GetType(system,type));
  9162. result := s1;
  9163. END;
  9164. END;
  9165. (* ---- SYSTEM.GET ----- *)
  9166. |Global.systemGet:
  9167. Evaluate(p0,s0); (* adr *)
  9168. Designate(p1,s1); (* variable *)
  9169. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  9170. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  9171. Emit(Mov(position,s1.op,s0.op));
  9172. ReleaseOperand(s1);
  9173. ReleaseOperand(s0);
  9174. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  9175. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  9176. Evaluate(p0,s0); (* *)
  9177. Evaluate(p1,s1); (* variable *)
  9178. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  9179. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  9180. (* real part *)
  9181. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  9182. Emit(Mov(position,res, s1.op));
  9183. ReleaseIntermediateOperand(res);
  9184. (* imaginary part *)
  9185. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9186. Emit(Mov(position,res, s1.tag));
  9187. ReleaseIntermediateOperand(res);
  9188. ReleaseOperand(s1);
  9189. ReleaseOperand(s0);
  9190. ELSE
  9191. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  9192. ReleaseOperand(s0);
  9193. Emit(Mov(position,res,s1.op));
  9194. ReleaseIntermediateOperand(res);
  9195. ReleaseOperand(s1);
  9196. END;
  9197. (* ---- SYSTEM.MOVE ----- *)
  9198. |Global.systemMove:
  9199. Evaluate(p0,s0);
  9200. Evaluate(p1,s1);
  9201. Evaluate(p2,s2);
  9202. Emit(Copy(position,s1.op,s0.op,s2.op));
  9203. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9204. (* ---- SYSTEM.NEW ----- *)
  9205. |Global.systemNew:
  9206. Designate(p0,s0);
  9207. Emit(Push(position,s0.op));
  9208. ReleaseOperand(s0);
  9209. Evaluate(p1,s1);
  9210. Emit(Push(position,s1.op));
  9211. ReleaseOperand(s1);
  9212. (* push realtime flag: false by default *)
  9213. Emit(Push(position,false));
  9214. CallThis(position,"Heaps","NewSys",3);
  9215. (* ---- SYSTEM.CALL ----- *)
  9216. |Global.systemRef:
  9217. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  9218. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  9219. s0.mode := ModeValue;
  9220. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  9221. result := s0
  9222. (* ---- INCR ----- *)
  9223. |Global.Incr:
  9224. Designate(p0,operand);
  9225. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9226. Dereference(operand,p0.type.resolved,FALSE);
  9227. END;
  9228. ASSERT(p1 # NIL);
  9229. Evaluate(p1,l);
  9230. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  9231. ReleaseOperand(operand); ReleaseOperand(l);
  9232. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9233. (* ---- SUM ----- *)
  9234. |Global.Sum: HALT(200);
  9235. (* ---- ALL ----- *)
  9236. |Global.All: HALT(200);
  9237. (* ---- CAS ----- *)
  9238. |Global.Cas:
  9239. needsTrace := p0.NeedsTrace();
  9240. IF needsTrace THEN ModifyAssignments(true) END;
  9241. Designate(p0,s0);
  9242. Evaluate(p1,s1);
  9243. Evaluate(p2,s2);
  9244. IF needsTrace THEN
  9245. Emit(Push(position, s0.op));
  9246. Emit(Push(position, s1.op));
  9247. Emit(Push(position, s2.op));
  9248. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  9249. ELSE
  9250. Emit(Cas(position,s0.op,s1.op,s2.op));
  9251. END;
  9252. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9253. IF needsTrace THEN ModifyAssignments(false) END;
  9254. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  9255. Emit(Result(position, res));
  9256. result.op := res;
  9257. result.mode := ModeValue;
  9258. (*
  9259. IF conditional THEN
  9260. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  9261. BrL(falseLabel);
  9262. ReleaseIntermediateOperand(res);
  9263. END;
  9264. *)
  9265. (* ---- DIM ----- *)
  9266. |Global.Dim:
  9267. Designate(p0,s0);
  9268. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9269. Dereference(s0,p0.type.resolved,FALSE);
  9270. END;
  9271. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  9272. ReleaseOperand(s0);
  9273. (* ---- SYSTEM.TYPECODE ----- *)
  9274. |Global.systemTypeCode:
  9275. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9276. IF type.resolved IS SyntaxTree.PointerType THEN
  9277. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  9278. END;
  9279. result.op := TypeDescriptorAdr(type);
  9280. Convert(result.op, IntermediateCode.GetType(system,x.type));
  9281. result.mode := ModeValue;
  9282. (* ---- SYSTEM.TRACE ----- *)
  9283. |Global.systemTrace:
  9284. SystemTrace(x.parameters, x.position);
  9285. (* ----- CONNECT ------*)
  9286. |Global.Connect:
  9287. IF backend.cellsAreObjects THEN
  9288. PushPort(p0);
  9289. PushPort(p1);
  9290. IF p2 # NIL THEN
  9291. Evaluate(p2, s2);
  9292. Emit(Push(p2.position, s2.op));
  9293. ReleaseOperand(s2);
  9294. ELSE
  9295. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  9296. END;
  9297. CallThis(position,"ActiveCellsRuntime","Connect",3);
  9298. ELSE
  9299. Warning(x.position, "cannot run on final hardware");
  9300. END;
  9301. | Global.systemSpecial:
  9302. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  9303. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  9304. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  9305. (* determine if parameters are of the VAR kind *)
  9306. ASSERT(x.parameters.Length() <= 3);
  9307. formalParameter := procedureType.firstParameter;
  9308. FOR i := 0 TO x.parameters.Length() - 1 DO
  9309. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  9310. formalParameter := formalParameter.nextParameter
  9311. END;
  9312. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  9313. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  9314. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  9315. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  9316. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9317. IF procedureType.returnType # NIL THEN
  9318. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9319. Emit(Result(position, res));
  9320. (*InitOperand(result,ModeValue);
  9321. result.op := res;
  9322. *)
  9323. InitOperand(result,ModeValue); result.op := res;
  9324. END
  9325. ELSE (* function not yet implemented *)
  9326. Error(position,"not yet implemented");
  9327. END;
  9328. destination := dest;
  9329. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  9330. END EvaluateBuiltinCallDesignator;
  9331. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  9332. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  9333. BEGIN
  9334. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  9335. dest := destination; destination := emptyOperand;
  9336. Expression(x.left);
  9337. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  9338. ELSIF isUnchecked THEN (* no check *)
  9339. ELSE
  9340. trueL := NewLabel();
  9341. IF IsPointerToRecord(x.left.type,recordType) THEN
  9342. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  9343. Emit(Mov(position,tag, result.op));
  9344. IF result.mode # ModeValue THEN
  9345. ptr := tag;
  9346. IntermediateCode.MakeMemory(ptr,addressType);
  9347. Emit(Mov(position,tag, ptr));
  9348. END;
  9349. IF ~backend.cooperative THEN
  9350. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9351. END;
  9352. IntermediateCode.MakeMemory(tag,addressType);
  9353. ELSE
  9354. tag := result.tag;
  9355. UseIntermediateOperand(tag);
  9356. END;
  9357. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  9358. ReleaseIntermediateOperand(tag);
  9359. EmitTrap(position,TypeCheckTrap);
  9360. SetLabel(trueL);
  9361. END;
  9362. destination := dest;
  9363. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  9364. END VisitTypeGuardDesignator;
  9365. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  9366. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  9367. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  9368. VAR label: Label; pc: LONGINT;
  9369. BEGIN
  9370. IF backend.cooperative & ~isUnchecked THEN
  9371. pc := section.pc;
  9372. label := NewLabel();
  9373. BrneL(label, operand.op, nil);
  9374. EmitTrap(position, NilPointerTrap);
  9375. SetLabel(label);
  9376. INC(statCoopNilCheck, section.pc - pc);
  9377. END;
  9378. END NilCheck;
  9379. BEGIN
  9380. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  9381. ReuseCopy(dereferenced,operand.op);
  9382. ReleaseOperand(operand);
  9383. operand.mode := ModeReference;
  9384. operand.op := dereferenced;
  9385. operand.tag := dereferenced;
  9386. UseIntermediateOperand(operand.tag);
  9387. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  9388. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  9389. ReleaseIntermediateOperand(operand.tag);
  9390. operand.tag := TypeDescriptorAdr(type);
  9391. ELSE
  9392. IF ~backend.cooperative THEN
  9393. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9394. END;
  9395. IntermediateCode.MakeMemory(operand.tag,addressType);
  9396. END;
  9397. NilCheck(operand.op);
  9398. ELSIF type IS SyntaxTree.ArrayType THEN
  9399. IF isUnsafe THEN
  9400. NilCheck(operand.op);
  9401. ReleaseIntermediateOperand(operand.tag);
  9402. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  9403. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9404. ELSE
  9405. operand.tag := emptyOperand;
  9406. END;
  9407. ELSE
  9408. NilCheck(operand.op);
  9409. IF backend.cooperative THEN
  9410. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  9411. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9412. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  9413. ELSE
  9414. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  9415. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  9416. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9417. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  9418. END;
  9419. END;
  9420. ELSIF type IS SyntaxTree.MathArrayType THEN
  9421. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9422. IntermediateCode.MakeMemory(operand.op,addressType);
  9423. ELSE HALT(100);
  9424. END;
  9425. END Dereference;
  9426. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  9427. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  9428. BEGIN
  9429. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  9430. dest := destination; destination := emptyOperand;
  9431. Evaluate(x.left,d);
  9432. type := x.type.resolved;
  9433. prevIsUnchecked := isUnchecked;
  9434. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  9435. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  9436. END;
  9437. Dereference(d,type,IsUnsafePointer(x.left.type));
  9438. isUnchecked := prevIsUnchecked;
  9439. result := d;
  9440. 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
  9441. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  9442. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9443. END;
  9444. END;
  9445. destination := dest;
  9446. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  9447. END VisitDereferenceDesignator;
  9448. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  9449. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  9450. BEGIN
  9451. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  9452. dest := destination; destination := emptyOperand;
  9453. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  9454. tag := result.op;
  9455. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  9456. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  9457. StaticCallOperand(result,procedure.super);
  9458. ReleaseIntermediateOperand(result.tag);
  9459. UseIntermediateOperand(tag); (* necessary ? *)
  9460. result.tag := tag;
  9461. destination := dest;
  9462. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  9463. END VisitSupercallDesignator;
  9464. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  9465. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  9466. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9467. name: Basic.SegmentedName;
  9468. procedure: SyntaxTree.Procedure;
  9469. procedureType: SyntaxTree.ProcedureType;
  9470. BEGIN
  9471. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  9472. dest := destination; destination := emptyOperand;
  9473. scope := currentScope;
  9474. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9475. scope := scope.outerScope;
  9476. END;
  9477. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9478. moduleSection := meta.ModuleSection();
  9479. IF backend.cooperative THEN
  9480. moduleOffset := 0;
  9481. ELSE
  9482. moduleOffset := moduleSection.pc;
  9483. END;
  9484. result.mode := ModeValue;
  9485. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9486. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9487. result.mode := ModeValue;
  9488. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  9489. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  9490. ELSE
  9491. GetBaseRegister(basereg,currentScope,scope);
  9492. InitOperand(result,ModeReference);
  9493. result.op := basereg;
  9494. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9495. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9496. parametersSize := ProcParametersSize(procedure);
  9497. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9498. IF backend.cooperative THEN
  9499. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  9500. END;
  9501. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  9502. MakeMemory(result.op, result.op, addressType, 0);
  9503. END;
  9504. (* tag must be loaded when dereferencing SELF pointer *)
  9505. END;
  9506. destination := dest;
  9507. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  9508. END VisitSelfDesignator;
  9509. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  9510. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  9511. BEGIN
  9512. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  9513. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9514. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9515. parameter := procedureType.returnParameter;
  9516. IF currentIsInline THEN
  9517. map := currentMapper.Get(NIL);
  9518. IF map # NIL THEN
  9519. Designate(map.to, result);
  9520. ELSE
  9521. HALT(200);
  9522. END;
  9523. RETURN;
  9524. END;
  9525. VisitParameter(parameter);
  9526. IF Trace THEN TraceExit("VisitResultDesignator") END;
  9527. END VisitResultDesignator;
  9528. (** values *)
  9529. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  9530. BEGIN
  9531. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  9532. InitOperand(result,ModeValue);
  9533. IF x.value THEN result.op := true ELSE result.op := false END;
  9534. END VisitBooleanValue;
  9535. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  9536. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  9537. BEGIN
  9538. Global.GetModuleSegmentedName(module.module, name);
  9539. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  9540. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  9541. RETURN section
  9542. END GetDataSection;
  9543. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  9544. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  9545. BEGIN
  9546. type := vop.type;
  9547. data := GetDataSection();
  9548. pc := EnterImmediate(data,vop);
  9549. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  9550. IntermediateCode.MakeMemory(vop, type);
  9551. END GetImmediateMem;
  9552. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  9553. BEGIN
  9554. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  9555. InitOperand(result,ModeValue);
  9556. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9557. IF ~supportedImmediate(result.op) &~inData THEN
  9558. GetImmediateMem(result.op)
  9559. END;
  9560. END VisitIntegerValue;
  9561. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  9562. BEGIN
  9563. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  9564. InitOperand(result,ModeValue);
  9565. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  9566. END VisitCharacterValue;
  9567. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  9568. BEGIN
  9569. IF Trace THEN TraceEnter("VisitSetValue") END;
  9570. InitOperand(result,ModeValue);
  9571. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  9572. END VisitSetValue;
  9573. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  9574. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  9575. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  9576. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  9577. BEGIN
  9578. numberElements := x.elements.Length();
  9579. FOR i := 0 TO numberElements-1 DO
  9580. expression := x.elements.GetExpression(i);
  9581. IF expression IS SyntaxTree.MathArrayExpression THEN
  9582. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  9583. ELSE
  9584. inData := TRUE;
  9585. Evaluate(expression,op);
  9586. irv.Emit(Data(position,op.op));
  9587. inData := FALSE;
  9588. ReleaseOperand(op);
  9589. END;
  9590. END;
  9591. END RecursiveData;
  9592. BEGIN
  9593. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  9594. IF ~TryConstantDeclaration() THEN
  9595. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9596. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9597. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9598. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  9599. ELSE
  9600. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9601. END;
  9602. RecursiveData(x.array);
  9603. InitOperand(result,ModeReference);
  9604. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9605. END
  9606. END VisitMathArrayValue;
  9607. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  9608. VAR constant: Sections.Section;
  9609. BEGIN
  9610. IF constantDeclaration = NIL THEN
  9611. RETURN FALSE
  9612. ELSE
  9613. (* Is a constant in this module: did we generate it already? *)
  9614. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  9615. IF constant # NIL THEN
  9616. InitOperand(result,ModeReference);
  9617. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  9618. RETURN TRUE;
  9619. END;
  9620. END;
  9621. RETURN FALSE
  9622. END TryConstantDeclaration;
  9623. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  9624. BEGIN
  9625. constantDeclaration := x;
  9626. VExpression(x.value.resolved);
  9627. END VisitConstant;
  9628. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  9629. BEGIN
  9630. IF Trace THEN TraceEnter("VisitRealValue") END;
  9631. InitOperand(result,ModeValue);
  9632. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9633. END VisitRealValue;
  9634. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  9635. VAR
  9636. componentType: SyntaxTree.Type;
  9637. BEGIN
  9638. IF Trace THEN TraceEnter("VisitComplexValue") END;
  9639. ASSERT(x.type IS SyntaxTree.ComplexType);
  9640. componentType := x.type(SyntaxTree.ComplexType).componentType;
  9641. InitOperand(result,ModeValue);
  9642. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  9643. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  9644. END VisitComplexValue;
  9645. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  9646. VAR i: LONGINT; name: Basic.SegmentedName;
  9647. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  9648. BEGIN
  9649. IF Trace THEN TraceEnter("VisitStringValue") END;
  9650. IF ~TryConstantDeclaration() THEN
  9651. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9652. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9653. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9654. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9655. ELSE
  9656. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9657. END;
  9658. FOR i := 0 TO x.length-1 DO
  9659. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  9660. irv.Emit(Data(position,op));
  9661. END;
  9662. InitOperand(result,ModeReference);
  9663. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9664. result.tag := IntermediateCode.Immediate(addressType,x.length);
  9665. END
  9666. END VisitStringValue;
  9667. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  9668. BEGIN
  9669. IF Trace THEN TraceEnter("VisitNilValue") END;
  9670. InitOperand(result,ModeValue);
  9671. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9672. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9673. END VisitNilValue;
  9674. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  9675. BEGIN
  9676. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  9677. InitOperand(result,ModeValue);
  9678. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  9679. END VisitEnumerationValue;
  9680. (** symbols *)
  9681. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  9682. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  9683. END VisitImport;
  9684. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  9685. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  9686. BEGIN
  9687. IF scope # baseScope THEN
  9688. (* left := [fp+8] *)
  9689. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  9690. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9691. ReuseCopy(left,right);
  9692. ReleaseIntermediateOperand(right);
  9693. scope := scope.outerScope; DEC(level);
  9694. (* { left := [left+8] } *)
  9695. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  9696. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9697. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  9698. Emit(Mov(position,left,right));
  9699. scope := scope.outerScope; DEC(level);
  9700. END;
  9701. ASSERT((scope = baseScope) OR (baseScope = NIL));
  9702. result := left;
  9703. ELSE
  9704. result := fp;
  9705. END;
  9706. END GetBaseRegister;
  9707. (* EXPERIMENTAL *)
  9708. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  9709. VAR i: WORD;
  9710. BEGIN
  9711. IF ~backend.experiment THEN RETURN -1 END;
  9712. i := 0;
  9713. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  9714. INC(i);
  9715. END;
  9716. IF availableSymbols[i].symbol = NIL THEN
  9717. availableSymbols[i].inRegister := FALSE;
  9718. availableSymbols[i].inMemory := TRUE;
  9719. availableSymbols[i].symbol := x;
  9720. END;
  9721. RETURN i;
  9722. END GetAvailability;
  9723. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  9724. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  9725. BEGIN
  9726. IF Trace THEN TraceEnter("VisitVariable"); END;
  9727. type := x.type.resolved;
  9728. IF (x.useRegister) THEN
  9729. InitOperand(result, ModeValue);
  9730. IF x.registerNumber < 0 THEN
  9731. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  9732. reg := x.registerNumber;
  9733. ELSE
  9734. reg := registerUsageCount.Map(x.registerNumber);
  9735. UseRegister(reg);
  9736. END;
  9737. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  9738. ELSIF x.externalName # NIL THEN
  9739. InitOperand(result,ModeReference);
  9740. Basic.ToSegmentedName(x.externalName^, name);
  9741. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  9742. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  9743. InitOperand(result,ModeReference);
  9744. GetBaseRegister(result.op,currentScope,x.scope);
  9745. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9746. (* EXPERIMENTAL *)
  9747. result.availability := GetAvailability(x);
  9748. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  9749. InitOperand(result,ModeReference);
  9750. GetCodeSectionNameForSymbol(x,name);
  9751. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9752. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9753. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  9754. InitOperand(result,ModeReference);
  9755. GetCodeSectionNameForSymbol(x,name);
  9756. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9757. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  9758. ELSE (* field, left designator must have been emitted *)
  9759. ASSERT(result.mode = ModeReference);
  9760. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9761. ReuseCopy(temp,result.op);
  9762. ReleaseIntermediateOperand(result.op);
  9763. result.op := temp;
  9764. END;
  9765. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9766. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  9767. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9768. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  9769. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9770. END;
  9771. END;
  9772. END;
  9773. IF type IS SyntaxTree.ProcedureType THEN
  9774. ReleaseIntermediateOperand(result.tag);
  9775. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9776. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9777. UseIntermediateOperand(result.tag);
  9778. ELSE
  9779. result.tag := nil; (* nil *)
  9780. END;
  9781. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9782. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  9783. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9784. ReleaseIntermediateOperand(result.tag);
  9785. Global.GetSymbolSegmentedName(x,name);
  9786. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  9787. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  9788. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  9789. ELSE
  9790. END;
  9791. ELSE
  9792. ReleaseIntermediateOperand(result.tag);
  9793. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9794. END;
  9795. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9796. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  9797. ReleaseIntermediateOperand(result.tag);
  9798. result.tag := result.op;
  9799. UseIntermediateOperand(result.tag);
  9800. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9801. IntermediateCode.MakeMemory(result.op,addressType);
  9802. END;
  9803. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  9804. ReleaseIntermediateOperand(result.tag);
  9805. result.tag := TypeDescriptorAdr(type);
  9806. UseIntermediateOperand(result.tag);
  9807. (* tag for pointer type computed not here but during dereferencing *)
  9808. END;
  9809. IF Trace THEN TraceExit("VisitVariable") END;
  9810. END VisitVariable;
  9811. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  9812. BEGIN
  9813. VisitVariable(property);
  9814. END VisitProperty;
  9815. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  9816. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  9817. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  9818. BEGIN
  9819. type := x.type.resolved;
  9820. IF Trace THEN TraceEnter("VisitParameter") END;
  9821. IF x.ownerType IS SyntaxTree.CellType THEN
  9822. ptype := x.type.resolved;
  9823. IF backend.cellsAreObjects THEN
  9824. ASSERT(result.mode = ModeReference);
  9825. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9826. ReuseCopy(temp,result.op);
  9827. ReleaseIntermediateOperand(result.op);
  9828. result.op := temp;
  9829. END;
  9830. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9831. RETURN;
  9832. ELSE
  9833. InitOperand(result,ModeReference);
  9834. GetCodeSectionNameForSymbol(x,name);
  9835. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9836. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9837. RETURN;
  9838. END;
  9839. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9840. InitOperand(result,ModeReference);
  9841. GetCodeSectionNameForSymbol(x,name);
  9842. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9843. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9844. RETURN
  9845. ELSE
  9846. GetBaseRegister(basereg,currentScope,x.scope);
  9847. InitOperand(result,ModeReference);
  9848. result.op := basereg;
  9849. END;
  9850. IF IsOpenArray(type) THEN
  9851. result.tag := basereg;
  9852. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9853. IntermediateCode.MakeMemory(result.op,addressType);
  9854. IF Global.IsOberonProcedure(x.ownerType) THEN
  9855. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9856. UseIntermediateOperand(result.tag);
  9857. ELSE
  9858. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9859. END;
  9860. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9861. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9862. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9863. ELSIF IsStaticArray(type) THEN
  9864. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9865. IntermediateCode.MakeMemory(result.op,addressType);
  9866. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9867. ELSIF type IS SyntaxTree.MathArrayType THEN
  9868. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9869. WITH type: SyntaxTree.MathArrayType DO
  9870. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9871. IF type.form = SyntaxTree.Tensor THEN
  9872. ELSIF type.form = SyntaxTree.Open THEN
  9873. result.tag := result.op;
  9874. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9875. IntermediateCode.MakeMemory(result.op,addressType);
  9876. UseIntermediateOperand(result.tag);
  9877. ELSIF type.form = SyntaxTree.Static THEN
  9878. IF x.kind = SyntaxTree.ConstParameter THEN
  9879. IntermediateCode.MakeMemory(result.op,addressType);
  9880. END;
  9881. ELSE HALT(100)
  9882. END;
  9883. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9884. IF type.form = SyntaxTree.Tensor THEN
  9885. ToMemory(result.op,addressType,0);
  9886. ELSIF type.form = SyntaxTree.Open THEN
  9887. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9888. ReuseCopy(result.tag, mem);
  9889. ReleaseIntermediateOperand(mem);
  9890. ReleaseIntermediateOperand(result.op);
  9891. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9892. ELSIF type.form = SyntaxTree.Static THEN
  9893. IntermediateCode.MakeMemory(result.op,addressType);
  9894. ELSE HALT(100)
  9895. END;
  9896. ELSE HALT(100)
  9897. END;
  9898. END;
  9899. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9900. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9901. IntermediateCode.MakeMemory(result.op,addressType);
  9902. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9903. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9904. END;
  9905. IF type IS SyntaxTree.ProcedureType THEN
  9906. ReleaseIntermediateOperand(result.tag);
  9907. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9908. IF x.kind = SyntaxTree.VarParameter THEN
  9909. ReuseCopy(result.tag,result.op);
  9910. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9911. IntermediateCode.MakeMemory(result.tag,addressType);
  9912. ELSE
  9913. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9914. UseIntermediateOperand(result.tag);
  9915. END;
  9916. ELSE
  9917. result.tag := nil;
  9918. END;
  9919. (* tag for pointer type computed not here but during dereferencing *)
  9920. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) (* & ~(x.selfParameter) *) THEN
  9921. ReleaseIntermediateOperand(result.tag);
  9922. result.tag := basereg;
  9923. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9924. IntermediateCode.MakeMemory(result.tag,addressType);
  9925. UseIntermediateOperand(result.tag);
  9926. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9927. ReleaseIntermediateOperand(result.tag);
  9928. result.tag := TypeDescriptorAdr(type);
  9929. UseIntermediateOperand(result.tag);
  9930. END;
  9931. IF Trace THEN TraceExit("VisitParameter") END;
  9932. END VisitParameter;
  9933. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9934. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9935. BEGIN
  9936. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9937. (* left.p: left already emitted *)
  9938. tag := result.op; (* value of pointer to left *)
  9939. (* get type desc *)
  9940. tmp := result.tag;
  9941. IntermediateCode.MakeMemory(tmp,addressType);
  9942. (* get method adr *)
  9943. Reuse1(reg,tmp);
  9944. ReleaseIntermediateOperand(tmp);
  9945. IF backend.cooperative THEN
  9946. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9947. WHILE recordType.baseType # NIL DO
  9948. recordType := recordType.GetBaseRecord ();
  9949. END;
  9950. GetRecordTypeName (recordType,name);
  9951. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9952. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9953. offset := 0;
  9954. ELSE
  9955. offset := 2;
  9956. END;
  9957. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9958. ELSIF meta.simple THEN
  9959. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9960. ELSE
  9961. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9962. END;
  9963. InitOperand(operand,ModeReference);
  9964. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9965. operand.op := reg;
  9966. operand.tag := tag;
  9967. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9968. END DynamicCallOperand;
  9969. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9970. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9971. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9972. BEGIN
  9973. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9974. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9975. tag := operand.op;
  9976. ReleaseIntermediateOperand(operand.tag);
  9977. ELSE tag := nil
  9978. END;
  9979. IF x.isInline THEN
  9980. sectionType := Sections.InlineCodeSection;
  9981. ELSE
  9982. sectionType := Sections.CodeSection;
  9983. END;
  9984. IF x.externalName # NIL THEN
  9985. Basic.ToSegmentedName(x.externalName^, name);
  9986. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9987. ELSE
  9988. GetCodeSectionNameForSymbol(x, name);
  9989. IF (x.scope.ownerModule = module.module) THEN
  9990. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9991. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9992. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9993. IF source.pc = 0 THEN (* no code yet *)
  9994. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9995. END;
  9996. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9997. bits := x.procedureScope.body.code.inlineCode;
  9998. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9999. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  10000. binary.CopyBits(bits, 0, bits.GetSize());
  10001. source.SetResolved(binary);
  10002. ELSE
  10003. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  10004. END;
  10005. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  10006. END;
  10007. InitOperand(operand,ModeValue);
  10008. operand.op := reg;
  10009. operand.tag := tag;
  10010. IF Trace THEN TraceExit("StaticCallOperand") END;
  10011. END StaticCallOperand;
  10012. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  10013. (* handle expressions of the form designator.procedure or procedure *)
  10014. BEGIN
  10015. IF Trace THEN TraceEnter("VisitProcedure") END;
  10016. EndBasicBlock;
  10017. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  10018. DynamicCallOperand(result,x);
  10019. ELSIF x.isInline THEN
  10020. StaticCallOperand(result,x);
  10021. ELSE
  10022. StaticCallOperand(result,x);
  10023. END;
  10024. IF Trace THEN TraceExit("VisitProcedure") END;
  10025. END VisitProcedure;
  10026. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  10027. BEGIN
  10028. VisitProcedure(x);
  10029. END VisitOperator;
  10030. (** statements *)
  10031. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  10032. BEGIN
  10033. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  10034. Expression(x.call);
  10035. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  10036. ReleaseOperand(result)
  10037. END;
  10038. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  10039. END VisitProcedureCallStatement;
  10040. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  10041. VAR leftType, rightType: SyntaxTree.MathArrayType;
  10042. leftBase, rightBase: SyntaxTree.Type;
  10043. procedureName,s: SyntaxTree.IdentifierString;
  10044. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  10045. size: LONGINT; rightKind: LONGINT;
  10046. dummy: IntermediateCode.Operand;
  10047. CONST moduleName = "FoxArrayBase";
  10048. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  10049. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  10050. BEGIN
  10051. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  10052. IF base IS SyntaxTree.MathArrayType THEN
  10053. base := OpenArray(base(SyntaxTree.MathArrayType));
  10054. END;
  10055. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  10056. result.SetArrayBase(base);
  10057. RETURN result
  10058. END OpenArray;
  10059. BEGIN
  10060. IF AddImport(moduleName,arrayBase,TRUE) THEN
  10061. SaveRegisters();ReleaseUsedRegisters(saved);
  10062. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  10063. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  10064. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  10065. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  10066. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  10067. IF leftType.form = SyntaxTree.Tensor THEN
  10068. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  10069. ELSIF leftType.form = SyntaxTree.Open THEN
  10070. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  10071. ELSIF leftType.form = SyntaxTree.Static THEN
  10072. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  10073. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  10074. END;
  10075. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  10076. IF procedure = NIL THEN
  10077. s := "Instruction not supported on target, emulation procedure ";
  10078. Strings.Append(s,moduleName);
  10079. Strings.Append(s,".");
  10080. Strings.Append(s,procedureName);
  10081. Strings.Append(s," not present");
  10082. Error(position,s);
  10083. ELSE
  10084. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  10085. parameter.SetType(leftType);
  10086. parameter.SetAccess(SyntaxTree.Internal);
  10087. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10088. parameter.SetKind(rightKind);
  10089. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10090. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  10091. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  10092. StaticCallOperand(result,procedure);
  10093. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  10094. ReleaseOperand(result);
  10095. END;
  10096. RestoreRegisters(saved);
  10097. END;
  10098. END AssignMathArray;
  10099. VAR modifyAssignmentCounter := 0: LONGINT;
  10100. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  10101. VAR processor,mem,dst: IntermediateCode.Operand;
  10102. BEGIN
  10103. IF value.intValue = true.intValue THEN
  10104. INC(modifyAssignmentCounter);
  10105. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  10106. modifyAssignmentsPC := section.pc;
  10107. ELSE
  10108. DEC(modifyAssignmentCounter);
  10109. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  10110. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  10111. END;
  10112. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  10113. dst := NewRegisterOperand (addressType);
  10114. Emit(Mov(position,dst, processor));
  10115. IntermediateCode.InitMemory(mem,bool, dst, 0);
  10116. Emit(Mov(position,mem, value));
  10117. ReleaseIntermediateOperand(dst);
  10118. END ModifyAssignments;
  10119. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  10120. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  10121. BEGIN
  10122. type := left.type.resolved;
  10123. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  10124. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  10125. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  10126. IF procedureType.returnParameter = parameter THEN
  10127. (* this is the only case where the destination can be dynamically smaller than the source
  10128. in all other cases the dynamic size has to be taken
  10129. *)
  10130. IF backend.cooperative THEN
  10131. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  10132. ELSE
  10133. MakeMemory(mem, tag, addressType, 0);
  10134. END;
  10135. RETURN mem;
  10136. END;
  10137. END;
  10138. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  10139. END CopySize;
  10140. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  10141. VAR
  10142. leftO, rightO: Operand;
  10143. arg,mem, sizeOp: IntermediateCode.Operand;
  10144. leftType, rightType, componentType, base: SyntaxTree.Type;
  10145. size: LONGINT;
  10146. parameters: SyntaxTree.ExpressionList;
  10147. procedure: SyntaxTree.Procedure;
  10148. call: SyntaxTree.ProcedureCallDesignator;
  10149. designator: SyntaxTree.Designator;
  10150. saved: RegisterEntry;
  10151. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  10152. VAR procedureType: SyntaxTree.ProcedureType;
  10153. BEGIN
  10154. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  10155. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  10156. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  10157. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  10158. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  10159. WITH right: SyntaxTree.BuiltinCallDesignator DO
  10160. IF right.id = Global.Reshape THEN RETURN TRUE
  10161. END;
  10162. END;
  10163. END;
  10164. END;
  10165. RETURN FALSE
  10166. END CanPassAsResultParameter;
  10167. BEGIN
  10168. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  10169. leftType := left.type.resolved; rightType:= right.type.resolved;
  10170. IF backend.cooperative & left.NeedsTrace() THEN
  10171. ModifyAssignments(true);
  10172. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  10173. Designate(right, rightO);
  10174. Designate(left, leftO);
  10175. ASSERT(leftO.mode = ModeReference);
  10176. TransferToRegister(leftO.op, leftO.op);
  10177. TransferToRegister(rightO.op, rightO.op);
  10178. Emit(Push(position, leftO.op));
  10179. Emit(Push(position, rightO.op));
  10180. CallAssignMethod(leftO.op, rightO.op, left.type);
  10181. Emit(Pop(position, rightO.op));
  10182. Emit(Pop(position, leftO.op));
  10183. sizeOp := CopySize(left, leftO.tag);
  10184. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10185. ReleaseIntermediateOperand(sizeOp);
  10186. ReleaseOperand(leftO);
  10187. ReleaseOperand(rightO);
  10188. ELSE
  10189. Evaluate(right,rightO);
  10190. Designate(left,leftO);
  10191. ASSERT(leftO.mode = ModeReference);
  10192. IF (leftType IS SyntaxTree.ProcedureType) THEN
  10193. (* copy procedure address first *)
  10194. MakeMemory(mem,leftO.op,addressType,0);
  10195. Emit(Mov(position,mem,rightO.op));
  10196. ReleaseIntermediateOperand(mem);
  10197. (* copy pointer address *)
  10198. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10199. CallAssignPointer(leftO.tag, rightO.tag);
  10200. ELSE
  10201. ASSERT(system.SizeOf(left.type) = system.addressSize);
  10202. CallAssignPointer(leftO.op, rightO.op);
  10203. END;
  10204. ReleaseOperand(leftO);
  10205. ReleaseOperand(rightO);
  10206. END;
  10207. ModifyAssignments(false);
  10208. RETURN;
  10209. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  10210. SaveRegisters();ReleaseUsedRegisters(saved);
  10211. IF SemanticChecker.IsPointerType(leftType) THEN
  10212. Evaluate(right,rightO);
  10213. Designate(left,leftO);
  10214. Emit(Push(position,leftO.op));
  10215. ReleaseOperand(leftO);
  10216. Emit(Push(position,rightO.op));
  10217. ReleaseOperand(rightO);
  10218. CallThis(position,"Heaps","Assign",2);
  10219. ELSIF leftType.IsRecordType() THEN
  10220. Designate(right,rightO);
  10221. Designate(left,leftO);
  10222. Emit(Push(position,leftO.op));
  10223. Emit(Push(position,leftO.tag)); (* type desc *)
  10224. ReleaseOperand(leftO);
  10225. Emit(Push(position,rightO.op));
  10226. ReleaseOperand(rightO);
  10227. CallThis(position,"Heaps","AssignRecord",3);
  10228. ELSIF IsStaticArray(leftType) THEN
  10229. size := StaticArrayNumElements(leftType);
  10230. base := StaticArrayBaseType(leftType);
  10231. Designate(right,rightO);
  10232. Designate(left,leftO);
  10233. Emit(Push(position,leftO.op));
  10234. ReleaseOperand(leftO);
  10235. arg := TypeDescriptorAdr(base);
  10236. Emit(Push(position,arg));
  10237. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10238. Emit(Push(position,rightO.op));
  10239. ReleaseOperand(rightO);
  10240. CallThis(position,"Heaps","AssignArray",4);
  10241. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  10242. size := StaticMathArrayNumElements(leftType);
  10243. base := StaticMathArrayBaseType(leftType);
  10244. Designate(right,rightO);
  10245. Designate(left,leftO);
  10246. Emit(Push(position,leftO.op));
  10247. ReleaseOperand(leftO);
  10248. arg := TypeDescriptorAdr(base);
  10249. Emit(Push(position,arg));
  10250. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10251. Emit(Push(position,rightO.op));
  10252. ReleaseOperand(rightO);
  10253. CallThis(position,"Heaps","AssignArray",4);
  10254. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  10255. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  10256. Evaluate(right,rightO);
  10257. Designate(left,leftO);
  10258. MakeMemory(mem,leftO.op,addressType,0);
  10259. Emit(Mov(position,mem,rightO.op));
  10260. ReleaseIntermediateOperand(mem);
  10261. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10262. Emit (Push(position, leftO.tag));
  10263. ReleaseOperand(leftO);
  10264. Emit (Push(position, rightO.tag));
  10265. ReleaseOperand(rightO);
  10266. CallThis(position,"Heaps","Assign", 2);
  10267. ELSE HALT(100); (* missing ? *)
  10268. END;
  10269. RestoreRegisters(saved);
  10270. RETURN;
  10271. END;
  10272. IF CanPassAsResultParameter(right) THEN
  10273. procedureResultDesignator := left(SyntaxTree.Designator);
  10274. Expression(right);
  10275. procedureResultDesignator := NIL;
  10276. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  10277. (* left <-- ALIAS OF right: zerocopy *)
  10278. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  10279. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  10280. designator.SetType(procedure.type);
  10281. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  10282. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  10283. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  10284. END;
  10285. ELSIF leftType IS SyntaxTree.RangeType THEN
  10286. (* LHS is of array range type *)
  10287. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  10288. Evaluate(right, rightO);
  10289. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  10290. (* first *)
  10291. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  10292. Emit(Mov(position,mem, rightO.op));
  10293. ReleaseIntermediateOperand(mem);
  10294. (* last *)
  10295. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10296. Emit(Mov(position,mem, rightO.tag));
  10297. ReleaseIntermediateOperand(mem);
  10298. (* step *)
  10299. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10300. Emit(Mov(position,mem, rightO.extra));
  10301. ReleaseIntermediateOperand(mem);
  10302. ReleaseOperand(rightO);
  10303. ReleaseOperand(leftO)
  10304. ELSIF leftType IS SyntaxTree.ComplexType THEN
  10305. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  10306. Evaluate(right, rightO);
  10307. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  10308. componentType := leftType(SyntaxTree.ComplexType).componentType;
  10309. (* real part *)
  10310. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  10311. Emit(Mov(position,mem, rightO.op));
  10312. ReleaseIntermediateOperand(mem);
  10313. (* imaginary part *)
  10314. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10315. Emit(Mov(position,mem, rightO.tag));
  10316. ReleaseIntermediateOperand(mem);
  10317. ReleaseOperand(rightO);
  10318. ReleaseOperand(leftO)
  10319. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  10320. OR (leftType IS SyntaxTree.PortType) THEN
  10321. (* rightO := leftO;*)
  10322. Evaluate(right,rightO);
  10323. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  10324. Designate(left,leftO);
  10325. IF leftO.mode = ModeReference THEN
  10326. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  10327. destination := mem;
  10328. ELSE
  10329. destination := leftO.op;
  10330. END;
  10331. ReleaseOperand(leftO);
  10332. (* EXPERIMENTAL *)
  10333. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  10334. ReleaseIntermediateOperand(destination);
  10335. destination := availableSymbols[leftO.availability].register;
  10336. UseIntermediateOperand(destination);
  10337. availableSymbols[leftO.availability].inMemory := FALSE;
  10338. END;
  10339. IF destination.mode # IntermediateCode.Undefined THEN
  10340. Emit(Mov(position,destination,rightO.op));
  10341. END;
  10342. ReleaseOperand(rightO);
  10343. ReleaseIntermediateOperand(mem);
  10344. IntermediateCode.InitOperand(destination);
  10345. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  10346. Evaluate(right,rightO);
  10347. Designate(left,leftO);
  10348. MakeMemory(mem,leftO.op,addressType,0);
  10349. Emit(Mov(position,mem,rightO.op));
  10350. ReleaseIntermediateOperand(mem);
  10351. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  10352. (* delegate *)
  10353. (*
  10354. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  10355. *)
  10356. Emit(Mov(position,leftO.tag,rightO.tag));
  10357. END;
  10358. ReleaseOperand(leftO);
  10359. ReleaseOperand(rightO);
  10360. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  10361. Designate(right,rightO);
  10362. Designate(left,leftO);
  10363. sizeOp := CopySize(left, leftO.tag);
  10364. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10365. ReleaseIntermediateOperand(sizeOp);
  10366. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10367. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  10368. IF (rightType IS SyntaxTree.StringType) THEN
  10369. CopyString(left,right);
  10370. 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
  10371. Designate(right,rightO);
  10372. Designate(left,leftO);
  10373. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10374. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10375. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10376. ELSE
  10377. HALT(201)
  10378. END;
  10379. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  10380. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  10381. Designate(right,rightO);
  10382. Designate(left,leftO);
  10383. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10384. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  10385. MakeMemory(mem, rightO.op, leftO.op.type,0);
  10386. Emit(Mov(position, leftO.op, mem));
  10387. ReleaseIntermediateOperand(mem);
  10388. ELSE
  10389. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10390. END;
  10391. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10392. ELSE
  10393. AssignMathArray(left,right);
  10394. END;
  10395. ELSE
  10396. HALT(200);
  10397. END;
  10398. END Assign;
  10399. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  10400. BEGIN
  10401. IF Trace THEN TraceEnter("VisitAssignment") END;
  10402. Assign(x.left,x.right);
  10403. IF Trace THEN TraceExit("VisitAssignment") END;
  10404. END VisitAssignment;
  10405. PROCEDURE EmitCooperativeSwitch;
  10406. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  10407. BEGIN
  10408. ASSERT (cooperativeSwitches);
  10409. pc := section.pc;
  10410. IF lastSwitchPC = section.pc THEN RETURN END;
  10411. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  10412. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  10413. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  10414. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  10415. INC(statCoopSwitch, section.pc - pc);
  10416. END EmitCooperativeSwitch;
  10417. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  10418. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  10419. BEGIN
  10420. p0 := communication.left; p1 := communication.right;
  10421. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  10422. Evaluate(p0,s0);
  10423. Evaluate(p1,s1);
  10424. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10425. Emit(Push(position,s0.op));
  10426. Emit(Push(position,s1.op));
  10427. (*
  10428. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10429. *)
  10430. IF ~backend.cellsAreObjects THEN
  10431. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  10432. END;
  10433. ReleaseOperand(s0);
  10434. ReleaseOperand(s1);
  10435. IF backend.cellsAreObjects THEN
  10436. CallThis(position,"ActiveCellsRuntime","Send",2);
  10437. ELSE
  10438. CallThis(position,ChannelModuleName,"Send",2);
  10439. END;
  10440. (* ----- RECEIVE ------*)
  10441. ELSE
  10442. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  10443. tmp := p0; p0 := p1; p1 := tmp;
  10444. END;
  10445. Evaluate(p0,s0);
  10446. Emit(Push(position,s0.op));
  10447. Designate(p1,s1);
  10448. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10449. Emit(Push(position,s1.op));
  10450. (*
  10451. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10452. *)
  10453. IF ~backend.cellsAreObjects THEN
  10454. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  10455. END;
  10456. ReleaseOperand(s0);
  10457. ReleaseOperand(s1);
  10458. IF backend.cellsAreObjects THEN
  10459. CallThis(position,"ActiveCellsRuntime","Receive",2);
  10460. ELSE
  10461. CallThis(position,ChannelModuleName,"Receive",2)
  10462. END;
  10463. END;
  10464. END VisitCommunicationStatement;
  10465. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  10466. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  10467. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  10468. VAR false: Label; condition, value: BOOLEAN;
  10469. BEGIN
  10470. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  10471. IF condition THEN
  10472. false := NewLabel();
  10473. Condition(if.condition,false,FALSE);
  10474. StatementSequence(if.statements);
  10475. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  10476. SetLabel(false);
  10477. ELSE
  10478. IF value THEN (* always true *)
  10479. escape := TRUE;
  10480. StatementSequence(if.statements);
  10481. (* no branch necessary -- rest skipped *)
  10482. END;
  10483. END;
  10484. END IfPart;
  10485. BEGIN
  10486. IF Trace THEN TraceEnter("VisitIfStatement") END;
  10487. end := NewLabel();
  10488. elsifs := x.ElsifParts();
  10489. IfPart(x.ifPart,elsifs=0);
  10490. FOR i := 0 TO elsifs-1 DO
  10491. IF ~escape THEN
  10492. elsif := x.GetElsifPart(i);
  10493. IfPart(elsif, i=elsifs-1);
  10494. END;
  10495. END;
  10496. IF (x.elsePart # NIL) & ~escape THEN
  10497. StatementSequence(x.elsePart);
  10498. END;
  10499. SetLabel(end);
  10500. IF Trace THEN TraceExit("VisitIfStatement") END;
  10501. END VisitIfStatement;
  10502. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  10503. VAR reg: IntermediateCode.Operand;
  10504. BEGIN
  10505. trueL := NewLabel();
  10506. IF backend.cooperative THEN
  10507. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  10508. Emit(Mov(position,reg,tag));
  10509. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  10510. ReleaseIntermediateOperand(reg);
  10511. ELSE
  10512. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  10513. END;
  10514. END BrWithPart;
  10515. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  10516. BEGIN
  10517. StatementSequence(x.statements);
  10518. END EmitWithPart;
  10519. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  10520. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  10521. tag: IntermediateCode.Operand;
  10522. BEGIN
  10523. IF Trace THEN TraceEnter("VisitWithStatement") END;
  10524. endL := NewLabel();
  10525. elseL := NewLabel();
  10526. Designate(x.variable,res);
  10527. IF IsPointerToRecord(x.variable.type,recordType) THEN
  10528. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  10529. END;
  10530. ReuseCopy(tag, res.tag);
  10531. ReleaseOperand(res);
  10532. NEW(trueL, x.WithParts());
  10533. FOR i := 0 TO x.WithParts()-1 DO
  10534. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  10535. END;
  10536. ReleaseIntermediateOperand(tag);
  10537. BrL(elseL);
  10538. FOR i := 0 TO x.WithParts()-1 DO
  10539. SetLabel(trueL[i]);
  10540. EmitWithPart(x.GetWithPart(i));
  10541. BrL(endL);
  10542. END;
  10543. SetLabel(elseL);
  10544. IF x.elsePart = NIL THEN
  10545. IF ~isUnchecked THEN
  10546. EmitTrap(position,WithTrap);
  10547. END;
  10548. ELSE
  10549. StatementSequence(x.elsePart)
  10550. END;
  10551. SetLabel(endL);
  10552. IF Trace THEN TraceExit("VisitWithStatement") END;
  10553. END VisitWithStatement;
  10554. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  10555. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  10556. out,else: Label; label: Label;
  10557. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  10558. symbol: SyntaxTree.Symbol;
  10559. table: BOOLEAN;
  10560. BEGIN
  10561. (*! split case statement into if-elsif statements for large case label lists *)
  10562. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  10563. range := x.max-x.min+1;
  10564. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  10565. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  10566. table := FALSE;
  10567. size := x.caseParts.Length();
  10568. ELSE
  10569. table := TRUE;
  10570. size := LONGINT(range);
  10571. END;
  10572. Evaluate(x.variable,var);
  10573. ReuseCopy(tmp,var.op);
  10574. ReleaseIntermediateOperand(var.op);
  10575. var.op := tmp;
  10576. (*
  10577. UniqueId(name,module.module,"case",caseId);
  10578. *)
  10579. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  10580. else := NewLabel();
  10581. IF table THEN
  10582. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  10583. Convert(var.op,addressType);
  10584. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  10585. ReuseCopy(res,var.op);
  10586. ReleaseOperand(var);
  10587. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  10588. Global.GetModuleSegmentedName(module.module, name);
  10589. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  10590. symbol := SyntaxTree.NewSymbol(name[1]);
  10591. symbol.SetScope(moduleScope);
  10592. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  10593. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  10594. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  10595. Emit(Add(position,res,res,jmp));
  10596. IntermediateCode.MakeMemory(res,addressType);
  10597. Emit(Br(position,res));
  10598. ReleaseIntermediateOperand(res);
  10599. ELSE
  10600. ReuseCopy(res,var.op); (* make sure it is in a register *)
  10601. ReleaseOperand(var);
  10602. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  10603. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  10604. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10605. part := x.GetCasePart(i);
  10606. constant := part.firstConstant;
  10607. fixups[i] := NewLabel();
  10608. WHILE(constant # NIL) DO (* case labels for this case part *)
  10609. IF constant.min = constant.max THEN
  10610. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  10611. ELSE
  10612. label := NewLabel();
  10613. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  10614. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  10615. BrL(fixups[i]);
  10616. SetLabel(label);
  10617. END;
  10618. constant := constant.next;
  10619. END;
  10620. END;
  10621. BrL(else);
  10622. ReleaseIntermediateOperand(res);
  10623. END;
  10624. out := NewLabel();
  10625. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10626. part := x.GetCasePart(i);
  10627. constant := part.firstConstant;
  10628. IF table THEN
  10629. label := NewLabel();
  10630. SetLabel(label);
  10631. WHILE(constant # NIL) DO (* case labels for this case part *)
  10632. FOR j := constant.min TO constant.max DO
  10633. fixups[j-x.min] := label;
  10634. END;
  10635. constant := constant.next;
  10636. END;
  10637. ELSE
  10638. SetLabel(fixups[i]);
  10639. END;
  10640. StatementSequence(part.statements);
  10641. BrL(out);
  10642. END;
  10643. SetLabel(else);
  10644. FOR i := 0 TO size-1 DO
  10645. IF fixups[i] = NIL THEN
  10646. fixups[i] := else;
  10647. END;
  10648. END;
  10649. IF x.elsePart # NIL THEN
  10650. StatementSequence(x.elsePart);
  10651. ELSIF ~isUnchecked THEN
  10652. EmitTrap(position,CaseTrap);
  10653. END;
  10654. SetLabel(out);
  10655. IF table THEN
  10656. FOR i := 0 TO size-1 DO
  10657. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  10658. section.Emit(Data(position,op));
  10659. END;
  10660. END;
  10661. IF Trace THEN TraceExit("VisitCaseStatement") END;
  10662. END VisitCaseStatement;
  10663. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  10664. VAR startL,falseL: Label;
  10665. BEGIN
  10666. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  10667. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10668. startL := NewLabel();
  10669. falseL := NewLabel();
  10670. SetLabel(startL);
  10671. Condition(x.condition,falseL,FALSE);
  10672. StatementSequence(x.statements);
  10673. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10674. BrL(startL);
  10675. SetLabel(falseL);
  10676. IF Trace THEN TraceExit("VisitWhileStatement") END;
  10677. END VisitWhileStatement;
  10678. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  10679. VAR falseL: Label;
  10680. BEGIN
  10681. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  10682. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10683. falseL := NewLabel();
  10684. SetLabel(falseL);
  10685. StatementSequence(x.statements);
  10686. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10687. Condition(x.condition,falseL,FALSE);
  10688. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  10689. END VisitRepeatStatement;
  10690. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  10691. VAR
  10692. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  10693. temporaryVariable: SyntaxTree.Variable;
  10694. temporaryVariableDesignator : SyntaxTree.Designator;
  10695. BEGIN
  10696. IF Trace THEN TraceEnter("VisitForStatement") END;
  10697. falseL := NewLabel();
  10698. startL := NewLabel();
  10699. Assign(x.variable,x.from);
  10700. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  10701. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  10702. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  10703. Assign(temporaryVariableDesignator,x.to);
  10704. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  10705. IF by > 0 THEN
  10706. cmp := Scanner.LessEqual
  10707. ELSE
  10708. cmp := Scanner.GreaterEqual
  10709. END;
  10710. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  10711. binary.SetType(system.booleanType);
  10712. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10713. SetLabel(startL);
  10714. Condition(binary,falseL, FALSE);
  10715. StatementSequence(x.statements);
  10716. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  10717. binary.SetType(x.variable.type);
  10718. Assign(x.variable,binary);
  10719. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10720. BrL(startL);
  10721. SetLabel(falseL);
  10722. IF Trace THEN TraceExit("VisitForStatement") END;
  10723. END VisitForStatement;
  10724. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  10725. VAR prevLoop: Label;
  10726. BEGIN
  10727. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  10728. prevLoop := currentLoop;
  10729. currentLoop := NewLabel();
  10730. StatementSequence(x.statements);
  10731. SetLabel(currentLoop);
  10732. currentLoop := prevLoop;
  10733. IF Trace THEN TraceExit("VisitExitableBlock") END;
  10734. END VisitExitableBlock;
  10735. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  10736. VAR prevLoop,start: Label;
  10737. BEGIN
  10738. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  10739. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10740. start := NewLabel();
  10741. prevLoop := currentLoop;
  10742. SetLabel(start);
  10743. currentLoop := NewLabel();
  10744. StatementSequence(x.statements);
  10745. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10746. BrL(start);
  10747. SetLabel(currentLoop);
  10748. currentLoop := prevLoop;
  10749. IF Trace THEN TraceExit("VisitLoopStatement") END;
  10750. END VisitLoopStatement;
  10751. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  10752. VAR outer: SyntaxTree.Statement;
  10753. BEGIN
  10754. IF Trace THEN TraceEnter("VisitExitStatement") END;
  10755. IF locked THEN (* r if we jump out of an exclusive block *)
  10756. outer := x.outer;
  10757. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  10758. outer := outer.outer;
  10759. END;
  10760. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  10761. Lock(FALSE);
  10762. END;
  10763. END;
  10764. BrL(currentLoop);
  10765. IF Trace THEN TraceExit("VisitExitStatement") END;
  10766. END VisitExitStatement;
  10767. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  10768. VAR
  10769. expression, parameterDesignator: SyntaxTree.Expression;
  10770. type, componentType: SyntaxTree.Type;
  10771. res, right: Operand;
  10772. left, mem, reg: IntermediateCode.Operand;
  10773. parameter: SyntaxTree.Parameter;
  10774. procedure: SyntaxTree.Procedure;
  10775. procedureType: SyntaxTree.ProcedureType;
  10776. returnTypeOffset: LONGINT;
  10777. delegate: BOOLEAN;
  10778. map: SymbolMap;
  10779. callingConvention, parametersSize: LONGINT;
  10780. BEGIN
  10781. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  10782. expression := x.returnValue;
  10783. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  10784. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10785. IF currentIsInline THEN
  10786. IF expression # NIL THEN
  10787. map := currentMapper.Get(NIL);
  10788. IF map # NIL THEN
  10789. Assign(map.to, expression);
  10790. ELSE
  10791. Evaluate(expression,res);
  10792. Emit(Return(position,res.op));
  10793. ReleaseOperand(res);
  10794. END;
  10795. END;
  10796. BrL(currentInlineExit);
  10797. RETURN;
  10798. END;
  10799. IF expression # NIL THEN
  10800. type := expression.type.resolved;
  10801. IF (expression IS SyntaxTree.ResultDesignator) THEN
  10802. IF locked THEN Lock(FALSE) END;
  10803. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10804. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10805. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  10806. 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
  10807. (* return without structured return parameter *)
  10808. Evaluate(expression,res);
  10809. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  10810. IF locked OR profile THEN
  10811. Emit(Push(position,res.op));
  10812. IF delegate THEN HALT(200) END;
  10813. ReleaseOperand(res);
  10814. IF locked THEN Lock(FALSE) END;
  10815. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10816. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10817. reg := NewRegisterOperand(res.op.type);
  10818. Emit(Pop(position,reg));
  10819. Emit(Return(position,reg));
  10820. ReleaseIntermediateOperand(reg);
  10821. ELSE
  10822. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10823. Emit(Return(position,res.op));
  10824. ReleaseOperand(res);
  10825. END;
  10826. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  10827. THEN
  10828. (* return using structured return parameter *)
  10829. 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)
  10830. OR SemanticChecker.IsPointerType(type));
  10831. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10832. parameter :=procedureType.returnParameter;
  10833. ASSERT(parameter # NIL);
  10834. returnTypeOffset := parameter.offsetInBits;
  10835. (*
  10836. IF parameter# NIL THEN
  10837. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10838. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10839. ELSE
  10840. returnTypeOffset := system.offsetFirstParameter
  10841. END;
  10842. *)
  10843. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10844. IF type IS SyntaxTree.RangeType THEN
  10845. (* array range type *)
  10846. Evaluate(expression, right);
  10847. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10848. Emit(Mov(position,mem, right.op)); (* first *)
  10849. ReleaseIntermediateOperand(mem);
  10850. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10851. Emit(Mov(position,mem, right.tag)); (* last *)
  10852. ReleaseIntermediateOperand(mem);
  10853. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10854. Emit(Mov(position,mem, right.extra)); (* step *)
  10855. ReleaseIntermediateOperand(mem);
  10856. ReleaseOperand(right);
  10857. ELSIF type IS SyntaxTree.ComplexType THEN
  10858. Evaluate(expression, right);
  10859. componentType := type(SyntaxTree.ComplexType).componentType;
  10860. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10861. Emit(Mov(position,mem, right.op)); (* real part *)
  10862. ReleaseIntermediateOperand(mem);
  10863. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10864. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10865. ReleaseIntermediateOperand(mem);
  10866. ReleaseOperand(right);
  10867. ELSE (* covers cases: pointer / record / array *)
  10868. parameter := procedureType.returnParameter;
  10869. checker.SetCurrentScope(currentScope);
  10870. ASSERT(parameter # NIL);
  10871. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10872. Assign(parameterDesignator,expression);
  10873. END;
  10874. ReleaseIntermediateOperand(left);
  10875. IF locked THEN Lock(FALSE) END;
  10876. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10877. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10878. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10879. parameter := procedureType.returnParameter;
  10880. checker.SetCurrentScope(currentScope);
  10881. IF parameter = NIL THEN
  10882. Error(procedure.position, "structured return of parameter of procedure not found");
  10883. ELSE
  10884. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10885. Assign(parameterDesignator,expression);
  10886. END;
  10887. IF locked THEN Lock(FALSE) END;
  10888. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10889. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10890. ELSE
  10891. HALT(200);
  10892. END;
  10893. ELSE
  10894. IF locked THEN Lock(FALSE) END;
  10895. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10896. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10897. END;
  10898. IF backend.cooperative THEN
  10899. BrL(exitLabel);
  10900. ELSE
  10901. callingConvention := procedureType.callingConvention;
  10902. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10903. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10904. ELSE
  10905. parametersSize := 0;
  10906. END;
  10907. EmitLeave(section, position,procedure, callingConvention);
  10908. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10909. END;
  10910. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10911. END VisitReturnStatement;
  10912. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10913. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10914. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10915. statements: SyntaxTree.StatementSequence;
  10916. name, suffix: SyntaxTree.IdentifierString;
  10917. BEGIN
  10918. Strings.IntToStr(awaitProcCounter,suffix);
  10919. Strings.Concat("@AwaitProcedure",suffix,name);
  10920. identifier := SyntaxTree.NewIdentifier(name);
  10921. INC(awaitProcCounter);
  10922. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10923. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10924. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10925. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10926. procedure.SetAccess(SyntaxTree.Hidden);
  10927. procedure.SetScope(currentScope);
  10928. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10929. procedureType.SetReturnType(system.booleanType);
  10930. procedure.SetType(procedureType);
  10931. body := SyntaxTree.NewBody(x.position,procedureScope);
  10932. procedureScope.SetBody(body);
  10933. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10934. returnStatement.SetReturnValue(x.condition);
  10935. statements := SyntaxTree.NewStatementSequence();
  10936. statements.AddStatement(returnStatement);
  10937. body.SetStatementSequence(statements);
  10938. currentScope.AddProcedure(procedure);
  10939. RETURN procedure
  10940. END MakeAwaitProcedure;
  10941. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10942. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10943. call: IntermediateCode.Operand; label, startL, trueL: Label; name: Basic.SegmentedName;
  10944. BEGIN
  10945. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10946. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10947. IF backend.cooperative THEN
  10948. startL := NewLabel();
  10949. trueL := NewLabel();
  10950. SetLabel(startL);
  10951. Condition(x.condition,trueL,TRUE);
  10952. PushSelfPointer();
  10953. CallThis(position,"ExclusiveBlocks","Await",1);
  10954. BrL(startL);
  10955. SetLabel(trueL);
  10956. PushSelfPointer();
  10957. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10958. ELSE
  10959. proc := MakeAwaitProcedure(x);
  10960. Emit(Push(position,fp));
  10961. GetCodeSectionNameForSymbol(proc,name);
  10962. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10963. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10964. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10965. Emit(Call(position,call,ProcParametersSize(proc)));
  10966. Emit(Result(position,res));
  10967. (*
  10968. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10969. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10970. *)
  10971. InitOperand(result,ModeValue);
  10972. result.op := res;
  10973. label := NewLabel();
  10974. BreqL(label, result.op, SELF.true);
  10975. ReleaseOperand(result);
  10976. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10977. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10978. Emit(Push(position,res));
  10979. Emit(Push(position,fp));
  10980. PushSelfPointer();
  10981. Emit(Push(position,nil));
  10982. CallThis(position,"Objects","Await",4);
  10983. SetLabel(label);
  10984. END;
  10985. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10986. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10987. END VisitAwaitStatement;
  10988. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10989. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10990. BEGIN
  10991. FOR i := 0 TO x.Length() - 1 DO
  10992. statement := x.GetStatement( i );
  10993. Statement(statement);
  10994. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10995. END;
  10996. END StatementSequence;
  10997. PROCEDURE PushSelfPointer;
  10998. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10999. procedureType: SyntaxTree.ProcedureType;
  11000. BEGIN
  11001. scope := currentScope;
  11002. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  11003. scope := scope.outerScope;
  11004. END;
  11005. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  11006. moduleSection := meta.ModuleSection();
  11007. IF backend.cooperative THEN
  11008. moduleOffset := 0;
  11009. ELSE
  11010. moduleOffset := moduleSection.pc;
  11011. END;
  11012. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  11013. ELSE
  11014. GetBaseRegister(op.op,currentScope,scope);
  11015. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11016. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11017. parametersSize := ProcParametersSize(procedure);
  11018. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  11019. IF backend.cooperative THEN
  11020. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  11021. END;
  11022. IntermediateCode.MakeMemory(op.op,addressType);
  11023. END;
  11024. Emit(Push(position,op.op));
  11025. ReleaseOperand(op);
  11026. END PushSelfPointer;
  11027. PROCEDURE Lock(lock: BOOLEAN);
  11028. BEGIN
  11029. IF Trace THEN TraceEnter("Lock") END;
  11030. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  11031. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  11032. ASSERT(modifyAssignmentCounter = 0);
  11033. IF dump # NIL THEN
  11034. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  11035. dump.Ln;dump.Update;
  11036. END;
  11037. PushSelfPointer;
  11038. IF backend.cooperative THEN
  11039. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  11040. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  11041. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  11042. END;
  11043. ELSE
  11044. Emit(Push(position,true));
  11045. IF lock THEN CallThis(position,"Objects","Lock",2)
  11046. ELSE CallThis(position,"Objects","Unlock",2);
  11047. END;
  11048. END;
  11049. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11050. IF Trace THEN TraceExit("Lock") END;
  11051. END Lock;
  11052. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  11053. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  11054. BEGIN
  11055. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  11056. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11057. previouslyUnchecked := isUnchecked;
  11058. isUnchecked := isUnchecked OR x.isUnchecked;
  11059. previouslyCooperativeSwitches := cooperativeSwitches;
  11060. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  11061. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  11062. IF x.statements # NIL THEN
  11063. StatementSequence(x.statements);
  11064. END;
  11065. IF (x IS SyntaxTree.Body) THEN
  11066. IF (x(SyntaxTree.Body).finally # NIL) THEN
  11067. section.SetFinally(section.pc);
  11068. StatementSequence(x(SyntaxTree.Body).finally)
  11069. ELSIF x.isExclusive THEN
  11070. end := NewLabel();
  11071. BrL(end);
  11072. section.SetFinally(section.pc);
  11073. Lock(FALSE);
  11074. EmitTrap(position,RethrowTrap);
  11075. SetLabel(end);
  11076. END;
  11077. END;
  11078. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  11079. isUnchecked := previouslyUnchecked;
  11080. cooperativeSwitches := previouslyCooperativeSwitches;
  11081. IF Trace THEN TraceExit("VisitStatementBlock") END;
  11082. END VisitStatementBlock;
  11083. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  11084. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  11085. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  11086. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  11087. procedure: SyntaxTree.Procedure;
  11088. map: SymbolMap;
  11089. callingConvention, parametersSize: LONGINT;
  11090. BEGIN
  11091. scope := currentScope;
  11092. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  11093. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11094. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11095. return := emptyOperand;
  11096. IF Trace THEN TraceEnter("VisitCode") END;
  11097. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  11098. NEW(in, x.inRules.Length());
  11099. FOR i := 0 TO LEN(in)-1 DO
  11100. statement := x.inRules.GetStatement(i);
  11101. WITH statement: SyntaxTree.Assignment DO
  11102. Evaluate(statement.right, operand);
  11103. result := operand.op;
  11104. NEW(str, 64);
  11105. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  11106. in[i] := result; IntermediateCode.SetString(in[i], str);
  11107. ReleaseIntermediateOperand(operand.tag);
  11108. END;
  11109. END;
  11110. ELSE in := NIL
  11111. END;
  11112. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  11113. NEW(out, x.outRules.Length());
  11114. FOR i := 0 TO LEN(out)-1 DO
  11115. statement := x.outRules.GetStatement(i);
  11116. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  11117. WITH statement:
  11118. SyntaxTree.Assignment DO
  11119. Designate(statement.left, operand);
  11120. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  11121. NEW(str, 64);
  11122. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  11123. out[i] := result; IntermediateCode.SetString(out[i], str);
  11124. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  11125. | SyntaxTree.ReturnStatement DO
  11126. NEW(str, 64);
  11127. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  11128. IF currentIsInline THEN
  11129. map := currentMapper.Get(NIL);
  11130. Designate(map.to, operand);
  11131. IF map.isAddress THEN
  11132. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11133. ELSE
  11134. result := operand.op;
  11135. END;
  11136. (*! only if it does not fit into register
  11137. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11138. *)
  11139. (*Evaluate(map.to, operand);*)
  11140. out[i] := result;
  11141. ELSE
  11142. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  11143. END;
  11144. IntermediateCode.SetString(out[i], str);
  11145. ReleaseIntermediateOperand(operand.tag);
  11146. return := out[i];
  11147. ELSE
  11148. END;
  11149. END;
  11150. ELSE out := NIL
  11151. END;
  11152. Emit(Asm(x.position,x.sourceCode, in, out));
  11153. IF in # NIL THEN
  11154. FOR i := 0 TO LEN(in)-1 DO
  11155. ReleaseIntermediateOperand(in[i]);
  11156. END;
  11157. END;
  11158. IF out # NIL THEN
  11159. FOR i := 0 TO LEN(out)-1 DO
  11160. WITH statement:
  11161. SyntaxTree.Assignment DO
  11162. ReleaseIntermediateOperand(out[i]);
  11163. |SyntaxTree.ReturnStatement DO
  11164. (* release happens below *)
  11165. ELSE
  11166. END;
  11167. statement := x.outRules.GetStatement(i);
  11168. END;
  11169. END;
  11170. IF return.mode # IntermediateCode.Undefined THEN
  11171. IF currentIsInline THEN
  11172. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  11173. Symbol(procedureType.returnParameter, par);
  11174. MakeMemory(mem, par.op, return.type, 0);
  11175. ReleaseOperand(par);
  11176. Emit(Mov(position, mem, return));
  11177. ReleaseIntermediateOperand(mem);
  11178. ELSE
  11179. Emit(Return(position,return));
  11180. END;
  11181. ReleaseIntermediateOperand(return);
  11182. IF currentIsInline THEN RETURN END;
  11183. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  11184. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  11185. parametersSize := ProcedureParametersSize(backend.system,procedure);
  11186. ELSE
  11187. parametersSize := 0;
  11188. END;
  11189. EmitLeave(section, position,procedure, callingConvention);
  11190. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  11191. END;
  11192. IF Trace THEN TraceExit("VisitCode") END;
  11193. END VisitCode;
  11194. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  11195. BEGIN
  11196. RETURN ProcedureParametersSize(system, procedure);
  11197. END ProcParametersSize;
  11198. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  11199. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  11200. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  11201. const, call: IntermediateCode.Operand;
  11202. parameterDesignator: SyntaxTree.Expression;
  11203. saved: RegisterEntry;
  11204. name: Basic.SegmentedName;
  11205. BEGIN
  11206. IF Trace THEN TraceEnter("ParameterCopies") END;
  11207. parameter := x.firstParameter;
  11208. WHILE parameter # NIL DO
  11209. IF parameter.kind = SyntaxTree.ValueParameter THEN
  11210. type := parameter.type.resolved;
  11211. IF IsOpenArray(type) THEN
  11212. VisitParameter(parameter);
  11213. op := result;
  11214. IF backend.cooperative & parameter.NeedsTrace() THEN
  11215. length := GetArrayLength(type, op.tag);
  11216. size := NewRegisterOperand(addressType);
  11217. base := ArrayBaseType(type);
  11218. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  11219. Emit(Mul(position, size, length, const));
  11220. dst := NewRegisterOperand (addressType);
  11221. Emit(Mov(position, dst, size));
  11222. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11223. Emit(Sub(position,dst,sp,dst));
  11224. Emit(And(position,dst,dst,const));
  11225. Emit(Mov(position,sp,dst));
  11226. par := fp;
  11227. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11228. IntermediateCode.InitImmediate(null, byteType, 0);
  11229. Emit(Fill(position, dst, size, null));
  11230. ReleaseIntermediateOperand(dst);
  11231. ReleaseIntermediateOperand(length);
  11232. SaveRegisters();ReleaseUsedRegisters(saved);
  11233. (* register dst has been freed before SaveRegisters already *)
  11234. base := ArrayBaseType(type);
  11235. (* assign method of open array *)
  11236. IF base.IsRecordType() THEN
  11237. Emit (Push(position, length));
  11238. Emit (Push(position, dst));
  11239. Emit (Push(position, op.op));
  11240. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  11241. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  11242. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  11243. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  11244. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  11245. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  11246. Emit (Push(position,length));
  11247. Emit (Push(position, dst));
  11248. Emit (Push(position, length));
  11249. Emit (Push(position, op.op));
  11250. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  11251. ELSE
  11252. Emit (Push(position, length));
  11253. Emit (Push(position, dst));
  11254. Emit (Push(position, length));
  11255. Emit (Push(position, op.op));
  11256. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  11257. ASSERT(ArrayBaseType(type).IsPointer());
  11258. END;
  11259. RestoreRegisters(saved);
  11260. ELSE
  11261. temp := GetDynamicSize(type,op.tag);
  11262. ReuseCopy(size,temp);
  11263. ReleaseIntermediateOperand(temp);
  11264. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11265. Emit(Sub(position,size,sp,size));
  11266. Emit(And(position,size,size,const));
  11267. Emit(Mov(position,sp,size));
  11268. par := fp;
  11269. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11270. ReleaseIntermediateOperand(size);
  11271. size := GetDynamicSize(type,op.tag);
  11272. END;
  11273. Emit(Copy(position,sp,op.op,size));
  11274. ReleaseIntermediateOperand(size);
  11275. ReleaseOperand(op);
  11276. IntermediateCode.MakeMemory(par,addressType);
  11277. Emit(Mov(position,par,sp));
  11278. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  11279. checker.SetCurrentScope(currentScope);
  11280. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  11281. Assign(parameterDesignator,parameterDesignator);
  11282. END;
  11283. END;
  11284. parameter := parameter.nextParameter;
  11285. END;
  11286. IF Trace THEN TraceExit("ParameterCopies") END;
  11287. END ParameterCopies;
  11288. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  11289. VAR x: SyntaxTree.Variable;
  11290. BEGIN
  11291. x := scope.firstVariable;
  11292. WHILE x # NIL DO
  11293. InitVariable(x,FALSE);
  11294. x := x.nextVariable;
  11295. END;
  11296. END InitVariables;
  11297. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  11298. BEGIN
  11299. IF (symbol # NIL) THEN
  11300. RETURN fingerPrinter.SymbolFP(symbol).public
  11301. ELSE
  11302. RETURN 0
  11303. END;
  11304. END GetFingerprint;
  11305. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  11306. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  11307. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  11308. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  11309. name: Basic.SegmentedName;
  11310. offset: LONGINT;
  11311. BEGIN
  11312. IF Trace THEN TraceEnter("Body") END;
  11313. ReleaseUsedRegisters(saved); (* just in case ... *)
  11314. section := ir;
  11315. exitLabel := NewLabel ();
  11316. IF moduleBody THEN moduleBodySection := section END;
  11317. IF ir.comments # NIL THEN
  11318. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  11319. commentPrintout.SingleStatement(TRUE);
  11320. dump := ir.comments;
  11321. ELSE
  11322. commentPrintout := NIL;
  11323. dump := NIL;
  11324. END;
  11325. prevScope := currentScope;
  11326. currentScope := scope;
  11327. lastSwitchPC := 0;
  11328. cooperativeSwitches := backend.cooperative;
  11329. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11330. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11331. IF x # NIL THEN
  11332. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11333. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  11334. IF moduleBody THEN
  11335. ProfilerInit();
  11336. ELSE
  11337. Basic.SegmentedNameToString(ir.name, string);
  11338. ProfilerAddProcedure(numberProcedures,string);
  11339. ProfilerEnterExit(numberProcedures,TRUE);
  11340. END;
  11341. END;
  11342. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  11343. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  11344. END;
  11345. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  11346. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  11347. cellScope := scope.outerScope(SyntaxTree.CellScope);
  11348. IF procedure = cellScope.bodyProcedure THEN
  11349. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  11350. StaticCallOperand(op, cellScope.constructor);
  11351. Emit(Call(position,op.op,0));
  11352. END;
  11353. END;
  11354. END;
  11355. InitVariables(scope);
  11356. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  11357. GetCodeSectionNameForSymbol(procedure, name);
  11358. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  11359. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  11360. IF ProtectModulesPointers THEN
  11361. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  11362. ELSE
  11363. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  11364. END;
  11365. IntermediateCode.SetOffset(right,offset); (* tag *)
  11366. IntermediateCode.InitMemory(left,addressType,fp,0);
  11367. Emit(Mov(position, left, right));
  11368. END;
  11369. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  11370. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  11371. ParameterCopies(procedureType);
  11372. IF x.code = NIL THEN
  11373. VisitStatementBlock(x);
  11374. ELSE
  11375. VisitCode(x.code)
  11376. END;
  11377. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  11378. IF ~backend.cooperative THEN
  11379. ProfilerEnterExit(numberProcedures,FALSE);
  11380. END;
  11381. INC(numberProcedures);
  11382. END;
  11383. END;
  11384. IF backend.cooperative THEN
  11385. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  11386. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  11387. END;
  11388. IF x # NIL THEN
  11389. SELF.position := x.position;
  11390. END;
  11391. EndBasicBlock;
  11392. CheckRegistersFree();
  11393. ASSERT(modifyAssignmentCounter = 0);
  11394. currentScope := prevScope;
  11395. IF Trace THEN TraceExit("Body") END;
  11396. END Body;
  11397. END ImplementationVisitor;
  11398. MetaDataGenerator=OBJECT
  11399. VAR
  11400. implementationVisitor: ImplementationVisitor;
  11401. declarationVisitor: DeclarationVisitor;
  11402. module: Sections.Module;
  11403. moduleName: ARRAY 128 OF CHAR;
  11404. moduleNamePool: Basic.HashTableInt;
  11405. moduleNamePoolSection: IntermediateCode.Section;
  11406. modulePointerSection: IntermediateCode.Section;
  11407. modulePointerSizePC: LONGINT;
  11408. modulePointerSectionOffset: LONGINT;
  11409. modulePointers: LONGINT;
  11410. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  11411. RecordBaseOffset: LONGINT;
  11412. MethodTableOffset: LONGINT; (* method table offset from zero *)
  11413. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  11414. TypeTags: LONGINT; (* type extension level support *)
  11415. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  11416. patchInfoPC: LONGINT;
  11417. patchCRC: LONGINT;
  11418. CONST
  11419. EmptyBlockOffset = 2;
  11420. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  11421. BEGIN
  11422. IF implementationVisitor.backend.cooperative THEN
  11423. TypeTags := MAX(LONGINT);
  11424. BaseTypesTableOffset := 0;
  11425. MethodTableOffset := 2;
  11426. TypeRecordBaseOffset := 0;
  11427. RecordBaseOffset := 0;
  11428. ELSIF simple THEN
  11429. TypeTags := 3; (* only 3 extensions allowed *)
  11430. BaseTypesTableOffset := 1;
  11431. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  11432. TypeRecordBaseOffset := 0;
  11433. RecordBaseOffset := 1;
  11434. ELSE
  11435. TypeTags := 16;
  11436. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  11437. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  11438. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  11439. (* change this when Heaps.HeapBlock is modified *)
  11440. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  11441. RecordBaseOffset := 8; (* addresses *)
  11442. ELSE
  11443. RecordBaseOffset := 9; (* addresses *)
  11444. END;
  11445. END;
  11446. SELF.simple := simple;
  11447. SELF.implementationVisitor := implementationVisitor;
  11448. SELF.declarationVisitor := declarationVisitor;
  11449. implementationVisitor.meta := SELF;
  11450. declarationVisitor.meta := SELF;
  11451. END InitMetaDataGenerator;
  11452. PROCEDURE SetModule(module: Sections.Module);
  11453. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  11454. BEGIN
  11455. SELF.module := module;
  11456. Global.GetModuleName(module.module,moduleName);
  11457. Global.GetSymbolSegmentedName(module.module, name);
  11458. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  11459. NEW(moduleNamePool, 32);
  11460. (*! require GC protection *)
  11461. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  11462. IF ProtectModulesPointers THEN
  11463. name := "Heaps.AnyPtr";
  11464. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11465. (* set base pointer *)
  11466. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  11467. END;
  11468. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  11469. modulePointers := 0;
  11470. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  11471. AddPointer(moduleNamePoolSection, namePoolOffset);
  11472. END;
  11473. END SetModule;
  11474. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  11475. BEGIN
  11476. IF ~implementationVisitor.backend.cooperative THEN
  11477. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  11478. INC(modulePointers);
  11479. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  11480. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  11481. END;
  11482. END AddPointer;
  11483. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  11484. BEGIN
  11485. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  11486. END GetTypeRecordBaseOffset;
  11487. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11488. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  11489. BEGIN
  11490. (* change this when Heaps.HeapBlock is modified *)
  11491. INC(dataAdrOffset,7);
  11492. Info(section,"headerAdr");
  11493. Address(section,0);
  11494. Info(section,"typeDesc");
  11495. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  11496. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11497. NamedSymbol(section, name, symbol, 0, offset);
  11498. Info(section,"mark: LONGINT;");
  11499. Longint(section,-1);
  11500. Info(section,"refCount: LONGINT;");
  11501. Longint(section,0);
  11502. (*
  11503. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  11504. *)
  11505. Info(section,"dataAdr-: ADDRESS");
  11506. Symbol(section,section, dataAdrOffset,0);
  11507. Info(section,"size-: SIZE");
  11508. Address(section,0);
  11509. Info(section,"nextMark: HeapBlock;");
  11510. Address(section,0);
  11511. END HeapBlock;
  11512. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11513. VAR i: LONGINT;
  11514. BEGIN
  11515. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  11516. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  11517. Info(section,"count*: LONGINT");
  11518. Longint(section,0);
  11519. Info(section,"locked*: BOOLEAN");
  11520. Longint(section,0);
  11521. Info(section,"awaitingLock*: ProcessQueue");
  11522. Address(section,0);
  11523. Address(section,0);
  11524. Info(section,"awaitingCond*: ProcessQueue");
  11525. Address(section,0);
  11526. Address(section,0);
  11527. Info(section,"lockedBy*: ANY");
  11528. Address(section,0);
  11529. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  11530. Longint(section,1);
  11531. FOR i := 2 TO 6 DO
  11532. Longint(section,0);
  11533. END;
  11534. Info(section,"lock*: ANY");
  11535. Address(section,0);
  11536. END ProtectedHeapBlock;
  11537. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  11538. BEGIN
  11539. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  11540. END Info;
  11541. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  11542. VAR op: IntermediateCode.Operand;
  11543. BEGIN
  11544. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  11545. section.Emit(Data(Basic.invalidPosition,op));
  11546. END Address;
  11547. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  11548. VAR op: IntermediateCode.Operand;
  11549. BEGIN
  11550. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11551. section.Emit(Data(Basic.invalidPosition,op));
  11552. END Size;
  11553. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  11554. VAR op: IntermediateCode.Operand;
  11555. BEGIN
  11556. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  11557. section.Emit(Data(Basic.invalidPosition,op));
  11558. END Set;
  11559. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  11560. VAR op: IntermediateCode.Operand;
  11561. BEGIN
  11562. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11563. section.Emit(Data(Basic.invalidPosition,op));
  11564. END Longint;
  11565. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11566. VAR op,noOperand: IntermediateCode.Operand;
  11567. BEGIN
  11568. IntermediateCode.InitOperand(noOperand);
  11569. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11570. section.PatchOperands(pc,op,noOperand,noOperand);
  11571. END PatchSize;
  11572. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11573. VAR op,noOperand: IntermediateCode.Operand;
  11574. BEGIN
  11575. IntermediateCode.InitOperand(noOperand);
  11576. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11577. section.PatchOperands(pc,op,noOperand,noOperand);
  11578. END PatchLongint;
  11579. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11580. VAR op, noOperand: IntermediateCode.Operand;
  11581. BEGIN
  11582. IntermediateCode.InitOperand(noOperand);
  11583. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11584. section.PatchOperands(pc,op,noOperand,noOperand);
  11585. END PatchSymbol;
  11586. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  11587. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  11588. BEGIN
  11589. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  11590. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  11591. section.Emit(Data(Basic.invalidPosition,op));
  11592. END Boolean;
  11593. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  11594. VAR op: IntermediateCode.Operand;
  11595. BEGIN
  11596. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  11597. section.Emit(Data(Basic.invalidPosition,op));
  11598. END Char;
  11599. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  11600. VAR i: LONGINT;
  11601. BEGIN
  11602. Info(section,str);
  11603. i := 0;
  11604. WHILE(str[i] # 0X) DO
  11605. Char(section,str[i]);
  11606. INC(i);
  11607. END;
  11608. Char(section,0X);
  11609. END String;
  11610. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  11611. VAR s: Basic.SectionName;
  11612. BEGIN
  11613. StringPool.GetString(str, s);
  11614. String(section, s);
  11615. END String0;
  11616. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11617. VAR op: IntermediateCode.Operand;
  11618. BEGIN
  11619. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11620. IntermediateCode.SetOffset(op,realOffset);
  11621. section.Emit(Data(Basic.invalidPosition,op));
  11622. END NamedSymbol;
  11623. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11624. VAR op: IntermediateCode.Operand;
  11625. BEGIN
  11626. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11627. IntermediateCode.SetOffset(op,realOffset);
  11628. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  11629. END NamedSymbolAt;
  11630. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  11631. BEGIN
  11632. IF symbol= NIL THEN
  11633. Address( section, realOffset);
  11634. ASSERT(virtualOffset = 0);
  11635. ELSE
  11636. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  11637. END;
  11638. END Symbol;
  11639. (* OutPointers delivers
  11640. {pointerOffset}
  11641. *)
  11642. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  11643. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  11644. BEGIN
  11645. type := type.resolved;
  11646. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  11647. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11648. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11649. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  11650. Symbol(section, symbol, 0, offset); INC(numberPointers);
  11651. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  11652. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11653. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  11654. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  11655. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  11656. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  11657. ELSIF (type IS SyntaxTree.RecordType) THEN
  11658. (* never treat a record like a pointer, even if the pointer field is set! *)
  11659. WITH type: SyntaxTree.RecordType DO
  11660. base := type.GetBaseRecord();
  11661. IF base # NIL THEN
  11662. Pointers(offset,symbol,section, base,numberPointers);
  11663. END;
  11664. variable := type.recordScope.firstVariable;
  11665. WHILE(variable # NIL) DO
  11666. IF ~(variable.untraced) THEN
  11667. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11668. END;
  11669. variable := variable.nextVariable;
  11670. END;
  11671. END;
  11672. ELSIF (type IS SyntaxTree.CellType) THEN
  11673. WITH type: SyntaxTree.CellType DO
  11674. base := type.GetBaseRecord();
  11675. IF base # NIL THEN
  11676. Pointers(offset,symbol,section, base,numberPointers);
  11677. END;
  11678. variable := type.cellScope.firstVariable;
  11679. WHILE(variable # NIL) DO
  11680. IF ~(variable.untraced) THEN
  11681. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11682. END;
  11683. variable := variable.nextVariable;
  11684. END;
  11685. property := type.firstProperty;
  11686. WHILE(property # NIL) DO
  11687. IF ~(property.untraced) THEN
  11688. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  11689. END;
  11690. property := property.nextProperty;
  11691. END;
  11692. parameter := type.firstParameter;
  11693. WHILE(parameter # NIL) DO
  11694. IF ~(parameter.untraced) THEN
  11695. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  11696. END;
  11697. parameter := parameter.nextParameter;
  11698. END;
  11699. END;
  11700. ELSIF (type IS SyntaxTree.ArrayType) THEN
  11701. WITH type: SyntaxTree.ArrayType DO
  11702. IF type.form= SyntaxTree.Static THEN
  11703. n := type.staticLength;
  11704. base := type.arrayBase.resolved;
  11705. WHILE(base IS SyntaxTree.ArrayType) DO
  11706. type := base(SyntaxTree.ArrayType);
  11707. n := n* type.staticLength;
  11708. base := type.arrayBase.resolved;
  11709. END;
  11710. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11711. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  11712. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11713. FOR i := 0 TO n-1 DO
  11714. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11715. END;
  11716. END;
  11717. ELSE
  11718. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  11719. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11720. END;
  11721. END;
  11722. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  11723. WITH type: SyntaxTree.MathArrayType DO
  11724. IF type.form = SyntaxTree.Static THEN
  11725. n := type.staticLength;
  11726. base := type.arrayBase.resolved;
  11727. WHILE(base IS SyntaxTree.MathArrayType) DO
  11728. type := base(SyntaxTree.MathArrayType);
  11729. n := n* type.staticLength;
  11730. base := type.arrayBase.resolved;
  11731. END;
  11732. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11733. IF SemanticChecker.ContainsPointer(base) THEN
  11734. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11735. FOR i := 0 TO n-1 DO
  11736. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11737. END;
  11738. END;
  11739. ELSE
  11740. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  11741. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11742. END
  11743. END;
  11744. (* ELSE no pointers in type *)
  11745. END;
  11746. END Pointers;
  11747. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  11748. VAR position,i: LONGINT; ch: CHAR;
  11749. BEGIN
  11750. IF pool.Has(index) THEN
  11751. RETURN pool.GetInt(index)
  11752. ELSE
  11753. position := source.pc;
  11754. pool.PutInt(index, position);
  11755. Info(source, name);
  11756. i := 0;
  11757. REPEAT
  11758. ch := name[i]; INC(i);
  11759. Char( source, ch);
  11760. UNTIL ch = 0X;
  11761. END;
  11762. RETURN position;
  11763. END EnterDynamicName;
  11764. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  11765. VAR name: Basic.SectionName; position: LONGINT;
  11766. BEGIN
  11767. IF pool.Has(index) THEN
  11768. RETURN pool.GetInt(index)
  11769. ELSE
  11770. StringPool.GetString(index, name);
  11771. position := EnterDynamicName(source,name,index, pool);
  11772. END;
  11773. RETURN position;
  11774. END DynamicName;
  11775. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  11776. VAR section: IntermediateCode.Section;
  11777. BEGIN
  11778. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11779. IF implementationVisitor.backend.cooperative THEN
  11780. Info(section, "TypeDescriptor");
  11781. Basic.ToSegmentedName("BaseTypes.Array", name);
  11782. NamedSymbol(section, name,NIL, 0, 0);
  11783. BasePointer(section);
  11784. offset := 0;
  11785. ELSE
  11786. IF ProtectModulesPointers THEN
  11787. HeapBlock(mName,typeName,section,2);
  11788. END;
  11789. Info(section, "HeapBlock");
  11790. IF ProtectModulesPointers THEN
  11791. Symbol(section,section,2,0);
  11792. ELSE
  11793. Address(section,0);
  11794. END;
  11795. Info(section, "TypeDescriptor");
  11796. Address(section,0);
  11797. offset := section.pc;
  11798. END;
  11799. RETURN section
  11800. END NamedBlock;
  11801. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  11802. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  11803. BEGIN
  11804. COPY(moduleName,name);
  11805. Strings.Append(name,suffix);
  11806. Basic.ToSegmentedName(name, pooledName);
  11807. RETURN NamedBlock(mName, typeName, pooledName, offset);
  11808. END Block;
  11809. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  11810. VAR name: Basic.SegmentedName;
  11811. BEGIN
  11812. Info(source,"ArrayHeader");
  11813. IF implementationVisitor.backend.cooperative THEN
  11814. sizePC := source.pc;
  11815. Address(source,0);
  11816. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  11817. IF baseType # "" THEN
  11818. Basic.ToSegmentedName(baseType, name);
  11819. NamedSymbol(source, name,NIL, 0, 0);
  11820. ELSE
  11821. Address(source,0);
  11822. END;
  11823. Address(source,0);
  11824. ELSE
  11825. Address(source,0);
  11826. Address(source,0);
  11827. (* first pointer for GC *)
  11828. IF hasPointer THEN
  11829. (* points to first element in the array, this is NOT the base type descriptor *)
  11830. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11831. ELSE
  11832. Address(source,0);
  11833. END;
  11834. sizePC := source.pc;
  11835. Address(source,0);
  11836. Info(source,"array data");
  11837. END;
  11838. END ArrayBlock;
  11839. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11840. BEGIN
  11841. IF implementationVisitor.backend.cooperative THEN
  11842. PatchSize(section, pc, size);
  11843. PatchSize(section, pc + 3, size);
  11844. ELSE
  11845. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11846. PatchSize(section, pc, size);
  11847. END;
  11848. END PatchArray;
  11849. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11850. VAR
  11851. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  11852. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11853. poolMap: Basic.HashTableInt;
  11854. namePool: IntermediateCode.Section;
  11855. namePoolOffset: LONGINT;
  11856. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11857. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11858. BEGIN
  11859. Basic.SegmentedNameToString(s1.name,n1);
  11860. Basic.SegmentedNameToString(s2.name,n2);
  11861. index := 0;
  11862. ch1 := n1[index];
  11863. ch2 := n2[index];
  11864. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11865. INC(index);
  11866. ch1 := n1[index];
  11867. ch2 := n2[index];
  11868. END;
  11869. RETURN ch1 < ch2;
  11870. END Compare;
  11871. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11872. VAR
  11873. i, j: LONGINT;
  11874. x, t: Sections.Section;
  11875. BEGIN
  11876. IF lo < hi THEN
  11877. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11878. WHILE i <= j DO
  11879. WHILE Compare(list[i], x) DO INC(i) END;
  11880. WHILE Compare(x, list[j]) DO DEC(j) END;
  11881. IF i <= j THEN
  11882. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11883. INC(i); DEC(j)
  11884. END
  11885. END;
  11886. IF lo < j THEN QuickSort(list, lo, j) END;
  11887. IF i < hi THEN QuickSort(list, i, hi) END
  11888. END;
  11889. END QuickSort;
  11890. (*
  11891. ExportDesc* = RECORD
  11892. fp*: ADDRESS;
  11893. name* {UNTRACED}: DynamicName;
  11894. adr*: ADDRESS;
  11895. exports*: LONGINT;
  11896. dsc* {UNTRACED}: ExportArray
  11897. END;
  11898. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11899. *)
  11900. PROCEDURE ExportDesc2(
  11901. source: IntermediateCode.Section;
  11902. namePool: IntermediateCode.Section;
  11903. fingerPrinter: FingerPrinter.FingerPrinter;
  11904. symbol: Sections.Section;
  11905. name: StringPool.Index;
  11906. VAR patchAdr: LONGINT
  11907. ): BOOLEAN;
  11908. VAR fingerPrint: SyntaxTree.FingerPrint;
  11909. BEGIN
  11910. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11911. & (symbol.type # Sections.InlineCodeSection)
  11912. THEN
  11913. *)
  11914. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11915. & (symbol.type # Sections.ExitCodeSection)
  11916. & (symbol.type # Sections.InlineCodeSection))
  11917. THEN
  11918. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11919. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11920. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11921. Longint(source,fingerPrint.public);
  11922. ELSE
  11923. Longint(source, 0);
  11924. END;
  11925. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11926. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11927. Symbol(source, symbol,0,0);
  11928. patchAdr := source.pc;
  11929. Longint(source, 0);
  11930. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11931. Address(source,0);
  11932. END;
  11933. RETURN TRUE
  11934. ELSE
  11935. RETURN FALSE
  11936. END;
  11937. END ExportDesc2;
  11938. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11939. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11940. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11941. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11942. nextPatch: LONGINT;
  11943. TYPE
  11944. Scope = RECORD
  11945. elements: LONGINT;
  11946. gelements: LONGINT;
  11947. section: IntermediateCode.Section;
  11948. patchAdr: LONGINT;
  11949. arraySizePC: LONGINT;
  11950. beginPC: LONGINT; (* current scope start pc *)
  11951. END;
  11952. BEGIN
  11953. Basic.InitSegmentedName(prev);
  11954. olevel := -1;
  11955. scopes[0].section := source;
  11956. scopes[0].arraySizePC := MIN(LONGINT);
  11957. FOR s := 0 TO LEN(sections)-1 DO
  11958. symbol := sections[s];
  11959. 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
  11960. this := sections[s].name;
  11961. level := 0;
  11962. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11963. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11964. INC(level);
  11965. END;
  11966. WHILE level < olevel DO
  11967. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11968. IF olevel > 0 THEN
  11969. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11970. nextPatch := scopes[olevel-1].patchAdr+1;
  11971. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11972. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11973. END;
  11974. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11975. DEC(olevel);
  11976. END;
  11977. IF (level < LEN(this)) & (this[level] > 0) THEN
  11978. IF level > olevel THEN
  11979. (*TRACE("opening",level); *)
  11980. IF scopes[level].section = NIL THEN
  11981. arrayName := ".@ExportArray";
  11982. Strings.AppendInt(arrayName, level);
  11983. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11984. AddPointer(scopes[level].section,offset);
  11985. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11986. END;
  11987. scopes[level].beginPC := scopes[level].section.pc;
  11988. olevel := level;
  11989. scopes[olevel].elements := 0;
  11990. END;
  11991. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11992. sym := sections[s];
  11993. ELSE
  11994. sym := NIL;
  11995. END;
  11996. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11997. THEN
  11998. INC(scopes[olevel].elements);
  11999. END;
  12000. (* enter string in scope *)
  12001. INC(level);
  12002. END;
  12003. END;
  12004. Basic.SegmentedNameToString(this, name);
  12005. prev := this;
  12006. END;
  12007. END;
  12008. WHILE 0 <= olevel DO
  12009. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  12010. IF olevel > 0 THEN
  12011. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12012. nextPatch := scopes[olevel-1].patchAdr+1;
  12013. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12014. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12015. END;
  12016. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12017. DEC(olevel);
  12018. END;
  12019. level := 0;
  12020. WHILE (level < LEN(scopes)) DO
  12021. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  12022. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  12023. END;
  12024. INC(level);
  12025. END;
  12026. END Export;
  12027. BEGIN
  12028. NEW(fingerPrinter);
  12029. NEW(poolMap, 64);
  12030. (* 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 *)
  12031. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  12032. NEW(sectionArray, module.allSections.Length());
  12033. FOR i := 0 TO module.allSections.Length() - 1 DO
  12034. section := module.allSections.GetSection(i);
  12035. sectionArray[i] := section;
  12036. END;
  12037. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  12038. Export(sectionArray^);
  12039. END ExportDesc;
  12040. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  12041. VAR
  12042. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  12043. BEGIN
  12044. Info(source, "exception table offsets array descriptor");
  12045. size := 0;
  12046. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  12047. Info(source, "exception table content");
  12048. FOR i := 0 TO module.allSections.Length() - 1 DO
  12049. p := module.allSections.GetSection(i);
  12050. IF p.type = Sections.CodeSection THEN
  12051. finallyPC := p(IntermediateCode.Section).finally;
  12052. IF finallyPC>=0 THEN
  12053. Symbol( source, p, 0,0);
  12054. Symbol( source, p, finallyPC, 0);
  12055. Symbol( source, p, finallyPC,0);
  12056. INC(size);
  12057. END;
  12058. END
  12059. END;
  12060. PatchArray(source,sizePC,size);
  12061. END ExceptionArray;
  12062. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  12063. VAR i: LONGINT; ch: CHAR;
  12064. BEGIN
  12065. i := 0;
  12066. REPEAT
  12067. ch := name[i]; INC(i);
  12068. Char( section, ch);
  12069. UNTIL ch = 0X;
  12070. WHILE i < 32 DO
  12071. Char( section, 0X); INC(i);
  12072. END;
  12073. END Name;
  12074. PROCEDURE References(section: IntermediateCode.Section);
  12075. CONST
  12076. sfTypeNone = 0X;
  12077. sfTypeCHAR = 01X;
  12078. sfTypeCHAR8 = 02X;
  12079. sfTypeCHAR16 = 03X;
  12080. sfTypeCHAR32 = 04X;
  12081. sfTypeRANGE = 05X;
  12082. sfTypeSHORTINT = 06X;
  12083. sfTypeINTEGER = 07X;
  12084. sfTypeLONGINT = 08X;
  12085. sfTypeHUGEINT = 09X;
  12086. sfTypeWORD = 0AX;
  12087. sfTypeLONGWORD = 0BX;
  12088. sfTypeSIGNED8 = 0CX;
  12089. sfTypeSIGNED16 = 0DX;
  12090. sfTypeSIGNED32 = 0EX;
  12091. sfTypeSIGNED64 = 0FX;
  12092. sfTypeUNSIGNED8 = 10X;
  12093. sfTypeUNSIGNED16 = 11X;
  12094. sfTypeUNSIGNED32 = 12X;
  12095. sfTypeUNSIGNED64 = 13X;
  12096. sfTypeREAL = 14X;
  12097. sfTypeLONGREAL = 15X;
  12098. sfTypeCOMPLEX = 16X;
  12099. sfTypeLONGCOMPLEX = 17X;
  12100. sfTypeBOOLEAN = 18X;
  12101. sfTypeSET = 19X;
  12102. sfTypeANY = 1AX;
  12103. sfTypeOBJECT = 1BX;
  12104. sfTypeBYTE = 1CX;
  12105. sfTypeADDRESS = 1DX;
  12106. sfTypeSIZE = 1EX;
  12107. sfTypeIndirect = 1FX;
  12108. sfTypeRecord = 20X;
  12109. sfTypePointerToRecord = 21X;
  12110. sfTypePointerToArray = 22X;
  12111. sfTypeOpenArray = 23X;
  12112. sfTypeStaticArray = 24X;
  12113. sfTypeDynamicArray = 25X;
  12114. sfTypeMathStaticArray = 26X;
  12115. sfTypeMathOpenArray = 27X;
  12116. sfTypeMathTensor = 28X;
  12117. sfTypeProcedure = 29X;
  12118. sfTypeDelegate = 2AX;
  12119. sfTypeENUM = 2BX;
  12120. (* sfTypeCELL = 2CX; *)
  12121. sfTypePORT = 2DX;
  12122. sfIN = 0X;
  12123. sfOUT = 1X;
  12124. flagDelegate = 0;
  12125. flagConstructor = 1;
  12126. (* variable / parameter addressing modes *)
  12127. sfAbsolute = 0X; (* global vars *)
  12128. sfRelative = 1X; (* variables, value parameters *)
  12129. sfIndirect = 2X; (* var parameters *)
  12130. sfScopeBegin = 0F0X;
  12131. sfScopeEnd = 0F1X;
  12132. sfProcedure = 0F2X;
  12133. sfVariable = 0F3X;
  12134. sfTypeDeclaration = 0F4X;
  12135. sfModule = 0FFX;
  12136. RefInfo = TRUE;
  12137. VAR
  12138. sizePC, startPC, lastOffset: LONGINT;
  12139. indirectTypes: Basic.HashTable;
  12140. PROCEDURE CurrentIndex(): LONGINT;
  12141. VAR i: LONGINT;
  12142. BEGIN
  12143. FOR i := startPC TO section.pc -1 DO
  12144. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  12145. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  12146. END;
  12147. startPC := section.pc;
  12148. RETURN lastOffset;
  12149. END CurrentIndex;
  12150. (*
  12151. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12152. Module = sfModule prevSymbol:SIZE name:String Scope.
  12153. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12154. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  12155. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12156. Type =
  12157. sfTypePointerToRecord
  12158. | sfTypePointerToArray Type
  12159. | sfTypeOpenArray Type
  12160. | sfTypeDynamicArray Type
  12161. | sfTypeStaticArray length:SIZE Type
  12162. | sfTypeMathOpenArray Type
  12163. | sfTypeMathStaticArray length:SIZE Type
  12164. | sfTypeMathTensor Type
  12165. | sfTypeRecord tdAdr:ADDRESS
  12166. | sfTypeProcedure {Parameter} return:Type
  12167. | sfTypeDelegate {Parameter} return:Type
  12168. | sfTypePort (sfIN | sfOUT)
  12169. | sfTypeBOOLEAN
  12170. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  12171. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  12172. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  12173. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  12174. | sfTypeWORD | sfTypeLONGWORD
  12175. | sfTypeREAL | sfTypeLONGREAL
  12176. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  12177. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  12178. | sfTypeIndirect offset:SIZE.
  12179. *)
  12180. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  12181. VAR offset: SIZE;
  12182. BEGIN
  12183. IF indirectTypes.Has(type) THEN
  12184. offset := indirectTypes.GetInt(type);
  12185. Char(section, sfTypeIndirect);
  12186. Size(section, offset);
  12187. RETURN TRUE;
  12188. ELSE
  12189. indirectTypes.PutInt(type, CurrentIndex());
  12190. RETURN FALSE;
  12191. END;
  12192. END Indirect;
  12193. PROCEDURE NType(type: SyntaxTree.Type);
  12194. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  12195. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  12196. BEGIN
  12197. IF type = NIL THEN
  12198. Char(section, sfTypeNone)
  12199. ELSE
  12200. type := type.resolved;
  12201. size := type.sizeInBits;
  12202. WITH type:
  12203. SyntaxTree.PointerType DO
  12204. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  12205. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12206. Char(section, sfTypePointerToRecord);
  12207. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  12208. ELSE
  12209. IF RefInfo THEN Info(section,"PointerToArray") END;
  12210. Char(section, sfTypePointerToArray);
  12211. NType(type.pointerBase);
  12212. END;
  12213. | SyntaxTree.ArrayType DO
  12214. IF ~Indirect(type) THEN
  12215. IF type.form = SyntaxTree.Open THEN
  12216. IF RefInfo THEN Info(section,"OpenArray") END;
  12217. Char(section, sfTypeOpenArray);
  12218. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  12219. IF RefInfo THEN Info(section,"DynamicArray") END;
  12220. Char(section, sfTypeDynamicArray);
  12221. ELSIF type.form = SyntaxTree.Static THEN
  12222. IF RefInfo THEN Info(section,"StaticArray") END;
  12223. Char(section, sfTypeStaticArray);
  12224. Size(section, type.staticLength);
  12225. ELSE
  12226. HALT(100);
  12227. END;
  12228. NType(type.arrayBase);
  12229. END;
  12230. | SyntaxTree.MathArrayType DO
  12231. IF ~Indirect(type) THEN
  12232. IF type.form = SyntaxTree.Open THEN
  12233. IF RefInfo THEN Info(section,"MathOpenArray") END;
  12234. Char(section, sfTypeMathOpenArray);
  12235. ELSIF type.form = SyntaxTree.Static THEN
  12236. IF RefInfo THEN Info(section,"MathStaticArray") END;
  12237. Char(section, sfTypeMathStaticArray);
  12238. Size(section, type.staticLength);
  12239. ELSIF type.form = SyntaxTree.Tensor THEN
  12240. IF RefInfo THEN Info(section,"MathTensor") END;
  12241. Char(section, sfTypeMathTensor);
  12242. ELSE
  12243. HALT(100);
  12244. END;
  12245. NType(type.arrayBase);
  12246. END;
  12247. | SyntaxTree.RecordType DO
  12248. IF ~Indirect(type) THEN
  12249. IF type.pointerType # NIL (* OBJECT *) THEN
  12250. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12251. Char(section, sfTypePointerToRecord)
  12252. ELSE
  12253. IF RefInfo THEN Info(section,"Record") END;
  12254. Char(section, sfTypeRecord);
  12255. td := type.typeDeclaration;
  12256. IF RefInfo THEN Info(section,"TD") END;
  12257. IF (td # NIL) THEN
  12258. Global.GetSymbolSegmentedName(td,segmentedName);
  12259. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12260. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12261. ELSE
  12262. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12263. END;
  12264. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  12265. Symbol(section, tir, 0, offset);
  12266. ELSE
  12267. Address(section, 0);
  12268. END;
  12269. END;
  12270. END;
  12271. | SyntaxTree.CellType DO
  12272. IF ~Indirect(type) THEN
  12273. IF RefInfo THEN Info(section,"Record") END;
  12274. Char(section, sfTypeRecord);
  12275. td := type.typeDeclaration;
  12276. IF RefInfo THEN Info(section,"TD") END;
  12277. IF (td # NIL) THEN
  12278. Global.GetSymbolSegmentedName(td,segmentedName);
  12279. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12280. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12281. ELSE
  12282. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12283. END;
  12284. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12285. Symbol(section, tir, 0, offset);
  12286. ELSE
  12287. Address(section, 0);
  12288. END;
  12289. END;
  12290. | SyntaxTree.PortType DO
  12291. Char(section, sfTypePORT);
  12292. IF type.direction = SyntaxTree.OutPort THEN
  12293. Char(section, sfOUT)
  12294. ELSE
  12295. Char(section, sfIN)
  12296. END;
  12297. | SyntaxTree.ProcedureType DO
  12298. IF ~Indirect(type) THEN
  12299. IF type.isDelegate THEN
  12300. Char(section, sfTypeDelegate);
  12301. ELSE
  12302. Char(section, sfTypeProcedure);
  12303. END;
  12304. parameter := type.firstParameter;
  12305. WHILE(parameter # NIL) DO
  12306. NParameter(parameter, -1);
  12307. parameter := parameter.nextParameter;
  12308. END;
  12309. NType(type.returnType);
  12310. END;
  12311. | SyntaxTree.EnumerationType DO
  12312. Char(section, sfTypeENUM);
  12313. | SyntaxTree.BasicType DO
  12314. WITH type:
  12315. SyntaxTree.BooleanType DO
  12316. IF RefInfo THEN Info(section,"Boolean") END;
  12317. Char(section, sfTypeBOOLEAN);
  12318. | SyntaxTree.CharacterType DO
  12319. IF type = module.system.characterType THEN
  12320. IF RefInfo THEN Info(section,"CHAR") END;
  12321. Char(section, sfTypeCHAR);
  12322. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  12323. IF RefInfo THEN Info(section,"CHAR8") END;
  12324. Char(section, sfTypeCHAR8)
  12325. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  12326. IF RefInfo THEN Info(section,"CHAR16") END;
  12327. Char(section, sfTypeCHAR16);
  12328. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  12329. IF RefInfo THEN Info(section,"CHAR32") END;
  12330. Char(section, sfTypeCHAR32);
  12331. ELSE
  12332. HALT(100);
  12333. END;
  12334. |SyntaxTree.IntegerType DO
  12335. IF type(SyntaxTree.IntegerType).signed THEN
  12336. IF (type = module.system.shortintType) THEN
  12337. IF RefInfo THEN Info(section,"SHORTINT") END;
  12338. Char(section, sfTypeSHORTINT)
  12339. ELSIF (type = module.system.integerType) THEN
  12340. IF RefInfo THEN Info(section,"INTEGER") END;
  12341. Char(section, sfTypeINTEGER)
  12342. ELSIF (type = module.system.longintType) THEN
  12343. IF RefInfo THEN Info(section,"LONGINT") END;
  12344. Char(section, sfTypeLONGINT)
  12345. ELSIF (type = module.system.hugeintType) THEN
  12346. IF RefInfo THEN Info(section,"HUGEINT") END;
  12347. Char(section, sfTypeHUGEINT)
  12348. ELSIF (type = module.system.wordType) THEN
  12349. IF RefInfo THEN Info(section,"WORD") END;
  12350. Char(section, sfTypeWORD)
  12351. ELSIF (type = module.system.longWordType) THEN
  12352. IF RefInfo THEN Info(section,"LONGWORD") END;
  12353. Char(section, sfTypeLONGWORD);
  12354. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  12355. IF RefInfo THEN Info(section,"SIGNED8") END;
  12356. Char(section, sfTypeSIGNED8)
  12357. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  12358. IF RefInfo THEN Info(section,"SIGNED16") END;
  12359. Char(section, sfTypeSIGNED16)
  12360. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  12361. IF RefInfo THEN Info(section,"SIGNED32") END;
  12362. Char(section, sfTypeSIGNED32)
  12363. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  12364. IF RefInfo THEN Info(section,"SIGNED64") END;
  12365. Char(section, sfTypeSIGNED64)
  12366. ELSE
  12367. HALT(100);
  12368. END
  12369. ELSE (* unsigned *)
  12370. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  12371. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  12372. Char(section, sfTypeUNSIGNED8)
  12373. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  12374. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  12375. Char(section, sfTypeUNSIGNED16)
  12376. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  12377. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  12378. Char(section, sfTypeUNSIGNED32)
  12379. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  12380. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  12381. Char(section, sfTypeUNSIGNED64)
  12382. ELSE
  12383. HALT(100)
  12384. END
  12385. END;
  12386. | SyntaxTree.FloatType DO
  12387. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  12388. IF RefInfo THEN Info(section,"REAL") END;
  12389. Char(section, sfTypeREAL);
  12390. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  12391. IF RefInfo THEN Info(section,"LONGREAL") END;
  12392. Char(section, sfTypeLONGREAL);
  12393. ELSE
  12394. HALT(100);
  12395. END;
  12396. | SyntaxTree.ComplexType DO
  12397. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  12398. IF RefInfo THEN Info(section,"COMPLEX") END;
  12399. Char(section, sfTypeCOMPLEX);
  12400. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  12401. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  12402. Char(section, sfTypeLONGCOMPLEX);
  12403. ELSE
  12404. HALT(100);
  12405. END;
  12406. |SyntaxTree.SetType DO
  12407. IF RefInfo THEN Info(section,"SET") END;
  12408. Char(section, sfTypeSET);
  12409. |SyntaxTree.AnyType DO
  12410. IF RefInfo THEN Info(section,"ANY") END;
  12411. Char(section, sfTypeANY);
  12412. |SyntaxTree.ObjectType DO
  12413. IF RefInfo THEN Info(section,"OBJECT") END;
  12414. Char(section, sfTypeOBJECT);
  12415. |SyntaxTree.ByteType DO
  12416. IF RefInfo THEN Info(section,"BYTE") END;
  12417. Char(section, sfTypeBYTE);
  12418. |SyntaxTree.RangeType DO
  12419. IF RefInfo THEN Info(section,"RANGE") END;
  12420. Char(section, sfTypeRANGE)
  12421. |SyntaxTree.AddressType DO
  12422. IF RefInfo THEN Info(section,"ADDRESS") END;
  12423. Char(section, sfTypeADDRESS)
  12424. |SyntaxTree.SizeType DO
  12425. IF RefInfo THEN Info(section,"SIZE") END;
  12426. Char(section, sfTypeSIZE)
  12427. ELSE
  12428. HALT(100)
  12429. END;
  12430. ELSE HALT(101);
  12431. END;
  12432. END;
  12433. END NType;
  12434. (*
  12435. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  12436. *)
  12437. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  12438. VAR type: SyntaxTree.Type;
  12439. BEGIN
  12440. IF RefInfo THEN Info(section, "Parameter") END;
  12441. Char(section, sfVariable);
  12442. Size(section, procOffset);
  12443. String0(section, parameter.name);
  12444. type := parameter.type.resolved;
  12445. IF parameter.kind = SyntaxTree.VarParameter THEN
  12446. IF IsOpenArray(type) THEN Char(section, sfRelative)
  12447. ELSE Char(section, sfIndirect)
  12448. END;
  12449. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12450. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  12451. Char(section, sfIndirect);
  12452. ELSE
  12453. Char(section, sfRelative);
  12454. END;
  12455. ELSE
  12456. Char(section, sfRelative);
  12457. END;
  12458. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  12459. NType(parameter.type);
  12460. END NParameter;
  12461. (*
  12462. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12463. *)
  12464. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  12465. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  12466. flags: SET;
  12467. BEGIN
  12468. IF procedure.externalName # NIL THEN RETURN END;
  12469. IF RefInfo THEN Info(section, "Procedure") END;
  12470. pos := CurrentIndex();
  12471. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  12472. Char(section, sfProcedure);
  12473. Size(section, scopeOffset);
  12474. String0(section,procedure.name);
  12475. s := module.allSections.FindBySymbol(procedure);
  12476. Symbol(section,s,0,0); (* start *)
  12477. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  12478. flags := {};
  12479. IF procedureType.isDelegate THEN
  12480. INCL(flags, flagDelegate);
  12481. END;
  12482. IF procedure.isConstructor THEN
  12483. INCL(flags, flagConstructor);
  12484. END;
  12485. Set(section, flags);
  12486. IF RefInfo THEN Info(section, "Parameters") END;
  12487. parameter := procedureType.firstParameter;
  12488. WHILE(parameter # NIL) DO
  12489. NParameter(parameter, pos);
  12490. parameter := parameter.nextParameter;
  12491. END;
  12492. IF procedureType.returnParameter # NIL THEN
  12493. NParameter(procedureType.returnParameter, pos);
  12494. END;
  12495. IF procedureType.selfParameter # NIL THEN
  12496. NParameter(procedureType.selfParameter, pos);
  12497. END;
  12498. IF RefInfo THEN Info(section, "ReturnType") END;
  12499. NType(procedureType.returnType);
  12500. NScope(procedure.procedureScope, pos);
  12501. END NProcedure;
  12502. (*
  12503. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  12504. *)
  12505. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  12506. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  12507. BEGIN
  12508. IF RefInfo THEN Info(section, "Variable") END;
  12509. pos := CurrentIndex();
  12510. Char(section, sfVariable);
  12511. Size(section, scopeOffset);
  12512. String0(section, variable.name);
  12513. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  12514. Char(section, sfAbsolute);
  12515. IF variable.externalName # NIL THEN
  12516. sn := variable.externalName^;
  12517. NamedSymbol(section, sn,NIL, 0,0);
  12518. ELSE
  12519. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  12520. NamedSymbol(section, sn,variable, 0,0);
  12521. END;
  12522. ELSE
  12523. Char(section, sfRelative);
  12524. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  12525. END;
  12526. NType(variable.type);
  12527. s := module.allSections.FindBySymbol(variable);
  12528. END NVariable;
  12529. (*
  12530. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12531. *)
  12532. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  12533. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  12534. BEGIN
  12535. IF typeDeclaration = NIL THEN RETURN END;
  12536. pos := CurrentIndex();
  12537. s := module.allSections.FindBySymbol(typeDeclaration);
  12538. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  12539. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  12540. Char(section, sfTypeDeclaration);
  12541. Size(section, scopeOffset);
  12542. String0(section, typeDeclaration.name);
  12543. declared := typeDeclaration.declaredType.resolved;
  12544. IF (declared IS SyntaxTree.PointerType) THEN
  12545. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  12546. END;
  12547. WITH declared:
  12548. SyntaxTree.RecordType DO
  12549. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  12550. Symbol(section, s, 0, offset);
  12551. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12552. Basic.AppendToSegmentedName(name,".@Info");
  12553. s := module.allSections.FindByName(name);
  12554. IF s # NIL THEN (* does not work for coop *)
  12555. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12556. END;
  12557. NScope(declared.recordScope, pos);
  12558. |SyntaxTree.CellType DO
  12559. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12560. Symbol(section, s, 0, offset);
  12561. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12562. Basic.AppendToSegmentedName(name,".@Info");
  12563. s := module.allSections.FindByName(name);
  12564. IF s # NIL THEN
  12565. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12566. END;
  12567. NScope(declared.cellScope, pos);
  12568. ELSE
  12569. Address(section, 0);
  12570. END;
  12571. END NTypeDeclaration;
  12572. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  12573. VAR pos: LONGINT;
  12574. BEGIN
  12575. pos := CurrentIndex();
  12576. Char(section,sfModule);
  12577. Size(section, prevSymbol);
  12578. String0(section, module.name);
  12579. NScope(module.moduleScope, pos);
  12580. END NModule;
  12581. (*
  12582. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12583. *)
  12584. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  12585. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  12586. BEGIN
  12587. IF scope = NIL THEN RETURN END;
  12588. IF RefInfo THEN Info(section, "Scope") END;
  12589. Char(section, sfScopeBegin);
  12590. variable := scope.firstVariable;
  12591. WHILE (variable # NIL) DO
  12592. NVariable(variable, prevSymbol);
  12593. variable := variable.nextVariable;
  12594. END;
  12595. WITH scope:
  12596. SyntaxTree.ModuleScope DO
  12597. bodyProcedure := scope.bodyProcedure;
  12598. |SyntaxTree.RecordScope DO
  12599. bodyProcedure := scope.bodyProcedure;
  12600. ELSE
  12601. bodyProcedure := NIL;
  12602. END;
  12603. IF bodyProcedure # NIL THEN
  12604. NProcedure(bodyProcedure, prevSymbol)
  12605. END;
  12606. procedure := scope.firstProcedure;
  12607. WHILE procedure # NIL DO
  12608. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  12609. procedure := procedure.nextProcedure;
  12610. END;
  12611. typeDeclaration := scope.firstTypeDeclaration;
  12612. WHILE typeDeclaration # NIL DO
  12613. NTypeDeclaration(typeDeclaration, prevSymbol);
  12614. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  12615. END;
  12616. Char(section, sfScopeEnd); (* scope ends *)
  12617. END NScope;
  12618. BEGIN
  12619. NEW(indirectTypes, 32);
  12620. ArrayBlock(section,sizePC,"", FALSE);
  12621. startPC := section.pc;
  12622. NModule(module.module, -1);
  12623. PatchArray(section,sizePC,CurrentIndex());
  12624. END References;
  12625. (*
  12626. Command* = RECORD
  12627. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  12628. name*: Name; (* name of the procedure *)
  12629. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  12630. entryAdr* : ADDRESS; (* entry address of procedure *)
  12631. END;
  12632. *)
  12633. PROCEDURE CommandArray(source: IntermediateCode.Section);
  12634. VAR
  12635. p: Sections.Section; sizePC, numberCommands: LONGINT;
  12636. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  12637. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  12638. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  12639. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  12640. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  12641. BEGIN
  12642. RETURN
  12643. (type = NIL) OR
  12644. (type.resolved IS SyntaxTree.RecordType) OR
  12645. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  12646. (type.resolved IS SyntaxTree.AnyType);
  12647. END TypeAllowed;
  12648. BEGIN
  12649. numberParameters := procedureType.numberParameters;
  12650. RETURN
  12651. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  12652. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  12653. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  12654. END GetProcedureAllowed;
  12655. PROCEDURE WriteType(type : SyntaxTree.Type);
  12656. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  12657. name: Basic.SegmentedName; offset: LONGINT;
  12658. BEGIN
  12659. IF type = NIL THEN
  12660. Address(source,0);
  12661. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  12662. Address(source,1);
  12663. ELSE
  12664. type := type.resolved;
  12665. IF type IS SyntaxTree.PointerType THEN
  12666. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  12667. END;
  12668. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  12669. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  12670. name[0] := typeDeclaration.name; name[1] := -1;
  12671. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  12672. ASSERT(section # NIL);
  12673. ELSE
  12674. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12675. (* TODO *)
  12676. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  12677. END;
  12678. IF implementationVisitor.backend.cooperative THEN
  12679. offset := 0;
  12680. ELSE
  12681. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  12682. END;
  12683. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  12684. END;
  12685. END WriteType;
  12686. BEGIN
  12687. Info(source, "command array descriptor");
  12688. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  12689. numberCommands := 0;
  12690. Info(source, "command array content");
  12691. FOR i := 0 TO module.allSections.Length() - 1 DO
  12692. p := module.allSections.GetSection(i);
  12693. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  12694. procedure := p.symbol(SyntaxTree.Procedure);
  12695. procedureType := procedure.type(SyntaxTree.ProcedureType);
  12696. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  12697. procedure.GetName(name);
  12698. Name(source,name);
  12699. numberParameters := procedureType.numberParameters;
  12700. (* offset of type of first parameter *)
  12701. IF (numberParameters = 0 ) THEN WriteType(NIL)
  12702. ELSE WriteType(procedureType.firstParameter.type)
  12703. END;
  12704. (* offset of type of return parameter *)
  12705. WriteType(procedureType.returnType);
  12706. (* command name *)
  12707. (* command code offset *)
  12708. Symbol(source,p,0,0);
  12709. INC(numberCommands);
  12710. IF Trace THEN
  12711. D.Ln;
  12712. END;
  12713. END;
  12714. END
  12715. END;
  12716. PatchArray(source,sizePC,numberCommands);
  12717. END CommandArray;
  12718. (* to prevent from double import of different module aliases *)
  12719. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  12720. VAR i: SyntaxTree.Import;
  12721. BEGIN
  12722. i := module.module.moduleScope.firstImport;
  12723. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  12724. i := i.nextImport;
  12725. END;
  12726. RETURN i = import
  12727. END IsFirstDirectOccurence;
  12728. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  12729. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  12730. BEGIN
  12731. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  12732. ArrayBlock(source,pc,"", FALSE);
  12733. Info(source, "import module array data");
  12734. IF implementationVisitor.backend.cooperative THEN
  12735. offset := 0;
  12736. ELSE
  12737. IF module.system.addressType.sizeInBits = 64 THEN
  12738. (* change this when Heaps.HeapBlock is modified *)
  12739. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12740. ELSE
  12741. (* change this when Heaps.HeapBlock is modified *)
  12742. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12743. END;
  12744. END;
  12745. import := module.module.moduleScope.firstImport;
  12746. numberImports := 0;
  12747. WHILE import # NIL DO
  12748. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  12749. Global.GetModuleSegmentedName(import.module,name);
  12750. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  12751. NamedSymbol(source, name, NIL, 0, offset);
  12752. INC(numberImports);
  12753. END;
  12754. import := import.nextImport
  12755. END;
  12756. PatchArray(source,pc,numberImports);
  12757. END ImportsArray;
  12758. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  12759. VAR
  12760. p: Sections.Section; sizePC, size, i: LONGINT;
  12761. BEGIN
  12762. Info(source, "Type info section");
  12763. size := 0;
  12764. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  12765. FOR i := 0 TO module.allSections.Length() - 1 DO
  12766. p := module.allSections.GetSection(i);
  12767. WITH p: IntermediateCode.Section DO
  12768. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  12769. Symbol(source,p,EmptyBlockOffset,0);
  12770. INC(size);
  12771. END;
  12772. END
  12773. END;
  12774. PatchArray(source,sizePC,size);
  12775. END TypeInfoSection;
  12776. (*
  12777. ProcTableEntry* = RECORD
  12778. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  12779. noPtr*: LONGINT;
  12780. END;
  12781. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  12782. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  12783. *)
  12784. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12785. VAR
  12786. numberPointers: LONGINT;
  12787. procedure: SyntaxTree.Procedure;
  12788. BEGIN
  12789. Info(section,"pcFrom");
  12790. Symbol(section,procedureSection,0,0);
  12791. Info(section,"pcTo");
  12792. Symbol(section, procedureSection, procedureSection.pc, 0);
  12793. Info(section,"pointer to offsets array");
  12794. Symbol(section, section,section.pc+1,0);
  12795. Info(section,"offsets array");
  12796. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  12797. PointerArray(section, procedure.procedureScope, numberPointers);
  12798. END ProcedureDescriptor;
  12799. (* only for tracing, the descriptor is otherwise not complete ! *)
  12800. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  12801. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  12802. BEGIN
  12803. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  12804. name := procedureSection.name;
  12805. Basic.AppendToSegmentedName(name,".@Info");
  12806. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12807. Address(section,0);
  12808. Symbol(section,section,2,0);
  12809. (*
  12810. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  12811. descSize: SIZE;
  12812. sentinel: ADDRESS; (* = MPO-4 *)
  12813. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12814. flags*: SET;
  12815. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12816. name*: Name;
  12817. END;
  12818. *)
  12819. Size(section, 0);
  12820. Address(section,0);
  12821. Address(section,0);
  12822. Set(section,{});
  12823. moduleSection := ModuleSection();
  12824. Symbol( section, moduleSection, moduleSection.pc,0);
  12825. IF procedureSection.symbol = NIL THEN
  12826. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12827. ELSE
  12828. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12829. END;
  12830. Name(section, infoName);
  12831. Size(section, 0);
  12832. RETURN section;
  12833. END MakeProcedureDescriptorTag;
  12834. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12835. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12836. BEGIN
  12837. name := procedureSection.name;
  12838. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12839. IF implementationVisitor.backend.cooperative THEN
  12840. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12841. Info(section, "TypeDescriptor");
  12842. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12843. NamedSymbol(dest, name,NIL, 0, 0);
  12844. BaseRecord(dest);
  12845. offset := 0;
  12846. ELSIF CreateProcedureDescInfo THEN
  12847. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12848. Address(dest,0);
  12849. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12850. offset := dest.pc;
  12851. ELSE
  12852. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12853. END;
  12854. ProcedureDescriptor(dest, procedureSection);
  12855. Symbol(section, dest, offset, 0);
  12856. END ProcedureDescriptorPointer;
  12857. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12858. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12859. BEGIN
  12860. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12861. numberProcs := 0;
  12862. FOR i := 0 TO module.allSections.Length() - 1 DO
  12863. destination := module.allSections.GetSection(i);
  12864. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12865. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12866. INC(numberProcs);
  12867. END
  12868. END;
  12869. PatchArray(section, sizePC, numberProcs);
  12870. END ProcedureDescriptorArray;
  12871. (*
  12872. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12873. VAR
  12874. next*: Module; (** once a module is published, all fields are read-only *)
  12875. name*: Name;
  12876. init, published: BOOLEAN;
  12877. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12878. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12879. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12880. command*: POINTER TO ARRAY OF Command;
  12881. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12882. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12883. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12884. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12885. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12886. data*, code*: Bytes;
  12887. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12888. export*: ExportDesc;
  12889. term*: TerminationHandler;
  12890. exTable*: ExceptionTable;
  12891. noProcs*: LONGINT;
  12892. firstProc*: ADDRESS; <- done by loader
  12893. maxPtrs*: LONGINT;
  12894. crc*: LONGINT;
  12895. *)
  12896. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12897. BEGIN
  12898. Info(section, "cycle");
  12899. Size(section,0);
  12900. Info(section, "references");
  12901. Size(section,0);
  12902. Info(section, "nextMarked");
  12903. Address(section,0);
  12904. Info(section, "nextWatched");
  12905. Address(section,0);
  12906. END BasePointer;
  12907. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12908. BEGIN
  12909. BasePointer(section);
  12910. Info(section, "action");
  12911. Address(section,0);
  12912. Info(section, "monitor");
  12913. Address(section,0);
  12914. END BaseObject;
  12915. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12916. BEGIN
  12917. BasePointer(section);
  12918. Info(section, "action");
  12919. Address(section,0);
  12920. Info(section, "monitor");
  12921. Address(section,0);
  12922. END BaseRecord;
  12923. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12924. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12925. pooledName: Basic.SegmentedName;
  12926. symbol: SyntaxTree.Symbol;
  12927. BEGIN
  12928. Global.GetModuleName(module.module,name);
  12929. Strings.Append(name,".@Module.@Descriptor");
  12930. Basic.ToSegmentedName(name, pooledName);
  12931. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12932. Symbol(section,descriptorSection,0,0);
  12933. Info(descriptorSection, "descriptor");
  12934. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12935. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12936. Address(descriptorSection,0);
  12937. Global.GetModuleName(module.module,name);
  12938. Strings.Append(name,".@Trace");
  12939. Basic.ToSegmentedName(name, pooledName);
  12940. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12941. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12942. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12943. END ModuleDescriptor;
  12944. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12945. VAR name: ARRAY 128 OF CHAR;
  12946. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12947. symbol: SyntaxTree.Symbol;
  12948. BEGIN
  12949. Global.GetModuleName(module.module,name);
  12950. Strings.Append(name,".@Module");
  12951. Basic.ToSegmentedName(name, pooledName);
  12952. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12953. moduleSection.SetExported(TRUE);
  12954. IF moduleSection.pc = 0 THEN
  12955. IF implementationVisitor.backend.cooperative THEN
  12956. Info(moduleSection, "descriptor");
  12957. ModuleDescriptor(moduleSection);
  12958. BaseObject(moduleSection);
  12959. implementationVisitor.CreateTraceModuleMethod(module.module);
  12960. ELSE
  12961. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12962. Info(moduleSection, "HeapBlock");
  12963. Symbol(moduleSection,moduleSection,2,0);
  12964. Info(moduleSection, "TypeDescriptor");
  12965. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12966. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12967. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12968. END;
  12969. END;
  12970. RETURN moduleSection;
  12971. END ModuleSection;
  12972. PROCEDURE NewModuleInfo();
  12973. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12974. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12975. sectionName: Basic.SectionName;
  12976. CONST MPO=-40000000H;
  12977. BEGIN
  12978. (*
  12979. TypeDesc* = POINTER TO RECORD
  12980. descSize: SIZE;
  12981. sentinel: LONGINT; (* = MPO-4 *)
  12982. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12983. flags*: SET;
  12984. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12985. name*: Name;
  12986. refsOffset: SIZE;
  12987. END;
  12988. *)
  12989. (*name is missing prefixes sometimes*)
  12990. Global.GetModuleSegmentedName(module.module,name);
  12991. Basic.AppendToSegmentedName(name,".@Info");
  12992. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12993. IF ~implementationVisitor.backend.cooperative THEN
  12994. Info(source, "HeapBlock");
  12995. Address(source,0); (* an empty heap block prevents GC marking *)
  12996. Info(source, "TypeDescriptor");
  12997. Address(source,0);
  12998. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12999. END;
  13000. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13001. Address(source,MPO-4);
  13002. Info(source, "type tag pointer");
  13003. Address( source,0);
  13004. Info(source, "type flags");
  13005. flags := {};
  13006. Set( source, flags);
  13007. Info(source, "pointer to module");
  13008. moduleSection := ModuleSection();
  13009. Symbol( source, moduleSection, moduleSection.pc,0);
  13010. Info(source, "type name");
  13011. i := 0;
  13012. sectionName := "@Self";
  13013. (*
  13014. Global.GetSymbolSegmentedName(td,name);
  13015. Basic.SegmentedNameToString(name, sectionName);
  13016. *)
  13017. Name(source,sectionName);
  13018. patchInfoPC := source.pc;
  13019. Size(source, 0);
  13020. END NewModuleInfo;
  13021. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  13022. VAR
  13023. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  13024. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  13025. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  13026. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  13027. referenceSectionOffset : LONGINT;
  13028. name: Basic.SegmentedName; offset: LONGINT;
  13029. flags: SET;
  13030. BEGIN
  13031. NewModuleInfo();
  13032. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  13033. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  13034. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  13035. ImportsArray(importSection);
  13036. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  13037. CommandArray(commandsSection);
  13038. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  13039. ExceptionArray(exceptionSection);
  13040. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  13041. AddPointer(typeInfoSection, typeInfoSectionOffset);
  13042. TypeInfoSection(typeInfoSection);
  13043. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  13044. referenceSection.SetExported(TRUE);
  13045. References(referenceSection);
  13046. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  13047. ProcedureDescriptorArray(procTableSection, numberProcs);
  13048. IF ProtectModulesPointers THEN
  13049. name := "Heaps.AnyPtr";
  13050. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  13051. (* set base pointer *)
  13052. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  13053. END;
  13054. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  13055. ArrayBlock(emptyArraySection,temp,"", FALSE);
  13056. moduleSection := ModuleSection();
  13057. Info(moduleSection, "nextRoot*: RootObject");
  13058. Address(moduleSection,0);
  13059. Info(moduleSection, "next*: Module");
  13060. Address(moduleSection,0);
  13061. Info(moduleSection, "name*: Name");
  13062. Name(moduleSection,moduleName);
  13063. Info(moduleSection, "init, published: BOOLEAN");
  13064. Boolean(moduleSection,FALSE);
  13065. Boolean(moduleSection,FALSE);
  13066. Info(moduleSection,"filler"); (*! introduce alignment! *)
  13067. Boolean(moduleSection,FALSE);
  13068. Boolean(moduleSection,FALSE);
  13069. Info(moduleSection, "refcnt*: LONGINT");
  13070. Longint(moduleSection,0);
  13071. Info(moduleSection, "sb*: ADDRESS");
  13072. Address(moduleSection,0);
  13073. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  13074. Address(moduleSection,0);
  13075. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  13076. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  13077. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  13078. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  13079. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  13080. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  13081. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  13082. Symbol(moduleSection,importSection,importSectionOffset,0);
  13083. Info(moduleSection, "procTable*: ProcTable");
  13084. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  13085. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  13086. Address(moduleSection,0);
  13087. Address(moduleSection,0);
  13088. Address(moduleSection,0);
  13089. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  13090. Info(moduleSection, "export*: ExportDesc");
  13091. ExportDesc(moduleSection);
  13092. Info(moduleSection, "term*: TerminationHandler");
  13093. Address(moduleSection,0);
  13094. Info(moduleSection, "exTable*: ExceptionTable");
  13095. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  13096. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  13097. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  13098. Info(moduleSection, "crc*: LONGINT");
  13099. patchCRC:= moduleSection.pc;
  13100. Longint(moduleSection, 0); (*! must be implemented *)
  13101. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  13102. Info(moduleSection, "body*: ADDRESS");
  13103. Symbol(moduleSection, bodyProc, 0,0);
  13104. Info(moduleSection, "module flags");
  13105. flags := {};
  13106. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  13107. Set( moduleSection, flags);
  13108. IF implementationVisitor.backend.cooperative THEN
  13109. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  13110. Info(moduleSection, "monitor.owner");
  13111. Address(moduleSection,0);
  13112. Info(moduleSection, "monitor.nestingLevel");
  13113. Address(moduleSection,0);
  13114. Info(moduleSection, "monitor.blockedQueue");
  13115. Address(moduleSection,0); Address(moduleSection,0);
  13116. Info(moduleSection, "monitor.waitingQueue");
  13117. Address(moduleSection,0); Address(moduleSection,0);
  13118. Info(moduleSection, "monitor.waitingSentinel");
  13119. Address(moduleSection,0);
  13120. END;
  13121. END Module;
  13122. PROCEDURE PatchCRC(crc: LONGINT);
  13123. BEGIN
  13124. IF ~simple THEN
  13125. PatchLongint(ModuleSection(), patchCRC, crc);
  13126. END;
  13127. END PatchCRC;
  13128. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  13129. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  13130. BEGIN
  13131. ArrayBlock(source,pc,"",FALSE);
  13132. Info(source, "pointer offsets array data");
  13133. IF scope IS SyntaxTree.RecordScope THEN
  13134. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  13135. ELSIF scope IS SyntaxTree.CellScope THEN
  13136. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  13137. ELSIF scope IS SyntaxTree.ModuleScope THEN
  13138. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  13139. WHILE variable # NIL DO
  13140. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13141. symbol := module.allSections.FindBySymbol(variable);
  13142. ASSERT(symbol # NIL);
  13143. Pointers(0,symbol, source,variable.type,numberPointers);
  13144. END;
  13145. variable := variable.nextVariable;
  13146. END;
  13147. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  13148. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13149. WHILE parameter # NIL DO
  13150. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  13151. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  13152. END;
  13153. parameter := parameter.nextParameter;
  13154. END;
  13155. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  13156. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  13157. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13158. IF implementationVisitor.backend.preciseGC THEN
  13159. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13160. END;
  13161. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  13162. END;
  13163. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  13164. WHILE(variable # NIL) DO
  13165. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13166. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  13167. END;
  13168. variable := variable.nextVariable
  13169. END;
  13170. END;
  13171. PatchArray(source,pc,numberPointers);
  13172. END PointerArray;
  13173. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  13174. VAR recordType: SyntaxTree.RecordType;
  13175. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  13176. section: Sections.Section; cellType: SyntaxTree.CellType;
  13177. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  13178. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13179. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13180. sectionName: Basic.SectionName;
  13181. CONST MPO=-40000000H;
  13182. BEGIN
  13183. (*
  13184. TypeDesc* = POINTER TO RECORD
  13185. descSize: SIZE;
  13186. sentinel: LONGINT; (* = MPO-4 *)
  13187. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13188. flags*: SET;
  13189. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13190. name*: Name;
  13191. refsOffset: SIZE;
  13192. END;
  13193. *)
  13194. (* source := module.sections.FindByName(...) *)
  13195. Global.GetSymbolSegmentedName(td,name);
  13196. Basic.AppendToSegmentedName(name,".@Info");
  13197. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13198. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  13199. Address(source,0);
  13200. Info(source, "TypeDescriptor");
  13201. Address(source,0);
  13202. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13203. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13204. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  13205. Info(source, "type tag pointer");
  13206. Symbol( source, tag, offset, 0);
  13207. Info(source, "type flags");
  13208. flags := {};
  13209. IF isProtected THEN INCL(flags,31) END;
  13210. Set( source, flags);
  13211. Info(source, "pointer to module");
  13212. moduleSection := ModuleSection();
  13213. Symbol( source, moduleSection, moduleSection.pc,0);
  13214. Info(source, "type name");
  13215. i := 0;
  13216. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  13217. (*
  13218. Global.GetSymbolSegmentedName(td,name);
  13219. Basic.SegmentedNameToString(name, sectionName);
  13220. *)
  13221. Name(source,sectionName);
  13222. Size(source, 0);
  13223. RETURN source;
  13224. END NewTypeDescriptorInfo;
  13225. PROCEDURE NewTypeDescriptor;
  13226. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  13227. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  13228. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  13229. numberPointers: LONGINT; padding, i: LONGINT;
  13230. CONST MPO=-40000000H;
  13231. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  13232. VAR i: LONGINT;
  13233. PROCEDURE Td(record: SyntaxTree.RecordType);
  13234. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  13235. BEGIN
  13236. IF record # NIL THEN
  13237. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  13238. baseTD := record.typeDeclaration;
  13239. Global.GetSymbolSegmentedName(baseTD,name);
  13240. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13241. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13242. ELSE
  13243. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13244. END;
  13245. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  13246. Symbol(source, tir, 0, offset);
  13247. IF reverse THEN Td(record.GetBaseRecord()) END;
  13248. END;
  13249. END Td;
  13250. BEGIN
  13251. Info(source, "tag table");
  13252. baseRecord := recordType;
  13253. i := 0;
  13254. WHILE baseRecord # NIL DO
  13255. INC(i);
  13256. baseRecord := baseRecord.GetBaseRecord();
  13257. END;
  13258. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  13259. IF ~reverse THEN Td(recordType) END;
  13260. WHILE i < size DO
  13261. Address(source,0);
  13262. INC(i);
  13263. END;
  13264. IF reverse THEN Td(recordType) END;
  13265. END TdTable;
  13266. PROCEDURE MethodTable(reverse: BOOLEAN);
  13267. VAR i,methods: LONGINT;
  13268. BEGIN
  13269. Info(source, "method table");
  13270. IF recordType # NIL THEN
  13271. methods := recordType.recordScope.numberMethods;
  13272. IF reverse THEN
  13273. FOR i := methods-1 TO 0 BY -1 DO
  13274. procedure := recordType.recordScope.FindMethod(i);
  13275. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13276. NamedSymbol(source, name,procedure, 0,0);
  13277. END;
  13278. ELSE
  13279. FOR i := 0 TO methods-1 DO
  13280. procedure := recordType.recordScope.FindMethod(i);
  13281. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13282. NamedSymbol(source, name,procedure, 0,0);
  13283. END;
  13284. END;
  13285. END;
  13286. END MethodTable;
  13287. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  13288. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  13289. BEGIN
  13290. Info(source, "method table");
  13291. baseRecord := recordType;
  13292. WHILE baseRecord.baseType # NIL DO
  13293. baseRecord := baseRecord.GetBaseRecord ();
  13294. END;
  13295. GetRecordTypeName (baseRecord, name);
  13296. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  13297. IF name = stackFrame THEN
  13298. start := 0;
  13299. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  13300. baseRecord := recordType;
  13301. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  13302. baseRecord := baseRecord.GetBaseRecord ();
  13303. END;
  13304. IF baseRecord # NIL THEN
  13305. GetRecordTypeName (baseRecord, name);
  13306. IF pointer & ~baseRecord.isObject THEN
  13307. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13308. END;
  13309. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  13310. ELSIF recordType.isObject THEN
  13311. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  13312. ELSIF pointer THEN
  13313. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  13314. ELSE
  13315. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  13316. END;
  13317. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13318. Symbol(source, tir, 0, 0);
  13319. start := 0;
  13320. baseRecord := recordType;
  13321. WHILE (baseRecord # NIL) DO
  13322. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  13323. baseRecord := baseRecord.GetBaseRecord ();
  13324. END;
  13325. ELSE
  13326. (* explicit trace method: *)
  13327. procedure := recordType.recordScope.FindMethod(0);
  13328. IF ~procedure.isFinalizer THEN
  13329. Global.GetSymbolSegmentedName(procedure, name);
  13330. NamedSymbol(source, name,procedure, 0,0);
  13331. END;
  13332. start := 1;
  13333. END;
  13334. IF (name # stackFrame) & recordType.isObject THEN
  13335. baseRecord := recordType;
  13336. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  13337. baseRecord := baseRecord.GetBaseRecord ();
  13338. END;
  13339. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  13340. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  13341. ELSE
  13342. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  13343. END;
  13344. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13345. Symbol(source, tir, 0, 0);
  13346. END;
  13347. methods := recordType.recordScope.numberMethods;
  13348. FOR i := start TO methods-1 DO
  13349. procedure := recordType.recordScope.FindMethod(i);
  13350. IF ~procedure.isFinalizer THEN
  13351. Global.GetSymbolSegmentedName(procedure, name);
  13352. NamedSymbol(source, name,procedure, 0,0);
  13353. END;
  13354. END;
  13355. END CooperativeMethodTable;
  13356. BEGIN
  13357. Global.GetSymbolSegmentedName(td,name);
  13358. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  13359. source.SetExported(IsExported(td));
  13360. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  13361. IF implementationVisitor.backend.cooperative THEN
  13362. base := NIL;
  13363. baseRecord := recordType.GetBaseRecord();
  13364. IF baseRecord # NIL THEN
  13365. baseTD := baseRecord.typeDeclaration;
  13366. END;
  13367. IF ~recordType.isObject THEN
  13368. Info(source, "parent");
  13369. IF baseRecord # NIL THEN
  13370. Global.GetSymbolSegmentedName(baseTD,name);
  13371. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13372. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13373. ELSE
  13374. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13375. END;
  13376. Symbol(source, tir, 0, 0);
  13377. ELSE
  13378. Address(source,0);
  13379. END;
  13380. Info(source, "record size");
  13381. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13382. CooperativeMethodTable(FALSE);
  13383. base := source;
  13384. Global.GetSymbolSegmentedName(td,name);
  13385. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13386. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13387. source.SetExported(IsExported(td));
  13388. END;
  13389. Info(source, "parent");
  13390. IF baseRecord # NIL THEN
  13391. Global.GetSymbolSegmentedName(baseTD,name);
  13392. sym := baseTD;
  13393. IF ~recordType.isObject THEN
  13394. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13395. sym := NIL;
  13396. END;
  13397. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13398. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13399. ELSE
  13400. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13401. END;
  13402. Symbol(source, tir, 0, 0);
  13403. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  13404. Address(source,0);
  13405. ELSE
  13406. IF recordType.isObject THEN
  13407. Basic.ToSegmentedName ("BaseTypes.Object",name);
  13408. ELSE
  13409. Basic.ToSegmentedName ("BaseTypes.Record",name);
  13410. END;
  13411. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13412. Symbol(source, tir, 0, 0);
  13413. END;
  13414. Info(source, "base record descriptor");
  13415. Symbol(source, base, 0, 0);
  13416. CooperativeMethodTable(TRUE);
  13417. IF recordType.hasPointers THEN
  13418. IF ~HasExplicitTraceMethod (recordType) THEN
  13419. implementationVisitor.CreateTraceMethod(recordType);
  13420. END;
  13421. implementationVisitor.CreateResetProcedure(recordType);
  13422. implementationVisitor.CreateAssignProcedure(recordType);
  13423. END;
  13424. ELSIF ~simple THEN
  13425. (*
  13426. MethodEnd = MPO
  13427. ---
  13428. methods (# methods)
  13429. ---
  13430. tags (16)
  13431. ---
  13432. TypeDesc = TypeInfoAdr
  13433. ---
  13434. td adr ---> rec size
  13435. ----
  13436. pointer offsets
  13437. ----
  13438. (padding)
  13439. -----
  13440. empty [2 addresses aligned]
  13441. empty
  13442. empty
  13443. numPtrs
  13444. ---
  13445. pointer offsets
  13446. ---
  13447. *)
  13448. Info(source, "MethodEnd = MPO");
  13449. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  13450. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  13451. MethodTable(TRUE);
  13452. TdTable(TypeTags, TRUE);
  13453. Info(source, "type descriptor info pointer");
  13454. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  13455. Symbol(source, tdInfo,EmptyBlockOffset,0);
  13456. IF (cellType # NIL) THEN
  13457. IF cellType.sizeInBits < 0 THEN
  13458. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  13459. END;
  13460. Info(source, "cell size");
  13461. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  13462. ELSE
  13463. Info(source, "record size");
  13464. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13465. END;
  13466. Info(source, "pointer offsets pointer");
  13467. padding := 1- source.pc MOD 2;
  13468. Symbol(source, source, source.pc+1+padding,0);
  13469. IF padding >0 THEN
  13470. Info(source, "padding");
  13471. FOR i := 1 TO padding DO Address(source,0) END;
  13472. END;
  13473. IF cellType # NIL THEN
  13474. PointerArray(source, cellType.cellScope, numberPointers);
  13475. ELSE
  13476. PointerArray(source, recordType.recordScope, numberPointers);
  13477. END;
  13478. ELSE
  13479. (*
  13480. simple:
  13481. td adr --> size
  13482. tag(1)
  13483. tag(2)
  13484. tag(3)
  13485. methods ->
  13486. *)
  13487. Info(source, "record size");
  13488. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13489. TdTable(TypeTags, FALSE);
  13490. MethodTable(FALSE);
  13491. END;
  13492. END NewTypeDescriptor;
  13493. BEGIN
  13494. x := x.resolved;
  13495. IF (x IS SyntaxTree.PointerType) THEN
  13496. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  13497. END;
  13498. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  13499. recordType := x(SyntaxTree.RecordType);
  13500. td := x.typeDeclaration;
  13501. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13502. ASSERT(td # NIL);
  13503. section := module.allSections.FindBySymbol(td); (* TODO *)
  13504. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13505. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13506. NewTypeDescriptor
  13507. END;
  13508. END;
  13509. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  13510. cellType := x(SyntaxTree.CellType);
  13511. td := x.typeDeclaration;
  13512. section := module.allSections.FindBySymbol(td); (* TODO *)
  13513. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13514. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13515. NewTypeDescriptor
  13516. END;
  13517. END;
  13518. END
  13519. END CheckTypeDeclaration
  13520. END MetaDataGenerator;
  13521. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  13522. VAR
  13523. trace-: BOOLEAN;
  13524. traceString-: SyntaxTree.IdentifierString;
  13525. traceModuleName-: SyntaxTree.IdentifierString;
  13526. profile-: BOOLEAN;
  13527. noRuntimeChecks: BOOLEAN;
  13528. simpleMetaData-: BOOLEAN;
  13529. noAsserts: BOOLEAN;
  13530. optimize-: BOOLEAN;
  13531. cooperative-: BOOLEAN;
  13532. preregisterStatic-: BOOLEAN;
  13533. dump-: Basic.Writer;
  13534. cellsAreObjects: BOOLEAN;
  13535. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  13536. experiment: BOOLEAN;
  13537. PROCEDURE &InitIntermediateBackend*;
  13538. BEGIN
  13539. simpleMetaData := FALSE;
  13540. InitBackend;
  13541. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  13542. SetTraceModuleName(DefaultTraceModuleName);
  13543. END InitIntermediateBackend;
  13544. (* must be overwritten by actual backend, if parameter registers should be used *)
  13545. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  13546. BEGIN
  13547. register := -1;
  13548. RETURN FALSE;
  13549. END GetParameterRegister;
  13550. PROCEDURE ResetParameterRegisters*;
  13551. BEGIN
  13552. END ResetParameterRegisters;
  13553. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  13554. VAR
  13555. declarationVisitor: DeclarationVisitor;
  13556. implementationVisitor: ImplementationVisitor;
  13557. module: Sections.Module;
  13558. name, platformName: SyntaxTree.IdentifierString;
  13559. meta: MetaDataGenerator;
  13560. crc: CRC.CRC32Stream;
  13561. BEGIN
  13562. ResetError;
  13563. Global.GetSymbolName(x,name);
  13564. NEW(module,x,system); (* backend structures *)
  13565. Global.GetModuleName(x, name);
  13566. module.SetModuleName(name);
  13567. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  13568. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  13569. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  13570. declarationVisitor.Module(x,module);
  13571. IF ~meta.simple THEN
  13572. meta.Module(implementationVisitor.moduleBodySection);
  13573. END;
  13574. GetDescription(platformName);
  13575. module.SetPlatformName(platformName);
  13576. NEW(crc);
  13577. module.allSections.WriteRaw(crc);
  13578. crc.Update;
  13579. meta.PatchCRC(crc.GetCRC());
  13580. RETURN module
  13581. END GenerateIntermediate;
  13582. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  13583. BEGIN RETURN TRUE
  13584. END SupportedImmediate;
  13585. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  13586. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  13587. END ProcessSyntaxTreeModule;
  13588. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  13589. VAR
  13590. result: Sections.Module;
  13591. traceName: Basic.MessageString;
  13592. BEGIN
  13593. ASSERT(intermediateCodeModule IS Sections.Module);
  13594. result := intermediateCodeModule(Sections.Module);
  13595. IF trace THEN
  13596. traceName := "intermediate code trace: ";
  13597. Strings.Append(traceName,traceString);
  13598. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  13599. IF (traceString="") OR (traceString="*") THEN
  13600. result.Dump(dump);
  13601. dump.Update
  13602. ELSE
  13603. Sections.DumpFiltered(dump, result, traceString);
  13604. END
  13605. END;
  13606. RETURN result
  13607. END ProcessIntermediateCodeModule;
  13608. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  13609. BEGIN instructionSet := "Intermediate";
  13610. END GetDescription;
  13611. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  13612. BEGIN
  13613. SELF.simpleMetaData := simpleMetaData;
  13614. END SetSimpleMetaData;
  13615. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  13616. BEGIN COPY(name, traceModuleName)
  13617. END SetTraceModuleName;
  13618. PROCEDURE DefineOptions*(options: Options.Options);
  13619. BEGIN
  13620. DefineOptions^(options);
  13621. options.Add(0X,"trace",Options.String);
  13622. options.Add(0X,"builtinsModule",Options.String);
  13623. options.Add(0X,"traceModule",Options.String);
  13624. options.Add(0X,"profile",Options.Flag);
  13625. options.Add(0X,"noRuntimeChecks",Options.Flag);
  13626. options.Add(0X,"noAsserts",Options.Flag);
  13627. options.Add(0X,"metaData",Options.String);
  13628. options.Add('o',"optimize", Options.Flag);
  13629. options.Add(0X,"preregisterStatic", Options.Flag);
  13630. options.Add(0X,"cellsAreObjects", Options.Flag);
  13631. options.Add(0X,"preciseGC", Options.Flag);
  13632. options.Add(0X,"trackLeave", Options.Flag);
  13633. options.Add(0X,"writeBarriers", Options.Flag);
  13634. options.Add(0X,"experiment", Options.Flag);
  13635. END DefineOptions;
  13636. PROCEDURE GetOptions*(options: Options.Options);
  13637. VAR name,string: SyntaxTree.IdentifierString;
  13638. BEGIN
  13639. GetOptions^(options);
  13640. trace := options.GetString("trace",traceString);
  13641. profile := options.GetFlag("profile");
  13642. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  13643. noAsserts := options.GetFlag("noAsserts");
  13644. cooperative := options.GetFlag("cooperative");
  13645. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  13646. simpleMetaData := TRUE
  13647. END;
  13648. IF options.GetString("metaData",string) THEN
  13649. IF string = "simple" THEN simpleMetaData := TRUE
  13650. ELSIF string ="full" THEN simpleMetaData := FALSE
  13651. END;
  13652. END;
  13653. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  13654. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  13655. optimize := options.GetFlag("optimize");
  13656. preregisterStatic := options.GetFlag("preregisterStatic");
  13657. cellsAreObjects := options.GetFlag("cellsAreObjects");
  13658. preciseGC := options.GetFlag("preciseGC");
  13659. trackLeave := options.GetFlag("trackLeave");
  13660. writeBarriers := options.GetFlag("writeBarriers");
  13661. experiment := options.GetFlag("experiment");
  13662. IF simpleMetaData THEN preciseGC := FALSE END;
  13663. END GetOptions;
  13664. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  13665. BEGIN RETURN SymbolFileFormat.Get()
  13666. END DefaultSymbolFileFormat;
  13667. END IntermediateBackend;
  13668. (* ----------------------------------- register allocation ------------------------------------- *)
  13669. (* register mapping scheme
  13670. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  13671. spill offset
  13672. part(n) --> ticket <--> physical register
  13673. spill offset
  13674. *)
  13675. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  13676. emptyOperand: IntermediateCode.Operand;
  13677. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  13678. statCoopResetVariables: LONGINT;
  13679. statCoopModifyAssignments: LONGINT;
  13680. modifyAssignmentsPC : LONGINT;
  13681. statCoopNilCheck: LONGINT;
  13682. statCoopSwitch: LONGINT;
  13683. statCoopAssignProcedure: LONGINT;
  13684. statCoopTraceMethod: LONGINT;
  13685. statCoopResetProcedure: LONGINT;
  13686. statCoopTraceModule: LONGINT;
  13687. PROCEDURE ResetStatistics*;
  13688. BEGIN
  13689. statCoopResetVariables := 0;
  13690. statCoopModifyAssignments := 0;
  13691. statCoopNilCheck:= 0;
  13692. statCoopSwitch:= 0;
  13693. statCoopAssignProcedure:= 0;
  13694. statCoopTraceMethod:= 0;
  13695. statCoopResetProcedure:= 0;
  13696. statCoopTraceModule:= 0;
  13697. END ResetStatistics;
  13698. PROCEDURE Statistics*;
  13699. BEGIN
  13700. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  13701. TRACE(statCoopNilCheck, statCoopSwitch);
  13702. TRACE(statCoopAssignProcedure,
  13703. statCoopTraceMethod,
  13704. statCoopResetProcedure,
  13705. statCoopTraceModule)
  13706. END Statistics;
  13707. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  13708. VAR h: LONGINT;
  13709. BEGIN
  13710. WHILE b # 0 DO
  13711. h := a MOD b;
  13712. a := b;
  13713. b := h;
  13714. END;
  13715. RETURN a
  13716. END GCD;
  13717. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  13718. BEGIN
  13719. RETURN a*b DIV GCD(a,b)
  13720. END SCM;
  13721. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  13722. BEGIN
  13723. (*TRACE(a,b);*)
  13724. IF a = 0 THEN RETURN b
  13725. ELSIF b = 0 THEN RETURN a
  13726. ELSE RETURN SCM(a,b)
  13727. END;
  13728. END CommonAlignment;
  13729. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13730. BEGIN
  13731. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  13732. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  13733. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13734. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  13735. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13736. END
  13737. END PassBySingleReference;
  13738. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13739. BEGIN
  13740. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  13741. END PassInRegister;
  13742. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  13743. VAR new: RegisterEntry;
  13744. BEGIN
  13745. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  13746. IF queue = NIL THEN
  13747. queue := new
  13748. ELSE
  13749. new.next := queue;
  13750. IF queue#NIL THEN queue.prev := new END;
  13751. queue := new
  13752. END;
  13753. END AddRegisterEntry;
  13754. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  13755. VAR this: RegisterEntry;
  13756. BEGIN
  13757. this := queue;
  13758. WHILE (this # NIL) & (this.register # register) DO
  13759. this := this.next;
  13760. END;
  13761. IF this = NIL THEN
  13762. RETURN FALSE
  13763. END;
  13764. ASSERT(this # NIL);
  13765. IF this = queue THEN queue := queue.next END;
  13766. IF this.prev # NIL THEN this.prev.next := this.next END;
  13767. IF this.next # NIL THEN this.next.prev := this.prev END;
  13768. RETURN TRUE
  13769. END RemoveRegisterEntry;
  13770. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  13771. BEGIN ASSERT(cond);
  13772. END Assert;
  13773. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  13774. BEGIN
  13775. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  13776. END ReusableRegister;
  13777. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  13778. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  13779. BEGIN
  13780. procedure := moduleScope.bodyProcedure;
  13781. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  13782. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  13783. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  13784. procedure.SetScope(moduleScope);
  13785. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  13786. procedure.SetAccess(SyntaxTree.Hidden);
  13787. moduleScope.SetBodyProcedure(procedure);
  13788. moduleScope.AddProcedure(procedure);
  13789. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  13790. END;
  13791. END EnsureBodyProcedure;
  13792. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  13793. VAR import: SyntaxTree.Import;
  13794. selfName: SyntaxTree.IdentifierString;
  13795. module: SyntaxTree.Module;
  13796. BEGIN
  13797. scope.ownerModule.GetName(selfName);
  13798. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  13799. module := scope.ownerModule
  13800. ELSE
  13801. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  13802. IF import = NIL THEN
  13803. RETURN NIL
  13804. ELSIF import.module = NIL THEN
  13805. RETURN NIL
  13806. ELSE module := import.module
  13807. END;
  13808. END;
  13809. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  13810. END GetSymbol;
  13811. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  13812. BEGIN
  13813. op.mode := mode;
  13814. IntermediateCode.InitOperand(op.op);
  13815. IntermediateCode.InitOperand(op.tag);
  13816. IntermediateCode.InitOperand(op.extra);
  13817. op.dimOffset := 0;
  13818. op.availability := -1;
  13819. END InitOperand;
  13820. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  13821. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  13822. BEGIN RETURN IntermediateCode.GetType(system, type)
  13823. END GetType;
  13824. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  13825. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  13826. BEGIN
  13827. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13828. (*
  13829. UniqueId(name,module,name,adr);
  13830. *)
  13831. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13832. constant.SetValue(value);
  13833. constant.SetAccess(SyntaxTree.Hidden);
  13834. module.moduleScope.AddConstant(constant);
  13835. constant.SetScope(module.moduleScope);
  13836. RETURN constant
  13837. END BuildConstant;
  13838. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13839. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13840. BEGIN
  13841. variable := scope.firstVariable;
  13842. WHILE variable # NIL DO
  13843. IF variable.NeedsTrace() THEN
  13844. RETURN TRUE;
  13845. END;
  13846. variable := variable.nextVariable;
  13847. END;
  13848. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13849. WHILE parameter # NIL DO
  13850. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13851. RETURN TRUE;
  13852. END;
  13853. parameter := parameter.nextParameter;
  13854. END;
  13855. RETURN FALSE;
  13856. END HasPointers;
  13857. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13858. 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));
  13859. END IsVariableParameter;
  13860. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13861. VAR parameter: SyntaxTree.Parameter;
  13862. BEGIN
  13863. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13864. WHILE parameter # NIL DO
  13865. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13866. IF parameter.movable THEN RETURN TRUE END;
  13867. parameter := parameter.nextParameter;
  13868. END;
  13869. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13870. END HasVariableParameters;
  13871. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13872. BEGIN
  13873. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13874. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13875. END HasExplicitTraceMethod;
  13876. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13877. BEGIN
  13878. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13879. IF (expression IS SyntaxTree.IntegerValue) THEN
  13880. val := expression(SyntaxTree.IntegerValue).value;
  13881. RETURN TRUE
  13882. ELSE
  13883. RETURN FALSE
  13884. END;
  13885. END IsIntegerConstant;
  13886. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13887. BEGIN
  13888. IF val <= 0 THEN RETURN FALSE END;
  13889. exp := 0;
  13890. WHILE ~ODD(val) DO
  13891. val := val DIV 2;
  13892. INC(exp)
  13893. END;
  13894. RETURN val = 1
  13895. END PowerOf2;
  13896. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13897. VAR procedure: SyntaxTree.Procedure;
  13898. BEGIN
  13899. procedure := record.recordScope.constructor;
  13900. IF procedure = NIL THEN
  13901. record := record.GetBaseRecord();
  13902. IF record # NIL THEN
  13903. procedure := GetConstructor(record)
  13904. END;
  13905. END;
  13906. RETURN procedure;
  13907. END GetConstructor;
  13908. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13909. BEGIN
  13910. value := SHORT(op.intValue);
  13911. RETURN op.mode = IntermediateCode.ModeImmediate;
  13912. END IsIntegerImmediate;
  13913. (** whether a type strictily is a pointer to record or object type
  13914. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13915. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13916. BEGIN
  13917. IF type = NIL THEN
  13918. RETURN FALSE
  13919. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13920. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13921. ELSE
  13922. RETURN FALSE
  13923. END
  13924. END IsStrictlyPointerToRecord;
  13925. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13926. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13927. END IsUnsafePointer;
  13928. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13929. BEGIN type := type.resolved;
  13930. IF type IS SyntaxTree.PointerType THEN
  13931. type := type(SyntaxTree.PointerType).pointerBase;
  13932. type := type.resolved;
  13933. IF type IS SyntaxTree.RecordType THEN
  13934. recordType := type(SyntaxTree.RecordType);
  13935. RETURN TRUE
  13936. ELSE
  13937. RETURN FALSE
  13938. END
  13939. ELSIF type IS SyntaxTree.RecordType THEN
  13940. recordType := type(SyntaxTree.RecordType);
  13941. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13942. ELSIF type IS SyntaxTree.ObjectType THEN
  13943. RETURN TRUE
  13944. ELSIF type IS SyntaxTree.AnyType THEN
  13945. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13946. ELSE
  13947. RETURN FALSE
  13948. END;
  13949. END IsPointerToRecord;
  13950. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13951. BEGIN
  13952. type := type.resolved;
  13953. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13954. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13955. END IsArrayOfSystemByte;
  13956. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13957. BEGIN
  13958. IF type = NIL THEN RETURN FALSE END;
  13959. type := type.resolved;
  13960. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13961. END IsOpenArray;
  13962. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13963. BEGIN
  13964. IF type = NIL THEN RETURN FALSE END;
  13965. type := type.resolved;
  13966. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13967. END IsSemiDynamicArray;
  13968. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13969. BEGIN
  13970. IF type = NIL THEN RETURN FALSE END;
  13971. type := type.resolved;
  13972. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13973. END IsStaticArray;
  13974. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13975. BEGIN
  13976. IF type = NIL THEN RETURN FALSE END;
  13977. type := type.resolved;
  13978. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13979. END IsStaticMathArray;
  13980. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13981. BEGIN
  13982. WHILE (IsStaticMathArray(type)) DO
  13983. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13984. END;
  13985. RETURN type;
  13986. END StaticMathArrayBaseType;
  13987. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13988. VAR size: LONGINT;
  13989. BEGIN
  13990. size := 1;
  13991. WHILE (IsStaticArray(type)) DO
  13992. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13993. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13994. END;
  13995. RETURN size;
  13996. END StaticArrayNumElements;
  13997. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13998. VAR size: LONGINT;
  13999. BEGIN
  14000. size := 1;
  14001. WHILE (IsStaticMathArray(type)) DO
  14002. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  14003. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14004. END;
  14005. RETURN size;
  14006. END StaticMathArrayNumElements;
  14007. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14008. BEGIN
  14009. WHILE (IsStaticArray(type)) DO
  14010. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14011. END;
  14012. RETURN type;
  14013. END StaticArrayBaseType;
  14014. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14015. BEGIN
  14016. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  14017. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14018. END;
  14019. RETURN type;
  14020. END ArrayBaseType;
  14021. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  14022. BEGIN
  14023. IF type = NIL THEN RETURN FALSE END;
  14024. type := type.resolved;
  14025. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  14026. END IsDelegate;
  14027. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  14028. VAR i: LONGINT;
  14029. BEGIN
  14030. i := 0; type := type.resolved;
  14031. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14032. INC(i);
  14033. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  14034. END;
  14035. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14036. INC(i);
  14037. type := type(SyntaxTree.MathArrayType).arrayBase;
  14038. IF type # NIL THEN type := type.resolved END;
  14039. END;
  14040. RETURN i
  14041. END DynamicDim;
  14042. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  14043. BEGIN
  14044. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14045. type := type(SyntaxTree.ArrayType).arrayBase;
  14046. END;
  14047. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14048. type := type(SyntaxTree.MathArrayType).arrayBase;
  14049. END;
  14050. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  14051. END StaticSize;
  14052. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  14053. BEGIN
  14054. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  14055. END IsImmediate;
  14056. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  14057. BEGIN
  14058. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  14059. END IsAddress;
  14060. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  14061. BEGIN
  14062. RETURN (x.mode = IntermediateCode.ModeRegister);
  14063. END IsRegister;
  14064. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  14065. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  14066. BEGIN
  14067. typeDeclaration := recordType.typeDeclaration;
  14068. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  14069. Global.GetSymbolSegmentedName(typeDeclaration,name);
  14070. END GetRecordTypeName;
  14071. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  14072. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  14073. BEGIN
  14074. parSize := 0;
  14075. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  14076. parameter := procedureType.returnParameter;
  14077. INC(parSize,system.SizeOfParameter(parameter));
  14078. parSize := parSize + (-parSize) MOD system.addressSize;
  14079. END;
  14080. parameter :=procedureType.lastParameter;
  14081. WHILE (parameter # NIL) DO
  14082. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  14083. INC(parSize, system.addressSize);
  14084. ELSE
  14085. INC(parSize,system.SizeOfParameter(parameter));
  14086. parSize := parSize + (-parSize) MOD system.addressSize;
  14087. END;
  14088. parameter := parameter.prevParameter;
  14089. END;
  14090. IF procedureType.selfParameter # NIL THEN
  14091. parameter := procedureType.selfParameter;
  14092. INC(parSize,system.SizeOfParameter(parameter));
  14093. parSize := parSize + (-parSize) MOD system.addressSize;
  14094. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  14095. END; (* method => self pointer *)
  14096. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  14097. RETURN ToMemoryUnits(system,parSize)
  14098. END ParametersSize;
  14099. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  14100. BEGIN
  14101. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  14102. END IsNested;
  14103. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  14104. BEGIN
  14105. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  14106. scope := scope.outerScope;
  14107. END;
  14108. RETURN scope # NIL;
  14109. END InCellScope;
  14110. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  14111. BEGIN
  14112. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  14113. END ProcedureParametersSize;
  14114. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  14115. VAR dataUnit: LONGINT;
  14116. BEGIN dataUnit := system.dataUnit;
  14117. ASSERT(size MOD system.dataUnit = 0);
  14118. RETURN LONGINT(size DIV system.dataUnit)
  14119. END ToMemoryUnits;
  14120. PROCEDURE Get*(): Backend.Backend;
  14121. VAR backend: IntermediateBackend;
  14122. BEGIN NEW(backend); RETURN backend
  14123. END Get;
  14124. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  14125. VAR instruction: IntermediateCode.Instruction;
  14126. BEGIN
  14127. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  14128. RETURN instruction
  14129. END Nop;
  14130. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14131. VAR instruction: IntermediateCode.Instruction;
  14132. BEGIN
  14133. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  14134. RETURN instruction
  14135. END Mov;
  14136. (* like Mov but ensures that no new register will be allocated for dest *)
  14137. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14138. VAR instruction: IntermediateCode.Instruction;
  14139. BEGIN
  14140. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  14141. RETURN instruction
  14142. END MovReplace;
  14143. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14144. VAR instruction: IntermediateCode.Instruction;
  14145. BEGIN
  14146. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  14147. RETURN instruction
  14148. END Conv;
  14149. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  14150. VAR instruction: IntermediateCode.Instruction;
  14151. BEGIN
  14152. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  14153. RETURN instruction
  14154. END Call;
  14155. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  14156. VAR op1, op2, op3: IntermediateCode.Operand;
  14157. VAR instruction: IntermediateCode.Instruction;
  14158. BEGIN
  14159. IntermediateCode.InitNumber(op1,pcOffset);
  14160. IntermediateCode.InitNumber(op2,callingConvention);
  14161. IntermediateCode.InitNumber(op3,unwind);
  14162. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  14163. RETURN instruction
  14164. END Exit;
  14165. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14166. VAR instruction: IntermediateCode.Instruction;
  14167. BEGIN
  14168. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  14169. RETURN instruction
  14170. END Return;
  14171. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14172. VAR instruction: IntermediateCode.Instruction;
  14173. BEGIN
  14174. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  14175. RETURN instruction
  14176. END Result;
  14177. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  14178. VAR op1: IntermediateCode.Operand;
  14179. VAR instruction: IntermediateCode.Instruction;
  14180. BEGIN
  14181. IntermediateCode.InitNumber(op1,nr);
  14182. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  14183. RETURN instruction
  14184. END Trap;
  14185. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  14186. VAR instruction: IntermediateCode.Instruction;
  14187. BEGIN
  14188. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  14189. RETURN instruction
  14190. END Br;
  14191. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14192. VAR instruction: IntermediateCode.Instruction;
  14193. BEGIN
  14194. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  14195. RETURN instruction
  14196. END Breq;
  14197. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14198. VAR instruction: IntermediateCode.Instruction;
  14199. BEGIN
  14200. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  14201. RETURN instruction
  14202. END Brne;
  14203. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14204. VAR instruction: IntermediateCode.Instruction;
  14205. BEGIN
  14206. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  14207. RETURN instruction
  14208. END Brge;
  14209. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14210. VAR instruction: IntermediateCode.Instruction;
  14211. BEGIN
  14212. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  14213. RETURN instruction
  14214. END Brlt;
  14215. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  14216. VAR instruction: IntermediateCode.Instruction;
  14217. BEGIN
  14218. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  14219. RETURN instruction
  14220. END Pop;
  14221. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14222. VAR instruction: IntermediateCode.Instruction;
  14223. BEGIN
  14224. ASSERT(op.mode # IntermediateCode.Undefined);
  14225. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  14226. RETURN instruction
  14227. END Push;
  14228. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14229. VAR instruction: IntermediateCode.Instruction;
  14230. BEGIN
  14231. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  14232. RETURN instruction
  14233. END Neg;
  14234. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14235. VAR instruction: IntermediateCode.Instruction;
  14236. BEGIN
  14237. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  14238. RETURN instruction
  14239. END Not;
  14240. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14241. VAR instruction: IntermediateCode.Instruction;
  14242. BEGIN
  14243. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  14244. RETURN instruction
  14245. END Abs;
  14246. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14247. VAR instruction: IntermediateCode.Instruction;
  14248. BEGIN
  14249. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  14250. ASSERT(~IsImmediate(instruction.op1));
  14251. RETURN instruction
  14252. END Mul;
  14253. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14254. VAR instruction: IntermediateCode.Instruction;
  14255. BEGIN
  14256. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  14257. RETURN instruction
  14258. END Div;
  14259. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14260. VAR instruction: IntermediateCode.Instruction;
  14261. BEGIN
  14262. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  14263. RETURN instruction
  14264. END Mod;
  14265. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14266. VAR instruction: IntermediateCode.Instruction;
  14267. BEGIN
  14268. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  14269. RETURN instruction
  14270. END Sub;
  14271. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14272. VAR instruction: IntermediateCode.Instruction;
  14273. BEGIN
  14274. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  14275. RETURN instruction
  14276. END Add;
  14277. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14278. VAR instruction: IntermediateCode.Instruction;
  14279. BEGIN
  14280. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  14281. RETURN instruction
  14282. END And;
  14283. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14284. VAR instruction: IntermediateCode.Instruction;
  14285. BEGIN
  14286. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  14287. RETURN instruction
  14288. END Or;
  14289. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14290. VAR instruction: IntermediateCode.Instruction;
  14291. BEGIN
  14292. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  14293. RETURN instruction
  14294. END Xor;
  14295. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14296. VAR instruction: IntermediateCode.Instruction;
  14297. BEGIN
  14298. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  14299. RETURN instruction
  14300. END Shl;
  14301. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14302. VAR instruction: IntermediateCode.Instruction;
  14303. BEGIN
  14304. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  14305. RETURN instruction
  14306. END Shr;
  14307. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14308. VAR instruction: IntermediateCode.Instruction;
  14309. BEGIN
  14310. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  14311. RETURN instruction
  14312. END Rol;
  14313. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14314. VAR instruction: IntermediateCode.Instruction;
  14315. BEGIN
  14316. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  14317. RETURN instruction
  14318. END Ror;
  14319. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14320. VAR instruction: IntermediateCode.Instruction;
  14321. BEGIN
  14322. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  14323. RETURN instruction
  14324. END Cas;
  14325. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14326. VAR instruction: IntermediateCode.Instruction;
  14327. BEGIN
  14328. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  14329. ASSERT(~IntermediateCode.IsVectorRegister(src));
  14330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  14331. RETURN instruction
  14332. END Copy;
  14333. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  14334. VAR instruction: IntermediateCode.Instruction;
  14335. BEGIN
  14336. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  14337. RETURN instruction
  14338. END Fill;
  14339. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  14340. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  14341. BEGIN
  14342. string := IntermediateCode.String(s);
  14343. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  14344. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  14345. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  14346. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  14347. RETURN instruction
  14348. END Asm;
  14349. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14350. VAR instruction: IntermediateCode.Instruction;
  14351. BEGIN
  14352. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  14353. RETURN instruction
  14354. END Data;
  14355. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  14356. VAR instruction: IntermediateCode.Instruction;
  14357. BEGIN
  14358. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  14359. IntermediateCode.SetSubType(instruction, subtype);
  14360. RETURN instruction
  14361. END SpecialInstruction;
  14362. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  14363. VAR op1: IntermediateCode.Operand;
  14364. VAR instruction: IntermediateCode.Instruction;
  14365. BEGIN
  14366. (*! generate a warning if size exceeds a certain limit *)
  14367. (*
  14368. ASSERT(bytes < 1000000); (* sanity check *)
  14369. *)
  14370. ASSERT(0 <= units); (* sanity check *)
  14371. IntermediateCode.InitNumber(op1,units);
  14372. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  14373. RETURN instruction
  14374. END Reserve;
  14375. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  14376. VAR op1: IntermediateCode.Operand;
  14377. VAR instruction: IntermediateCode.Instruction;
  14378. BEGIN
  14379. IntermediateCode.InitNumber(op1,position.start);
  14380. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  14381. RETURN instruction
  14382. END LabelInstruction;
  14383. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  14384. VAR pc: LONGINT;
  14385. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  14386. BEGIN
  14387. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  14388. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  14389. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  14390. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  14391. IF instr.op1.type.form = IntermediateCode.Float THEN
  14392. RETURN instr.op1.floatValue = op.floatValue
  14393. ELSE
  14394. RETURN instr.op1.intValue = op.intValue
  14395. END;
  14396. END ProvidesValue;
  14397. BEGIN
  14398. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  14399. pc := 0;
  14400. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  14401. INC(pc);
  14402. END;
  14403. IF pc = data.pc THEN
  14404. data.Emit(Data(Basic.invalidPosition,vop));
  14405. END;
  14406. RETURN pc
  14407. END EnterImmediate;
  14408. PROCEDURE Init;
  14409. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  14410. BEGIN
  14411. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  14412. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  14413. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  14414. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  14415. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  14416. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  14417. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  14418. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  14419. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  14420. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  14421. IntermediateCode.InitOperand(emptyOperand);
  14422. FOR i := 0 TO NumberSystemCalls-1 DO
  14423. name := "@SystemCall";
  14424. Basic.AppendNumber(name,i);
  14425. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  14426. END;
  14427. END Init;
  14428. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  14429. BEGIN
  14430. RETURN (symbol # NIL) & symbol.NeedsSection();
  14431. END IsExported;
  14432. BEGIN
  14433. Init;
  14434. END FoxIntermediateBackend.
  14435. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  14436. # Release.Build --path="/temp/obg/" Win32 ~
  14437. # 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 ~
  14438. FStols.CloseFiles A2Z.exe ~
  14439. System.FreeDownTo FoxIntermediateBackend ~
  14440. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  14441. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  14442. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  14443. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  14444. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  14445. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  14446. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  14447. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  14448. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  14449. GenericLinker.Mod Loader.Mod BootConsole.Mod