FoxIntermediateBackend.Mod 613 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807148081480914810148111481214813148141481514816148171481814819148201482114822148231482414825148261482714828148291483014831148321483314834148351483614837148381483914840148411484214843148441484514846148471484814849148501485114852148531485414855148561485714858148591486014861148621486314864148651486614867148681486914870148711487214873148741487514876148771487814879148801488114882148831488414885148861488714888148891489014891148921489314894148951489614897148981489914900149011490214903149041490514906149071490814909149101491114912149131491414915149161491714918149191492014921149221492314924149251492614927149281492914930149311493214933149341493514936149371493814939149401494114942149431494414945149461494714948149491495014951149521495314954149551495614957149581495914960149611496214963149641496514966149671496814969149701497114972149731497414975149761497714978149791498014981149821498314984149851498614987149881498914990149911499214993149941499514996149971499814999150001500115002150031500415005150061500715008150091501015011150121501315014150151501615017150181501915020150211502215023150241502515026150271502815029150301503115032150331503415035150361503715038150391504015041150421504315044150451504615047150481504915050150511505215053150541505515056150571505815059150601506115062150631506415065150661506715068150691507015071150721507315074150751507615077150781507915080150811508215083150841508515086150871508815089150901509115092150931509415095150961509715098150991510015101151021510315104151051510615107151081510915110151111511215113151141511515116151171511815119151201512115122151231512415125151261512715128151291513015131151321513315134151351513615137151381513915140151411514215143151441514515146151471514815149151501515115152151531515415155151561515715158151591516015161151621516315164151651516615167151681516915170151711517215173151741517515176151771517815179151801518115182151831518415185151861518715188151891519015191151921519315194151951519615197151981519915200152011520215203152041520515206152071520815209152101521115212152131521415215152161521715218152191522015221152221522315224152251522615227152281522915230152311523215233152341523515236152371523815239152401524115242152431524415245152461524715248152491525015251152521525315254152551525615257152581525915260152611526215263152641526515266152671526815269152701527115272152731527415275152761527715278152791528015281152821528315284152851528615287152881528915290152911529215293152941529515296152971529815299153001530115302153031530415305153061530715308153091531015311153121531315314153151531615317153181531915320153211532215323153241532515326153271532815329153301533115332153331533415335153361533715338153391534015341153421534315344153451534615347153481534915350153511535215353153541535515356153571535815359153601536115362153631536415365153661536715368153691537015371153721537315374153751537615377153781537915380153811538215383153841538515386153871538815389153901539115392153931539415395153961539715398153991540015401154021540315404154051540615407154081540915410154111541215413154141541515416154171541815419154201542115422154231542415425154261542715428154291543015431154321543315434154351543615437154381543915440154411544215443154441544515446154471544815449154501545115452154531545415455154561545715458154591546015461154621546315464154651546615467154681546915470154711547215473154741547515476154771547815479154801548115482154831548415485154861548715488154891549015491154921549315494154951549615497154981549915500155011550215503155041550515506155071550815509155101551115512155131551415515155161551715518155191552015521155221552315524155251552615527155281552915530155311553215533155341553515536155371553815539155401554115542155431554415545155461554715548155491555015551155521555315554155551555615557155581555915560155611556215563155641556515566155671556815569155701557115572155731557415575155761557715578155791558015581155821558315584155851558615587155881558915590155911559215593155941559515596155971559815599156001560115602156031560415605156061560715608156091561015611156121561315614156151561615617156181561915620156211562215623156241562515626156271562815629156301563115632156331563415635156361563715638156391564015641156421564315644156451564615647156481564915650156511565215653156541565515656156571565815659156601566115662156631566415665156661566715668156691567015671156721567315674156751567615677156781567915680156811568215683156841568515686156871568815689156901569115692156931569415695156961569715698156991570015701157021570315704157051570615707157081570915710157111571215713157141571515716157171571815719157201572115722157231572415725157261572715728
  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. (*
  677. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  678. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  679. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  680. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  681. ir.EmitAt(pc,Push(size));
  682. implementationVisitor.StaticCallOperand(result,procedure);
  683. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  684. END;
  685. *)
  686. END;
  687. *)
  688. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  689. IF stackSize > 0 THEN
  690. IF (stackSize MOD system.addressSize = 0) THEN
  691. null := IntermediateCode.Immediate(addressType,0);
  692. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  693. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  694. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  695. ELSE
  696. null := IntermediateCode.Immediate(int8,0);
  697. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  698. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  699. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  700. END;
  701. (*! should potentially be called by backend -- enter might initialize
  702. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  703. *)
  704. END;
  705. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  706. parametersSize := ProcedureParametersSize(backend.system,x);
  707. ELSE
  708. parametersSize := 0;
  709. END;
  710. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  711. finalizer := FALSE;
  712. IF backend.cooperative & x.isFinalizer THEN
  713. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  714. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  715. GetRecordTypeName(recordType,name);
  716. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  717. END;
  718. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  719. IF backend.cooperative THEN
  720. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  721. IF implementationVisitor.profile & ~isModuleBody THEN
  722. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  723. END;
  724. ELSE
  725. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  726. END;
  727. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  728. IF finalizer THEN
  729. IF backend.hasLinkRegister THEN
  730. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  731. END;
  732. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  733. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  734. ir.Emit(Br(x.position,dest));
  735. ELSE
  736. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  737. END;
  738. ELSE
  739. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  740. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  741. END;
  742. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  743. IF backend.cooperative THEN
  744. IF HasPointers (scope) THEN
  745. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  746. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  747. ir.Emit(Result(x.position, res));
  748. ir.Emit(Push(x.position, res));
  749. implementationVisitor.ResetVariables(scope);
  750. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  751. ir.Emit(Pop(x.position, res));
  752. ir.Emit(Return(x.position, res));
  753. ELSE
  754. implementationVisitor.ResetVariables(scope);
  755. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  756. END;
  757. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  758. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  759. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  760. ir.Emit(Result(x.position, res));
  761. ir.Emit(Push(x.position, res));
  762. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  763. ir.Emit(Pop(x.position, res));
  764. ir.Emit(Return(x.position, res));
  765. ELSE
  766. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  767. END;
  768. END;
  769. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  770. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  771. ELSE
  772. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  773. ir.Emit(Nop(x.position));
  774. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  775. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  776. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  777. END;
  778. END;
  779. END
  780. ELSIF ~inline THEN
  781. ir.Emit(Nop(x.position)); (* jump label *)
  782. END;
  783. ELSE (* force body for procedures *)
  784. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  785. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  786. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  787. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  788. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  789. END;
  790. Scope(scope);
  791. Signature;
  792. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  793. currentScope := prevScope;
  794. END Procedure;
  795. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  796. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  797. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  798. BEGIN
  799. ASSERT (bodyProcedure # NIL);
  800. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  801. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  802. procedure.SetScope(bodyProcedure.scope);
  803. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  804. procedure.SetAccess(SyntaxTree.Hidden);
  805. Global.GetSymbolSegmentedName (procedure,name);
  806. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  807. ir.SetExported(TRUE);
  808. Global.GetSymbolSegmentedName (bodyProcedure,name);
  809. IF ~meta.simple THEN
  810. implementationVisitor.currentScope := module.module.moduleScope;
  811. implementationVisitor.section := ir;
  812. implementationVisitor.PushSelfPointer();
  813. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  814. ELSIF backend.preregisterStatic THEN
  815. implementationVisitor.currentScope := module.module.moduleScope;
  816. implementationVisitor.section := ir;
  817. implementationVisitor.PushSelfPointer();
  818. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  819. ELSE
  820. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  821. ir.Emit(Call(bodyProcedure.position,op, 0));
  822. END;
  823. END AddBodyCallStub;
  824. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  825. VAR name: Basic.SegmentedName;
  826. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  827. BEGIN
  828. Global.GetSymbolSegmentedName (symbol,name);
  829. Basic.RemoveSuffix(name);
  830. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  831. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  832. ir.SetExported(TRUE);
  833. IntermediateCode.InitImmediate(op,addressType,initStack);
  834. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  835. END AddStackAllocation;
  836. (** entry function to visit a complete module *)
  837. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  838. VAR
  839. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  840. hasDynamicOperatorDeclarations: BOOLEAN;
  841. operator: SyntaxTree.Operator;
  842. import: SyntaxTree.Import;
  843. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  844. BEGIN
  845. type := type.resolved;
  846. IF type IS SyntaxTree.RecordType THEN
  847. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  848. ELSIF (type IS SyntaxTree.ArrayType) THEN
  849. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  850. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  851. END;
  852. ELSIF type IS SyntaxTree.MathArrayType THEN
  853. WITH type: SyntaxTree.MathArrayType DO
  854. IF type.form = SyntaxTree.Open THEN
  855. RETURN TRUE
  856. ELSIF type.form = SyntaxTree.Static THEN
  857. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  858. END;
  859. END;
  860. END;
  861. RETURN FALSE
  862. END TypeNeedsInitialization;
  863. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  864. VAR variable: SyntaxTree.Variable;
  865. BEGIN
  866. variable := scope.firstVariable;
  867. WHILE variable # NIL DO
  868. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  869. IF variable.initializer # NIL THEN RETURN TRUE END;
  870. variable := variable.nextVariable;
  871. END;
  872. RETURN FALSE
  873. END ScopeNeedsInitialization;
  874. BEGIN
  875. ASSERT(x # NIL); ASSERT(module # NIL);
  876. SELF.module := module;
  877. (* add import names to the generated Sections.Module *)
  878. import := x.moduleScope.firstImport;
  879. WHILE import # NIL DO
  880. import.module.GetName(idstr);
  881. module.imports.AddName(idstr);
  882. import := import.nextImport
  883. END;
  884. implementationVisitor.module := module;
  885. implementationVisitor.moduleScope := x.moduleScope;
  886. implementationVisitor.moduleSelf := moduleSelf;
  887. implementationVisitor.canBeLoaded := TRUE;
  888. meta.SetModule(module);
  889. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  890. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  891. END;
  892. IF backend.profile THEN
  893. EnsureBodyProcedure(x.moduleScope);
  894. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  895. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  896. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  897. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  898. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  899. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  900. Global.GetModuleName(module.module,idstr);
  901. implementationVisitor.ProfilerAddModule(idstr);
  902. implementationVisitor.numberProcedures := 0;
  903. END;
  904. implementationVisitor.profile := backend.profile;
  905. (* check if there is at least one dynamic operator locally defined *)
  906. hasDynamicOperatorDeclarations := FALSE;
  907. operator := x.moduleScope.firstOperator;
  908. WHILE operator # NIL DO
  909. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  910. operator := operator.nextOperator
  911. END;
  912. (* add operator initialization code section *)
  913. IF hasDynamicOperatorDeclarations THEN
  914. EnsureBodyProcedure(x.moduleScope);
  915. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  916. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  917. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  918. END;
  919. Scope(x.moduleScope);
  920. IF hasDynamicOperatorDeclarations THEN
  921. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  922. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  923. END;
  924. IF backend.profile THEN
  925. implementationVisitor.ProfilerPatchInit;
  926. END;
  927. END Module;
  928. END DeclarationVisitor;
  929. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  930. RegisterUsageCount*=OBJECT
  931. VAR used: UsedArray; count: LONGINT;
  932. PROCEDURE &Init;
  933. VAR i: LONGINT;
  934. BEGIN
  935. count := 0;
  936. IF used = NIL THEN NEW(used,64); END;
  937. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  938. END Init;
  939. PROCEDURE Grow;
  940. VAR new: UsedArray; size,i: LONGINT;
  941. BEGIN
  942. size := LEN(used)*2;
  943. NEW(new,size);
  944. FOR i := 0 TO LEN(used)-1 DO
  945. new[i].count := used[i].count;
  946. new[i].type := used[i].type;
  947. new[i].map := used[i].map
  948. END;
  949. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  950. used := new
  951. END Grow;
  952. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  953. BEGIN
  954. INC(count);
  955. IF count = LEN(used) THEN Grow END;
  956. used[count].type := type;
  957. used[count].class := class;
  958. used[count].map := count;
  959. RETURN count;
  960. END Next;
  961. PROCEDURE IncUse(register: LONGINT);
  962. BEGIN
  963. INC(used[register].count);
  964. (*
  965. IF (register = 1) & (count > 30) THEN
  966. D.TraceBack;
  967. END;
  968. *)
  969. END IncUse;
  970. PROCEDURE DecUse(register: LONGINT);
  971. BEGIN
  972. DEC(used[register].count);
  973. END DecUse;
  974. PROCEDURE Map(register: LONGINT): LONGINT;
  975. VAR map : LONGINT;
  976. BEGIN
  977. IF register > 0 THEN
  978. map := used[register].map;
  979. WHILE register # map DO register := map; map := used[register].map END;
  980. END;
  981. RETURN register
  982. END Map;
  983. PROCEDURE Use(register: LONGINT): LONGINT;
  984. BEGIN
  985. IF register< LEN(used) THEN
  986. RETURN used[register].count
  987. ELSE
  988. RETURN 0
  989. END
  990. END Use;
  991. END RegisterUsageCount;
  992. RegisterEntry = POINTER TO RECORD
  993. prev,next: RegisterEntry;
  994. register: LONGINT;
  995. registerClass: IntermediateCode.RegisterClass;
  996. type: IntermediateCode.Type;
  997. END;
  998. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  999. Variables = OBJECT (Basic.List)
  1000. VAR
  1001. inUse: VariableUse;
  1002. registerIndex: LONGINT;
  1003. nameIndex: LONGINT;
  1004. PROCEDURE & Init;
  1005. VAR i: LONGINT;
  1006. BEGIN
  1007. InitList(16);
  1008. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1009. registerIndex := 1024;
  1010. nameIndex := 0;
  1011. END Init;
  1012. PROCEDURE Clear*;
  1013. VAR i: LONGINT;
  1014. BEGIN
  1015. Clear^;
  1016. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1017. registerIndex := 1024;
  1018. nameIndex := 0;
  1019. END Clear;
  1020. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1021. VAR string: SyntaxTree.IdentifierString ;
  1022. BEGIN
  1023. COPY("@hiddenIRVar",string);
  1024. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1025. RETURN SyntaxTree.NewIdentifier(string);
  1026. END GetUID;
  1027. PROCEDURE GetUsage(VAR use: VariableUse);
  1028. BEGIN
  1029. use := inUse;
  1030. END GetUsage;
  1031. PROCEDURE SetUsage(CONST use: VariableUse);
  1032. BEGIN
  1033. inUse := use;
  1034. END SetUsage;
  1035. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1036. VAR any: ANY;
  1037. BEGIN
  1038. any := Get(i);
  1039. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1040. END GetVariable;
  1041. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1042. BEGIN
  1043. Set(pos, v);
  1044. END SetVariable;
  1045. PROCEDURE Occupy(pos: LONGINT);
  1046. BEGIN
  1047. INCL(inUse[pos DIV 32], pos MOD 32);
  1048. END Occupy;
  1049. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1050. BEGIN
  1051. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1052. END Occupied;
  1053. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1054. BEGIN
  1055. Occupy(Length());
  1056. Add(v);
  1057. END AddVariable;
  1058. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1059. BEGIN
  1060. t1 := t1.resolved;
  1061. t2 := t2.resolved;
  1062. (*RETURN t1.SameType(t2); *)
  1063. RETURN
  1064. (t1.SameType(t2))
  1065. OR
  1066. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1067. OR
  1068. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1069. OR
  1070. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1071. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1072. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1073. OR
  1074. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1075. (DynamicDim(t1) = DynamicDim(t2))
  1076. );
  1077. END CompatibleType;
  1078. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1079. VAR var : SyntaxTree.Variable; i: LONGINT;
  1080. BEGIN
  1081. pos := Length();
  1082. FOR i := 0 TO pos-1 DO
  1083. IF ~(Occupied(i)) THEN
  1084. var := GetVariable(i);
  1085. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1086. pos := i;
  1087. Occupy(i);
  1088. RETURN var;
  1089. END;
  1090. END;
  1091. END;
  1092. RETURN NIL
  1093. END GetFreeVariable;
  1094. END Variables;
  1095. SymbolMap = POINTER TO RECORD
  1096. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1097. isAddress: BOOLEAN;
  1098. END;
  1099. SymbolMapper = OBJECT
  1100. VAR
  1101. first: SymbolMap;
  1102. PROCEDURE & Init;
  1103. BEGIN
  1104. first := NIL;
  1105. END Init;
  1106. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1107. VAR new: SymbolMap;
  1108. BEGIN
  1109. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1110. new.next := first; first := new;
  1111. END Add;
  1112. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1113. VAR s: SymbolMap;
  1114. BEGIN
  1115. s := first;
  1116. WHILE (s # NIL) & (s.this # this) DO
  1117. s := s.next
  1118. END;
  1119. RETURN s
  1120. END Get;
  1121. END SymbolMapper;
  1122. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1123. VAR
  1124. system: Global.System;
  1125. section: IntermediateCode.Section;
  1126. module: Sections.Module;
  1127. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1128. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1129. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1130. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1131. checker: SemanticChecker.Checker;
  1132. backend: IntermediateBackend;
  1133. meta: MetaDataGenerator;
  1134. position: Position;
  1135. moduleSelf: SyntaxTree.Variable;
  1136. (* variables for hand over of variables / temporary state *)
  1137. currentScope: SyntaxTree.Scope;
  1138. constantDeclaration : SyntaxTree.Symbol;
  1139. result: Operand; (* result of the most recent expression / statement *)
  1140. destination: IntermediateCode.Operand;
  1141. arrayDestinationTag: IntermediateCode.Operand;
  1142. arrayDestinationDimension:LONGINT;
  1143. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1144. exitLabel: Label;
  1145. locked: BOOLEAN;
  1146. (*
  1147. usedRegisters: Registers;
  1148. *)
  1149. registerUsageCount: RegisterUsageCount;
  1150. usedRegisters: RegisterEntry;
  1151. (* useful operands and types *)
  1152. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1153. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1154. commentPrintout: Printout.Printer;
  1155. dump: Streams.Writer;
  1156. tagsAvailable : BOOLEAN;
  1157. supportedInstruction: SupportedInstructionProcedure;
  1158. supportedImmediate: SupportedImmediateProcedure;
  1159. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1160. emitLabels: BOOLEAN;
  1161. builtinsModuleName : SyntaxTree.IdentifierString;
  1162. indexCounter: LONGINT;
  1163. profile: BOOLEAN;
  1164. profileId, profileInit: IntermediateCode.Section;
  1165. profileInitPatchPosition: LONGINT;
  1166. numberProcedures: LONGINT;
  1167. procedureResultDesignator : SyntaxTree.Designator;
  1168. operatorInitializationCodeSection: IntermediateCode.Section;
  1169. fingerprinter: Fingerprinter.Fingerprinter;
  1170. temporaries: Variables;
  1171. canBeLoaded : BOOLEAN;
  1172. currentIsInline: BOOLEAN;
  1173. currentMapper: SymbolMapper;
  1174. currentInlineExit: Label;
  1175. moduleBodySection: IntermediateCode.Section;
  1176. NeedDescriptor : BOOLEAN;
  1177. cooperativeSwitches: BOOLEAN;
  1178. lastSwitchPC: LONGINT;
  1179. isUnchecked: BOOLEAN;
  1180. (* EXPERIMENTAL *)
  1181. availableSymbols: ARRAY 1024 OF
  1182. RECORD
  1183. symbol: SyntaxTree.Symbol;
  1184. inMemory, inRegister: BOOLEAN;
  1185. register: IntermediateCode.Operand;
  1186. memory: IntermediateCode.Operand;
  1187. END;
  1188. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1189. BEGIN
  1190. SELF.system := system;
  1191. SELF.builtinsModuleName := runtime;
  1192. currentScope := NIL;
  1193. hiddenPointerType := NIL;
  1194. delegatePointerType := NIL;
  1195. awaitProcCounter := 0;
  1196. labelId := 0; constId := 0; labelId := 0;
  1197. SELF.checker := checker;
  1198. SELF.backend := backend;
  1199. position := Basic.invalidPosition;
  1200. locked := FALSE;
  1201. InitOperand(result,ModeUndefined);
  1202. addressType := IntermediateCode.GetType(system,system.addressType);
  1203. setType := IntermediateCode.GetType(system,system.setType);
  1204. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1205. lenType := IntermediateCode.GetType(system, system.lenType);
  1206. byteType := IntermediateCode.GetType(system, system.byteType);
  1207. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1208. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1209. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1210. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1211. nil := IntermediateCode.Immediate(addressType,0);
  1212. one := IntermediateCode.Immediate(addressType,1);
  1213. IntermediateCode.InitOperand(destination);
  1214. tagsAvailable := TRUE;
  1215. supportedInstruction := supportedInstructionProcedure;
  1216. supportedImmediate := supportedImmediateProcedure;
  1217. inData := FALSE;
  1218. SELF.emitLabels := emitLabels;
  1219. IntermediateCode.InitOperand(arrayDestinationTag);
  1220. bool := IntermediateCode.GetType(system,system.booleanType);
  1221. IntermediateCode.InitImmediate(false,bool,0);
  1222. IntermediateCode.InitImmediate(true,bool,1);
  1223. indexCounter := 0;
  1224. NEW(registerUsageCount);
  1225. usedRegisters := NIL;
  1226. procedureResultDesignator := NIL;
  1227. NEW(fingerprinter);
  1228. NEW(temporaries);
  1229. currentIsInline := FALSE;
  1230. NeedDescriptor := FALSE;
  1231. isUnchecked := backend.noRuntimeChecks;
  1232. END Init;
  1233. TYPE Context = RECORD
  1234. section: IntermediateCode.Section;
  1235. registerUsageCount: RegisterUsageCount;
  1236. usedRegisters: RegisterEntry;
  1237. temporaries: Variables;
  1238. END;
  1239. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1240. VAR context: Context;
  1241. BEGIN
  1242. context.section := section;
  1243. context.registerUsageCount := registerUsageCount;
  1244. context.usedRegisters := usedRegisters;
  1245. context.temporaries := temporaries;
  1246. section := new;
  1247. NEW(registerUsageCount);
  1248. NEW(temporaries);
  1249. usedRegisters := NIL;
  1250. RETURN context;
  1251. END SwitchContext;
  1252. PROCEDURE ReturnToContext(context: Context);
  1253. BEGIN
  1254. section := context.section;
  1255. registerUsageCount := context.registerUsageCount;
  1256. usedRegisters := context.usedRegisters;
  1257. temporaries := context.temporaries;
  1258. END ReturnToContext;
  1259. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1260. VAR fp: SyntaxTree.Fingerprint; section: IntermediateCode.Section;
  1261. BEGIN
  1262. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1263. fp := fingerprinter.SymbolFP(syntaxTreeSymbol)
  1264. END;
  1265. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1266. section.SetExported(IsExported(syntaxTreeSymbol));
  1267. RETURN section
  1268. END NewSection;
  1269. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1270. VAR new: LONGINT;
  1271. BEGIN
  1272. new := registerUsageCount.Next(type,class);
  1273. UseRegister(new);
  1274. RETURN new
  1275. END AcquireRegister;
  1276. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1277. VAR
  1278. fingerprint: SyntaxTree.Fingerprint;
  1279. fingerprintString: ARRAY SIZE OF Basic.Fingerprint * 2 + 1 OF CHAR;
  1280. BEGIN
  1281. fingerprint := fingerprinter.SymbolFP(symbol);
  1282. string := "[";
  1283. Strings.IntToHexStr(fingerprint.public, SIZE OF Basic.Fingerprint * 2, fingerprintString);
  1284. Strings.Append(string, fingerprintString);
  1285. Strings.Append(string, "]");
  1286. END GetFingerprintString;
  1287. (** get the name for the code section that represens a certain symbol
  1288. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1289. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1290. VAR string: ARRAY 32 OF CHAR;
  1291. BEGIN
  1292. Global.GetSymbolSegmentedName(symbol, name);
  1293. (* if the symbol is an operator, then append the fingerprint to the name *)
  1294. IF symbol IS SyntaxTree.Operator THEN
  1295. GetFingerprintString(symbol, string);
  1296. Basic.AppendToSegmentedName(name,string);
  1297. END
  1298. END GetCodeSectionNameForSymbol;
  1299. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1300. BEGIN
  1301. IF dump # NIL THEN
  1302. dump.String("enter "); dump.String(s); dump.Ln;
  1303. END;
  1304. END TraceEnter;
  1305. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1306. BEGIN
  1307. IF dump # NIL THEN
  1308. dump.String("exit "); dump.String(s); dump.Ln;
  1309. END;
  1310. END TraceExit;
  1311. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1312. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1313. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1314. VAR i: LONGINT;
  1315. BEGIN
  1316. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1317. IF op.rule # NIL THEN
  1318. FOR i := 0 TO LEN(op.rule)-1 DO
  1319. CheckRegister(op.rule[i])
  1320. END;
  1321. END;
  1322. END CheckRegister;
  1323. BEGIN
  1324. CheckRegister(instruction.op1);
  1325. CheckRegister(instruction.op2);
  1326. CheckRegister(instruction.op3);
  1327. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1328. ELSE section.Emit(instruction);
  1329. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1330. END;
  1331. END Emit;
  1332. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1333. VAR saved: RegisterEntry;
  1334. BEGIN
  1335. IF backend.cooperative THEN
  1336. ReleaseUsedRegisters(saved);
  1337. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1338. CallThis(position,"Runtime","Trap",1);
  1339. RestoreRegisterUse(saved);
  1340. ELSE
  1341. Emit(Trap(position,trapNo));
  1342. END;
  1343. END EmitTrap;
  1344. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1345. VAR name: Basic.SegmentedName;
  1346. VAR op1, op2, reg: IntermediateCode.Operand;
  1347. VAR call, nocall: Label;
  1348. VAR parametersSize: LONGINT;
  1349. VAR prevSection: IntermediateCode.Section;
  1350. VAR prevDump: Streams.Writer;
  1351. VAR body: SyntaxTree.Body;
  1352. VAR procedureType: SyntaxTree.ProcedureType;
  1353. BEGIN
  1354. IF procedure # NIL THEN
  1355. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1356. ELSE procedureType := NIL;
  1357. END;
  1358. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1359. prevSection := SELF.section;
  1360. SELF.section := section;
  1361. prevDump := dump;
  1362. dump := section.comments;
  1363. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1364. IF backend.hasLinkRegister THEN
  1365. Emit(Push(Basic.invalidPosition, lr));
  1366. END;
  1367. Emit(Push(Basic.invalidPosition,fp));
  1368. IF procedure # NIL THEN
  1369. body := procedure.procedureScope.body;
  1370. ELSE
  1371. body := NIL;
  1372. END;
  1373. IF backend.cooperative THEN
  1374. IF callconv IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention} THEN
  1375. Emit(Push(Basic.invalidPosition, one)) ;
  1376. ELSE
  1377. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1378. GetCodeSectionNameForSymbol(procedure, name);
  1379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1380. ELSE
  1381. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1382. END;
  1383. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1384. IntermediateCode.AddOffset(op1, 1);
  1385. Emit(Push(Basic.invalidPosition,op1));
  1386. END;
  1387. Emit(Mov(Basic.invalidPosition,fp, sp));
  1388. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1389. NEW(call, section);
  1390. NEW(nocall, section);
  1391. reg := NewRegisterOperand(addressType);
  1392. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1393. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1394. BrltL(call, sp, reg);
  1395. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1396. BrgeL(nocall, sp, op2);
  1397. call.Resolve(section.pc);
  1398. Emit(Push(Basic.invalidPosition, reg));
  1399. ReleaseIntermediateOperand(reg);
  1400. parametersSize := ProcParametersSize(procedure);
  1401. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1402. Emit(Push(Basic.invalidPosition, op2));
  1403. CallThis(position, "Activities","ExpandStack",2);
  1404. Emit(Result(Basic.invalidPosition, sp));
  1405. nocall.Resolve(section.pc);
  1406. END;
  1407. ELSE
  1408. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1409. Emit(Push(Basic.invalidPosition, one)) ;
  1410. procedureType.SetParametersOffset(1);
  1411. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1412. END;
  1413. Emit(Mov(Basic.invalidPosition, fp, sp));
  1414. END;
  1415. END;
  1416. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1417. SELF.section := prevSection;
  1418. dump := prevDump;
  1419. END EmitEnter;
  1420. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1421. VAR op1,op2: IntermediateCode.Operand;
  1422. VAR instruction: IntermediateCode.Instruction;
  1423. BEGIN
  1424. IntermediateCode.InitNumber(op1,callconv);
  1425. IntermediateCode.InitNumber(op2,varSize);
  1426. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1427. RETURN instruction
  1428. END Enter;
  1429. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1430. VAR op1: IntermediateCode.Operand;
  1431. VAR instruction: IntermediateCode.Instruction;
  1432. BEGIN
  1433. IntermediateCode.InitNumber(op1,callconv);
  1434. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1435. RETURN instruction
  1436. END Leave;
  1437. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1438. VAR prevSection: IntermediateCode.Section;
  1439. VAR op2: IntermediateCode.Operand;
  1440. VAR body: SyntaxTree.Body;
  1441. BEGIN
  1442. prevSection := SELF.section;
  1443. SELF.section := section;
  1444. Emit(Leave(position, callconv));
  1445. IF procedure # NIL THEN
  1446. body := procedure.procedureScope.body;
  1447. ELSE
  1448. body := NIL;
  1449. END;
  1450. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1451. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1452. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1453. Emit(Add(position, sp, fp, op2));
  1454. ELSE
  1455. Emit(Mov(position, sp, fp));
  1456. END;
  1457. Emit(Pop(position, fp));
  1458. END;
  1459. SELF.section := prevSection;
  1460. END EmitLeave;
  1461. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1462. VAR m: SymbolMap;
  1463. BEGIN
  1464. position := x.position;
  1465. IF currentIsInline THEN
  1466. m := currentMapper.Get(x);
  1467. IF m # NIL THEN
  1468. (*
  1469. Printout.Info("mapping from", x);
  1470. Printout.Info("mapping to ", m.to);
  1471. *)
  1472. VExpression(m.to);
  1473. op := result;
  1474. IF m.tag # NIL THEN
  1475. ReleaseIntermediateOperand(result.tag);
  1476. VExpression(m.tag);
  1477. op.tag := result.op;
  1478. ReleaseIntermediateOperand(result.tag);
  1479. END;
  1480. RETURN
  1481. END;
  1482. END;
  1483. VSymbol(x);
  1484. op := result;
  1485. END Symbol;
  1486. PROCEDURE Expression(x: SyntaxTree.Expression);
  1487. BEGIN
  1488. position := x.position;
  1489. constantDeclaration := NIL;
  1490. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1491. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1492. END;
  1493. IF x.resolved # NIL THEN
  1494. VExpression(x.resolved);
  1495. ELSE
  1496. VExpression(x);
  1497. END;
  1498. (* check this, was commented out in ActiveCells3 *)
  1499. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1500. Error(x.position, "unsupported modifier");
  1501. END;
  1502. END Expression;
  1503. (*
  1504. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1505. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1506. BEGIN
  1507. temporaries.GetUsage(current);
  1508. FOR i := 0 TO LEN(current)-1 DO
  1509. set := current[i] - previous[i];
  1510. IF set # {} THEN
  1511. FOR j := 0 TO MAX(SET)-1 DO
  1512. IF j IN set THEN
  1513. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1514. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1515. Symbol(variable, op);
  1516. MakeMemory(tmp,op.op,addressType,0);
  1517. ReleaseOperand(op);
  1518. Emit(Mov(position,tmp, nil ) );
  1519. ReleaseIntermediateOperand(tmp);
  1520. END;
  1521. END;
  1522. END;
  1523. END;
  1524. END;
  1525. END ResetUsedTemporaries;
  1526. *)
  1527. PROCEDURE Statement(x: SyntaxTree.Statement);
  1528. VAR use: VariableUse;
  1529. BEGIN
  1530. temporaries.GetUsage(use);
  1531. position := x.position;
  1532. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1533. IF commentPrintout # NIL THEN
  1534. commentPrintout.Statement(x);
  1535. dump.Ln;
  1536. (*dump.Update;*)
  1537. END;
  1538. VStatement(x);
  1539. (*
  1540. CheckRegistersFree();
  1541. *)
  1542. (*ResetUsedTemporaries(use);*)
  1543. temporaries.SetUsage(use);
  1544. END Statement;
  1545. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1546. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1547. *)
  1548. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1549. BEGIN
  1550. ASSERT(op.mode # IntermediateCode.Undefined);
  1551. IF op.mode = IntermediateCode.ModeMemory THEN
  1552. ReuseCopy(res,op);
  1553. ELSE
  1554. res := op;
  1555. UseIntermediateOperand(res);
  1556. END;
  1557. IntermediateCode.AddOffset(res,offset);
  1558. IntermediateCode.MakeMemory(res,type);
  1559. END MakeMemory;
  1560. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1561. VAR mem: IntermediateCode.Operand;
  1562. BEGIN
  1563. MakeMemory(mem,res,type,offset);
  1564. ReleaseIntermediateOperand(res);
  1565. res := mem;
  1566. END ToMemory;
  1567. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1568. VAR mem: IntermediateCode.Operand;
  1569. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1570. componentType: SyntaxTree.Type;
  1571. BEGIN
  1572. type := type.resolved;
  1573. IF operand.mode = ModeReference THEN
  1574. IF type IS SyntaxTree.RangeType THEN
  1575. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1576. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1577. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1578. ReleaseOperand(operand);
  1579. operand.op := firstOp;
  1580. operand.tag := lastOp;
  1581. operand.extra := stepOp;
  1582. ELSIF type IS SyntaxTree.ComplexType THEN
  1583. componentType := type(SyntaxTree.ComplexType).componentType;
  1584. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1585. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1586. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1587. ReleaseOperand(operand);
  1588. operand.op := firstOp;
  1589. operand.tag := lastOp
  1590. ELSE
  1591. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1592. ReleaseIntermediateOperand(operand.op);
  1593. (* EXPERIMENTAL *)
  1594. IF operand.availability >= 0 THEN
  1595. IF availableSymbols[operand.availability].inRegister THEN
  1596. operand.op := availableSymbols[operand.availability].register;
  1597. UseIntermediateOperand(operand.op);
  1598. ELSE
  1599. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1600. availableSymbols[operand.availability].memory := mem;
  1601. operand.op := availableSymbols[operand.availability].register;
  1602. Emit(Mov(position, operand.op, mem));
  1603. availableSymbols[operand.availability].inRegister := TRUE;
  1604. END;
  1605. ReleaseIntermediateOperand(mem);
  1606. ELSE
  1607. operand.op := mem;
  1608. END;
  1609. END;
  1610. operand.mode := ModeValue;
  1611. END;
  1612. ASSERT(operand.mode = ModeValue);
  1613. END LoadValue;
  1614. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1615. BEGIN
  1616. InitOperand(result, ModeUndefined);
  1617. Expression(x);
  1618. op := result;
  1619. LoadValue(op,x.type.resolved);
  1620. END Evaluate;
  1621. PROCEDURE EvaluateX(CONST x: SyntaxTree.Expression; VAR result: Operand);
  1622. VAR operand: Operand; type: SyntaxTree.Type; symbol: SyntaxTree.Symbol;
  1623. BEGIN
  1624. Evaluate(x, result); RETURN;
  1625. IF (x.resolved # NIL) & (x.resolved # x) THEN EvaluateX(x.resolved, result); RETURN END;
  1626. WITH x:
  1627. SyntaxTree.UnaryExpression DO
  1628. EvaluateUnaryExpression(x, result);
  1629. RETURN;
  1630. |SyntaxTree.BinaryExpression DO
  1631. EvaluateBinaryExpression(x, result);
  1632. RETURN;
  1633. |SyntaxTree.Set DO
  1634. EvaluateSet(x, result);
  1635. RETURN;
  1636. |SyntaxTree.RangeExpression DO
  1637. InitOperand(result, ModeValue);
  1638. ASSERT(x.first # NIL);
  1639. EvaluateX(x.first, operand);
  1640. result.op := operand.op;
  1641. UseIntermediateOperand(result.op);
  1642. ReleaseOperand(operand);
  1643. ASSERT(x.last # NIL);
  1644. EvaluateX(x.last, operand);
  1645. result.tag := operand.op;
  1646. UseIntermediateOperand(result.tag);
  1647. ReleaseOperand(operand);
  1648. IF x.step # NIL THEN
  1649. EvaluateX(x.step, operand);
  1650. result.extra := operand.op;
  1651. UseIntermediateOperand(result.extra);
  1652. ReleaseOperand(operand);
  1653. END;
  1654. |SyntaxTree.SymbolDesignator DO
  1655. symbol := x.symbol;
  1656. WITH symbol: SyntaxTree.Constant DO
  1657. EvaluateX(symbol.value, result);
  1658. RETURN
  1659. ELSE (* designate and load --> below *)
  1660. END;
  1661. |SyntaxTree.BuiltinCallDesignator DO
  1662. EvaluateBuiltinCallDesignator(x,result);
  1663. (*
  1664. |SyntaxTree.Conversion DO
  1665. |SyntaxTree.ProcedureCallDesignator
  1666. |SyntaxTree.TypeGuardDesignator
  1667. |SyntaxTree.DereferenceDesignator
  1668. |SyntaxTree.SupercallDesignator
  1669. |SyntaxTree.SelfDesignator
  1670. *)
  1671. |SyntaxTree.BooleanValue DO
  1672. InitOperand(result,ModeValue);
  1673. IF x.value THEN result.op := true ELSE result.op := false END;
  1674. RETURN;
  1675. |SyntaxTree.IntegerValue DO
  1676. InitOperand(result,ModeValue);
  1677. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1678. IF ~supportedImmediate(result.op) &~inData THEN
  1679. GetImmediateMem(result.op)
  1680. END;
  1681. RETURN;
  1682. |SyntaxTree.CharacterValue DO
  1683. InitOperand(result,ModeValue);
  1684. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  1685. RETURN;
  1686. |SyntaxTree.RealValue DO
  1687. InitOperand(result,ModeValue);
  1688. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1689. RETURN;
  1690. |SyntaxTree.ComplexValue DO
  1691. ASSERT(x.type IS SyntaxTree.ComplexType);
  1692. type := x.type(SyntaxTree.ComplexType).componentType;
  1693. InitOperand(result,ModeValue);
  1694. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,type),x.realValue); (* real part *)
  1695. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,type),x.imagValue); (* imaginary part *)
  1696. RETURN;
  1697. |SyntaxTree.NilValue DO
  1698. InitOperand(result,ModeValue);
  1699. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1700. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1701. RETURN;
  1702. |SyntaxTree.EnumerationValue DO
  1703. InitOperand(result,ModeValue);
  1704. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  1705. RETURN;
  1706. ELSE (* other designators *)
  1707. END;
  1708. Designate(x, result);
  1709. LoadValue(result, x.type);
  1710. END EvaluateX;
  1711. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1712. BEGIN
  1713. InitOperand(result,ModeUndefined);
  1714. Expression(x);
  1715. (* ASSERT(x.mode = ModeReference *)
  1716. op := result;
  1717. END Designate;
  1718. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1719. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1720. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1721. leftExpression, rightExpression: SyntaxTree.Expression;
  1722. BEGIN
  1723. ASSERT(label # NIL);
  1724. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1725. WITH x:
  1726. SyntaxTree.UnaryExpression DO
  1727. CASE x.operator OF
  1728. Scanner.Not:
  1729. Condition(x.left,label,~reason);
  1730. RETURN;
  1731. ELSE
  1732. END;
  1733. | SyntaxTree.BinaryExpression DO
  1734. leftType := x.left.type.resolved;
  1735. rightType := x.right.type.resolved;
  1736. CASE x.operator OF
  1737. Scanner.Or:
  1738. (* shortcut evaluation of left OR right *)
  1739. IF reason THEN (*left or right*)
  1740. Condition(x.left,label,TRUE);
  1741. Condition(x.right,label,TRUE);
  1742. ELSE (* ~ (left or right) = ~left & ~right *)
  1743. skip := NewLabel();
  1744. Condition(x.left,skip,TRUE);
  1745. Condition(x.right,label,FALSE);
  1746. SetLabel(skip);
  1747. END;
  1748. RETURN;
  1749. |Scanner.And:
  1750. (* shortcut evaluation of left & right *)
  1751. IF reason THEN (* left and right *)
  1752. skip := NewLabel();
  1753. Condition(x.left,skip,FALSE);
  1754. Condition(x.right,label,TRUE);
  1755. SetLabel(skip);
  1756. ELSE (* ~(left and right) = ~left or ~right *)
  1757. Condition(x.left,label,FALSE);
  1758. Condition(x.right,label,FALSE);
  1759. END;
  1760. RETURN;
  1761. |Scanner.Is:
  1762. (* get type desc tag *)
  1763. IF IsPointerToRecord(x.left.type,recordType) THEN
  1764. EvaluateX(x.left, left);
  1765. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1766. ELSE
  1767. Designate(x.left,left);
  1768. END;
  1769. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1770. ReleaseOperand(left);
  1771. RETURN;
  1772. |Scanner.Equal:
  1773. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1774. IF reason THEN
  1775. CompareString(BreqL,label,x.left,x.right);
  1776. ELSE
  1777. CompareString(BrneL,label,x.left,x.right);
  1778. END;
  1779. ELSE
  1780. Evaluate(x.left,left);
  1781. Evaluate(x.right,right);
  1782. IF leftType IS SyntaxTree.RangeType THEN
  1783. ASSERT(rightType IS SyntaxTree.RangeType);
  1784. IF reason THEN
  1785. skip := NewLabel();
  1786. BrneL(skip, left.op, right.op); (* first *)
  1787. BrneL(skip, left.tag, right.tag); (* last *)
  1788. BreqL(label, left.extra, right.extra); (* step *)
  1789. SetLabel(skip);
  1790. ELSE
  1791. BrneL(label, left.op, right.op); (* first *)
  1792. BrneL(label, left.tag, right.tag); (* last *)
  1793. BrneL(label, left.extra, right.extra); (* step *)
  1794. END;
  1795. ReleaseOperand(left); ReleaseOperand(right);
  1796. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1797. IF reason THEN
  1798. skip := NewLabel();
  1799. BrneL(skip, left.op, right.op); (* first *)
  1800. BreqL(label, left.tag, right.tag); (* last *)
  1801. SetLabel(skip);
  1802. ELSE
  1803. BrneL(label, left.op, right.op); (* first *)
  1804. BrneL(label, left.tag, right.tag); (* last *)
  1805. END;
  1806. ReleaseOperand(left); ReleaseOperand(right);
  1807. ELSE
  1808. IF reason THEN
  1809. BreqL(label,left.op,right.op);
  1810. ELSE
  1811. BrneL(label,left.op,right.op);
  1812. END;
  1813. ReleaseOperand(left); ReleaseOperand(right);
  1814. END;
  1815. END;
  1816. RETURN;
  1817. |Scanner.LessEqual:
  1818. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1819. IF reason THEN
  1820. CompareString(BrgeL,label,x.right,x.left);
  1821. ELSE
  1822. CompareString(BrltL,label,x.right,x.left);
  1823. END;
  1824. ELSE
  1825. Evaluate(x.left,left);
  1826. Evaluate(x.right,right);
  1827. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1828. Reuse1(temp,right.op);
  1829. Emit(And(position,temp,left.op,right.op));
  1830. ReleaseOperand(right);
  1831. IF reason THEN
  1832. BreqL(label,temp,left.op);
  1833. ELSE
  1834. BrneL(label,temp,left.op);
  1835. END;
  1836. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1837. ELSE
  1838. IF reason THEN
  1839. BrgeL(label,right.op,left.op);
  1840. ELSE
  1841. BrltL(label,right.op,left.op);
  1842. END;
  1843. ReleaseOperand(left); ReleaseOperand(right);
  1844. END;
  1845. END;
  1846. RETURN;
  1847. |Scanner.Less:
  1848. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1849. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1850. leftExpression.SetType(system.booleanType);
  1851. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1852. rightExpression.SetType(system.booleanType);
  1853. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1854. leftExpression.SetType(system.booleanType);
  1855. Condition(leftExpression,label,reason);
  1856. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1857. IF reason THEN
  1858. CompareString(BrltL,label,x.left,x.right);
  1859. ELSE
  1860. CompareString(BrgeL,label,x.left,x.right);
  1861. END;
  1862. ELSE
  1863. Evaluate(x.left,left);
  1864. Evaluate(x.right,right);
  1865. IF reason THEN
  1866. BrltL(label,left.op,right.op);
  1867. ELSE
  1868. BrgeL(label,left.op,right.op);
  1869. END;
  1870. ReleaseOperand(left); ReleaseOperand(right);
  1871. END;
  1872. RETURN;
  1873. |Scanner.Greater:
  1874. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1875. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1876. leftExpression.SetType(system.booleanType);
  1877. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1878. rightExpression.SetType(system.booleanType);
  1879. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1880. leftExpression.SetType(system.booleanType);
  1881. Condition(leftExpression,label,reason);
  1882. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1883. IF reason THEN
  1884. CompareString(BrltL,label,x.right,x.left);
  1885. ELSE
  1886. CompareString(BrgeL,label,x.right,x.left);
  1887. END;
  1888. ELSE
  1889. Evaluate(x.left,left);
  1890. Evaluate(x.right,right);
  1891. IF reason THEN
  1892. BrltL(label, right.op,left.op);
  1893. ELSE
  1894. BrgeL(label, right.op,left.op);
  1895. END;
  1896. ReleaseOperand(left); ReleaseOperand(right);
  1897. END;
  1898. RETURN;
  1899. |Scanner.GreaterEqual:
  1900. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1901. IF reason THEN
  1902. CompareString(BrgeL,label,x.left,x.right);
  1903. ELSE
  1904. CompareString(BrltL,label,x.left,x.right);
  1905. END;
  1906. ELSE
  1907. Evaluate(x.left,left);
  1908. Evaluate(x.right,right);
  1909. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1910. Reuse1(temp,left.op);
  1911. Emit(And(position,temp,left.op,right.op));
  1912. ReleaseOperand(left);
  1913. IF reason THEN
  1914. BreqL(label, temp, right.op);
  1915. ELSE
  1916. BrneL(label, temp, right.op);
  1917. END;
  1918. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1919. ELSE
  1920. IF reason THEN
  1921. BrgeL(label,left.op,right.op);
  1922. ELSE
  1923. BrltL(label, left.op,right.op);
  1924. END;
  1925. ReleaseOperand(left); ReleaseOperand(right);
  1926. END;
  1927. END;
  1928. RETURN;
  1929. |Scanner.Unequal:
  1930. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1931. IF reason THEN
  1932. CompareString(BrneL,label,x.left,x.right);
  1933. ELSE
  1934. CompareString(BreqL,label,x.left,x.right);
  1935. END
  1936. ELSE
  1937. Evaluate(x.left,left);
  1938. Evaluate(x.right,right);
  1939. IF leftType IS SyntaxTree.RangeType THEN
  1940. ASSERT(rightType IS SyntaxTree.RangeType);
  1941. IF ~reason THEN
  1942. skip := NewLabel();
  1943. BrneL(skip, left.op, right.op); (* first *)
  1944. BrneL(skip, left.tag, right.tag); (* last *)
  1945. BreqL(label, left.extra, right.extra); (* step *)
  1946. SetLabel(skip);
  1947. ELSE
  1948. BrneL(label, left.op, right.op); (* first *)
  1949. BrneL(label, left.tag, right.tag); (* last *)
  1950. BrneL(label, left.extra, right.extra); (* step *)
  1951. END;
  1952. ReleaseOperand(left); ReleaseOperand(right);
  1953. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1954. IF reason THEN
  1955. BrneL(label, left.op, right.op);
  1956. BrneL(label, left.tag, right.tag);
  1957. ELSE
  1958. skip := NewLabel();
  1959. BrneL(skip, left.op, right.op);
  1960. BreqL(label, left.tag, right.tag);
  1961. SetLabel(skip);
  1962. END;
  1963. ReleaseOperand(left); ReleaseOperand(right);
  1964. ELSE
  1965. IF reason THEN
  1966. BrneL(label,left.op,right.op);
  1967. ELSE
  1968. BreqL(label,left.op,right.op);
  1969. END;
  1970. ReleaseOperand(left); ReleaseOperand(right);
  1971. END;
  1972. END;
  1973. RETURN;
  1974. ELSE (* case *)
  1975. END;
  1976. |SyntaxTree.BooleanValue DO
  1977. IF reason = x.value THEN BrL(label) END;
  1978. RETURN;
  1979. ELSE (* with *)
  1980. END;
  1981. (* default case: evaluate and compare result *)
  1982. EvaluateX(x,left);
  1983. IF reason THEN
  1984. BrneL(label,left.op, false);
  1985. ELSE
  1986. BreqL(label,left.op, false);
  1987. END;
  1988. ReleaseOperand(left);
  1989. END Condition;
  1990. PROCEDURE EvaluateUnaryExpression(x: SyntaxTree.UnaryExpression; VAR result: Operand);
  1991. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1992. BEGIN
  1993. IF Trace THEN TraceEnter("EvaluateUnaryExpression") END;
  1994. dest := destination; destination := emptyOperand;
  1995. CASE x.operator OF
  1996. Scanner.Not:
  1997. EvaluateX(x.left, operand);
  1998. InitOperand(result,ModeValue);
  1999. Reuse1a(result.op,operand.op,dest);
  2000. Emit(Xor(position,result.op,operand.op,true));
  2001. ReleaseOperand(operand);
  2002. |Scanner.Minus:
  2003. EvaluateX(x.left, operand);
  2004. InitOperand(result,ModeValue);
  2005. Reuse1a(result.op,operand.op,dest);
  2006. type := x.left.type.resolved;
  2007. IF type IS SyntaxTree.SetType THEN
  2008. Emit(Not(position,result.op,operand.op));
  2009. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2010. Reuse1(result.tag,operand.tag);
  2011. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2012. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2013. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2014. Emit(Neg(position,result.op,operand.op));
  2015. ELSE HALT(200)
  2016. END;
  2017. ReleaseOperand(operand);
  2018. |Scanner.Address:
  2019. Designate(x.left,result);
  2020. result.mode := ModeValue;
  2021. t0 := x.left.type.resolved;
  2022. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2023. ReleaseIntermediateOperand(result.op);
  2024. result.op := result.tag;
  2025. IntermediateCode.InitOperand(result.tag);
  2026. END;
  2027. Convert(result.op,IntermediateCode.GetType(system,x.type));
  2028. END;
  2029. destination := dest;
  2030. IF Trace THEN TraceExit("UnaryExpression") END;
  2031. END EvaluateUnaryExpression;
  2032. PROCEDURE EvaluateBinaryExpression(x: SyntaxTree.BinaryExpression; VAR result: Operand);
  2033. VAR left,right: Operand;zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2034. leftType,rightType: SyntaxTree.Type;
  2035. leftExpression,rightExpression : SyntaxTree.Expression;
  2036. componentType: IntermediateCode.Type;
  2037. exit: Label; dest: IntermediateCode.Operand;
  2038. size: LONGINT;
  2039. BEGIN
  2040. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2041. dest := destination; destination := emptyOperand;
  2042. leftType := x.left.type.resolved;
  2043. rightType := x.right.type.resolved;
  2044. CASE x.operator OF
  2045. Scanner.Or, Scanner.And, Scanner.Is:
  2046. result := ConditionValue(x);
  2047. |Scanner.Plus:
  2048. EvaluateX(x.left,left);
  2049. EvaluateX(x.right,right);
  2050. IF leftType IS SyntaxTree.SetType THEN
  2051. InitOperand(result,ModeValue);
  2052. Reuse2a(result.op,left.op,right.op,dest);
  2053. Emit(Or(position,result.op,left.op,right.op));
  2054. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2055. InitOperand(result,ModeValue);
  2056. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2057. Reuse2(result.tag,left.tag,right.tag);
  2058. Emit(Add(position,result.op,left.op,right.op));
  2059. Emit(Add(position,result.tag,left.tag,right.tag))
  2060. ELSE
  2061. InitOperand(result,ModeValue);
  2062. Reuse2a(result.op,left.op,right.op,dest);
  2063. Emit(Add(position,result.op,left.op,right.op));
  2064. END;
  2065. ReleaseOperand(left); ReleaseOperand(right);
  2066. |Scanner.Minus:
  2067. EvaluateX(x.left,left);
  2068. EvaluateX(x.right,right);
  2069. IF leftType IS SyntaxTree.SetType THEN
  2070. InitOperand(result,ModeValue);
  2071. Reuse1(result.op,right.op);
  2072. Emit(Not(position,result.op,right.op));
  2073. ReleaseOperand(right);
  2074. Emit(And(position,result.op,result.op,left.op));
  2075. ReleaseOperand(left);
  2076. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2077. InitOperand(result,ModeValue);
  2078. Reuse2a(result.op,left.op,right.op,dest);
  2079. Reuse2(result.tag,left.tag,right.tag);
  2080. Emit(Sub(position,result.op,left.op,right.op));
  2081. Emit(Sub(position,result.tag,left.tag,right.tag));
  2082. ReleaseOperand(left); ReleaseOperand(right)
  2083. ELSE
  2084. InitOperand(result,ModeValue);
  2085. Reuse2a(result.op,left.op,right.op,dest);
  2086. Emit(Sub(position,result.op,left.op,right.op));
  2087. ReleaseOperand(left); ReleaseOperand(right);
  2088. END;
  2089. |Scanner.Times:
  2090. EvaluateX(x.left, left);
  2091. EvaluateX(x.right, right);
  2092. IF leftType IS SyntaxTree.SetType THEN
  2093. InitOperand(result,ModeValue);
  2094. Reuse2a(result.op,left.op,right.op,dest);
  2095. Emit(And(position,result.op,left.op,right.op));
  2096. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2097. InitOperand(result, ModeValue);
  2098. componentType := left.op.type;
  2099. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2100. Emit(Mul(position,result.op, left.op, right.op));
  2101. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2102. Emit(Mul(position,tempReg, left.tag, right.tag));
  2103. Emit(Sub(position,result.op, result.op, tempReg));
  2104. Reuse2(result.tag, left.tag, right.op);
  2105. Emit(Mul(position,result.tag, left.tag, right.op));
  2106. Emit(Mul(position,tempReg, left.op, right.tag));
  2107. Emit(Add(position,result.tag, result.tag, tempReg));
  2108. ReleaseIntermediateOperand(tempReg)
  2109. ELSE
  2110. InitOperand(result,ModeValue);
  2111. Reuse2a(result.op,left.op,right.op,dest);
  2112. Emit(Mul(position,result.op,left.op,right.op));
  2113. END;
  2114. ReleaseOperand(left); ReleaseOperand(right);
  2115. |Scanner.Div:
  2116. EvaluateX(x.left, left);
  2117. EvaluateX(x.right, right);
  2118. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2119. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2120. IF ~isUnchecked THEN
  2121. exit := NewLabel();
  2122. BrltL(exit,zero,right.op);
  2123. EmitTrap(position,NegativeDivisorTrap);
  2124. SetLabel(exit);
  2125. END;
  2126. END;
  2127. InitOperand(result,ModeValue);
  2128. Reuse2a(result.op,left.op,right.op,dest);
  2129. Emit(Div(position,result.op,left.op,right.op));
  2130. ReleaseOperand(left); ReleaseOperand(right);
  2131. |Scanner.Mod:
  2132. EvaluateX(x.left, left);
  2133. EvaluateX(x.right, right);
  2134. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2135. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2136. IF ~isUnchecked THEN
  2137. exit := NewLabel();
  2138. BrltL(exit,zero,right.op);
  2139. EmitTrap(position,NegativeDivisorTrap);
  2140. SetLabel(exit);
  2141. END;
  2142. END;
  2143. InitOperand(result,ModeValue);
  2144. Reuse2a(result.op,left.op,right.op,dest);
  2145. Emit(Mod(position,result.op,left.op,right.op));
  2146. ReleaseOperand(left); ReleaseOperand(right);
  2147. |Scanner.Slash:
  2148. EvaluateX(x.left, left);
  2149. EvaluateX(x.right, right);
  2150. IF leftType IS SyntaxTree.SetType THEN
  2151. InitOperand(result,ModeValue);
  2152. Reuse2a(result.op,left.op,right.op,dest);
  2153. Emit(Xor(position,result.op,left.op,right.op));
  2154. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2155. InitOperand(result,ModeValue);
  2156. componentType := left.op.type;
  2157. (*
  2158. divisor = right.op * right.op + right.tag * right.tag
  2159. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2160. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2161. *)
  2162. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2163. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2164. Emit(Mul(position,tempReg, right.op, right.op));
  2165. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2166. Emit(Add(position,tempReg, tempReg, tempReg2));
  2167. result.op := tempReg2;
  2168. Emit(Mul(position,result.op, left.op, right.op));
  2169. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2170. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2171. Emit(Add(position,result.op, result.op, tempReg2));
  2172. Emit(Div(position,result.op, result.op, tempReg));
  2173. Reuse2(result.tag, left.tag, right.op);
  2174. Emit(Mul(position,result.tag, left.tag, right.op));
  2175. Emit(Mul(position,tempReg2, left.op, right.tag));
  2176. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2177. Emit(Div(position,result.tag, result.tag, tempReg));
  2178. ReleaseIntermediateOperand(tempReg);
  2179. ReleaseIntermediateOperand(tempReg2)
  2180. ELSE
  2181. InitOperand(result,ModeValue);
  2182. Reuse2a(result.op,left.op,right.op,dest);
  2183. Emit(Div(position,result.op,left.op,right.op));
  2184. END;
  2185. ReleaseOperand(left); ReleaseOperand(right);
  2186. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  2187. result := ConditionValue(x);
  2188. |Scanner.In:
  2189. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  2190. EvaluateX(x.left, left);
  2191. EvaluateX(x.right, right);
  2192. Convert(left.op,setType);
  2193. Convert(right.op,setType);
  2194. result.mode := ModeValue;
  2195. result.tag := nil; (* may be left over from calls to evaluate *)
  2196. ReuseCopy(result.op,right.op);
  2197. Emit(Shr(position,result.op,result.op,left.op));
  2198. ReleaseOperand(right); ReleaseOperand(left);
  2199. IntermediateCode.InitImmediate(one,setType,1);
  2200. Emit(And(position,result.op,result.op,one));
  2201. Convert(result.op,bool);
  2202. ELSE
  2203. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  2204. IF x.operator = Scanner.Questionmarks THEN
  2205. leftExpression := x.left;
  2206. rightExpression := x.right;
  2207. ELSE
  2208. leftExpression := x.right;
  2209. rightExpression := x.left;
  2210. END;
  2211. EvaluateX(leftExpression, left);
  2212. Emit(Push(position,left.op));
  2213. ReleaseOperand(left);
  2214. Designate(rightExpression, right);
  2215. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2216. IF ~backend.cellsAreObjects THEN
  2217. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  2218. END;
  2219. Emit(Push(position,right.op));
  2220. ReleaseOperand(right);
  2221. IF backend.cellsAreObjects THEN
  2222. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  2223. ELSE
  2224. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  2225. END;
  2226. InitOperand(result, ModeValue);
  2227. result.op := NewRegisterOperand(bool);
  2228. Emit(Result(position,result.op));
  2229. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  2230. leftExpression := x.left;
  2231. rightExpression := x.right;
  2232. EvaluateX(leftExpression, left);
  2233. Emit(Push(position,left.op));
  2234. ReleaseOperand(left);
  2235. EvaluateX(rightExpression, right);
  2236. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2237. IF ~backend.cellsAreObjects THEN
  2238. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  2239. END;
  2240. Emit(Push(position,right.op));
  2241. ReleaseOperand(right);
  2242. IF backend.cellsAreObjects THEN
  2243. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  2244. ELSE
  2245. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  2246. END;
  2247. InitOperand(result, ModeValue);
  2248. result.op := NewRegisterOperand(bool);
  2249. Emit(Result(position,result.op));
  2250. ELSE
  2251. HALT(100);
  2252. END;
  2253. END;
  2254. destination := dest;
  2255. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  2256. END EvaluateBinaryExpression;
  2257. PROCEDURE EvaluateSet(x: SyntaxTree.Set; VAR result: Operand);
  2258. VAR
  2259. operand: Operand;
  2260. temp, one, noBits, dest: IntermediateCode.Operand;
  2261. expression: SyntaxTree.Expression;
  2262. i: LONGINT;
  2263. BEGIN
  2264. IF Trace THEN TraceEnter("VisitSet") END;
  2265. dest := destination;
  2266. destination := emptyOperand;
  2267. noBits := IntermediateCode.Immediate(setType, 0);
  2268. one := IntermediateCode.Immediate(setType, 1);
  2269. (* start off with the empty set *)
  2270. InitOperand(result, ModeValue);
  2271. IntermediateCode.InitRegister(result.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2272. Emit(Mov(position,result.op, noBits));
  2273. FOR i := 0 TO x.elements.Length() - 1 DO
  2274. expression := x.elements.GetExpression(i);
  2275. IF expression IS SyntaxTree.RangeExpression THEN
  2276. (* range of set elements *)
  2277. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2278. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2279. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2280. ReleaseIntermediateOperand(temp)
  2281. ELSE
  2282. (* singelton element *)
  2283. Evaluate(expression, operand);
  2284. Convert(operand.op, setType);
  2285. CheckSetElement(operand.op);
  2286. (* create subset containing single element *)
  2287. Reuse1(temp, operand.op);
  2288. Emit(Shl(position,temp, one, operand.op));
  2289. ReleaseOperand(operand);
  2290. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2291. ReleaseIntermediateOperand(temp);
  2292. END
  2293. END;
  2294. destination := dest;
  2295. IF Trace THEN TraceExit("VisitSet") END;
  2296. END EvaluateSet;
  2297. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  2298. VAR op: IntermediateCode.Operand; reg: LONGINT;
  2299. BEGIN
  2300. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  2301. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  2302. RETURN op
  2303. END NewRegisterOperand;
  2304. PROCEDURE UnuseRegister(register: LONGINT);
  2305. BEGIN
  2306. IF (register > 0) THEN
  2307. register := registerUsageCount.Map(register);
  2308. registerUsageCount.DecUse(register);
  2309. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2310. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2311. END;
  2312. IF registerUsageCount.Use(register)=0 THEN
  2313. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  2314. Warning(position, "register cannot be removed");
  2315. END;
  2316. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2317. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  2318. END;
  2319. ELSIF registerUsageCount.Use(register)<0 THEN
  2320. Warning(position, "register removed too often");
  2321. IF dump # NIL THEN
  2322. dump.String("register removed too often"); dump.Ln; dump.Update;
  2323. END;
  2324. END;
  2325. END;
  2326. END UnuseRegister;
  2327. PROCEDURE UseRegister(register: LONGINT);
  2328. BEGIN
  2329. IF (register > 0) THEN
  2330. register := registerUsageCount.Map(register);
  2331. registerUsageCount.IncUse(register);
  2332. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2333. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2334. END;
  2335. IF registerUsageCount.Use(register)=1 THEN
  2336. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  2337. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2338. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  2339. END;
  2340. END;
  2341. END;
  2342. END UseRegister;
  2343. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2344. BEGIN
  2345. UnuseRegister(op.register)
  2346. END ReleaseIntermediateOperand;
  2347. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2348. BEGIN
  2349. UseRegister(op.register)
  2350. END UseIntermediateOperand;
  2351. PROCEDURE ReleaseOperand(CONST op: Operand);
  2352. BEGIN
  2353. UnuseRegister(op.op.register);
  2354. UnuseRegister(op.tag.register);
  2355. UnuseRegister(op.extra.register);
  2356. END ReleaseOperand;
  2357. (* save registers marked in array "markedRegisters" to the stack
  2358. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  2359. *)
  2360. PROCEDURE SaveRegisters();
  2361. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  2362. BEGIN
  2363. entry := usedRegisters;
  2364. WHILE entry # NIL DO
  2365. type := registerUsageCount.used[entry.register].type;
  2366. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  2367. Emit(Push(position,op));
  2368. entry := entry.next;
  2369. END;
  2370. END SaveRegisters;
  2371. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  2372. BEGIN
  2373. saved := usedRegisters;
  2374. usedRegisters := NIL;
  2375. END ReleaseUsedRegisters;
  2376. (** remove parameter registers from used queue *)
  2377. PROCEDURE ReleaseParameterRegisters;
  2378. VAR entry,prev,next: RegisterEntry;
  2379. BEGIN
  2380. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  2381. WHILE entry # NIL DO
  2382. next := entry.next;
  2383. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  2384. registerUsageCount.DecUse(entry.register);
  2385. ASSERT(registerUsageCount.Use(entry.register)=0);
  2386. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2387. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  2388. END;
  2389. ELSIF prev = NIL THEN
  2390. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  2391. ELSE
  2392. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  2393. END;
  2394. entry := next;
  2395. END;
  2396. END ReleaseParameterRegisters;
  2397. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  2398. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  2399. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2400. BEGIN
  2401. entry := saved;
  2402. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2403. entry := prev;
  2404. WHILE entry # NIL DO
  2405. prev := entry.prev;
  2406. type := entry.type;
  2407. class := entry.registerClass;
  2408. IntermediateCode.InitRegister(op,type,class,entry.register);
  2409. Emit(Pop(position,op));
  2410. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2411. entry := prev;
  2412. END;
  2413. END RestoreRegisters;
  2414. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2415. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2416. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2417. BEGIN
  2418. entry := saved;
  2419. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2420. entry := prev;
  2421. WHILE entry # NIL DO
  2422. prev := entry.prev;
  2423. type := entry.type;
  2424. class := entry.registerClass;
  2425. IntermediateCode.InitRegister(op,type,class,entry.register);
  2426. Emit(Mov(position,op,op));
  2427. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2428. entry := prev;
  2429. END;
  2430. END RestoreRegisterUse;
  2431. PROCEDURE CheckRegistersFree;
  2432. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2433. BEGIN
  2434. IF usedRegisters # NIL THEN
  2435. r := usedRegisters;
  2436. WHILE r # NIL DO
  2437. warning := "register ";
  2438. Strings.AppendInt(warning, r.register);
  2439. Strings.Append(warning, " not released.");
  2440. Warning(position,warning);
  2441. r := r .next;
  2442. END;
  2443. END;
  2444. FOR i := 0 TO registerUsageCount.count-1 DO
  2445. IF registerUsageCount.used[i].count < 0 THEN
  2446. warning := "register ";
  2447. Strings.AppendInt(warning, i);
  2448. Strings.Append(warning, " unused too often.");
  2449. Warning(position,warning);
  2450. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2451. warning := "register ";
  2452. Strings.AppendInt(warning, i);
  2453. Strings.Append(warning, " not unused often enough.");
  2454. Warning(position,warning);
  2455. END;
  2456. END;
  2457. END CheckRegistersFree;
  2458. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2459. Otherwise allocate a new register.
  2460. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2461. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2462. BEGIN
  2463. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2464. UseIntermediateOperand(result);
  2465. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2466. UseIntermediateOperand(result);
  2467. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2468. END;
  2469. END Reuse2;
  2470. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2471. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2472. If not then allocate a new register.
  2473. Does NOT necessarily keep the content of src1 or src2 in result!
  2474. *)
  2475. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2476. BEGIN
  2477. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2478. UseIntermediateOperand(result);
  2479. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2480. UseIntermediateOperand(result);
  2481. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2482. result := alternative; alternative := emptyOperand;
  2483. UseIntermediateOperand(result);
  2484. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2485. END;
  2486. END Reuse2a;
  2487. (* like reuse2 but only one source *)
  2488. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2489. BEGIN
  2490. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2491. UseIntermediateOperand(result);
  2492. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2493. END;
  2494. END Reuse1;
  2495. (* like reuse2a but only one source *)
  2496. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2497. BEGIN
  2498. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2499. UseIntermediateOperand(result);
  2500. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2501. UseIntermediateOperand(result);
  2502. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2503. END;
  2504. END Reuse1a;
  2505. (* like reuse1 but guarantees that content of src1 is in result *)
  2506. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2507. BEGIN
  2508. IF ReusableRegister(src1) THEN
  2509. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2510. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2511. UseIntermediateOperand(result);
  2512. ELSE
  2513. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2514. Emit(Mov(position,result,src1));
  2515. END
  2516. END ReuseCopy;
  2517. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2518. BEGIN
  2519. IF ReusableRegister(src) THEN
  2520. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2521. ELSE
  2522. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2523. Emit(Mov(position,result,src));
  2524. ReleaseIntermediateOperand(src);
  2525. END
  2526. END TransferToRegister;
  2527. (** labels and branches **)
  2528. PROCEDURE NewLabel(): Label;
  2529. VAR label: Label;
  2530. BEGIN
  2531. NEW(label,section); RETURN label;
  2532. END NewLabel;
  2533. (* EXPERIMENTAL *)
  2534. PROCEDURE EndBasicBlock;
  2535. VAR i: LONGINT;
  2536. BEGIN
  2537. i := 0;
  2538. WHILE (availableSymbols[i].symbol # NIL) DO
  2539. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2540. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2541. END;
  2542. availableSymbols[i].symbol := NIL;
  2543. INC(i);
  2544. END;
  2545. END EndBasicBlock;
  2546. (* EXPERIMENTAL *)
  2547. PROCEDURE BeginBasicBlock;
  2548. BEGIN
  2549. ASSERT(availableSymbols[0].symbol = NIL);
  2550. END BeginBasicBlock;
  2551. PROCEDURE SetLabel(label: Label);
  2552. BEGIN
  2553. (* EXPERIMENTAL *)
  2554. EndBasicBlock;
  2555. BeginBasicBlock;
  2556. label.Resolve(section.pc);
  2557. END SetLabel;
  2558. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2559. BEGIN
  2560. ASSERT(label # NIL);
  2561. IF label.pc < 0 THEN (* label not yet set *)
  2562. label.AddFixup(section.pc);
  2563. END;
  2564. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2565. END LabelOperand;
  2566. PROCEDURE BrL(label: Label);
  2567. BEGIN
  2568. (* EXPERIMENTAL *)
  2569. EndBasicBlock;
  2570. Emit(Br(position,LabelOperand(label)));
  2571. END BrL;
  2572. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2573. BEGIN
  2574. Emit(Brge(position,LabelOperand(label),left,right));
  2575. END BrgeL;
  2576. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2577. BEGIN
  2578. Emit(Brlt(position,LabelOperand(label),left,right));
  2579. END BrltL;
  2580. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2581. BEGIN
  2582. Emit(Breq(position,LabelOperand(label),left,right));
  2583. END BreqL;
  2584. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2585. BEGIN
  2586. Emit(Brne(position,LabelOperand(label),left,right));
  2587. END BrneL;
  2588. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2589. VAR new: IntermediateCode.Operand;
  2590. BEGIN
  2591. IF Trace THEN TraceEnter("Convert") END;
  2592. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2593. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2594. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2595. & (operand.offset = 0)
  2596. THEN
  2597. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2598. Emit(Conv(position,new,operand));
  2599. ELSE
  2600. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2601. Emit(Conv(position,new,operand));
  2602. ReleaseIntermediateOperand(operand);
  2603. END;
  2604. operand := new;
  2605. 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
  2606. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2607. ELSE
  2608. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2609. Emit(Conv(position,new,operand));
  2610. ReleaseIntermediateOperand(operand);
  2611. operand := new;
  2612. END;
  2613. IF Trace THEN TraceExit("Convert") END;
  2614. END Convert;
  2615. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2616. VAR exit: Label;
  2617. BEGIN
  2618. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2619. exit := NewLabel();
  2620. br(exit,left,right);
  2621. EmitTrap(position,trapNo);
  2622. SetLabel(exit);
  2623. END TrapC;
  2624. (** expressions *)
  2625. (** emit necessary runtime check for set elements **)
  2626. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2627. VAR max: IntermediateCode.Operand;
  2628. BEGIN
  2629. IF isUnchecked THEN RETURN END;
  2630. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2631. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2632. TrapC(BrgeL, max, o, SetElementTrap);
  2633. END;
  2634. END CheckSetElement;
  2635. (** the set that a range represents **)
  2636. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2637. VAR
  2638. operand: Operand;
  2639. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2640. BEGIN
  2641. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2642. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2643. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2644. one := IntermediateCode.Immediate(setType, 1);
  2645. Evaluate(x, operand);
  2646. Convert(operand.op, setType);
  2647. Convert(operand.tag, setType);
  2648. CheckSetElement(operand.op);
  2649. CheckSetElement(operand.tag);
  2650. (* create mask for lower bound
  2651. i.e. shift 11111111 to the left by the value of the lower bound
  2652. *)
  2653. Reuse1(temp, operand.op);
  2654. Emit(Shl(position,temp, allBits, operand.op));
  2655. ReleaseIntermediateOperand(operand.op);
  2656. operand.op := temp;
  2657. (* create mask for upper bound
  2658. i.e. shift 11111111 to the right by the difference between the
  2659. upper bound and the maximum number of set elements
  2660. *)
  2661. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2662. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2663. Reuse1(temp, operand.tag);
  2664. ELSE
  2665. Reuse1(temp, operand.tag);
  2666. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2667. Emit(Sub(position,temp, size, operand.tag));
  2668. END;
  2669. Emit(Shr(position,temp, allBits, operand.tag));
  2670. ReleaseIntermediateOperand(operand.tag);
  2671. operand.tag := temp;
  2672. Reuse2(resultingSet, operand.op, operand.tag);
  2673. (* intersect the two masks *)
  2674. Emit(And(position,resultingSet, operand.op, operand.tag));
  2675. ReleaseOperand(operand);
  2676. RETURN resultingSet
  2677. END SetFromRange;
  2678. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2679. VAR
  2680. res, operand: Operand;
  2681. temp, one, noBits, dest: IntermediateCode.Operand;
  2682. expression: SyntaxTree.Expression;
  2683. i: LONGINT;
  2684. BEGIN
  2685. IF Trace THEN TraceEnter("VisitSet") END;
  2686. dest := destination;
  2687. destination := emptyOperand;
  2688. noBits := IntermediateCode.Immediate(setType, 0);
  2689. one := IntermediateCode.Immediate(setType, 1);
  2690. (* start off with the empty set *)
  2691. InitOperand(res, ModeValue);
  2692. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2693. Emit(Mov(position,res.op, noBits));
  2694. FOR i := 0 TO x.elements.Length() - 1 DO
  2695. expression := x.elements.GetExpression(i);
  2696. IF expression IS SyntaxTree.RangeExpression THEN
  2697. (* range of set elements *)
  2698. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2699. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2700. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2701. ReleaseIntermediateOperand(temp)
  2702. ELSE
  2703. (* singelton element *)
  2704. Evaluate(expression, operand);
  2705. Convert(operand.op, setType);
  2706. CheckSetElement(operand.op);
  2707. (* create subset containing single element *)
  2708. Reuse1(temp, operand.op);
  2709. Emit(Shl(position,temp, one, operand.op));
  2710. ReleaseOperand(operand);
  2711. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2712. ReleaseIntermediateOperand(temp);
  2713. END
  2714. END;
  2715. result := res;
  2716. destination := dest;
  2717. IF Trace THEN TraceExit("VisitSet") END;
  2718. END VisitSet;
  2719. (* math arrays of the form [a,b,c]
  2720. x is a static array and thus does not provide any pointers
  2721. *)
  2722. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2723. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2724. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2725. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2726. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2727. element: SyntaxTree.IntegerValue;
  2728. BEGIN
  2729. numberElements := x.elements.Length();
  2730. expression := index.parameters.GetExpression(dim);
  2731. element := expression(SyntaxTree.IntegerValue);
  2732. FOR i := 0 TO numberElements-1 DO
  2733. expression := x.elements.GetExpression(i);
  2734. element.SetValue(i);
  2735. IF expression IS SyntaxTree.MathArrayExpression THEN
  2736. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2737. ELSE
  2738. Assign(index,expression);
  2739. END;
  2740. END;
  2741. END RecursiveAssignment;
  2742. PROCEDURE Dimension(): LONGINT;
  2743. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2744. BEGIN
  2745. dim := 0;
  2746. expression := x;
  2747. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2748. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2749. INC(dim);
  2750. END;
  2751. RETURN dim;
  2752. END Dimension;
  2753. BEGIN
  2754. (*static math array not providing pointers anyway *)
  2755. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2756. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2757. designator.SetType(variable.type);
  2758. dim := Dimension();
  2759. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2760. FOR i := 0 TO dim-1 DO
  2761. element := SyntaxTree.NewIntegerValue(x.position,0);
  2762. element.SetType(system.longintType);
  2763. index.parameters.AddExpression(element);
  2764. END;
  2765. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2766. RecursiveAssignment(x,0);
  2767. Expression(designator);
  2768. END VisitMathArrayExpression;
  2769. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2770. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2771. BEGIN
  2772. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2773. dest := destination; destination := emptyOperand;
  2774. IF x.operator = Scanner.Not THEN
  2775. Evaluate(x.left,operand);
  2776. InitOperand(result,ModeValue);
  2777. Reuse1a(result.op,operand.op,dest);
  2778. Emit(Xor(position,result.op,operand.op,true));
  2779. ReleaseOperand(operand);
  2780. ELSIF x.operator = Scanner.Minus THEN
  2781. Evaluate(x.left,operand);
  2782. InitOperand(result,ModeValue);
  2783. Reuse1a(result.op,operand.op,dest);
  2784. type := x.left.type.resolved;
  2785. IF type IS SyntaxTree.SetType THEN
  2786. Emit(Not(position,result.op,operand.op));
  2787. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2788. Reuse1(result.tag,operand.tag);
  2789. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2790. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2791. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2792. Emit(Neg(position,result.op,operand.op));
  2793. ELSE HALT(200)
  2794. END;
  2795. ReleaseOperand(operand);
  2796. ELSIF x.operator = Scanner.Address THEN
  2797. Designate(x.left,operand);
  2798. operand.mode := ModeValue;
  2799. t0 := x.left.type.resolved;
  2800. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2801. ReleaseIntermediateOperand(operand.op);
  2802. operand.op := operand.tag;
  2803. IntermediateCode.InitOperand(operand.tag);
  2804. END;
  2805. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2806. result := operand;
  2807. ELSE HALT(100)
  2808. END;
  2809. destination := dest;
  2810. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2811. END VisitUnaryExpression;
  2812. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2813. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2814. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2815. BEGIN
  2816. type := type.resolved;
  2817. originalType := type;
  2818. IF type IS SyntaxTree.PointerType THEN
  2819. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2820. END;
  2821. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2822. BrL(label);
  2823. ELSE
  2824. ASSERT(type IS SyntaxTree.RecordType);
  2825. (*
  2826. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2827. *)
  2828. IF withPart THEN
  2829. left := tag;
  2830. ELSE
  2831. ReuseCopy(left,tag);
  2832. END;
  2833. right := TypeDescriptorAdr(type);
  2834. IF backend.cooperative THEN
  2835. repeatL := NewLabel();
  2836. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2837. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2838. END;
  2839. SetLabel(repeatL);
  2840. IF reason THEN
  2841. BreqL(label,left,right);
  2842. ELSE
  2843. skip := NewLabel();
  2844. BreqL(skip,left,right);
  2845. END;
  2846. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2847. BrneL(repeatL,left,nil);
  2848. IF ~reason THEN
  2849. BrL(label);
  2850. SetLabel(skip);
  2851. END;
  2852. ELSIF meta.simple THEN
  2853. level := type(SyntaxTree.RecordType).Level();
  2854. (* get type desc tag of level relative to base tag *)
  2855. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2856. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2857. IntermediateCode.MakeMemory(left,addressType);
  2858. IF reason THEN
  2859. BreqL(label,left,right);
  2860. ELSE
  2861. BrneL(label,left,right);
  2862. END;
  2863. ELSE
  2864. level := type(SyntaxTree.RecordType).Level();
  2865. (* get type desc tag of level relative to base tag *)
  2866. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2867. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2868. IntermediateCode.MakeMemory(left,addressType);
  2869. IF reason THEN
  2870. BreqL(label,left,right);
  2871. ELSE
  2872. BrneL(label,left,right);
  2873. END;
  2874. END;
  2875. IF ~withPart THEN
  2876. ReleaseIntermediateOperand(left);
  2877. END;
  2878. ReleaseIntermediateOperand(right);
  2879. END;
  2880. END TypeTest;
  2881. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2882. BEGIN
  2883. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2884. IF dump # NIL THEN
  2885. dump.String(s); dump.Ln;
  2886. END;
  2887. END Error;
  2888. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2889. BEGIN
  2890. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2891. IF dump # NIL THEN
  2892. dump.String(s); dump.Ln; dump.Update;
  2893. END;
  2894. END Warning;
  2895. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2896. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; context: Context;
  2897. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2898. operand:Operand;
  2899. BEGIN
  2900. Global.GetModuleName(mod,name);
  2901. Strings.Append(name,".@Trace");
  2902. Basic.ToSegmentedName(name, pooledName);
  2903. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE));
  2904. IF dump # NIL THEN dump := section.comments END;
  2905. IF backend.hasLinkRegister THEN
  2906. Emit(Push(Basic.invalidPosition, lr));
  2907. END;
  2908. variable := mod.moduleScope.firstVariable;
  2909. WHILE variable # NIL DO
  2910. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2911. Symbol(variable, operand);
  2912. register := operand.op;
  2913. CallTraceMethod(register, variable.type);
  2914. ReleaseIntermediateOperand(register);
  2915. END;
  2916. variable := variable.nextVariable;
  2917. END;
  2918. IF backend.hasLinkRegister THEN
  2919. Emit(Pop(Basic.invalidPosition, lr));
  2920. END;
  2921. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2922. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2923. Emit(Br(position,op));
  2924. INC(statCoopTraceModule, section.pc);
  2925. ReturnToContext(context);
  2926. IF dump # NIL THEN dump := section.comments END;
  2927. END CreateTraceModuleMethod;
  2928. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2929. BEGIN
  2930. Emit (Push(position, dst));
  2931. Emit (Push(position, src));
  2932. CallThis(position,"GarbageCollector","Assign", 2);
  2933. END CallAssignPointer;
  2934. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2935. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2936. BEGIN
  2937. IF SemanticChecker.IsPointerType (type) THEN
  2938. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2939. ELSIF type.IsRecordType() THEN
  2940. Emit (Push(position,dst));
  2941. Emit (Push(position,src));
  2942. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2943. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2944. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2945. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2946. ELSIF IsStaticArray(type) THEN
  2947. size := StaticArrayNumElements(type);
  2948. base := StaticArrayBaseType(type);
  2949. IF base.IsRecordType() THEN
  2950. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2951. Emit (Push(position, dst));
  2952. Emit (Push(position, src));
  2953. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2954. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2955. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2956. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2957. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2958. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2959. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2960. Emit (Push(position, dst));
  2961. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2962. Emit (Push(position, src));
  2963. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2964. ELSE
  2965. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2966. Emit (Push(position, dst));
  2967. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2968. Emit (Push(position, src));
  2969. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2970. ASSERT(StaticArrayBaseType(type).IsPointer());
  2971. END;
  2972. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2973. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2974. Emit (Push(position, dst));
  2975. Emit (Push(position, src));
  2976. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2977. ELSE HALT(100); (* missing ? *)
  2978. END;
  2979. END CallAssignMethod;
  2980. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2981. VAR name: Basic.SegmentedName;
  2982. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2983. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2984. context: Context;
  2985. BEGIN
  2986. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2987. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2988. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2989. GetRecordTypeName (recordType,name);
  2990. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2991. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  2992. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2993. section.SetExported (TRUE);
  2994. IF dump # NIL THEN dump := section.comments END;
  2995. IF backend.hasLinkRegister THEN
  2996. Emit(Push(Basic.invalidPosition, lr));
  2997. END;
  2998. variable := recordType.recordScope.firstVariable;
  2999. WHILE variable # NIL DO
  3000. IF variable.NeedsTrace() THEN
  3001. dst := NewRegisterOperand (addressType);
  3002. src := NewRegisterOperand (addressType);
  3003. Emit (Mov(position, dst, parameter1));
  3004. Emit (Mov(position, src, parameter2));
  3005. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3006. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  3007. CallAssignMethod(dst, src, variable.type);
  3008. ReleaseIntermediateOperand(src);
  3009. ReleaseIntermediateOperand(dst);
  3010. END;
  3011. variable := variable.nextVariable;
  3012. END;
  3013. recordBase := recordType.GetBaseRecord();
  3014. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3015. IF backend.hasLinkRegister THEN
  3016. Emit(Pop(Basic.invalidPosition, lr));
  3017. END;
  3018. GetRecordTypeName (recordBase,name);
  3019. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3020. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3021. Emit(Br(position,op));
  3022. ELSE
  3023. Emit(Exit(position,0,0, 0));
  3024. END;
  3025. INC(statCoopAssignProcedure, section.pc);
  3026. ReturnToContext(context);
  3027. IF ~recordType.isObject THEN
  3028. GetRecordTypeName (recordType,name);
  3029. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3030. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3031. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3032. section.SetExported (TRUE);
  3033. dst := NewRegisterOperand (addressType);
  3034. src := NewRegisterOperand (addressType);
  3035. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3036. Emit(Mov(position, dst, parameter1));
  3037. Emit(Mov(position, src, parameter2));
  3038. label := NewLabel();
  3039. SetLabel(label);
  3040. Emit(Push(position, dst));
  3041. Emit(Push(position, src));
  3042. GetRecordTypeName (recordType,name);
  3043. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3044. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3045. Emit(Call(position, op, 0));
  3046. Emit(Pop(position, src));
  3047. Emit(Pop(position, dst));
  3048. Emit(Add(position, dst, dst, ofs));
  3049. Emit(Add(position, src, src, ofs));
  3050. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3051. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3052. Emit(Exit(position,0,0, 0));
  3053. ReturnToContext(context);
  3054. END;
  3055. IF dump # NIL THEN dump := section.comments END;
  3056. END CreateAssignProcedure;
  3057. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  3058. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  3059. BEGIN
  3060. IF IsUnsafePointer (type) THEN
  3061. skip := NewLabel();
  3062. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  3063. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  3064. BreqL (skip, op, nil);
  3065. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  3066. SetLabel (skip);
  3067. ELSIF SemanticChecker.IsPointerType (type) THEN
  3068. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  3069. CallThis(position,"GarbageCollector","Mark", 1);
  3070. ELSIF type.IsRecordType() THEN
  3071. Emit (Push(position,register));
  3072. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3073. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3074. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3075. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3076. ELSIF IsStaticArray(type) THEN
  3077. size := StaticArrayNumElements(type);
  3078. base := StaticArrayBaseType(type);
  3079. IF base.IsRecordType() THEN
  3080. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3081. Emit (Push(position, register));
  3082. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  3083. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3084. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3085. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3086. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  3087. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3088. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3089. Emit (Push(position, register));
  3090. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  3091. ELSE
  3092. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3093. Emit (Push(position, register));
  3094. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  3095. ASSERT(base.IsPointer());
  3096. END;
  3097. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3098. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  3099. CallThis(position,"GarbageCollector","Mark", 1);
  3100. ELSE HALT(100); (* missing ? *)
  3101. END;
  3102. END CallTraceMethod;
  3103. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  3104. VAR name: Basic.SegmentedName; variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3105. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  3106. BEGIN
  3107. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3108. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3109. GetRecordTypeName (recordType,name);
  3110. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3111. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  3112. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3113. section.SetExported (TRUE);
  3114. IF dump # NIL THEN dump := section.comments END;
  3115. IF backend.hasLinkRegister THEN
  3116. Emit(Push(Basic.invalidPosition, lr));
  3117. END;
  3118. variable := recordType.recordScope.firstVariable;
  3119. WHILE variable # NIL DO
  3120. IF variable.NeedsTrace() THEN
  3121. register := NewRegisterOperand (addressType);
  3122. Emit (Mov(position,register,parameter1));
  3123. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  3124. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3125. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3126. END;
  3127. CallTraceMethod(register, variable.type);
  3128. ReleaseIntermediateOperand(register);
  3129. END;
  3130. variable := variable.nextVariable;
  3131. END;
  3132. recordBase := recordType.GetBaseRecord();
  3133. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  3134. recordBase := recordBase.GetBaseRecord();
  3135. END;
  3136. IF recordBase # NIL THEN
  3137. IF backend.hasLinkRegister THEN
  3138. Emit(Pop(Basic.invalidPosition, lr));
  3139. END;
  3140. GetRecordTypeName (recordBase,name);
  3141. IF HasExplicitTraceMethod (recordBase) THEN
  3142. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  3143. ELSE
  3144. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3145. END;
  3146. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3147. Emit(Br(position,op));
  3148. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  3149. Emit(Exit(position,0,0,0));
  3150. ELSE
  3151. IF backend.hasLinkRegister THEN
  3152. Emit(Pop(Basic.invalidPosition, lr));
  3153. END;
  3154. IF recordType.isObject THEN
  3155. Basic.ToSegmentedName ("BaseTypes.Object",name);
  3156. ELSE
  3157. Basic.ToSegmentedName ("BaseTypes.Record",name);
  3158. END;
  3159. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3160. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3161. Emit(Br(position,op));
  3162. END;
  3163. INC(statCoopTraceMethod, section.pc);
  3164. ReturnToContext(context);
  3165. IF ~recordType.isObject THEN
  3166. GetRecordTypeName (recordType,name);
  3167. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  3168. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3169. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3170. section.SetExported (TRUE);
  3171. IF dump # NIL THEN dump := section.comments END;
  3172. register := NewRegisterOperand (addressType);
  3173. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  3174. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  3175. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3176. END;
  3177. Emit (Push(position,register));
  3178. GetRecordTypeName (recordType,name);
  3179. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3180. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3181. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3182. ReleaseIntermediateOperand(register);
  3183. Emit(Exit(position,0,0,0));
  3184. ReturnToContext(context);
  3185. GetRecordTypeName (recordType,name);
  3186. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3187. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3188. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3189. section.SetExported (TRUE);
  3190. register := NewRegisterOperand (addressType);
  3191. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3192. Emit(Mov(position, register, parameter1));
  3193. label := NewLabel();
  3194. SetLabel(label);
  3195. Emit(Push(position, register));
  3196. GetRecordTypeName (recordType,name);
  3197. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3198. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3199. Emit(Call(position, op, 0));
  3200. Emit(Pop(position, register));
  3201. Emit(Add(position, register, register, ofs));
  3202. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3203. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3204. Emit(Exit(position,0,0,0));
  3205. ReturnToContext(context);
  3206. END;
  3207. IF dump # NIL THEN dump := section.comments END;
  3208. END CreateTraceMethod;
  3209. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  3210. VAR name: Basic.SegmentedName;
  3211. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3212. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  3213. context: Context;
  3214. BEGIN
  3215. IF recordType.isObject THEN RETURN END;
  3216. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3217. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3218. GetRecordTypeName (recordType,name);
  3219. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3220. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  3221. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3222. section.SetExported (TRUE);
  3223. IF dump # NIL THEN dump := section.comments END;
  3224. IF backend.hasLinkRegister THEN
  3225. Emit(Push(Basic.invalidPosition, lr));
  3226. END;
  3227. variable := recordType.recordScope.firstVariable;
  3228. WHILE variable # NIL DO
  3229. IF variable.NeedsTrace() THEN
  3230. dst := NewRegisterOperand (addressType);
  3231. Emit (Mov(position, dst, parameter1));
  3232. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3233. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3234. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3235. END;
  3236. CallResetProcedure(dst, nil, variable.type);
  3237. ReleaseIntermediateOperand(dst);
  3238. END;
  3239. variable := variable.nextVariable;
  3240. END;
  3241. recordBase := recordType.GetBaseRecord();
  3242. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3243. IF backend.hasLinkRegister THEN
  3244. Emit(Pop(Basic.invalidPosition, lr));
  3245. END;
  3246. GetRecordTypeName (recordBase,name);
  3247. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3248. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3249. Emit(Br(position,op));
  3250. ELSE
  3251. Emit(Exit(position,0,0, 0));
  3252. END;
  3253. INC(statCoopResetProcedure, section.pc);
  3254. ReturnToContext(context);
  3255. GetRecordTypeName (recordType,name);
  3256. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3257. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3258. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3259. section.SetExported (TRUE);
  3260. dst := NewRegisterOperand (addressType);
  3261. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3262. Emit(Mov(position, dst, parameter1));
  3263. label := NewLabel();
  3264. SetLabel(label);
  3265. Emit(Push(position, dst));
  3266. GetRecordTypeName (recordType,name);
  3267. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3268. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3269. Emit(Call(position, op, 0));
  3270. Emit(Pop(position, dst));
  3271. Emit(Add(position, dst, dst, ofs));
  3272. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3273. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3274. Emit(Exit(position,0,0, 0));
  3275. ReturnToContext(context);
  3276. IF dump # NIL THEN dump := section.comments END;
  3277. END CreateResetProcedure;
  3278. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  3279. VAR name: Basic.SegmentedName; context: Context;
  3280. BEGIN
  3281. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  3282. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3283. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3284. IF dump # NIL THEN dump := section.comments END;
  3285. IF backend.hasLinkRegister THEN
  3286. Emit(Push(Basic.invalidPosition, lr));
  3287. END;
  3288. Emit(Push(position,fp));
  3289. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  3290. ResetVariables(scope);
  3291. Emit(Pop(position,fp));
  3292. Emit(Exit(position,0,0, 0));
  3293. ReturnToContext(context);
  3294. IF dump # NIL THEN dump := section.comments END;
  3295. END CreateResetMethod;
  3296. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  3297. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  3298. BEGIN
  3299. IF SemanticChecker.IsPointerType (type) THEN
  3300. Emit (Push(position, dest));
  3301. CallThis(position,"GarbageCollector","Reset", 1);
  3302. ELSIF type.IsRecordType() THEN
  3303. Emit (Push(position, dest));
  3304. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3305. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3306. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3307. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3308. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  3309. size := GetArrayLength(type, tag);
  3310. base := ArrayBaseType(type);
  3311. IF base.IsRecordType() THEN
  3312. Emit (Push(position, size));
  3313. Emit (Push(position, dest));
  3314. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  3315. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3316. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3317. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3318. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  3319. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3320. Emit (Push(position, size));
  3321. Emit (Push(position, dest));
  3322. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  3323. ELSE
  3324. Emit (Push(position, size));
  3325. Emit (Push(position, dest));
  3326. CallThis(position,"GarbageCollector","ResetArray", 2);
  3327. ASSERT(ArrayBaseType(type).IsPointer());
  3328. END;
  3329. ReleaseIntermediateOperand(size);
  3330. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3331. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  3332. Emit (Push(position, dest));
  3333. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  3334. ELSE HALT(100); (* missing ? *)
  3335. END;
  3336. END CallResetProcedure;
  3337. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  3338. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  3339. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  3340. VAR operand: Operand;
  3341. BEGIN
  3342. Symbol (symbol, operand);
  3343. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  3344. ReleaseOperand(operand);
  3345. END Reset;
  3346. BEGIN
  3347. previousScope := currentScope;
  3348. currentScope := scope;
  3349. pc := section.pc;
  3350. prevOffset := MAX(SIZE);
  3351. variable := scope.firstVariable;
  3352. WHILE variable # NIL DO
  3353. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3354. Reset (variable);
  3355. prevOffset := variable.offsetInBits;
  3356. END;
  3357. variable := variable.nextVariable;
  3358. END;
  3359. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3360. WHILE parameter # NIL DO
  3361. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  3362. Reset (parameter);
  3363. END;
  3364. parameter := parameter.nextParameter;
  3365. END;
  3366. INC(statCoopResetVariables, section.pc - pc);
  3367. currentScope := previousScope;
  3368. END ResetVariables;
  3369. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  3370. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  3371. BEGIN
  3372. type := symbol.type.resolved;
  3373. SaveRegisters();ReleaseUsedRegisters(saved);
  3374. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  3375. Symbol(symbol, operand);
  3376. ToMemory(operand.op,addressType,0);
  3377. Emit(Push(position,operand.op));
  3378. IF refer THEN
  3379. CallThis(position,"Heaps","Refer",1);
  3380. ELSE
  3381. CallThis(position,"Heaps","Reset",1);
  3382. END;
  3383. ELSIF type.IsRecordType() THEN
  3384. Symbol(symbol, operand);
  3385. Emit(Push(position,operand.op));
  3386. Emit(Push(position,operand.tag)); (* type desc *)
  3387. IF refer THEN
  3388. CallThis(position,"Heaps","ReferRecord",2);
  3389. ELSE
  3390. CallThis(position,"Heaps","ResetRecord",2);
  3391. END;
  3392. ELSIF IsStaticArray(type) THEN
  3393. size := StaticArrayNumElements(type);
  3394. base := StaticArrayBaseType(type);
  3395. Symbol(symbol, operand);
  3396. arg := TypeDescriptorAdr(base);
  3397. Emit(Push(position,operand.op));
  3398. Emit(Push(position,arg));
  3399. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3400. ReleaseIntermediateOperand(arg);
  3401. IF refer THEN
  3402. CallThis(position,"Heaps","ReferArray",3);
  3403. ELSE
  3404. CallThis(position,"Heaps","ResetArray",3);
  3405. END;
  3406. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  3407. size := StaticMathArrayNumElements(type);
  3408. base := StaticMathArrayBaseType(type);
  3409. Symbol(symbol, operand);
  3410. arg := TypeDescriptorAdr(base);
  3411. Emit(Push(position,operand.op));
  3412. Emit(Push(position,arg));
  3413. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3414. ReleaseIntermediateOperand(arg);
  3415. IF refer THEN
  3416. CallThis(position,"Heaps","ReferArray",3);
  3417. ELSE
  3418. CallThis(position,"Heaps","ResetArray",3);
  3419. END;
  3420. ELSIF type IS SyntaxTree.MathArrayType THEN
  3421. Symbol(symbol, operand);
  3422. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3423. Emit (Push(position, operand.op));
  3424. ELSE
  3425. Emit (Push(position, operand.tag));
  3426. END;
  3427. IF refer THEN
  3428. CallThis(position,"Heaps","ReferMathArray", 1);
  3429. ELSE
  3430. CallThis(position,"Heaps","ResetMathArray", 1);
  3431. END;
  3432. ELSIF type IS SyntaxTree.ProcedureType THEN
  3433. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  3434. Symbol(symbol, operand);
  3435. Emit (Push(position, operand.tag));
  3436. IF refer THEN
  3437. CallThis(position,"Heaps","Refer", 1);
  3438. ELSE
  3439. CallThis(position,"Heaps","Reset", 1);
  3440. END;
  3441. ELSE HALT(100); (* missing ? *)
  3442. END;
  3443. ReleaseOperand(operand);
  3444. RestoreRegisters(saved);
  3445. END Reset;
  3446. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  3447. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  3448. BEGIN
  3449. previousScope := currentScope;
  3450. currentScope := scope;
  3451. pc := section.pc;
  3452. IF ~ refer THEN
  3453. variable := scope.firstVariable;
  3454. prevOffset := MAX(SIZE);
  3455. WHILE variable # NIL DO
  3456. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3457. Reset (variable,refer);
  3458. prevOffset := variable.offsetInBits;
  3459. END;
  3460. variable := variable.nextVariable;
  3461. END;
  3462. END;
  3463. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3464. WHILE parameter # NIL DO
  3465. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  3466. Reset (parameter,refer);
  3467. END;
  3468. parameter := parameter.nextParameter;
  3469. END;
  3470. INC(statCoopResetVariables, section.pc - pc);
  3471. currentScope := previousScope;
  3472. END ResetVariables2;
  3473. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  3474. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; context: Context;
  3475. BEGIN
  3476. GetCodeSectionNameForSymbol(procedure, name);
  3477. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3478. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3479. IF dump # NIL THEN dump := section.comments END;
  3480. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3481. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3482. Emit(Data(position,op));
  3483. Emit(Data(position,nil));
  3484. IF HasPointers (procedure.procedureScope) THEN
  3485. GetCodeSectionNameForSymbol(procedure, name);
  3486. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3487. ELSE
  3488. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3489. END;
  3490. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3491. Emit(Data(position,op));
  3492. ReturnToContext(context);
  3493. IF dump # NIL THEN dump := section.comments END;
  3494. END CreateProcedureDescriptor;
  3495. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3496. VAR import: SyntaxTree.Import;
  3497. s: Basic.MessageString;
  3498. selfName: SyntaxTree.IdentifierString;
  3499. BEGIN
  3500. moduleScope.ownerModule.GetName(selfName);
  3501. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3502. module := moduleScope.ownerModule
  3503. ELSE
  3504. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3505. IF import = NIL THEN
  3506. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3507. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3508. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3509. s := "Module ";
  3510. Strings.Append(s,moduleName);
  3511. Strings.Append(s," cannot be imported.");
  3512. IF force THEN
  3513. Error(position,s);
  3514. ELSIF canBeLoaded THEN
  3515. IF WarningDynamicLoading THEN
  3516. Strings.Append(s, "=> no dynamic linking.");
  3517. Warning(position, s);
  3518. END;
  3519. canBeLoaded := FALSE;
  3520. END;
  3521. RETURN FALSE
  3522. ELSE
  3523. SELF.module.imports.AddName(moduleName)
  3524. END;
  3525. ELSIF import.module = NIL THEN (* already tried *)
  3526. RETURN FALSE
  3527. END;
  3528. module := import.module;
  3529. END;
  3530. RETURN TRUE
  3531. END AddImport;
  3532. (* needed for old binary object file format*)
  3533. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3534. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: Basic.Fingerprint;
  3535. BEGIN
  3536. IF AddImport(moduleName,module,TRUE) THEN
  3537. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3538. IF procedure = NIL THEN
  3539. s := "Instruction not supported on target, emulation procedure ";
  3540. Strings.Append(s,moduleName);
  3541. Strings.Append(s,".");
  3542. Strings.Append(s,procedureName);
  3543. Strings.Append(s," not present");
  3544. Error(position,s);
  3545. ELSE
  3546. StaticCallOperand(r,procedure);
  3547. ReleaseOperand(r);
  3548. fp := GetFingerprint(procedure);
  3549. END;
  3550. END;
  3551. END EnsureSymbol;
  3552. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3553. VAR trueL, exitL: Label; op: Operand;
  3554. BEGIN
  3555. InitOperand(op,ModeValue);
  3556. trueL := NewLabel();
  3557. exitL := NewLabel();
  3558. Condition(x,trueL,TRUE);
  3559. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3560. Emit(Mov(position,op.op,false));
  3561. BrL(exitL);
  3562. SetLabel(trueL);
  3563. Emit(MovReplace(position,op.op,true));
  3564. SetLabel(exitL);
  3565. RETURN op;
  3566. END ConditionValue;
  3567. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3568. VAR size: LONGINT;
  3569. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3570. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3571. BEGIN
  3572. ASSERT(type.form = SyntaxTree.Open);
  3573. baseType := type.arrayBase.resolved;
  3574. IF IsOpenArray(baseType) THEN
  3575. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3576. ELSE
  3577. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3578. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3579. END;
  3580. len := tag;
  3581. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3582. IntermediateCode.MakeMemory(len,addressType);
  3583. UseIntermediateOperand(len);
  3584. Reuse2(res,sizeOperand,len);
  3585. Emit(Mul(position,res,sizeOperand,len));
  3586. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3587. RETURN res
  3588. END GetArraySize;
  3589. BEGIN
  3590. type := type.resolved;
  3591. IF IsOpenArray(type) THEN
  3592. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3593. RETURN tag
  3594. ELSE
  3595. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3596. END;
  3597. ELSE
  3598. size := ToMemoryUnits(system,system.SizeOf(type));
  3599. RETURN IntermediateCode.Immediate(addressType,size)
  3600. END;
  3601. END GetDynamicSize;
  3602. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3603. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3604. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3605. BEGIN
  3606. ASSERT(type.form = SyntaxTree.Open);
  3607. baseType := type.arrayBase.resolved;
  3608. IF IsOpenArray(baseType) THEN
  3609. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3610. ELSE
  3611. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3612. END;
  3613. len := tag;
  3614. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3615. IntermediateCode.MakeMemory(len,addressType);
  3616. UseIntermediateOperand(len);
  3617. Reuse2(res,sizeOperand,len);
  3618. Emit(Mul(position,res,sizeOperand,len));
  3619. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3620. RETURN res
  3621. END GetLength;
  3622. BEGIN
  3623. type := type.resolved;
  3624. IF IsOpenArray(type) THEN
  3625. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3626. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3627. ELSIF type IS SyntaxTree.StringType THEN
  3628. RETURN tag;
  3629. ELSE
  3630. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3631. END;
  3632. END GetArrayLength;
  3633. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3634. VAR result: IntermediateCode.Operand;
  3635. BEGIN
  3636. IF backend.cooperative THEN
  3637. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3638. ELSE
  3639. MakeMemory(result, tag, addressType, 0);
  3640. END;
  3641. RETURN result
  3642. END GetSizeFromTag;
  3643. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3644. VAR parameter: SyntaxTree.Parameter;
  3645. BEGIN
  3646. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3647. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3648. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3649. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3650. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3651. END;
  3652. RETURN GetDynamicSize(e.type, tag);
  3653. END GetArrayOfBytesSize;
  3654. (*
  3655. to find imported symbol. not needed ?
  3656. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3657. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3658. BEGIN
  3659. IF AddImport(moduleName,importedModule,FALSE) THEN
  3660. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3661. RETURN symbol
  3662. ELSE
  3663. RETURN NIL
  3664. END
  3665. END SymbolByName;
  3666. *)
  3667. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3668. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3669. BEGIN
  3670. IF AddImport(moduleName,runtimeModule,force) THEN
  3671. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3672. IF procedure = NIL THEN
  3673. s := "Procedure ";
  3674. Strings.Append(s,moduleName);
  3675. Strings.Append(s,".");
  3676. Strings.Append(s,procedureName);
  3677. Strings.Append(s," not present");
  3678. Error(position,s);
  3679. RETURN FALSE
  3680. ELSE
  3681. RETURN TRUE
  3682. END;
  3683. ELSE RETURN FALSE
  3684. END;
  3685. END GetRuntimeProcedure;
  3686. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3687. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3688. s: Basic.MessageString;
  3689. BEGIN
  3690. Basic.InitSegmentedName(name);
  3691. name[0] := Basic.MakeString(moduleName);
  3692. name[1] := Basic.MakeString(typeName);
  3693. name[2] := -1;
  3694. IF AddImport(moduleName,importedModule, FALSE) THEN
  3695. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3696. IF symbol = NIL THEN
  3697. s := "type ";
  3698. Strings.Append(s,moduleName);
  3699. Strings.Append(s,".");
  3700. Strings.Append(s,typeName);
  3701. Strings.Append(s," not present");
  3702. Error(position,s);
  3703. END;
  3704. ELSE symbol := NIL;
  3705. END;
  3706. IF importedModule = moduleScope.ownerModule THEN
  3707. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3708. ELSE
  3709. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3710. END;
  3711. RETURN symbol
  3712. END GetTypeDescriptor;
  3713. (* 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. *)
  3714. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3715. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3716. pooledName: Basic.SegmentedName; size: LONGINT;
  3717. BEGIN
  3718. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3719. StaticCallOperand(result,procedure);
  3720. IF numberParameters < 0 THEN
  3721. size := ProcParametersSize(procedure);
  3722. ELSE
  3723. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3724. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3725. Error(position,"runtime call parameter count mismatch");
  3726. END;
  3727. END;
  3728. Emit(Call(position, result.op, size));
  3729. ReleaseOperand(result);
  3730. ELSE (* only static linking possible *)
  3731. ASSERT(numberParameters >= 0);
  3732. Basic.InitSegmentedName(pooledName);
  3733. pooledName[0] := Basic.MakeString(moduleName);
  3734. pooledName[1] := Basic.MakeString(procedureName);
  3735. pooledName[2] := -1;
  3736. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3737. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3738. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3739. END;
  3740. END CallThisChecked;
  3741. (* 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. *)
  3742. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3743. BEGIN
  3744. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3745. END CallThis;
  3746. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3747. VAR
  3748. left,right: Operand;
  3749. leftSize, rightSize: IntermediateCode.Operand;
  3750. saved: RegisterEntry;
  3751. reg: IntermediateCode.Operand;
  3752. procedureName: SyntaxTree.IdentifierString;
  3753. BEGIN
  3754. procedureName := "CompareString";
  3755. SaveRegisters();ReleaseUsedRegisters(saved);
  3756. Designate(leftExpression,left);
  3757. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3758. Emit(Push(position,leftSize));
  3759. ReleaseIntermediateOperand(leftSize);
  3760. Emit(Push(position,left.op));
  3761. ReleaseOperand(left);
  3762. Designate(rightExpression,right);
  3763. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3764. Emit(Push(position,rightSize));
  3765. ReleaseIntermediateOperand(rightSize);
  3766. Emit(Push(position,right.op));
  3767. ReleaseOperand(right);
  3768. CallThis(position,builtinsModuleName,procedureName, 4);
  3769. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3770. Emit(Result(position,reg));
  3771. RestoreRegisters(saved);
  3772. br(label,reg,IntermediateCode.Immediate(int8,0));
  3773. ReleaseIntermediateOperand(reg);
  3774. END CompareString;
  3775. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3776. VAR
  3777. left,right: Operand;
  3778. leftSize, rightSize: IntermediateCode.Operand;
  3779. saved: RegisterEntry;
  3780. procedureName: SyntaxTree.IdentifierString;
  3781. BEGIN
  3782. procedureName := "CopyString";
  3783. SaveRegisters();ReleaseUsedRegisters(saved);
  3784. Designate(leftExpression,left);
  3785. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3786. Emit(Push(position,leftSize));
  3787. ReleaseIntermediateOperand(leftSize);
  3788. Emit(Push(position,left.op));
  3789. ReleaseOperand(left);
  3790. Designate(rightExpression,right);
  3791. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3792. Emit(Push(position,rightSize));
  3793. ReleaseIntermediateOperand(rightSize);
  3794. Emit(Push(position,right.op));
  3795. ReleaseOperand(right);
  3796. CallThis(position,builtinsModuleName,procedureName,4);
  3797. RestoreRegisters(saved);
  3798. END CopyString;
  3799. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3800. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3801. leftType,rightType: SyntaxTree.Type;
  3802. leftExpression,rightExpression : SyntaxTree.Expression;
  3803. componentType: IntermediateCode.Type;
  3804. exit: Label; dest: IntermediateCode.Operand;
  3805. size: LONGINT;
  3806. BEGIN
  3807. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3808. dest := destination; destination := emptyOperand;
  3809. leftType := x.left.type.resolved;
  3810. rightType := x.right.type.resolved;
  3811. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3812. CASE x.operator OF
  3813. Scanner.Or, Scanner.And, Scanner.Is:
  3814. result := ConditionValue(x);
  3815. |Scanner.Plus:
  3816. Evaluate(x.left,left);
  3817. Evaluate(x.right,right);
  3818. IF leftType IS SyntaxTree.SetType THEN
  3819. InitOperand(result,ModeValue);
  3820. Reuse2a(result.op,left.op,right.op,dest);
  3821. Emit(Or(position,result.op,left.op,right.op));
  3822. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3823. InitOperand(result,ModeValue);
  3824. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3825. Reuse2(result.tag,left.tag,right.tag);
  3826. Emit(Add(position,result.op,left.op,right.op));
  3827. Emit(Add(position,result.tag,left.tag,right.tag))
  3828. ELSE
  3829. InitOperand(result,ModeValue);
  3830. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3831. AddInt(result.op, left.op, right.op) ;
  3832. ELSE
  3833. *)
  3834. Reuse2a(result.op,left.op,right.op,dest);
  3835. Emit(Add(position,result.op,left.op,right.op));
  3836. (*
  3837. END;
  3838. *)
  3839. END;
  3840. ReleaseOperand(left); ReleaseOperand(right);
  3841. |Scanner.Minus:
  3842. Evaluate(x.left,left);
  3843. Evaluate(x.right,right);
  3844. IF leftType IS SyntaxTree.SetType THEN
  3845. InitOperand(result,ModeValue);
  3846. Reuse1(result.op,right.op);
  3847. Emit(Not(position,result.op,right.op));
  3848. ReleaseOperand(right);
  3849. Emit(And(position,result.op,result.op,left.op));
  3850. ReleaseOperand(left);
  3851. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3852. InitOperand(result,ModeValue);
  3853. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3854. Reuse2(result.tag,left.tag,right.tag);
  3855. Emit(Sub(position,result.op,left.op,right.op));
  3856. Emit(Sub(position,result.tag,left.tag,right.tag));
  3857. ReleaseOperand(left); ReleaseOperand(right)
  3858. ELSE
  3859. InitOperand(result,ModeValue);
  3860. Reuse2a(result.op,left.op,right.op,dest);
  3861. Emit(Sub(position,result.op,left.op,right.op));
  3862. ReleaseOperand(left); ReleaseOperand(right);
  3863. END;
  3864. |Scanner.Times:
  3865. Evaluate(x.left,left);
  3866. Evaluate(x.right,right);
  3867. IF leftType IS SyntaxTree.SetType THEN
  3868. InitOperand(result,ModeValue);
  3869. Reuse2a(result.op,left.op,right.op,dest);
  3870. Emit(And(position,result.op,left.op,right.op));
  3871. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3872. InitOperand(result, ModeValue);
  3873. componentType := left.op.type;
  3874. (* TODO: review this *)
  3875. (*
  3876. result.op = left.op * right.op - left.tag * right.tag
  3877. result.tag = left.tag * right.op + left.op * right.tag
  3878. *)
  3879. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3880. Emit(Mul(position,result.op, left.op, right.op));
  3881. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3882. Emit(Mul(position,tempReg, left.tag, right.tag));
  3883. Emit(Sub(position,result.op, result.op, tempReg));
  3884. Reuse2(result.tag, left.tag, right.op);
  3885. Emit(Mul(position,result.tag, left.tag, right.op));
  3886. Emit(Mul(position,tempReg, left.op, right.tag));
  3887. Emit(Add(position,result.tag, result.tag, tempReg));
  3888. ReleaseIntermediateOperand(tempReg)
  3889. ELSE
  3890. InitOperand(result,ModeValue);
  3891. Reuse2a(result.op,left.op,right.op,dest);
  3892. Emit(Mul(position,result.op,left.op,right.op));
  3893. END;
  3894. ReleaseOperand(left); ReleaseOperand(right);
  3895. |Scanner.Div:
  3896. Evaluate(x.left,left);
  3897. Evaluate(x.right,right);
  3898. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3899. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3900. IF ~isUnchecked THEN
  3901. exit := NewLabel();
  3902. BrltL(exit,zero,right.op);
  3903. EmitTrap(position,NegativeDivisorTrap);
  3904. SetLabel(exit);
  3905. END;
  3906. END;
  3907. InitOperand(result,ModeValue);
  3908. Reuse2a(result.op,left.op,right.op,dest);
  3909. Emit(Div(position,result.op,left.op,right.op));
  3910. ReleaseOperand(left); ReleaseOperand(right);
  3911. |Scanner.Mod:
  3912. Evaluate(x.left,left);
  3913. Evaluate(x.right,right);
  3914. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3915. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3916. IF ~isUnchecked THEN
  3917. exit := NewLabel();
  3918. BrltL(exit,zero,right.op);
  3919. EmitTrap(position,NegativeDivisorTrap);
  3920. SetLabel(exit);
  3921. END;
  3922. END;
  3923. InitOperand(result,ModeValue);
  3924. Reuse2a(result.op,left.op,right.op,dest);
  3925. Emit(Mod(position,result.op,left.op,right.op));
  3926. ReleaseOperand(left); ReleaseOperand(right);
  3927. |Scanner.Slash:
  3928. Evaluate(x.left,left);
  3929. Evaluate(x.right,right);
  3930. IF leftType IS SyntaxTree.SetType THEN
  3931. InitOperand(result,ModeValue);
  3932. Reuse2a(result.op,left.op,right.op,dest);
  3933. Emit(Xor(position,result.op,left.op,right.op));
  3934. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3935. InitOperand(result,ModeValue);
  3936. componentType := left.op.type;
  3937. (* review this *)
  3938. (*
  3939. divisor = right.op * right.op + right.tag * right.tag
  3940. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3941. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3942. *)
  3943. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3944. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3945. Emit(Mul(position,tempReg, right.op, right.op));
  3946. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3947. Emit(Add(position,tempReg, tempReg, tempReg2));
  3948. result.op := tempReg2;
  3949. Emit(Mul(position,result.op, left.op, right.op));
  3950. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3951. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3952. Emit(Add(position,result.op, result.op, tempReg2));
  3953. Emit(Div(position,result.op, result.op, tempReg));
  3954. Reuse2(result.tag, left.tag, right.op);
  3955. Emit(Mul(position,result.tag, left.tag, right.op));
  3956. Emit(Mul(position,tempReg2, left.op, right.tag));
  3957. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3958. Emit(Div(position,result.tag, result.tag, tempReg));
  3959. ReleaseIntermediateOperand(tempReg);
  3960. ReleaseIntermediateOperand(tempReg2)
  3961. ELSE
  3962. InitOperand(result,ModeValue);
  3963. Reuse2a(result.op,left.op,right.op,dest);
  3964. Emit(Div(position,result.op,left.op,right.op));
  3965. END;
  3966. ReleaseOperand(left); ReleaseOperand(right);
  3967. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3968. result := ConditionValue(x);
  3969. |Scanner.In:
  3970. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3971. Evaluate(x.left,left);
  3972. Evaluate(x.right,right);
  3973. Convert(left.op,setType);
  3974. Convert(right.op,setType);
  3975. ReuseCopy(temp.op,right.op);
  3976. Emit(Shr(position,temp.op,temp.op,left.op));
  3977. ReleaseOperand(right); ReleaseOperand(left);
  3978. IntermediateCode.InitImmediate(one,setType,1);
  3979. Emit(And(position,temp.op,temp.op,one));
  3980. Convert(temp.op,bool);
  3981. result.mode := ModeValue;
  3982. result.op := temp.op;
  3983. result.tag := nil; (* may be left over from calls to evaluate *)
  3984. ELSE
  3985. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3986. IF x.operator = Scanner.Questionmarks THEN
  3987. leftExpression := x.left;
  3988. rightExpression := x.right;
  3989. ELSE
  3990. leftExpression := x.right;
  3991. rightExpression := x.left;
  3992. END;
  3993. Evaluate(leftExpression, left);
  3994. Emit(Push(position,left.op));
  3995. ReleaseOperand(left);
  3996. Designate(rightExpression, right);
  3997. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3998. IF ~backend.cellsAreObjects THEN
  3999. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  4000. END;
  4001. Emit(Push(position,right.op));
  4002. ReleaseOperand(right);
  4003. IF backend.cellsAreObjects THEN
  4004. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  4005. ELSE
  4006. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  4007. END;
  4008. InitOperand(result, ModeValue);
  4009. result.op := NewRegisterOperand(bool);
  4010. Emit(Result(position,result.op));
  4011. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  4012. leftExpression := x.left;
  4013. rightExpression := x.right;
  4014. Evaluate(leftExpression, left);
  4015. Emit(Push(position,left.op));
  4016. ReleaseOperand(left);
  4017. Evaluate(rightExpression, right);
  4018. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4019. IF ~backend.cellsAreObjects THEN
  4020. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  4021. END;
  4022. Emit(Push(position,right.op));
  4023. ReleaseOperand(right);
  4024. IF backend.cellsAreObjects THEN
  4025. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  4026. ELSE
  4027. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  4028. END;
  4029. InitOperand(result, ModeValue);
  4030. result.op := NewRegisterOperand(bool);
  4031. Emit(Result(position,result.op));
  4032. ELSE
  4033. HALT(100);
  4034. END;
  4035. END;
  4036. destination := dest;
  4037. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  4038. END VisitBinaryExpression;
  4039. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  4040. VAR localResult, operand: Operand;
  4041. BEGIN
  4042. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  4043. InitOperand(localResult, ModeValue);
  4044. ASSERT(x.first # NIL);
  4045. Evaluate(x.first, operand);
  4046. localResult.op := operand.op;
  4047. ReleaseOperand(operand);
  4048. UseIntermediateOperand(localResult.op);
  4049. ASSERT(x.last # NIL);
  4050. Evaluate(x.last, operand);
  4051. localResult.tag := operand.op;
  4052. ReleaseOperand(operand);
  4053. UseIntermediateOperand(localResult.tag);
  4054. IF x.step # NIL THEN
  4055. Evaluate(x.step, operand);
  4056. localResult.extra := operand.op;
  4057. ReleaseOperand(operand);
  4058. UseIntermediateOperand(localResult.extra);
  4059. END;
  4060. result := localResult;
  4061. IF Trace THEN TraceExit("VisitRangeExpression") END
  4062. END VisitRangeExpression;
  4063. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  4064. BEGIN
  4065. HALT(100); (* should never be evaluated *)
  4066. END VisitTensorRangeExpression;
  4067. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  4068. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  4069. BEGIN
  4070. IF Trace THEN TraceEnter("VisitConversion") END;
  4071. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  4072. dest := destination; destination := emptyOperand;
  4073. Evaluate(x.expression,old);
  4074. InitOperand(result,ModeValue);
  4075. result.op := old.op;
  4076. ASSERT(result.op.mode # 0);
  4077. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  4078. (* convert TO a complex number *)
  4079. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  4080. Convert(result.op,IntermediateCode.GetType(system, componentType));
  4081. ASSERT(result.op.mode # 0);
  4082. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  4083. (* convert FROM a complex number TO a complex number*)
  4084. result.tag := old.tag;
  4085. ASSERT(result.tag.mode # 0);
  4086. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  4087. ASSERT(result.tag.mode # 0)
  4088. ELSE
  4089. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  4090. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  4091. END
  4092. ELSE
  4093. Convert(result.op,IntermediateCode.GetType(system,x.type));
  4094. ASSERT(result.op.mode # 0);
  4095. result.tag := old.tag; (*! probably never used *)
  4096. END;
  4097. destination := dest;
  4098. IF Trace THEN TraceExit("VisitConversion") END;
  4099. END VisitConversion;
  4100. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  4101. BEGIN
  4102. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  4103. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  4104. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  4105. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  4106. END VisitTypeDeclaration;
  4107. (** designators (expressions) *)
  4108. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  4109. VAR ownerType, designatorType: SyntaxTree.RecordType;
  4110. BEGIN
  4111. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  4112. IF x.left # NIL THEN Expression(x.left) END;
  4113. Symbol(x.symbol,result);
  4114. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  4115. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  4116. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  4117. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  4118. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  4119. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  4120. END;
  4121. END;
  4122. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  4123. END VisitSymbolDesignator;
  4124. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  4125. BEGIN
  4126. IF isUnchecked THEN RETURN END;
  4127. IF tagsAvailable THEN
  4128. TrapC(BrltL,index,length,IndexCheckTrap);
  4129. END;
  4130. END BoundCheck;
  4131. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  4132. VAR d: IntermediateCode.Operand;
  4133. BEGIN
  4134. IF isUnchecked THEN RETURN END;
  4135. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  4136. TrapC(op,dim,d,ArraySizeTrap);
  4137. ReleaseIntermediateOperand(d);
  4138. END DimensionCheck;
  4139. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  4140. VAR
  4141. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  4142. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  4143. expression: SyntaxTree.Expression;
  4144. resultingType, leftType, baseType: SyntaxTree.Type;
  4145. skipLabel1: Label;
  4146. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  4147. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  4148. variableOp: Operand;
  4149. variable: SyntaxTree.Variable;
  4150. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  4151. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  4152. VAR e: SyntaxTree.Expression; i: LONGINT;
  4153. BEGIN
  4154. tensorFound := FALSE;
  4155. FOR i := 0 TO parameters.Length()-1 DO
  4156. e := parameters.GetExpression(i);
  4157. IF e IS SyntaxTree.TensorRangeExpression THEN
  4158. ASSERT(~tensorFound);
  4159. tensorFound := TRUE;
  4160. ELSIF e IS SyntaxTree.RangeExpression THEN
  4161. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4162. ELSE
  4163. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4164. END;
  4165. END;
  4166. END CountIndices;
  4167. BEGIN
  4168. ASSERT(tagsAvailable);
  4169. resultingType := x.type.resolved; (* resulting type *)
  4170. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  4171. InitOperand(localResult, ModeReference);
  4172. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4173. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  4174. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  4175. (* a globally defined array destination tag is available -> use and invalidate it*)
  4176. localResult.tag := arrayDestinationTag;
  4177. IntermediateCode.InitOperand(arrayDestinationTag)
  4178. ELSE
  4179. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  4180. (* the result is of array range type and thus does not provide any collectable pointers *)
  4181. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  4182. Symbol(variable, variableOp);
  4183. ReuseCopy(localResult.tag, variableOp.op);
  4184. ReleaseOperand(variableOp);
  4185. END
  4186. END;
  4187. indexListSize := x.parameters.Length();
  4188. CountIndices(x.parameters);
  4189. (*ASSERT(tensorRangeCount <= 1);*)
  4190. (* designate the array to be indexed over, perform tensor range check if known *)
  4191. Designate(x.left, array);
  4192. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4193. Dereference(array, leftType,FALSE);
  4194. IF ~tensorFound THEN
  4195. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  4196. END
  4197. END;
  4198. (* default base offset *)
  4199. srcDimOffset := 0;
  4200. destDimOffset := 0;
  4201. indexDim := 0;
  4202. (* use address of source array as basis *)
  4203. localResult.op := array.op;
  4204. UseIntermediateOperand(localResult.op);
  4205. (* go through the index list *)
  4206. FOR i := 0 TO indexListSize - 1 DO
  4207. expression := x.parameters.GetExpression(i);
  4208. IF expression IS SyntaxTree.TensorRangeExpression THEN
  4209. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  4210. srcDimOffset := -indexListSize;
  4211. destDimOffset := -suffixRanges;
  4212. ELSE
  4213. (* determine which dimension of source array is currently looked at *)
  4214. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  4215. (* get the memory operand pointing to array descriptor dimension *)
  4216. GetMathArrayField(tmp, array.tag, MathDimOffset);
  4217. (* make a reusable register from it *)
  4218. ReuseCopy(srcDim, tmp);
  4219. ReleaseIntermediateOperand(tmp);
  4220. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  4221. ELSE
  4222. srcDim := IntermediateCode.Immediate(sizeType, i);
  4223. END;
  4224. (* get length and increment of source array for current dimension *)
  4225. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  4226. Convert(sourceLength.op, sizeType);
  4227. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  4228. Convert(sourceIncrement.op, sizeType);
  4229. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  4230. ReleaseIntermediateOperand(srcDim);
  4231. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  4232. (* SINGLE INDEX *)
  4233. Evaluate(expression, index);
  4234. ReleaseIntermediateOperand(index.tag);
  4235. index.tag := emptyOperand;
  4236. Convert(index.op, sizeType);
  4237. (* lower bound check *)
  4238. IF IsIntegerImmediate(index.op, staticIndex) THEN
  4239. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  4240. ELSIF isUnchecked THEN (* do nothing *)
  4241. ELSE
  4242. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4243. END;
  4244. (* upper bound check *)
  4245. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4246. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  4247. ELSIF isUnchecked THEN (* do nothing *)
  4248. ELSE
  4249. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  4250. END;
  4251. ReleaseOperand(sourceLength);
  4252. Convert(index.op, addressType);
  4253. summand := index.op;
  4254. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  4255. (* RANGE OF INDICES *)
  4256. Evaluate(expression, range);
  4257. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  4258. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  4259. stepSize := range.extra; UseIntermediateOperand(stepSize);
  4260. ReleaseOperand(range);
  4261. Convert(firstIndex, sizeType);
  4262. Convert(lastIndex, sizeType);
  4263. Convert(stepSize, sizeType);
  4264. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  4265. if it is 'MAX(LONGINT)' *)
  4266. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4267. TransferToRegister(lastIndex, lastIndex);
  4268. skipLabel1 := NewLabel();
  4269. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  4270. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  4271. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  4272. SetLabel(skipLabel1)
  4273. END;
  4274. (* check if step size is valid *)
  4275. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  4276. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  4277. ELSIF isUnchecked THEN (* do nothing *)
  4278. ELSE
  4279. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  4280. END;
  4281. (* check lower bound check *)
  4282. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  4283. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  4284. ELSIF isUnchecked THEN (* do nothing *)
  4285. ELSE
  4286. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4287. END;
  4288. (* check upper bound check *)
  4289. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4290. (* statically open range: nothing to do *)
  4291. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4292. ASSERT(staticLastIndex < staticSourceLength)
  4293. ELSIF isUnchecked THEN (* do nothing *)
  4294. ELSE
  4295. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  4296. END;
  4297. (* determine length of target array for current dimension *)
  4298. (* 1. incorporate last index: *)
  4299. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4300. (* last index is static *)
  4301. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4302. targetLength := sourceLength.op
  4303. ELSE
  4304. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  4305. END;
  4306. UseIntermediateOperand(targetLength);
  4307. ELSE
  4308. (* targetLength := lastIndex + 1
  4309. Reuse1(targetLength, lastIndex);
  4310. *)
  4311. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  4312. END;
  4313. ReleaseOperand(sourceLength);
  4314. ReleaseIntermediateOperand(lastIndex);
  4315. (* 2. incorporate first index: *)
  4316. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4317. (* first index and current target length are static *)
  4318. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  4319. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  4320. (* first index = 0: nothing to do *)
  4321. ELSE
  4322. (* targetLength := targetLength - firstIndex *)
  4323. TransferToRegister(targetLength, targetLength);
  4324. Emit(Sub(position,targetLength, targetLength, firstIndex))
  4325. END;
  4326. (* clip negative lengths to 0 *)
  4327. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4328. IF staticTargetLength < 0 THEN
  4329. targetLength := IntermediateCode.Immediate(sizeType, 0)
  4330. END
  4331. ELSE
  4332. skipLabel1 := NewLabel();
  4333. TransferToRegister(targetLength, targetLength);
  4334. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  4335. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  4336. SetLabel(skipLabel1)
  4337. END;
  4338. (* 3. incorporate index step size: *)
  4339. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4340. (*step size and current target length are static *)
  4341. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  4342. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  4343. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4344. (* step size = 1: nothing to do *)
  4345. ELSE
  4346. (* emit code for this:
  4347. targetLength := (targetLength-1) DIV stepSize +1;
  4348. *)
  4349. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  4350. DivInt(targetLength, targetLength, stepSize);
  4351. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  4352. END;
  4353. (* determine increment of target array for current dimension *)
  4354. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  4355. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  4356. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4357. (* step size = 1 *)
  4358. targetIncrement := sourceIncrement.op;
  4359. UseIntermediateOperand(targetIncrement)
  4360. ELSE
  4361. (* targetIncrement := sourceIncrement * stepSize *)
  4362. Reuse1(targetIncrement, stepSize);
  4363. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  4364. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  4365. END;
  4366. ReleaseIntermediateOperand(stepSize);
  4367. (* write length and increment of target array to descriptor *)
  4368. IF destDimOffset < 0 THEN
  4369. (* determine which dimension of target array is currently looked at *)
  4370. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  4371. TransferToRegister(destDim, tmp);
  4372. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  4373. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  4374. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  4375. ReleaseIntermediateOperand(destDim);
  4376. INC(destDimOffset);
  4377. ELSE
  4378. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  4379. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  4380. END;
  4381. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  4382. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  4383. INC(indexDim);
  4384. Convert(firstIndex, addressType);
  4385. TransferToRegister(summand, firstIndex);
  4386. ELSE HALT(100);
  4387. END;
  4388. (*
  4389. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  4390. *)
  4391. Convert(sourceIncrement.op, addressType);
  4392. Convert(summand, addressType);
  4393. MulInt(summand, summand, sourceIncrement.op);
  4394. ReleaseIntermediateOperand(sourceIncrement.op);
  4395. AddInt(localResult.op, localResult.op, summand);
  4396. ReleaseIntermediateOperand(summand);
  4397. END
  4398. END;
  4399. result := localResult;
  4400. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4401. ReleaseIntermediateOperand(result.tag);
  4402. result.tag := TypeDescriptorAdr(resultingType);
  4403. ELSIF IsDelegate(resultingType) THEN
  4404. ReleaseIntermediateOperand(result.tag);
  4405. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4406. UseIntermediateOperand(result.tag);
  4407. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4408. ReleaseIntermediateOperand(result.tag);
  4409. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4410. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4411. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4412. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4413. (* finalize target array descriptor *)
  4414. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4415. (* write lengths and increments of target array for remaining dimensions *)
  4416. i := indexListSize;
  4417. WHILE indexDim < targetArrayDimensionality DO
  4418. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4419. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4420. ReleaseOperand(sourceLength);
  4421. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4422. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4423. ReleaseOperand(sourceIncrement);
  4424. INC(i); INC(indexDim);
  4425. END;
  4426. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4427. tmp := nil;
  4428. ELSE
  4429. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4430. END;
  4431. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4432. ReleaseIntermediateOperand(tmp);
  4433. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4434. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4435. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4436. ELSE
  4437. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4438. END;
  4439. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4440. ReleaseIntermediateOperand(tmp);
  4441. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4442. (* write dimensionality *)
  4443. IF targetArrayDimensionality # 0 THEN
  4444. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4445. END;
  4446. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4447. END;
  4448. ReleaseOperand(array);
  4449. END MathIndexDesignator;
  4450. (* get the length of an array , trying to make use of static information *)
  4451. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4452. VAR res: IntermediateCode.Operand; size: LONGINT;
  4453. BEGIN
  4454. type := type.resolved;
  4455. IF type IS SyntaxTree.ArrayType THEN
  4456. WITH type: SyntaxTree.ArrayType DO
  4457. IF type.form = SyntaxTree.Static THEN
  4458. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4459. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4460. Evaluate(type.length, op);
  4461. ReleaseIntermediateOperand(op.tag);
  4462. RETURN op.op;*)
  4463. ELSE
  4464. res := tag;
  4465. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4466. IntermediateCode.MakeMemory(res,addressType);
  4467. UseIntermediateOperand(res);
  4468. RETURN res
  4469. END
  4470. END;
  4471. ELSE
  4472. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4473. RETURN IntermediateCode.Immediate(addressType,size);
  4474. END;
  4475. END ArrayLength;
  4476. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4477. BEGIN
  4478. IF IsImmediate(x) THEN
  4479. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4480. ELSE
  4481. IF ~ReusableRegister(res) THEN
  4482. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4483. ELSE
  4484. UseIntermediateOperand(res);
  4485. END;
  4486. Emit(Mov(position,res,x))
  4487. END;
  4488. END CopyInt;
  4489. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4490. BEGIN
  4491. ReleaseIntermediateOperand(res);
  4492. IF IsImmediate(x) & IsImmediate(y) THEN
  4493. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4494. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4495. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4496. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4497. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4498. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4499. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4500. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4501. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4502. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4503. UseIntermediateOperand(res);
  4504. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4505. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4506. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4507. UseIntermediateOperand(res);
  4508. ELSE
  4509. IF ~ReusableRegister(res) THEN
  4510. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4511. ELSE
  4512. UseIntermediateOperand(res);
  4513. END;
  4514. IF IsImmediate(x) & (x.intValue = 0) THEN
  4515. Emit(Mov(position,res,y))
  4516. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4517. Emit(Mov(position,res,x))
  4518. ELSE
  4519. Emit(Add(position,res, x, y));
  4520. END;
  4521. END;
  4522. END AddInt;
  4523. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4524. BEGIN
  4525. ReleaseIntermediateOperand(res);
  4526. IF IsImmediate(x) & IsImmediate(y) THEN
  4527. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4528. ELSE
  4529. IF ~ReusableRegister(res) THEN
  4530. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4531. ELSE UseIntermediateOperand(res);
  4532. END;
  4533. IF IsImmediate(x) & (x.intValue = 1) THEN
  4534. Emit(Mov(position,res,y))
  4535. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4536. Emit(Mov(position,res,x))
  4537. ELSE
  4538. Emit(Mul(position,res, x, y));
  4539. END;
  4540. END;
  4541. END MulInt;
  4542. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4543. BEGIN
  4544. ReleaseIntermediateOperand(res);
  4545. IF IsImmediate(x) & IsImmediate(y) THEN
  4546. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4547. ELSE
  4548. IF ~ReusableRegister(res) THEN
  4549. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4550. ELSE UseIntermediateOperand(res);
  4551. END;
  4552. IF IsImmediate(x) & (x.intValue = 1) THEN
  4553. Emit(Mov(position,res,y))
  4554. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4555. Emit(Mov(position,res,x))
  4556. ELSE
  4557. Emit(Div(position,res, x, y));
  4558. END;
  4559. END;
  4560. END DivInt;
  4561. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4562. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4563. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4564. BEGIN
  4565. type := x.left.type.resolved;
  4566. IF type IS SyntaxTree.StringType THEN
  4567. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4568. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4569. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4570. type := atype;
  4571. x.left.SetType(type);
  4572. END;
  4573. IntermediateCode.InitImmediate(res,addressType,0);
  4574. maxDim := x.parameters.Length()-1;
  4575. (*
  4576. computation rule:
  4577. a: ARRAY X,Y,Z OF Element with size S
  4578. a[i,j,k] -->
  4579. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4580. *)
  4581. FOR i := 0 TO maxDim DO
  4582. e := x.parameters.GetExpression(i);
  4583. Evaluate(e,index);
  4584. Convert(index.op,addressType);
  4585. AddInt(res, res, index.op);
  4586. IF i = 0 THEN
  4587. (*
  4588. ReuseCopy(res, index.op);
  4589. *)
  4590. Designate(x.left,array);
  4591. type := x.left.type.resolved;
  4592. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4593. Dereference(array, type, FALSE);
  4594. END;
  4595. (*
  4596. ELSE AddInt(res, res, index.op);
  4597. *)
  4598. END;
  4599. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4600. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4601. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4602. BoundCheck(index.op, length);
  4603. END;
  4604. ReleaseIntermediateOperand(length);
  4605. END;
  4606. ReleaseOperand(index);
  4607. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4608. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4609. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4610. MulInt(res,res,length);
  4611. END;
  4612. ReleaseIntermediateOperand(length);
  4613. END;
  4614. (* remaining open dimensions -- compute address *)
  4615. i := maxDim+1;
  4616. IF type IS SyntaxTree.ArrayType THEN
  4617. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4618. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4619. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4620. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4621. MulInt(res,res,length);
  4622. END;
  4623. ReleaseIntermediateOperand(length);
  4624. INC(i);
  4625. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4626. END;
  4627. END;
  4628. IF (type IS SyntaxTree.ArrayType) THEN
  4629. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4630. size := StaticSize(system, type);
  4631. IF size # 1 THEN
  4632. length := IntermediateCode.Immediate(addressType,size);
  4633. MulInt(res,res,length);
  4634. END;
  4635. ELSE
  4636. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4637. IF size # 1 THEN
  4638. length := IntermediateCode.Immediate(addressType,size);
  4639. MulInt(res,res,length);
  4640. END;
  4641. END;
  4642. END;
  4643. AddInt(res,res,array.op);
  4644. InitOperand(result,ModeReference);
  4645. result.op := res;
  4646. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4647. ReleaseIntermediateOperand(result.tag);
  4648. result.tag := TypeDescriptorAdr(type);
  4649. ELSIF IsDelegate(type) THEN
  4650. ReleaseIntermediateOperand(result.tag);
  4651. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4652. UseIntermediateOperand(result.tag);
  4653. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4654. ReleaseIntermediateOperand(result.tag);
  4655. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4656. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4657. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4658. END;
  4659. ReleaseOperand(array);
  4660. END IndexDesignator;
  4661. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4662. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4663. BEGIN
  4664. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4665. dest := destination; destination := emptyOperand;
  4666. type := x.left.type.resolved;
  4667. IF type IS SyntaxTree.MathArrayType THEN
  4668. MathIndexDesignator(x);
  4669. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4670. IndexDesignator(x);
  4671. END;
  4672. destination := dest;
  4673. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4674. END VisitIndexDesignator;
  4675. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4676. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4677. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4678. procedure: SyntaxTree.Procedure;
  4679. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4680. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4681. BEGIN
  4682. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4683. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4684. parameters := expression.parameters;
  4685. moduleName := "FoxArrayBase";
  4686. procedureName := "CopyDescriptor";
  4687. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4688. SaveRegisters();ReleaseUsedRegisters(saved);
  4689. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4690. IF procedure = NIL THEN
  4691. s := "procedure ";
  4692. Strings.Append(s,moduleName);
  4693. Strings.Append(s,".");
  4694. Strings.Append(s,procedureName);
  4695. Strings.Append(s," not present");
  4696. Error(position,s);
  4697. ELSE
  4698. (* push address of temporary variable *)
  4699. Symbol(variable,destOperand);
  4700. Emit(Push(position,destOperand.op));
  4701. ReleaseOperand(destOperand);
  4702. (* push src *)
  4703. Evaluate(expression.left,srcOperand);
  4704. (*
  4705. Dereference(srcOperand,expression.type.resolved);
  4706. Emit(Push(position,srcOperand.tag));
  4707. *)
  4708. Emit(Push(position,srcOperand.op));
  4709. ReleaseOperand(srcOperand);
  4710. tensorFound := FALSE;
  4711. FOR i := 0 TO parameters.Length()-1 DO
  4712. e := parameters.GetExpression(i);
  4713. IF e IS SyntaxTree.TensorRangeExpression THEN
  4714. tensorFound := TRUE;
  4715. ELSIF e IS SyntaxTree.RangeExpression THEN
  4716. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4717. ELSE
  4718. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4719. END;
  4720. END;
  4721. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4722. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4723. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4724. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4725. StaticCallOperand(procOp,procedure);
  4726. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4727. ReleaseOperand(procOp);
  4728. END;
  4729. RestoreRegisters(saved);
  4730. END;
  4731. RETURN variable
  4732. END PrepareTensorDescriptor;
  4733. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4734. VAR
  4735. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4736. operand, tmpOperand, variableOp, variable2Op: Operand;
  4737. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4738. variable, variable2: SyntaxTree.Variable;
  4739. dim, i, size: LONGINT;
  4740. (* TODO: needed? *)
  4741. oldArrayDestinationTag: IntermediateCode.Operand;
  4742. oldArrayDestinationDimension: LONGINT;
  4743. position: Position;
  4744. saved: RegisterEntry;
  4745. arrayFlags: SET;
  4746. m, n: LONGINT;
  4747. PROCEDURE Pass(op: IntermediateCode.Operand);
  4748. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4749. BEGIN
  4750. IF register >= 0 THEN
  4751. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4752. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4753. Emit(Mov(position,parameterRegister, op));
  4754. ELSE
  4755. Emit(Push(position,op))
  4756. END
  4757. END Pass;
  4758. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4759. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4760. BEGIN
  4761. formalType := formalType.resolved; actualType := actualType.resolved;
  4762. IF IsOpenArray(formalType)THEN
  4763. IF actualType IS SyntaxTree.StringType THEN
  4764. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4765. RETURN;
  4766. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4767. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4768. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4769. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4770. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4771. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4772. ELSE
  4773. tmp := baseReg;
  4774. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4775. IntermediateCode.MakeMemory(tmp,addressType);
  4776. Pass((tmp));
  4777. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4778. END;
  4779. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4780. END;
  4781. END PushArrayLens;
  4782. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4783. BEGIN
  4784. CASE size OF
  4785. |2: INCL(flags,Size2Flag);
  4786. |3: INCL(flags,Size3Flag);
  4787. |4: INCL(flags,Size4Flag);
  4788. |5: INCL(flags,Size5Flag);
  4789. |6: INCL(flags,Size6Flag);
  4790. |7: INCL(flags,Size7Flag);
  4791. |8: INCL(flags,Size8Flag);
  4792. END;
  4793. END SetSmallArraySizeFlag;
  4794. BEGIN
  4795. IF Trace THEN TraceEnter("PushParameter") END;
  4796. position := expression.position;
  4797. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4798. type := expression.type.resolved;
  4799. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4800. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4801. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4802. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4803. );
  4804. (* TODO: needed? *)
  4805. oldArrayDestinationTag := arrayDestinationTag;
  4806. oldArrayDestinationDimension := arrayDestinationDimension;
  4807. IF IsArrayOfSystemByte(parameter.type) THEN
  4808. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4809. Designate(expression,operand);
  4810. ELSE
  4811. Evaluate(expression, tmpOperand);
  4812. (* array of system byte does not provide any pointers *)
  4813. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4814. Symbol(variable, operand);
  4815. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4816. Emit(Mov(position,tmp, tmpOperand.op));
  4817. ReleaseOperand(tmpOperand);
  4818. END;
  4819. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4820. ReleaseIntermediateOperand(operand.tag);
  4821. operand.tag := tmp;
  4822. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4823. Pass((operand.tag));
  4824. END;
  4825. Pass((operand.op));
  4826. ELSIF IsOpenArray(parameter.type) THEN
  4827. Designate(expression,operand);
  4828. baseReg := operand.tag;
  4829. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4830. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4831. END;
  4832. Pass((operand.op)); (* address of the array *)
  4833. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4834. (* case 1
  4835. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4836. *)
  4837. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4838. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4839. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4840. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4841. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4842. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4843. arrayDestinationTag := sp;
  4844. (* case 1b
  4845. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4846. *)
  4847. IF expression IS SyntaxTree.IndexDesignator THEN
  4848. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4849. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4850. arrayDestinationDimension := dim;
  4851. Designate(expression,operand);
  4852. (* case 1a
  4853. P(...,A,...) push: push array descriptor to stack
  4854. *)
  4855. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4856. Designate(expression,operand);
  4857. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4858. i := 0;
  4859. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4860. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4861. INC(i);
  4862. END;
  4863. type := expression.type.resolved;
  4864. WHILE (i<dim) DO (* remaining static dimensions *)
  4865. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4866. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4867. ReleaseOperand(tmpOperand);
  4868. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4869. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4870. ReleaseOperand(tmpOperand);
  4871. INC(i);
  4872. END;
  4873. dimOp := IntermediateCode.Immediate(addressType,dim);
  4874. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4875. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4876. (* case 1d
  4877. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4878. + case 1e
  4879. P(.. PT() ... );
  4880. *)
  4881. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4882. Designate(expression,operand);
  4883. Dereference(operand,type.resolved,FALSE);
  4884. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4885. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4886. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4887. (* case 1f
  4888. P(...,S,...) push: create array descriptor to S on stack
  4889. case 1g
  4890. P(... PS()...)
  4891. *)
  4892. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4893. Designate(expression,operand);
  4894. FOR i := 0 TO dim-1 DO
  4895. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4896. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4897. ReleaseOperand(tmpOperand);
  4898. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4899. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4900. ReleaseOperand(tmpOperand);
  4901. END;
  4902. (*******
  4903. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4904. *)
  4905. arrayFlags := {StaticFlag};
  4906. IF dim = 1 THEN
  4907. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4908. ReleaseOperand(tmpOperand);
  4909. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4910. m := LONGINT(tmpOperand.op.intValue);
  4911. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4912. ELSIF dim = 2 THEN
  4913. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4914. ReleaseOperand(tmpOperand);
  4915. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4916. m := LONGINT(tmpOperand.op.intValue);
  4917. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4918. ReleaseOperand(tmpOperand);
  4919. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4920. n := LONGINT(tmpOperand.op.intValue);
  4921. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4922. INCL(arrayFlags,SmallMatrixFlag);
  4923. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4924. END;
  4925. END;
  4926. (*******)
  4927. dimOp := IntermediateCode.Immediate(addressType,dim);
  4928. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4929. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4930. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4931. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4932. baseType := SemanticChecker.ArrayBase(type,dim);
  4933. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4934. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4935. ELSE HALT(100);
  4936. END;
  4937. (* case 2
  4938. procedure P([left args], var A: array [*,*] of Type, [right args])
  4939. *)
  4940. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4941. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4942. (* case 2b
  4943. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4944. push: push reference to pushed array descriptor
  4945. post: remove array descriptor.
  4946. *)
  4947. IF expression IS SyntaxTree.IndexDesignator THEN
  4948. descriptorType := GetMathArrayDescriptorType(dim);
  4949. (* range type : no allocation possible, should be untraced *)
  4950. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4951. Symbol(variable,variableOp);
  4952. arrayDestinationTag := variableOp.op;
  4953. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4954. arrayDestinationDimension := dim;
  4955. NeedDescriptor := TRUE;
  4956. Designate(expression,operand);
  4957. Pass((operand.tag));
  4958. NeedDescriptor := FALSE;
  4959. (* case 2a
  4960. P(...,A,...)
  4961. push: push reference to array descriptor on stack
  4962. *)
  4963. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4964. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4965. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4966. INC(i);
  4967. END;
  4968. IF i = dim THEN
  4969. Designate(expression,operand);
  4970. Pass((operand.tag));
  4971. ELSE (* open-static *)
  4972. type := expression.type.resolved;
  4973. descriptorType := GetMathArrayDescriptorType(dim);
  4974. (* static array , cannot be reallocated, untraced !*)
  4975. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4976. Symbol(variable,variableOp);
  4977. arrayDestinationTag := variableOp.op;
  4978. Designate(expression,operand);
  4979. FOR i := 0 TO dim-1 DO
  4980. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4981. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4982. ReleaseOperand(tmpOperand);
  4983. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4984. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4985. ReleaseOperand(tmpOperand);
  4986. END;
  4987. dimOp := IntermediateCode.Immediate(addressType,dim);
  4988. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4989. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4990. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4991. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4992. baseType := SemanticChecker.ArrayBase(type,dim);
  4993. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4994. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4995. Pass((arrayDestinationTag));
  4996. END;
  4997. (* case 2d
  4998. P(...,T,...) push: emit dimension check, push T
  4999. *)
  5000. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5001. Designate(expression,operand);
  5002. Dereference(operand,type.resolved,FALSE);
  5003. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  5004. Pass((operand.tag));
  5005. (* case 2f
  5006. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  5007. push: push reference to pushed array descriptor
  5008. post: remove array descriptor
  5009. *)
  5010. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5011. descriptorType := GetMathArrayDescriptorType(dim);
  5012. (* static array -- cannot be reallocatated, untraced *)
  5013. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5014. Symbol(variable,variableOp);
  5015. arrayDestinationTag := variableOp.op;
  5016. Designate(expression,operand);
  5017. FOR i := 0 TO dim-1 DO
  5018. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5019. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5020. ReleaseOperand(tmpOperand);
  5021. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5022. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5023. ReleaseOperand(tmpOperand);
  5024. END;
  5025. (*
  5026. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  5027. *)
  5028. arrayFlags := {StaticFlag};
  5029. IF dim = 1 THEN
  5030. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5031. ReleaseOperand(tmpOperand);
  5032. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5033. m := LONGINT(tmpOperand.op.intValue);
  5034. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  5035. ELSIF dim = 2 THEN
  5036. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5037. ReleaseOperand(tmpOperand);
  5038. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5039. m := LONGINT(tmpOperand.op.intValue);
  5040. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  5041. ReleaseOperand(tmpOperand);
  5042. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5043. n := LONGINT(tmpOperand.op.intValue);
  5044. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  5045. INCL(arrayFlags,SmallMatrixFlag);
  5046. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  5047. END;
  5048. END;
  5049. (*******)
  5050. dimOp := IntermediateCode.Immediate(addressType,dim);
  5051. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5052. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5053. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5054. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  5055. baseType := SemanticChecker.ArrayBase(type,dim);
  5056. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5057. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5058. Pass((arrayDestinationTag));
  5059. ELSE HALT(100);
  5060. END;
  5061. (* case 3
  5062. procedure P([left args], [const] A: array [?] of Type, [right args])
  5063. *)
  5064. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  5065. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5066. (* case 3b
  5067. P(...,A[a..b,c..d],...)
  5068. *)
  5069. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5070. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5071. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5072. Symbol(variable,variableOp);
  5073. LoadValue(variableOp,system.addressType);
  5074. ELSE
  5075. descriptorType := GetMathArrayDescriptorType(dim);
  5076. (* range -- cannot be reallocated *)
  5077. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5078. Symbol(variable,variableOp);
  5079. END;
  5080. arrayDestinationTag := variableOp.op;
  5081. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5082. arrayDestinationDimension := 0;
  5083. Designate(expression,operand);
  5084. Pass((operand.tag));
  5085. (* case 3a
  5086. P(...,A,...)
  5087. *)
  5088. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5089. i := 0;
  5090. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5091. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5092. INC(i);
  5093. END;
  5094. IF i = dim THEN
  5095. Designate(expression,operand);
  5096. Pass((operand.tag));
  5097. ELSE (* open-static *)
  5098. type := expression.type.resolved;
  5099. descriptorType := GetMathArrayDescriptorType(dim);
  5100. (* static array -- cannot be reallocated -- no pointer to be traced *)
  5101. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5102. Symbol(variable,variableOp);
  5103. arrayDestinationTag := variableOp.op;
  5104. Designate(expression,operand);
  5105. FOR i := 0 TO dim-1 DO
  5106. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5107. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5108. ReleaseOperand(tmpOperand);
  5109. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5110. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5111. ReleaseOperand(tmpOperand);
  5112. END;
  5113. dimOp := IntermediateCode.Immediate(addressType,dim);
  5114. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5115. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5116. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5117. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  5118. baseType := SemanticChecker.ArrayBase(type,dim);
  5119. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5120. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5121. Pass((arrayDestinationTag));
  5122. END;
  5123. (* case 3d
  5124. P(...,T,...)
  5125. case 3e
  5126. P(...,PT(...),...)
  5127. *)
  5128. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5129. Designate(expression,operand);
  5130. Dereference(operand,type.resolved,FALSE);
  5131. Pass((operand.tag));
  5132. (* case 3f
  5133. P(...,S,...)
  5134. case 3g
  5135. P(...,PS(...),...)
  5136. *)
  5137. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5138. descriptorType := GetMathArrayDescriptorType(dim);
  5139. (* static array does not need to be traced *)
  5140. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5141. Symbol(variable,variableOp);
  5142. arrayDestinationTag := variableOp.op;
  5143. Designate(expression,operand);
  5144. IF operand.op.type.length >1 THEN (* vector register *)
  5145. (* static array does not need to be traced *)
  5146. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  5147. Symbol(variable2, variable2Op);
  5148. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  5149. Emit(Mov(position,tmp, operand.op));
  5150. ReleaseOperand(operand);
  5151. Symbol(variable2, operand);
  5152. END;
  5153. FOR i := 0 TO dim-1 DO
  5154. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5155. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5156. ReleaseOperand(tmpOperand);
  5157. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5158. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5159. ReleaseOperand(tmpOperand);
  5160. END;
  5161. dimOp := IntermediateCode.Immediate(addressType,dim);
  5162. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5163. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5164. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5165. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5166. baseType := SemanticChecker.ArrayBase(type,dim);
  5167. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5168. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5169. Pass((arrayDestinationTag));
  5170. ELSE HALT(100);
  5171. END;
  5172. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  5173. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5174. (* case 4b
  5175. P(...,A[a..b,c..d],...)
  5176. *)
  5177. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5178. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5179. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5180. Symbol(variable,variableOp);
  5181. LoadValue(variableOp,system.addressType);
  5182. ELSE
  5183. descriptorType := GetMathArrayDescriptorType(dim);
  5184. (* range array -- cannot be allocated *)
  5185. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5186. Symbol(variable,variableOp);
  5187. END;
  5188. arrayDestinationTag := variableOp.op;
  5189. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5190. arrayDestinationDimension := 0;
  5191. Designate(expression,operand);
  5192. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5193. Symbol(variable,variableOp);
  5194. ELSE
  5195. (* alias to range -- untraced *)
  5196. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5197. Symbol(variable,variableOp);
  5198. MakeMemory(tmp,variableOp.op,addressType,0);
  5199. Emit(Mov(position,tmp,operand.tag));
  5200. ReleaseIntermediateOperand(tmp);
  5201. END;
  5202. Pass((variableOp.op));
  5203. ReleaseOperand(variableOp);
  5204. (* case 4a
  5205. P(...,A,...)
  5206. *)
  5207. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5208. i := 0;
  5209. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5210. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5211. INC(i);
  5212. END;
  5213. IF i = dim THEN
  5214. Designate(expression,operand);
  5215. arrayDestinationTag := operand.tag;
  5216. ELSE (* open-static *)
  5217. type := expression.type.resolved;
  5218. descriptorType := GetMathArrayDescriptorType(dim);
  5219. (* static array -- untraced *)
  5220. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5221. Symbol(variable,variableOp);
  5222. arrayDestinationTag := variableOp.op;
  5223. Designate(expression,operand);
  5224. FOR i := 0 TO dim-1 DO
  5225. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5226. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5227. ReleaseOperand(tmpOperand);
  5228. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5229. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5230. ReleaseOperand(tmpOperand);
  5231. END;
  5232. dimOp := IntermediateCode.Immediate(addressType,dim);
  5233. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5234. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5235. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5236. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  5237. baseType := SemanticChecker.ArrayBase(type,dim);
  5238. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5239. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5240. END;
  5241. (* tensor alias to open array -- untraced *)
  5242. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5243. Symbol(variable,variableOp);
  5244. MakeMemory(tmp,variableOp.op,addressType,0);
  5245. Emit(Mov(position,tmp,arrayDestinationTag));
  5246. ReleaseIntermediateOperand(tmp);
  5247. Pass((variableOp.op));
  5248. ReleaseOperand(variableOp);
  5249. (* case 4d
  5250. P(...,T,...)
  5251. *)
  5252. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5253. Designate(expression,operand);
  5254. Pass((operand.op));
  5255. (* case 4f
  5256. P(...,S,...)
  5257. *)
  5258. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5259. descriptorType := GetMathArrayDescriptorType(dim);
  5260. (* static array -- cannot be reallocated, untraced *)
  5261. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5262. Symbol(variable,variableOp);
  5263. arrayDestinationTag := variableOp.op;
  5264. Designate(expression,operand);
  5265. FOR i := 0 TO dim-1 DO
  5266. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5267. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5268. ReleaseOperand(tmpOperand);
  5269. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5270. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5271. ReleaseOperand(tmpOperand);
  5272. END;
  5273. dimOp := IntermediateCode.Immediate(addressType,dim);
  5274. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5275. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5276. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5277. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5278. baseType := SemanticChecker.ArrayBase(type,dim);
  5279. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5280. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5281. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5282. Symbol(variable,variableOp);
  5283. MakeMemory(tmp,variableOp.op,addressType,0);
  5284. Emit(Mov(position,tmp,arrayDestinationTag));
  5285. ReleaseIntermediateOperand(tmp);
  5286. Pass((variableOp.op));
  5287. ReleaseOperand(variableOp);
  5288. ELSE HALT(100);
  5289. END;
  5290. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  5291. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  5292. Designate(expression,operand);
  5293. IF operand.op.type.length > 1 THEN
  5294. Emit(Push(position, operand.op));
  5295. ELSE
  5296. size := system.SizeOf(type);
  5297. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  5298. size := ToMemoryUnits(system,size);
  5299. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5300. arrayDestinationTag := sp;
  5301. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  5302. END;
  5303. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  5304. Designate(expression,operand);
  5305. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  5306. (* static array no pointer *)
  5307. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5308. Symbol(variable,variableOp);
  5309. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  5310. Emit(Mov(position,tmp,operand.op));
  5311. Emit(Push(position,variableOp.op));
  5312. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5313. Pass((operand.op));
  5314. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  5315. END;
  5316. ELSE HALT(200)
  5317. END;
  5318. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  5319. IF parameter.kind = SyntaxTree.VarParameter THEN
  5320. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  5321. Designate(expression, operand);
  5322. Pass((operand.op));
  5323. ELSE
  5324. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5325. Evaluate(expression, operand);
  5326. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  5327. Pass((operand.extra)); (* step *)
  5328. Pass((operand.tag)); (* last *)
  5329. Pass((operand.op)); (* first *)
  5330. ELSE
  5331. (* pass range as structure in order to comply with the variable alignment of its components *)
  5332. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5333. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  5334. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5335. tmp := sp;
  5336. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5337. Emit(Mov(position,tmp,operand.op)); (* first *)
  5338. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  5339. IntermediateCode.AddOffset(tmp,size);
  5340. Emit(Mov(position,tmp,operand.tag)); (* last *)
  5341. IntermediateCode.AddOffset(tmp,size);
  5342. Emit(Mov(position,tmp,operand.extra)); (* step *)
  5343. END;
  5344. END
  5345. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  5346. IF parameter.kind = SyntaxTree.VarParameter THEN
  5347. Designate(expression, operand);
  5348. Pass((operand.op));
  5349. ELSE
  5350. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5351. Evaluate(expression, operand);
  5352. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  5353. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  5354. Pass((operand.tag)); (* imaginary part *)
  5355. Pass((operand.op)) (* real part *)
  5356. ELSE
  5357. (* pass complex as structure in order to comply with the variable alignment of its components *)
  5358. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5359. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  5360. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5361. tmp := sp;
  5362. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5363. Emit(Mov(position,tmp,operand.op)); (* real part *)
  5364. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  5365. IntermediateCode.AddOffset(tmp,size);
  5366. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  5367. END
  5368. END
  5369. ELSE
  5370. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5371. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  5372. Designate(expression,operand);
  5373. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  5374. (* stack allocation *)
  5375. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  5376. (*! parameter alignment to be discussed ... *)
  5377. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  5378. size := type(SyntaxTree.StringType).length;
  5379. END;
  5380. IF backend.cooperative & parameter.NeedsTrace() THEN
  5381. dst := NewRegisterOperand (addressType);
  5382. Emit(Mov(position,dst, sp));
  5383. IntermediateCode.InitImmediate(null, byteType, 0);
  5384. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  5385. ReleaseIntermediateOperand(dst);
  5386. SaveRegisters();ReleaseUsedRegisters(saved);
  5387. (* register dst has been freed before SaveRegisters already *)
  5388. CallAssignMethod(dst, operand.op, parameter.type);
  5389. RestoreRegisters(saved);
  5390. END;
  5391. IF operand.op.type.length > 1 THEN (* vector *)
  5392. MakeMemory(tmp,sp,operand.op.type,0);
  5393. Emit(Mov(position, tmp, operand.op));
  5394. ELSE
  5395. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5396. END;
  5397. ELSIF IsOpenArray(parameter.type) THEN
  5398. Designate(expression,operand);
  5399. baseReg := operand.tag;
  5400. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5401. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5402. END;
  5403. Pass((operand.op)); (* address of the array *)
  5404. ELSIF IsDelegate(parameter.type) THEN
  5405. Evaluate(expression,operand);
  5406. IF backend.cooperative & parameter.NeedsTrace() THEN
  5407. Emit(Push(position, nil));
  5408. dst := NewRegisterOperand (addressType);
  5409. Emit(Mov(position,dst, sp));
  5410. ReleaseIntermediateOperand(dst);
  5411. SaveRegisters();ReleaseUsedRegisters(saved);
  5412. Emit(Push(position, dst));
  5413. (* register dst has been freed before SaveRegisters already *)
  5414. Emit(Push(position, operand.tag));
  5415. CallThis(position,"GarbageCollector","Assign",2);
  5416. RestoreRegisters(saved);
  5417. ELSE
  5418. Pass((operand.tag));
  5419. END;
  5420. Pass((operand.op));
  5421. ELSE
  5422. Evaluate(expression,operand);
  5423. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5424. Emit(Push(position, nil));
  5425. dst := NewRegisterOperand (addressType);
  5426. Emit(Mov(position,dst, sp));
  5427. ReleaseIntermediateOperand(dst);
  5428. SaveRegisters();ReleaseUsedRegisters(saved);
  5429. Emit(Push(position, dst));
  5430. (* register dst has been freed before SaveRegisters already *)
  5431. Emit(Push(position, operand.op));
  5432. CallThis(position,"GarbageCollector","Assign",2);
  5433. RestoreRegisters(saved);
  5434. ELSE
  5435. Pass((operand.op));
  5436. END;
  5437. END;
  5438. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5439. Evaluate(expression,operand);
  5440. Pass((operand.op));
  5441. ELSE (* var parameter *)
  5442. Designate(expression,operand);
  5443. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5444. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5445. Pass((operand.tag));
  5446. END;
  5447. END;
  5448. Pass((operand.op));
  5449. END;
  5450. END;
  5451. (* TODO: needed? *)
  5452. arrayDestinationTag := oldArrayDestinationTag;
  5453. arrayDestinationDimension := oldArrayDestinationDimension;
  5454. IF needsParameterBackup THEN
  5455. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5456. ReuseCopy(parameterBackup, operand.op)
  5457. END;
  5458. ReleaseOperand(operand);
  5459. IF Trace THEN TraceExit("PushParameter") END;
  5460. END PushParameter;
  5461. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5462. BEGIN
  5463. 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
  5464. Expression(x.result); (* use register *)
  5465. END;
  5466. Statement(x.statement);
  5467. IF x.result # NIL THEN Expression(x.result) END;
  5468. 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
  5469. ReleaseIntermediateOperand(result.op);
  5470. END;
  5471. END VisitStatementDesignator;
  5472. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5473. VAR
  5474. procedure: SyntaxTree.Procedure;
  5475. procedureType: SyntaxTree.ProcedureType;
  5476. wasInline: BOOLEAN;
  5477. actualParameters: SyntaxTree.ExpressionList;
  5478. formalParameter: SyntaxTree.Parameter;
  5479. actualParameter: SyntaxTree.Expression;
  5480. i: LONGINT;
  5481. localVariable: SyntaxTree.Variable;
  5482. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5483. src, dest: Operand;
  5484. prevInlineExit : Label;
  5485. prevMapper: SymbolMapper;
  5486. tooComplex: BOOLEAN;
  5487. resultDesignator: SyntaxTree.Expression;
  5488. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5489. BEGIN
  5490. IF e = NIL THEN RETURN TRUE
  5491. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5492. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5493. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5494. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5495. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5496. ELSE RETURN FALSE
  5497. END;
  5498. END SimpleExpression;
  5499. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5500. BEGIN
  5501. RETURN checker.CanPassInRegister(type)
  5502. END FitsInRegister;
  5503. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5504. VAR
  5505. variable: SyntaxTree.Variable;
  5506. variableDesignator: SyntaxTree.Designator;
  5507. BEGIN
  5508. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5509. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5510. variableDesignator.SetType(type);
  5511. RETURN variableDesignator
  5512. END GetTemp;
  5513. BEGIN
  5514. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5515. wasInline := currentIsInline;
  5516. prevInlineExit := currentInlineExit;
  5517. prevMapper := currentMapper;
  5518. currentInlineExit := NewLabel();
  5519. tooComplex := FALSE;
  5520. NEW(currentMapper);
  5521. currentIsInline := TRUE;
  5522. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5523. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5524. formalParameter := procedureType.firstParameter;
  5525. actualParameters := x.parameters;
  5526. i := 0;
  5527. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5528. actualParameter := actualParameters.GetExpression(i);
  5529. IF actualParameter.resolved # NIL THEN
  5530. actualParameter := actualParameter.resolved
  5531. END;
  5532. (*
  5533. if expression is simple and can be passed immediately
  5534. or if type fits in register then we can proceed
  5535. otherwise we escape to ordinary procedure call.
  5536. *)
  5537. (* cases where the expression can be mapped identically *)
  5538. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5539. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5540. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5541. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5542. (*
  5543. Assign(variableDesignator, actualParameter);
  5544. *)
  5545. Evaluate(actualParameter, src);
  5546. Designate(variableDesignator, dest);
  5547. Emit(Mov(x.position, dest.op, src.op));
  5548. ReleaseOperand(dest);
  5549. ReleaseOperand(src);
  5550. (* the src operand should now have been completely released ! *)
  5551. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5552. ELSE tooComplex := TRUE
  5553. END;
  5554. (*
  5555. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5556. currentMapper.Add(formalParameter, actualParameter, NIL);
  5557. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5558. variableDesignator := GetTemp(system.addressType, FALSE);
  5559. Designate(actualParameter, src);
  5560. Designate(variableDesignator, dest);
  5561. IntermediateCode.MakeMemory(dest.op,addressType);
  5562. Emit(Mov(x.position, dest.op, src.op));
  5563. ReleaseOperand(dest);
  5564. IF src.tag.mode # IntermediateCode.Undefined THEN
  5565. tagDesignator := GetTemp(system.addressType, FALSE);
  5566. Designate(tagDesignator, dest);
  5567. IntermediateCode.MakeMemory(dest.op,addressType);
  5568. Emit(Mov(x.position, dest.op, src.op));
  5569. END;
  5570. ReleaseOperand(dest); ReleaseOperand(src);
  5571. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5572. END;
  5573. *)
  5574. formalParameter := formalParameter.nextParameter;
  5575. INC(i);
  5576. END;
  5577. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5578. IF resultDesignator # NIL THEN
  5579. returnDesignator := resultDesignator
  5580. ELSE
  5581. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5582. END;
  5583. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5584. END;
  5585. localVariable := procedure.procedureScope.firstVariable;
  5586. WHILE ~tooComplex & (localVariable # NIL) DO
  5587. variableDesignator := GetTemp(localVariable.type, FALSE);
  5588. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5589. localVariable := localVariable.nextVariable;
  5590. END;
  5591. IF ~tooComplex THEN
  5592. VisitStatementBlock(procedure.procedureScope.body);
  5593. SetLabel(currentInlineExit);
  5594. IF procedureType.returnType # NIL THEN
  5595. Designate(returnDesignator, result);
  5596. END;
  5597. END;
  5598. currentMapper := prevMapper;
  5599. currentInlineExit := prevInlineExit;
  5600. currentIsInline := wasInline;
  5601. RETURN ~tooComplex
  5602. END InlineProcedureCall;
  5603. PROCEDURE VisitInlineCallDesignator*(x: SyntaxTree.InlineCallDesignator);
  5604. BEGIN
  5605. VisitStatementBlock(x.block);
  5606. END VisitInlineCallDesignator;
  5607. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5608. VAR
  5609. parameters: SyntaxTree.ExpressionList;
  5610. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5611. procedureType: SyntaxTree.ProcedureType;
  5612. formalParameter: SyntaxTree.Parameter;
  5613. operand: Operand;
  5614. reg, size, mask, dest: IntermediateCode.Operand;
  5615. saved,saved2: RegisterEntry;
  5616. symbol: SyntaxTree.Symbol;
  5617. variable: SyntaxTree.Variable;
  5618. i, parametersSize : LONGINT;
  5619. structuredReturnType: BOOLEAN;
  5620. gap, alignment: LONGINT; (*fld*)
  5621. return: IntermediateCode.Operand;
  5622. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5623. arg: IntermediateCode.Operand;
  5624. dummy: IntermediateCode.Operand;
  5625. recordType: SyntaxTree.RecordType;
  5626. operatorSelectionProcedureOperand: Operand;
  5627. operatorSelectionProcedure: SyntaxTree.Procedure;
  5628. fingerprint: SyntaxTree.Fingerprint;
  5629. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5630. identifierNumber: LONGINT;
  5631. parameterRegisters: SIZE;
  5632. registers: ARRAY 64 OF WORD;
  5633. procedure: SyntaxTree.Procedure;
  5634. callingConvention: SyntaxTree.CallingConvention;
  5635. type: IntermediateCode.Type;
  5636. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5637. (** do preparations before parameter push for array-structured object types (ASOTs):
  5638. if ASOT is passed as VAR parameter:
  5639. - allocate temporary variable of math array type
  5640. - copy contents of ASOT to be passed to temporary variable
  5641. - use temporary variable as the actual parameter instead
  5642. - 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)
  5643. **)
  5644. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5645. VAR
  5646. expression, left: SyntaxTree.Expression; tempVariableDesignator : SyntaxTree.Designator;
  5647. BEGIN
  5648. IF (formalParameter.kind = SyntaxTree.VarParameter) & SemanticChecker.IsIndexOperator(actualParameter) THEN
  5649. WITH actualParameter: SyntaxTree.ProcedureCallDesignator DO
  5650. (* prepare writeback for any other "normal" indexer *)
  5651. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5652. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5653. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5654. Assign(tempVariableDesignator, actualParameter);
  5655. IF firstWriteBackCall = NIL THEN
  5656. NEW(firstWriteBackCall);
  5657. currentWriteBackCall := firstWriteBackCall
  5658. ELSE
  5659. ASSERT(currentWriteBackCall # NIL);
  5660. NEW(currentWriteBackCall.next);
  5661. currentWriteBackCall := currentWriteBackCall.next
  5662. END;
  5663. (* a [^] . P[] ()*)
  5664. left := actualParameter.left; (* procedure call designator --> procedure call *)
  5665. left := left(SyntaxTree.Designator).left; (* procedure call --> caller object *)
  5666. IF left IS SyntaxTree.DereferenceDesignator THEN (* dereference, if required *)
  5667. left := left(SyntaxTree.Designator).left;
  5668. END;
  5669. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, left, 0, actualParameter.parameters, tempVariableDesignator);
  5670. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5671. END;
  5672. actualParameter := tempVariableDesignator;
  5673. END
  5674. END PrepareParameter;
  5675. BEGIN
  5676. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5677. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5678. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5679. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5680. IF InlineProcedureCall(x) THEN
  5681. RETURN
  5682. ELSE
  5683. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5684. END
  5685. END;
  5686. END;
  5687. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5688. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5689. callingConvention := procedureType.callingConvention;
  5690. dest := destination; destination := emptyOperand;
  5691. SaveRegisters();ReleaseUsedRegisters(saved);
  5692. parameters := x.parameters;
  5693. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5694. (* an operator is called *)
  5695. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5696. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5697. (* check if a dynamic operator call should be performed *)
  5698. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5699. ELSE
  5700. isCallOfDynamicOperator := FALSE
  5701. END;
  5702. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5703. Emit(Push(position, ap));
  5704. END;
  5705. alignment := procedureType.stackAlignment;
  5706. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5707. alignment := 16 (* bytes *);
  5708. END;
  5709. IF alignment > 1 THEN
  5710. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5711. Emit(Mov(position,reg, sp));
  5712. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5713. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5714. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5715. gap := 4*ToMemoryUnits(system,system.addressSize);
  5716. END;
  5717. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5718. backend.ResetParameterRegisters();
  5719. formalParameter := procedureType.firstParameter;
  5720. FOR i := 0 TO parameters.Length()-1 DO
  5721. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5722. type := addressType;
  5723. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5724. type := addressType;
  5725. ELSE
  5726. type := GetType(system, formalParameter.type);
  5727. END;
  5728. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5729. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5730. END;
  5731. formalParameter := formalParameter.nextParameter;
  5732. END;
  5733. IF gap < 0 THEN
  5734. gap := 0
  5735. END;
  5736. ELSE
  5737. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5738. END;
  5739. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5740. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5741. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5742. Emit(And(position,sp, sp, mask));
  5743. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5744. Emit(Push(position,reg));
  5745. ReleaseIntermediateOperand(reg);
  5746. END;
  5747. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5748. (* align stack to 16-byte boundary *)
  5749. IntermediateCode.InitImmediate(mask,addressType,-16);
  5750. Emit(And(position,sp, sp, mask));
  5751. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5752. IF gap # 0 THEN
  5753. IntermediateCode.InitImmediate(size,addressType,gap);
  5754. Emit(Sub(position,sp,sp,size))
  5755. END;
  5756. END;
  5757. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5758. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5759. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5760. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5761. ELSE
  5762. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5763. END;
  5764. IF procedureType.selfParameter # NIL THEN (* type bound procedure in a record *)
  5765. Designate(x.left(SyntaxTree.Designator).left, operand);
  5766. Emit(Push(position, operand.tag));
  5767. Emit(Push(position, operand.op));
  5768. Symbol(symbol, operand);
  5769. LoadValue(operand, symbol.type);
  5770. (*
  5771. PushParameter(x.left(SyntaxTree.Designator).left, procedureType.selfParameter, callingConvention, FALSE, dummy,-1);
  5772. Evaluate(x.left, operand);
  5773. *)
  5774. ELSE
  5775. Evaluate(x.left, operand);
  5776. IF symbol IS SyntaxTree.Procedure THEN
  5777. IF (procedureType.selfParameter # NIL) THEN
  5778. Emit(Push(position,operand.tag));
  5779. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5780. Emit(Push(position,operand.tag));
  5781. ELSIF (procedureType.isDelegate) THEN
  5782. Emit(Push(position,operand.tag));
  5783. END;
  5784. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5785. IF (procedureType.selfParameter # NIL) THEN
  5786. Emit(Push(position,operand.tag));
  5787. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5788. Emit(Push(position,operand.tag));
  5789. END;
  5790. ELSE HALT(200);
  5791. END;
  5792. END;
  5793. ReleaseIntermediateOperand(operand.tag);
  5794. operand.tag := emptyOperand;
  5795. (* determine if a structured return type is needed *)
  5796. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5797. IF structuredReturnType THEN
  5798. IF resultDesignator # NIL THEN
  5799. d := resultDesignator;
  5800. ELSE
  5801. (* temporary result that might be allocated, must potentially be traced *)
  5802. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5803. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5804. d.SetType(variable.type);
  5805. END;
  5806. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5807. Designate(d,returnValue);
  5808. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5809. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5810. Emit(Push(position,size));
  5811. Emit(Push(position,returnValue.op));
  5812. ReleaseOperand(returnValue);
  5813. ELSE*)
  5814. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5815. (*
  5816. END;
  5817. *)
  5818. END;
  5819. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5820. parameterRegisters := 0;
  5821. backend.ResetParameterRegisters();
  5822. formalParameter := procedureType.firstParameter;
  5823. FOR i := 0 TO parameters.Length()-1 DO
  5824. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5825. type := addressType;
  5826. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5827. type := addressType;
  5828. ELSE
  5829. type := GetType(system, formalParameter.type);
  5830. END;
  5831. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5832. INC(parameterRegisters);
  5833. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5834. Error(actualParameter.position,"cannot be passed by register")
  5835. END;
  5836. ELSE
  5837. registers[i] := -1;
  5838. END;
  5839. formalParameter := formalParameter.nextParameter;
  5840. END;
  5841. formalParameter := procedureType.lastParameter;
  5842. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5843. actualParameter := parameters.GetExpression(i);
  5844. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5845. formalParameter := formalParameter.prevParameter;
  5846. END;
  5847. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5848. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5849. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5850. END;
  5851. ELSE
  5852. hasDynamicOperands := FALSE;
  5853. formalParameter := procedureType.firstParameter;
  5854. FOR i := 0 TO parameters.Length() - 1 DO
  5855. actualParameter := parameters.GetExpression(i);
  5856. PrepareParameter(actualParameter, formalParameter);
  5857. IF formalParameter # NIL THEN (* TENTATIVE *)
  5858. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5859. ASSERT(i < 2);
  5860. hasDynamicOperands := TRUE;
  5861. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5862. ELSE
  5863. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5864. END;
  5865. formalParameter := formalParameter.nextParameter;
  5866. END;
  5867. END;
  5868. END;
  5869. IF symbol IS SyntaxTree.Procedure THEN
  5870. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5871. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5872. Emit(Push(position,reg));
  5873. ReleaseIntermediateOperand(reg);
  5874. END;
  5875. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5876. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5877. parametersSize := ParametersSize(system,procedureType, FALSE);
  5878. END;
  5879. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5880. (*
  5881. dynamic operator overloading:
  5882. first push parameters, regularly:
  5883. [self]
  5884. par1
  5885. par2
  5886. then push parameters for GetOperator
  5887. identifier
  5888. ptr1
  5889. tag
  5890. ptr2
  5891. tag
  5892. call GetOperatorRuntimeProc
  5893. call Operator
  5894. *)
  5895. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5896. (* push ID *)
  5897. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5898. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5899. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5900. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5901. formalParameter := procedureType.firstParameter;
  5902. FOR i := 0 TO parameters.Length() - 1 DO
  5903. IF formalParameter.access # SyntaxTree.Hidden THEN
  5904. ASSERT(i < 2);
  5905. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5906. (* push pointer *)
  5907. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5908. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5909. (* add dereference *)
  5910. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5911. (*! better: do refer to stack above than using parameter backups !!*)
  5912. ReleaseIntermediateOperand(parameterBackups[i]);
  5913. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5914. END;
  5915. Emit(Push(position,parameterBackups[i]));
  5916. ReleaseIntermediateOperand(parameterBackups[i]);
  5917. (* push typetag *)
  5918. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5919. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5920. arg := TypeDescriptorAdr(recordType);
  5921. Emit(Push(position,arg));
  5922. ELSE
  5923. (* push 'NonPointer' *)
  5924. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5925. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5926. (* push fingerprint *)
  5927. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5928. fingerprint := fingerprinter.TypeFP(formalParameter.type.resolved);
  5929. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.hugeintType), fingerprint.public))) (* TODO: push the type's fingerprint *)
  5930. END
  5931. END;
  5932. formalParameter := formalParameter.nextParameter
  5933. END;
  5934. (* for unary operators: complete the information for the second parameter *)
  5935. IF procedureType.numberParameters < 2 THEN
  5936. (* push 'NonPointer' *)
  5937. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5938. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5939. (* push 'NoType' *)
  5940. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5941. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5942. END;
  5943. (* call operator selection procedure *)
  5944. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5945. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5946. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5947. ReleaseOperand(operatorSelectionProcedureOperand);
  5948. (* use the address that the operator selection procedure returned as the target address of the call *)
  5949. InitOperand(operand, ModeValue);
  5950. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5951. Emit(Result(position,operand.op))
  5952. END
  5953. END;
  5954. ReleaseParameterRegisters();
  5955. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5956. SaveRegisters();ReleaseUsedRegisters(saved2);
  5957. CallThis(position,"Objects","LeaveA2",0);
  5958. RestoreRegisters(saved2);
  5959. END;
  5960. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5961. Emit(Call(position,operand.op,0));
  5962. ELSE
  5963. Emit(Call(position,operand.op,parametersSize));
  5964. END;
  5965. ReleaseOperand(operand);
  5966. IF procedureType.noReturn THEN
  5967. EmitTrap(position,NoReturnTrap);
  5968. END;
  5969. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5970. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5971. Emit(Result(position,return));
  5972. END;
  5973. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5974. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5975. Emit(Push(position, return));
  5976. CallThis(position,"Objects","ReenterA2",0);
  5977. Emit(Pop(position, return));
  5978. ELSE
  5979. CallThis(position,"Objects","ReenterA2",0);
  5980. END;
  5981. END;
  5982. (* === return parameter space === *)
  5983. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5984. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5985. (* cleanup all space for all parameters *)
  5986. IF parametersSize < 32 THEN
  5987. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5988. parametersSize := 32
  5989. END;
  5990. size := IntermediateCode.Immediate(addressType,parametersSize);
  5991. Emit(Add(position,sp,sp,size))
  5992. END;
  5993. IF (callingConvention IN SysvABI) THEN
  5994. IF parameterRegisters > 0 THEN
  5995. IF parameters.Length() > parameterRegisters THEN
  5996. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5997. ELSE
  5998. parametersSize := 0
  5999. END;
  6000. ELSE
  6001. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  6002. INC( parametersSize, (-parametersSize) MOD 16 )
  6003. END;
  6004. IF parametersSize > 0 THEN
  6005. size := IntermediateCode.Immediate(addressType,parametersSize);
  6006. Emit(Add(position,sp,sp,size))
  6007. END;
  6008. END;
  6009. IF alignment > 1 THEN
  6010. Emit(Pop(position,sp));
  6011. END;
  6012. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  6013. Emit(Pop(position, ap));
  6014. END;
  6015. IF firstWriteBackCall # NIL THEN
  6016. SaveRegisters(); ReleaseUsedRegisters(saved2);
  6017. (* perform all write-back calls in the list *)
  6018. currentWriteBackCall := firstWriteBackCall;
  6019. WHILE currentWriteBackCall # NIL DO
  6020. VisitProcedureCallDesignator(currentWriteBackCall.call);
  6021. currentWriteBackCall := currentWriteBackCall.next
  6022. END;
  6023. RestoreRegisters(saved2);
  6024. END;
  6025. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  6026. IF structuredReturnType THEN
  6027. RestoreRegisters(saved);
  6028. InitOperand(result,ModeReference);
  6029. Symbol(variable,result);
  6030. ELSE
  6031. RestoreRegisters(saved);
  6032. InitOperand(result,ModeValue);
  6033. result.op := return;
  6034. END;
  6035. END;
  6036. destination := dest;
  6037. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  6038. END VisitProcedureCallDesignator;
  6039. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  6040. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  6041. td: SyntaxTree.Symbol;
  6042. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  6043. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6044. BEGIN
  6045. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6046. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6047. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6048. variable.SetType(system.anyType);
  6049. scope.AddVariable(variable);
  6050. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6051. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  6052. typeDeclaration.SetDeclaredType(hiddenPointerType);
  6053. typeDeclaration.SetScope(module.module.moduleScope);
  6054. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  6055. hiddenPointerType.SetState(SyntaxTree.Resolved);
  6056. END;
  6057. RETURN hiddenPointerType;
  6058. END GetHiddenPointerType;
  6059. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  6060. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6061. BEGIN
  6062. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6063. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6064. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  6065. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  6066. scope.AddVariable(variable);
  6067. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6068. variable.SetType(system.anyType);
  6069. scope.AddVariable(variable);
  6070. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6071. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  6072. typeDeclaration.SetDeclaredType(delegatePointerType);
  6073. typeDeclaration.SetScope(module.module.moduleScope);
  6074. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  6075. delegatePointerType.SetState(SyntaxTree.Resolved);
  6076. END;
  6077. RETURN delegatePointerType
  6078. END GetDelegateType;
  6079. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  6080. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  6081. such as in VAR a: RECORD ... END;
  6082. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  6083. and variables, constants and procedures the same mechanism can be used for fixups etc.
  6084. *)
  6085. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  6086. baseRecord: SyntaxTree.RecordType;
  6087. BEGIN (* no code emission *)
  6088. source := NIL;
  6089. x := x.resolved;
  6090. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  6091. x := GetHiddenPointerType();
  6092. ELSIF IsDelegate(x) THEN
  6093. x := GetDelegateType();
  6094. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  6095. ELSE HALT(200);
  6096. END;
  6097. td := x.typeDeclaration;
  6098. IF td = NIL THEN
  6099. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  6100. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  6101. ASSERT(td # NIL);
  6102. END;
  6103. GetCodeSectionNameForSymbol(td,name);
  6104. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  6105. meta.CheckTypeDeclaration(x);
  6106. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  6107. ELSE
  6108. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  6109. END;
  6110. IF backend.cooperative OR meta.simple THEN
  6111. offset := 0;
  6112. ELSE
  6113. IF x IS SyntaxTree.CellType THEN
  6114. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  6115. IF baseRecord = NIL THEN
  6116. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  6117. ELSE
  6118. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  6119. END;
  6120. ELSE
  6121. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  6122. END;
  6123. END;
  6124. RETURN td
  6125. END GetBackendType;
  6126. BEGIN
  6127. (*td := t.typeDeclaration;*)
  6128. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  6129. (*
  6130. IF t IS SyntaxTree.PointerType THEN
  6131. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  6132. ELSE
  6133. source := GetBackendType(t);
  6134. END;
  6135. *)
  6136. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  6137. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  6138. IntermediateCode.SetOffset(res,offset);
  6139. (*
  6140. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  6141. make memory should be used when tag is used, not earlier
  6142. *)
  6143. RETURN res
  6144. END TypeDescriptorAdr;
  6145. (*
  6146. PROCEDURE MakeTypeTag(VAR operand: Operand);
  6147. VAR result: IntermediateCode.Operand;
  6148. BEGIN
  6149. IF operand.tag.mode = IntermediateCode.Undefined THEN
  6150. operand.tag := TypeDescriptorAdr(operand.type);
  6151. IntermediateCode.MakeMemory(operand.tag,addressType);
  6152. UseIntermediateOperand(operand.tag);
  6153. END;
  6154. END MakeTypeTag;
  6155. *)
  6156. PROCEDURE ProfilerInit;
  6157. VAR reg: IntermediateCode.Operand;
  6158. BEGIN
  6159. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  6160. Emit(Call(position,reg,0));
  6161. END ProfilerInit;
  6162. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  6163. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  6164. BEGIN
  6165. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  6166. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  6167. THEN
  6168. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6169. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6170. Emit(Push(position,reg));
  6171. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6172. Emit(Push(position,reg));
  6173. StaticCallOperand(result,procedure);
  6174. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6175. ReleaseOperand(result);
  6176. END;
  6177. END ProfilerEnterExit;
  6178. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  6179. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  6180. BEGIN
  6181. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  6182. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6183. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6184. profileInit.Emit(Push(position,reg));
  6185. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6186. profileInit.Emit(Push(position,reg));
  6187. NEW(string, LEN(name)); COPY(name, string^);
  6188. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6189. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6190. sv.SetType(type);
  6191. Designate(sv,result);
  6192. profileInit.Emit(Push(position,result.tag));
  6193. profileInit.Emit(Push(position,result.op));
  6194. StaticCallOperand(result,procedure);
  6195. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6196. ReleaseOperand(result);
  6197. END;
  6198. END ProfilerAddProcedure;
  6199. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  6200. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  6201. BEGIN
  6202. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  6203. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6204. profileInit.Emit(Push(position,reg));
  6205. profileInitPatchPosition := profileInit.pc;
  6206. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  6207. NEW(string, LEN(name)); COPY(name, string^);
  6208. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  6209. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6210. sv.SetType(type);
  6211. Designate(sv,result);
  6212. profileInit.Emit(Push(position,result.tag));
  6213. profileInit.Emit(Push(position,result.op));
  6214. StaticCallOperand(result,procedure);
  6215. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6216. ReleaseOperand(result);
  6217. END;
  6218. END ProfilerAddModule;
  6219. PROCEDURE ProfilerPatchInit;
  6220. VAR reg: IntermediateCode.Operand;
  6221. BEGIN
  6222. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  6223. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  6224. EmitLeave(profileInit,position,NIL,0);
  6225. profileInit.Emit(Exit(position,0,0,0));
  6226. END ProfilerPatchInit;
  6227. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  6228. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  6229. VAR
  6230. id: LONGINT;
  6231. leftType, rightType: SyntaxTree.Type;
  6232. procedureType: SyntaxTree.ProcedureType;
  6233. runtimeProcedure: SyntaxTree.Procedure;
  6234. runtimeProcedureOperand, operatorOperand: Operand;
  6235. kind: SET;
  6236. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  6237. VAR
  6238. arg: IntermediateCode.Operand;
  6239. recordType: SyntaxTree.RecordType;
  6240. fingerprint: SyntaxTree.Fingerprint;
  6241. BEGIN
  6242. IF type = NIL THEN
  6243. (* no type: push 'NoType' *)
  6244. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6245. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  6246. ELSIF IsStrictlyPointerToRecord(type) THEN
  6247. (* pointer to record type: push typetag *)
  6248. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6249. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6250. arg := TypeDescriptorAdr(recordType);
  6251. ELSE
  6252. (* non-pointer to record type: push fingerprint *)
  6253. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6254. fingerprint := fingerprinter.TypeFP(type.resolved);
  6255. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.hugeintType), fingerprint.public)
  6256. END;
  6257. operatorInitializationCodeSection.Emit(Push(position,arg))
  6258. END PushTypeInfo;
  6259. BEGIN
  6260. ASSERT(operatorInitializationCodeSection # NIL);
  6261. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  6262. procedureType := operator.type(SyntaxTree.ProcedureType);
  6263. (* determine types *)
  6264. leftType := procedureType.firstParameter.type;
  6265. IF procedureType.numberParameters = 2 THEN
  6266. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  6267. rightType := procedureType.firstParameter.nextParameter.type;
  6268. ELSE
  6269. rightType := NIL
  6270. END;
  6271. (* determine operator kind *)
  6272. IF IsStrictlyPointerToRecord(leftType) THEN
  6273. kind := {LhsIsPointer}
  6274. ELSE
  6275. kind := {}
  6276. END;
  6277. IF IsStrictlyPointerToRecord(rightType) THEN
  6278. kind := kind + {RhsIsPointer}
  6279. END;
  6280. IF kind # {} THEN (* TODO: to be removed later on *)
  6281. (* at least one of the types is a pointer to record *)
  6282. (* emit a code that registers this specific operator in the runtime *)
  6283. dump := operatorInitializationCodeSection.comments;
  6284. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6285. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  6286. (* push ID *)
  6287. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6288. id := Global.GetSymbol(module.module.case, operator.name);
  6289. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  6290. (* push kind *)
  6291. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6292. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  6293. (* push type infos *)
  6294. PushTypeInfo(leftType);
  6295. PushTypeInfo(rightType);
  6296. (* push operator address *)
  6297. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6298. StaticCallOperand(operatorOperand, operator);
  6299. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  6300. ReleaseOperand(operatorOperand);
  6301. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  6302. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  6303. ReleaseOperand(runtimeProcedureOperand)
  6304. END
  6305. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  6306. END
  6307. END RegisterDynamicOperator;
  6308. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  6309. VAR
  6310. traceModule: SyntaxTree.Module;
  6311. procedure: SyntaxTree.Procedure;
  6312. procedureVariable: SyntaxTree.Variable;
  6313. s,msg: Basic.MessageString;
  6314. res: Operand;
  6315. i: LONGINT;
  6316. sv: SyntaxTree.StringValue;
  6317. type: SyntaxTree.Type;
  6318. recordType: SyntaxTree.RecordType;
  6319. printout: Printout.Printer;
  6320. stringWriter: Streams.StringWriter;
  6321. expression: SyntaxTree.Expression;
  6322. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  6323. BEGIN
  6324. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  6325. IF procedure = NIL THEN
  6326. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  6327. END;
  6328. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  6329. s := "procedure ";
  6330. Strings.Append(s,backend.traceModuleName);
  6331. Strings.Append(s,".");
  6332. Strings.Append(s,procedureName);
  6333. Strings.Append(s," not present");
  6334. Error(position,s);
  6335. RETURN FALSE
  6336. ELSE
  6337. RETURN TRUE
  6338. END;
  6339. END GetProcedure;
  6340. PROCEDURE CallProcedure;
  6341. VAR size: LONGINT;
  6342. BEGIN
  6343. IF procedure # NIL THEN
  6344. StaticCallOperand(result,procedure);
  6345. size := ProcParametersSize(procedure);
  6346. ELSE
  6347. Symbol(procedureVariable, result);
  6348. LoadValue(result, procedureVariable.type.resolved);
  6349. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6350. END;
  6351. Emit(Call(position,result.op,size));
  6352. END CallProcedure;
  6353. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6354. VAR res: Operand; string: SyntaxTree.String;
  6355. BEGIN
  6356. IF GetProcedure("String") THEN
  6357. NEW(string, LEN(s)); COPY(s, string^);
  6358. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6359. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6360. sv.SetType(type);
  6361. Designate(sv,res);
  6362. Emit(Push(position,res.tag));
  6363. Emit(Push(position,res.op));
  6364. ReleaseOperand(res);
  6365. CallProcedure;
  6366. END;
  6367. END String;
  6368. PROCEDURE Integer(op: IntermediateCode.Operand);
  6369. BEGIN
  6370. IF GetProcedure("Int") THEN
  6371. Emit(Push(position,op));
  6372. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6373. CallProcedure;
  6374. END;
  6375. END Integer;
  6376. PROCEDURE Float(op: IntermediateCode.Operand);
  6377. BEGIN
  6378. IF GetProcedure("HIntHex") THEN
  6379. Emit(Push(position,op));
  6380. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6381. CallProcedure;
  6382. END;
  6383. END Float;
  6384. PROCEDURE Set(op: IntermediateCode.Operand);
  6385. BEGIN
  6386. IF GetProcedure("Set") THEN
  6387. Emit(Push(position,op));
  6388. (*
  6389. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6390. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6391. *)
  6392. CallProcedure;
  6393. END;
  6394. END Set;
  6395. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6396. BEGIN
  6397. IF GetProcedure("Boolean") THEN
  6398. Emit(Push(position,op));
  6399. CallProcedure;
  6400. END;
  6401. END Boolean;
  6402. PROCEDURE Char(op: IntermediateCode.Operand);
  6403. BEGIN
  6404. IF GetProcedure("Char") THEN
  6405. Emit(Push(position,op));
  6406. CallProcedure;
  6407. END;
  6408. END Char;
  6409. PROCEDURE Address(op: IntermediateCode.Operand);
  6410. BEGIN
  6411. IF GetProcedure("Address") THEN
  6412. Emit(Push(position,op));
  6413. CallProcedure;
  6414. END;
  6415. END Address;
  6416. PROCEDURE Size(op: IntermediateCode.Operand);
  6417. BEGIN
  6418. IF GetProcedure("Size") THEN
  6419. Emit(Push(position,op));
  6420. CallProcedure;
  6421. END;
  6422. END Size;
  6423. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6424. VAR len: IntermediateCode.Operand;
  6425. BEGIN
  6426. IF GetProcedure("String") THEN
  6427. len := GetArrayLength(type, op.tag);
  6428. Emit(Push(position,len));
  6429. ReleaseIntermediateOperand(len);
  6430. Emit(Push(position,op.op));
  6431. CallProcedure;
  6432. END;
  6433. END StringOperand;
  6434. PROCEDURE Ln;
  6435. BEGIN
  6436. IF GetProcedure("Ln") THEN
  6437. CallProcedure;
  6438. END;
  6439. END Ln;
  6440. BEGIN
  6441. IF backend.traceModuleName = "" THEN RETURN END;
  6442. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6443. IF GetProcedure("Enter") THEN
  6444. CallProcedure
  6445. END;
  6446. NEW(stringWriter,LEN(s));
  6447. FOR i := 0 TO x.Length()-1 DO
  6448. msg := "";
  6449. expression := x.GetExpression(i);
  6450. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6451. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6452. ELSE
  6453. Global.GetModuleName(module.module, s);
  6454. END;
  6455. IF i = 0 THEN
  6456. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6457. stringWriter.String(":");
  6458. END;
  6459. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6460. IF ~(expression IS SyntaxTree.StringValue) THEN
  6461. printout.Expression(expression);
  6462. stringWriter.Get(s);
  6463. Strings.Append(msg,s);
  6464. Strings.Append(msg,"= ");
  6465. ELSE stringWriter.Get(s); (* remove from string writer *)
  6466. Strings.Append(msg, s);
  6467. END;
  6468. String(msg);
  6469. IF SemanticChecker.IsStringType(expression.type) THEN
  6470. Designate(expression,res);
  6471. StringOperand(res, expression.type);
  6472. ELSE
  6473. Evaluate(expression,res);
  6474. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6475. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6476. Convert(res.op,int64);
  6477. END;
  6478. Integer(res.op);
  6479. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6480. Boolean(res.op);
  6481. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6482. Set(res.op);
  6483. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6484. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6485. Convert(res.op,float64);
  6486. END;
  6487. Float(res.op);
  6488. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6489. Char(res.op);
  6490. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6491. Address(res.op);String("H");
  6492. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6493. Size(res.op);
  6494. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6495. Address(res.op);String("H");
  6496. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6497. Address(res.op);String("H");
  6498. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6499. String("NIL");
  6500. ELSE HALT(200);
  6501. END;
  6502. END;
  6503. ReleaseOperand(res);
  6504. String("; ");
  6505. END;
  6506. IF GetProcedure("Exit") THEN
  6507. CallProcedure
  6508. ELSE
  6509. Ln;
  6510. END;
  6511. END;
  6512. END SystemTrace;
  6513. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6514. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6515. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6516. BEGIN
  6517. type := type.resolved;
  6518. IF type IS SyntaxTree.RecordType THEN
  6519. WITH type: SyntaxTree.RecordType DO
  6520. baseType := type.baseType;
  6521. IF baseType # NIL THEN
  6522. baseType := baseType.resolved;
  6523. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6524. InitFields(baseType,adr,offset);
  6525. END;
  6526. variable := type.recordScope.firstVariable;
  6527. WHILE variable # NIL DO
  6528. IF variable.initializer # NIL THEN
  6529. Evaluate(variable.initializer,initializerOp);
  6530. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6531. Emit(Mov(position,mem,initializerOp.op));
  6532. ReleaseOperand(initializerOp);
  6533. ReleaseIntermediateOperand(mem);
  6534. END;
  6535. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6536. variable := variable.nextVariable
  6537. END;
  6538. END;
  6539. ELSIF type IS SyntaxTree.CellType THEN
  6540. WITH type: SyntaxTree.CellType DO
  6541. baseType := type.baseType;
  6542. IF baseType # NIL THEN
  6543. baseType := baseType.resolved;
  6544. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6545. InitFields(baseType,adr,offset);
  6546. END;
  6547. variable := type.cellScope.firstVariable;
  6548. WHILE variable # NIL DO
  6549. IF variable.initializer # NIL THEN
  6550. Evaluate(variable.initializer,initializerOp);
  6551. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6552. Emit(Mov(position,mem,initializerOp.op));
  6553. ReleaseOperand(initializerOp);
  6554. ReleaseIntermediateOperand(mem);
  6555. END;
  6556. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6557. variable := variable.nextVariable
  6558. END;
  6559. END;
  6560. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6561. WITH type: SyntaxTree.ArrayType DO
  6562. IF type.form = SyntaxTree.Static THEN
  6563. baseType := type.arrayBase;
  6564. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6565. FOR i := 0 TO type.staticLength-1 DO
  6566. InitFields(baseType,adr,offset+i*size);
  6567. END;
  6568. END;
  6569. END;
  6570. ELSIF type IS SyntaxTree.MathArrayType THEN
  6571. WITH type: SyntaxTree.MathArrayType DO
  6572. IF type.form = SyntaxTree.Open THEN
  6573. dim := DynamicDim(type);
  6574. imm := IntermediateCode.Immediate(addressType,dim);
  6575. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6576. baseType := SemanticChecker.ArrayBase(type,dim);
  6577. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6578. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6579. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6580. ReleaseIntermediateOperand(imm);
  6581. (* flags remain empty (=0) for open array *)
  6582. ELSIF type.form = SyntaxTree.Static THEN
  6583. baseType := type.arrayBase;
  6584. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6585. ASSERT(type.staticLength < 1024*1024*1024);
  6586. FOR i := 0 TO type.staticLength-1 DO
  6587. InitFields(baseType,adr,offset+i*size);
  6588. END;
  6589. END;
  6590. END;
  6591. END;
  6592. END InitFields;
  6593. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6594. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6595. saved: RegisterEntry;
  6596. BEGIN
  6597. type := variable.type.resolved;
  6598. IF (type IS SyntaxTree.MathArrayType) THEN
  6599. WITH type: SyntaxTree.MathArrayType DO
  6600. IF type.form = SyntaxTree.Open THEN
  6601. Symbol(variable,operand);
  6602. InitFields(type, operand.tag,0);
  6603. IF temporary THEN
  6604. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6605. END;
  6606. ELSIF type.form = SyntaxTree.Tensor THEN
  6607. IF temporary & backend.writeBarriers THEN
  6608. SaveRegisters();ReleaseUsedRegisters(saved);
  6609. Symbol(variable, operand);
  6610. Emit(Push(position,operand.op));
  6611. ReleaseOperand(operand);
  6612. Emit(Push(position,nil));
  6613. CallThis(position,"FoxArrayBase","Assign",2);
  6614. RestoreRegisters(saved);
  6615. ELSE
  6616. Symbol(variable, operand);
  6617. MakeMemory(tmp,operand.op,addressType,0);
  6618. ReleaseOperand(operand);
  6619. IF FALSE & temporary THEN
  6620. (* trick -- temporary object from array base *)
  6621. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6622. Symbol(symbol,operand);
  6623. MakeMemory(mem,operand.op,addressType,0);
  6624. ReleaseOperand(operand);
  6625. Emit(Mov(position,tmp, mem) );
  6626. ReleaseOperand(operand);
  6627. ELSE
  6628. Emit(Mov(position,tmp, nil ) );
  6629. END;
  6630. ReleaseIntermediateOperand(tmp)
  6631. END;
  6632. END;
  6633. END;
  6634. ELSE
  6635. Symbol(variable,operand);
  6636. IF variable.initializer # NIL THEN
  6637. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6638. reference.SetType(variable.type.resolved);
  6639. reference.SetAssignable(TRUE);
  6640. Assign(reference,variable.initializer);
  6641. ELSIF temporary THEN
  6642. IF SemanticChecker.IsPointerType(variable.type) THEN
  6643. IF backend.cooperative THEN
  6644. SaveRegisters();ReleaseUsedRegisters(saved);
  6645. Symbol(variable, operand);
  6646. CallAssignPointer(operand.op, nil);
  6647. ReleaseOperand(operand);
  6648. RestoreRegisters(saved);
  6649. ELSIF backend.writeBarriers THEN
  6650. SaveRegisters();ReleaseUsedRegisters(saved);
  6651. Symbol(variable, operand);
  6652. Emit(Push(position,operand.op));
  6653. ReleaseOperand(operand);
  6654. Emit(Push(position,nil));
  6655. CallThis(position,"Heaps","Assign",2);
  6656. RestoreRegisters(saved);
  6657. ELSE
  6658. Symbol(variable, operand);
  6659. MakeMemory(tmp,operand.op,addressType,0);
  6660. ReleaseOperand(operand);
  6661. Emit(Mov(position,tmp, nil ) );
  6662. ReleaseIntermediateOperand(tmp);
  6663. END;
  6664. END;
  6665. END;
  6666. InitFields(type, operand.op,0);
  6667. ReleaseOperand(operand);
  6668. END;
  6669. END InitVariable;
  6670. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6671. VAR end: Label;
  6672. BEGIN
  6673. IF type.form = SyntaxTree.Tensor THEN
  6674. InitOperand(result,ModeValue);
  6675. ReuseCopy(result.op,base);
  6676. end := NewLabel();
  6677. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6678. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6679. SetLabel(end);
  6680. Convert(result.op,lenType);
  6681. ELSE
  6682. InitOperand(result,ModeValue);
  6683. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6684. END
  6685. END MathArrayDim;
  6686. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6687. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6688. BEGIN
  6689. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6690. MakeMemory(mem,base,addressType,offset);
  6691. Emit(Mov(position,mem,value));
  6692. ReleaseIntermediateOperand(mem);
  6693. END PutMathArrayField;
  6694. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6695. VAR mem: IntermediateCode.Operand;
  6696. BEGIN
  6697. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6698. MakeMemory(mem,base,addressType,offset);
  6699. Emit(Mov(position,mem,value));
  6700. ReleaseIntermediateOperand(mem);
  6701. END PutMathArrayFieldOffset;
  6702. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6703. BEGIN
  6704. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6705. MakeMemory(value,base,addressType,offset);
  6706. END GetMathArrayField;
  6707. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6708. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6709. BEGIN
  6710. IF incr THEN
  6711. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6712. ELSE
  6713. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6714. END;
  6715. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6716. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6717. ELSE
  6718. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6719. Emit(Mov(position,reg,dim));
  6720. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6721. Emit(Add(position,reg,reg,base));
  6722. MakeMemory(mem, reg, addressType, offset);
  6723. ReleaseIntermediateOperand(reg);
  6724. Emit(Mov(position,mem,value));
  6725. ReleaseIntermediateOperand(mem);
  6726. END;
  6727. END PutMathArrayLenOrIncr;
  6728. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6729. BEGIN
  6730. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6731. END PutMathArrayLength;
  6732. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6733. BEGIN
  6734. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6735. END PutMathArrayIncrement;
  6736. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6737. BEGIN
  6738. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6739. END GetMathArrayIncrement;
  6740. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6741. BEGIN
  6742. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6743. END GetMathArrayLength;
  6744. PROCEDURE GetMathArrayLengthAt(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. GetMathArrayLength(type, operand, dimOp, check, result);
  6749. END GetMathArrayLengthAt;
  6750. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6751. VAR dimOp: IntermediateCode.Operand;
  6752. BEGIN
  6753. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6754. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6755. END GetMathArrayIncrementAt;
  6756. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6757. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6758. offset: LONGINT;
  6759. BEGIN
  6760. IF increment THEN
  6761. offset := MathIncrOffset;
  6762. ELSE
  6763. offset := MathLenOffset;
  6764. END;
  6765. INC(offset,operand.dimOffset*2);
  6766. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6767. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6768. END;
  6769. (* static dimension *)
  6770. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6771. IF check & (type.form = SyntaxTree.Tensor) THEN
  6772. DimensionCheck(operand.tag,dim,BrltL);
  6773. END;
  6774. val := SHORT(dim.intValue);
  6775. IF type.form # SyntaxTree.Tensor THEN
  6776. t := SemanticChecker.ArrayBase(type,val);
  6777. type := t.resolved(SyntaxTree.MathArrayType);
  6778. IF type.form = SyntaxTree.Static THEN
  6779. IF increment THEN
  6780. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6781. ELSE
  6782. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6783. END;
  6784. InitOperand(result,ModeValue);
  6785. result.op := res;
  6786. RETURN;
  6787. END;
  6788. END;
  6789. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6790. MakeMemory(res,operand.tag,addressType,offset);
  6791. (*
  6792. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6793. *)
  6794. InitOperand(result,ModeValue);
  6795. result.op := res;
  6796. ELSE
  6797. Convert(dim,addressType);
  6798. IF check THEN
  6799. IF type.form = SyntaxTree.Tensor THEN
  6800. DimensionCheck(operand.tag,dim,BrltL);
  6801. ELSIF isUnchecked THEN (* do nothing *)
  6802. ELSE
  6803. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6804. END;
  6805. END;
  6806. end := NewLabel(); next := NIL;
  6807. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6808. Emit(Mov(position,res,dim));
  6809. Convert(res,sizeType);
  6810. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6811. WHILE t IS SyntaxTree.MathArrayType DO
  6812. type := t(SyntaxTree.MathArrayType);
  6813. IF type.form = SyntaxTree.Static THEN
  6814. imm := IntermediateCode.Immediate(sizeType,val);
  6815. next := NewLabel();
  6816. BrneL(next,imm,res);
  6817. IF increment THEN
  6818. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6819. ELSE
  6820. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6821. END;
  6822. Emit(MovReplace(position,res,imm));
  6823. BrL(end);
  6824. ELSE hasDynamicPart := TRUE;
  6825. END;
  6826. t := type.arrayBase.resolved;
  6827. val := val + 1;
  6828. IF next # NIL THEN SetLabel(next) END;
  6829. END;
  6830. IF hasDynamicPart THEN
  6831. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6832. Emit(Mov(position,res2,dim));
  6833. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6834. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6835. Emit(Add(position,res2,res2,imm));
  6836. Emit(Add(position,res2,res2,operand.tag));
  6837. IntermediateCode.MakeMemory(res2,sizeType);
  6838. Emit(MovReplace(position,res,res2));
  6839. ReleaseIntermediateOperand(res2);
  6840. END;
  6841. SetLabel(end);
  6842. Convert(res,sizeType);
  6843. InitOperand(result,ModeValue);
  6844. result.op := res;
  6845. END;
  6846. END MathArrayLenOrIncr;
  6847. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6848. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6849. offset: LONGINT;
  6850. BEGIN
  6851. offset := operand.dimOffset+DynamicDim(type)-1;
  6852. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6853. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6854. val := SHORT(dim.intValue);
  6855. t := SemanticChecker.ArrayBase(type,val);
  6856. type := t.resolved(SyntaxTree.ArrayType);
  6857. IF type.form = SyntaxTree.Static THEN
  6858. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6859. ELSE
  6860. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6861. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6862. END;
  6863. UseIntermediateOperand(res);
  6864. InitOperand(result,ModeValue);
  6865. result.op := res;
  6866. ELSE
  6867. Convert(dim,addressType);
  6868. IF ~isUnchecked THEN
  6869. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6870. END;
  6871. end := NewLabel(); next := NIL;
  6872. (* ReuseCopy(dim,res); *)
  6873. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6874. Emit(Mov(position,res,dim));
  6875. Convert(res,sizeType);
  6876. Convert(res,sizeType);
  6877. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6878. WHILE t IS SyntaxTree.ArrayType DO
  6879. type := t(SyntaxTree.ArrayType);
  6880. IF type.form = SyntaxTree.Static THEN
  6881. imm := IntermediateCode.Immediate(sizeType,val);
  6882. next := NewLabel();
  6883. BrneL(next,imm,res);
  6884. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6885. Emit(MovReplace(position,res,imm));
  6886. BrL(end);
  6887. ELSE hasDynamicPart := TRUE;
  6888. END;
  6889. t := type.arrayBase.resolved;
  6890. val := val + 1;
  6891. IF next # NIL THEN SetLabel(next) END;
  6892. END;
  6893. IF hasDynamicPart THEN
  6894. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6895. Convert(res2,addressType);
  6896. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6897. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6898. Emit(Sub(position,res2,imm,res2));
  6899. Emit(Add(position,res2,res2,operand.tag));
  6900. IntermediateCode.MakeMemory(res2,sizeType);
  6901. Emit(MovReplace(position,res,res2));
  6902. ReleaseIntermediateOperand(res2);
  6903. END;
  6904. SetLabel(end);
  6905. Convert(res,sizeType);
  6906. InitOperand(result,ModeValue);
  6907. result.op := res;
  6908. END;
  6909. END ArrayLen;
  6910. (**
  6911. create a temporary variable in current scope
  6912. **)
  6913. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6914. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6915. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6916. BEGIN
  6917. IF ~register THEN
  6918. v := temporaries.GetFreeVariable(type, untraced, index);
  6919. ELSE
  6920. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6921. END;
  6922. scope := currentScope;
  6923. IF (scope IS SyntaxTree.ProcedureScope) & (scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).noPAF) THEN
  6924. Error(scope(SyntaxTree.ProcedureScope).ownerProcedure.position,"implementation restriction: cannot allocate temporary variable in procedure without activation frame");
  6925. END;
  6926. (*
  6927. v := NIL; (* disable free variable managemenet for the time being *)
  6928. *)
  6929. name := temporaries.GetUID();
  6930. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6931. variable.SetType(type);
  6932. variable.SetAccess(SyntaxTree.Hidden);
  6933. variable.SetUntraced(untraced);
  6934. IF v = NIL THEN
  6935. temporaries.AddVariable(variable);
  6936. IF ~register THEN
  6937. IF scope.lastVariable # NIL THEN
  6938. offset := scope.lastVariable.offsetInBits;
  6939. ELSE
  6940. offset := 0;
  6941. END;
  6942. DEC(offset,system.SizeOf(variable.type));
  6943. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6944. variable(SyntaxTree.Variable).SetOffset(offset);
  6945. scope.AddVariable(variable(SyntaxTree.Variable));
  6946. scope.EnterSymbol(variable, duplicate);
  6947. ASSERT(~duplicate);
  6948. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6949. ELSE
  6950. variable.SetUseRegister(TRUE);
  6951. variable(SyntaxTree.Variable).SetOffset(0);
  6952. END;
  6953. ELSE (* v # NIL *)
  6954. (* reuse slot for new variable, do not create new slot ! *)
  6955. temporaries.SetVariable(index, variable);
  6956. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6957. ASSERT(~register);
  6958. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6959. ASSERT(v.offsetInBits # 0);
  6960. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6961. scope.EnterSymbol(variable, duplicate);
  6962. ASSERT(~duplicate);
  6963. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6964. END;
  6965. RETURN variable(SyntaxTree.Variable)
  6966. END GetTemporaryVariable;
  6967. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6968. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6969. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6970. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6971. i: LONGINT; duplicate: BOOLEAN;
  6972. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6973. VAR variable: SyntaxTree.Variable;
  6974. BEGIN
  6975. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6976. variable.SetType(type);
  6977. recordScope.AddVariable(variable);
  6978. END AddVariable;
  6979. BEGIN
  6980. name := "@ArrayDescriptor";
  6981. Basic.AppendNumber(name,dimensions);
  6982. identifier := SyntaxTree.NewIdentifier(name);
  6983. parentScope := module.module.moduleScope;
  6984. symbol := parentScope.FindSymbol(identifier);
  6985. IF symbol # NIL THEN
  6986. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6987. type := typeDeclaration.declaredType;
  6988. ELSE
  6989. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6990. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6991. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6992. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6993. recordType.SetTypeDeclaration(typeDeclaration);
  6994. recordType.SetState(SyntaxTree.Resolved);
  6995. typeDeclaration.SetDeclaredType(recordType);
  6996. AddVariable("@ptr",system.anyType);
  6997. AddVariable("@adr",system.addressType);
  6998. AddVariable("@flags",system.addressType);
  6999. AddVariable("@dim",system.addressType);
  7000. AddVariable("@elementSize",system.addressType);
  7001. FOR i := 0 TO dimensions-1 DO
  7002. name := "@len";
  7003. Basic.AppendNumber(name,i);
  7004. AddVariable(name,system.addressType);
  7005. name := "@incr";
  7006. Basic.AppendNumber(name,i);
  7007. AddVariable(name,system.addressType);
  7008. END;
  7009. parentScope.AddTypeDeclaration(typeDeclaration);
  7010. parentScope.EnterSymbol(typeDeclaration,duplicate);
  7011. ASSERT(~duplicate);
  7012. type := recordType;
  7013. END;
  7014. RETURN type
  7015. END GetMathArrayDescriptorType;
  7016. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  7017. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  7018. BEGIN
  7019. NEW(string, LEN(s)); COPY(s, string^);
  7020. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  7021. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  7022. sv.SetType(type);
  7023. Designate(sv,res);
  7024. Emit(Push(position,res.tag));
  7025. Emit(Push(position,res.op));
  7026. ReleaseOperand(res);
  7027. END PushConstString;
  7028. PROCEDURE PushConstBoolean(b: BOOLEAN);
  7029. BEGIN
  7030. IF b THEN
  7031. Emit(Push(Basic.invalidPosition, true));
  7032. ELSE
  7033. Emit(Push(Basic.invalidPosition, false));
  7034. END;
  7035. END PushConstBoolean;
  7036. PROCEDURE PushConstSet(v: SET);
  7037. VAR value: SyntaxTree.Value; op: Operand;
  7038. BEGIN
  7039. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  7040. value.SetType(system.setType);
  7041. Evaluate(value, op);
  7042. Emit(Push(Basic.invalidPosition, op.op));
  7043. ReleaseOperand(op);
  7044. END PushConstSet;
  7045. PROCEDURE PushConstInteger(v: LONGINT);
  7046. VAR value: SyntaxTree.Value; op: Operand;
  7047. BEGIN
  7048. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  7049. value.SetType(system.longintType);
  7050. Evaluate(value, op);
  7051. Emit(Push(Basic.invalidPosition, op.op));
  7052. ReleaseOperand(op);
  7053. END PushConstInteger;
  7054. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  7055. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  7056. section: IntermediateCode.Section;
  7057. BEGIN
  7058. procedureScope := SyntaxTree.NewProcedureScope(scope);
  7059. Global.GetSymbolSegmentedName(symbol, name);
  7060. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  7061. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  7062. procedure.SetScope(moduleScope);
  7063. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  7064. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  7065. procedure.SetAccess(SyntaxTree.Hidden);
  7066. currentScope := procedureScope;
  7067. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  7068. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  7069. RETURN section;
  7070. END OpenInitializer;
  7071. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  7072. BEGIN
  7073. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  7074. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  7075. section := prev;
  7076. END CloseInitializer;
  7077. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  7078. VAR name: SyntaxTree.IdentifierString;
  7079. parameter: SyntaxTree.Parameter;
  7080. type: SyntaxTree.Type;
  7081. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  7082. BEGIN
  7083. InitOperand(op,ModeReference);
  7084. op.op := fp;
  7085. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  7086. Dereference(op, x, FALSE);
  7087. result := op;
  7088. Symbol(symbol, op);
  7089. END Field;
  7090. PROCEDURE Direction(direction: LONGINT): SET;
  7091. BEGIN
  7092. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  7093. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  7094. ELSE HALT(100);
  7095. END;
  7096. END Direction;
  7097. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7098. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7099. BEGIN
  7100. Field(port, op);
  7101. ToMemory(op.op,addressType,0);
  7102. Emit(Push(Basic.invalidPosition, op.op));
  7103. ReleaseOperand(op);
  7104. Basic.GetString(modifier.identifier, name);
  7105. PushConstString(name);
  7106. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7107. ASSERT(SemanticChecker.IsStringType(value.type));
  7108. Designate(value, op);
  7109. Emit(Push(modifier.position, op.tag));
  7110. Emit(Push(modifier.position, op.op));
  7111. ReleaseOperand(op);
  7112. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  7113. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7114. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7115. Evaluate(value, op);
  7116. Emit(Push(modifier.position, op.op));
  7117. ReleaseOperand(op);
  7118. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  7119. ELSE
  7120. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  7121. END;
  7122. END AddPortProperty;
  7123. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  7124. VAR modifier: SyntaxTree.Modifier;
  7125. BEGIN
  7126. modifier := parameter.modifiers;
  7127. WHILE modifier # NIL DO
  7128. AddPortProperty(parameter,modifier, modifier.expression);
  7129. modifier := modifier.nextModifier;
  7130. END;
  7131. END AddPortProperties;
  7132. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  7133. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  7134. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  7135. PROCEDURE PushLens(type: SyntaxTree.Type);
  7136. BEGIN
  7137. IF IsSemiDynamicArray(type) THEN
  7138. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7139. Evaluate(type(SyntaxTree.ArrayType).length, op);
  7140. Emit(Push(Basic.invalidPosition, op.op));
  7141. ReleaseOperand(op);
  7142. INC(dim);
  7143. ELSIF IsStaticArray(type) THEN
  7144. len := len * type(SyntaxTree.ArrayType).staticLength;
  7145. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7146. INC(dim);
  7147. ELSE
  7148. baseType := type;
  7149. END;
  7150. END PushLens;
  7151. BEGIN
  7152. (* cell *)
  7153. IF parameter.type IS SyntaxTree.ArrayType THEN
  7154. type := parameter.type;
  7155. dim := 0;
  7156. len := 1;
  7157. PushLens(type);
  7158. portType := baseType.resolved(SyntaxTree.PortType);
  7159. ELSE
  7160. portType := parameter.type(SyntaxTree.PortType);
  7161. END;
  7162. PushSelfPointer();
  7163. (* port / array of ports *)
  7164. IF IsStaticArray(type) THEN
  7165. PushConstInteger(len);
  7166. END;
  7167. Field(parameter, op);
  7168. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7169. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  7170. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  7171. Designate(d, op);*)
  7172. Emit(Push(Basic.invalidPosition, op.op));
  7173. ReleaseOperand(op);
  7174. (* name *)
  7175. PushConstString(name);
  7176. (* inout *)
  7177. PushConstSet(Direction(portType.direction));
  7178. (* width *)
  7179. PushConstInteger(portType.sizeInBits);
  7180. IF parameter.type IS SyntaxTree.PortType THEN
  7181. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  7182. AddPortProperties(parameter);
  7183. ELSIF IsStaticArray(type)THEN
  7184. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  7185. ELSIF IsSemiDynamicArray(type) THEN
  7186. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7187. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  7188. Emit(Add(position,reg, sp, size));
  7189. (* dim *)
  7190. PushConstInteger(dim);
  7191. (* len array *)
  7192. Emit(Push(position, reg));
  7193. ReleaseIntermediateOperand(reg);
  7194. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  7195. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  7196. Emit(Add(position, sp,sp, size));
  7197. ELSE
  7198. HALT(100);
  7199. END;
  7200. END Parameter;
  7201. BEGIN
  7202. IF backend.cellsAreObjects THEN
  7203. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  7204. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  7205. END;
  7206. parameter := x.firstParameter;
  7207. WHILE (parameter # NIL) DO
  7208. type := parameter.type.resolved;
  7209. WHILE (type IS SyntaxTree.ArrayType) DO
  7210. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7211. END;
  7212. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  7213. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  7214. Parameter(name,parameter);
  7215. END;
  7216. parameter := parameter.nextParameter;
  7217. END;
  7218. ELSE HALT(200)
  7219. END;
  7220. END AddPorts;
  7221. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  7222. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  7223. BEGIN
  7224. Symbol(cell,op);
  7225. ToMemory(op.op,addressType,0);
  7226. Emit(Push(position,op.op));
  7227. ReleaseOperand(op);
  7228. property.GetName(name);
  7229. (* does not work when inheritance is used:
  7230. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  7231. *)
  7232. PushConstString(name);
  7233. IF (value # NIL) THEN
  7234. ASSERT(
  7235. SemanticChecker.IsStringType(property.type)
  7236. OR (property.type.resolved IS SyntaxTree.IntegerType)
  7237. OR (property.type.resolved IS SyntaxTree.FloatType)
  7238. OR (property.type.resolved IS SyntaxTree.BooleanType)
  7239. OR (property.type.resolved IS SyntaxTree.SetType)
  7240. );
  7241. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7242. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  7243. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  7244. Designate(d, op);
  7245. IF SemanticChecker.IsStringType(property.type) THEN
  7246. Emit(Push(Basic.invalidPosition, op.tag))
  7247. END;
  7248. Emit(Push(Basic.invalidPosition, op.op));
  7249. ReleaseOperand(op);
  7250. END;
  7251. IF value = NIL THEN
  7252. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  7253. ELSIF SemanticChecker.IsStringType(property.type) THEN
  7254. ASSERT(SemanticChecker.IsStringType(value.type));
  7255. Designate(value, op);
  7256. PushString(op, value.type);
  7257. ReleaseOperand(op);
  7258. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  7259. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  7260. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7261. Evaluate(value, op);
  7262. Emit(Push(property.position, op.op));
  7263. ReleaseOperand(op);
  7264. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  7265. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  7266. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  7267. Evaluate(value, op);
  7268. Emit(Push(property.position, op.op));
  7269. ReleaseOperand(op);
  7270. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  7271. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  7272. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  7273. Evaluate(value, op);
  7274. Emit(Push(property.position, op.op));
  7275. ReleaseOperand(op);
  7276. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  7277. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  7278. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  7279. Evaluate(value, op);
  7280. Emit(Push(property.position, op.op));
  7281. ReleaseOperand(op);
  7282. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  7283. ELSE
  7284. HALT(200);
  7285. END;
  7286. END AddProperty;
  7287. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  7288. VAR symbol: SyntaxTree.Symbol;
  7289. BEGIN
  7290. WHILE modifier # NIL DO
  7291. symbol := cellType.FindProperty(modifier.identifier);
  7292. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  7293. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  7294. modifier := modifier.nextModifier;
  7295. END;
  7296. END AddModifiers;
  7297. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7298. VAR last: SyntaxTree.Modifier;
  7299. BEGIN
  7300. IF to = NIL THEN
  7301. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  7302. ELSE
  7303. last := to;
  7304. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  7305. last := last.nextModifier;
  7306. END;
  7307. IF last.identifier # this.identifier THEN
  7308. ASSERT(last.nextModifier = NIL);
  7309. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  7310. END;
  7311. END;
  7312. END AppendModifier;
  7313. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7314. BEGIN
  7315. WHILE this # NIL DO
  7316. AppendModifier(to, this);
  7317. this := this.nextModifier;
  7318. END;
  7319. END AppendModifiers;
  7320. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  7321. VAR base: SyntaxTree.Type;
  7322. BEGIN
  7323. AppendModifiers(to, c.modifiers);
  7324. base := c.GetBaseValueType();
  7325. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  7326. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  7327. END;
  7328. END AppendCellTypeModifiers;
  7329. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7330. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7331. BEGIN
  7332. Basic.GetString(modifier.identifier, name);
  7333. PushConstString(name);
  7334. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7335. ASSERT(SemanticChecker.IsStringType(value.type));
  7336. Designate(value, op);
  7337. PushString(op, value.type);
  7338. ReleaseOperand(op);
  7339. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7340. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7341. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7342. Evaluate(value, op);
  7343. Emit(Push(modifier.position, op.op));
  7344. ReleaseOperand(op);
  7345. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7346. ELSE
  7347. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7348. END;
  7349. END AddPortProperty;
  7350. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7351. BEGIN
  7352. WHILE modifier # NIL DO
  7353. AddPortProperty(modifier, modifier.expression);
  7354. modifier := modifier.nextModifier;
  7355. END;
  7356. END AddPortProperties;
  7357. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7358. VAR op: Operand;
  7359. BEGIN
  7360. Evaluate(p, op);
  7361. Emit(Push(p.position, op.op));
  7362. ReleaseOperand(op);
  7363. IF p IS SyntaxTree.Designator THEN
  7364. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7365. END;
  7366. END PushPort;
  7367. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7368. VAR tmp: IntermediateCode.Operand;
  7369. BEGIN
  7370. actualType := actualType.resolved;
  7371. IF actualType IS SyntaxTree.StringType THEN
  7372. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7373. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7374. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7375. ELSE
  7376. tmp := op.tag;
  7377. IntermediateCode.MakeMemory(tmp,addressType);
  7378. Emit(Push(position,tmp));
  7379. END;
  7380. Emit(Push(position,op.op))
  7381. END PushString;
  7382. (* conservative check if x is potentially on the heap, excluding the module heap
  7383. required for generational garbage collector
  7384. *)
  7385. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7386. BEGIN
  7387. RETURN TRUE;
  7388. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7389. passed by reference.
  7390. pos := x.position.start;
  7391. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7392. x := x(SyntaxTree.Designator).left;
  7393. END;
  7394. RETURN x # NIL;
  7395. *)
  7396. END OnHeap;
  7397. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7398. VAR
  7399. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7400. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7401. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7402. tmp:IntermediateCode.Operand;
  7403. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,ignore: Label;
  7404. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7405. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7406. dest: IntermediateCode.Operand;
  7407. staticLength: LONGINT; itype: IntermediateCode.Type;
  7408. convert,isTensor: BOOLEAN;
  7409. recordType: SyntaxTree.RecordType;
  7410. baseType: SyntaxTree.Type;
  7411. left: SyntaxTree.Expression;
  7412. call: SyntaxTree.Designator;
  7413. procedure: SyntaxTree.Procedure;
  7414. temporaryVariable: SyntaxTree.Variable;
  7415. dummy: IntermediateCode.Operand;
  7416. customBuiltin: SyntaxTree.CustomBuiltin;
  7417. isVarPar: ARRAY 3 OF BOOLEAN;
  7418. callsection: Sections.Section;
  7419. segmentedName: Basic.SegmentedName;
  7420. needsTrace: BOOLEAN;
  7421. n: ARRAY 256 OF CHAR;
  7422. modifier: SyntaxTree.Modifier;
  7423. previous, init: IntermediateCode.Section;
  7424. prevScope: SyntaxTree.Scope;
  7425. firstPar: LONGINT;
  7426. saved: RegisterEntry;
  7427. callingConvention: SyntaxTree.CallingConvention;
  7428. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7429. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7430. priority: IntermediateCode.Operand;
  7431. op,callop: Operand;
  7432. BEGIN
  7433. IF type = NIL THEN RETURN END;
  7434. type := type.resolved;
  7435. IF type IS SyntaxTree.PointerType THEN
  7436. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7437. END;
  7438. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7439. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7440. recordScope := type(SyntaxTree.RecordType).recordScope;
  7441. IF recordScope.bodyProcedure # NIL THEN
  7442. procedure := recordScope.bodyProcedure;
  7443. body := procedure.procedureScope.body;
  7444. Emit(Push(position,self));
  7445. IF body.isActive THEN
  7446. StaticCallOperand(callop,procedure);
  7447. Emit(Push(position,callop.op));
  7448. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7449. Convert(priority,sizeType);
  7450. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7451. END;
  7452. Emit(Push(position,priority));
  7453. ReleaseIntermediateOperand(priority);
  7454. IF backend.cooperative THEN
  7455. Emit(Push(position,self));
  7456. CallThis(position,"Activities","Create",3)
  7457. ELSE
  7458. flags := 0;
  7459. IF body.isSafe THEN
  7460. flags := 1;
  7461. END;
  7462. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7463. Emit(Push(position,self));
  7464. CallThis(position,"Objects","CreateProcess",4)
  7465. END;
  7466. ELSE
  7467. Emit(Push(position,self));
  7468. StaticCallOperand(callop,procedure);
  7469. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7470. END;
  7471. Emit(Pop(position,self));
  7472. END;
  7473. END CallBodies;
  7474. PROCEDURE PushTD(type: SyntaxTree.Type);
  7475. VAR op: IntermediateCode.Operand;
  7476. BEGIN
  7477. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7478. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7479. ELSE
  7480. IF type.resolved IS SyntaxTree.PointerType THEN
  7481. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7482. END;
  7483. op := TypeDescriptorAdr(type.resolved);
  7484. Emit(Push(position,op));
  7485. END
  7486. END PushTD;
  7487. BEGIN
  7488. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7489. dest := destination; destination := emptyOperand;
  7490. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7491. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7492. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7493. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7494. CASE x.id OF
  7495. (* ---- COPY ----- *)
  7496. |Global.Copy:
  7497. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7498. (* ---- EXCL, INCL----- *)
  7499. |Global.Excl,Global.Incl:
  7500. Evaluate(p0,s0);
  7501. Evaluate(p1,s1);
  7502. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7503. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7504. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7505. END;
  7506. ReuseCopy(res,s0.op);
  7507. ReleaseOperand(s0);
  7508. Reuse1(tmp,s1.op);
  7509. ReleaseOperand(s1);
  7510. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7511. IF x.id = Global.Excl THEN
  7512. Emit(Not(position,tmp,tmp));
  7513. Emit(And(position,res,res,tmp));
  7514. ELSE
  7515. Emit(Or(position,res,res,tmp));
  7516. END;
  7517. ReleaseIntermediateOperand(tmp);
  7518. Designate(p0,s0);
  7519. ToMemory(s0.op,s1.op.type,0);
  7520. Emit(Mov(position,s0.op,res));
  7521. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7522. (* ---- DISPOSE ----- *)
  7523. |Global.Dispose:
  7524. Designate(p0,s0);
  7525. Emit(Push(position,s0.op));
  7526. ReleaseOperand(s0);
  7527. CallThis(position,"Runtime","Dispose", 1);
  7528. (* ---- GETPROCEDURE ----- *)
  7529. |Global.GetProcedure:
  7530. Designate(p0,s0);
  7531. PushString(s0,p0.type);
  7532. Designate(p1,s1);
  7533. PushString(s1,p1.type);
  7534. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7535. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7536. ELSE PushTD(procedureType.firstParameter.type)
  7537. END;
  7538. PushTD(procedureType.returnType);
  7539. Designate(p2,s2);
  7540. Emit(Push(position,s2.op));
  7541. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7542. CallThis(position,"Modules","GetProcedure", 7);
  7543. (* ---- ASH, LSH, ROT ----- *)
  7544. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7545. Evaluate(p0,s0);
  7546. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7547. (* make unsigned arguments in order to produced a logical shift *)
  7548. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7549. convert:= TRUE;
  7550. itype := s0.op.type;
  7551. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7552. Convert(s0.op,itype);
  7553. ELSE
  7554. convert := FALSE;
  7555. END;
  7556. END;
  7557. Evaluate(p1,s1);
  7558. IF IsIntegerConstant(p1,hint) THEN
  7559. ReuseCopy(reg,s0.op);
  7560. IF hint > 0 THEN
  7561. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7562. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7563. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7564. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7565. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7566. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7567. END;
  7568. ELSIF hint < 0 THEN
  7569. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7570. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7571. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7572. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7573. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7574. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7575. END;
  7576. END;
  7577. ReleaseOperand(s0); ReleaseOperand(s1);
  7578. ELSE
  7579. exit := NewLabel();
  7580. end := NewLabel();
  7581. ReuseCopy(reg,s0.op);
  7582. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7583. Reuse1(tmp,s1.op);
  7584. Emit(Neg(position,tmp,s1.op));
  7585. Convert(tmp,s1.op.type);
  7586. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7587. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7588. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7589. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7590. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7591. END;
  7592. ReleaseIntermediateOperand(tmp);
  7593. BrL(end);
  7594. SetLabel(exit);
  7595. ReuseCopy(tmp,s1.op);
  7596. Convert(tmp,s1.op.type);
  7597. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7598. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7599. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7600. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7601. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7602. END;
  7603. ReleaseIntermediateOperand(tmp);
  7604. SetLabel(end);
  7605. ReleaseOperand(s0); ReleaseOperand(s1);
  7606. END;
  7607. InitOperand(result,ModeValue);
  7608. IF convert THEN
  7609. itype := reg.type;
  7610. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7611. Convert(reg,itype);
  7612. END;
  7613. result.op := reg;
  7614. (* ---- CAP ----- *)
  7615. |Global.Cap:
  7616. Evaluate(p0,result);
  7617. ReuseCopy(reg,result.op);
  7618. ReleaseIntermediateOperand(result.op);
  7619. ignore := NewLabel();
  7620. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7621. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7622. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7623. SetLabel(ignore);
  7624. result.op := reg;
  7625. (* ---- CHR ----- *)
  7626. |Global.Chr, Global.Chr32:
  7627. Evaluate(p0,result);
  7628. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7629. |Global.Entier, Global.EntierH:
  7630. Evaluate(p0,result);
  7631. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7632. (* ---- MIN and MAX ----- *)
  7633. |Global.Max,Global.Min:
  7634. Evaluate(p0,s0);
  7635. Evaluate(p1,s1);
  7636. Reuse2(res,s0.op,s1.op);
  7637. else := NewLabel();
  7638. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7639. ELSE BrltL(else,s1.op,s0.op) END;
  7640. Emit(Mov(position,res,s0.op));
  7641. ReleaseOperand(s0);
  7642. end := NewLabel();
  7643. BrL(end);
  7644. SetLabel(else);
  7645. Emit(MovReplace(position,res,s1.op));
  7646. SetLabel(end);
  7647. ReleaseOperand(s1);
  7648. InitOperand(result,ModeValue);
  7649. result.op := res;
  7650. (* ---- ODD ----- *)
  7651. |Global.Odd:
  7652. Evaluate(p0,result);
  7653. Reuse1(res,result.op);
  7654. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7655. ReleaseIntermediateOperand(result.op);
  7656. result.op := res;
  7657. Convert(result.op,bool);
  7658. (* ---- ORD ----- *)
  7659. |Global.Ord, Global.Ord32:
  7660. Evaluate(p0,result);
  7661. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7662. (* ---- SHORT, LONG ----- *)
  7663. |Global.Short, Global.Long:
  7664. Evaluate(p0,result);
  7665. IF x.type IS SyntaxTree.ComplexType THEN
  7666. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7667. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7668. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7669. ELSE
  7670. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7671. END
  7672. (* ---- HALT, SYSTEM.HALT----- *)
  7673. |Global.Halt, Global.systemHalt:
  7674. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7675. EmitTrap (position, val);
  7676. (* ---- ASSERT ----- *)
  7677. |Global.Assert:
  7678. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7679. trueL := NewLabel();
  7680. Condition(p0,trueL,TRUE);
  7681. IF p1 = NIL THEN val := AssertTrap
  7682. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7683. END;
  7684. EmitTrap(position,val);
  7685. SetLabel(trueL);
  7686. END;
  7687. (*
  7688. Emit(TrapC(result.op,val);
  7689. *)
  7690. (* ---- INC, DEC----- *)
  7691. |Global.Inc,Global.Dec:
  7692. Expression(p0); adr := result.op;
  7693. s0 := result;
  7694. LoadValue(result,p0.type);
  7695. (* EXPERIMENTAL *)
  7696. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7697. availableSymbols[s0.availability].inMemory := FALSE;
  7698. END;
  7699. l := result;
  7700. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7701. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7702. END;
  7703. IF x.id = Global.Inc THEN
  7704. Emit(Add(position,l.op,l.op,r.op));
  7705. ELSE
  7706. Emit(Sub(position,l.op,l.op,r.op));
  7707. END;
  7708. ReleaseOperand(l); ReleaseOperand(r);
  7709. (* ---- LEN ----- *)
  7710. |Global.Len: (* dynamic length, static length done by checker *)
  7711. Designate(p0,operand);
  7712. IF p1 = NIL THEN
  7713. InitOperand(l,ModeValue);
  7714. l.op := IntermediateCode.Immediate(sizeType,0);
  7715. ELSE
  7716. Evaluate(p1,l);
  7717. END;
  7718. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7719. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7720. Dereference(operand, p0.type.resolved, FALSE);
  7721. END;
  7722. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7723. ReleaseOperand(operand); ReleaseOperand(l);
  7724. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7725. ASSERT(p1 # NIL);
  7726. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7727. Dereference(operand,p0.type.resolved,FALSE);
  7728. END;
  7729. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7730. ReleaseOperand(operand); ReleaseOperand(l);
  7731. ELSE HALT(100);
  7732. END;
  7733. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7734. (* ---- FIRST ---- *)
  7735. |Global.First:
  7736. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7737. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7738. ELSE
  7739. Designate(p0, result)
  7740. END
  7741. (* ---- LAST ---- *)
  7742. |Global.Last:
  7743. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7744. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7745. ELSE
  7746. Designate(p0, result);
  7747. (* make sure result.op is a register *)
  7748. tmp := result.op;
  7749. ReuseCopy(result.op, result.op);
  7750. ReleaseIntermediateOperand(tmp);
  7751. (* add offset to result.op *)
  7752. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7753. END
  7754. (* ---- STEP ---- *)
  7755. |Global.Step:
  7756. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7757. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7758. ELSE
  7759. Designate(p0, result);
  7760. (* make sure result.op is a register *)
  7761. tmp := result.op;
  7762. ReuseCopy(result.op, result.op);
  7763. ReleaseIntermediateOperand(tmp);
  7764. (* add offset to result.op *)
  7765. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7766. END
  7767. (* ---- RE ---- *)
  7768. |Global.Re:
  7769. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7770. Designate(p0, result)
  7771. ELSE
  7772. Evaluate(p0, result)
  7773. END
  7774. (* ---- IM ---- *)
  7775. |Global.Im:
  7776. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7777. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7778. Designate(p0, result);
  7779. (* make sure result.op is a register *)
  7780. tmp := result.op;
  7781. ReuseCopy(result.op, result.op);
  7782. ReleaseIntermediateOperand(tmp);
  7783. (* add offset to result.op *)
  7784. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7785. (* ---- ABS ----- *)
  7786. |Global.Abs:
  7787. Evaluate(p0,operand);
  7788. type := p0.type.resolved;
  7789. InitOperand(result,ModeValue);
  7790. Reuse1a(result.op,operand.op,dest);
  7791. Emit(Abs(position,result.op,operand.op));
  7792. ReleaseOperand(operand);
  7793. (* ---- WAIT ----- *)
  7794. |Global.Wait:
  7795. Evaluate(p0,operand);
  7796. Emit(Push(position,operand.op));
  7797. ReleaseOperand(operand);
  7798. CallThis(position,"Activities","Wait", 1);
  7799. (* ---- NEW ----- *)
  7800. |Global.New:
  7801. (*! the following code is only correct for "standard" Oberon calling convention *)
  7802. IF x.type # NIL THEN
  7803. type := x.type.resolved;
  7804. firstPar := 0;
  7805. ELSE
  7806. type := p0.type.resolved;
  7807. firstPar := 1;
  7808. END;
  7809. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7810. THEN
  7811. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7812. IF backend.cooperative THEN
  7813. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7814. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7815. IF recordType.isObject THEN
  7816. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7817. IF recordType.IsActive() THEN
  7818. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7819. END;
  7820. IF recordType.IsProtected() THEN
  7821. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7822. END;
  7823. ELSE
  7824. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7825. END;
  7826. END;
  7827. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7828. CallThis(position,"Runtime","New", 1);
  7829. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7830. Emit(Result(position, pointer));
  7831. exit := NewLabel();
  7832. BreqL(exit,pointer,nil);
  7833. GetRecordTypeName (recordType,name);
  7834. IF ~recordType.isObject THEN
  7835. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7836. END;
  7837. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7838. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7839. IF recordType.isObject THEN
  7840. IF recordType.IsProtected() THEN
  7841. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7842. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7843. END;
  7844. IF recordType.IsActive() THEN
  7845. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7846. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7847. END;
  7848. END;
  7849. (* initialize fields *)
  7850. IF type(SyntaxTree.PointerType).isPlain THEN
  7851. size := 0;
  7852. ELSIF recordType.isObject THEN
  7853. size := BaseObjectTypeSize;
  7854. ELSE
  7855. size := BaseRecordTypeSize;
  7856. END;
  7857. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7858. (* call initializer *)
  7859. constructor := GetConstructor(recordType);
  7860. IF constructor # NIL THEN
  7861. (*! should be unified with ProcedureCallDesignator *)
  7862. Emit(Push(position,pointer));
  7863. ReleaseIntermediateOperand(pointer);
  7864. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7865. FOR i := firstPar TO x.parameters.Length()-1 DO
  7866. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7867. formalParameter := formalParameter.nextParameter;
  7868. END;
  7869. (* static call of the constructor *)
  7870. GetCodeSectionNameForSymbol(constructor,name);
  7871. ASSERT(~constructor.isInline);
  7872. IF constructor.scope.ownerModule # module.module THEN
  7873. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7874. ELSE
  7875. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7876. END;
  7877. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7878. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7879. Emit(Pop(position,pointer));
  7880. END;
  7881. (* call bodies *)
  7882. CallBodies(pointer,type);
  7883. SetLabel(exit);
  7884. needsTrace := p0.NeedsTrace();
  7885. IF needsTrace THEN ModifyAssignments(true) END;
  7886. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7887. Emit(Push(position, pointer));
  7888. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7889. Emit(Pop(position, pointer));
  7890. END;
  7891. Designate(p0,l);
  7892. IF needsTrace THEN
  7893. CallAssignPointer(l.op, pointer);
  7894. ELSE
  7895. ToMemory(l.op,addressType,0);
  7896. Emit(Mov(position,l.op,pointer));
  7897. END;
  7898. ReleaseIntermediateOperand(pointer);
  7899. ReleaseOperand(l);
  7900. IF needsTrace THEN ModifyAssignments(false) END;
  7901. ELSE (* not cooperative backend *)
  7902. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7903. IF temporaryVariable # NIL THEN
  7904. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7905. ELSE
  7906. Designate(p0,l);
  7907. END;
  7908. (* l.op contains address of pointer to record *)
  7909. Emit(Push(position,l.op)); (* address for use after syscall *)
  7910. Emit(Push(position,l.op));
  7911. ReleaseOperand(l);
  7912. (* push type descriptor *)
  7913. reg := TypeDescriptorAdr(recordType);
  7914. Emit(Push(position,reg));
  7915. ReleaseIntermediateOperand(reg);
  7916. (* push realtime flag *)
  7917. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7918. ELSE Emit(Push(position,false));
  7919. END;
  7920. CallThis(position,"Heaps","NewRec", 3);
  7921. (* check allocation success, if not successful then do not call initializers and bodies *)
  7922. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7923. Emit(Pop(position,pointer));
  7924. MakeMemory(reg,pointer,addressType,0);
  7925. ReleaseIntermediateOperand(pointer);
  7926. pointer := reg;
  7927. exit := NewLabel();
  7928. BreqL(exit,pointer,nil);
  7929. Emit(Push(position,pointer));
  7930. (* initialize fields *)
  7931. InitFields(recordType, pointer,0);
  7932. (* call initializer *)
  7933. constructor := GetConstructor(recordType);
  7934. IF constructor # NIL THEN
  7935. (*! should be unified with ProcedureCallDesignator *)
  7936. Emit(Push(position,pointer));
  7937. ReleaseIntermediateOperand(pointer);
  7938. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7939. FOR i := firstPar TO x.parameters.Length()-1 DO
  7940. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7941. formalParameter := formalParameter.nextParameter;
  7942. END;
  7943. (* static call of the constructor *)
  7944. GetCodeSectionNameForSymbol(constructor,name);
  7945. ASSERT(~constructor.isInline);
  7946. IF constructor.scope.ownerModule # module.module THEN
  7947. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7948. ELSE
  7949. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7950. END;
  7951. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7952. ELSE
  7953. ReleaseIntermediateOperand(pointer);
  7954. END;
  7955. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7956. Emit(Pop(position,pointer));
  7957. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7958. Designate(p0,l);
  7959. IF backend.writeBarriers & OnHeap(p0) THEN
  7960. SaveRegisters();ReleaseUsedRegisters(saved);
  7961. Emit(Push(position,l.op));
  7962. Emit(Push(position,pointer));
  7963. CallThis(position,"Heaps","Assign",2);
  7964. RestoreRegisters(saved);
  7965. ELSE
  7966. ToMemory(l.op,addressType,0);
  7967. Emit(Mov(position,l.op,pointer));
  7968. END;
  7969. ReleaseOperand(l);
  7970. result.tag := emptyOperand;
  7971. ELSIF (x.type # NIL) THEN
  7972. result := l; (* temporary variable is the result of NEW Type() *)
  7973. END;
  7974. (* call bodies *)
  7975. CallBodies(pointer,type);
  7976. ReleaseIntermediateOperand(pointer);
  7977. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7978. end := NewLabel();
  7979. BrL(end);
  7980. SetLabel(exit);
  7981. Designate(p0,l);
  7982. ToMemory(l.op,addressType,0);
  7983. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7984. ReleaseOperand(l);
  7985. SetLabel(end);
  7986. ELSE
  7987. SetLabel(exit);
  7988. END;
  7989. END;
  7990. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7991. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7992. IF ~backend.cooperative THEN (* simpler version *)
  7993. (*
  7994. push len0
  7995. push len1
  7996. push len2
  7997. push len_size
  7998. push len_adr
  7999. push tag
  8000. push static elements
  8001. push element size
  8002. push adr
  8003. *)
  8004. dim := 0;
  8005. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8006. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8007. parameter := x.parameters.GetExpression(i);
  8008. Evaluate(parameter,r);
  8009. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8010. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8011. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8012. END;
  8013. Emit(Push(position,r.op));
  8014. ReleaseOperand(r);
  8015. INC(dim);
  8016. END;
  8017. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8018. Emit(Mov(position, adr, sp));
  8019. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8020. Emit(Push(position, adr));
  8021. ReleaseIntermediateOperand(adr);
  8022. openDim := dim;
  8023. staticLength := 1;
  8024. IF type IS SyntaxTree.ArrayType THEN
  8025. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8026. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8027. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8028. END;
  8029. END;
  8030. IF SemanticChecker.ContainsPointer(type) THEN
  8031. tmp := TypeDescriptorAdr(type);
  8032. ELSE
  8033. tmp := nil;
  8034. END;
  8035. Emit(Push(position,tmp)); (* type descriptor *)
  8036. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  8037. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  8038. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  8039. Designate(p0,l);
  8040. Emit(Push(position,l.op)); (* address *)
  8041. ReleaseOperand(l);
  8042. CallThis(position,"Heaps","NewArray", 6);
  8043. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8044. Emit(Add(position,sp,sp,tmp));
  8045. ELSE
  8046. dim := 0;
  8047. IntermediateCode.InitOperand(reg);
  8048. IF p1 # NIL THEN
  8049. FOR i := firstPar TO x.parameters.Length()-1 DO
  8050. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8051. parameter := x.parameters.GetExpression(i);
  8052. Evaluate(parameter,r);
  8053. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8054. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8055. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8056. END;
  8057. Emit(Push(position,r.op));
  8058. IF i=1 THEN
  8059. CopyInt(reg,r.op);
  8060. ELSE
  8061. MulInt(reg, reg, r.op);
  8062. END;
  8063. ReleaseOperand(r);
  8064. INC(dim);
  8065. END;
  8066. Convert(reg,addressType);
  8067. ELSE
  8068. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8069. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  8070. END;
  8071. openDim := dim;
  8072. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  8073. IF backend.cooperative THEN
  8074. size := ToMemoryUnits(system,system.SizeOf(type));
  8075. WHILE type IS SyntaxTree.ArrayType DO
  8076. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8077. END;
  8078. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  8079. IF (size # 1) THEN
  8080. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8081. END;
  8082. Emit(Push(position,reg));
  8083. size := ToMemoryUnits(system,system.SizeOf(type));
  8084. IF (size # 1) THEN
  8085. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8086. END;
  8087. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  8088. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  8089. Emit(Push(position,reg));
  8090. ReleaseIntermediateOperand(reg);
  8091. CallThis(position,"Runtime","New", 1);
  8092. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8093. Emit(Result(position, pointer));
  8094. exit := NewLabel();
  8095. else := NewLabel();
  8096. BreqL(else,pointer,nil);
  8097. IF ~type.hasPointers THEN
  8098. Basic.ToSegmentedName ("BaseTypes.Array",name);
  8099. ELSIF type IS SyntaxTree.RecordType THEN
  8100. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  8101. ELSIF type IS SyntaxTree.ProcedureType THEN
  8102. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  8103. ELSE
  8104. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  8105. END;
  8106. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  8107. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  8108. 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))));
  8109. IF type IS SyntaxTree.RecordType THEN
  8110. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  8111. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  8112. ELSE
  8113. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  8114. END;
  8115. i := openDim;
  8116. WHILE i > 0 DO
  8117. DEC (i);
  8118. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  8119. END;
  8120. needsTrace := p0.NeedsTrace();
  8121. IF needsTrace THEN ModifyAssignments(true) END;
  8122. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  8123. Emit(Push(position, pointer));
  8124. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  8125. Emit(Pop(position, pointer));
  8126. END;
  8127. Designate(p0,l);
  8128. IF needsTrace THEN
  8129. CallAssignPointer(l.op, pointer);
  8130. ModifyAssignments(false);
  8131. ELSE
  8132. ToMemory(l.op,addressType,0);
  8133. Emit(Mov(position,l.op,pointer));
  8134. END;
  8135. ReleaseIntermediateOperand(pointer);
  8136. ReleaseOperand(l);
  8137. BrL(exit);
  8138. SetLabel(else);
  8139. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  8140. Designate(p0,l);
  8141. IF needsTrace THEN
  8142. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  8143. ELSE
  8144. ToMemory(l.op,addressType,0);
  8145. Emit(Mov(position,l.op,pointer));
  8146. END;
  8147. ReleaseOperand(l);
  8148. SetLabel(exit);
  8149. ELSE
  8150. (*! the following code is only correct for "standard" Oberon calling convention *)
  8151. IF SemanticChecker.ContainsPointer(type) THEN
  8152. IF type IS SyntaxTree.ArrayType THEN
  8153. staticLength := 1;
  8154. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8155. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8156. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8157. END;
  8158. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  8159. MulInt(reg,reg,tmp);
  8160. END;
  8161. Designate(p0,l);
  8162. IF openDim > 0 THEN
  8163. Emit(Push(position,l.op)); (* address for use after syscall *)
  8164. END;
  8165. Emit(Push(position,l.op)); (* address *)
  8166. ReleaseOperand(l);
  8167. tmp := TypeDescriptorAdr(type);
  8168. Emit(Push(position,tmp)); (* type descriptor *)
  8169. ReleaseIntermediateOperand(tmp);
  8170. Emit(Push(position,reg)); (* number Elements *)
  8171. ReleaseIntermediateOperand(reg);
  8172. tmp := IntermediateCode.Immediate(addressType,dim);
  8173. Emit(Push(position,tmp)); (* dimensions *)
  8174. (* push realtime flag *)
  8175. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8176. ELSE Emit(Push(position,false));
  8177. END;
  8178. CallThis(position,"Heaps","NewArr",5)
  8179. ELSE
  8180. size := ToMemoryUnits(system,system.SizeOf(type));
  8181. IF (size # 1) THEN
  8182. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  8183. (*
  8184. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  8185. *)
  8186. END;
  8187. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  8188. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  8189. AddInt(reg, reg, tmp);
  8190. (*
  8191. Emit(Add(position,reg,reg,tmp));
  8192. *)
  8193. Designate(p0,l);
  8194. IF openDim >0 THEN
  8195. Emit(Push(position,l.op)); (* address for use after syscall *)
  8196. END;
  8197. Emit(Push(position,l.op)); (* address for syscall *)
  8198. ReleaseOperand(l); (* pointer address *)
  8199. Emit(Push(position,reg)); (* size *)
  8200. ReleaseIntermediateOperand(reg);
  8201. (* push realtime flag *)
  8202. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8203. ELSE Emit(Push(position,false));
  8204. END;
  8205. CallThis(position,"Heaps","NewSys", 3)
  8206. END;
  8207. IF openDim > 0 THEN
  8208. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8209. Emit(Pop(position,adr));
  8210. ToMemory(adr,addressType,0);
  8211. ReuseCopy(tmp,adr);
  8212. ReleaseIntermediateOperand(adr);
  8213. adr := tmp;
  8214. else := NewLabel();
  8215. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  8216. i := openDim-1;
  8217. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8218. WHILE (i >= 0) DO
  8219. Emit(Pop(position,reg));
  8220. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  8221. Emit(Mov(position,res,reg));
  8222. DEC(i);
  8223. END;
  8224. ReleaseIntermediateOperand(adr);
  8225. ReleaseIntermediateOperand(reg);
  8226. exit := NewLabel();
  8227. BrL(exit);
  8228. SetLabel(else);
  8229. (* else part: array could not be allocated *)
  8230. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  8231. Emit(Add(position,sp,sp,tmp));
  8232. SetLabel(exit);
  8233. END;
  8234. END;
  8235. END;
  8236. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8237. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  8238. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  8239. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8240. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8241. callingConvention := procedureType.callingConvention;
  8242. left.SetType(procedure.type);
  8243. formalParameter := procedureType.firstParameter;
  8244. (* push array to allocate *)
  8245. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  8246. formalParameter :=formalParameter.nextParameter;
  8247. (* push length array *)
  8248. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  8249. (* push size *)
  8250. type := t0;
  8251. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  8252. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8253. END;
  8254. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  8255. Emit(Push(position,tmp));
  8256. (* *)
  8257. IF SemanticChecker.ContainsPointer(type) THEN
  8258. tmp := TypeDescriptorAdr(type);
  8259. ELSE
  8260. tmp := IntermediateCode.Immediate(addressType, 0);
  8261. END;
  8262. Emit(Push(position,tmp)); (* type descriptor *)
  8263. StaticCallOperand(result,procedure);
  8264. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8265. ReleaseOperand(result);
  8266. END;
  8267. (*
  8268. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  8269. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  8270. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  8271. *)
  8272. ELSE
  8273. (*
  8274. push len0
  8275. push len1
  8276. push len2
  8277. push size
  8278. push len_adr
  8279. push element_size
  8280. push tag
  8281. push adr
  8282. *)
  8283. dim := 0;
  8284. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8285. isTensor := TRUE;
  8286. ELSE
  8287. isTensor := FALSE;
  8288. END;
  8289. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8290. IF ~isTensor THEN
  8291. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8292. END;
  8293. parameter := x.parameters.GetExpression(i);
  8294. Evaluate(parameter,r);
  8295. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8296. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8297. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8298. END;
  8299. Emit(Push(position,r.op));
  8300. ReleaseOperand(r);
  8301. INC(dim);
  8302. END;
  8303. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8304. Emit(Mov(position, adr, sp));
  8305. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8306. Emit(Push(position, adr));
  8307. ReleaseIntermediateOperand(adr);
  8308. openDim := dim;
  8309. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  8310. IF isTensor THEN
  8311. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  8312. ELSE
  8313. baseType := SemanticChecker.ArrayBase(type,openDim);
  8314. END;
  8315. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  8316. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  8317. IF SemanticChecker.ContainsPointer(baseType) THEN
  8318. tmp := TypeDescriptorAdr(baseType);
  8319. ELSE
  8320. tmp := nil;
  8321. END;
  8322. Emit(Push(position,tmp)); (* type descriptor *)
  8323. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  8324. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  8325. ELSE (* error message has already been emited *)
  8326. RETURN;
  8327. END;
  8328. Designate(p0,l);
  8329. IF isTensor THEN
  8330. Emit(Push(position,l.op)); (* address *)
  8331. ELSE
  8332. Emit(Push(position,l.tag)); (* address *)
  8333. END;
  8334. ReleaseOperand(l);
  8335. StaticCallOperand(result,procedure);
  8336. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8337. ReleaseOperand(result);
  8338. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8339. Emit(Add(position,sp,sp,tmp));
  8340. END;
  8341. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8342. THEN
  8343. IF ~backend.cellsAreObjects THEN RETURN END;
  8344. IF InCellScope(currentScope) THEN
  8345. PushSelfPointer()
  8346. ELSE
  8347. Emit(Push(position, nil));
  8348. END;
  8349. (* push temp address *)
  8350. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8351. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8352. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8353. (* l.op contains address of pointer to record *)
  8354. Emit(Push(position,l.op)); (* address for use after syscall *)
  8355. ReleaseOperand(l);
  8356. (* push type descriptor *)
  8357. reg := TypeDescriptorAdr(baseType);
  8358. Emit(Push(position,reg));
  8359. ReleaseIntermediateOperand(reg);
  8360. (* push name *)
  8361. (*Global.GetSymbolName(p0, n);*)
  8362. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8363. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8364. ELSE
  8365. Global.GetModuleName(module.module, n);
  8366. END;
  8367. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8368. (*type.typeDeclaration.GetName(n);*)
  8369. PushConstString(n);
  8370. (* push cellnet boolean *)
  8371. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8372. (* push engine boolean *)
  8373. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8374. (* allocate *)
  8375. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8376. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8377. (* l.op contains address of pointer to record *)
  8378. ToMemory(l.op,addressType,0);
  8379. (* l.op contains value of pointer to record *)
  8380. InitFields(baseType, l.op,0);
  8381. (* add capabilities *)
  8382. modifier := p0(SyntaxTree.Designator).modifiers;
  8383. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8384. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8385. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8386. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8387. END;
  8388. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8389. (*
  8390. modifier := baseType(SyntaxTree.CellType).modifiers;
  8391. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8392. modifier := p0(SyntaxTree.Designator).modifiers;
  8393. *)
  8394. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8395. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8396. (* l.op contains address of pointer to record *)
  8397. ToMemory(l.op,addressType,0);
  8398. (* l.op contains value of pointer to record *)
  8399. Emit(Push(position,l.op)); (* address for use after syscall *)
  8400. ReleaseOperand(l);
  8401. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8402. prevScope := currentScope;
  8403. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8404. previous := section;
  8405. section := init;
  8406. (* add ports *)
  8407. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8408. CloseInitializer(previous);
  8409. currentScope := prevScope;
  8410. Symbol(temporaryVariable,l);
  8411. ToMemory(l.op,addressType,0);
  8412. Emit(Push(position,l.op));
  8413. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8414. (*
  8415. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8416. IF constructor # NIL THEN
  8417. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8418. FOR i := 1 TO x.parameters.Length()-1 DO
  8419. p := x.parameters.GetExpression(i);
  8420. Global.GetSymbolName(parameter,name);
  8421. Evaluate(p, value);
  8422. ASSERT(value.type # NIL);
  8423. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8424. par := instance.AddParameter(name);
  8425. par.SetInteger(value.integer);
  8426. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8427. par := instance.AddParameter(name);
  8428. par.SetBoolean(value.boolean);
  8429. ELSE Error(x.position,NotYetImplemented)
  8430. END;
  8431. parameter := parameter.nextParameter
  8432. END;
  8433. END;
  8434. *)
  8435. (* call initializer *)
  8436. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8437. IF constructor # NIL THEN
  8438. (*! should be unified with ProcedureCallDesignator *)
  8439. IF backend.cellsAreObjects THEN
  8440. Symbol(temporaryVariable,l);
  8441. ToMemory(l.op,addressType,0);
  8442. Emit(Push(position,l.op));
  8443. ReleaseOperand(l);
  8444. END;
  8445. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8446. FOR i := firstPar TO x.parameters.Length()-1 DO
  8447. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8448. formalParameter := formalParameter.nextParameter;
  8449. END;
  8450. (* static call of the constructor *)
  8451. Global.GetSymbolSegmentedName(constructor,name);
  8452. ASSERT(~constructor.isInline);
  8453. IF constructor.scope.ownerModule # module.module THEN
  8454. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8455. ELSE
  8456. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8457. END;
  8458. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8459. (*ELSE
  8460. ReleaseIntermediateOperand(pointer);*)
  8461. END;
  8462. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8463. ToMemory(l.op, addressType, 0);
  8464. Designate(p0,s0);
  8465. ToMemory(s0.op,addressType,0);
  8466. Emit(Mov(position,s0.op,l.op));
  8467. ReleaseOperand(l);
  8468. ReleaseOperand(s0);
  8469. result.tag := emptyOperand;
  8470. (* start *)
  8471. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8472. (* push cell *)
  8473. Symbol(temporaryVariable, l);
  8474. ToMemory(l.op,addressType,0);
  8475. Emit(Push(Basic.invalidPosition,l.op));
  8476. (* push delegate *)
  8477. Emit(Push(Basic.invalidPosition,l.op));
  8478. ReleaseOperand(l);
  8479. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8480. Emit(Push(position, s1.op));
  8481. ReleaseOperand(s1);
  8482. CallThis(position,"ActiveCellsRuntime","Start",3);
  8483. END;
  8484. (*IF temporaryVariable # NIL THEN
  8485. end := NewLabel();
  8486. BrL(end);
  8487. SetLabel(exit);
  8488. Designate(p0,l);
  8489. ToMemory(l.op,addressType,0);
  8490. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8491. ReleaseOperand(l);
  8492. SetLabel(end);
  8493. ELSE
  8494. SetLabel(exit);
  8495. END;
  8496. *)
  8497. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8498. ELSE (* no pointer to record, no pointer to array *)
  8499. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8500. (* ignore new statement *)
  8501. Warning(p0.position, "cannot run on final hardware");
  8502. ELSE
  8503. HALT(200);
  8504. END;
  8505. END;
  8506. (* ---- ADDRESSOF----- *)
  8507. |Global.systemAdr:
  8508. Designate(p0,s0);
  8509. s0.mode := ModeValue;
  8510. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8511. ReleaseIntermediateOperand(s0.op);
  8512. s0.op := s0.tag;
  8513. IntermediateCode.InitOperand(s0.tag);
  8514. END;
  8515. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8516. result := s0;
  8517. (* ---- BIT ----- *)
  8518. |Global.systemBit:
  8519. Evaluate(p0,s0);
  8520. ToMemory(s0.op,addressType,0);
  8521. ReuseCopy(res,s0.op);
  8522. ReleaseOperand(s0);
  8523. Evaluate(p1,s1);
  8524. Emit(Ror(position,res,res,s1.op));
  8525. ReleaseOperand(s1);
  8526. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8527. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8528. InitOperand(result,ModeValue);
  8529. result.op := res;
  8530. (* --- MSK ----*)
  8531. |Global.systemMsk:
  8532. Evaluate(p0,s0);
  8533. Evaluate(p1,s1);
  8534. ReuseCopy(res,s0.op);
  8535. ReleaseOperand(s0);
  8536. Emit(And(position,res,res,s1.op));
  8537. ReleaseOperand(s1);
  8538. InitOperand(result,ModeValue);
  8539. result.op := res;
  8540. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8541. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8542. Evaluate(p0,s0);
  8543. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8544. ReleaseOperand(s0);
  8545. InitOperand(result,ModeValue);
  8546. result.op := res;
  8547. (* ---- SYSTEM.GetStackPointer ----- *)
  8548. |Global.systemGetStackPointer:
  8549. InitOperand(result,ModeValue);
  8550. result.op := sp;
  8551. (* ---- SYSTEM.GetFramePointer ----- *)
  8552. |Global.systemGetFramePointer:
  8553. InitOperand(result,ModeValue);
  8554. result.op := fp;
  8555. (* ---- SYSTEM.GetActivity ----- *)
  8556. |Global.systemGetActivity:
  8557. ASSERT(backend.cooperative);
  8558. InitOperand(result,ModeValue);
  8559. result.op := ap;
  8560. (* ---- SYSTEM.SetStackPointer ----- *)
  8561. |Global.systemSetStackPointer:
  8562. Evaluate(p0,s0); (* *)
  8563. Emit(Mov(position,sp,s0.op));
  8564. ReleaseOperand(s0);
  8565. (* ---- SYSTEM.SetFramePointer ----- *)
  8566. |Global.systemSetFramePointer:
  8567. Evaluate(p0,s0); (* *)
  8568. Emit(Mov(position,fp,s0.op));
  8569. ReleaseOperand(s0);
  8570. (* ---- SYSTEM.Activity ----- *)
  8571. |Global.systemSetActivity:
  8572. ASSERT(backend.cooperative);
  8573. Evaluate(p0,s0); (* *)
  8574. Emit(Mov(position,ap,s0.op));
  8575. ReleaseOperand(s0);
  8576. (* ---- SYSTEM.VAL ----- *)
  8577. |Global.systemVal:
  8578. Expression(p1);
  8579. s1 := result;
  8580. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8581. IF s1.mode = ModeReference THEN
  8582. (* nothing to be done if not record type, just take over new type *)
  8583. IF (type IS SyntaxTree.RecordType) THEN
  8584. ReleaseIntermediateOperand(s1.tag);
  8585. s1.tag := TypeDescriptorAdr(type);
  8586. UseIntermediateOperand(s1.tag);
  8587. END;
  8588. result := s1;
  8589. ELSE (* copy over result to different type, may not use convert *)
  8590. itype := IntermediateCode.GetType(system,type);
  8591. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8592. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8593. Emit(Mov(position,s0.op,s1.op));
  8594. ReleaseOperand(s1);
  8595. InitOperand(result,ModeValue);
  8596. result.op := s0.op;
  8597. ELSE (* different size, must convert *)
  8598. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8599. Convert(s1.op, IntermediateCode.GetType(system,type));
  8600. result := s1;
  8601. END;
  8602. END;
  8603. (* ---- SYSTEM.GET ----- *)
  8604. |Global.systemGet:
  8605. Evaluate(p0,s0); (* adr *)
  8606. Designate(p1,s1); (* variable *)
  8607. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8608. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8609. Emit(Mov(position,s1.op,s0.op));
  8610. ReleaseOperand(s1);
  8611. ReleaseOperand(s0);
  8612. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8613. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8614. Evaluate(p0,s0); (* *)
  8615. Evaluate(p1,s1); (* variable *)
  8616. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8617. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8618. (* real part *)
  8619. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8620. Emit(Mov(position,res, s1.op));
  8621. ReleaseIntermediateOperand(res);
  8622. (* imaginary part *)
  8623. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8624. Emit(Mov(position,res, s1.tag));
  8625. ReleaseIntermediateOperand(res);
  8626. ReleaseOperand(s1);
  8627. ReleaseOperand(s0);
  8628. ELSE
  8629. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8630. ReleaseOperand(s0);
  8631. Emit(Mov(position,res,s1.op));
  8632. ReleaseIntermediateOperand(res);
  8633. ReleaseOperand(s1);
  8634. END;
  8635. (* ---- SYSTEM.MOVE ----- *)
  8636. |Global.systemMove:
  8637. Evaluate(p0,s0);
  8638. Evaluate(p1,s1);
  8639. Evaluate(p2,s2);
  8640. Emit(Copy(position,s1.op,s0.op,s2.op));
  8641. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8642. (* ---- SYSTEM.NEW ----- *)
  8643. |Global.systemNew:
  8644. Designate(p0,s0);
  8645. Emit(Push(position,s0.op));
  8646. ReleaseOperand(s0);
  8647. Evaluate(p1,s1);
  8648. Emit(Push(position,s1.op));
  8649. ReleaseOperand(s1);
  8650. (* push realtime flag: false by default *)
  8651. Emit(Push(position,false));
  8652. CallThis(position,"Heaps","NewSys",3);
  8653. (* ---- SYSTEM.CALL ----- *)
  8654. |Global.systemRef:
  8655. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8656. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8657. s0.mode := ModeValue;
  8658. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8659. result := s0
  8660. (* ---- INCR ----- *)
  8661. |Global.Incr:
  8662. Designate(p0,operand);
  8663. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8664. Dereference(operand,p0.type.resolved,FALSE);
  8665. END;
  8666. ASSERT(p1 # NIL);
  8667. Evaluate(p1,l);
  8668. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8669. ReleaseOperand(operand); ReleaseOperand(l);
  8670. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8671. (* ---- SUM ----- *)
  8672. |Global.Sum: HALT(200);
  8673. (* ---- ALL ----- *)
  8674. |Global.All: HALT(200);
  8675. (* ---- CAS ----- *)
  8676. |Global.Cas:
  8677. needsTrace := backend.cooperative & p0.NeedsTrace();
  8678. IF needsTrace THEN ModifyAssignments(true) END;
  8679. Designate(p0,s0);
  8680. Evaluate(p1,s1);
  8681. Evaluate(p2,s2);
  8682. IF needsTrace THEN
  8683. Emit(Push(position, s0.op));
  8684. Emit(Push(position, s1.op));
  8685. Emit(Push(position, s2.op));
  8686. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8687. ELSE
  8688. Emit(Cas(position,s0.op,s1.op,s2.op));
  8689. END;
  8690. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8691. IF needsTrace THEN ModifyAssignments(false) END;
  8692. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8693. Emit(Result(position, res));
  8694. result.op := res;
  8695. result.mode := ModeValue;
  8696. (*
  8697. IF conditional THEN
  8698. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8699. BrL(falseLabel);
  8700. ReleaseIntermediateOperand(res);
  8701. END;
  8702. *)
  8703. (* ---- DIM ----- *)
  8704. |Global.Dim:
  8705. Designate(p0,s0);
  8706. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8707. Dereference(s0,p0.type.resolved,FALSE);
  8708. END;
  8709. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8710. ReleaseOperand(s0);
  8711. (* ---- RESHAPE ----- *)
  8712. |Global.Reshape:
  8713. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8714. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8715. left.SetType(procedure.type);
  8716. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8717. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8718. END;
  8719. (* ---- SYSTEM.TYPECODE ----- *)
  8720. |Global.systemTypeCode:
  8721. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8722. IF type.resolved IS SyntaxTree.PointerType THEN
  8723. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8724. END;
  8725. result.op := TypeDescriptorAdr(type);
  8726. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8727. result.mode := ModeValue;
  8728. (* ---- SYSTEM.TRACE ----- *)
  8729. |Global.systemTrace:
  8730. SystemTrace(x.parameters, x.position);
  8731. (* ----- CONNECT ------*)
  8732. |Global.Connect:
  8733. IF backend.cellsAreObjects THEN
  8734. PushPort(p0);
  8735. PushPort(p1);
  8736. IF p2 # NIL THEN
  8737. Evaluate(p2, s2);
  8738. Emit(Push(p2.position, s2.op));
  8739. ReleaseOperand(s2);
  8740. ELSE
  8741. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8742. END;
  8743. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8744. ELSE
  8745. Warning(x.position, "cannot run on final hardware");
  8746. END;
  8747. (* ----- DELEGATE ------*)
  8748. |Global.Delegate:
  8749. IF backend.cellsAreObjects THEN
  8750. PushPort(p0);
  8751. PushPort(p1);
  8752. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8753. ELSE
  8754. Warning(x.position, "cannot run on final hardware");
  8755. END;
  8756. (* ----- SEND ------*)
  8757. |Global.Send:
  8758. Evaluate(p0,s0);
  8759. Evaluate(p1,s1);
  8760. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8761. Emit(Push(position,s0.op));
  8762. Emit(Push(position,s1.op));
  8763. (*
  8764. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8765. *)
  8766. IF ~backend.cellsAreObjects THEN
  8767. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8768. END;
  8769. ReleaseOperand(s0);
  8770. ReleaseOperand(s1);
  8771. IF backend.cellsAreObjects THEN
  8772. CallThis(position,"ActiveCellsRuntime","Send",2);
  8773. ELSE
  8774. CallThis(position,ChannelModuleName,"Send",2);
  8775. END;
  8776. (* ----- RECEIVE ------*)
  8777. |Global.Receive:
  8778. Evaluate(p0,s0);
  8779. Emit(Push(position,s0.op));
  8780. Designate(p1,s1);
  8781. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8782. Emit(Push(position,s1.op));
  8783. IF p2 # NIL THEN
  8784. Designate(p2,s2);
  8785. Emit(Push(position,s2.op));
  8786. END;
  8787. (*
  8788. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8789. *)
  8790. IF ~backend.cellsAreObjects THEN
  8791. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8792. END;
  8793. ReleaseOperand(s0);
  8794. ReleaseOperand(s1);
  8795. ReleaseOperand(s2);
  8796. IF backend.cellsAreObjects THEN
  8797. IF p2 = NIL THEN
  8798. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8799. ELSE
  8800. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8801. END;
  8802. ELSE
  8803. IF p2 = NIL THEN
  8804. CallThis(position,ChannelModuleName,"Receive",2)
  8805. ELSE
  8806. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8807. END;
  8808. END;
  8809. | Global.systemSpecial:
  8810. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8811. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8812. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8813. (* determine if parameters are of the VAR kind *)
  8814. ASSERT(x.parameters.Length() <= 3);
  8815. formalParameter := procedureType.firstParameter;
  8816. FOR i := 0 TO x.parameters.Length() - 1 DO
  8817. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8818. formalParameter := formalParameter.nextParameter
  8819. END;
  8820. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8821. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8822. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8823. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8824. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8825. IF procedureType.returnType # NIL THEN
  8826. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8827. Emit(Result(position, res));
  8828. (*InitOperand(result,ModeValue);
  8829. result.op := res;
  8830. *)
  8831. InitOperand(result,ModeValue); result.op := res;
  8832. END
  8833. ELSE (* function not yet implemented *)
  8834. Error(position,"not yet implemented");
  8835. END;
  8836. destination := dest;
  8837. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8838. END VisitBuiltinCallDesignator;
  8839. PROCEDURE EvaluateBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator; VAR result: Operand);
  8840. VAR
  8841. p0,p1,p2: SyntaxTree.Expression; len: LONGINT; l: Operand; res,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8842. s0,s1,s2: Operand; hint: HUGEINT;
  8843. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  8844. tmp:IntermediateCode.Operand;
  8845. t0,t1,t2: SyntaxTree.Type; ignore: Label;
  8846. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  8847. operand: Operand;
  8848. dest: IntermediateCode.Operand;
  8849. itype: IntermediateCode.Type;
  8850. convert: BOOLEAN;
  8851. customBuiltin: SyntaxTree.CustomBuiltin;
  8852. isVarPar: ARRAY 3 OF BOOLEAN;
  8853. callsection: Sections.Section;
  8854. segmentedName: Basic.SegmentedName;
  8855. needsTrace: BOOLEAN;
  8856. BEGIN
  8857. IF Trace THEN TraceEnter("EvaluateBuiltinCallDesignator") END;
  8858. dest := destination; destination := emptyOperand;
  8859. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  8860. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  8861. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  8862. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  8863. CASE x.id OF
  8864. (* ---- ASH, LSH, ROT ----- *)
  8865. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  8866. EvaluateX(p0, s0);
  8867. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  8868. (* make unsigned arguments in order to produced a logical shift *)
  8869. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  8870. convert:= TRUE;
  8871. itype := s0.op.type;
  8872. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  8873. Convert(s0.op,itype);
  8874. ELSE
  8875. convert := FALSE;
  8876. END;
  8877. END;
  8878. EvaluateX(p1,s1);
  8879. IF IsIntegerConstant(p1,hint) THEN
  8880. ReuseCopy(reg,s0.op);
  8881. IF hint > 0 THEN
  8882. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  8883. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  8884. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  8885. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  8886. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  8887. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  8888. END;
  8889. ELSIF hint < 0 THEN
  8890. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  8891. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  8892. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  8893. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  8894. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  8895. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  8896. END;
  8897. END;
  8898. ReleaseOperand(s0); ReleaseOperand(s1);
  8899. ELSE
  8900. exit := NewLabel();
  8901. end := NewLabel();
  8902. ReuseCopy(reg,s0.op);
  8903. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  8904. Reuse1(tmp,s1.op);
  8905. Emit(Neg(position,tmp,s1.op));
  8906. Convert(tmp,s1.op.type);
  8907. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  8908. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  8909. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  8910. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  8911. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  8912. END;
  8913. ReleaseIntermediateOperand(tmp);
  8914. BrL(end);
  8915. SetLabel(exit);
  8916. ReuseCopy(tmp,s1.op);
  8917. Convert(tmp,s1.op.type);
  8918. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  8919. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  8920. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  8921. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  8922. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  8923. END;
  8924. ReleaseIntermediateOperand(tmp);
  8925. SetLabel(end);
  8926. ReleaseOperand(s0); ReleaseOperand(s1);
  8927. END;
  8928. InitOperand(result,ModeValue);
  8929. IF convert THEN
  8930. itype := reg.type;
  8931. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  8932. Convert(reg,itype);
  8933. END;
  8934. result.op := reg;
  8935. (* ---- CAP ----- *)
  8936. |Global.Cap:
  8937. EvaluateX(p0,result);
  8938. ReuseCopy(reg,result.op);
  8939. ReleaseIntermediateOperand(result.op);
  8940. ignore := NewLabel();
  8941. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  8942. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  8943. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  8944. SetLabel(ignore);
  8945. result.op := reg;
  8946. (* ---- CHR ----- *)
  8947. |Global.Chr, Global.Chr32:
  8948. EvaluateX(p0, result);
  8949. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8950. |Global.Entier, Global.EntierH:
  8951. EvaluateX(p0, result);
  8952. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8953. (* ---- MIN and MAX ----- *)
  8954. |Global.Max,Global.Min:
  8955. EvaluateX(p0, s0);
  8956. EvaluateX(p1, s1);
  8957. Reuse2(res,s0.op,s1.op);
  8958. else := NewLabel();
  8959. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  8960. ELSE BrltL(else,s1.op,s0.op) END;
  8961. Emit(Mov(position,res,s0.op));
  8962. ReleaseOperand(s0);
  8963. end := NewLabel();
  8964. BrL(end);
  8965. SetLabel(else);
  8966. Emit(MovReplace(position,res,s1.op));
  8967. SetLabel(end);
  8968. ReleaseOperand(s1);
  8969. InitOperand(result,ModeValue);
  8970. result.op := res;
  8971. (* ---- ODD ----- *)
  8972. |Global.Odd:
  8973. EvaluateX(p0, result);
  8974. Reuse1(res,result.op);
  8975. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8976. ReleaseIntermediateOperand(result.op);
  8977. result.op := res;
  8978. Convert(result.op,bool);
  8979. (* ---- ORD ----- *)
  8980. |Global.Ord, Global.Ord32:
  8981. EvaluateX(p0, result);
  8982. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8983. (* ---- SHORT, LONG ----- *)
  8984. |Global.Short, Global.Long:
  8985. EvaluateX(p0, result);
  8986. IF x.type IS SyntaxTree.ComplexType THEN
  8987. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8988. Convert(result.op, IntermediateCode.GetType(system, componentType));
  8989. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  8990. ELSE
  8991. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8992. END
  8993. (* ---- LEN ----- *)
  8994. |Global.Len: (* dynamic length, static length done by checker *)
  8995. Designate(p0,operand);
  8996. IF p1 = NIL THEN
  8997. InitOperand(l,ModeValue);
  8998. l.op := IntermediateCode.Immediate(sizeType,0);
  8999. ELSE
  9000. Evaluate(p1,l);
  9001. END;
  9002. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  9003. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  9004. Dereference(operand, p0.type.resolved, FALSE);
  9005. END;
  9006. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  9007. ReleaseOperand(operand); ReleaseOperand(l);
  9008. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  9009. ASSERT(p1 # NIL);
  9010. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9011. Dereference(operand,p0.type.resolved,FALSE);
  9012. END;
  9013. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  9014. ReleaseOperand(operand); ReleaseOperand(l);
  9015. ELSE HALT(100);
  9016. END;
  9017. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9018. (* ---- FIRST ---- *)
  9019. |Global.First:
  9020. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9021. EvaluateX(p0(SyntaxTree.RangeExpression).first, result)
  9022. ELSE
  9023. Designate(p0, result)
  9024. END
  9025. (* ---- LAST ---- *)
  9026. |Global.Last:
  9027. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9028. EvaluateX(p0(SyntaxTree.RangeExpression).last, result)
  9029. ELSE
  9030. Designate(p0, result);
  9031. (* make sure result.op is a register *)
  9032. tmp := result.op;
  9033. ReuseCopy(result.op, result.op);
  9034. ReleaseIntermediateOperand(tmp);
  9035. (* add offset to result.op *)
  9036. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9037. END
  9038. (* ---- STEP ---- *)
  9039. |Global.Step:
  9040. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9041. EvaluateX(p0(SyntaxTree.RangeExpression).step, result)
  9042. ELSE
  9043. Designate(p0, result);
  9044. (* make sure result.op is a register *)
  9045. tmp := result.op;
  9046. ReuseCopy(result.op, result.op);
  9047. ReleaseIntermediateOperand(tmp);
  9048. (* add offset to result.op *)
  9049. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9050. END
  9051. (* ---- RE ---- *)
  9052. |Global.Re:
  9053. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  9054. Designate(p0, result)
  9055. ELSE
  9056. EvaluateX(p0, result)
  9057. END
  9058. (* ---- IM ---- *)
  9059. |Global.Im:
  9060. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  9061. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  9062. Designate(p0, result);
  9063. (* make sure result.op is a register *)
  9064. tmp := result.op;
  9065. ReuseCopy(result.op, result.op);
  9066. ReleaseIntermediateOperand(tmp);
  9067. (* add offset to result.op *)
  9068. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  9069. (* ---- ABS ----- *)
  9070. |Global.Abs:
  9071. EvaluateX(p0,operand);
  9072. type := p0.type.resolved;
  9073. InitOperand(result,ModeValue);
  9074. Reuse1a(result.op,operand.op,dest);
  9075. Emit(Abs(position,result.op,operand.op));
  9076. ReleaseOperand(operand);
  9077. (* ---- ADDRESSOF----- *)
  9078. |Global.systemAdr:
  9079. Designate(p0,s0);
  9080. s0.mode := ModeValue;
  9081. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  9082. ReleaseIntermediateOperand(s0.op);
  9083. s0.op := s0.tag;
  9084. IntermediateCode.InitOperand(s0.tag);
  9085. END;
  9086. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  9087. result := s0;
  9088. (* ---- BIT ----- *)
  9089. |Global.systemBit:
  9090. EvaluateX(p0,s0);
  9091. ToMemory(s0.op,addressType,0);
  9092. ReuseCopy(res,s0.op);
  9093. ReleaseOperand(s0);
  9094. EvaluateX(p1, s1);
  9095. Emit(Ror(position,res,res,s1.op));
  9096. ReleaseOperand(s1);
  9097. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  9098. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  9099. InitOperand(result,ModeValue);
  9100. result.op := res;
  9101. (* --- MSK ----*)
  9102. |Global.systemMsk:
  9103. EvaluateX(p0, s0);
  9104. EvaluateX(p1, s1);
  9105. ReuseCopy(res,s0.op);
  9106. ReleaseOperand(s0);
  9107. Emit(And(position,res,res,s1.op));
  9108. ReleaseOperand(s1);
  9109. InitOperand(result,ModeValue);
  9110. result.op := res;
  9111. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  9112. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  9113. EvaluateX(p0, s0);
  9114. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  9115. ReleaseOperand(s0);
  9116. InitOperand(result,ModeValue);
  9117. result.op := res;
  9118. (* ---- SYSTEM.GetStackPointer ----- *)
  9119. |Global.systemGetStackPointer:
  9120. InitOperand(result,ModeValue);
  9121. result.op := sp;
  9122. (* ---- SYSTEM.GetFramePointer ----- *)
  9123. |Global.systemGetFramePointer:
  9124. InitOperand(result,ModeValue);
  9125. result.op := fp;
  9126. (* ---- SYSTEM.GetActivity ----- *)
  9127. |Global.systemGetActivity:
  9128. ASSERT(backend.cooperative);
  9129. InitOperand(result,ModeValue);
  9130. result.op := ap;
  9131. (* ---- SYSTEM.SetStackPointer ----- *)
  9132. |Global.systemSetStackPointer:
  9133. Evaluate(p0,s0); (* *)
  9134. Emit(Mov(position,sp,s0.op));
  9135. ReleaseOperand(s0);
  9136. (* ---- SYSTEM.SetFramePointer ----- *)
  9137. |Global.systemSetFramePointer:
  9138. Evaluate(p0,s0); (* *)
  9139. Emit(Mov(position,fp,s0.op));
  9140. ReleaseOperand(s0);
  9141. (* ---- SYSTEM.Activity ----- *)
  9142. |Global.systemSetActivity:
  9143. ASSERT(backend.cooperative);
  9144. Evaluate(p0,s0); (* *)
  9145. Emit(Mov(position,ap,s0.op));
  9146. ReleaseOperand(s0);
  9147. (* ---- SYSTEM.VAL ----- *)
  9148. |Global.systemVal:
  9149. Expression(p1);
  9150. s1 := result;
  9151. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9152. IF s1.mode = ModeReference THEN
  9153. (* nothing to be done if not record type, just take over new type *)
  9154. IF (type IS SyntaxTree.RecordType) THEN
  9155. ReleaseIntermediateOperand(s1.tag);
  9156. s1.tag := TypeDescriptorAdr(type);
  9157. UseIntermediateOperand(s1.tag);
  9158. END;
  9159. result := s1;
  9160. ELSE (* copy over result to different type, may not use convert *)
  9161. itype := IntermediateCode.GetType(system,type);
  9162. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  9163. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  9164. Emit(Mov(position,s0.op,s1.op));
  9165. ReleaseOperand(s1);
  9166. InitOperand(result,ModeValue);
  9167. result.op := s0.op;
  9168. ELSE (* different size, must convert *)
  9169. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  9170. Convert(s1.op, IntermediateCode.GetType(system,type));
  9171. result := s1;
  9172. END;
  9173. END;
  9174. (* ---- SYSTEM.GET ----- *)
  9175. |Global.systemGet:
  9176. Evaluate(p0,s0); (* adr *)
  9177. Designate(p1,s1); (* variable *)
  9178. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  9179. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  9180. Emit(Mov(position,s1.op,s0.op));
  9181. ReleaseOperand(s1);
  9182. ReleaseOperand(s0);
  9183. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  9184. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  9185. Evaluate(p0,s0); (* *)
  9186. Evaluate(p1,s1); (* variable *)
  9187. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  9188. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  9189. (* real part *)
  9190. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  9191. Emit(Mov(position,res, s1.op));
  9192. ReleaseIntermediateOperand(res);
  9193. (* imaginary part *)
  9194. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9195. Emit(Mov(position,res, s1.tag));
  9196. ReleaseIntermediateOperand(res);
  9197. ReleaseOperand(s1);
  9198. ReleaseOperand(s0);
  9199. ELSE
  9200. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  9201. ReleaseOperand(s0);
  9202. Emit(Mov(position,res,s1.op));
  9203. ReleaseIntermediateOperand(res);
  9204. ReleaseOperand(s1);
  9205. END;
  9206. (* ---- SYSTEM.MOVE ----- *)
  9207. |Global.systemMove:
  9208. Evaluate(p0,s0);
  9209. Evaluate(p1,s1);
  9210. Evaluate(p2,s2);
  9211. Emit(Copy(position,s1.op,s0.op,s2.op));
  9212. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9213. (* ---- SYSTEM.NEW ----- *)
  9214. |Global.systemNew:
  9215. Designate(p0,s0);
  9216. Emit(Push(position,s0.op));
  9217. ReleaseOperand(s0);
  9218. Evaluate(p1,s1);
  9219. Emit(Push(position,s1.op));
  9220. ReleaseOperand(s1);
  9221. (* push realtime flag: false by default *)
  9222. Emit(Push(position,false));
  9223. CallThis(position,"Heaps","NewSys",3);
  9224. (* ---- SYSTEM.CALL ----- *)
  9225. |Global.systemRef:
  9226. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  9227. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  9228. s0.mode := ModeValue;
  9229. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  9230. result := s0
  9231. (* ---- INCR ----- *)
  9232. |Global.Incr:
  9233. Designate(p0,operand);
  9234. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9235. Dereference(operand,p0.type.resolved,FALSE);
  9236. END;
  9237. ASSERT(p1 # NIL);
  9238. Evaluate(p1,l);
  9239. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  9240. ReleaseOperand(operand); ReleaseOperand(l);
  9241. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9242. (* ---- SUM ----- *)
  9243. |Global.Sum: HALT(200);
  9244. (* ---- ALL ----- *)
  9245. |Global.All: HALT(200);
  9246. (* ---- CAS ----- *)
  9247. |Global.Cas:
  9248. needsTrace := p0.NeedsTrace();
  9249. IF needsTrace THEN ModifyAssignments(true) END;
  9250. Designate(p0,s0);
  9251. Evaluate(p1,s1);
  9252. Evaluate(p2,s2);
  9253. IF needsTrace THEN
  9254. Emit(Push(position, s0.op));
  9255. Emit(Push(position, s1.op));
  9256. Emit(Push(position, s2.op));
  9257. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  9258. ELSE
  9259. Emit(Cas(position,s0.op,s1.op,s2.op));
  9260. END;
  9261. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9262. IF needsTrace THEN ModifyAssignments(false) END;
  9263. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  9264. Emit(Result(position, res));
  9265. result.op := res;
  9266. result.mode := ModeValue;
  9267. (*
  9268. IF conditional THEN
  9269. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  9270. BrL(falseLabel);
  9271. ReleaseIntermediateOperand(res);
  9272. END;
  9273. *)
  9274. (* ---- DIM ----- *)
  9275. |Global.Dim:
  9276. Designate(p0,s0);
  9277. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9278. Dereference(s0,p0.type.resolved,FALSE);
  9279. END;
  9280. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  9281. ReleaseOperand(s0);
  9282. (* ---- SYSTEM.TYPECODE ----- *)
  9283. |Global.systemTypeCode:
  9284. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9285. IF type.resolved IS SyntaxTree.PointerType THEN
  9286. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  9287. END;
  9288. result.op := TypeDescriptorAdr(type);
  9289. Convert(result.op, IntermediateCode.GetType(system,x.type));
  9290. result.mode := ModeValue;
  9291. (* ---- SYSTEM.TRACE ----- *)
  9292. |Global.systemTrace:
  9293. SystemTrace(x.parameters, x.position);
  9294. (* ----- CONNECT ------*)
  9295. |Global.Connect:
  9296. IF backend.cellsAreObjects THEN
  9297. PushPort(p0);
  9298. PushPort(p1);
  9299. IF p2 # NIL THEN
  9300. Evaluate(p2, s2);
  9301. Emit(Push(p2.position, s2.op));
  9302. ReleaseOperand(s2);
  9303. ELSE
  9304. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  9305. END;
  9306. CallThis(position,"ActiveCellsRuntime","Connect",3);
  9307. ELSE
  9308. Warning(x.position, "cannot run on final hardware");
  9309. END;
  9310. | Global.systemSpecial:
  9311. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  9312. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  9313. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  9314. (* determine if parameters are of the VAR kind *)
  9315. ASSERT(x.parameters.Length() <= 3);
  9316. formalParameter := procedureType.firstParameter;
  9317. FOR i := 0 TO x.parameters.Length() - 1 DO
  9318. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  9319. formalParameter := formalParameter.nextParameter
  9320. END;
  9321. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  9322. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  9323. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  9324. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  9325. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9326. IF procedureType.returnType # NIL THEN
  9327. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9328. Emit(Result(position, res));
  9329. (*InitOperand(result,ModeValue);
  9330. result.op := res;
  9331. *)
  9332. InitOperand(result,ModeValue); result.op := res;
  9333. END
  9334. ELSE (* function not yet implemented *)
  9335. Error(position,"not yet implemented");
  9336. END;
  9337. destination := dest;
  9338. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  9339. END EvaluateBuiltinCallDesignator;
  9340. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  9341. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  9342. BEGIN
  9343. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  9344. dest := destination; destination := emptyOperand;
  9345. Expression(x.left);
  9346. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  9347. ELSIF isUnchecked THEN (* no check *)
  9348. ELSE
  9349. trueL := NewLabel();
  9350. IF IsPointerToRecord(x.left.type,recordType) THEN
  9351. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  9352. Emit(Mov(position,tag, result.op));
  9353. IF result.mode # ModeValue THEN
  9354. ptr := tag;
  9355. IntermediateCode.MakeMemory(ptr,addressType);
  9356. Emit(Mov(position,tag, ptr));
  9357. END;
  9358. IF ~backend.cooperative THEN
  9359. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9360. END;
  9361. IntermediateCode.MakeMemory(tag,addressType);
  9362. ELSE
  9363. tag := result.tag;
  9364. UseIntermediateOperand(tag);
  9365. END;
  9366. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  9367. ReleaseIntermediateOperand(tag);
  9368. EmitTrap(position,TypeCheckTrap);
  9369. SetLabel(trueL);
  9370. END;
  9371. destination := dest;
  9372. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  9373. END VisitTypeGuardDesignator;
  9374. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  9375. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  9376. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  9377. VAR label: Label; pc: LONGINT;
  9378. BEGIN
  9379. IF backend.cooperative & ~isUnchecked THEN
  9380. pc := section.pc;
  9381. label := NewLabel();
  9382. BrneL(label, operand.op, nil);
  9383. EmitTrap(position, NilPointerTrap);
  9384. SetLabel(label);
  9385. INC(statCoopNilCheck, section.pc - pc);
  9386. END;
  9387. END NilCheck;
  9388. BEGIN
  9389. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  9390. ReuseCopy(dereferenced,operand.op);
  9391. ReleaseOperand(operand);
  9392. operand.mode := ModeReference;
  9393. operand.op := dereferenced;
  9394. operand.tag := dereferenced;
  9395. UseIntermediateOperand(operand.tag);
  9396. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  9397. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  9398. ReleaseIntermediateOperand(operand.tag);
  9399. operand.tag := TypeDescriptorAdr(type);
  9400. ELSE
  9401. IF ~backend.cooperative THEN
  9402. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9403. END;
  9404. IntermediateCode.MakeMemory(operand.tag,addressType);
  9405. END;
  9406. NilCheck(operand.op);
  9407. ELSIF type IS SyntaxTree.ArrayType THEN
  9408. IF isUnsafe THEN
  9409. NilCheck(operand.op);
  9410. ReleaseIntermediateOperand(operand.tag);
  9411. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  9412. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9413. ELSE
  9414. operand.tag := emptyOperand;
  9415. END;
  9416. ELSE
  9417. NilCheck(operand.op);
  9418. IF backend.cooperative THEN
  9419. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  9420. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9421. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  9422. ELSE
  9423. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  9424. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  9425. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9426. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  9427. END;
  9428. END;
  9429. ELSIF type IS SyntaxTree.MathArrayType THEN
  9430. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9431. IntermediateCode.MakeMemory(operand.op,addressType);
  9432. ELSE HALT(100);
  9433. END;
  9434. END Dereference;
  9435. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  9436. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  9437. BEGIN
  9438. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  9439. dest := destination; destination := emptyOperand;
  9440. Evaluate(x.left,d);
  9441. type := x.type.resolved;
  9442. prevIsUnchecked := isUnchecked;
  9443. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  9444. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  9445. END;
  9446. Dereference(d,type,IsUnsafePointer(x.left.type));
  9447. isUnchecked := prevIsUnchecked;
  9448. result := d;
  9449. 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
  9450. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  9451. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9452. END;
  9453. END;
  9454. destination := dest;
  9455. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  9456. END VisitDereferenceDesignator;
  9457. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  9458. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  9459. BEGIN
  9460. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  9461. dest := destination; destination := emptyOperand;
  9462. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  9463. tag := result.op;
  9464. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  9465. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  9466. StaticCallOperand(result,procedure.super);
  9467. ReleaseIntermediateOperand(result.tag);
  9468. UseIntermediateOperand(tag); (* necessary ? *)
  9469. result.tag := tag;
  9470. destination := dest;
  9471. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  9472. END VisitSupercallDesignator;
  9473. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  9474. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  9475. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9476. name: Basic.SegmentedName;
  9477. procedure: SyntaxTree.Procedure;
  9478. procedureType: SyntaxTree.ProcedureType;
  9479. BEGIN
  9480. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  9481. dest := destination; destination := emptyOperand;
  9482. scope := currentScope;
  9483. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9484. scope := scope.outerScope;
  9485. END;
  9486. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9487. moduleSection := meta.ModuleSection();
  9488. IF backend.cooperative THEN
  9489. moduleOffset := 0;
  9490. ELSE
  9491. moduleOffset := moduleSection.pc;
  9492. END;
  9493. result.mode := ModeValue;
  9494. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9495. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9496. result.mode := ModeValue;
  9497. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  9498. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  9499. ELSE
  9500. GetBaseRegister(basereg,currentScope,scope);
  9501. InitOperand(result,ModeReference);
  9502. result.op := basereg;
  9503. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9504. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9505. parametersSize := ProcParametersSize(procedure);
  9506. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9507. IF backend.cooperative THEN
  9508. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  9509. END;
  9510. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  9511. MakeMemory(result.op, result.op, addressType, 0);
  9512. END;
  9513. (* tag must be loaded when dereferencing SELF pointer *)
  9514. END;
  9515. destination := dest;
  9516. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  9517. END VisitSelfDesignator;
  9518. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  9519. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  9520. BEGIN
  9521. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  9522. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9523. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9524. parameter := procedureType.returnParameter;
  9525. IF currentIsInline THEN
  9526. map := currentMapper.Get(NIL);
  9527. IF map # NIL THEN
  9528. Designate(map.to, result);
  9529. ELSE
  9530. HALT(200);
  9531. END;
  9532. RETURN;
  9533. END;
  9534. VisitParameter(parameter);
  9535. IF Trace THEN TraceExit("VisitResultDesignator") END;
  9536. END VisitResultDesignator;
  9537. (** values *)
  9538. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  9539. BEGIN
  9540. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  9541. InitOperand(result,ModeValue);
  9542. IF x.value THEN result.op := true ELSE result.op := false END;
  9543. END VisitBooleanValue;
  9544. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  9545. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  9546. BEGIN
  9547. Global.GetModuleSegmentedName(module.module, name);
  9548. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  9549. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  9550. RETURN section
  9551. END GetDataSection;
  9552. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  9553. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  9554. BEGIN
  9555. type := vop.type;
  9556. data := GetDataSection();
  9557. pc := EnterImmediate(data,vop);
  9558. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  9559. IntermediateCode.MakeMemory(vop, type);
  9560. END GetImmediateMem;
  9561. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  9562. BEGIN
  9563. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  9564. InitOperand(result,ModeValue);
  9565. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9566. IF ~supportedImmediate(result.op) &~inData THEN
  9567. GetImmediateMem(result.op)
  9568. END;
  9569. END VisitIntegerValue;
  9570. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  9571. BEGIN
  9572. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  9573. InitOperand(result,ModeValue);
  9574. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  9575. END VisitCharacterValue;
  9576. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  9577. BEGIN
  9578. IF Trace THEN TraceEnter("VisitSetValue") END;
  9579. InitOperand(result,ModeValue);
  9580. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  9581. END VisitSetValue;
  9582. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  9583. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  9584. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  9585. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  9586. BEGIN
  9587. numberElements := x.elements.Length();
  9588. FOR i := 0 TO numberElements-1 DO
  9589. expression := x.elements.GetExpression(i);
  9590. IF expression IS SyntaxTree.MathArrayExpression THEN
  9591. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  9592. ELSE
  9593. inData := TRUE;
  9594. Evaluate(expression,op);
  9595. irv.Emit(Data(position,op.op));
  9596. inData := FALSE;
  9597. ReleaseOperand(op);
  9598. END;
  9599. END;
  9600. END RecursiveData;
  9601. BEGIN
  9602. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  9603. IF ~TryConstantDeclaration() THEN
  9604. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9605. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9606. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9607. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  9608. ELSE
  9609. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9610. END;
  9611. RecursiveData(x.array);
  9612. InitOperand(result,ModeReference);
  9613. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9614. END
  9615. END VisitMathArrayValue;
  9616. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  9617. VAR constant: Sections.Section;
  9618. BEGIN
  9619. IF constantDeclaration = NIL THEN
  9620. RETURN FALSE
  9621. ELSE
  9622. (* Is a constant in this module: did we generate it already? *)
  9623. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  9624. IF constant # NIL THEN
  9625. InitOperand(result,ModeReference);
  9626. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  9627. RETURN TRUE;
  9628. END;
  9629. END;
  9630. RETURN FALSE
  9631. END TryConstantDeclaration;
  9632. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  9633. BEGIN
  9634. constantDeclaration := x;
  9635. VExpression(x.value.resolved);
  9636. END VisitConstant;
  9637. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  9638. BEGIN
  9639. IF Trace THEN TraceEnter("VisitRealValue") END;
  9640. InitOperand(result,ModeValue);
  9641. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9642. END VisitRealValue;
  9643. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  9644. VAR
  9645. componentType: SyntaxTree.Type;
  9646. BEGIN
  9647. IF Trace THEN TraceEnter("VisitComplexValue") END;
  9648. ASSERT(x.type IS SyntaxTree.ComplexType);
  9649. componentType := x.type(SyntaxTree.ComplexType).componentType;
  9650. InitOperand(result,ModeValue);
  9651. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  9652. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  9653. END VisitComplexValue;
  9654. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  9655. VAR i: LONGINT; name: Basic.SegmentedName;
  9656. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  9657. BEGIN
  9658. IF Trace THEN TraceEnter("VisitStringValue") END;
  9659. IF ~TryConstantDeclaration() THEN
  9660. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9661. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9662. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9663. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9664. ELSE
  9665. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9666. END;
  9667. FOR i := 0 TO x.length-1 DO
  9668. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  9669. irv.Emit(Data(position,op));
  9670. END;
  9671. InitOperand(result,ModeReference);
  9672. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9673. result.tag := IntermediateCode.Immediate(addressType,x.length);
  9674. END
  9675. END VisitStringValue;
  9676. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  9677. BEGIN
  9678. IF Trace THEN TraceEnter("VisitNilValue") END;
  9679. InitOperand(result,ModeValue);
  9680. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9681. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9682. END VisitNilValue;
  9683. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  9684. BEGIN
  9685. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  9686. InitOperand(result,ModeValue);
  9687. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  9688. END VisitEnumerationValue;
  9689. (** symbols *)
  9690. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  9691. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  9692. END VisitImport;
  9693. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  9694. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  9695. BEGIN
  9696. WHILE (scope # NIL) & (scope IS SyntaxTree.BlockScope) DO
  9697. scope := scope.outerScope;
  9698. END;
  9699. IF scope # baseScope THEN
  9700. (* left := [fp+8] *)
  9701. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  9702. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9703. ReuseCopy(left,right);
  9704. ReleaseIntermediateOperand(right);
  9705. scope := scope.outerScope; DEC(level);
  9706. (* { left := [left+8] } *)
  9707. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  9708. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9709. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  9710. Emit(Mov(position,left,right));
  9711. scope := scope.outerScope; DEC(level);
  9712. END;
  9713. ASSERT((scope = baseScope) OR (baseScope = NIL));
  9714. result := left;
  9715. ELSE
  9716. result := fp;
  9717. END;
  9718. END GetBaseRegister;
  9719. (* EXPERIMENTAL *)
  9720. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  9721. VAR i: WORD;
  9722. BEGIN
  9723. IF ~backend.experiment THEN RETURN -1 END;
  9724. i := 0;
  9725. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  9726. INC(i);
  9727. END;
  9728. IF availableSymbols[i].symbol = NIL THEN
  9729. availableSymbols[i].inRegister := FALSE;
  9730. availableSymbols[i].inMemory := TRUE;
  9731. availableSymbols[i].symbol := x;
  9732. END;
  9733. RETURN i;
  9734. END GetAvailability;
  9735. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  9736. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  9737. BEGIN
  9738. IF Trace THEN TraceEnter("VisitVariable"); END;
  9739. type := x.type.resolved;
  9740. IF (x.useRegister) THEN
  9741. InitOperand(result, ModeValue);
  9742. IF x.registerNumber < 0 THEN
  9743. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  9744. reg := x.registerNumber;
  9745. ELSE
  9746. reg := registerUsageCount.Map(x.registerNumber);
  9747. UseRegister(reg);
  9748. END;
  9749. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  9750. ELSIF x.externalName # NIL THEN
  9751. InitOperand(result,ModeReference);
  9752. Basic.ToSegmentedName(x.externalName^, name);
  9753. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  9754. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  9755. InitOperand(result,ModeReference);
  9756. GetBaseRegister(result.op,currentScope,x.scope);
  9757. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9758. (* EXPERIMENTAL *)
  9759. result.availability := GetAvailability(x);
  9760. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  9761. InitOperand(result,ModeReference);
  9762. GetCodeSectionNameForSymbol(x,name);
  9763. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9764. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9765. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  9766. InitOperand(result,ModeReference);
  9767. GetCodeSectionNameForSymbol(x,name);
  9768. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9769. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  9770. ELSE (* field, left designator must have been emitted *)
  9771. ASSERT(result.mode = ModeReference);
  9772. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9773. ReuseCopy(temp,result.op);
  9774. ReleaseIntermediateOperand(result.op);
  9775. result.op := temp;
  9776. END;
  9777. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9778. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  9779. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9780. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  9781. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9782. END;
  9783. END;
  9784. END;
  9785. IF type IS SyntaxTree.ProcedureType THEN
  9786. ReleaseIntermediateOperand(result.tag);
  9787. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9788. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9789. UseIntermediateOperand(result.tag);
  9790. ELSE
  9791. result.tag := nil; (* nil *)
  9792. END;
  9793. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9794. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  9795. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9796. ReleaseIntermediateOperand(result.tag);
  9797. Global.GetSymbolSegmentedName(x,name);
  9798. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  9799. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  9800. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  9801. ELSE
  9802. END;
  9803. ELSE
  9804. ReleaseIntermediateOperand(result.tag);
  9805. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9806. END;
  9807. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9808. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  9809. ReleaseIntermediateOperand(result.tag);
  9810. result.tag := result.op;
  9811. UseIntermediateOperand(result.tag);
  9812. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9813. IntermediateCode.MakeMemory(result.op,addressType);
  9814. END;
  9815. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  9816. ReleaseIntermediateOperand(result.tag);
  9817. result.tag := TypeDescriptorAdr(type);
  9818. UseIntermediateOperand(result.tag);
  9819. (* tag for pointer type computed not here but during dereferencing *)
  9820. END;
  9821. IF Trace THEN TraceExit("VisitVariable") END;
  9822. END VisitVariable;
  9823. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  9824. BEGIN
  9825. VisitVariable(property);
  9826. END VisitProperty;
  9827. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  9828. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  9829. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  9830. BEGIN
  9831. type := x.type.resolved;
  9832. IF Trace THEN TraceEnter("VisitParameter") END;
  9833. IF x.ownerType IS SyntaxTree.CellType THEN
  9834. ptype := x.type.resolved;
  9835. IF backend.cellsAreObjects THEN
  9836. ASSERT(result.mode = ModeReference);
  9837. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9838. ReuseCopy(temp,result.op);
  9839. ReleaseIntermediateOperand(result.op);
  9840. result.op := temp;
  9841. END;
  9842. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9843. RETURN;
  9844. ELSE
  9845. InitOperand(result,ModeReference);
  9846. GetCodeSectionNameForSymbol(x,name);
  9847. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9848. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9849. RETURN;
  9850. END;
  9851. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9852. InitOperand(result,ModeReference);
  9853. GetCodeSectionNameForSymbol(x,name);
  9854. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9855. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9856. RETURN
  9857. ELSE
  9858. GetBaseRegister(basereg,currentScope,x.scope);
  9859. InitOperand(result,ModeReference);
  9860. result.op := basereg;
  9861. END;
  9862. IF IsOpenArray(type) THEN
  9863. result.tag := basereg;
  9864. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9865. IntermediateCode.MakeMemory(result.op,addressType);
  9866. IF Global.IsOberonProcedure(x.ownerType) THEN
  9867. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9868. UseIntermediateOperand(result.tag);
  9869. ELSE
  9870. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9871. END;
  9872. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9873. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9874. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9875. ELSIF IsStaticArray(type) THEN
  9876. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9877. IntermediateCode.MakeMemory(result.op,addressType);
  9878. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9879. ELSIF type IS SyntaxTree.MathArrayType THEN
  9880. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9881. WITH type: SyntaxTree.MathArrayType DO
  9882. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9883. IF type.form = SyntaxTree.Tensor THEN
  9884. ELSIF type.form = SyntaxTree.Open THEN
  9885. result.tag := result.op;
  9886. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9887. IntermediateCode.MakeMemory(result.op,addressType);
  9888. UseIntermediateOperand(result.tag);
  9889. ELSIF type.form = SyntaxTree.Static THEN
  9890. IF x.kind = SyntaxTree.ConstParameter THEN
  9891. IntermediateCode.MakeMemory(result.op,addressType);
  9892. END;
  9893. ELSE HALT(100)
  9894. END;
  9895. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9896. IF type.form = SyntaxTree.Tensor THEN
  9897. ToMemory(result.op,addressType,0);
  9898. ELSIF type.form = SyntaxTree.Open THEN
  9899. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9900. ReuseCopy(result.tag, mem);
  9901. ReleaseIntermediateOperand(mem);
  9902. ReleaseIntermediateOperand(result.op);
  9903. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9904. ELSIF type.form = SyntaxTree.Static THEN
  9905. IntermediateCode.MakeMemory(result.op,addressType);
  9906. ELSE HALT(100)
  9907. END;
  9908. ELSE HALT(100)
  9909. END;
  9910. END;
  9911. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9912. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9913. IntermediateCode.MakeMemory(result.op,addressType);
  9914. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9915. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9916. END;
  9917. IF type IS SyntaxTree.ProcedureType THEN
  9918. ReleaseIntermediateOperand(result.tag);
  9919. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9920. IF x.kind = SyntaxTree.VarParameter THEN
  9921. ReuseCopy(result.tag,result.op);
  9922. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9923. IntermediateCode.MakeMemory(result.tag,addressType);
  9924. ELSE
  9925. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9926. UseIntermediateOperand(result.tag);
  9927. END;
  9928. ELSE
  9929. result.tag := nil;
  9930. END;
  9931. (* tag for pointer type computed not here but during dereferencing *)
  9932. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) (* & ~(x.selfParameter) *) THEN
  9933. ReleaseIntermediateOperand(result.tag);
  9934. result.tag := basereg;
  9935. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9936. IntermediateCode.MakeMemory(result.tag,addressType);
  9937. UseIntermediateOperand(result.tag);
  9938. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9939. ReleaseIntermediateOperand(result.tag);
  9940. result.tag := TypeDescriptorAdr(type);
  9941. UseIntermediateOperand(result.tag);
  9942. END;
  9943. IF Trace THEN TraceExit("VisitParameter") END;
  9944. END VisitParameter;
  9945. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9946. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9947. BEGIN
  9948. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9949. (* left.p: left already emitted *)
  9950. tag := result.op; (* value of pointer to left *)
  9951. (* get type desc *)
  9952. tmp := result.tag;
  9953. IntermediateCode.MakeMemory(tmp,addressType);
  9954. (* get method adr *)
  9955. Reuse1(reg,tmp);
  9956. ReleaseIntermediateOperand(tmp);
  9957. IF backend.cooperative THEN
  9958. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9959. WHILE recordType.baseType # NIL DO
  9960. recordType := recordType.GetBaseRecord ();
  9961. END;
  9962. GetRecordTypeName (recordType,name);
  9963. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9964. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9965. offset := 0;
  9966. ELSE
  9967. offset := 2;
  9968. END;
  9969. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9970. ELSIF meta.simple THEN
  9971. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9972. ELSE
  9973. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9974. END;
  9975. InitOperand(operand,ModeReference);
  9976. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9977. operand.op := reg;
  9978. operand.tag := tag;
  9979. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9980. END DynamicCallOperand;
  9981. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9982. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9983. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9984. BEGIN
  9985. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9986. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9987. tag := operand.op;
  9988. ReleaseIntermediateOperand(operand.tag);
  9989. ELSE tag := nil
  9990. END;
  9991. IF x.isInline THEN
  9992. sectionType := Sections.InlineCodeSection;
  9993. ELSE
  9994. sectionType := Sections.CodeSection;
  9995. END;
  9996. IF x.externalName # NIL THEN
  9997. Basic.ToSegmentedName(x.externalName^, name);
  9998. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9999. ELSE
  10000. GetCodeSectionNameForSymbol(x, name);
  10001. IF (x.scope.ownerModule = module.module) THEN
  10002. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10003. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  10004. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10005. IF source.pc = 0 THEN (* no code yet *)
  10006. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  10007. END;
  10008. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  10009. bits := x.procedureScope.body.code.inlineCode;
  10010. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  10011. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  10012. binary.CopyBits(bits, 0, bits.GetSize());
  10013. source.SetResolved(binary);
  10014. ELSE
  10015. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  10016. END;
  10017. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  10018. END;
  10019. InitOperand(operand,ModeValue);
  10020. operand.op := reg;
  10021. operand.tag := tag;
  10022. IF Trace THEN TraceExit("StaticCallOperand") END;
  10023. END StaticCallOperand;
  10024. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  10025. (* handle expressions of the form designator.procedure or procedure *)
  10026. BEGIN
  10027. IF Trace THEN TraceEnter("VisitProcedure") END;
  10028. EndBasicBlock;
  10029. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  10030. DynamicCallOperand(result,x);
  10031. ELSIF x.isInline THEN
  10032. StaticCallOperand(result,x);
  10033. ELSE
  10034. StaticCallOperand(result,x);
  10035. END;
  10036. IF Trace THEN TraceExit("VisitProcedure") END;
  10037. END VisitProcedure;
  10038. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  10039. BEGIN
  10040. VisitProcedure(x);
  10041. END VisitOperator;
  10042. PROCEDURE VisitAlias(x: SyntaxTree.Alias);
  10043. BEGIN
  10044. VExpression(x.expression);
  10045. END VisitAlias;
  10046. (** statements *)
  10047. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  10048. BEGIN
  10049. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  10050. Expression(x.call);
  10051. IF (x.call.type # NIL) THEN (* procedure returning ignored value *)
  10052. ReleaseOperand(result)
  10053. END;
  10054. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  10055. END VisitProcedureCallStatement;
  10056. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  10057. VAR leftType, rightType: SyntaxTree.MathArrayType;
  10058. leftBase, rightBase: SyntaxTree.Type;
  10059. procedureName,s: SyntaxTree.IdentifierString;
  10060. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  10061. size: LONGINT; rightKind: LONGINT;
  10062. dummy: IntermediateCode.Operand;
  10063. CONST moduleName = "FoxArrayBase";
  10064. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  10065. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  10066. BEGIN
  10067. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  10068. IF base IS SyntaxTree.MathArrayType THEN
  10069. base := OpenArray(base(SyntaxTree.MathArrayType));
  10070. END;
  10071. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  10072. result.SetArrayBase(base);
  10073. RETURN result
  10074. END OpenArray;
  10075. BEGIN
  10076. IF AddImport(moduleName,arrayBase,TRUE) THEN
  10077. SaveRegisters();ReleaseUsedRegisters(saved);
  10078. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  10079. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  10080. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  10081. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  10082. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  10083. IF leftType.form = SyntaxTree.Tensor THEN
  10084. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  10085. ELSIF leftType.form = SyntaxTree.Open THEN
  10086. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  10087. ELSIF leftType.form = SyntaxTree.Static THEN
  10088. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  10089. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  10090. END;
  10091. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  10092. IF procedure = NIL THEN
  10093. s := "Instruction not supported on target, emulation procedure ";
  10094. Strings.Append(s,moduleName);
  10095. Strings.Append(s,".");
  10096. Strings.Append(s,procedureName);
  10097. Strings.Append(s," not present");
  10098. Error(position,s);
  10099. ELSE
  10100. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  10101. parameter.SetType(leftType);
  10102. parameter.SetAccess(SyntaxTree.Internal);
  10103. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10104. parameter.SetKind(rightKind);
  10105. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10106. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  10107. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  10108. StaticCallOperand(result,procedure);
  10109. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  10110. ReleaseOperand(result);
  10111. END;
  10112. RestoreRegisters(saved);
  10113. END;
  10114. END AssignMathArray;
  10115. VAR modifyAssignmentCounter := 0: LONGINT;
  10116. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  10117. VAR processor,mem,dst: IntermediateCode.Operand;
  10118. BEGIN
  10119. IF value.intValue = true.intValue THEN
  10120. INC(modifyAssignmentCounter);
  10121. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  10122. modifyAssignmentsPC := section.pc;
  10123. ELSE
  10124. DEC(modifyAssignmentCounter);
  10125. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  10126. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  10127. END;
  10128. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  10129. dst := NewRegisterOperand (addressType);
  10130. Emit(Mov(position,dst, processor));
  10131. IntermediateCode.InitMemory(mem,bool, dst, 0);
  10132. Emit(Mov(position,mem, value));
  10133. ReleaseIntermediateOperand(dst);
  10134. END ModifyAssignments;
  10135. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  10136. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  10137. BEGIN
  10138. type := left.type.resolved;
  10139. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  10140. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  10141. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  10142. IF procedureType.returnParameter = parameter THEN
  10143. (* this is the only case where the destination can be dynamically smaller than the source
  10144. in all other cases the dynamic size has to be taken
  10145. *)
  10146. IF backend.cooperative THEN
  10147. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  10148. ELSE
  10149. MakeMemory(mem, tag, addressType, 0);
  10150. END;
  10151. RETURN mem;
  10152. END;
  10153. END;
  10154. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  10155. END CopySize;
  10156. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  10157. VAR
  10158. leftO, rightO: Operand;
  10159. arg,mem, sizeOp: IntermediateCode.Operand;
  10160. leftType, rightType, componentType, base: SyntaxTree.Type;
  10161. size: LONGINT;
  10162. parameters: SyntaxTree.ExpressionList;
  10163. procedure: SyntaxTree.Procedure;
  10164. call: SyntaxTree.ProcedureCallDesignator;
  10165. designator: SyntaxTree.Designator;
  10166. saved: RegisterEntry;
  10167. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  10168. VAR procedureType: SyntaxTree.ProcedureType;
  10169. BEGIN
  10170. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  10171. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  10172. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  10173. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  10174. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  10175. WITH right: SyntaxTree.BuiltinCallDesignator DO
  10176. IF right.id = Global.Reshape THEN RETURN TRUE
  10177. END;
  10178. END;
  10179. END;
  10180. END;
  10181. RETURN FALSE
  10182. END CanPassAsResultParameter;
  10183. BEGIN
  10184. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  10185. leftType := left.type.resolved; rightType:= right.type.resolved;
  10186. IF backend.cooperative & left.NeedsTrace() THEN
  10187. ModifyAssignments(true);
  10188. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  10189. Designate(right, rightO);
  10190. Designate(left, leftO);
  10191. ASSERT(leftO.mode = ModeReference);
  10192. TransferToRegister(leftO.op, leftO.op);
  10193. TransferToRegister(rightO.op, rightO.op);
  10194. Emit(Push(position, leftO.op));
  10195. Emit(Push(position, rightO.op));
  10196. CallAssignMethod(leftO.op, rightO.op, left.type);
  10197. Emit(Pop(position, rightO.op));
  10198. Emit(Pop(position, leftO.op));
  10199. sizeOp := CopySize(left, leftO.tag);
  10200. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10201. ReleaseIntermediateOperand(sizeOp);
  10202. ReleaseOperand(leftO);
  10203. ReleaseOperand(rightO);
  10204. ELSE
  10205. Evaluate(right,rightO);
  10206. Designate(left,leftO);
  10207. ASSERT(leftO.mode = ModeReference);
  10208. IF (leftType IS SyntaxTree.ProcedureType) THEN
  10209. (* copy procedure address first *)
  10210. MakeMemory(mem,leftO.op,addressType,0);
  10211. Emit(Mov(position,mem,rightO.op));
  10212. ReleaseIntermediateOperand(mem);
  10213. (* copy pointer address *)
  10214. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10215. CallAssignPointer(leftO.tag, rightO.tag);
  10216. ELSE
  10217. ASSERT(system.SizeOf(left.type) = system.addressSize);
  10218. CallAssignPointer(leftO.op, rightO.op);
  10219. END;
  10220. ReleaseOperand(leftO);
  10221. ReleaseOperand(rightO);
  10222. END;
  10223. ModifyAssignments(false);
  10224. RETURN;
  10225. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  10226. SaveRegisters();ReleaseUsedRegisters(saved);
  10227. IF SemanticChecker.IsPointerType(leftType) THEN
  10228. Evaluate(right,rightO);
  10229. Designate(left,leftO);
  10230. Emit(Push(position,leftO.op));
  10231. ReleaseOperand(leftO);
  10232. Emit(Push(position,rightO.op));
  10233. ReleaseOperand(rightO);
  10234. CallThis(position,"Heaps","Assign",2);
  10235. ELSIF leftType.IsRecordType() THEN
  10236. Designate(right,rightO);
  10237. Designate(left,leftO);
  10238. Emit(Push(position,leftO.op));
  10239. Emit(Push(position,leftO.tag)); (* type desc *)
  10240. ReleaseOperand(leftO);
  10241. Emit(Push(position,rightO.op));
  10242. ReleaseOperand(rightO);
  10243. CallThis(position,"Heaps","AssignRecord",3);
  10244. ELSIF IsStaticArray(leftType) THEN
  10245. size := StaticArrayNumElements(leftType);
  10246. base := StaticArrayBaseType(leftType);
  10247. Designate(right,rightO);
  10248. Designate(left,leftO);
  10249. Emit(Push(position,leftO.op));
  10250. ReleaseOperand(leftO);
  10251. arg := TypeDescriptorAdr(base);
  10252. Emit(Push(position,arg));
  10253. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10254. Emit(Push(position,rightO.op));
  10255. ReleaseOperand(rightO);
  10256. CallThis(position,"Heaps","AssignArray",4);
  10257. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  10258. size := StaticMathArrayNumElements(leftType);
  10259. base := StaticMathArrayBaseType(leftType);
  10260. Designate(right,rightO);
  10261. Designate(left,leftO);
  10262. Emit(Push(position,leftO.op));
  10263. ReleaseOperand(leftO);
  10264. arg := TypeDescriptorAdr(base);
  10265. Emit(Push(position,arg));
  10266. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10267. Emit(Push(position,rightO.op));
  10268. ReleaseOperand(rightO);
  10269. CallThis(position,"Heaps","AssignArray",4);
  10270. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  10271. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  10272. Evaluate(right,rightO);
  10273. Designate(left,leftO);
  10274. MakeMemory(mem,leftO.op,addressType,0);
  10275. Emit(Mov(position,mem,rightO.op));
  10276. ReleaseIntermediateOperand(mem);
  10277. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10278. Emit (Push(position, leftO.tag));
  10279. ReleaseOperand(leftO);
  10280. Emit (Push(position, rightO.tag));
  10281. ReleaseOperand(rightO);
  10282. CallThis(position,"Heaps","Assign", 2);
  10283. ELSE HALT(100); (* missing ? *)
  10284. END;
  10285. RestoreRegisters(saved);
  10286. RETURN;
  10287. END;
  10288. IF CanPassAsResultParameter(right) THEN
  10289. procedureResultDesignator := left(SyntaxTree.Designator);
  10290. Expression(right);
  10291. procedureResultDesignator := NIL;
  10292. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  10293. (* left <-- ALIAS OF right: zerocopy *)
  10294. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  10295. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  10296. designator.SetType(procedure.type);
  10297. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  10298. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  10299. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  10300. END;
  10301. ELSIF leftType IS SyntaxTree.RangeType THEN
  10302. (* LHS is of array range type *)
  10303. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  10304. Evaluate(right, rightO);
  10305. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  10306. (* first *)
  10307. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  10308. Emit(Mov(position,mem, rightO.op));
  10309. ReleaseIntermediateOperand(mem);
  10310. (* last *)
  10311. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10312. Emit(Mov(position,mem, rightO.tag));
  10313. ReleaseIntermediateOperand(mem);
  10314. (* step *)
  10315. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10316. Emit(Mov(position,mem, rightO.extra));
  10317. ReleaseIntermediateOperand(mem);
  10318. ReleaseOperand(rightO);
  10319. ReleaseOperand(leftO)
  10320. ELSIF leftType IS SyntaxTree.ComplexType THEN
  10321. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  10322. Evaluate(right, rightO);
  10323. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  10324. componentType := leftType(SyntaxTree.ComplexType).componentType;
  10325. (* real part *)
  10326. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  10327. Emit(Mov(position,mem, rightO.op));
  10328. ReleaseIntermediateOperand(mem);
  10329. (* imaginary part *)
  10330. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10331. Emit(Mov(position,mem, rightO.tag));
  10332. ReleaseIntermediateOperand(mem);
  10333. ReleaseOperand(rightO);
  10334. ReleaseOperand(leftO)
  10335. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  10336. OR (leftType IS SyntaxTree.PortType) THEN
  10337. (* rightO := leftO;*)
  10338. Evaluate(right,rightO);
  10339. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  10340. Designate(left,leftO);
  10341. IF leftO.mode = ModeReference THEN
  10342. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  10343. destination := mem;
  10344. ELSE
  10345. destination := leftO.op;
  10346. END;
  10347. ReleaseOperand(leftO);
  10348. (* EXPERIMENTAL *)
  10349. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  10350. ReleaseIntermediateOperand(destination);
  10351. destination := availableSymbols[leftO.availability].register;
  10352. UseIntermediateOperand(destination);
  10353. availableSymbols[leftO.availability].inMemory := FALSE;
  10354. END;
  10355. IF destination.mode # IntermediateCode.Undefined THEN
  10356. Emit(Mov(position,destination,rightO.op));
  10357. END;
  10358. ReleaseOperand(rightO);
  10359. ReleaseIntermediateOperand(mem);
  10360. IntermediateCode.InitOperand(destination);
  10361. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  10362. Evaluate(right,rightO);
  10363. Designate(left,leftO);
  10364. MakeMemory(mem,leftO.op,addressType,0);
  10365. Emit(Mov(position,mem,rightO.op));
  10366. ReleaseIntermediateOperand(mem);
  10367. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  10368. (* delegate *)
  10369. (*
  10370. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  10371. *)
  10372. Emit(Mov(position,leftO.tag,rightO.tag));
  10373. END;
  10374. ReleaseOperand(leftO);
  10375. ReleaseOperand(rightO);
  10376. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  10377. Designate(right,rightO);
  10378. Designate(left,leftO);
  10379. sizeOp := CopySize(left, leftO.tag);
  10380. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10381. ReleaseIntermediateOperand(sizeOp);
  10382. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10383. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  10384. IF (rightType IS SyntaxTree.StringType) THEN
  10385. CopyString(left,right);
  10386. 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
  10387. Designate(right,rightO);
  10388. Designate(left,leftO);
  10389. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10390. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10391. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10392. ELSE
  10393. HALT(201)
  10394. END;
  10395. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  10396. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  10397. Designate(right,rightO);
  10398. Designate(left,leftO);
  10399. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10400. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  10401. MakeMemory(mem, rightO.op, leftO.op.type,0);
  10402. Emit(Mov(position, leftO.op, mem));
  10403. ReleaseIntermediateOperand(mem);
  10404. ELSE
  10405. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10406. END;
  10407. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10408. ELSE
  10409. AssignMathArray(left,right);
  10410. END;
  10411. ELSE
  10412. HALT(200);
  10413. END;
  10414. END Assign;
  10415. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  10416. BEGIN
  10417. IF Trace THEN TraceEnter("VisitAssignment") END;
  10418. Assign(x.left,x.right);
  10419. IF Trace THEN TraceExit("VisitAssignment") END;
  10420. END VisitAssignment;
  10421. PROCEDURE EmitCooperativeSwitch;
  10422. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  10423. BEGIN
  10424. ASSERT (cooperativeSwitches);
  10425. pc := section.pc;
  10426. IF lastSwitchPC = section.pc THEN RETURN END;
  10427. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  10428. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  10429. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  10430. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  10431. INC(statCoopSwitch, section.pc - pc);
  10432. END EmitCooperativeSwitch;
  10433. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  10434. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  10435. BEGIN
  10436. p0 := communication.left; p1 := communication.right;
  10437. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  10438. Evaluate(p0,s0);
  10439. Evaluate(p1,s1);
  10440. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10441. Emit(Push(position,s0.op));
  10442. Emit(Push(position,s1.op));
  10443. (*
  10444. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10445. *)
  10446. IF ~backend.cellsAreObjects THEN
  10447. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  10448. END;
  10449. ReleaseOperand(s0);
  10450. ReleaseOperand(s1);
  10451. IF backend.cellsAreObjects THEN
  10452. CallThis(position,"ActiveCellsRuntime","Send",2);
  10453. ELSE
  10454. CallThis(position,ChannelModuleName,"Send",2);
  10455. END;
  10456. (* ----- RECEIVE ------*)
  10457. ELSE
  10458. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  10459. tmp := p0; p0 := p1; p1 := tmp;
  10460. END;
  10461. Evaluate(p0,s0);
  10462. Emit(Push(position,s0.op));
  10463. Designate(p1,s1);
  10464. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10465. Emit(Push(position,s1.op));
  10466. (*
  10467. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10468. *)
  10469. IF ~backend.cellsAreObjects THEN
  10470. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  10471. END;
  10472. ReleaseOperand(s0);
  10473. ReleaseOperand(s1);
  10474. IF backend.cellsAreObjects THEN
  10475. CallThis(position,"ActiveCellsRuntime","Receive",2);
  10476. ELSE
  10477. CallThis(position,ChannelModuleName,"Receive",2)
  10478. END;
  10479. END;
  10480. END VisitCommunicationStatement;
  10481. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  10482. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  10483. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  10484. VAR false: Label; condition, value: BOOLEAN;
  10485. BEGIN
  10486. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  10487. IF condition THEN
  10488. false := NewLabel();
  10489. Condition(if.condition,false,FALSE);
  10490. StatementSequence(if.statements);
  10491. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  10492. SetLabel(false);
  10493. ELSE
  10494. IF value THEN (* always true *)
  10495. escape := TRUE;
  10496. StatementSequence(if.statements);
  10497. (* no branch necessary -- rest skipped *)
  10498. END;
  10499. END;
  10500. END IfPart;
  10501. BEGIN
  10502. IF Trace THEN TraceEnter("VisitIfStatement") END;
  10503. end := NewLabel();
  10504. elsifs := x.ElsifParts();
  10505. IfPart(x.ifPart,elsifs=0);
  10506. FOR i := 0 TO elsifs-1 DO
  10507. IF ~escape THEN
  10508. elsif := x.GetElsifPart(i);
  10509. IfPart(elsif, i=elsifs-1);
  10510. END;
  10511. END;
  10512. IF (x.elsePart # NIL) & ~escape THEN
  10513. StatementSequence(x.elsePart);
  10514. END;
  10515. SetLabel(end);
  10516. IF Trace THEN TraceExit("VisitIfStatement") END;
  10517. END VisitIfStatement;
  10518. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  10519. VAR reg: IntermediateCode.Operand;
  10520. BEGIN
  10521. trueL := NewLabel();
  10522. IF backend.cooperative THEN
  10523. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  10524. Emit(Mov(position,reg,tag));
  10525. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  10526. ReleaseIntermediateOperand(reg);
  10527. ELSE
  10528. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  10529. END;
  10530. END BrWithPart;
  10531. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  10532. BEGIN
  10533. StatementSequence(x.statements);
  10534. END EmitWithPart;
  10535. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  10536. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  10537. tag: IntermediateCode.Operand;
  10538. BEGIN
  10539. IF Trace THEN TraceEnter("VisitWithStatement") END;
  10540. endL := NewLabel();
  10541. elseL := NewLabel();
  10542. Designate(x.variable,res);
  10543. IF IsPointerToRecord(x.variable.type,recordType) THEN
  10544. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  10545. END;
  10546. ReuseCopy(tag, res.tag);
  10547. ReleaseOperand(res);
  10548. NEW(trueL, x.WithParts());
  10549. FOR i := 0 TO x.WithParts()-1 DO
  10550. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  10551. END;
  10552. ReleaseIntermediateOperand(tag);
  10553. BrL(elseL);
  10554. FOR i := 0 TO x.WithParts()-1 DO
  10555. SetLabel(trueL[i]);
  10556. EmitWithPart(x.GetWithPart(i));
  10557. BrL(endL);
  10558. END;
  10559. SetLabel(elseL);
  10560. IF x.elsePart = NIL THEN
  10561. IF ~isUnchecked THEN
  10562. EmitTrap(position,WithTrap);
  10563. END;
  10564. ELSE
  10565. StatementSequence(x.elsePart)
  10566. END;
  10567. SetLabel(endL);
  10568. IF Trace THEN TraceExit("VisitWithStatement") END;
  10569. END VisitWithStatement;
  10570. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  10571. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  10572. out,else: Label; label: Label;
  10573. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  10574. symbol: SyntaxTree.Symbol;
  10575. table: BOOLEAN;
  10576. BEGIN
  10577. (*! split case statement into if-elsif statements for large case label lists *)
  10578. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  10579. range := x.max-x.min+1;
  10580. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  10581. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  10582. table := FALSE;
  10583. size := x.caseParts.Length();
  10584. ELSE
  10585. table := TRUE;
  10586. size := LONGINT(range);
  10587. END;
  10588. Evaluate(x.variable,var);
  10589. ReuseCopy(tmp,var.op);
  10590. ReleaseIntermediateOperand(var.op);
  10591. var.op := tmp;
  10592. (*
  10593. UniqueId(name,module.module,"case",caseId);
  10594. *)
  10595. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  10596. else := NewLabel();
  10597. IF table THEN
  10598. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  10599. Convert(var.op,addressType);
  10600. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  10601. ReuseCopy(res,var.op);
  10602. ReleaseOperand(var);
  10603. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  10604. Global.GetModuleSegmentedName(module.module, name);
  10605. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  10606. symbol := SyntaxTree.NewSymbol(name[1]);
  10607. symbol.SetScope(moduleScope);
  10608. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  10609. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  10610. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  10611. Emit(Add(position,res,res,jmp));
  10612. IntermediateCode.MakeMemory(res,addressType);
  10613. Emit(Br(position,res));
  10614. ReleaseIntermediateOperand(res);
  10615. ELSE
  10616. ReuseCopy(res,var.op); (* make sure it is in a register *)
  10617. ReleaseOperand(var);
  10618. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  10619. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  10620. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10621. part := x.GetCasePart(i);
  10622. constant := part.firstConstant;
  10623. fixups[i] := NewLabel();
  10624. WHILE(constant # NIL) DO (* case labels for this case part *)
  10625. IF constant.min = constant.max THEN
  10626. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  10627. ELSE
  10628. label := NewLabel();
  10629. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  10630. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  10631. BrL(fixups[i]);
  10632. SetLabel(label);
  10633. END;
  10634. constant := constant.next;
  10635. END;
  10636. END;
  10637. BrL(else);
  10638. ReleaseIntermediateOperand(res);
  10639. END;
  10640. out := NewLabel();
  10641. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10642. part := x.GetCasePart(i);
  10643. constant := part.firstConstant;
  10644. IF table THEN
  10645. label := NewLabel();
  10646. SetLabel(label);
  10647. WHILE(constant # NIL) DO (* case labels for this case part *)
  10648. FOR j := constant.min TO constant.max DO
  10649. fixups[j-x.min] := label;
  10650. END;
  10651. constant := constant.next;
  10652. END;
  10653. ELSE
  10654. SetLabel(fixups[i]);
  10655. END;
  10656. StatementSequence(part.statements);
  10657. BrL(out);
  10658. END;
  10659. SetLabel(else);
  10660. FOR i := 0 TO size-1 DO
  10661. IF fixups[i] = NIL THEN
  10662. fixups[i] := else;
  10663. END;
  10664. END;
  10665. IF x.elsePart # NIL THEN
  10666. StatementSequence(x.elsePart);
  10667. ELSIF ~isUnchecked THEN
  10668. EmitTrap(position,CaseTrap);
  10669. END;
  10670. SetLabel(out);
  10671. IF table THEN
  10672. FOR i := 0 TO size-1 DO
  10673. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  10674. section.Emit(Data(position,op));
  10675. END;
  10676. END;
  10677. IF Trace THEN TraceExit("VisitCaseStatement") END;
  10678. END VisitCaseStatement;
  10679. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  10680. VAR startL,falseL: Label;
  10681. BEGIN
  10682. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  10683. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10684. startL := NewLabel();
  10685. falseL := NewLabel();
  10686. SetLabel(startL);
  10687. Condition(x.condition,falseL,FALSE);
  10688. StatementSequence(x.statements);
  10689. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10690. BrL(startL);
  10691. SetLabel(falseL);
  10692. IF Trace THEN TraceExit("VisitWhileStatement") END;
  10693. END VisitWhileStatement;
  10694. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  10695. VAR falseL: Label;
  10696. BEGIN
  10697. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  10698. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10699. falseL := NewLabel();
  10700. SetLabel(falseL);
  10701. StatementSequence(x.statements);
  10702. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10703. Condition(x.condition,falseL,FALSE);
  10704. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  10705. END VisitRepeatStatement;
  10706. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  10707. VAR
  10708. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  10709. temporaryVariable: SyntaxTree.Variable;
  10710. temporaryVariableDesignator : SyntaxTree.Designator;
  10711. BEGIN
  10712. IF Trace THEN TraceEnter("VisitForStatement") END;
  10713. falseL := NewLabel();
  10714. startL := NewLabel();
  10715. Assign(x.variable,x.from);
  10716. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  10717. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  10718. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  10719. Assign(temporaryVariableDesignator,x.to);
  10720. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  10721. IF by > 0 THEN
  10722. cmp := Scanner.LessEqual
  10723. ELSE
  10724. cmp := Scanner.GreaterEqual
  10725. END;
  10726. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  10727. binary.SetType(system.booleanType);
  10728. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10729. SetLabel(startL);
  10730. Condition(binary,falseL, FALSE);
  10731. StatementSequence(x.statements);
  10732. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  10733. binary.SetType(x.variable.type);
  10734. Assign(x.variable,binary);
  10735. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10736. BrL(startL);
  10737. SetLabel(falseL);
  10738. IF Trace THEN TraceExit("VisitForStatement") END;
  10739. END VisitForStatement;
  10740. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  10741. VAR prevLoop: Label;
  10742. BEGIN
  10743. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  10744. prevLoop := currentLoop;
  10745. currentLoop := NewLabel();
  10746. StatementSequence(x.statements);
  10747. SetLabel(currentLoop);
  10748. currentLoop := prevLoop;
  10749. IF Trace THEN TraceExit("VisitExitableBlock") END;
  10750. END VisitExitableBlock;
  10751. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  10752. VAR prevLoop,start: Label;
  10753. BEGIN
  10754. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  10755. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10756. start := NewLabel();
  10757. prevLoop := currentLoop;
  10758. SetLabel(start);
  10759. currentLoop := NewLabel();
  10760. StatementSequence(x.statements);
  10761. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10762. BrL(start);
  10763. SetLabel(currentLoop);
  10764. currentLoop := prevLoop;
  10765. IF Trace THEN TraceExit("VisitLoopStatement") END;
  10766. END VisitLoopStatement;
  10767. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  10768. VAR outer: SyntaxTree.Statement;
  10769. BEGIN
  10770. IF Trace THEN TraceEnter("VisitExitStatement") END;
  10771. IF locked THEN (* r if we jump out of an exclusive block *)
  10772. outer := x.outer;
  10773. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  10774. outer := outer.outer;
  10775. END;
  10776. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  10777. Lock(FALSE);
  10778. END;
  10779. END;
  10780. BrL(currentLoop);
  10781. IF Trace THEN TraceExit("VisitExitStatement") END;
  10782. END VisitExitStatement;
  10783. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  10784. VAR
  10785. expression, parameterDesignator: SyntaxTree.Expression;
  10786. type, componentType: SyntaxTree.Type;
  10787. res, right: Operand;
  10788. left, mem, reg: IntermediateCode.Operand;
  10789. parameter: SyntaxTree.Parameter;
  10790. procedure: SyntaxTree.Procedure;
  10791. procedureType: SyntaxTree.ProcedureType;
  10792. returnTypeOffset: LONGINT;
  10793. delegate: BOOLEAN;
  10794. map: SymbolMap;
  10795. callingConvention, parametersSize: LONGINT;
  10796. BEGIN
  10797. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  10798. expression := x.returnValue;
  10799. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  10800. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10801. IF currentIsInline THEN
  10802. IF expression # NIL THEN
  10803. map := currentMapper.Get(NIL);
  10804. IF map # NIL THEN
  10805. Assign(map.to, expression);
  10806. ELSE
  10807. Evaluate(expression,res);
  10808. Emit(Return(position,res.op));
  10809. ReleaseOperand(res);
  10810. END;
  10811. END;
  10812. BrL(currentInlineExit);
  10813. RETURN;
  10814. END;
  10815. IF expression # NIL THEN
  10816. type := expression.type.resolved;
  10817. IF (expression IS SyntaxTree.ResultDesignator) THEN
  10818. IF locked THEN Lock(FALSE) END;
  10819. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10820. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10821. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  10822. 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
  10823. (* return without structured return parameter *)
  10824. Evaluate(expression,res);
  10825. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  10826. IF locked OR profile THEN
  10827. Emit(Push(position,res.op));
  10828. IF delegate THEN HALT(200) END;
  10829. ReleaseOperand(res);
  10830. IF locked THEN Lock(FALSE) END;
  10831. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10832. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10833. reg := NewRegisterOperand(res.op.type);
  10834. Emit(Pop(position,reg));
  10835. Emit(Return(position,reg));
  10836. ReleaseIntermediateOperand(reg);
  10837. ELSE
  10838. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10839. Emit(Return(position,res.op));
  10840. ReleaseOperand(res);
  10841. END;
  10842. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.StringType) OR type.IsPointer()
  10843. THEN
  10844. (* return using structured return parameter *)
  10845. 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)
  10846. OR (type IS SyntaxTree.StringType)
  10847. OR SemanticChecker.IsPointerType(type));
  10848. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10849. parameter :=procedureType.returnParameter;
  10850. ASSERT(parameter # NIL);
  10851. returnTypeOffset := parameter.offsetInBits;
  10852. (*
  10853. IF parameter# NIL THEN
  10854. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10855. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10856. ELSE
  10857. returnTypeOffset := system.offsetFirstParameter
  10858. END;
  10859. *)
  10860. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10861. IF type IS SyntaxTree.RangeType THEN
  10862. (* array range type *)
  10863. Evaluate(expression, right);
  10864. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10865. Emit(Mov(position,mem, right.op)); (* first *)
  10866. ReleaseIntermediateOperand(mem);
  10867. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10868. Emit(Mov(position,mem, right.tag)); (* last *)
  10869. ReleaseIntermediateOperand(mem);
  10870. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10871. Emit(Mov(position,mem, right.extra)); (* step *)
  10872. ReleaseIntermediateOperand(mem);
  10873. ReleaseOperand(right);
  10874. ELSIF type IS SyntaxTree.ComplexType THEN
  10875. Evaluate(expression, right);
  10876. componentType := type(SyntaxTree.ComplexType).componentType;
  10877. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10878. Emit(Mov(position,mem, right.op)); (* real part *)
  10879. ReleaseIntermediateOperand(mem);
  10880. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10881. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10882. ReleaseIntermediateOperand(mem);
  10883. ReleaseOperand(right);
  10884. ELSE (* covers cases: pointer / record / array *)
  10885. parameter := procedureType.returnParameter;
  10886. checker.SetCurrentScope(currentScope);
  10887. ASSERT(parameter # NIL);
  10888. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10889. Assign(parameterDesignator,expression);
  10890. END;
  10891. ReleaseIntermediateOperand(left);
  10892. IF locked THEN Lock(FALSE) END;
  10893. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10894. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10895. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10896. parameter := procedureType.returnParameter;
  10897. checker.SetCurrentScope(currentScope);
  10898. IF parameter = NIL THEN
  10899. Error(procedure.position, "structured return of parameter of procedure not found");
  10900. ELSE
  10901. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10902. Assign(parameterDesignator,expression);
  10903. END;
  10904. IF locked THEN Lock(FALSE) END;
  10905. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10906. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10907. ELSE
  10908. HALT(200);
  10909. END;
  10910. ELSE
  10911. IF locked THEN Lock(FALSE) END;
  10912. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10913. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10914. END;
  10915. IF backend.cooperative THEN
  10916. BrL(exitLabel);
  10917. ELSE
  10918. callingConvention := procedureType.callingConvention;
  10919. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10920. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10921. ELSE
  10922. parametersSize := 0;
  10923. END;
  10924. EmitLeave(section, position,procedure, callingConvention);
  10925. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10926. END;
  10927. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10928. END VisitReturnStatement;
  10929. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10930. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10931. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10932. statements: SyntaxTree.StatementSequence;
  10933. name, suffix: SyntaxTree.IdentifierString;
  10934. BEGIN
  10935. Strings.IntToStr(awaitProcCounter,suffix);
  10936. Strings.Concat("@AwaitProcedure",suffix,name);
  10937. identifier := SyntaxTree.NewIdentifier(name);
  10938. INC(awaitProcCounter);
  10939. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10940. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10941. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10942. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10943. procedure.SetAccess(SyntaxTree.Hidden);
  10944. procedure.SetScope(currentScope);
  10945. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10946. procedureType.SetReturnType(system.booleanType);
  10947. procedure.SetType(procedureType);
  10948. body := SyntaxTree.NewBody(x.position,procedureScope);
  10949. procedureScope.SetBody(body);
  10950. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10951. returnStatement.SetReturnValue(x.condition);
  10952. statements := SyntaxTree.NewStatementSequence();
  10953. statements.AddStatement(returnStatement);
  10954. body.SetStatementSequence(statements);
  10955. currentScope.AddProcedure(procedure);
  10956. RETURN procedure
  10957. END MakeAwaitProcedure;
  10958. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10959. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10960. call: IntermediateCode.Operand; label, startL, trueL: Label; name: Basic.SegmentedName;
  10961. BEGIN
  10962. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10963. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10964. IF backend.cooperative THEN
  10965. startL := NewLabel();
  10966. trueL := NewLabel();
  10967. SetLabel(startL);
  10968. Condition(x.condition,trueL,TRUE);
  10969. PushSelfPointer();
  10970. CallThis(position,"ExclusiveBlocks","Await",1);
  10971. BrL(startL);
  10972. SetLabel(trueL);
  10973. PushSelfPointer();
  10974. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10975. ELSE
  10976. proc := MakeAwaitProcedure(x);
  10977. Emit(Push(position,fp));
  10978. GetCodeSectionNameForSymbol(proc,name);
  10979. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10980. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10981. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10982. Emit(Call(position,call,ProcParametersSize(proc)));
  10983. Emit(Result(position,res));
  10984. (*
  10985. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10986. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10987. *)
  10988. InitOperand(result,ModeValue);
  10989. result.op := res;
  10990. label := NewLabel();
  10991. BreqL(label, result.op, SELF.true);
  10992. ReleaseOperand(result);
  10993. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10994. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10995. Emit(Push(position,res));
  10996. Emit(Push(position,fp));
  10997. PushSelfPointer();
  10998. Emit(Push(position,nil));
  10999. CallThis(position,"Objects","Await",4);
  11000. SetLabel(label);
  11001. END;
  11002. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11003. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  11004. END VisitAwaitStatement;
  11005. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  11006. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  11007. BEGIN
  11008. FOR i := 0 TO x.Length() - 1 DO
  11009. statement := x.GetStatement( i );
  11010. Statement(statement);
  11011. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  11012. END;
  11013. END StatementSequence;
  11014. PROCEDURE PushSelfPointer;
  11015. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  11016. procedureType: SyntaxTree.ProcedureType;
  11017. BEGIN
  11018. scope := currentScope;
  11019. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  11020. scope := scope.outerScope;
  11021. END;
  11022. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  11023. moduleSection := meta.ModuleSection();
  11024. IF backend.cooperative THEN
  11025. moduleOffset := 0;
  11026. ELSE
  11027. moduleOffset := moduleSection.pc;
  11028. END;
  11029. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  11030. ELSE
  11031. GetBaseRegister(op.op,currentScope,scope);
  11032. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11033. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11034. parametersSize := ProcParametersSize(procedure);
  11035. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  11036. IF backend.cooperative THEN
  11037. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  11038. END;
  11039. IntermediateCode.MakeMemory(op.op,addressType);
  11040. END;
  11041. Emit(Push(position,op.op));
  11042. ReleaseOperand(op);
  11043. END PushSelfPointer;
  11044. PROCEDURE Lock(lock: BOOLEAN);
  11045. BEGIN
  11046. IF Trace THEN TraceEnter("Lock") END;
  11047. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  11048. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  11049. ASSERT(modifyAssignmentCounter = 0);
  11050. IF dump # NIL THEN
  11051. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  11052. dump.Ln;dump.Update;
  11053. END;
  11054. PushSelfPointer;
  11055. IF backend.cooperative THEN
  11056. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  11057. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  11058. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  11059. END;
  11060. ELSE
  11061. Emit(Push(position,true));
  11062. IF lock THEN CallThis(position,"Objects","Lock",2)
  11063. ELSE CallThis(position,"Objects","Unlock",2);
  11064. END;
  11065. END;
  11066. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11067. IF Trace THEN TraceExit("Lock") END;
  11068. END Lock;
  11069. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  11070. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  11071. prevScope: SyntaxTree.Scope;
  11072. BEGIN
  11073. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  11074. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11075. previouslyUnchecked := isUnchecked;
  11076. isUnchecked := isUnchecked OR x.isUnchecked;
  11077. previouslyCooperativeSwitches := cooperativeSwitches;
  11078. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  11079. prevScope := currentScope;
  11080. IF x.scope # NIL THEN currentScope := x.scope END;
  11081. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  11082. IF x.statements # NIL THEN
  11083. StatementSequence(x.statements);
  11084. END;
  11085. IF (x IS SyntaxTree.Body) THEN
  11086. IF (x(SyntaxTree.Body).finally # NIL) THEN
  11087. section.SetFinally(section.pc);
  11088. StatementSequence(x(SyntaxTree.Body).finally)
  11089. ELSIF x.isExclusive THEN
  11090. end := NewLabel();
  11091. BrL(end);
  11092. section.SetFinally(section.pc);
  11093. Lock(FALSE);
  11094. EmitTrap(position,RethrowTrap);
  11095. SetLabel(end);
  11096. END;
  11097. END;
  11098. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  11099. isUnchecked := previouslyUnchecked;
  11100. cooperativeSwitches := previouslyCooperativeSwitches;
  11101. currentScope := prevScope;
  11102. IF Trace THEN TraceExit("VisitStatementBlock") END;
  11103. END VisitStatementBlock;
  11104. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  11105. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  11106. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  11107. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  11108. procedure: SyntaxTree.Procedure;
  11109. map: SymbolMap;
  11110. callingConvention, parametersSize: LONGINT;
  11111. BEGIN
  11112. scope := currentScope;
  11113. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  11114. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11115. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11116. return := emptyOperand;
  11117. IF Trace THEN TraceEnter("VisitCode") END;
  11118. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  11119. NEW(in, x.inRules.Length());
  11120. FOR i := 0 TO LEN(in)-1 DO
  11121. statement := x.inRules.GetStatement(i);
  11122. WITH statement: SyntaxTree.Assignment DO
  11123. Evaluate(statement.right, operand);
  11124. result := operand.op;
  11125. NEW(str, 64);
  11126. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  11127. in[i] := result; IntermediateCode.SetString(in[i], str);
  11128. ReleaseIntermediateOperand(operand.tag);
  11129. END;
  11130. END;
  11131. ELSE in := NIL
  11132. END;
  11133. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  11134. NEW(out, x.outRules.Length());
  11135. FOR i := 0 TO LEN(out)-1 DO
  11136. statement := x.outRules.GetStatement(i);
  11137. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  11138. WITH statement:
  11139. SyntaxTree.Assignment DO
  11140. Designate(statement.left, operand);
  11141. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  11142. NEW(str, 64);
  11143. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  11144. out[i] := result; IntermediateCode.SetString(out[i], str);
  11145. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  11146. | SyntaxTree.ReturnStatement DO
  11147. NEW(str, 64);
  11148. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  11149. IF currentIsInline THEN
  11150. map := currentMapper.Get(NIL);
  11151. Designate(map.to, operand);
  11152. IF map.isAddress THEN
  11153. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11154. ELSE
  11155. result := operand.op;
  11156. END;
  11157. (*! only if it does not fit into register
  11158. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11159. *)
  11160. (*Evaluate(map.to, operand);*)
  11161. out[i] := result;
  11162. ELSE
  11163. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  11164. END;
  11165. IntermediateCode.SetString(out[i], str);
  11166. ReleaseIntermediateOperand(operand.tag);
  11167. return := out[i];
  11168. ELSE
  11169. END;
  11170. END;
  11171. ELSE out := NIL
  11172. END;
  11173. Emit(Asm(x.position,x.sourceCode, in, out));
  11174. IF in # NIL THEN
  11175. FOR i := 0 TO LEN(in)-1 DO
  11176. ReleaseIntermediateOperand(in[i]);
  11177. END;
  11178. END;
  11179. IF out # NIL THEN
  11180. FOR i := 0 TO LEN(out)-1 DO
  11181. WITH statement:
  11182. SyntaxTree.Assignment DO
  11183. ReleaseIntermediateOperand(out[i]);
  11184. |SyntaxTree.ReturnStatement DO
  11185. (* release happens below *)
  11186. ELSE
  11187. END;
  11188. statement := x.outRules.GetStatement(i);
  11189. END;
  11190. END;
  11191. IF return.mode # IntermediateCode.Undefined THEN
  11192. IF currentIsInline THEN
  11193. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  11194. Symbol(procedureType.returnParameter, par);
  11195. MakeMemory(mem, par.op, return.type, 0);
  11196. ReleaseOperand(par);
  11197. Emit(Mov(position, mem, return));
  11198. ReleaseIntermediateOperand(mem);
  11199. ELSE
  11200. Emit(Return(position,return));
  11201. END;
  11202. ReleaseIntermediateOperand(return);
  11203. IF currentIsInline THEN RETURN END;
  11204. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  11205. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  11206. parametersSize := ProcedureParametersSize(backend.system,procedure);
  11207. ELSE
  11208. parametersSize := 0;
  11209. END;
  11210. EmitLeave(section, position,procedure, callingConvention);
  11211. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  11212. END;
  11213. IF Trace THEN TraceExit("VisitCode") END;
  11214. END VisitCode;
  11215. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  11216. BEGIN
  11217. RETURN ProcedureParametersSize(system, procedure);
  11218. END ProcParametersSize;
  11219. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  11220. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  11221. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  11222. const, call: IntermediateCode.Operand;
  11223. parameterDesignator: SyntaxTree.Expression;
  11224. saved: RegisterEntry;
  11225. name: Basic.SegmentedName;
  11226. BEGIN
  11227. IF Trace THEN TraceEnter("ParameterCopies") END;
  11228. parameter := x.firstParameter;
  11229. WHILE parameter # NIL DO
  11230. IF parameter.kind = SyntaxTree.ValueParameter THEN
  11231. type := parameter.type.resolved;
  11232. IF IsOpenArray(type) THEN
  11233. VisitParameter(parameter);
  11234. op := result;
  11235. IF backend.cooperative & parameter.NeedsTrace() THEN
  11236. length := GetArrayLength(type, op.tag);
  11237. size := NewRegisterOperand(addressType);
  11238. base := ArrayBaseType(type);
  11239. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  11240. Emit(Mul(position, size, length, const));
  11241. dst := NewRegisterOperand (addressType);
  11242. Emit(Mov(position, dst, size));
  11243. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11244. Emit(Sub(position,dst,sp,dst));
  11245. Emit(And(position,dst,dst,const));
  11246. Emit(Mov(position,sp,dst));
  11247. par := fp;
  11248. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11249. IntermediateCode.InitImmediate(null, byteType, 0);
  11250. Emit(Fill(position, dst, size, null));
  11251. ReleaseIntermediateOperand(dst);
  11252. ReleaseIntermediateOperand(length);
  11253. SaveRegisters();ReleaseUsedRegisters(saved);
  11254. (* register dst has been freed before SaveRegisters already *)
  11255. base := ArrayBaseType(type);
  11256. (* assign method of open array *)
  11257. IF base.IsRecordType() THEN
  11258. Emit (Push(position, length));
  11259. Emit (Push(position, dst));
  11260. Emit (Push(position, op.op));
  11261. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  11262. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  11263. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  11264. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  11265. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  11266. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  11267. Emit (Push(position,length));
  11268. Emit (Push(position, dst));
  11269. Emit (Push(position, length));
  11270. Emit (Push(position, op.op));
  11271. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  11272. ELSE
  11273. Emit (Push(position, length));
  11274. Emit (Push(position, dst));
  11275. Emit (Push(position, length));
  11276. Emit (Push(position, op.op));
  11277. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  11278. ASSERT(ArrayBaseType(type).IsPointer());
  11279. END;
  11280. RestoreRegisters(saved);
  11281. ELSE
  11282. temp := GetDynamicSize(type,op.tag);
  11283. ReuseCopy(size,temp);
  11284. ReleaseIntermediateOperand(temp);
  11285. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11286. Emit(Sub(position,size,sp,size));
  11287. Emit(And(position,size,size,const));
  11288. Emit(Mov(position,sp,size));
  11289. par := fp;
  11290. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11291. ReleaseIntermediateOperand(size);
  11292. size := GetDynamicSize(type,op.tag);
  11293. END;
  11294. Emit(Copy(position,sp,op.op,size));
  11295. ReleaseIntermediateOperand(size);
  11296. ReleaseOperand(op);
  11297. IntermediateCode.MakeMemory(par,addressType);
  11298. Emit(Mov(position,par,sp));
  11299. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  11300. checker.SetCurrentScope(currentScope);
  11301. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  11302. Assign(parameterDesignator,parameterDesignator);
  11303. END;
  11304. END;
  11305. parameter := parameter.nextParameter;
  11306. END;
  11307. IF Trace THEN TraceExit("ParameterCopies") END;
  11308. END ParameterCopies;
  11309. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  11310. VAR x: SyntaxTree.Variable;
  11311. BEGIN
  11312. x := scope.firstVariable;
  11313. WHILE x # NIL DO
  11314. InitVariable(x,FALSE);
  11315. x := x.nextVariable;
  11316. END;
  11317. END InitVariables;
  11318. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): Basic.Fingerprint;
  11319. BEGIN
  11320. IF (symbol # NIL) THEN
  11321. RETURN fingerprinter.SymbolFP(symbol).public
  11322. ELSE
  11323. RETURN 0
  11324. END;
  11325. END GetFingerprint;
  11326. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  11327. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  11328. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  11329. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  11330. name: Basic.SegmentedName;
  11331. offset: LONGINT;
  11332. BEGIN
  11333. IF Trace THEN TraceEnter("Body") END;
  11334. ReleaseUsedRegisters(saved); (* just in case ... *)
  11335. section := ir;
  11336. exitLabel := NewLabel ();
  11337. IF moduleBody THEN moduleBodySection := section END;
  11338. IF ir.comments # NIL THEN
  11339. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  11340. commentPrintout.SingleStatement(TRUE);
  11341. dump := ir.comments;
  11342. ELSE
  11343. commentPrintout := NIL;
  11344. dump := NIL;
  11345. END;
  11346. prevScope := currentScope;
  11347. currentScope := scope;
  11348. lastSwitchPC := 0;
  11349. cooperativeSwitches := backend.cooperative;
  11350. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11351. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11352. IF x # NIL THEN
  11353. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11354. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  11355. IF moduleBody THEN
  11356. ProfilerInit();
  11357. ELSE
  11358. Basic.SegmentedNameToString(ir.name, string);
  11359. ProfilerAddProcedure(numberProcedures,string);
  11360. ProfilerEnterExit(numberProcedures,TRUE);
  11361. END;
  11362. END;
  11363. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  11364. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  11365. END;
  11366. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  11367. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  11368. cellScope := scope.outerScope(SyntaxTree.CellScope);
  11369. IF procedure = cellScope.bodyProcedure THEN
  11370. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  11371. StaticCallOperand(op, cellScope.constructor);
  11372. Emit(Call(position,op.op,0));
  11373. END;
  11374. END;
  11375. END;
  11376. InitVariables(scope);
  11377. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  11378. GetCodeSectionNameForSymbol(procedure, name);
  11379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  11380. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  11381. IF ProtectModulesPointers THEN
  11382. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  11383. ELSE
  11384. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  11385. END;
  11386. IntermediateCode.SetOffset(right,offset); (* tag *)
  11387. IntermediateCode.InitMemory(left,addressType,fp,0);
  11388. Emit(Mov(position, left, right));
  11389. END;
  11390. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  11391. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  11392. ParameterCopies(procedureType);
  11393. IF x.code = NIL THEN
  11394. VisitStatementBlock(x);
  11395. ELSE
  11396. VisitCode(x.code)
  11397. END;
  11398. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  11399. IF ~backend.cooperative THEN
  11400. ProfilerEnterExit(numberProcedures,FALSE);
  11401. END;
  11402. INC(numberProcedures);
  11403. END;
  11404. END;
  11405. IF backend.cooperative THEN
  11406. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  11407. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  11408. END;
  11409. IF x # NIL THEN
  11410. SELF.position := x.position;
  11411. END;
  11412. EndBasicBlock;
  11413. CheckRegistersFree();
  11414. ASSERT(modifyAssignmentCounter = 0);
  11415. currentScope := prevScope;
  11416. IF Trace THEN TraceExit("Body") END;
  11417. END Body;
  11418. END ImplementationVisitor;
  11419. MetaDataGenerator=OBJECT
  11420. VAR
  11421. implementationVisitor: ImplementationVisitor;
  11422. declarationVisitor: DeclarationVisitor;
  11423. module: Sections.Module;
  11424. moduleName: ARRAY 128 OF CHAR;
  11425. moduleNamePool: Basic.HashTableInt;
  11426. moduleNamePoolSection: IntermediateCode.Section;
  11427. modulePointerSection: IntermediateCode.Section;
  11428. modulePointerSizePC: LONGINT;
  11429. modulePointerSectionOffset: LONGINT;
  11430. modulePointers: LONGINT;
  11431. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  11432. RecordBaseOffset: LONGINT;
  11433. MethodTableOffset: LONGINT; (* method table offset from zero *)
  11434. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  11435. TypeTags: LONGINT; (* type extension level support *)
  11436. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  11437. patchInfoPC: LONGINT;
  11438. patchCRC: LONGINT;
  11439. CONST
  11440. EmptyBlockOffset = 2;
  11441. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  11442. BEGIN
  11443. IF implementationVisitor.backend.cooperative THEN
  11444. TypeTags := MAX(LONGINT);
  11445. BaseTypesTableOffset := 0;
  11446. MethodTableOffset := 2;
  11447. TypeRecordBaseOffset := 0;
  11448. RecordBaseOffset := 0;
  11449. ELSIF simple THEN
  11450. TypeTags := 3; (* only 3 extensions allowed *)
  11451. BaseTypesTableOffset := 1;
  11452. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  11453. TypeRecordBaseOffset := 0;
  11454. RecordBaseOffset := 1;
  11455. ELSE
  11456. TypeTags := 16;
  11457. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  11458. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  11459. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  11460. (* change this when Heaps.HeapBlock is modified *)
  11461. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  11462. RecordBaseOffset := 8; (* addresses *)
  11463. ELSE
  11464. RecordBaseOffset := 9; (* addresses *)
  11465. END;
  11466. END;
  11467. SELF.simple := simple;
  11468. SELF.implementationVisitor := implementationVisitor;
  11469. SELF.declarationVisitor := declarationVisitor;
  11470. implementationVisitor.meta := SELF;
  11471. declarationVisitor.meta := SELF;
  11472. END InitMetaDataGenerator;
  11473. PROCEDURE SetModule(module: Sections.Module);
  11474. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  11475. BEGIN
  11476. SELF.module := module;
  11477. Global.GetModuleName(module.module,moduleName);
  11478. Global.GetSymbolSegmentedName(module.module, name);
  11479. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  11480. NEW(moduleNamePool, 32);
  11481. (*! require GC protection *)
  11482. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  11483. IF ProtectModulesPointers THEN
  11484. name := "Heaps.AnyPtr";
  11485. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11486. (* set base pointer *)
  11487. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  11488. END;
  11489. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  11490. modulePointers := 0;
  11491. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  11492. AddPointer(moduleNamePoolSection, namePoolOffset);
  11493. END;
  11494. END SetModule;
  11495. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  11496. BEGIN
  11497. IF ~implementationVisitor.backend.cooperative THEN
  11498. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  11499. INC(modulePointers);
  11500. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  11501. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  11502. END;
  11503. END AddPointer;
  11504. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  11505. BEGIN
  11506. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  11507. END GetTypeRecordBaseOffset;
  11508. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11509. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  11510. BEGIN
  11511. (* change this when Heaps.HeapBlock is modified *)
  11512. INC(dataAdrOffset,7);
  11513. Info(section,"headerAdr");
  11514. Address(section,0);
  11515. Info(section,"typeDesc");
  11516. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  11517. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11518. NamedSymbol(section, name, symbol, 0, offset);
  11519. Info(section,"mark: LONGINT;");
  11520. Longint(section,-1);
  11521. Info(section,"refCount: LONGINT;");
  11522. Longint(section,0);
  11523. (*
  11524. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  11525. *)
  11526. Info(section,"dataAdr-: ADDRESS");
  11527. Symbol(section,section, dataAdrOffset,0);
  11528. Info(section,"size-: SIZE");
  11529. Address(section,0);
  11530. Info(section,"nextMark: HeapBlock;");
  11531. Address(section,0);
  11532. END HeapBlock;
  11533. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11534. VAR i: LONGINT;
  11535. BEGIN
  11536. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  11537. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  11538. Info(section,"count*: LONGINT");
  11539. Longint(section,0);
  11540. Info(section,"locked*: BOOLEAN");
  11541. Longint(section,0);
  11542. Info(section,"awaitingLock*: ProcessQueue");
  11543. Address(section,0);
  11544. Address(section,0);
  11545. Info(section,"awaitingCond*: ProcessQueue");
  11546. Address(section,0);
  11547. Address(section,0);
  11548. Info(section,"lockedBy*: ANY");
  11549. Address(section,0);
  11550. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  11551. Longint(section,1);
  11552. FOR i := 2 TO 6 DO
  11553. Longint(section,0);
  11554. END;
  11555. Info(section,"lock*: ANY");
  11556. Address(section,0);
  11557. END ProtectedHeapBlock;
  11558. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  11559. BEGIN
  11560. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  11561. END Info;
  11562. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  11563. VAR op: IntermediateCode.Operand;
  11564. BEGIN
  11565. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  11566. section.Emit(Data(Basic.invalidPosition,op));
  11567. END Address;
  11568. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  11569. VAR op: IntermediateCode.Operand;
  11570. BEGIN
  11571. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11572. section.Emit(Data(Basic.invalidPosition,op));
  11573. END Size;
  11574. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  11575. VAR op: IntermediateCode.Operand;
  11576. BEGIN
  11577. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  11578. section.Emit(Data(Basic.invalidPosition,op));
  11579. END Set;
  11580. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  11581. VAR op: IntermediateCode.Operand;
  11582. BEGIN
  11583. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11584. section.Emit(Data(Basic.invalidPosition,op));
  11585. END Longint;
  11586. PROCEDURE Hugeint(section: IntermediateCode.Section; value: HUGEINT);
  11587. VAR op: IntermediateCode.Operand;
  11588. BEGIN
  11589. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.hugeintType),value);
  11590. section.Emit(Data(Basic.invalidPosition,op));
  11591. END Hugeint;
  11592. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11593. VAR op,noOperand: IntermediateCode.Operand;
  11594. BEGIN
  11595. IntermediateCode.InitOperand(noOperand);
  11596. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11597. section.PatchOperands(pc,op,noOperand,noOperand);
  11598. END PatchSize;
  11599. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11600. VAR op,noOperand: IntermediateCode.Operand;
  11601. BEGIN
  11602. IntermediateCode.InitOperand(noOperand);
  11603. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11604. section.PatchOperands(pc,op,noOperand,noOperand);
  11605. END PatchLongint;
  11606. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11607. VAR op, noOperand: IntermediateCode.Operand;
  11608. BEGIN
  11609. IntermediateCode.InitOperand(noOperand);
  11610. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11611. section.PatchOperands(pc,op,noOperand,noOperand);
  11612. END PatchSymbol;
  11613. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  11614. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  11615. BEGIN
  11616. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  11617. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  11618. section.Emit(Data(Basic.invalidPosition,op));
  11619. END Boolean;
  11620. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  11621. VAR op: IntermediateCode.Operand;
  11622. BEGIN
  11623. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  11624. section.Emit(Data(Basic.invalidPosition,op));
  11625. END Char;
  11626. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  11627. VAR i: LONGINT;
  11628. BEGIN
  11629. Info(section,str);
  11630. i := 0;
  11631. WHILE(str[i] # 0X) DO
  11632. Char(section,str[i]);
  11633. INC(i);
  11634. END;
  11635. Char(section,0X);
  11636. END String;
  11637. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  11638. VAR s: Basic.SectionName;
  11639. BEGIN
  11640. StringPool.GetString(str, s);
  11641. String(section, s);
  11642. END String0;
  11643. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11644. VAR op: IntermediateCode.Operand;
  11645. BEGIN
  11646. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11647. IntermediateCode.SetOffset(op,realOffset);
  11648. section.Emit(Data(Basic.invalidPosition,op));
  11649. END NamedSymbol;
  11650. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11651. VAR op: IntermediateCode.Operand;
  11652. BEGIN
  11653. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11654. IntermediateCode.SetOffset(op,realOffset);
  11655. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  11656. END NamedSymbolAt;
  11657. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  11658. BEGIN
  11659. IF symbol= NIL THEN
  11660. Address( section, realOffset);
  11661. ASSERT(virtualOffset = 0);
  11662. ELSE
  11663. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  11664. END;
  11665. END Symbol;
  11666. (* OutPointers delivers
  11667. {pointerOffset}
  11668. *)
  11669. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  11670. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  11671. BEGIN
  11672. type := type.resolved;
  11673. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  11674. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11675. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11676. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  11677. Symbol(section, symbol, 0, offset); INC(numberPointers);
  11678. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  11679. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11680. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  11681. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  11682. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  11683. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  11684. ELSIF (type IS SyntaxTree.RecordType) THEN
  11685. (* never treat a record like a pointer, even if the pointer field is set! *)
  11686. WITH type: SyntaxTree.RecordType DO
  11687. base := type.GetBaseRecord();
  11688. IF base # NIL THEN
  11689. Pointers(offset,symbol,section, base,numberPointers);
  11690. END;
  11691. variable := type.recordScope.firstVariable;
  11692. WHILE(variable # NIL) DO
  11693. IF ~(variable.untraced) THEN
  11694. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11695. END;
  11696. variable := variable.nextVariable;
  11697. END;
  11698. END;
  11699. ELSIF (type IS SyntaxTree.CellType) THEN
  11700. WITH type: SyntaxTree.CellType DO
  11701. base := type.GetBaseRecord();
  11702. IF base # NIL THEN
  11703. Pointers(offset,symbol,section, base,numberPointers);
  11704. END;
  11705. variable := type.cellScope.firstVariable;
  11706. WHILE(variable # NIL) DO
  11707. IF ~(variable.untraced) THEN
  11708. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11709. END;
  11710. variable := variable.nextVariable;
  11711. END;
  11712. property := type.firstProperty;
  11713. WHILE(property # NIL) DO
  11714. IF ~(property.untraced) THEN
  11715. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  11716. END;
  11717. property := property.nextProperty;
  11718. END;
  11719. parameter := type.firstParameter;
  11720. WHILE(parameter # NIL) DO
  11721. IF ~(parameter.untraced) THEN
  11722. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  11723. END;
  11724. parameter := parameter.nextParameter;
  11725. END;
  11726. END;
  11727. ELSIF (type IS SyntaxTree.ArrayType) THEN
  11728. WITH type: SyntaxTree.ArrayType DO
  11729. IF type.form= SyntaxTree.Static THEN
  11730. n := type.staticLength;
  11731. base := type.arrayBase.resolved;
  11732. WHILE(base IS SyntaxTree.ArrayType) DO
  11733. type := base(SyntaxTree.ArrayType);
  11734. n := n* type.staticLength;
  11735. base := type.arrayBase.resolved;
  11736. END;
  11737. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11738. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  11739. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11740. FOR i := 0 TO n-1 DO
  11741. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11742. END;
  11743. END;
  11744. ELSE
  11745. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  11746. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11747. END;
  11748. END;
  11749. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  11750. WITH type: SyntaxTree.MathArrayType DO
  11751. IF type.form = SyntaxTree.Static THEN
  11752. n := type.staticLength;
  11753. base := type.arrayBase.resolved;
  11754. WHILE(base IS SyntaxTree.MathArrayType) DO
  11755. type := base(SyntaxTree.MathArrayType);
  11756. n := n* type.staticLength;
  11757. base := type.arrayBase.resolved;
  11758. END;
  11759. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11760. IF SemanticChecker.ContainsPointer(base) THEN
  11761. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11762. FOR i := 0 TO n-1 DO
  11763. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11764. END;
  11765. END;
  11766. ELSE
  11767. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  11768. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11769. END
  11770. END;
  11771. (* ELSE no pointers in type *)
  11772. END;
  11773. END Pointers;
  11774. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  11775. VAR position,i: LONGINT; ch: CHAR;
  11776. BEGIN
  11777. IF pool.Has(index) THEN
  11778. RETURN pool.GetInt(index)
  11779. ELSE
  11780. position := source.pc;
  11781. pool.PutInt(index, position);
  11782. Info(source, name);
  11783. i := 0;
  11784. REPEAT
  11785. ch := name[i]; INC(i);
  11786. Char( source, ch);
  11787. UNTIL ch = 0X;
  11788. END;
  11789. RETURN position;
  11790. END EnterDynamicName;
  11791. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  11792. VAR name: Basic.SectionName; position: LONGINT;
  11793. BEGIN
  11794. IF pool.Has(index) THEN
  11795. RETURN pool.GetInt(index)
  11796. ELSE
  11797. StringPool.GetString(index, name);
  11798. position := EnterDynamicName(source,name,index, pool);
  11799. END;
  11800. RETURN position;
  11801. END DynamicName;
  11802. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  11803. VAR section: IntermediateCode.Section;
  11804. BEGIN
  11805. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11806. IF implementationVisitor.backend.cooperative THEN
  11807. Info(section, "TypeDescriptor");
  11808. Basic.ToSegmentedName("BaseTypes.Array", name);
  11809. NamedSymbol(section, name,NIL, 0, 0);
  11810. BasePointer(section);
  11811. offset := 0;
  11812. ELSE
  11813. IF ProtectModulesPointers THEN
  11814. HeapBlock(mName,typeName,section,2);
  11815. END;
  11816. Info(section, "HeapBlock");
  11817. IF ProtectModulesPointers THEN
  11818. Symbol(section,section,2,0);
  11819. ELSE
  11820. Address(section,0);
  11821. END;
  11822. Info(section, "TypeDescriptor");
  11823. Address(section,0);
  11824. offset := section.pc;
  11825. END;
  11826. RETURN section
  11827. END NamedBlock;
  11828. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  11829. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  11830. BEGIN
  11831. COPY(moduleName,name);
  11832. Strings.Append(name,suffix);
  11833. Basic.ToSegmentedName(name, pooledName);
  11834. RETURN NamedBlock(mName, typeName, pooledName, offset);
  11835. END Block;
  11836. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  11837. VAR name: Basic.SegmentedName;
  11838. BEGIN
  11839. Info(source,"ArrayHeader");
  11840. IF implementationVisitor.backend.cooperative THEN
  11841. sizePC := source.pc;
  11842. Address(source,0);
  11843. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  11844. IF baseType # "" THEN
  11845. Basic.ToSegmentedName(baseType, name);
  11846. NamedSymbol(source, name,NIL, 0, 0);
  11847. ELSE
  11848. Address(source,0);
  11849. END;
  11850. Address(source,0);
  11851. ELSE
  11852. Address(source,0);
  11853. Address(source,0);
  11854. (* first pointer for GC *)
  11855. IF hasPointer THEN
  11856. (* points to first element in the array, this is NOT the base type descriptor *)
  11857. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11858. ELSE
  11859. Address(source,0);
  11860. END;
  11861. sizePC := source.pc;
  11862. Address(source,0);
  11863. Info(source,"array data");
  11864. END;
  11865. END ArrayBlock;
  11866. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11867. BEGIN
  11868. IF implementationVisitor.backend.cooperative THEN
  11869. PatchSize(section, pc, size);
  11870. PatchSize(section, pc + 3, size);
  11871. ELSE
  11872. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11873. PatchSize(section, pc, size);
  11874. END;
  11875. END PatchArray;
  11876. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11877. VAR
  11878. i: LONGINT; section: Sections.Section; fingerprinter : Fingerprinter.Fingerprinter;
  11879. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11880. poolMap: Basic.HashTableInt;
  11881. namePool: IntermediateCode.Section;
  11882. namePoolOffset: LONGINT;
  11883. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11884. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11885. BEGIN
  11886. Basic.SegmentedNameToString(s1.name,n1);
  11887. Basic.SegmentedNameToString(s2.name,n2);
  11888. index := 0;
  11889. ch1 := n1[index];
  11890. ch2 := n2[index];
  11891. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11892. INC(index);
  11893. ch1 := n1[index];
  11894. ch2 := n2[index];
  11895. END;
  11896. RETURN ch1 < ch2;
  11897. END Compare;
  11898. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11899. VAR
  11900. i, j: LONGINT;
  11901. x, t: Sections.Section;
  11902. BEGIN
  11903. IF lo < hi THEN
  11904. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11905. WHILE i <= j DO
  11906. WHILE Compare(list[i], x) DO INC(i) END;
  11907. WHILE Compare(x, list[j]) DO DEC(j) END;
  11908. IF i <= j THEN
  11909. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11910. INC(i); DEC(j)
  11911. END
  11912. END;
  11913. IF lo < j THEN QuickSort(list, lo, j) END;
  11914. IF i < hi THEN QuickSort(list, i, hi) END
  11915. END;
  11916. END QuickSort;
  11917. (*
  11918. ExportDesc* = RECORD
  11919. fp*: HUGEINT;
  11920. name* {UNTRACED}: DynamicName;
  11921. adr*: ADDRESS;
  11922. exports*: LONGINT;
  11923. dsc* {UNTRACED}: ExportArray
  11924. END;
  11925. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11926. *)
  11927. PROCEDURE ExportDesc2(
  11928. source: IntermediateCode.Section;
  11929. namePool: IntermediateCode.Section;
  11930. fingerprinter: Fingerprinter.Fingerprinter;
  11931. symbol: Sections.Section;
  11932. name: StringPool.Index;
  11933. VAR patchAdr: LONGINT
  11934. ): BOOLEAN;
  11935. VAR fingerprint: SyntaxTree.Fingerprint;
  11936. BEGIN
  11937. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11938. & (symbol.type # Sections.InlineCodeSection)
  11939. THEN
  11940. *)
  11941. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11942. & (symbol.type # Sections.ExitCodeSection)
  11943. & (symbol.type # Sections.InlineCodeSection))
  11944. THEN
  11945. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11946. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11947. fingerprint := fingerprinter.SymbolFP(symbol.symbol);
  11948. Hugeint(source,fingerprint.public);
  11949. ELSE
  11950. Hugeint(source, 0);
  11951. END;
  11952. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11953. Symbol(source, symbol,0,0);
  11954. patchAdr := source.pc;
  11955. Longint(source, 0);
  11956. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11957. Address(source,0);
  11958. END;
  11959. RETURN TRUE
  11960. ELSE
  11961. RETURN FALSE
  11962. END;
  11963. END ExportDesc2;
  11964. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11965. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11966. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11967. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11968. nextPatch: LONGINT;
  11969. TYPE
  11970. Scope = RECORD
  11971. elements: LONGINT;
  11972. gelements: LONGINT;
  11973. section: IntermediateCode.Section;
  11974. patchAdr: LONGINT;
  11975. arraySizePC: LONGINT;
  11976. beginPC: LONGINT; (* current scope start pc *)
  11977. END;
  11978. BEGIN
  11979. Basic.InitSegmentedName(prev);
  11980. olevel := -1;
  11981. scopes[0].section := source;
  11982. scopes[0].arraySizePC := MIN(LONGINT);
  11983. FOR s := 0 TO LEN(sections)-1 DO
  11984. symbol := sections[s];
  11985. 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
  11986. this := sections[s].name;
  11987. level := 0;
  11988. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11989. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11990. INC(level);
  11991. END;
  11992. WHILE level < olevel DO
  11993. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11994. IF olevel > 0 THEN
  11995. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11996. nextPatch := scopes[olevel-1].patchAdr+1;
  11997. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11998. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11999. END;
  12000. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12001. DEC(olevel);
  12002. END;
  12003. IF (level < LEN(this)) & (this[level] > 0) THEN
  12004. IF level > olevel THEN
  12005. (*TRACE("opening",level); *)
  12006. IF scopes[level].section = NIL THEN
  12007. arrayName := ".@ExportArray";
  12008. Strings.AppendInt(arrayName, level);
  12009. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  12010. AddPointer(scopes[level].section,offset);
  12011. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  12012. END;
  12013. scopes[level].beginPC := scopes[level].section.pc;
  12014. olevel := level;
  12015. scopes[olevel].elements := 0;
  12016. END;
  12017. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  12018. sym := sections[s];
  12019. ELSE
  12020. sym := NIL;
  12021. END;
  12022. IF ExportDesc2(scopes[level].section, namePool, fingerprinter, sym, this[level], scopes[level].patchAdr)
  12023. THEN
  12024. INC(scopes[olevel].elements);
  12025. END;
  12026. (* enter string in scope *)
  12027. INC(level);
  12028. END;
  12029. END;
  12030. Basic.SegmentedNameToString(this, name);
  12031. prev := this;
  12032. END;
  12033. END;
  12034. WHILE 0 <= olevel DO
  12035. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  12036. IF olevel > 0 THEN
  12037. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12038. nextPatch := scopes[olevel-1].patchAdr+1;
  12039. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12040. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12041. END;
  12042. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12043. DEC(olevel);
  12044. END;
  12045. level := 0;
  12046. WHILE (level < LEN(scopes)) DO
  12047. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  12048. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  12049. END;
  12050. INC(level);
  12051. END;
  12052. END Export;
  12053. BEGIN
  12054. NEW(fingerprinter);
  12055. NEW(poolMap, 64);
  12056. (* 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 *)
  12057. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  12058. NEW(sectionArray, module.allSections.Length());
  12059. FOR i := 0 TO module.allSections.Length() - 1 DO
  12060. section := module.allSections.GetSection(i);
  12061. sectionArray[i] := section;
  12062. END;
  12063. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  12064. Export(sectionArray^);
  12065. END ExportDesc;
  12066. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  12067. VAR
  12068. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  12069. BEGIN
  12070. Info(source, "exception table offsets array descriptor");
  12071. size := 0;
  12072. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  12073. Info(source, "exception table content");
  12074. FOR i := 0 TO module.allSections.Length() - 1 DO
  12075. p := module.allSections.GetSection(i);
  12076. IF p.type = Sections.CodeSection THEN
  12077. finallyPC := p(IntermediateCode.Section).finally;
  12078. IF finallyPC>=0 THEN
  12079. Symbol( source, p, 0,0);
  12080. Symbol( source, p, finallyPC, 0);
  12081. Symbol( source, p, finallyPC,0);
  12082. INC(size);
  12083. END;
  12084. END
  12085. END;
  12086. PatchArray(source,sizePC,size);
  12087. END ExceptionArray;
  12088. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  12089. VAR i: LONGINT; ch: CHAR;
  12090. BEGIN
  12091. i := 0;
  12092. REPEAT
  12093. ch := name[i]; INC(i);
  12094. Char( section, ch);
  12095. UNTIL ch = 0X;
  12096. WHILE i < 32 DO
  12097. Char( section, 0X); INC(i);
  12098. END;
  12099. END Name;
  12100. PROCEDURE References(section: IntermediateCode.Section);
  12101. CONST
  12102. sfTypeNone = 0X;
  12103. sfTypeCHAR = 01X;
  12104. sfTypeCHAR8 = 02X;
  12105. sfTypeCHAR16 = 03X;
  12106. sfTypeCHAR32 = 04X;
  12107. sfTypeRANGE = 05X;
  12108. sfTypeSHORTINT = 06X;
  12109. sfTypeINTEGER = 07X;
  12110. sfTypeLONGINT = 08X;
  12111. sfTypeHUGEINT = 09X;
  12112. sfTypeWORD = 0AX;
  12113. sfTypeLONGWORD = 0BX;
  12114. sfTypeSIGNED8 = 0CX;
  12115. sfTypeSIGNED16 = 0DX;
  12116. sfTypeSIGNED32 = 0EX;
  12117. sfTypeSIGNED64 = 0FX;
  12118. sfTypeUNSIGNED8 = 10X;
  12119. sfTypeUNSIGNED16 = 11X;
  12120. sfTypeUNSIGNED32 = 12X;
  12121. sfTypeUNSIGNED64 = 13X;
  12122. sfTypeREAL = 14X;
  12123. sfTypeLONGREAL = 15X;
  12124. sfTypeCOMPLEX = 16X;
  12125. sfTypeLONGCOMPLEX = 17X;
  12126. sfTypeBOOLEAN = 18X;
  12127. sfTypeSET = 19X;
  12128. sfTypeANY = 1AX;
  12129. sfTypeOBJECT = 1BX;
  12130. sfTypeBYTE = 1CX;
  12131. sfTypeADDRESS = 1DX;
  12132. sfTypeSIZE = 1EX;
  12133. sfTypeIndirect = 1FX;
  12134. sfTypeRecord = 20X;
  12135. sfTypePointerToRecord = 21X;
  12136. sfTypePointerToArray = 22X;
  12137. sfTypeOpenArray = 23X;
  12138. sfTypeStaticArray = 24X;
  12139. sfTypeDynamicArray = 25X;
  12140. sfTypeMathStaticArray = 26X;
  12141. sfTypeMathOpenArray = 27X;
  12142. sfTypeMathTensor = 28X;
  12143. sfTypeProcedure = 29X;
  12144. sfTypeDelegate = 2AX;
  12145. sfTypeENUM = 2BX;
  12146. (* sfTypeCELL = 2CX; *)
  12147. sfTypePORT = 2DX;
  12148. sfIN = 0X;
  12149. sfOUT = 1X;
  12150. flagDelegate = 0;
  12151. flagConstructor = 1;
  12152. (* variable / parameter addressing modes *)
  12153. sfAbsolute = 0X; (* global vars *)
  12154. sfRelative = 1X; (* variables, value parameters *)
  12155. sfIndirect = 2X; (* var parameters *)
  12156. sfScopeBegin = 0F0X;
  12157. sfScopeEnd = 0F1X;
  12158. sfProcedure = 0F2X;
  12159. sfVariable = 0F3X;
  12160. sfTypeDeclaration = 0F4X;
  12161. sfModule = 0FFX;
  12162. RefInfo = TRUE;
  12163. VAR
  12164. sizePC, startPC, lastOffset: LONGINT;
  12165. indirectTypes: Basic.HashTable;
  12166. PROCEDURE CurrentIndex(): LONGINT;
  12167. VAR i: LONGINT;
  12168. BEGIN
  12169. FOR i := startPC TO section.pc -1 DO
  12170. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  12171. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  12172. END;
  12173. startPC := section.pc;
  12174. RETURN lastOffset;
  12175. END CurrentIndex;
  12176. (*
  12177. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12178. Module = sfModule prevSymbol:SIZE name:String Scope.
  12179. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12180. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  12181. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12182. Type =
  12183. sfTypePointerToRecord
  12184. | sfTypePointerToArray Type
  12185. | sfTypeOpenArray Type
  12186. | sfTypeDynamicArray Type
  12187. | sfTypeStaticArray length:SIZE Type
  12188. | sfTypeMathOpenArray Type
  12189. | sfTypeMathStaticArray length:SIZE Type
  12190. | sfTypeMathTensor Type
  12191. | sfTypeRecord tdAdr:ADDRESS
  12192. | sfTypeProcedure {Parameter} return:Type
  12193. | sfTypeDelegate {Parameter} return:Type
  12194. | sfTypePort (sfIN | sfOUT)
  12195. | sfTypeBOOLEAN
  12196. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  12197. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  12198. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  12199. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  12200. | sfTypeWORD | sfTypeLONGWORD
  12201. | sfTypeREAL | sfTypeLONGREAL
  12202. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  12203. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  12204. | sfTypeIndirect offset:SIZE.
  12205. *)
  12206. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  12207. VAR offset: SIZE;
  12208. BEGIN
  12209. IF indirectTypes.Has(type) THEN
  12210. offset := indirectTypes.GetInt(type);
  12211. Char(section, sfTypeIndirect);
  12212. Size(section, offset);
  12213. RETURN TRUE;
  12214. ELSE
  12215. indirectTypes.PutInt(type, CurrentIndex());
  12216. RETURN FALSE;
  12217. END;
  12218. END Indirect;
  12219. PROCEDURE NType(type: SyntaxTree.Type);
  12220. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  12221. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  12222. BEGIN
  12223. IF type = NIL THEN
  12224. Char(section, sfTypeNone)
  12225. ELSE
  12226. type := type.resolved;
  12227. size := type.sizeInBits;
  12228. WITH type:
  12229. SyntaxTree.PointerType DO
  12230. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  12231. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12232. Char(section, sfTypePointerToRecord);
  12233. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  12234. ELSE
  12235. IF RefInfo THEN Info(section,"PointerToArray") END;
  12236. Char(section, sfTypePointerToArray);
  12237. NType(type.pointerBase);
  12238. END;
  12239. | SyntaxTree.ArrayType DO
  12240. IF ~Indirect(type) THEN
  12241. IF type.form = SyntaxTree.Open THEN
  12242. IF RefInfo THEN Info(section,"OpenArray") END;
  12243. Char(section, sfTypeOpenArray);
  12244. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  12245. IF RefInfo THEN Info(section,"DynamicArray") END;
  12246. Char(section, sfTypeDynamicArray);
  12247. ELSIF type.form = SyntaxTree.Static THEN
  12248. IF RefInfo THEN Info(section,"StaticArray") END;
  12249. Char(section, sfTypeStaticArray);
  12250. Size(section, type.staticLength);
  12251. ELSE
  12252. HALT(100);
  12253. END;
  12254. NType(type.arrayBase);
  12255. END;
  12256. | SyntaxTree.MathArrayType DO
  12257. IF ~Indirect(type) THEN
  12258. IF type.form = SyntaxTree.Open THEN
  12259. IF RefInfo THEN Info(section,"MathOpenArray") END;
  12260. Char(section, sfTypeMathOpenArray);
  12261. ELSIF type.form = SyntaxTree.Static THEN
  12262. IF RefInfo THEN Info(section,"MathStaticArray") END;
  12263. Char(section, sfTypeMathStaticArray);
  12264. Size(section, type.staticLength);
  12265. ELSIF type.form = SyntaxTree.Tensor THEN
  12266. IF RefInfo THEN Info(section,"MathTensor") END;
  12267. Char(section, sfTypeMathTensor);
  12268. ELSE
  12269. HALT(100);
  12270. END;
  12271. NType(type.arrayBase);
  12272. END;
  12273. | SyntaxTree.RecordType DO
  12274. IF ~Indirect(type) THEN
  12275. IF type.pointerType # NIL (* OBJECT *) THEN
  12276. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12277. Char(section, sfTypePointerToRecord)
  12278. ELSE
  12279. IF RefInfo THEN Info(section,"Record") END;
  12280. Char(section, sfTypeRecord);
  12281. td := type.typeDeclaration;
  12282. IF RefInfo THEN Info(section,"TD") END;
  12283. IF (td # NIL) THEN
  12284. Global.GetSymbolSegmentedName(td,segmentedName);
  12285. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12286. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12287. ELSE
  12288. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12289. END;
  12290. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  12291. Symbol(section, tir, 0, offset);
  12292. ELSE
  12293. Address(section, 0);
  12294. END;
  12295. END;
  12296. END;
  12297. | SyntaxTree.CellType DO
  12298. IF ~Indirect(type) THEN
  12299. IF RefInfo THEN Info(section,"Record") END;
  12300. Char(section, sfTypeRecord);
  12301. td := type.typeDeclaration;
  12302. IF RefInfo THEN Info(section,"TD") END;
  12303. IF (td # NIL) THEN
  12304. Global.GetSymbolSegmentedName(td,segmentedName);
  12305. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12306. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12307. ELSE
  12308. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12309. END;
  12310. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12311. Symbol(section, tir, 0, offset);
  12312. ELSE
  12313. Address(section, 0);
  12314. END;
  12315. END;
  12316. | SyntaxTree.PortType DO
  12317. Char(section, sfTypePORT);
  12318. IF type.direction = SyntaxTree.OutPort THEN
  12319. Char(section, sfOUT)
  12320. ELSE
  12321. Char(section, sfIN)
  12322. END;
  12323. | SyntaxTree.ProcedureType DO
  12324. IF ~Indirect(type) THEN
  12325. IF type.isDelegate THEN
  12326. Char(section, sfTypeDelegate);
  12327. ELSE
  12328. Char(section, sfTypeProcedure);
  12329. END;
  12330. parameter := type.firstParameter;
  12331. WHILE(parameter # NIL) DO
  12332. NParameter(parameter, -1);
  12333. parameter := parameter.nextParameter;
  12334. END;
  12335. NType(type.returnType);
  12336. END;
  12337. | SyntaxTree.EnumerationType DO
  12338. Char(section, sfTypeENUM);
  12339. | SyntaxTree.BasicType DO
  12340. WITH type:
  12341. SyntaxTree.BooleanType DO
  12342. IF RefInfo THEN Info(section,"Boolean") END;
  12343. Char(section, sfTypeBOOLEAN);
  12344. | SyntaxTree.CharacterType DO
  12345. IF type = module.system.characterType THEN
  12346. IF RefInfo THEN Info(section,"CHAR") END;
  12347. Char(section, sfTypeCHAR);
  12348. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  12349. IF RefInfo THEN Info(section,"CHAR8") END;
  12350. Char(section, sfTypeCHAR8)
  12351. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  12352. IF RefInfo THEN Info(section,"CHAR16") END;
  12353. Char(section, sfTypeCHAR16);
  12354. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  12355. IF RefInfo THEN Info(section,"CHAR32") END;
  12356. Char(section, sfTypeCHAR32);
  12357. ELSE
  12358. HALT(100);
  12359. END;
  12360. |SyntaxTree.IntegerType DO
  12361. IF type(SyntaxTree.IntegerType).signed THEN
  12362. IF (type = module.system.shortintType) THEN
  12363. IF RefInfo THEN Info(section,"SHORTINT") END;
  12364. Char(section, sfTypeSHORTINT)
  12365. ELSIF (type = module.system.integerType) THEN
  12366. IF RefInfo THEN Info(section,"INTEGER") END;
  12367. Char(section, sfTypeINTEGER)
  12368. ELSIF (type = module.system.longintType) THEN
  12369. IF RefInfo THEN Info(section,"LONGINT") END;
  12370. Char(section, sfTypeLONGINT)
  12371. ELSIF (type = module.system.hugeintType) THEN
  12372. IF RefInfo THEN Info(section,"HUGEINT") END;
  12373. Char(section, sfTypeHUGEINT)
  12374. ELSIF (type = module.system.wordType) THEN
  12375. IF RefInfo THEN Info(section,"WORD") END;
  12376. Char(section, sfTypeWORD)
  12377. ELSIF (type = module.system.longWordType) THEN
  12378. IF RefInfo THEN Info(section,"LONGWORD") END;
  12379. Char(section, sfTypeLONGWORD);
  12380. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  12381. IF RefInfo THEN Info(section,"SIGNED8") END;
  12382. Char(section, sfTypeSIGNED8)
  12383. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  12384. IF RefInfo THEN Info(section,"SIGNED16") END;
  12385. Char(section, sfTypeSIGNED16)
  12386. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  12387. IF RefInfo THEN Info(section,"SIGNED32") END;
  12388. Char(section, sfTypeSIGNED32)
  12389. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  12390. IF RefInfo THEN Info(section,"SIGNED64") END;
  12391. Char(section, sfTypeSIGNED64)
  12392. ELSE
  12393. HALT(100);
  12394. END
  12395. ELSE (* unsigned *)
  12396. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  12397. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  12398. Char(section, sfTypeUNSIGNED8)
  12399. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  12400. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  12401. Char(section, sfTypeUNSIGNED16)
  12402. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  12403. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  12404. Char(section, sfTypeUNSIGNED32)
  12405. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  12406. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  12407. Char(section, sfTypeUNSIGNED64)
  12408. ELSE
  12409. HALT(100)
  12410. END
  12411. END;
  12412. | SyntaxTree.FloatType DO
  12413. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  12414. IF RefInfo THEN Info(section,"REAL") END;
  12415. Char(section, sfTypeREAL);
  12416. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  12417. IF RefInfo THEN Info(section,"LONGREAL") END;
  12418. Char(section, sfTypeLONGREAL);
  12419. ELSE
  12420. HALT(100);
  12421. END;
  12422. | SyntaxTree.ComplexType DO
  12423. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  12424. IF RefInfo THEN Info(section,"COMPLEX") END;
  12425. Char(section, sfTypeCOMPLEX);
  12426. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  12427. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  12428. Char(section, sfTypeLONGCOMPLEX);
  12429. ELSE
  12430. HALT(100);
  12431. END;
  12432. |SyntaxTree.SetType DO
  12433. IF RefInfo THEN Info(section,"SET") END;
  12434. Char(section, sfTypeSET);
  12435. |SyntaxTree.AnyType DO
  12436. IF RefInfo THEN Info(section,"ANY") END;
  12437. Char(section, sfTypeANY);
  12438. |SyntaxTree.ObjectType DO
  12439. IF RefInfo THEN Info(section,"OBJECT") END;
  12440. Char(section, sfTypeOBJECT);
  12441. |SyntaxTree.ByteType DO
  12442. IF RefInfo THEN Info(section,"BYTE") END;
  12443. Char(section, sfTypeBYTE);
  12444. |SyntaxTree.RangeType DO
  12445. IF RefInfo THEN Info(section,"RANGE") END;
  12446. Char(section, sfTypeRANGE)
  12447. |SyntaxTree.AddressType DO
  12448. IF RefInfo THEN Info(section,"ADDRESS") END;
  12449. Char(section, sfTypeADDRESS)
  12450. |SyntaxTree.SizeType DO
  12451. IF RefInfo THEN Info(section,"SIZE") END;
  12452. Char(section, sfTypeSIZE)
  12453. ELSE
  12454. HALT(100)
  12455. END;
  12456. ELSE HALT(101);
  12457. END;
  12458. END;
  12459. END NType;
  12460. (*
  12461. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  12462. *)
  12463. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  12464. VAR type: SyntaxTree.Type;
  12465. BEGIN
  12466. IF RefInfo THEN Info(section, "Parameter") END;
  12467. Char(section, sfVariable);
  12468. Size(section, procOffset);
  12469. String0(section, parameter.name);
  12470. type := parameter.type.resolved;
  12471. IF parameter.kind = SyntaxTree.VarParameter THEN
  12472. IF IsOpenArray(type) THEN Char(section, sfRelative)
  12473. ELSE Char(section, sfIndirect)
  12474. END;
  12475. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12476. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  12477. Char(section, sfIndirect);
  12478. ELSE
  12479. Char(section, sfRelative);
  12480. END;
  12481. ELSE
  12482. Char(section, sfRelative);
  12483. END;
  12484. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  12485. NType(parameter.type);
  12486. END NParameter;
  12487. (*
  12488. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12489. *)
  12490. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  12491. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  12492. flags: SET;
  12493. BEGIN
  12494. IF procedure.externalName # NIL THEN RETURN END;
  12495. IF RefInfo THEN Info(section, "Procedure") END;
  12496. pos := CurrentIndex();
  12497. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  12498. Char(section, sfProcedure);
  12499. Size(section, scopeOffset);
  12500. String0(section,procedure.name);
  12501. s := module.allSections.FindBySymbol(procedure);
  12502. Symbol(section,s,0,0); (* start *)
  12503. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  12504. flags := {};
  12505. IF procedureType.isDelegate THEN
  12506. INCL(flags, flagDelegate);
  12507. END;
  12508. IF procedure.isConstructor THEN
  12509. INCL(flags, flagConstructor);
  12510. END;
  12511. Set(section, flags);
  12512. IF RefInfo THEN Info(section, "Parameters") END;
  12513. parameter := procedureType.firstParameter;
  12514. WHILE(parameter # NIL) DO
  12515. NParameter(parameter, pos);
  12516. parameter := parameter.nextParameter;
  12517. END;
  12518. IF procedureType.returnParameter # NIL THEN
  12519. NParameter(procedureType.returnParameter, pos);
  12520. END;
  12521. IF procedureType.selfParameter # NIL THEN
  12522. NParameter(procedureType.selfParameter, pos);
  12523. END;
  12524. IF RefInfo THEN Info(section, "ReturnType") END;
  12525. NType(procedureType.returnType);
  12526. NScope(procedure.procedureScope, pos);
  12527. END NProcedure;
  12528. (*
  12529. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  12530. *)
  12531. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  12532. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  12533. BEGIN
  12534. IF RefInfo THEN Info(section, "Variable") END;
  12535. pos := CurrentIndex();
  12536. Char(section, sfVariable);
  12537. Size(section, scopeOffset);
  12538. String0(section, variable.name);
  12539. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  12540. Char(section, sfAbsolute);
  12541. IF variable.externalName # NIL THEN
  12542. sn := variable.externalName^;
  12543. NamedSymbol(section, sn,NIL, 0,0);
  12544. ELSE
  12545. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  12546. NamedSymbol(section, sn,variable, 0,0);
  12547. END;
  12548. ELSE
  12549. Char(section, sfRelative);
  12550. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  12551. END;
  12552. NType(variable.type);
  12553. s := module.allSections.FindBySymbol(variable);
  12554. END NVariable;
  12555. (*
  12556. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12557. *)
  12558. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  12559. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  12560. BEGIN
  12561. IF typeDeclaration = NIL THEN RETURN END;
  12562. pos := CurrentIndex();
  12563. s := module.allSections.FindBySymbol(typeDeclaration);
  12564. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  12565. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  12566. Char(section, sfTypeDeclaration);
  12567. Size(section, scopeOffset);
  12568. String0(section, typeDeclaration.name);
  12569. declared := typeDeclaration.declaredType.resolved;
  12570. IF (declared IS SyntaxTree.PointerType) THEN
  12571. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  12572. END;
  12573. WITH declared:
  12574. SyntaxTree.RecordType DO
  12575. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  12576. Symbol(section, s, 0, offset);
  12577. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12578. Basic.AppendToSegmentedName(name,".@Info");
  12579. s := module.allSections.FindByName(name);
  12580. IF s # NIL THEN (* does not work for coop *)
  12581. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12582. END;
  12583. NScope(declared.recordScope, pos);
  12584. |SyntaxTree.CellType DO
  12585. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12586. Symbol(section, s, 0, offset);
  12587. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12588. Basic.AppendToSegmentedName(name,".@Info");
  12589. s := module.allSections.FindByName(name);
  12590. IF s # NIL THEN
  12591. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12592. END;
  12593. NScope(declared.cellScope, pos);
  12594. ELSE
  12595. Address(section, 0);
  12596. END;
  12597. END NTypeDeclaration;
  12598. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  12599. VAR pos: LONGINT;
  12600. BEGIN
  12601. pos := CurrentIndex();
  12602. Char(section,sfModule);
  12603. Size(section, prevSymbol);
  12604. String0(section, module.name);
  12605. NScope(module.moduleScope, pos);
  12606. END NModule;
  12607. (*
  12608. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12609. *)
  12610. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  12611. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  12612. BEGIN
  12613. IF scope = NIL THEN RETURN END;
  12614. IF RefInfo THEN Info(section, "Scope") END;
  12615. Char(section, sfScopeBegin);
  12616. variable := scope.firstVariable;
  12617. WHILE (variable # NIL) DO
  12618. NVariable(variable, prevSymbol);
  12619. variable := variable.nextVariable;
  12620. END;
  12621. WITH scope:
  12622. SyntaxTree.ModuleScope DO
  12623. bodyProcedure := scope.bodyProcedure;
  12624. |SyntaxTree.RecordScope DO
  12625. bodyProcedure := scope.bodyProcedure;
  12626. ELSE
  12627. bodyProcedure := NIL;
  12628. END;
  12629. IF bodyProcedure # NIL THEN
  12630. NProcedure(bodyProcedure, prevSymbol)
  12631. END;
  12632. procedure := scope.firstProcedure;
  12633. WHILE procedure # NIL DO
  12634. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  12635. procedure := procedure.nextProcedure;
  12636. END;
  12637. typeDeclaration := scope.firstTypeDeclaration;
  12638. WHILE typeDeclaration # NIL DO
  12639. NTypeDeclaration(typeDeclaration, prevSymbol);
  12640. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  12641. END;
  12642. Char(section, sfScopeEnd); (* scope ends *)
  12643. END NScope;
  12644. BEGIN
  12645. NEW(indirectTypes, 32);
  12646. ArrayBlock(section,sizePC,"", FALSE);
  12647. startPC := section.pc;
  12648. NModule(module.module, -1);
  12649. PatchArray(section,sizePC,CurrentIndex());
  12650. END References;
  12651. (*
  12652. Command* = RECORD
  12653. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  12654. name*: Name; (* name of the procedure *)
  12655. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  12656. entryAdr* : ADDRESS; (* entry address of procedure *)
  12657. END;
  12658. *)
  12659. PROCEDURE CommandArray(source: IntermediateCode.Section);
  12660. VAR
  12661. p: Sections.Section; sizePC, numberCommands: LONGINT;
  12662. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  12663. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  12664. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  12665. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  12666. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  12667. BEGIN
  12668. RETURN
  12669. (type = NIL) OR
  12670. (type.resolved IS SyntaxTree.RecordType) OR
  12671. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  12672. (type.resolved IS SyntaxTree.AnyType);
  12673. END TypeAllowed;
  12674. BEGIN
  12675. numberParameters := procedureType.numberParameters;
  12676. RETURN
  12677. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  12678. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  12679. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  12680. END GetProcedureAllowed;
  12681. PROCEDURE WriteType(type : SyntaxTree.Type);
  12682. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  12683. name: Basic.SegmentedName; offset: LONGINT;
  12684. BEGIN
  12685. IF type = NIL THEN
  12686. Address(source,0);
  12687. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  12688. Address(source,1);
  12689. ELSE
  12690. type := type.resolved;
  12691. IF type IS SyntaxTree.PointerType THEN
  12692. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  12693. END;
  12694. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  12695. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  12696. name[0] := typeDeclaration.name; name[1] := -1;
  12697. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  12698. ASSERT(section # NIL);
  12699. ELSE
  12700. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12701. (* TODO *)
  12702. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  12703. END;
  12704. IF implementationVisitor.backend.cooperative THEN
  12705. offset := 0;
  12706. ELSE
  12707. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  12708. END;
  12709. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  12710. END;
  12711. END WriteType;
  12712. BEGIN
  12713. Info(source, "command array descriptor");
  12714. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  12715. numberCommands := 0;
  12716. Info(source, "command array content");
  12717. FOR i := 0 TO module.allSections.Length() - 1 DO
  12718. p := module.allSections.GetSection(i);
  12719. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  12720. procedure := p.symbol(SyntaxTree.Procedure);
  12721. procedureType := procedure.type(SyntaxTree.ProcedureType);
  12722. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  12723. procedure.GetName(name);
  12724. Name(source,name);
  12725. numberParameters := procedureType.numberParameters;
  12726. (* offset of type of first parameter *)
  12727. IF (numberParameters = 0 ) THEN WriteType(NIL)
  12728. ELSE WriteType(procedureType.firstParameter.type)
  12729. END;
  12730. (* offset of type of return parameter *)
  12731. WriteType(procedureType.returnType);
  12732. (* command name *)
  12733. (* command code offset *)
  12734. Symbol(source,p,0,0);
  12735. INC(numberCommands);
  12736. IF Trace THEN
  12737. D.Ln;
  12738. END;
  12739. END;
  12740. END
  12741. END;
  12742. PatchArray(source,sizePC,numberCommands);
  12743. END CommandArray;
  12744. (* to prevent from double import of different module aliases *)
  12745. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  12746. VAR i: SyntaxTree.Import;
  12747. BEGIN
  12748. i := module.module.moduleScope.firstImport;
  12749. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  12750. i := i.nextImport;
  12751. END;
  12752. RETURN i = import
  12753. END IsFirstDirectOccurence;
  12754. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  12755. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  12756. BEGIN
  12757. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  12758. ArrayBlock(source,pc,"", FALSE);
  12759. Info(source, "import module array data");
  12760. IF implementationVisitor.backend.cooperative THEN
  12761. offset := 0;
  12762. ELSE
  12763. IF module.system.addressType.sizeInBits = 64 THEN
  12764. (* change this when Heaps.HeapBlock is modified *)
  12765. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12766. ELSE
  12767. (* change this when Heaps.HeapBlock is modified *)
  12768. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12769. END;
  12770. END;
  12771. import := module.module.moduleScope.firstImport;
  12772. numberImports := 0;
  12773. WHILE import # NIL DO
  12774. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  12775. Global.GetModuleSegmentedName(import.module,name);
  12776. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  12777. NamedSymbol(source, name, NIL, 0, offset);
  12778. INC(numberImports);
  12779. END;
  12780. import := import.nextImport
  12781. END;
  12782. PatchArray(source,pc,numberImports);
  12783. END ImportsArray;
  12784. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  12785. VAR
  12786. p: Sections.Section; sizePC, size, i: LONGINT;
  12787. BEGIN
  12788. Info(source, "Type info section");
  12789. size := 0;
  12790. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  12791. FOR i := 0 TO module.allSections.Length() - 1 DO
  12792. p := module.allSections.GetSection(i);
  12793. WITH p: IntermediateCode.Section DO
  12794. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  12795. Symbol(source,p,EmptyBlockOffset,0);
  12796. INC(size);
  12797. END;
  12798. END
  12799. END;
  12800. PatchArray(source,sizePC,size);
  12801. END TypeInfoSection;
  12802. (*
  12803. ProcTableEntry* = RECORD
  12804. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  12805. noPtr*: LONGINT;
  12806. END;
  12807. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  12808. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  12809. *)
  12810. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12811. VAR
  12812. numberPointers: LONGINT;
  12813. procedure: SyntaxTree.Procedure;
  12814. BEGIN
  12815. Info(section,"pcFrom");
  12816. Symbol(section,procedureSection,0,0);
  12817. Info(section,"pcTo");
  12818. Symbol(section, procedureSection, procedureSection.pc, 0);
  12819. Info(section,"pointer to offsets array");
  12820. Symbol(section, section,section.pc+1,0);
  12821. Info(section,"offsets array");
  12822. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  12823. PointerArray(section, procedure.procedureScope, numberPointers);
  12824. END ProcedureDescriptor;
  12825. (* only for tracing, the descriptor is otherwise not complete ! *)
  12826. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  12827. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  12828. BEGIN
  12829. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  12830. name := procedureSection.name;
  12831. Basic.AppendToSegmentedName(name,".@Info");
  12832. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12833. Address(section,0);
  12834. Symbol(section,section,2,0);
  12835. (*
  12836. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  12837. descSize: SIZE;
  12838. sentinel: ADDRESS; (* = MPO-4 *)
  12839. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12840. flags*: SET;
  12841. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12842. name*: Name;
  12843. END;
  12844. *)
  12845. Size(section, 0);
  12846. Address(section,0);
  12847. Address(section,0);
  12848. Set(section,{});
  12849. moduleSection := ModuleSection();
  12850. Symbol( section, moduleSection, moduleSection.pc,0);
  12851. IF procedureSection.symbol = NIL THEN
  12852. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12853. ELSE
  12854. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12855. END;
  12856. Name(section, infoName);
  12857. Size(section, 0);
  12858. RETURN section;
  12859. END MakeProcedureDescriptorTag;
  12860. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12861. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12862. BEGIN
  12863. name := procedureSection.name;
  12864. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12865. IF implementationVisitor.backend.cooperative THEN
  12866. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12867. Info(section, "TypeDescriptor");
  12868. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12869. NamedSymbol(dest, name,NIL, 0, 0);
  12870. BaseRecord(dest);
  12871. offset := 0;
  12872. ELSIF CreateProcedureDescInfo THEN
  12873. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12874. Address(dest,0);
  12875. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12876. offset := dest.pc;
  12877. ELSE
  12878. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12879. END;
  12880. ProcedureDescriptor(dest, procedureSection);
  12881. Symbol(section, dest, offset, 0);
  12882. END ProcedureDescriptorPointer;
  12883. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12884. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12885. BEGIN
  12886. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12887. numberProcs := 0;
  12888. FOR i := 0 TO module.allSections.Length() - 1 DO
  12889. destination := module.allSections.GetSection(i);
  12890. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12891. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12892. INC(numberProcs);
  12893. END
  12894. END;
  12895. PatchArray(section, sizePC, numberProcs);
  12896. END ProcedureDescriptorArray;
  12897. (*
  12898. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12899. VAR
  12900. next*: Module; (** once a module is published, all fields are read-only *)
  12901. name*: Name;
  12902. init, published: BOOLEAN;
  12903. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12904. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12905. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12906. command*: POINTER TO ARRAY OF Command;
  12907. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12908. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12909. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12910. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12911. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12912. data*, code*: Bytes;
  12913. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12914. export*: ExportDesc;
  12915. term*: TerminationHandler;
  12916. exTable*: ExceptionTable;
  12917. noProcs*: LONGINT;
  12918. firstProc*: ADDRESS; <- done by loader
  12919. maxPtrs*: LONGINT;
  12920. crc*: LONGINT;
  12921. *)
  12922. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12923. BEGIN
  12924. Info(section, "cycle");
  12925. Size(section,0);
  12926. Info(section, "references");
  12927. Size(section,0);
  12928. Info(section, "nextMarked");
  12929. Address(section,0);
  12930. Info(section, "nextWatched");
  12931. Address(section,0);
  12932. END BasePointer;
  12933. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12934. BEGIN
  12935. BasePointer(section);
  12936. Info(section, "action");
  12937. Address(section,0);
  12938. Info(section, "monitor");
  12939. Address(section,0);
  12940. END BaseObject;
  12941. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12942. BEGIN
  12943. BasePointer(section);
  12944. Info(section, "action");
  12945. Address(section,0);
  12946. Info(section, "monitor");
  12947. Address(section,0);
  12948. END BaseRecord;
  12949. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12950. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12951. pooledName: Basic.SegmentedName;
  12952. symbol: SyntaxTree.Symbol;
  12953. BEGIN
  12954. Global.GetModuleName(module.module,name);
  12955. Strings.Append(name,".@Module.@Descriptor");
  12956. Basic.ToSegmentedName(name, pooledName);
  12957. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12958. Symbol(section,descriptorSection,0,0);
  12959. Info(descriptorSection, "descriptor");
  12960. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12961. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12962. Address(descriptorSection,0);
  12963. Global.GetModuleName(module.module,name);
  12964. Strings.Append(name,".@Trace");
  12965. Basic.ToSegmentedName(name, pooledName);
  12966. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12967. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12968. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12969. END ModuleDescriptor;
  12970. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12971. VAR name: ARRAY 128 OF CHAR;
  12972. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12973. symbol: SyntaxTree.Symbol;
  12974. BEGIN
  12975. Global.GetModuleName(module.module,name);
  12976. Strings.Append(name,".@Module");
  12977. Basic.ToSegmentedName(name, pooledName);
  12978. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12979. moduleSection.SetExported(TRUE);
  12980. IF moduleSection.pc = 0 THEN
  12981. IF implementationVisitor.backend.cooperative THEN
  12982. Info(moduleSection, "descriptor");
  12983. ModuleDescriptor(moduleSection);
  12984. BaseObject(moduleSection);
  12985. implementationVisitor.CreateTraceModuleMethod(module.module);
  12986. ELSE
  12987. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12988. Info(moduleSection, "HeapBlock");
  12989. Symbol(moduleSection,moduleSection,2,0);
  12990. Info(moduleSection, "TypeDescriptor");
  12991. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12992. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12993. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12994. END;
  12995. END;
  12996. RETURN moduleSection;
  12997. END ModuleSection;
  12998. PROCEDURE NewModuleInfo();
  12999. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13000. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13001. sectionName: Basic.SectionName;
  13002. CONST MPO=-40000000H;
  13003. BEGIN
  13004. (*
  13005. TypeDesc* = POINTER TO RECORD
  13006. descSize: SIZE;
  13007. sentinel: LONGINT; (* = MPO-4 *)
  13008. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13009. flags*: SET;
  13010. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13011. name*: Name;
  13012. refsOffset: SIZE;
  13013. END;
  13014. *)
  13015. (*name is missing prefixes sometimes*)
  13016. Global.GetModuleSegmentedName(module.module,name);
  13017. Basic.AppendToSegmentedName(name,".@Info");
  13018. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13019. IF ~implementationVisitor.backend.cooperative THEN
  13020. Info(source, "HeapBlock");
  13021. Address(source,0); (* an empty heap block prevents GC marking *)
  13022. Info(source, "TypeDescriptor");
  13023. Address(source,0);
  13024. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13025. END;
  13026. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13027. Address(source,MPO-4);
  13028. Info(source, "type tag pointer");
  13029. Address( source,0);
  13030. Info(source, "type flags");
  13031. flags := {};
  13032. Set( source, flags);
  13033. Info(source, "pointer to module");
  13034. moduleSection := ModuleSection();
  13035. Symbol( source, moduleSection, moduleSection.pc,0);
  13036. Info(source, "type name");
  13037. i := 0;
  13038. sectionName := "@Self";
  13039. (*
  13040. Global.GetSymbolSegmentedName(td,name);
  13041. Basic.SegmentedNameToString(name, sectionName);
  13042. *)
  13043. Name(source,sectionName);
  13044. patchInfoPC := source.pc;
  13045. Size(source, 0);
  13046. END NewModuleInfo;
  13047. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  13048. VAR
  13049. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  13050. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  13051. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  13052. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  13053. referenceSectionOffset : LONGINT;
  13054. name: Basic.SegmentedName; offset: LONGINT;
  13055. flags: SET;
  13056. BEGIN
  13057. NewModuleInfo();
  13058. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  13059. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  13060. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  13061. ImportsArray(importSection);
  13062. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  13063. CommandArray(commandsSection);
  13064. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  13065. ExceptionArray(exceptionSection);
  13066. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  13067. AddPointer(typeInfoSection, typeInfoSectionOffset);
  13068. TypeInfoSection(typeInfoSection);
  13069. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  13070. referenceSection.SetExported(TRUE);
  13071. References(referenceSection);
  13072. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  13073. ProcedureDescriptorArray(procTableSection, numberProcs);
  13074. IF ProtectModulesPointers THEN
  13075. name := "Heaps.AnyPtr";
  13076. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  13077. (* set base pointer *)
  13078. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  13079. END;
  13080. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  13081. ArrayBlock(emptyArraySection,temp,"", FALSE);
  13082. moduleSection := ModuleSection();
  13083. Info(moduleSection, "nextRoot*: RootObject");
  13084. Address(moduleSection,0);
  13085. Info(moduleSection, "next*: Module");
  13086. Address(moduleSection,0);
  13087. Info(moduleSection, "name*: Name");
  13088. Name(moduleSection,moduleName);
  13089. Info(moduleSection, "init, published: BOOLEAN");
  13090. Boolean(moduleSection,FALSE);
  13091. Boolean(moduleSection,FALSE);
  13092. Info(moduleSection,"filler"); (*! introduce alignment! *)
  13093. Boolean(moduleSection,FALSE);
  13094. Boolean(moduleSection,FALSE);
  13095. Info(moduleSection, "refcnt*: LONGINT");
  13096. Longint(moduleSection,0);
  13097. Info(moduleSection, "sb*: ADDRESS");
  13098. Address(moduleSection,0);
  13099. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  13100. Address(moduleSection,0);
  13101. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  13102. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  13103. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  13104. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  13105. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  13106. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  13107. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  13108. Symbol(moduleSection,importSection,importSectionOffset,0);
  13109. Info(moduleSection, "procTable*: ProcTable");
  13110. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  13111. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  13112. Address(moduleSection,0);
  13113. Address(moduleSection,0);
  13114. Address(moduleSection,0);
  13115. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  13116. Info(moduleSection, "export*: ExportDesc");
  13117. ExportDesc(moduleSection);
  13118. Info(moduleSection, "term*: TerminationHandler");
  13119. Address(moduleSection,0);
  13120. Info(moduleSection, "exTable*: ExceptionTable");
  13121. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  13122. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  13123. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  13124. Info(moduleSection, "crc*: LONGINT");
  13125. patchCRC:= moduleSection.pc;
  13126. Longint(moduleSection, 0); (*! must be implemented *)
  13127. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  13128. Info(moduleSection, "body*: ADDRESS");
  13129. Symbol(moduleSection, bodyProc, 0,0);
  13130. Info(moduleSection, "module flags");
  13131. flags := {};
  13132. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  13133. Set( moduleSection, flags);
  13134. IF implementationVisitor.backend.cooperative THEN
  13135. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  13136. Info(moduleSection, "monitor.owner");
  13137. Address(moduleSection,0);
  13138. Info(moduleSection, "monitor.nestingLevel");
  13139. Address(moduleSection,0);
  13140. Info(moduleSection, "monitor.blockedQueue");
  13141. Address(moduleSection,0); Address(moduleSection,0);
  13142. Info(moduleSection, "monitor.waitingQueue");
  13143. Address(moduleSection,0); Address(moduleSection,0);
  13144. Info(moduleSection, "monitor.waitingSentinel");
  13145. Address(moduleSection,0);
  13146. END;
  13147. END Module;
  13148. PROCEDURE PatchCRC(crc: LONGINT);
  13149. BEGIN
  13150. IF ~simple THEN
  13151. PatchLongint(ModuleSection(), patchCRC, crc);
  13152. END;
  13153. END PatchCRC;
  13154. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  13155. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  13156. BEGIN
  13157. ArrayBlock(source,pc,"",FALSE);
  13158. Info(source, "pointer offsets array data");
  13159. IF scope IS SyntaxTree.RecordScope THEN
  13160. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  13161. ELSIF scope IS SyntaxTree.CellScope THEN
  13162. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  13163. ELSIF scope IS SyntaxTree.ModuleScope THEN
  13164. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  13165. WHILE variable # NIL DO
  13166. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13167. symbol := module.allSections.FindBySymbol(variable);
  13168. ASSERT(symbol # NIL);
  13169. Pointers(0,symbol, source,variable.type,numberPointers);
  13170. END;
  13171. variable := variable.nextVariable;
  13172. END;
  13173. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  13174. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13175. WHILE parameter # NIL DO
  13176. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  13177. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  13178. END;
  13179. parameter := parameter.nextParameter;
  13180. END;
  13181. (* a self parameter does not need to be traced *)
  13182. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  13183. WHILE(variable # NIL) DO
  13184. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13185. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  13186. END;
  13187. variable := variable.nextVariable
  13188. END;
  13189. END;
  13190. PatchArray(source,pc,numberPointers);
  13191. END PointerArray;
  13192. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  13193. VAR recordType: SyntaxTree.RecordType;
  13194. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  13195. section: Sections.Section; cellType: SyntaxTree.CellType;
  13196. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  13197. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13198. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13199. sectionName: Basic.SectionName;
  13200. CONST MPO=-40000000H;
  13201. BEGIN
  13202. (*
  13203. TypeDesc* = POINTER TO RECORD
  13204. descSize: SIZE;
  13205. sentinel: LONGINT; (* = MPO-4 *)
  13206. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13207. flags*: SET;
  13208. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13209. name*: Name;
  13210. refsOffset: SIZE;
  13211. END;
  13212. *)
  13213. (* source := module.sections.FindByName(...) *)
  13214. Global.GetSymbolSegmentedName(td,name);
  13215. Basic.AppendToSegmentedName(name,".@Info");
  13216. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13217. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  13218. Address(source,0);
  13219. Info(source, "TypeDescriptor");
  13220. Address(source,0);
  13221. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13222. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13223. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  13224. Info(source, "type tag pointer");
  13225. Symbol( source, tag, offset, 0);
  13226. Info(source, "type flags");
  13227. flags := {};
  13228. IF isProtected THEN INCL(flags,31) END;
  13229. Set( source, flags);
  13230. Info(source, "pointer to module");
  13231. moduleSection := ModuleSection();
  13232. Symbol( source, moduleSection, moduleSection.pc,0);
  13233. Info(source, "type name");
  13234. i := 0;
  13235. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  13236. (*
  13237. Global.GetSymbolSegmentedName(td,name);
  13238. Basic.SegmentedNameToString(name, sectionName);
  13239. *)
  13240. Name(source,sectionName);
  13241. Size(source, 0);
  13242. RETURN source;
  13243. END NewTypeDescriptorInfo;
  13244. PROCEDURE NewTypeDescriptor;
  13245. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  13246. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  13247. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  13248. numberPointers: LONGINT; padding, i: LONGINT;
  13249. CONST MPO=-40000000H;
  13250. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  13251. VAR i: LONGINT;
  13252. PROCEDURE Td(record: SyntaxTree.RecordType);
  13253. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  13254. BEGIN
  13255. IF record # NIL THEN
  13256. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  13257. baseTD := record.typeDeclaration;
  13258. Global.GetSymbolSegmentedName(baseTD,name);
  13259. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13260. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13261. ELSE
  13262. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13263. END;
  13264. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  13265. Symbol(source, tir, 0, offset);
  13266. IF reverse THEN Td(record.GetBaseRecord()) END;
  13267. END;
  13268. END Td;
  13269. BEGIN
  13270. Info(source, "tag table");
  13271. baseRecord := recordType;
  13272. i := 0;
  13273. WHILE baseRecord # NIL DO
  13274. INC(i);
  13275. baseRecord := baseRecord.GetBaseRecord();
  13276. END;
  13277. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  13278. IF ~reverse THEN Td(recordType) END;
  13279. WHILE i < size DO
  13280. Address(source,0);
  13281. INC(i);
  13282. END;
  13283. IF reverse THEN Td(recordType) END;
  13284. END TdTable;
  13285. PROCEDURE MethodTable(reverse: BOOLEAN);
  13286. VAR i,methods: LONGINT;
  13287. BEGIN
  13288. Info(source, "method table");
  13289. IF recordType # NIL THEN
  13290. methods := recordType.recordScope.numberMethods;
  13291. IF reverse THEN
  13292. FOR i := methods-1 TO 0 BY -1 DO
  13293. procedure := recordType.recordScope.FindMethod(i);
  13294. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13295. NamedSymbol(source, name,procedure, 0,0);
  13296. END;
  13297. ELSE
  13298. FOR i := 0 TO methods-1 DO
  13299. procedure := recordType.recordScope.FindMethod(i);
  13300. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13301. NamedSymbol(source, name,procedure, 0,0);
  13302. END;
  13303. END;
  13304. END;
  13305. END MethodTable;
  13306. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  13307. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  13308. BEGIN
  13309. Info(source, "method table");
  13310. baseRecord := recordType;
  13311. WHILE baseRecord.baseType # NIL DO
  13312. baseRecord := baseRecord.GetBaseRecord ();
  13313. END;
  13314. GetRecordTypeName (baseRecord, name);
  13315. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  13316. IF name = stackFrame THEN
  13317. start := 0;
  13318. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  13319. baseRecord := recordType;
  13320. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  13321. baseRecord := baseRecord.GetBaseRecord ();
  13322. END;
  13323. IF baseRecord # NIL THEN
  13324. GetRecordTypeName (baseRecord, name);
  13325. IF pointer & ~baseRecord.isObject THEN
  13326. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13327. END;
  13328. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  13329. ELSIF recordType.isObject THEN
  13330. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  13331. ELSIF pointer THEN
  13332. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  13333. ELSE
  13334. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  13335. END;
  13336. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13337. Symbol(source, tir, 0, 0);
  13338. start := 0;
  13339. baseRecord := recordType;
  13340. WHILE (baseRecord # NIL) DO
  13341. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  13342. baseRecord := baseRecord.GetBaseRecord ();
  13343. END;
  13344. ELSE
  13345. (* explicit trace method: *)
  13346. procedure := recordType.recordScope.FindMethod(0);
  13347. IF ~procedure.isFinalizer THEN
  13348. Global.GetSymbolSegmentedName(procedure, name);
  13349. NamedSymbol(source, name,procedure, 0,0);
  13350. END;
  13351. start := 1;
  13352. END;
  13353. IF (name # stackFrame) & recordType.isObject THEN
  13354. baseRecord := recordType;
  13355. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  13356. baseRecord := baseRecord.GetBaseRecord ();
  13357. END;
  13358. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  13359. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  13360. ELSE
  13361. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  13362. END;
  13363. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13364. Symbol(source, tir, 0, 0);
  13365. END;
  13366. methods := recordType.recordScope.numberMethods;
  13367. FOR i := start TO methods-1 DO
  13368. procedure := recordType.recordScope.FindMethod(i);
  13369. IF ~procedure.isFinalizer THEN
  13370. Global.GetSymbolSegmentedName(procedure, name);
  13371. NamedSymbol(source, name,procedure, 0,0);
  13372. END;
  13373. END;
  13374. END CooperativeMethodTable;
  13375. BEGIN
  13376. Global.GetSymbolSegmentedName(td,name);
  13377. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  13378. source.SetExported(IsExported(td));
  13379. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  13380. IF implementationVisitor.backend.cooperative THEN
  13381. base := NIL;
  13382. baseRecord := recordType.GetBaseRecord();
  13383. IF baseRecord # NIL THEN
  13384. baseTD := baseRecord.typeDeclaration;
  13385. END;
  13386. IF ~recordType.isObject THEN
  13387. Info(source, "parent");
  13388. IF baseRecord # NIL THEN
  13389. Global.GetSymbolSegmentedName(baseTD,name);
  13390. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13391. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13392. ELSE
  13393. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13394. END;
  13395. Symbol(source, tir, 0, 0);
  13396. ELSE
  13397. Address(source,0);
  13398. END;
  13399. Info(source, "record size");
  13400. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13401. CooperativeMethodTable(FALSE);
  13402. base := source;
  13403. Global.GetSymbolSegmentedName(td,name);
  13404. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13405. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13406. source.SetExported(IsExported(td));
  13407. END;
  13408. Info(source, "parent");
  13409. IF baseRecord # NIL THEN
  13410. Global.GetSymbolSegmentedName(baseTD,name);
  13411. sym := baseTD;
  13412. IF ~recordType.isObject THEN
  13413. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13414. sym := NIL;
  13415. END;
  13416. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13417. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13418. tir.SetExported(IsExported(td));
  13419. ELSE
  13420. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13421. END;
  13422. Symbol(source, tir, 0, 0);
  13423. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  13424. Address(source,0);
  13425. ELSE
  13426. IF recordType.isObject THEN
  13427. Basic.ToSegmentedName ("BaseTypes.Object",name);
  13428. ELSE
  13429. Basic.ToSegmentedName ("BaseTypes.Record",name);
  13430. END;
  13431. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13432. Symbol(source, tir, 0, 0);
  13433. END;
  13434. Info(source, "base record descriptor");
  13435. Symbol(source, base, 0, 0);
  13436. CooperativeMethodTable(TRUE);
  13437. IF recordType.hasPointers THEN
  13438. IF ~HasExplicitTraceMethod (recordType) THEN
  13439. implementationVisitor.CreateTraceMethod(recordType);
  13440. END;
  13441. implementationVisitor.CreateResetProcedure(recordType);
  13442. implementationVisitor.CreateAssignProcedure(recordType);
  13443. END;
  13444. ELSIF ~simple THEN
  13445. (*
  13446. MethodEnd = MPO
  13447. ---
  13448. methods (# methods)
  13449. ---
  13450. tags (16)
  13451. ---
  13452. TypeDesc = TypeInfoAdr
  13453. ---
  13454. td adr ---> rec size
  13455. ----
  13456. pointer offsets
  13457. ----
  13458. (padding)
  13459. -----
  13460. empty [2 addresses aligned]
  13461. empty
  13462. empty
  13463. numPtrs
  13464. ---
  13465. pointer offsets
  13466. ---
  13467. *)
  13468. Info(source, "MethodEnd = MPO");
  13469. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  13470. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  13471. MethodTable(TRUE);
  13472. TdTable(TypeTags, TRUE);
  13473. Info(source, "type descriptor info pointer");
  13474. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  13475. Symbol(source, tdInfo,EmptyBlockOffset,0);
  13476. IF (cellType # NIL) THEN
  13477. IF cellType.sizeInBits < 0 THEN
  13478. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  13479. END;
  13480. Info(source, "cell size");
  13481. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  13482. ELSE
  13483. Info(source, "record size");
  13484. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13485. END;
  13486. Info(source, "pointer offsets pointer");
  13487. padding := 1- source.pc MOD 2;
  13488. Symbol(source, source, source.pc+1+padding,0);
  13489. IF padding >0 THEN
  13490. Info(source, "padding");
  13491. FOR i := 1 TO padding DO Address(source,0) END;
  13492. END;
  13493. IF cellType # NIL THEN
  13494. PointerArray(source, cellType.cellScope, numberPointers);
  13495. ELSE
  13496. PointerArray(source, recordType.recordScope, numberPointers);
  13497. END;
  13498. ELSE
  13499. (*
  13500. simple:
  13501. td adr --> size
  13502. tag(1)
  13503. tag(2)
  13504. tag(3)
  13505. methods ->
  13506. *)
  13507. Info(source, "record size");
  13508. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13509. TdTable(TypeTags, FALSE);
  13510. MethodTable(FALSE);
  13511. END;
  13512. END NewTypeDescriptor;
  13513. BEGIN
  13514. x := x.resolved;
  13515. IF (x IS SyntaxTree.PointerType) THEN
  13516. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  13517. END;
  13518. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  13519. recordType := x(SyntaxTree.RecordType);
  13520. td := x.typeDeclaration;
  13521. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13522. ASSERT(td # NIL);
  13523. section := module.allSections.FindBySymbol(td); (* TODO *)
  13524. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13525. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13526. NewTypeDescriptor
  13527. END;
  13528. END;
  13529. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  13530. cellType := x(SyntaxTree.CellType);
  13531. td := x.typeDeclaration;
  13532. section := module.allSections.FindBySymbol(td); (* TODO *)
  13533. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13534. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13535. NewTypeDescriptor
  13536. END;
  13537. END;
  13538. END
  13539. END CheckTypeDeclaration
  13540. END MetaDataGenerator;
  13541. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  13542. VAR
  13543. trace-: BOOLEAN;
  13544. traceString-: SyntaxTree.IdentifierString;
  13545. traceModuleName-: SyntaxTree.IdentifierString;
  13546. profile-: BOOLEAN;
  13547. noRuntimeChecks: BOOLEAN;
  13548. simpleMetaData-: BOOLEAN;
  13549. noAsserts: BOOLEAN;
  13550. optimize-: BOOLEAN;
  13551. cooperative-: BOOLEAN;
  13552. preregisterStatic-: BOOLEAN;
  13553. dump-: Basic.Writer;
  13554. cellsAreObjects: BOOLEAN;
  13555. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  13556. experiment: BOOLEAN;
  13557. PROCEDURE &InitIntermediateBackend*;
  13558. BEGIN
  13559. simpleMetaData := FALSE;
  13560. InitBackend;
  13561. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  13562. SetTraceModuleName(DefaultTraceModuleName);
  13563. END InitIntermediateBackend;
  13564. (* must be overwritten by actual backend, if parameter registers should be used *)
  13565. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  13566. BEGIN
  13567. register := -1;
  13568. RETURN FALSE;
  13569. END GetParameterRegister;
  13570. PROCEDURE ResetParameterRegisters*;
  13571. BEGIN
  13572. END ResetParameterRegisters;
  13573. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  13574. VAR
  13575. declarationVisitor: DeclarationVisitor;
  13576. implementationVisitor: ImplementationVisitor;
  13577. module: Sections.Module;
  13578. name, platformName: SyntaxTree.IdentifierString;
  13579. meta: MetaDataGenerator;
  13580. crc: CRC.CRC32Stream;
  13581. BEGIN
  13582. ResetError;
  13583. Global.GetSymbolName(x,name);
  13584. NEW(module,x,system); (* backend structures *)
  13585. Global.GetModuleName(x, name);
  13586. module.SetModuleName(name);
  13587. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  13588. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  13589. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  13590. declarationVisitor.Module(x,module);
  13591. IF ~meta.simple THEN
  13592. meta.Module(implementationVisitor.moduleBodySection);
  13593. END;
  13594. GetDescription(platformName);
  13595. module.SetPlatformName(platformName);
  13596. NEW(crc);
  13597. module.allSections.WriteRaw(crc);
  13598. crc.Update;
  13599. meta.PatchCRC(crc.GetCRC());
  13600. RETURN module
  13601. END GenerateIntermediate;
  13602. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  13603. BEGIN RETURN TRUE
  13604. END SupportedImmediate;
  13605. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  13606. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  13607. END ProcessSyntaxTreeModule;
  13608. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  13609. VAR
  13610. result: Sections.Module;
  13611. traceName: Basic.MessageString;
  13612. BEGIN
  13613. ASSERT(intermediateCodeModule IS Sections.Module);
  13614. result := intermediateCodeModule(Sections.Module);
  13615. IF trace THEN
  13616. traceName := "intermediate code trace: ";
  13617. Strings.Append(traceName,traceString);
  13618. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  13619. IF (traceString="") OR (traceString="*") THEN
  13620. result.Dump(dump);
  13621. dump.Update
  13622. ELSE
  13623. Sections.DumpFiltered(dump, result, traceString);
  13624. END
  13625. END;
  13626. RETURN result
  13627. END ProcessIntermediateCodeModule;
  13628. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  13629. BEGIN instructionSet := "Intermediate";
  13630. END GetDescription;
  13631. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  13632. BEGIN
  13633. SELF.simpleMetaData := simpleMetaData;
  13634. END SetSimpleMetaData;
  13635. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  13636. BEGIN COPY(name, traceModuleName)
  13637. END SetTraceModuleName;
  13638. PROCEDURE DefineOptions*(options: Options.Options);
  13639. BEGIN
  13640. DefineOptions^(options);
  13641. options.Add(0X,"trace",Options.String);
  13642. options.Add(0X,"builtinsModule",Options.String);
  13643. options.Add(0X,"traceModule",Options.String);
  13644. options.Add(0X,"profile",Options.Flag);
  13645. options.Add(0X,"noRuntimeChecks",Options.Flag);
  13646. options.Add(0X,"noAsserts",Options.Flag);
  13647. options.Add(0X,"metaData",Options.String);
  13648. options.Add('o',"optimize", Options.Flag);
  13649. options.Add(0X,"preregisterStatic", Options.Flag);
  13650. options.Add(0X,"cellsAreObjects", Options.Flag);
  13651. options.Add(0X,"preciseGC", Options.Flag);
  13652. options.Add(0X,"trackLeave", Options.Flag);
  13653. options.Add(0X,"writeBarriers", Options.Flag);
  13654. options.Add(0X,"experiment", Options.Flag);
  13655. END DefineOptions;
  13656. PROCEDURE GetOptions*(options: Options.Options);
  13657. VAR name,string: SyntaxTree.IdentifierString;
  13658. BEGIN
  13659. GetOptions^(options);
  13660. trace := options.GetString("trace",traceString);
  13661. profile := options.GetFlag("profile");
  13662. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  13663. noAsserts := options.GetFlag("noAsserts");
  13664. cooperative := options.GetFlag("cooperative");
  13665. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  13666. simpleMetaData := TRUE
  13667. END;
  13668. IF options.GetString("metaData",string) THEN
  13669. IF string = "simple" THEN simpleMetaData := TRUE
  13670. ELSIF string ="full" THEN simpleMetaData := FALSE
  13671. END;
  13672. END;
  13673. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  13674. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  13675. optimize := options.GetFlag("optimize");
  13676. preregisterStatic := options.GetFlag("preregisterStatic");
  13677. cellsAreObjects := options.GetFlag("cellsAreObjects");
  13678. preciseGC := options.GetFlag("preciseGC");
  13679. trackLeave := options.GetFlag("trackLeave");
  13680. writeBarriers := options.GetFlag("writeBarriers");
  13681. experiment := options.GetFlag("experiment");
  13682. IF simpleMetaData THEN preciseGC := FALSE END;
  13683. END GetOptions;
  13684. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  13685. BEGIN RETURN SymbolFileFormat.Get()
  13686. END DefaultSymbolFileFormat;
  13687. END IntermediateBackend;
  13688. (* ----------------------------------- register allocation ------------------------------------- *)
  13689. (* register mapping scheme
  13690. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  13691. spill offset
  13692. part(n) --> ticket <--> physical register
  13693. spill offset
  13694. *)
  13695. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  13696. emptyOperand: IntermediateCode.Operand;
  13697. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  13698. statCoopResetVariables: LONGINT;
  13699. statCoopModifyAssignments: LONGINT;
  13700. modifyAssignmentsPC : LONGINT;
  13701. statCoopNilCheck: LONGINT;
  13702. statCoopSwitch: LONGINT;
  13703. statCoopAssignProcedure: LONGINT;
  13704. statCoopTraceMethod: LONGINT;
  13705. statCoopResetProcedure: LONGINT;
  13706. statCoopTraceModule: LONGINT;
  13707. PROCEDURE ResetStatistics*;
  13708. BEGIN
  13709. statCoopResetVariables := 0;
  13710. statCoopModifyAssignments := 0;
  13711. statCoopNilCheck:= 0;
  13712. statCoopSwitch:= 0;
  13713. statCoopAssignProcedure:= 0;
  13714. statCoopTraceMethod:= 0;
  13715. statCoopResetProcedure:= 0;
  13716. statCoopTraceModule:= 0;
  13717. END ResetStatistics;
  13718. PROCEDURE Statistics*;
  13719. BEGIN
  13720. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  13721. TRACE(statCoopNilCheck, statCoopSwitch);
  13722. TRACE(statCoopAssignProcedure,
  13723. statCoopTraceMethod,
  13724. statCoopResetProcedure,
  13725. statCoopTraceModule)
  13726. END Statistics;
  13727. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  13728. VAR h: LONGINT;
  13729. BEGIN
  13730. WHILE b # 0 DO
  13731. h := a MOD b;
  13732. a := b;
  13733. b := h;
  13734. END;
  13735. RETURN a
  13736. END GCD;
  13737. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  13738. BEGIN
  13739. RETURN a*b DIV GCD(a,b)
  13740. END SCM;
  13741. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  13742. BEGIN
  13743. (*TRACE(a,b);*)
  13744. IF a = 0 THEN RETURN b
  13745. ELSIF b = 0 THEN RETURN a
  13746. ELSE RETURN SCM(a,b)
  13747. END;
  13748. END CommonAlignment;
  13749. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13750. BEGIN
  13751. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  13752. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  13753. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13754. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  13755. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13756. END
  13757. END PassBySingleReference;
  13758. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13759. BEGIN
  13760. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  13761. END PassInRegister;
  13762. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  13763. VAR new: RegisterEntry;
  13764. BEGIN
  13765. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  13766. IF queue = NIL THEN
  13767. queue := new
  13768. ELSE
  13769. new.next := queue;
  13770. IF queue#NIL THEN queue.prev := new END;
  13771. queue := new
  13772. END;
  13773. END AddRegisterEntry;
  13774. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  13775. VAR this: RegisterEntry;
  13776. BEGIN
  13777. this := queue;
  13778. WHILE (this # NIL) & (this.register # register) DO
  13779. this := this.next;
  13780. END;
  13781. IF this = NIL THEN
  13782. RETURN FALSE
  13783. END;
  13784. ASSERT(this # NIL);
  13785. IF this = queue THEN queue := queue.next END;
  13786. IF this.prev # NIL THEN this.prev.next := this.next END;
  13787. IF this.next # NIL THEN this.next.prev := this.prev END;
  13788. RETURN TRUE
  13789. END RemoveRegisterEntry;
  13790. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  13791. BEGIN ASSERT(cond);
  13792. END Assert;
  13793. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  13794. BEGIN
  13795. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  13796. END ReusableRegister;
  13797. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  13798. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  13799. BEGIN
  13800. procedure := moduleScope.bodyProcedure;
  13801. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  13802. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  13803. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  13804. procedure.SetScope(moduleScope);
  13805. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  13806. procedure.SetAccess(SyntaxTree.Hidden);
  13807. moduleScope.SetBodyProcedure(procedure);
  13808. moduleScope.AddProcedure(procedure);
  13809. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  13810. END;
  13811. END EnsureBodyProcedure;
  13812. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  13813. VAR import: SyntaxTree.Import;
  13814. selfName: SyntaxTree.IdentifierString;
  13815. module: SyntaxTree.Module;
  13816. BEGIN
  13817. scope.ownerModule.GetName(selfName);
  13818. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  13819. module := scope.ownerModule
  13820. ELSE
  13821. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  13822. IF import = NIL THEN
  13823. RETURN NIL
  13824. ELSIF import.module = NIL THEN
  13825. RETURN NIL
  13826. ELSE module := import.module
  13827. END;
  13828. END;
  13829. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  13830. END GetSymbol;
  13831. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  13832. BEGIN
  13833. op.mode := mode;
  13834. IntermediateCode.InitOperand(op.op);
  13835. IntermediateCode.InitOperand(op.tag);
  13836. IntermediateCode.InitOperand(op.extra);
  13837. op.dimOffset := 0;
  13838. op.availability := -1;
  13839. END InitOperand;
  13840. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  13841. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  13842. BEGIN RETURN IntermediateCode.GetType(system, type)
  13843. END GetType;
  13844. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  13845. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  13846. BEGIN
  13847. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13848. (*
  13849. UniqueId(name,module,name,adr);
  13850. *)
  13851. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13852. constant.SetValue(value);
  13853. constant.SetAccess(SyntaxTree.Hidden);
  13854. module.moduleScope.AddConstant(constant);
  13855. constant.SetScope(module.moduleScope);
  13856. RETURN constant
  13857. END BuildConstant;
  13858. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13859. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13860. BEGIN
  13861. variable := scope.firstVariable;
  13862. WHILE variable # NIL DO
  13863. IF variable.NeedsTrace() THEN
  13864. RETURN TRUE;
  13865. END;
  13866. variable := variable.nextVariable;
  13867. END;
  13868. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13869. WHILE parameter # NIL DO
  13870. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13871. RETURN TRUE;
  13872. END;
  13873. parameter := parameter.nextParameter;
  13874. END;
  13875. RETURN FALSE;
  13876. END HasPointers;
  13877. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13878. 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));
  13879. END IsVariableParameter;
  13880. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13881. VAR parameter: SyntaxTree.Parameter;
  13882. BEGIN
  13883. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13884. WHILE parameter # NIL DO
  13885. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13886. IF parameter.movable THEN RETURN TRUE END;
  13887. parameter := parameter.nextParameter;
  13888. END;
  13889. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13890. END HasVariableParameters;
  13891. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13892. BEGIN
  13893. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13894. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13895. END HasExplicitTraceMethod;
  13896. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13897. BEGIN
  13898. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13899. IF (expression IS SyntaxTree.IntegerValue) THEN
  13900. val := expression(SyntaxTree.IntegerValue).value;
  13901. RETURN TRUE
  13902. ELSE
  13903. RETURN FALSE
  13904. END;
  13905. END IsIntegerConstant;
  13906. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13907. BEGIN
  13908. IF val <= 0 THEN RETURN FALSE END;
  13909. exp := 0;
  13910. WHILE ~ODD(val) DO
  13911. val := val DIV 2;
  13912. INC(exp)
  13913. END;
  13914. RETURN val = 1
  13915. END PowerOf2;
  13916. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13917. VAR procedure: SyntaxTree.Procedure;
  13918. BEGIN
  13919. procedure := record.recordScope.constructor;
  13920. IF procedure = NIL THEN
  13921. record := record.GetBaseRecord();
  13922. IF record # NIL THEN
  13923. procedure := GetConstructor(record)
  13924. END;
  13925. END;
  13926. RETURN procedure;
  13927. END GetConstructor;
  13928. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13929. BEGIN
  13930. value := SHORT(op.intValue);
  13931. RETURN op.mode = IntermediateCode.ModeImmediate;
  13932. END IsIntegerImmediate;
  13933. (** whether a type strictily is a pointer to record or object type
  13934. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13935. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13936. BEGIN
  13937. IF type = NIL THEN
  13938. RETURN FALSE
  13939. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13940. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13941. ELSE
  13942. RETURN FALSE
  13943. END
  13944. END IsStrictlyPointerToRecord;
  13945. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13946. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13947. END IsUnsafePointer;
  13948. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13949. BEGIN type := type.resolved;
  13950. IF type IS SyntaxTree.PointerType THEN
  13951. type := type(SyntaxTree.PointerType).pointerBase;
  13952. type := type.resolved;
  13953. IF type IS SyntaxTree.RecordType THEN
  13954. recordType := type(SyntaxTree.RecordType);
  13955. RETURN TRUE
  13956. ELSE
  13957. RETURN FALSE
  13958. END
  13959. ELSIF type IS SyntaxTree.RecordType THEN
  13960. recordType := type(SyntaxTree.RecordType);
  13961. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13962. ELSIF type IS SyntaxTree.ObjectType THEN
  13963. RETURN TRUE
  13964. ELSIF type IS SyntaxTree.AnyType THEN
  13965. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13966. ELSE
  13967. RETURN FALSE
  13968. END;
  13969. END IsPointerToRecord;
  13970. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13971. BEGIN
  13972. type := type.resolved;
  13973. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13974. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13975. END IsArrayOfSystemByte;
  13976. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13977. BEGIN
  13978. IF type = NIL THEN RETURN FALSE END;
  13979. type := type.resolved;
  13980. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13981. END IsOpenArray;
  13982. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13983. BEGIN
  13984. IF type = NIL THEN RETURN FALSE END;
  13985. type := type.resolved;
  13986. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13987. END IsSemiDynamicArray;
  13988. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13989. BEGIN
  13990. IF type = NIL THEN RETURN FALSE END;
  13991. type := type.resolved;
  13992. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13993. END IsStaticArray;
  13994. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13995. BEGIN
  13996. IF type = NIL THEN RETURN FALSE END;
  13997. type := type.resolved;
  13998. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13999. END IsStaticMathArray;
  14000. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14001. BEGIN
  14002. WHILE (IsStaticMathArray(type)) DO
  14003. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14004. END;
  14005. RETURN type;
  14006. END StaticMathArrayBaseType;
  14007. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14008. VAR size: LONGINT;
  14009. BEGIN
  14010. size := 1;
  14011. WHILE (IsStaticArray(type)) DO
  14012. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  14013. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14014. END;
  14015. RETURN size;
  14016. END StaticArrayNumElements;
  14017. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14018. VAR size: LONGINT;
  14019. BEGIN
  14020. size := 1;
  14021. WHILE (IsStaticMathArray(type)) DO
  14022. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  14023. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14024. END;
  14025. RETURN size;
  14026. END StaticMathArrayNumElements;
  14027. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14028. BEGIN
  14029. WHILE (IsStaticArray(type)) DO
  14030. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14031. END;
  14032. RETURN type;
  14033. END StaticArrayBaseType;
  14034. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14035. BEGIN
  14036. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  14037. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14038. END;
  14039. RETURN type;
  14040. END ArrayBaseType;
  14041. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  14042. BEGIN
  14043. IF type = NIL THEN RETURN FALSE END;
  14044. type := type.resolved;
  14045. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  14046. END IsDelegate;
  14047. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  14048. VAR i: LONGINT;
  14049. BEGIN
  14050. i := 0; type := type.resolved;
  14051. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14052. INC(i);
  14053. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  14054. END;
  14055. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14056. INC(i);
  14057. type := type(SyntaxTree.MathArrayType).arrayBase;
  14058. IF type # NIL THEN type := type.resolved END;
  14059. END;
  14060. RETURN i
  14061. END DynamicDim;
  14062. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  14063. BEGIN
  14064. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14065. type := type(SyntaxTree.ArrayType).arrayBase;
  14066. END;
  14067. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14068. type := type(SyntaxTree.MathArrayType).arrayBase;
  14069. END;
  14070. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  14071. END StaticSize;
  14072. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  14073. BEGIN
  14074. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  14075. END IsImmediate;
  14076. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  14077. BEGIN
  14078. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  14079. END IsAddress;
  14080. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  14081. BEGIN
  14082. RETURN (x.mode = IntermediateCode.ModeRegister);
  14083. END IsRegister;
  14084. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  14085. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  14086. BEGIN
  14087. typeDeclaration := recordType.typeDeclaration;
  14088. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  14089. Global.GetSymbolSegmentedName(typeDeclaration,name);
  14090. END GetRecordTypeName;
  14091. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  14092. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  14093. BEGIN
  14094. parSize := 0;
  14095. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  14096. parameter := procedureType.returnParameter;
  14097. INC(parSize,system.SizeOfParameter(parameter));
  14098. parSize := parSize + (-parSize) MOD system.addressSize;
  14099. END;
  14100. parameter :=procedureType.lastParameter;
  14101. WHILE (parameter # NIL) DO
  14102. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  14103. INC(parSize, system.addressSize);
  14104. ELSE
  14105. INC(parSize,system.SizeOfParameter(parameter));
  14106. parSize := parSize + (-parSize) MOD system.addressSize;
  14107. END;
  14108. parameter := parameter.prevParameter;
  14109. END;
  14110. IF procedureType.selfParameter # NIL THEN
  14111. parameter := procedureType.selfParameter;
  14112. INC(parSize,system.SizeOfParameter(parameter));
  14113. parSize := parSize + (-parSize) MOD system.addressSize;
  14114. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  14115. END; (* method => self pointer *)
  14116. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  14117. RETURN ToMemoryUnits(system,parSize)
  14118. END ParametersSize;
  14119. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  14120. BEGIN
  14121. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  14122. END IsNested;
  14123. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  14124. BEGIN
  14125. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  14126. scope := scope.outerScope;
  14127. END;
  14128. RETURN scope # NIL;
  14129. END InCellScope;
  14130. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  14131. BEGIN
  14132. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  14133. END ProcedureParametersSize;
  14134. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  14135. VAR dataUnit: LONGINT;
  14136. BEGIN dataUnit := system.dataUnit;
  14137. ASSERT(size MOD system.dataUnit = 0);
  14138. RETURN LONGINT(size DIV system.dataUnit)
  14139. END ToMemoryUnits;
  14140. PROCEDURE Get*(): Backend.Backend;
  14141. VAR backend: IntermediateBackend;
  14142. BEGIN NEW(backend); RETURN backend
  14143. END Get;
  14144. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  14145. VAR instruction: IntermediateCode.Instruction;
  14146. BEGIN
  14147. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  14148. RETURN instruction
  14149. END Nop;
  14150. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14151. VAR instruction: IntermediateCode.Instruction;
  14152. BEGIN
  14153. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  14154. RETURN instruction
  14155. END Mov;
  14156. (* like Mov but ensures that no new register will be allocated for dest *)
  14157. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14158. VAR instruction: IntermediateCode.Instruction;
  14159. BEGIN
  14160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  14161. RETURN instruction
  14162. END MovReplace;
  14163. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14164. VAR instruction: IntermediateCode.Instruction;
  14165. BEGIN
  14166. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  14167. RETURN instruction
  14168. END Conv;
  14169. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  14170. VAR instruction: IntermediateCode.Instruction;
  14171. BEGIN
  14172. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  14173. RETURN instruction
  14174. END Call;
  14175. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  14176. VAR op1, op2, op3: IntermediateCode.Operand;
  14177. VAR instruction: IntermediateCode.Instruction;
  14178. BEGIN
  14179. IntermediateCode.InitNumber(op1,pcOffset);
  14180. IntermediateCode.InitNumber(op2,callingConvention);
  14181. IntermediateCode.InitNumber(op3,unwind);
  14182. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  14183. RETURN instruction
  14184. END Exit;
  14185. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14186. VAR instruction: IntermediateCode.Instruction;
  14187. BEGIN
  14188. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  14189. RETURN instruction
  14190. END Return;
  14191. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14192. VAR instruction: IntermediateCode.Instruction;
  14193. BEGIN
  14194. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  14195. RETURN instruction
  14196. END Result;
  14197. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  14198. VAR op1: IntermediateCode.Operand;
  14199. VAR instruction: IntermediateCode.Instruction;
  14200. BEGIN
  14201. IntermediateCode.InitNumber(op1,nr);
  14202. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  14203. RETURN instruction
  14204. END Trap;
  14205. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  14206. VAR instruction: IntermediateCode.Instruction;
  14207. BEGIN
  14208. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  14209. RETURN instruction
  14210. END Br;
  14211. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14212. VAR instruction: IntermediateCode.Instruction;
  14213. BEGIN
  14214. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  14215. RETURN instruction
  14216. END Breq;
  14217. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14218. VAR instruction: IntermediateCode.Instruction;
  14219. BEGIN
  14220. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  14221. RETURN instruction
  14222. END Brne;
  14223. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14224. VAR instruction: IntermediateCode.Instruction;
  14225. BEGIN
  14226. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  14227. RETURN instruction
  14228. END Brge;
  14229. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14230. VAR instruction: IntermediateCode.Instruction;
  14231. BEGIN
  14232. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  14233. RETURN instruction
  14234. END Brlt;
  14235. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  14236. VAR instruction: IntermediateCode.Instruction;
  14237. BEGIN
  14238. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  14239. RETURN instruction
  14240. END Pop;
  14241. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14242. VAR instruction: IntermediateCode.Instruction;
  14243. BEGIN
  14244. ASSERT(op.mode # IntermediateCode.Undefined);
  14245. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  14246. RETURN instruction
  14247. END Push;
  14248. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14249. VAR instruction: IntermediateCode.Instruction;
  14250. BEGIN
  14251. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  14252. RETURN instruction
  14253. END Neg;
  14254. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14255. VAR instruction: IntermediateCode.Instruction;
  14256. BEGIN
  14257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  14258. RETURN instruction
  14259. END Not;
  14260. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14261. VAR instruction: IntermediateCode.Instruction;
  14262. BEGIN
  14263. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  14264. RETURN instruction
  14265. END Abs;
  14266. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14267. VAR instruction: IntermediateCode.Instruction;
  14268. BEGIN
  14269. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  14270. ASSERT(~IsImmediate(instruction.op1));
  14271. RETURN instruction
  14272. END Mul;
  14273. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14274. VAR instruction: IntermediateCode.Instruction;
  14275. BEGIN
  14276. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  14277. RETURN instruction
  14278. END Div;
  14279. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14280. VAR instruction: IntermediateCode.Instruction;
  14281. BEGIN
  14282. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  14283. RETURN instruction
  14284. END Mod;
  14285. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14286. VAR instruction: IntermediateCode.Instruction;
  14287. BEGIN
  14288. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  14289. RETURN instruction
  14290. END Sub;
  14291. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14292. VAR instruction: IntermediateCode.Instruction;
  14293. BEGIN
  14294. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  14295. RETURN instruction
  14296. END Add;
  14297. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14298. VAR instruction: IntermediateCode.Instruction;
  14299. BEGIN
  14300. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  14301. RETURN instruction
  14302. END And;
  14303. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14304. VAR instruction: IntermediateCode.Instruction;
  14305. BEGIN
  14306. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  14307. RETURN instruction
  14308. END Or;
  14309. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14310. VAR instruction: IntermediateCode.Instruction;
  14311. BEGIN
  14312. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  14313. RETURN instruction
  14314. END Xor;
  14315. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14316. VAR instruction: IntermediateCode.Instruction;
  14317. BEGIN
  14318. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  14319. RETURN instruction
  14320. END Shl;
  14321. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14322. VAR instruction: IntermediateCode.Instruction;
  14323. BEGIN
  14324. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  14325. RETURN instruction
  14326. END Shr;
  14327. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14328. VAR instruction: IntermediateCode.Instruction;
  14329. BEGIN
  14330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  14331. RETURN instruction
  14332. END Rol;
  14333. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14334. VAR instruction: IntermediateCode.Instruction;
  14335. BEGIN
  14336. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  14337. RETURN instruction
  14338. END Ror;
  14339. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14340. VAR instruction: IntermediateCode.Instruction;
  14341. BEGIN
  14342. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  14343. RETURN instruction
  14344. END Cas;
  14345. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14346. VAR instruction: IntermediateCode.Instruction;
  14347. BEGIN
  14348. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  14349. ASSERT(~IntermediateCode.IsVectorRegister(src));
  14350. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  14351. RETURN instruction
  14352. END Copy;
  14353. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  14354. VAR instruction: IntermediateCode.Instruction;
  14355. BEGIN
  14356. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  14357. RETURN instruction
  14358. END Fill;
  14359. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  14360. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  14361. BEGIN
  14362. string := IntermediateCode.String(s);
  14363. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  14364. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  14365. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  14366. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  14367. RETURN instruction
  14368. END Asm;
  14369. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14370. VAR instruction: IntermediateCode.Instruction;
  14371. BEGIN
  14372. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  14373. RETURN instruction
  14374. END Data;
  14375. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  14376. VAR instruction: IntermediateCode.Instruction;
  14377. BEGIN
  14378. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  14379. IntermediateCode.SetSubType(instruction, subtype);
  14380. RETURN instruction
  14381. END SpecialInstruction;
  14382. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  14383. VAR op1: IntermediateCode.Operand;
  14384. VAR instruction: IntermediateCode.Instruction;
  14385. BEGIN
  14386. (*! generate a warning if size exceeds a certain limit *)
  14387. (*
  14388. ASSERT(bytes < 1000000); (* sanity check *)
  14389. *)
  14390. ASSERT(0 <= units); (* sanity check *)
  14391. IntermediateCode.InitNumber(op1,units);
  14392. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  14393. RETURN instruction
  14394. END Reserve;
  14395. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  14396. VAR op1: IntermediateCode.Operand;
  14397. VAR instruction: IntermediateCode.Instruction;
  14398. BEGIN
  14399. IntermediateCode.InitNumber(op1,position.start);
  14400. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  14401. RETURN instruction
  14402. END LabelInstruction;
  14403. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  14404. VAR pc: LONGINT;
  14405. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  14406. BEGIN
  14407. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  14408. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  14409. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  14410. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  14411. IF instr.op1.type.form = IntermediateCode.Float THEN
  14412. RETURN instr.op1.floatValue = op.floatValue
  14413. ELSE
  14414. RETURN instr.op1.intValue = op.intValue
  14415. END;
  14416. END ProvidesValue;
  14417. BEGIN
  14418. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  14419. pc := 0;
  14420. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  14421. INC(pc);
  14422. END;
  14423. IF pc = data.pc THEN
  14424. data.Emit(Data(Basic.invalidPosition,vop));
  14425. END;
  14426. RETURN pc
  14427. END EnterImmediate;
  14428. PROCEDURE Init;
  14429. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  14430. BEGIN
  14431. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  14432. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  14433. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  14434. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  14435. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  14436. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  14437. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  14438. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  14439. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  14440. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  14441. IntermediateCode.InitOperand(emptyOperand);
  14442. FOR i := 0 TO NumberSystemCalls-1 DO
  14443. name := "@SystemCall";
  14444. Basic.AppendNumber(name,i);
  14445. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  14446. END;
  14447. END Init;
  14448. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  14449. BEGIN
  14450. RETURN (symbol # NIL) & symbol.NeedsSection();
  14451. END IsExported;
  14452. BEGIN
  14453. Init;
  14454. END FoxIntermediateBackend.
  14455. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  14456. # Release.Build --path="/temp/obg/" Win32 ~
  14457. # 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 ~
  14458. FStols.CloseFiles A2Z.exe ~
  14459. System.FreeDownTo FoxIntermediateBackend ~
  14460. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  14461. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  14462. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  14463. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  14464. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  14465. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  14466. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  14467. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  14468. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  14469. GenericLinker.Mod Loader.Mod BootConsole.Mod