FoxIntermediateBackend.Mod 614 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973149741497514976149771497814979149801498114982149831498414985149861498714988149891499014991149921499314994149951499614997149981499915000150011500215003150041500515006150071500815009150101501115012150131501415015150161501715018150191502015021150221502315024150251502615027150281502915030150311503215033150341503515036150371503815039150401504115042150431504415045150461504715048150491505015051150521505315054150551505615057150581505915060150611506215063150641506515066150671506815069150701507115072150731507415075150761507715078150791508015081150821508315084150851508615087150881508915090150911509215093150941509515096150971509815099151001510115102151031510415105151061510715108151091511015111151121511315114151151511615117151181511915120151211512215123151241512515126151271512815129151301513115132151331513415135151361513715138151391514015141151421514315144151451514615147151481514915150151511515215153151541515515156151571515815159151601516115162151631516415165151661516715168151691517015171151721517315174151751517615177151781517915180151811518215183151841518515186151871518815189151901519115192151931519415195151961519715198151991520015201152021520315204152051520615207152081520915210152111521215213152141521515216152171521815219152201522115222152231522415225152261522715228152291523015231152321523315234152351523615237152381523915240152411524215243152441524515246152471524815249152501525115252152531525415255152561525715258152591526015261152621526315264152651526615267152681526915270152711527215273152741527515276152771527815279152801528115282152831528415285152861528715288152891529015291152921529315294152951529615297152981529915300153011530215303153041530515306153071530815309153101531115312153131531415315153161531715318153191532015321153221532315324153251532615327153281532915330153311533215333153341533515336153371533815339153401534115342153431534415345153461534715348153491535015351153521535315354153551535615357153581535915360153611536215363153641536515366153671536815369153701537115372153731537415375153761537715378153791538015381153821538315384153851538615387153881538915390153911539215393153941539515396153971539815399154001540115402154031540415405154061540715408154091541015411154121541315414154151541615417154181541915420154211542215423154241542515426154271542815429154301543115432154331543415435154361543715438154391544015441154421544315444154451544615447154481544915450154511545215453154541545515456154571545815459154601546115462154631546415465154661546715468154691547015471154721547315474154751547615477154781547915480154811548215483154841548515486154871548815489154901549115492154931549415495154961549715498154991550015501155021550315504155051550615507155081550915510155111551215513155141551515516155171551815519155201552115522155231552415525155261552715528155291553015531155321553315534155351553615537155381553915540155411554215543155441554515546155471554815549155501555115552155531555415555155561555715558155591556015561155621556315564155651556615567155681556915570155711557215573155741557515576155771557815579155801558115582155831558415585155861558715588155891559015591155921559315594155951559615597155981559915600156011560215603156041560515606156071560815609156101561115612156131561415615156161561715618156191562015621156221562315624156251562615627156281562915630156311563215633156341563515636156371563815639156401564115642156431564415645156461564715648156491565015651156521565315654156551565615657156581565915660156611566215663156641566515666156671566815669156701567115672156731567415675156761567715678156791568015681156821568315684156851568615687156881568915690156911569215693156941569515696156971569815699157001570115702157031570415705157061570715708157091571015711157121571315714157151571615717157181571915720157211572215723157241572515726157271572815729157301573115732157331573415735157361573715738157391574015741157421574315744157451574615747157481574915750157511575215753157541575515756157571575815759157601576115762157631576415765157661576715768157691577015771157721577315774157751577615777157781577915780157811578215783157841578515786157871578815789157901579115792157931579415795157961579715798157991580015801158021580315804158051580615807158081580915810158111581215813158141581515816158171581815819158201582115822158231582415825158261582715828
  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 32 OF CHAR;
  1280. BEGIN
  1281. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1282. string := "[";
  1283. Strings.IntToHexStr(fingerPrint.public, 8, 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 (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1375. GetCodeSectionNameForSymbol(procedure, name);
  1376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1377. ELSE
  1378. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1379. END;
  1380. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1381. IntermediateCode.AddOffset(op1, 1);
  1382. Emit(Push(Basic.invalidPosition,op1));
  1383. Emit(Mov(Basic.invalidPosition,fp, sp));
  1384. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1385. NEW(call, section);
  1386. NEW(nocall, section);
  1387. reg := NewRegisterOperand(addressType);
  1388. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1389. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1390. BrltL(call, sp, reg);
  1391. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1392. BrgeL(nocall, sp, op2);
  1393. call.Resolve(section.pc);
  1394. Emit(Push(Basic.invalidPosition, reg));
  1395. ReleaseIntermediateOperand(reg);
  1396. parametersSize := ProcParametersSize(procedure);
  1397. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1398. Emit(Push(Basic.invalidPosition, op2));
  1399. CallThis(position, "Activities","ExpandStack",2);
  1400. Emit(Result(Basic.invalidPosition, sp));
  1401. nocall.Resolve(section.pc);
  1402. END;
  1403. ELSE
  1404. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1405. Emit(Push(Basic.invalidPosition, one)) ;
  1406. procedureType.SetParametersOffset(1);
  1407. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1408. END;
  1409. Emit(Mov(Basic.invalidPosition, fp, sp));
  1410. END;
  1411. END;
  1412. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1413. SELF.section := prevSection;
  1414. dump := prevDump;
  1415. END EmitEnter;
  1416. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1417. VAR op1,op2: IntermediateCode.Operand;
  1418. VAR instruction: IntermediateCode.Instruction;
  1419. BEGIN
  1420. IntermediateCode.InitNumber(op1,callconv);
  1421. IntermediateCode.InitNumber(op2,varSize);
  1422. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1423. RETURN instruction
  1424. END Enter;
  1425. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1426. VAR op1: IntermediateCode.Operand;
  1427. VAR instruction: IntermediateCode.Instruction;
  1428. BEGIN
  1429. IntermediateCode.InitNumber(op1,callconv);
  1430. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1431. RETURN instruction
  1432. END Leave;
  1433. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1434. VAR prevSection: IntermediateCode.Section;
  1435. VAR op2: IntermediateCode.Operand;
  1436. VAR body: SyntaxTree.Body;
  1437. BEGIN
  1438. prevSection := SELF.section;
  1439. SELF.section := section;
  1440. Emit(Leave(position, callconv));
  1441. IF procedure # NIL THEN
  1442. body := procedure.procedureScope.body;
  1443. ELSE
  1444. body := NIL;
  1445. END;
  1446. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1447. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1448. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1449. Emit(Add(position, sp, fp, op2));
  1450. ELSE
  1451. Emit(Mov(position, sp, fp));
  1452. END;
  1453. Emit(Pop(position, fp));
  1454. END;
  1455. SELF.section := prevSection;
  1456. END EmitLeave;
  1457. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1458. VAR m: SymbolMap;
  1459. BEGIN
  1460. position := x.position;
  1461. IF currentIsInline THEN
  1462. m := currentMapper.Get(x);
  1463. IF m # NIL THEN
  1464. (*
  1465. Printout.Info("mapping from", x);
  1466. Printout.Info("mapping to ", m.to);
  1467. *)
  1468. VExpression(m.to);
  1469. op := result;
  1470. IF m.tag # NIL THEN
  1471. ReleaseIntermediateOperand(result.tag);
  1472. VExpression(m.tag);
  1473. op.tag := result.op;
  1474. ReleaseIntermediateOperand(result.tag);
  1475. END;
  1476. RETURN
  1477. END;
  1478. END;
  1479. VSymbol(x);
  1480. op := result;
  1481. END Symbol;
  1482. PROCEDURE Expression(x: SyntaxTree.Expression);
  1483. BEGIN
  1484. position := x.position;
  1485. constantDeclaration := NIL;
  1486. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1487. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1488. END;
  1489. IF x.resolved # NIL THEN
  1490. VExpression(x.resolved);
  1491. ELSE
  1492. VExpression(x);
  1493. END;
  1494. (* check this, was commented out in ActiveCells3 *)
  1495. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1496. Error(x.position, "unsupported modifier");
  1497. END;
  1498. END Expression;
  1499. (*
  1500. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1501. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1502. BEGIN
  1503. temporaries.GetUsage(current);
  1504. FOR i := 0 TO LEN(current)-1 DO
  1505. set := current[i] - previous[i];
  1506. IF set # {} THEN
  1507. FOR j := 0 TO MAX(SET)-1 DO
  1508. IF j IN set THEN
  1509. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1510. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1511. Symbol(variable, op);
  1512. MakeMemory(tmp,op.op,addressType,0);
  1513. ReleaseOperand(op);
  1514. Emit(Mov(position,tmp, nil ) );
  1515. ReleaseIntermediateOperand(tmp);
  1516. END;
  1517. END;
  1518. END;
  1519. END;
  1520. END;
  1521. END ResetUsedTemporaries;
  1522. *)
  1523. PROCEDURE Statement(x: SyntaxTree.Statement);
  1524. VAR use: VariableUse;
  1525. BEGIN
  1526. temporaries.GetUsage(use);
  1527. position := x.position;
  1528. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1529. IF commentPrintout # NIL THEN
  1530. commentPrintout.Statement(x);
  1531. dump.Ln;
  1532. (*dump.Update;*)
  1533. END;
  1534. VStatement(x);
  1535. (*
  1536. CheckRegistersFree();
  1537. *)
  1538. (*ResetUsedTemporaries(use);*)
  1539. temporaries.SetUsage(use);
  1540. END Statement;
  1541. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1542. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1543. *)
  1544. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1545. BEGIN
  1546. ASSERT(op.mode # IntermediateCode.Undefined);
  1547. IF op.mode = IntermediateCode.ModeMemory THEN
  1548. ReuseCopy(res,op);
  1549. ELSE
  1550. res := op;
  1551. UseIntermediateOperand(res);
  1552. END;
  1553. IntermediateCode.AddOffset(res,offset);
  1554. IntermediateCode.MakeMemory(res,type);
  1555. END MakeMemory;
  1556. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1557. VAR mem: IntermediateCode.Operand;
  1558. BEGIN
  1559. MakeMemory(mem,res,type,offset);
  1560. ReleaseIntermediateOperand(res);
  1561. res := mem;
  1562. END ToMemory;
  1563. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1564. VAR mem: IntermediateCode.Operand;
  1565. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1566. componentType: SyntaxTree.Type;
  1567. BEGIN
  1568. type := type.resolved;
  1569. IF operand.mode = ModeReference THEN
  1570. IF type IS SyntaxTree.RangeType THEN
  1571. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1572. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1573. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1574. ReleaseOperand(operand);
  1575. operand.op := firstOp;
  1576. operand.tag := lastOp;
  1577. operand.extra := stepOp;
  1578. ELSIF type IS SyntaxTree.ComplexType THEN
  1579. componentType := type(SyntaxTree.ComplexType).componentType;
  1580. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1581. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1582. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1583. ReleaseOperand(operand);
  1584. operand.op := firstOp;
  1585. operand.tag := lastOp
  1586. ELSE
  1587. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1588. ReleaseIntermediateOperand(operand.op);
  1589. (* EXPERIMENTAL *)
  1590. IF operand.availability >= 0 THEN
  1591. IF availableSymbols[operand.availability].inRegister THEN
  1592. operand.op := availableSymbols[operand.availability].register;
  1593. UseIntermediateOperand(operand.op);
  1594. ELSE
  1595. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1596. availableSymbols[operand.availability].memory := mem;
  1597. operand.op := availableSymbols[operand.availability].register;
  1598. Emit(Mov(position, operand.op, mem));
  1599. availableSymbols[operand.availability].inRegister := TRUE;
  1600. END;
  1601. ReleaseIntermediateOperand(mem);
  1602. ELSE
  1603. operand.op := mem;
  1604. END;
  1605. END;
  1606. operand.mode := ModeValue;
  1607. END;
  1608. ASSERT(operand.mode = ModeValue);
  1609. END LoadValue;
  1610. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1611. BEGIN
  1612. InitOperand(result, ModeUndefined);
  1613. Expression(x);
  1614. op := result;
  1615. LoadValue(op,x.type.resolved);
  1616. END Evaluate;
  1617. PROCEDURE EvaluateX(CONST x: SyntaxTree.Expression; VAR result: Operand);
  1618. VAR operand: Operand; type: SyntaxTree.Type; symbol: SyntaxTree.Symbol;
  1619. BEGIN
  1620. Evaluate(x, result); RETURN;
  1621. IF (x.resolved # NIL) & (x.resolved # x) THEN EvaluateX(x.resolved, result); RETURN END;
  1622. WITH x:
  1623. SyntaxTree.UnaryExpression DO
  1624. EvaluateUnaryExpression(x, result);
  1625. RETURN;
  1626. |SyntaxTree.BinaryExpression DO
  1627. EvaluateBinaryExpression(x, result);
  1628. RETURN;
  1629. |SyntaxTree.Set DO
  1630. EvaluateSet(x, result);
  1631. RETURN;
  1632. |SyntaxTree.RangeExpression DO
  1633. InitOperand(result, ModeValue);
  1634. ASSERT(x.first # NIL);
  1635. EvaluateX(x.first, operand);
  1636. result.op := operand.op;
  1637. UseIntermediateOperand(result.op);
  1638. ReleaseOperand(operand);
  1639. ASSERT(x.last # NIL);
  1640. EvaluateX(x.last, operand);
  1641. result.tag := operand.op;
  1642. UseIntermediateOperand(result.tag);
  1643. ReleaseOperand(operand);
  1644. IF x.step # NIL THEN
  1645. EvaluateX(x.step, operand);
  1646. result.extra := operand.op;
  1647. UseIntermediateOperand(result.extra);
  1648. ReleaseOperand(operand);
  1649. END;
  1650. |SyntaxTree.SymbolDesignator DO
  1651. symbol := x.symbol;
  1652. WITH symbol: SyntaxTree.Constant DO
  1653. EvaluateX(symbol.value, result);
  1654. RETURN
  1655. ELSE (* designate and load --> below *)
  1656. END;
  1657. |SyntaxTree.BuiltinCallDesignator DO
  1658. EvaluateBuiltinCallDesignator(x,result);
  1659. (*
  1660. |SyntaxTree.Conversion DO
  1661. |SyntaxTree.ProcedureCallDesignator
  1662. |SyntaxTree.TypeGuardDesignator
  1663. |SyntaxTree.DereferenceDesignator
  1664. |SyntaxTree.SupercallDesignator
  1665. |SyntaxTree.SelfDesignator
  1666. *)
  1667. |SyntaxTree.BooleanValue DO
  1668. InitOperand(result,ModeValue);
  1669. IF x.value THEN result.op := true ELSE result.op := false END;
  1670. RETURN;
  1671. |SyntaxTree.IntegerValue DO
  1672. InitOperand(result,ModeValue);
  1673. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1674. IF ~supportedImmediate(result.op) &~inData THEN
  1675. GetImmediateMem(result.op)
  1676. END;
  1677. RETURN;
  1678. |SyntaxTree.CharacterValue DO
  1679. InitOperand(result,ModeValue);
  1680. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  1681. RETURN;
  1682. |SyntaxTree.RealValue DO
  1683. InitOperand(result,ModeValue);
  1684. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1685. RETURN;
  1686. |SyntaxTree.ComplexValue DO
  1687. ASSERT(x.type IS SyntaxTree.ComplexType);
  1688. type := x.type(SyntaxTree.ComplexType).componentType;
  1689. InitOperand(result,ModeValue);
  1690. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,type),x.realValue); (* real part *)
  1691. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,type),x.imagValue); (* imaginary part *)
  1692. RETURN;
  1693. |SyntaxTree.NilValue DO
  1694. InitOperand(result,ModeValue);
  1695. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1696. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1697. RETURN;
  1698. |SyntaxTree.EnumerationValue DO
  1699. InitOperand(result,ModeValue);
  1700. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  1701. RETURN;
  1702. ELSE (* other designators *)
  1703. END;
  1704. Designate(x, result);
  1705. LoadValue(result, x.type);
  1706. END EvaluateX;
  1707. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1708. BEGIN
  1709. InitOperand(result,ModeUndefined);
  1710. Expression(x);
  1711. (* ASSERT(x.mode = ModeReference *)
  1712. op := result;
  1713. END Designate;
  1714. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1715. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1716. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1717. leftExpression, rightExpression: SyntaxTree.Expression;
  1718. BEGIN
  1719. ASSERT(label # NIL);
  1720. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1721. WITH x:
  1722. SyntaxTree.UnaryExpression DO
  1723. CASE x.operator OF
  1724. Scanner.Not:
  1725. Condition(x.left,label,~reason);
  1726. RETURN;
  1727. ELSE
  1728. END;
  1729. | SyntaxTree.BinaryExpression DO
  1730. leftType := x.left.type.resolved;
  1731. rightType := x.right.type.resolved;
  1732. CASE x.operator OF
  1733. Scanner.Or:
  1734. (* shortcut evaluation of left OR right *)
  1735. IF reason THEN (*left or right*)
  1736. Condition(x.left,label,TRUE);
  1737. Condition(x.right,label,TRUE);
  1738. ELSE (* ~ (left or right) = ~left & ~right *)
  1739. skip := NewLabel();
  1740. Condition(x.left,skip,TRUE);
  1741. Condition(x.right,label,FALSE);
  1742. SetLabel(skip);
  1743. END;
  1744. RETURN;
  1745. |Scanner.And:
  1746. (* shortcut evaluation of left & right *)
  1747. IF reason THEN (* left and right *)
  1748. skip := NewLabel();
  1749. Condition(x.left,skip,FALSE);
  1750. Condition(x.right,label,TRUE);
  1751. SetLabel(skip);
  1752. ELSE (* ~(left and right) = ~left or ~right *)
  1753. Condition(x.left,label,FALSE);
  1754. Condition(x.right,label,FALSE);
  1755. END;
  1756. RETURN;
  1757. |Scanner.Is:
  1758. (* get type desc tag *)
  1759. IF IsPointerToRecord(x.left.type,recordType) THEN
  1760. EvaluateX(x.left, left);
  1761. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1762. ELSE
  1763. Designate(x.left,left);
  1764. END;
  1765. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1766. ReleaseOperand(left);
  1767. RETURN;
  1768. |Scanner.Equal:
  1769. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1770. IF reason THEN
  1771. CompareString(BreqL,label,x.left,x.right);
  1772. ELSE
  1773. CompareString(BrneL,label,x.left,x.right);
  1774. END;
  1775. ELSE
  1776. Evaluate(x.left,left);
  1777. Evaluate(x.right,right);
  1778. IF leftType IS SyntaxTree.RangeType THEN
  1779. ASSERT(rightType IS SyntaxTree.RangeType);
  1780. IF reason THEN
  1781. skip := NewLabel();
  1782. BrneL(skip, left.op, right.op); (* first *)
  1783. BrneL(skip, left.tag, right.tag); (* last *)
  1784. BreqL(label, left.extra, right.extra); (* step *)
  1785. SetLabel(skip);
  1786. ELSE
  1787. BrneL(label, left.op, right.op); (* first *)
  1788. BrneL(label, left.tag, right.tag); (* last *)
  1789. BrneL(label, left.extra, right.extra); (* step *)
  1790. END;
  1791. ReleaseOperand(left); ReleaseOperand(right);
  1792. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1793. IF reason THEN
  1794. skip := NewLabel();
  1795. BrneL(skip, left.op, right.op); (* first *)
  1796. BreqL(label, left.tag, right.tag); (* last *)
  1797. SetLabel(skip);
  1798. ELSE
  1799. BrneL(label, left.op, right.op); (* first *)
  1800. BrneL(label, left.tag, right.tag); (* last *)
  1801. END;
  1802. ReleaseOperand(left); ReleaseOperand(right);
  1803. ELSE
  1804. IF reason THEN
  1805. BreqL(label,left.op,right.op);
  1806. ELSE
  1807. BrneL(label,left.op,right.op);
  1808. END;
  1809. ReleaseOperand(left); ReleaseOperand(right);
  1810. END;
  1811. END;
  1812. RETURN;
  1813. |Scanner.LessEqual:
  1814. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1815. IF reason THEN
  1816. CompareString(BrgeL,label,x.right,x.left);
  1817. ELSE
  1818. CompareString(BrltL,label,x.right,x.left);
  1819. END;
  1820. ELSE
  1821. Evaluate(x.left,left);
  1822. Evaluate(x.right,right);
  1823. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1824. Reuse1(temp,right.op);
  1825. Emit(And(position,temp,left.op,right.op));
  1826. ReleaseOperand(right);
  1827. IF reason THEN
  1828. BreqL(label,temp,left.op);
  1829. ELSE
  1830. BrneL(label,temp,left.op);
  1831. END;
  1832. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1833. ELSE
  1834. IF reason THEN
  1835. BrgeL(label,right.op,left.op);
  1836. ELSE
  1837. BrltL(label,right.op,left.op);
  1838. END;
  1839. ReleaseOperand(left); ReleaseOperand(right);
  1840. END;
  1841. END;
  1842. RETURN;
  1843. |Scanner.Less:
  1844. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1845. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1846. leftExpression.SetType(system.booleanType);
  1847. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1848. rightExpression.SetType(system.booleanType);
  1849. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1850. leftExpression.SetType(system.booleanType);
  1851. Condition(leftExpression,label,reason);
  1852. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1853. IF reason THEN
  1854. CompareString(BrltL,label,x.left,x.right);
  1855. ELSE
  1856. CompareString(BrgeL,label,x.left,x.right);
  1857. END;
  1858. ELSE
  1859. Evaluate(x.left,left);
  1860. Evaluate(x.right,right);
  1861. IF reason THEN
  1862. BrltL(label,left.op,right.op);
  1863. ELSE
  1864. BrgeL(label,left.op,right.op);
  1865. END;
  1866. ReleaseOperand(left); ReleaseOperand(right);
  1867. END;
  1868. RETURN;
  1869. |Scanner.Greater:
  1870. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1871. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1872. leftExpression.SetType(system.booleanType);
  1873. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1874. rightExpression.SetType(system.booleanType);
  1875. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1876. leftExpression.SetType(system.booleanType);
  1877. Condition(leftExpression,label,reason);
  1878. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1879. IF reason THEN
  1880. CompareString(BrltL,label,x.right,x.left);
  1881. ELSE
  1882. CompareString(BrgeL,label,x.right,x.left);
  1883. END;
  1884. ELSE
  1885. Evaluate(x.left,left);
  1886. Evaluate(x.right,right);
  1887. IF reason THEN
  1888. BrltL(label, right.op,left.op);
  1889. ELSE
  1890. BrgeL(label, right.op,left.op);
  1891. END;
  1892. ReleaseOperand(left); ReleaseOperand(right);
  1893. END;
  1894. RETURN;
  1895. |Scanner.GreaterEqual:
  1896. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1897. IF reason THEN
  1898. CompareString(BrgeL,label,x.left,x.right);
  1899. ELSE
  1900. CompareString(BrltL,label,x.left,x.right);
  1901. END;
  1902. ELSE
  1903. Evaluate(x.left,left);
  1904. Evaluate(x.right,right);
  1905. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1906. Reuse1(temp,left.op);
  1907. Emit(And(position,temp,left.op,right.op));
  1908. ReleaseOperand(left);
  1909. IF reason THEN
  1910. BreqL(label, temp, right.op);
  1911. ELSE
  1912. BrneL(label, temp, right.op);
  1913. END;
  1914. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1915. ELSE
  1916. IF reason THEN
  1917. BrgeL(label,left.op,right.op);
  1918. ELSE
  1919. BrltL(label, left.op,right.op);
  1920. END;
  1921. ReleaseOperand(left); ReleaseOperand(right);
  1922. END;
  1923. END;
  1924. RETURN;
  1925. |Scanner.Unequal:
  1926. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1927. IF reason THEN
  1928. CompareString(BrneL,label,x.left,x.right);
  1929. ELSE
  1930. CompareString(BreqL,label,x.left,x.right);
  1931. END
  1932. ELSE
  1933. Evaluate(x.left,left);
  1934. Evaluate(x.right,right);
  1935. IF leftType IS SyntaxTree.RangeType THEN
  1936. ASSERT(rightType IS SyntaxTree.RangeType);
  1937. IF ~reason THEN
  1938. skip := NewLabel();
  1939. BrneL(skip, left.op, right.op); (* first *)
  1940. BrneL(skip, left.tag, right.tag); (* last *)
  1941. BreqL(label, left.extra, right.extra); (* step *)
  1942. SetLabel(skip);
  1943. ELSE
  1944. BrneL(label, left.op, right.op); (* first *)
  1945. BrneL(label, left.tag, right.tag); (* last *)
  1946. BrneL(label, left.extra, right.extra); (* step *)
  1947. END;
  1948. ReleaseOperand(left); ReleaseOperand(right);
  1949. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1950. IF reason THEN
  1951. BrneL(label, left.op, right.op);
  1952. BrneL(label, left.tag, right.tag);
  1953. ELSE
  1954. skip := NewLabel();
  1955. BrneL(skip, left.op, right.op);
  1956. BreqL(label, left.tag, right.tag);
  1957. SetLabel(skip);
  1958. END;
  1959. ReleaseOperand(left); ReleaseOperand(right);
  1960. ELSE
  1961. IF reason THEN
  1962. BrneL(label,left.op,right.op);
  1963. ELSE
  1964. BreqL(label,left.op,right.op);
  1965. END;
  1966. ReleaseOperand(left); ReleaseOperand(right);
  1967. END;
  1968. END;
  1969. RETURN;
  1970. ELSE (* case *)
  1971. END;
  1972. |SyntaxTree.BooleanValue DO
  1973. IF reason = x.value THEN BrL(label) END;
  1974. RETURN;
  1975. ELSE (* with *)
  1976. END;
  1977. (* default case: evaluate and compare result *)
  1978. EvaluateX(x,left);
  1979. IF reason THEN
  1980. BrneL(label,left.op, false);
  1981. ELSE
  1982. BreqL(label,left.op, false);
  1983. END;
  1984. ReleaseOperand(left);
  1985. END Condition;
  1986. PROCEDURE EvaluateUnaryExpression(x: SyntaxTree.UnaryExpression; VAR result: Operand);
  1987. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1988. BEGIN
  1989. IF Trace THEN TraceEnter("EvaluateUnaryExpression") END;
  1990. dest := destination; destination := emptyOperand;
  1991. CASE x.operator OF
  1992. Scanner.Not:
  1993. EvaluateX(x.left, operand);
  1994. InitOperand(result,ModeValue);
  1995. Reuse1a(result.op,operand.op,dest);
  1996. Emit(Xor(position,result.op,operand.op,true));
  1997. ReleaseOperand(operand);
  1998. |Scanner.Minus:
  1999. EvaluateX(x.left, operand);
  2000. InitOperand(result,ModeValue);
  2001. Reuse1a(result.op,operand.op,dest);
  2002. type := x.left.type.resolved;
  2003. IF type IS SyntaxTree.SetType THEN
  2004. Emit(Not(position,result.op,operand.op));
  2005. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2006. Reuse1(result.tag,operand.tag);
  2007. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2008. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2009. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2010. Emit(Neg(position,result.op,operand.op));
  2011. ELSE HALT(200)
  2012. END;
  2013. ReleaseOperand(operand);
  2014. |Scanner.Address:
  2015. Designate(x.left,result);
  2016. result.mode := ModeValue;
  2017. t0 := x.left.type.resolved;
  2018. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2019. ReleaseIntermediateOperand(result.op);
  2020. result.op := result.tag;
  2021. IntermediateCode.InitOperand(result.tag);
  2022. END;
  2023. Convert(result.op,IntermediateCode.GetType(system,x.type));
  2024. END;
  2025. destination := dest;
  2026. IF Trace THEN TraceExit("UnaryExpression") END;
  2027. END EvaluateUnaryExpression;
  2028. PROCEDURE EvaluateBinaryExpression(x: SyntaxTree.BinaryExpression; VAR result: Operand);
  2029. VAR left,right: Operand;zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2030. leftType,rightType: SyntaxTree.Type;
  2031. leftExpression,rightExpression : SyntaxTree.Expression;
  2032. componentType: IntermediateCode.Type;
  2033. exit: Label; dest: IntermediateCode.Operand;
  2034. size: LONGINT;
  2035. BEGIN
  2036. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2037. dest := destination; destination := emptyOperand;
  2038. leftType := x.left.type.resolved;
  2039. rightType := x.right.type.resolved;
  2040. CASE x.operator OF
  2041. Scanner.Or, Scanner.And, Scanner.Is:
  2042. result := ConditionValue(x);
  2043. |Scanner.Plus:
  2044. EvaluateX(x.left,left);
  2045. EvaluateX(x.right,right);
  2046. IF leftType IS SyntaxTree.SetType THEN
  2047. InitOperand(result,ModeValue);
  2048. Reuse2a(result.op,left.op,right.op,dest);
  2049. Emit(Or(position,result.op,left.op,right.op));
  2050. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2051. InitOperand(result,ModeValue);
  2052. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2053. Reuse2(result.tag,left.tag,right.tag);
  2054. Emit(Add(position,result.op,left.op,right.op));
  2055. Emit(Add(position,result.tag,left.tag,right.tag))
  2056. ELSE
  2057. InitOperand(result,ModeValue);
  2058. Reuse2a(result.op,left.op,right.op,dest);
  2059. Emit(Add(position,result.op,left.op,right.op));
  2060. END;
  2061. ReleaseOperand(left); ReleaseOperand(right);
  2062. |Scanner.Minus:
  2063. EvaluateX(x.left,left);
  2064. EvaluateX(x.right,right);
  2065. IF leftType IS SyntaxTree.SetType THEN
  2066. InitOperand(result,ModeValue);
  2067. Reuse1(result.op,right.op);
  2068. Emit(Not(position,result.op,right.op));
  2069. ReleaseOperand(right);
  2070. Emit(And(position,result.op,result.op,left.op));
  2071. ReleaseOperand(left);
  2072. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2073. InitOperand(result,ModeValue);
  2074. Reuse2a(result.op,left.op,right.op,dest);
  2075. Reuse2(result.tag,left.tag,right.tag);
  2076. Emit(Sub(position,result.op,left.op,right.op));
  2077. Emit(Sub(position,result.tag,left.tag,right.tag));
  2078. ReleaseOperand(left); ReleaseOperand(right)
  2079. ELSE
  2080. InitOperand(result,ModeValue);
  2081. Reuse2a(result.op,left.op,right.op,dest);
  2082. Emit(Sub(position,result.op,left.op,right.op));
  2083. ReleaseOperand(left); ReleaseOperand(right);
  2084. END;
  2085. |Scanner.Times:
  2086. EvaluateX(x.left, left);
  2087. EvaluateX(x.right, right);
  2088. IF leftType IS SyntaxTree.SetType THEN
  2089. InitOperand(result,ModeValue);
  2090. Reuse2a(result.op,left.op,right.op,dest);
  2091. Emit(And(position,result.op,left.op,right.op));
  2092. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2093. InitOperand(result, ModeValue);
  2094. componentType := left.op.type;
  2095. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2096. Emit(Mul(position,result.op, left.op, right.op));
  2097. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2098. Emit(Mul(position,tempReg, left.tag, right.tag));
  2099. Emit(Sub(position,result.op, result.op, tempReg));
  2100. Reuse2(result.tag, left.tag, right.op);
  2101. Emit(Mul(position,result.tag, left.tag, right.op));
  2102. Emit(Mul(position,tempReg, left.op, right.tag));
  2103. Emit(Add(position,result.tag, result.tag, tempReg));
  2104. ReleaseIntermediateOperand(tempReg)
  2105. ELSE
  2106. InitOperand(result,ModeValue);
  2107. Reuse2a(result.op,left.op,right.op,dest);
  2108. Emit(Mul(position,result.op,left.op,right.op));
  2109. END;
  2110. ReleaseOperand(left); ReleaseOperand(right);
  2111. |Scanner.Div:
  2112. EvaluateX(x.left, left);
  2113. EvaluateX(x.right, right);
  2114. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2115. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2116. IF ~isUnchecked THEN
  2117. exit := NewLabel();
  2118. BrltL(exit,zero,right.op);
  2119. EmitTrap(position,NegativeDivisorTrap);
  2120. SetLabel(exit);
  2121. END;
  2122. END;
  2123. InitOperand(result,ModeValue);
  2124. Reuse2a(result.op,left.op,right.op,dest);
  2125. Emit(Div(position,result.op,left.op,right.op));
  2126. ReleaseOperand(left); ReleaseOperand(right);
  2127. |Scanner.Mod:
  2128. EvaluateX(x.left, left);
  2129. EvaluateX(x.right, right);
  2130. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2131. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2132. IF ~isUnchecked THEN
  2133. exit := NewLabel();
  2134. BrltL(exit,zero,right.op);
  2135. EmitTrap(position,NegativeDivisorTrap);
  2136. SetLabel(exit);
  2137. END;
  2138. END;
  2139. InitOperand(result,ModeValue);
  2140. Reuse2a(result.op,left.op,right.op,dest);
  2141. Emit(Mod(position,result.op,left.op,right.op));
  2142. ReleaseOperand(left); ReleaseOperand(right);
  2143. |Scanner.Slash:
  2144. EvaluateX(x.left, left);
  2145. EvaluateX(x.right, right);
  2146. IF leftType IS SyntaxTree.SetType THEN
  2147. InitOperand(result,ModeValue);
  2148. Reuse2a(result.op,left.op,right.op,dest);
  2149. Emit(Xor(position,result.op,left.op,right.op));
  2150. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2151. InitOperand(result,ModeValue);
  2152. componentType := left.op.type;
  2153. (*
  2154. divisor = right.op * right.op + right.tag * right.tag
  2155. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2156. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2157. *)
  2158. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2159. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2160. Emit(Mul(position,tempReg, right.op, right.op));
  2161. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2162. Emit(Add(position,tempReg, tempReg, tempReg2));
  2163. result.op := tempReg2;
  2164. Emit(Mul(position,result.op, left.op, right.op));
  2165. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2166. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2167. Emit(Add(position,result.op, result.op, tempReg2));
  2168. Emit(Div(position,result.op, result.op, tempReg));
  2169. Reuse2(result.tag, left.tag, right.op);
  2170. Emit(Mul(position,result.tag, left.tag, right.op));
  2171. Emit(Mul(position,tempReg2, left.op, right.tag));
  2172. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2173. Emit(Div(position,result.tag, result.tag, tempReg));
  2174. ReleaseIntermediateOperand(tempReg);
  2175. ReleaseIntermediateOperand(tempReg2)
  2176. ELSE
  2177. InitOperand(result,ModeValue);
  2178. Reuse2a(result.op,left.op,right.op,dest);
  2179. Emit(Div(position,result.op,left.op,right.op));
  2180. END;
  2181. ReleaseOperand(left); ReleaseOperand(right);
  2182. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  2183. result := ConditionValue(x);
  2184. |Scanner.In:
  2185. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  2186. EvaluateX(x.left, left);
  2187. EvaluateX(x.right, right);
  2188. Convert(left.op,setType);
  2189. Convert(right.op,setType);
  2190. result.mode := ModeValue;
  2191. result.tag := nil; (* may be left over from calls to evaluate *)
  2192. ReuseCopy(result.op,right.op);
  2193. Emit(Shr(position,result.op,result.op,left.op));
  2194. ReleaseOperand(right); ReleaseOperand(left);
  2195. IntermediateCode.InitImmediate(one,setType,1);
  2196. Emit(And(position,result.op,result.op,one));
  2197. Convert(result.op,bool);
  2198. ELSE
  2199. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  2200. IF x.operator = Scanner.Questionmarks THEN
  2201. leftExpression := x.left;
  2202. rightExpression := x.right;
  2203. ELSE
  2204. leftExpression := x.right;
  2205. rightExpression := x.left;
  2206. END;
  2207. EvaluateX(leftExpression, left);
  2208. Emit(Push(position,left.op));
  2209. ReleaseOperand(left);
  2210. Designate(rightExpression, right);
  2211. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2212. IF ~backend.cellsAreObjects THEN
  2213. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  2214. END;
  2215. Emit(Push(position,right.op));
  2216. ReleaseOperand(right);
  2217. IF backend.cellsAreObjects THEN
  2218. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  2219. ELSE
  2220. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  2221. END;
  2222. InitOperand(result, ModeValue);
  2223. result.op := NewRegisterOperand(bool);
  2224. Emit(Result(position,result.op));
  2225. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  2226. leftExpression := x.left;
  2227. rightExpression := x.right;
  2228. EvaluateX(leftExpression, left);
  2229. Emit(Push(position,left.op));
  2230. ReleaseOperand(left);
  2231. EvaluateX(rightExpression, right);
  2232. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2233. IF ~backend.cellsAreObjects THEN
  2234. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  2235. END;
  2236. Emit(Push(position,right.op));
  2237. ReleaseOperand(right);
  2238. IF backend.cellsAreObjects THEN
  2239. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  2240. ELSE
  2241. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  2242. END;
  2243. InitOperand(result, ModeValue);
  2244. result.op := NewRegisterOperand(bool);
  2245. Emit(Result(position,result.op));
  2246. ELSE
  2247. HALT(100);
  2248. END;
  2249. END;
  2250. destination := dest;
  2251. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  2252. END EvaluateBinaryExpression;
  2253. PROCEDURE EvaluateSet(x: SyntaxTree.Set; VAR result: Operand);
  2254. VAR
  2255. operand: Operand;
  2256. temp, one, noBits, dest: IntermediateCode.Operand;
  2257. expression: SyntaxTree.Expression;
  2258. i: LONGINT;
  2259. BEGIN
  2260. IF Trace THEN TraceEnter("VisitSet") END;
  2261. dest := destination;
  2262. destination := emptyOperand;
  2263. noBits := IntermediateCode.Immediate(setType, 0);
  2264. one := IntermediateCode.Immediate(setType, 1);
  2265. (* start off with the empty set *)
  2266. InitOperand(result, ModeValue);
  2267. IntermediateCode.InitRegister(result.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2268. Emit(Mov(position,result.op, noBits));
  2269. FOR i := 0 TO x.elements.Length() - 1 DO
  2270. expression := x.elements.GetExpression(i);
  2271. IF expression IS SyntaxTree.RangeExpression THEN
  2272. (* range of set elements *)
  2273. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2274. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2275. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2276. ReleaseIntermediateOperand(temp)
  2277. ELSE
  2278. (* singelton element *)
  2279. Evaluate(expression, operand);
  2280. Convert(operand.op, setType);
  2281. CheckSetElement(operand.op);
  2282. (* create subset containing single element *)
  2283. Reuse1(temp, operand.op);
  2284. Emit(Shl(position,temp, one, operand.op));
  2285. ReleaseOperand(operand);
  2286. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2287. ReleaseIntermediateOperand(temp);
  2288. END
  2289. END;
  2290. destination := dest;
  2291. IF Trace THEN TraceExit("VisitSet") END;
  2292. END EvaluateSet;
  2293. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  2294. VAR op: IntermediateCode.Operand; reg: LONGINT;
  2295. BEGIN
  2296. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  2297. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  2298. RETURN op
  2299. END NewRegisterOperand;
  2300. PROCEDURE UnuseRegister(register: LONGINT);
  2301. BEGIN
  2302. IF (register > 0) THEN
  2303. register := registerUsageCount.Map(register);
  2304. registerUsageCount.DecUse(register);
  2305. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2306. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2307. END;
  2308. IF registerUsageCount.Use(register)=0 THEN
  2309. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  2310. Warning(position, "register cannot be removed");
  2311. END;
  2312. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2313. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  2314. END;
  2315. ELSIF registerUsageCount.Use(register)<0 THEN
  2316. Warning(position, "register removed too often");
  2317. IF dump # NIL THEN
  2318. dump.String("register removed too often"); dump.Ln; dump.Update;
  2319. END;
  2320. END;
  2321. END;
  2322. END UnuseRegister;
  2323. PROCEDURE UseRegister(register: LONGINT);
  2324. BEGIN
  2325. IF (register > 0) THEN
  2326. register := registerUsageCount.Map(register);
  2327. registerUsageCount.IncUse(register);
  2328. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2329. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2330. END;
  2331. IF registerUsageCount.Use(register)=1 THEN
  2332. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  2333. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2334. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  2335. END;
  2336. END;
  2337. END;
  2338. END UseRegister;
  2339. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2340. BEGIN
  2341. UnuseRegister(op.register)
  2342. END ReleaseIntermediateOperand;
  2343. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2344. BEGIN
  2345. UseRegister(op.register)
  2346. END UseIntermediateOperand;
  2347. PROCEDURE ReleaseOperand(CONST op: Operand);
  2348. BEGIN
  2349. UnuseRegister(op.op.register);
  2350. UnuseRegister(op.tag.register);
  2351. UnuseRegister(op.extra.register);
  2352. END ReleaseOperand;
  2353. (* save registers marked in array "markedRegisters" to the stack
  2354. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  2355. *)
  2356. PROCEDURE SaveRegisters();
  2357. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  2358. BEGIN
  2359. entry := usedRegisters;
  2360. WHILE entry # NIL DO
  2361. type := registerUsageCount.used[entry.register].type;
  2362. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  2363. Emit(Push(position,op));
  2364. entry := entry.next;
  2365. END;
  2366. END SaveRegisters;
  2367. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  2368. BEGIN
  2369. saved := usedRegisters;
  2370. usedRegisters := NIL;
  2371. END ReleaseUsedRegisters;
  2372. (** remove parameter registers from used queue *)
  2373. PROCEDURE ReleaseParameterRegisters;
  2374. VAR entry,prev,next: RegisterEntry;
  2375. BEGIN
  2376. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  2377. WHILE entry # NIL DO
  2378. next := entry.next;
  2379. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  2380. registerUsageCount.DecUse(entry.register);
  2381. ASSERT(registerUsageCount.Use(entry.register)=0);
  2382. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2383. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  2384. END;
  2385. ELSIF prev = NIL THEN
  2386. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  2387. ELSE
  2388. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  2389. END;
  2390. entry := next;
  2391. END;
  2392. END ReleaseParameterRegisters;
  2393. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  2394. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  2395. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2396. BEGIN
  2397. entry := saved;
  2398. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2399. entry := prev;
  2400. WHILE entry # NIL DO
  2401. prev := entry.prev;
  2402. type := entry.type;
  2403. class := entry.registerClass;
  2404. IntermediateCode.InitRegister(op,type,class,entry.register);
  2405. Emit(Pop(position,op));
  2406. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2407. entry := prev;
  2408. END;
  2409. END RestoreRegisters;
  2410. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2411. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2412. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2413. BEGIN
  2414. entry := saved;
  2415. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2416. entry := prev;
  2417. WHILE entry # NIL DO
  2418. prev := entry.prev;
  2419. type := entry.type;
  2420. class := entry.registerClass;
  2421. IntermediateCode.InitRegister(op,type,class,entry.register);
  2422. Emit(Mov(position,op,op));
  2423. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2424. entry := prev;
  2425. END;
  2426. END RestoreRegisterUse;
  2427. PROCEDURE CheckRegistersFree;
  2428. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2429. BEGIN
  2430. IF usedRegisters # NIL THEN
  2431. r := usedRegisters;
  2432. WHILE r # NIL DO
  2433. warning := "register ";
  2434. Strings.AppendInt(warning, r.register);
  2435. Strings.Append(warning, " not released.");
  2436. Warning(position,warning);
  2437. r := r .next;
  2438. END;
  2439. END;
  2440. FOR i := 0 TO registerUsageCount.count-1 DO
  2441. IF registerUsageCount.used[i].count < 0 THEN
  2442. warning := "register ";
  2443. Strings.AppendInt(warning, i);
  2444. Strings.Append(warning, " unused too often.");
  2445. Warning(position,warning);
  2446. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2447. warning := "register ";
  2448. Strings.AppendInt(warning, i);
  2449. Strings.Append(warning, " not unused often enough.");
  2450. Warning(position,warning);
  2451. END;
  2452. END;
  2453. END CheckRegistersFree;
  2454. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2455. Otherwise allocate a new register.
  2456. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2457. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2458. BEGIN
  2459. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2460. UseIntermediateOperand(result);
  2461. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2462. UseIntermediateOperand(result);
  2463. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2464. END;
  2465. END Reuse2;
  2466. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2467. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2468. If not then allocate a new register.
  2469. Does NOT necessarily keep the content of src1 or src2 in result!
  2470. *)
  2471. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2472. BEGIN
  2473. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2474. UseIntermediateOperand(result);
  2475. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2476. UseIntermediateOperand(result);
  2477. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2478. result := alternative; alternative := emptyOperand;
  2479. UseIntermediateOperand(result);
  2480. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2481. END;
  2482. END Reuse2a;
  2483. (* like reuse2 but only one source *)
  2484. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2485. BEGIN
  2486. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2487. UseIntermediateOperand(result);
  2488. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2489. END;
  2490. END Reuse1;
  2491. (* like reuse2a but only one source *)
  2492. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2493. BEGIN
  2494. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2495. UseIntermediateOperand(result);
  2496. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2497. UseIntermediateOperand(result);
  2498. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2499. END;
  2500. END Reuse1a;
  2501. (* like reuse1 but guarantees that content of src1 is in result *)
  2502. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2503. BEGIN
  2504. IF ReusableRegister(src1) THEN
  2505. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2506. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2507. UseIntermediateOperand(result);
  2508. ELSE
  2509. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2510. Emit(Mov(position,result,src1));
  2511. END
  2512. END ReuseCopy;
  2513. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2514. BEGIN
  2515. IF ReusableRegister(src) THEN
  2516. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2517. ELSE
  2518. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2519. Emit(Mov(position,result,src));
  2520. ReleaseIntermediateOperand(src);
  2521. END
  2522. END TransferToRegister;
  2523. (** labels and branches **)
  2524. PROCEDURE NewLabel(): Label;
  2525. VAR label: Label;
  2526. BEGIN
  2527. NEW(label,section); RETURN label;
  2528. END NewLabel;
  2529. (* EXPERIMENTAL *)
  2530. PROCEDURE EndBasicBlock;
  2531. VAR i: LONGINT;
  2532. BEGIN
  2533. i := 0;
  2534. WHILE (availableSymbols[i].symbol # NIL) DO
  2535. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2536. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2537. END;
  2538. availableSymbols[i].symbol := NIL;
  2539. INC(i);
  2540. END;
  2541. END EndBasicBlock;
  2542. (* EXPERIMENTAL *)
  2543. PROCEDURE BeginBasicBlock;
  2544. BEGIN
  2545. ASSERT(availableSymbols[0].symbol = NIL);
  2546. END BeginBasicBlock;
  2547. PROCEDURE SetLabel(label: Label);
  2548. BEGIN
  2549. (* EXPERIMENTAL *)
  2550. EndBasicBlock;
  2551. BeginBasicBlock;
  2552. label.Resolve(section.pc);
  2553. END SetLabel;
  2554. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2555. BEGIN
  2556. ASSERT(label # NIL);
  2557. IF label.pc < 0 THEN (* label not yet set *)
  2558. label.AddFixup(section.pc);
  2559. END;
  2560. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2561. END LabelOperand;
  2562. PROCEDURE BrL(label: Label);
  2563. BEGIN
  2564. (* EXPERIMENTAL *)
  2565. EndBasicBlock;
  2566. Emit(Br(position,LabelOperand(label)));
  2567. END BrL;
  2568. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2569. BEGIN
  2570. Emit(Brge(position,LabelOperand(label),left,right));
  2571. END BrgeL;
  2572. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2573. BEGIN
  2574. Emit(Brlt(position,LabelOperand(label),left,right));
  2575. END BrltL;
  2576. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2577. BEGIN
  2578. Emit(Breq(position,LabelOperand(label),left,right));
  2579. END BreqL;
  2580. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2581. BEGIN
  2582. Emit(Brne(position,LabelOperand(label),left,right));
  2583. END BrneL;
  2584. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2585. VAR new: IntermediateCode.Operand;
  2586. BEGIN
  2587. IF Trace THEN TraceEnter("Convert") END;
  2588. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2589. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2590. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2591. & (operand.offset = 0)
  2592. THEN
  2593. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2594. Emit(Conv(position,new,operand));
  2595. ELSE
  2596. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2597. Emit(Conv(position,new,operand));
  2598. ReleaseIntermediateOperand(operand);
  2599. END;
  2600. operand := new;
  2601. 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
  2602. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2603. ELSE
  2604. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2605. Emit(Conv(position,new,operand));
  2606. ReleaseIntermediateOperand(operand);
  2607. operand := new;
  2608. END;
  2609. IF Trace THEN TraceExit("Convert") END;
  2610. END Convert;
  2611. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2612. VAR exit: Label;
  2613. BEGIN
  2614. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2615. exit := NewLabel();
  2616. br(exit,left,right);
  2617. EmitTrap(position,trapNo);
  2618. SetLabel(exit);
  2619. END TrapC;
  2620. (** expressions *)
  2621. (** emit necessary runtime check for set elements **)
  2622. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2623. VAR max: IntermediateCode.Operand;
  2624. BEGIN
  2625. IF isUnchecked THEN RETURN END;
  2626. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2627. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2628. TrapC(BrgeL, max, o, SetElementTrap);
  2629. END;
  2630. END CheckSetElement;
  2631. (** the set that a range represents **)
  2632. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2633. VAR
  2634. operand: Operand;
  2635. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2636. BEGIN
  2637. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2638. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2639. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2640. one := IntermediateCode.Immediate(setType, 1);
  2641. Evaluate(x, operand);
  2642. Convert(operand.op, setType);
  2643. Convert(operand.tag, setType);
  2644. CheckSetElement(operand.op);
  2645. CheckSetElement(operand.tag);
  2646. (* create mask for lower bound
  2647. i.e. shift 11111111 to the left by the value of the lower bound
  2648. *)
  2649. Reuse1(temp, operand.op);
  2650. Emit(Shl(position,temp, allBits, operand.op));
  2651. ReleaseIntermediateOperand(operand.op);
  2652. operand.op := temp;
  2653. (* create mask for upper bound
  2654. i.e. shift 11111111 to the right by the difference between the
  2655. upper bound and the maximum number of set elements
  2656. *)
  2657. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2658. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2659. Reuse1(temp, operand.tag);
  2660. ELSE
  2661. Reuse1(temp, operand.tag);
  2662. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2663. Emit(Sub(position,temp, size, operand.tag));
  2664. END;
  2665. Emit(Shr(position,temp, allBits, operand.tag));
  2666. ReleaseIntermediateOperand(operand.tag);
  2667. operand.tag := temp;
  2668. Reuse2(resultingSet, operand.op, operand.tag);
  2669. (* intersect the two masks *)
  2670. Emit(And(position,resultingSet, operand.op, operand.tag));
  2671. ReleaseOperand(operand);
  2672. RETURN resultingSet
  2673. END SetFromRange;
  2674. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2675. VAR
  2676. res, operand: Operand;
  2677. temp, one, noBits, dest: IntermediateCode.Operand;
  2678. expression: SyntaxTree.Expression;
  2679. i: LONGINT;
  2680. BEGIN
  2681. IF Trace THEN TraceEnter("VisitSet") END;
  2682. dest := destination;
  2683. destination := emptyOperand;
  2684. noBits := IntermediateCode.Immediate(setType, 0);
  2685. one := IntermediateCode.Immediate(setType, 1);
  2686. (* start off with the empty set *)
  2687. InitOperand(res, ModeValue);
  2688. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2689. Emit(Mov(position,res.op, noBits));
  2690. FOR i := 0 TO x.elements.Length() - 1 DO
  2691. expression := x.elements.GetExpression(i);
  2692. IF expression IS SyntaxTree.RangeExpression THEN
  2693. (* range of set elements *)
  2694. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2695. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2696. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2697. ReleaseIntermediateOperand(temp)
  2698. ELSE
  2699. (* singelton element *)
  2700. Evaluate(expression, operand);
  2701. Convert(operand.op, setType);
  2702. CheckSetElement(operand.op);
  2703. (* create subset containing single element *)
  2704. Reuse1(temp, operand.op);
  2705. Emit(Shl(position,temp, one, operand.op));
  2706. ReleaseOperand(operand);
  2707. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2708. ReleaseIntermediateOperand(temp);
  2709. END
  2710. END;
  2711. result := res;
  2712. destination := dest;
  2713. IF Trace THEN TraceExit("VisitSet") END;
  2714. END VisitSet;
  2715. (* math arrays of the form [a,b,c]
  2716. x is a static array and thus does not provide any pointers
  2717. *)
  2718. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2719. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2720. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2721. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2722. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2723. element: SyntaxTree.IntegerValue;
  2724. BEGIN
  2725. numberElements := x.elements.Length();
  2726. expression := index.parameters.GetExpression(dim);
  2727. element := expression(SyntaxTree.IntegerValue);
  2728. FOR i := 0 TO numberElements-1 DO
  2729. expression := x.elements.GetExpression(i);
  2730. element.SetValue(i);
  2731. IF expression IS SyntaxTree.MathArrayExpression THEN
  2732. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2733. ELSE
  2734. Assign(index,expression);
  2735. END;
  2736. END;
  2737. END RecursiveAssignment;
  2738. PROCEDURE Dimension(): LONGINT;
  2739. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2740. BEGIN
  2741. dim := 0;
  2742. expression := x;
  2743. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2744. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2745. INC(dim);
  2746. END;
  2747. RETURN dim;
  2748. END Dimension;
  2749. BEGIN
  2750. (*static math array not providing pointers anyway *)
  2751. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2752. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2753. designator.SetType(variable.type);
  2754. dim := Dimension();
  2755. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2756. FOR i := 0 TO dim-1 DO
  2757. element := SyntaxTree.NewIntegerValue(x.position,0);
  2758. element.SetType(system.longintType);
  2759. index.parameters.AddExpression(element);
  2760. END;
  2761. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2762. RecursiveAssignment(x,0);
  2763. Expression(designator);
  2764. END VisitMathArrayExpression;
  2765. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2766. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2767. BEGIN
  2768. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2769. dest := destination; destination := emptyOperand;
  2770. IF x.operator = Scanner.Not THEN
  2771. Evaluate(x.left,operand);
  2772. InitOperand(result,ModeValue);
  2773. Reuse1a(result.op,operand.op,dest);
  2774. Emit(Xor(position,result.op,operand.op,true));
  2775. ReleaseOperand(operand);
  2776. ELSIF x.operator = Scanner.Minus THEN
  2777. Evaluate(x.left,operand);
  2778. InitOperand(result,ModeValue);
  2779. Reuse1a(result.op,operand.op,dest);
  2780. type := x.left.type.resolved;
  2781. IF type IS SyntaxTree.SetType THEN
  2782. Emit(Not(position,result.op,operand.op));
  2783. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2784. Reuse1(result.tag,operand.tag);
  2785. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2786. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2787. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2788. Emit(Neg(position,result.op,operand.op));
  2789. ELSE HALT(200)
  2790. END;
  2791. ReleaseOperand(operand);
  2792. ELSIF x.operator = Scanner.Address THEN
  2793. Designate(x.left,operand);
  2794. operand.mode := ModeValue;
  2795. t0 := x.left.type.resolved;
  2796. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2797. ReleaseIntermediateOperand(operand.op);
  2798. operand.op := operand.tag;
  2799. IntermediateCode.InitOperand(operand.tag);
  2800. END;
  2801. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2802. result := operand;
  2803. ELSE HALT(100)
  2804. END;
  2805. destination := dest;
  2806. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2807. END VisitUnaryExpression;
  2808. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2809. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2810. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2811. BEGIN
  2812. type := type.resolved;
  2813. originalType := type;
  2814. IF type IS SyntaxTree.PointerType THEN
  2815. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2816. END;
  2817. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2818. BrL(label);
  2819. ELSE
  2820. ASSERT(type IS SyntaxTree.RecordType);
  2821. (*
  2822. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2823. *)
  2824. IF withPart THEN
  2825. left := tag;
  2826. ELSE
  2827. ReuseCopy(left,tag);
  2828. END;
  2829. right := TypeDescriptorAdr(type);
  2830. IF backend.cooperative THEN
  2831. repeatL := NewLabel();
  2832. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2833. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2834. END;
  2835. SetLabel(repeatL);
  2836. IF reason THEN
  2837. BreqL(label,left,right);
  2838. ELSE
  2839. skip := NewLabel();
  2840. BreqL(skip,left,right);
  2841. END;
  2842. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2843. BrneL(repeatL,left,nil);
  2844. IF ~reason THEN
  2845. BrL(label);
  2846. SetLabel(skip);
  2847. END;
  2848. ELSIF meta.simple THEN
  2849. level := type(SyntaxTree.RecordType).Level();
  2850. (* get type desc tag of level relative to base tag *)
  2851. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2852. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2853. IntermediateCode.MakeMemory(left,addressType);
  2854. IF reason THEN
  2855. BreqL(label,left,right);
  2856. ELSE
  2857. BrneL(label,left,right);
  2858. END;
  2859. ELSE
  2860. level := type(SyntaxTree.RecordType).Level();
  2861. (* get type desc tag of level relative to base tag *)
  2862. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2863. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2864. IntermediateCode.MakeMemory(left,addressType);
  2865. IF reason THEN
  2866. BreqL(label,left,right);
  2867. ELSE
  2868. BrneL(label,left,right);
  2869. END;
  2870. END;
  2871. IF ~withPart THEN
  2872. ReleaseIntermediateOperand(left);
  2873. END;
  2874. ReleaseIntermediateOperand(right);
  2875. END;
  2876. END TypeTest;
  2877. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2878. BEGIN
  2879. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2880. IF dump # NIL THEN
  2881. dump.String(s); dump.Ln;
  2882. END;
  2883. END Error;
  2884. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2885. BEGIN
  2886. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2887. IF dump # NIL THEN
  2888. dump.String(s); dump.Ln; dump.Update;
  2889. END;
  2890. END Warning;
  2891. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2892. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2893. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2894. operand:Operand;
  2895. BEGIN
  2896. previousSection := section;
  2897. Global.GetModuleName(mod,name);
  2898. Strings.Append(name,".@Trace");
  2899. Basic.ToSegmentedName(name, pooledName);
  2900. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2901. IF dump # NIL THEN dump := section.comments END;
  2902. IF backend.hasLinkRegister THEN
  2903. Emit(Push(Basic.invalidPosition, lr));
  2904. END;
  2905. variable := mod.moduleScope.firstVariable;
  2906. WHILE variable # NIL DO
  2907. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2908. Symbol(variable, operand);
  2909. register := operand.op;
  2910. CallTraceMethod(register, variable.type);
  2911. ReleaseIntermediateOperand(register);
  2912. END;
  2913. variable := variable.nextVariable;
  2914. END;
  2915. IF backend.hasLinkRegister THEN
  2916. Emit(Pop(Basic.invalidPosition, lr));
  2917. END;
  2918. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2919. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2920. Emit(Br(position,op));
  2921. INC(statCoopTraceModule, section.pc);
  2922. section := previousSection;
  2923. IF dump # NIL THEN dump := section.comments END;
  2924. END CreateTraceModuleMethod;
  2925. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2926. BEGIN
  2927. Emit (Push(position, dst));
  2928. Emit (Push(position, src));
  2929. CallThis(position,"GarbageCollector","Assign", 2);
  2930. END CallAssignPointer;
  2931. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2932. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2933. BEGIN
  2934. IF SemanticChecker.IsPointerType (type) THEN
  2935. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2936. ELSIF type.IsRecordType() THEN
  2937. Emit (Push(position,dst));
  2938. Emit (Push(position,src));
  2939. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2940. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2941. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2942. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2943. ELSIF IsStaticArray(type) THEN
  2944. size := StaticArrayNumElements(type);
  2945. base := StaticArrayBaseType(type);
  2946. IF base.IsRecordType() THEN
  2947. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2948. Emit (Push(position, dst));
  2949. Emit (Push(position, src));
  2950. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2951. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2952. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2953. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2954. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2955. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2956. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2957. Emit (Push(position, dst));
  2958. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2959. Emit (Push(position, src));
  2960. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2961. ELSE
  2962. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2963. Emit (Push(position, dst));
  2964. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2965. Emit (Push(position, src));
  2966. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2967. ASSERT(StaticArrayBaseType(type).IsPointer());
  2968. END;
  2969. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2970. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2971. Emit (Push(position, dst));
  2972. Emit (Push(position, src));
  2973. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2974. ELSE HALT(100); (* missing ? *)
  2975. END;
  2976. END CallAssignMethod;
  2977. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2978. VAR name: Basic.SegmentedName;
  2979. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2980. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2981. context: Context;
  2982. BEGIN
  2983. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2984. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2985. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2986. GetRecordTypeName (recordType,name);
  2987. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2988. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2989. section.SetExported (TRUE);
  2990. IF dump # NIL THEN dump := section.comments END;
  2991. IF backend.hasLinkRegister THEN
  2992. Emit(Push(Basic.invalidPosition, lr));
  2993. END;
  2994. variable := recordType.recordScope.firstVariable;
  2995. WHILE variable # NIL DO
  2996. IF variable.NeedsTrace() THEN
  2997. dst := NewRegisterOperand (addressType);
  2998. src := NewRegisterOperand (addressType);
  2999. Emit (Mov(position, dst, parameter1));
  3000. Emit (Mov(position, src, parameter2));
  3001. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3002. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  3003. CallAssignMethod(dst, src, variable.type);
  3004. ReleaseIntermediateOperand(src);
  3005. ReleaseIntermediateOperand(dst);
  3006. END;
  3007. variable := variable.nextVariable;
  3008. END;
  3009. recordBase := recordType.GetBaseRecord();
  3010. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3011. IF backend.hasLinkRegister THEN
  3012. Emit(Pop(Basic.invalidPosition, lr));
  3013. END;
  3014. GetRecordTypeName (recordBase,name);
  3015. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3016. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3017. Emit(Br(position,op));
  3018. ELSE
  3019. Emit(Exit(position,0,0, 0));
  3020. END;
  3021. IF ~recordType.isObject THEN
  3022. GetRecordTypeName (recordType,name);
  3023. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3024. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3025. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3026. section.SetExported (TRUE);
  3027. NEW(registerUsageCount);
  3028. usedRegisters := NIL;
  3029. dst := NewRegisterOperand (addressType);
  3030. src := NewRegisterOperand (addressType);
  3031. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3032. Emit(Mov(position, dst, parameter1));
  3033. Emit(Mov(position, src, parameter2));
  3034. label := NewLabel();
  3035. SetLabel(label);
  3036. Emit(Push(position, dst));
  3037. Emit(Push(position, src));
  3038. GetRecordTypeName (recordType,name);
  3039. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3040. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3041. Emit(Call(position, op, 0));
  3042. Emit(Pop(position, src));
  3043. Emit(Pop(position, dst));
  3044. Emit(Add(position, dst, dst, ofs));
  3045. Emit(Add(position, src, src, ofs));
  3046. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3047. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3048. Emit(Exit(position,0,0, 0));
  3049. END;
  3050. INC(statCoopAssignProcedure, section.pc);
  3051. ReturnToContext(context);
  3052. IF dump # NIL THEN dump := section.comments END;
  3053. END CreateAssignProcedure;
  3054. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  3055. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  3056. BEGIN
  3057. IF IsUnsafePointer (type) THEN
  3058. skip := NewLabel();
  3059. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  3060. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  3061. BreqL (skip, op, nil);
  3062. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  3063. SetLabel (skip);
  3064. ELSIF SemanticChecker.IsPointerType (type) THEN
  3065. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  3066. CallThis(position,"GarbageCollector","Mark", 1);
  3067. ELSIF type.IsRecordType() THEN
  3068. Emit (Push(position,register));
  3069. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3070. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3071. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3072. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3073. ELSIF IsStaticArray(type) THEN
  3074. size := StaticArrayNumElements(type);
  3075. base := StaticArrayBaseType(type);
  3076. IF base.IsRecordType() THEN
  3077. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3078. Emit (Push(position, register));
  3079. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  3080. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3081. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3082. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3083. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  3084. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3085. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3086. Emit (Push(position, register));
  3087. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  3088. ELSE
  3089. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3090. Emit (Push(position, register));
  3091. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  3092. ASSERT(base.IsPointer());
  3093. END;
  3094. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3095. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  3096. CallThis(position,"GarbageCollector","Mark", 1);
  3097. ELSE HALT(100); (* missing ? *)
  3098. END;
  3099. END CallTraceMethod;
  3100. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  3101. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  3102. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3103. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  3104. BEGIN
  3105. previousSection := section;
  3106. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3107. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3108. GetRecordTypeName (recordType,name);
  3109. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3110. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3111. section.SetExported (TRUE);
  3112. IF dump # NIL THEN dump := section.comments END;
  3113. IF backend.hasLinkRegister THEN
  3114. Emit(Push(Basic.invalidPosition, lr));
  3115. END;
  3116. variable := recordType.recordScope.firstVariable;
  3117. WHILE variable # NIL DO
  3118. IF variable.NeedsTrace() THEN
  3119. register := NewRegisterOperand (addressType);
  3120. Emit (Mov(position,register,parameter1));
  3121. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  3122. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3123. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3124. END;
  3125. CallTraceMethod(register, variable.type);
  3126. ReleaseIntermediateOperand(register);
  3127. END;
  3128. variable := variable.nextVariable;
  3129. END;
  3130. recordBase := recordType.GetBaseRecord();
  3131. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  3132. recordBase := recordBase.GetBaseRecord();
  3133. END;
  3134. IF recordBase # NIL THEN
  3135. IF backend.hasLinkRegister THEN
  3136. Emit(Pop(Basic.invalidPosition, lr));
  3137. END;
  3138. GetRecordTypeName (recordBase,name);
  3139. IF HasExplicitTraceMethod (recordBase) THEN
  3140. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  3141. ELSE
  3142. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3143. END;
  3144. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3145. Emit(Br(position,op));
  3146. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  3147. Emit(Exit(position,0,0,0));
  3148. ELSE
  3149. IF backend.hasLinkRegister THEN
  3150. Emit(Pop(Basic.invalidPosition, lr));
  3151. END;
  3152. IF recordType.isObject THEN
  3153. Basic.ToSegmentedName ("BaseTypes.Object",name);
  3154. ELSE
  3155. Basic.ToSegmentedName ("BaseTypes.Record",name);
  3156. END;
  3157. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3158. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3159. Emit(Br(position,op));
  3160. END;
  3161. IF ~recordType.isObject THEN
  3162. GetRecordTypeName (recordType,name);
  3163. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  3164. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3165. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3166. section.SetExported (TRUE);
  3167. NEW(registerUsageCount);
  3168. usedRegisters := NIL;
  3169. IF dump # NIL THEN dump := section.comments END;
  3170. register := NewRegisterOperand (addressType);
  3171. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  3172. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  3173. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3174. END;
  3175. Emit (Push(position,register));
  3176. GetRecordTypeName (recordType,name);
  3177. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3178. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3179. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3180. ReleaseIntermediateOperand(register);
  3181. Emit(Exit(position,0,0,0));
  3182. GetRecordTypeName (recordType,name);
  3183. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3184. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3185. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3186. section.SetExported (TRUE);
  3187. NEW(registerUsageCount);
  3188. usedRegisters := NIL;
  3189. register := NewRegisterOperand (addressType);
  3190. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3191. Emit(Mov(position, register, parameter1));
  3192. label := NewLabel();
  3193. SetLabel(label);
  3194. Emit(Push(position, register));
  3195. GetRecordTypeName (recordType,name);
  3196. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3197. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3198. Emit(Call(position, op, 0));
  3199. Emit(Pop(position, register));
  3200. Emit(Add(position, register, register, ofs));
  3201. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3202. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3203. Emit(Exit(position,0,0,0));
  3204. END;
  3205. INC(statCoopTraceMethod, section.pc);
  3206. ReturnToContext(context);
  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. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3221. section.SetExported (TRUE);
  3222. IF dump # NIL THEN dump := section.comments END;
  3223. IF backend.hasLinkRegister THEN
  3224. Emit(Push(Basic.invalidPosition, lr));
  3225. END;
  3226. variable := recordType.recordScope.firstVariable;
  3227. WHILE variable # NIL DO
  3228. IF variable.NeedsTrace() THEN
  3229. dst := NewRegisterOperand (addressType);
  3230. Emit (Mov(position, dst, parameter1));
  3231. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3232. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3233. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3234. END;
  3235. CallResetProcedure(dst, nil, variable.type);
  3236. ReleaseIntermediateOperand(dst);
  3237. END;
  3238. variable := variable.nextVariable;
  3239. END;
  3240. recordBase := recordType.GetBaseRecord();
  3241. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3242. IF backend.hasLinkRegister THEN
  3243. Emit(Pop(Basic.invalidPosition, lr));
  3244. END;
  3245. GetRecordTypeName (recordBase,name);
  3246. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3247. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3248. Emit(Br(position,op));
  3249. ELSE
  3250. Emit(Exit(position,0,0, 0));
  3251. END;
  3252. GetRecordTypeName (recordType,name);
  3253. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3254. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3255. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3256. section.SetExported (TRUE);
  3257. NEW(registerUsageCount);
  3258. usedRegisters := NIL;
  3259. dst := NewRegisterOperand (addressType);
  3260. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3261. Emit(Mov(position, dst, parameter1));
  3262. label := NewLabel();
  3263. SetLabel(label);
  3264. Emit(Push(position, dst));
  3265. GetRecordTypeName (recordType,name);
  3266. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3267. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3268. Emit(Call(position, op, 0));
  3269. Emit(Pop(position, dst));
  3270. Emit(Add(position, dst, dst, ofs));
  3271. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3272. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3273. Emit(Exit(position,0,0, 0));
  3274. INC(statCoopResetProcedure, section.pc);
  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 previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  3475. VAR op: IntermediateCode.Operand; context: Context;
  3476. BEGIN
  3477. previousSection := section;
  3478. GetCodeSectionNameForSymbol(procedure, name);
  3479. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3480. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3481. IF dump # NIL THEN dump := section.comments END;
  3482. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3483. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3484. Emit(Data(position,op));
  3485. Emit(Data(position,nil));
  3486. IF HasPointers (procedure.procedureScope) THEN
  3487. GetCodeSectionNameForSymbol(procedure, name);
  3488. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3489. ELSE
  3490. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3491. END;
  3492. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3493. Emit(Data(position,op));
  3494. ReturnToContext(context);
  3495. IF dump # NIL THEN dump := section.comments END;
  3496. END CreateProcedureDescriptor;
  3497. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3498. VAR import: SyntaxTree.Import;
  3499. s: Basic.MessageString;
  3500. selfName: SyntaxTree.IdentifierString;
  3501. BEGIN
  3502. moduleScope.ownerModule.GetName(selfName);
  3503. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3504. module := moduleScope.ownerModule
  3505. ELSE
  3506. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3507. IF import = NIL THEN
  3508. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3509. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3510. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3511. s := "Module ";
  3512. Strings.Append(s,moduleName);
  3513. Strings.Append(s," cannot be imported.");
  3514. IF force THEN
  3515. Error(position,s);
  3516. ELSIF canBeLoaded THEN
  3517. IF WarningDynamicLoading THEN
  3518. Strings.Append(s, "=> no dynamic linking.");
  3519. Warning(position, s);
  3520. END;
  3521. canBeLoaded := FALSE;
  3522. END;
  3523. RETURN FALSE
  3524. ELSE
  3525. SELF.module.imports.AddName(moduleName)
  3526. END;
  3527. ELSIF import.module = NIL THEN (* already tried *)
  3528. RETURN FALSE
  3529. END;
  3530. module := import.module;
  3531. END;
  3532. RETURN TRUE
  3533. END AddImport;
  3534. (* needed for old binary object file format*)
  3535. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3536. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  3537. BEGIN
  3538. IF AddImport(moduleName,module,TRUE) THEN
  3539. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3540. IF procedure = NIL THEN
  3541. s := "Instruction not supported on target, emulation procedure ";
  3542. Strings.Append(s,moduleName);
  3543. Strings.Append(s,".");
  3544. Strings.Append(s,procedureName);
  3545. Strings.Append(s," not present");
  3546. Error(position,s);
  3547. ELSE
  3548. StaticCallOperand(r,procedure);
  3549. ReleaseOperand(r);
  3550. fp := GetFingerprint(procedure);
  3551. END;
  3552. END;
  3553. END EnsureSymbol;
  3554. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3555. VAR trueL, exitL: Label; op: Operand;
  3556. BEGIN
  3557. InitOperand(op,ModeValue);
  3558. trueL := NewLabel();
  3559. exitL := NewLabel();
  3560. Condition(x,trueL,TRUE);
  3561. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3562. Emit(Mov(position,op.op,false));
  3563. BrL(exitL);
  3564. SetLabel(trueL);
  3565. Emit(MovReplace(position,op.op,true));
  3566. SetLabel(exitL);
  3567. RETURN op;
  3568. END ConditionValue;
  3569. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3570. VAR size: LONGINT;
  3571. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3572. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3573. BEGIN
  3574. ASSERT(type.form = SyntaxTree.Open);
  3575. baseType := type.arrayBase.resolved;
  3576. IF IsOpenArray(baseType) THEN
  3577. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3578. ELSE
  3579. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3580. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3581. END;
  3582. len := tag;
  3583. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3584. IntermediateCode.MakeMemory(len,addressType);
  3585. UseIntermediateOperand(len);
  3586. Reuse2(res,sizeOperand,len);
  3587. Emit(Mul(position,res,sizeOperand,len));
  3588. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3589. RETURN res
  3590. END GetArraySize;
  3591. BEGIN
  3592. type := type.resolved;
  3593. IF IsOpenArray(type) THEN
  3594. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3595. RETURN tag
  3596. ELSE
  3597. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3598. END;
  3599. ELSE
  3600. size := ToMemoryUnits(system,system.SizeOf(type));
  3601. RETURN IntermediateCode.Immediate(addressType,size)
  3602. END;
  3603. END GetDynamicSize;
  3604. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3605. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3606. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3607. BEGIN
  3608. ASSERT(type.form = SyntaxTree.Open);
  3609. baseType := type.arrayBase.resolved;
  3610. IF IsOpenArray(baseType) THEN
  3611. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3612. ELSE
  3613. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3614. END;
  3615. len := tag;
  3616. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3617. IntermediateCode.MakeMemory(len,addressType);
  3618. UseIntermediateOperand(len);
  3619. Reuse2(res,sizeOperand,len);
  3620. Emit(Mul(position,res,sizeOperand,len));
  3621. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3622. RETURN res
  3623. END GetLength;
  3624. BEGIN
  3625. type := type.resolved;
  3626. IF IsOpenArray(type) THEN
  3627. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3628. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3629. ELSIF type IS SyntaxTree.StringType THEN
  3630. RETURN tag;
  3631. ELSE
  3632. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3633. END;
  3634. END GetArrayLength;
  3635. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3636. VAR result: IntermediateCode.Operand;
  3637. BEGIN
  3638. IF backend.cooperative THEN
  3639. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3640. ELSE
  3641. MakeMemory(result, tag, addressType, 0);
  3642. END;
  3643. RETURN result
  3644. END GetSizeFromTag;
  3645. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3646. VAR parameter: SyntaxTree.Parameter;
  3647. BEGIN
  3648. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3649. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3650. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3651. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3652. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3653. END;
  3654. RETURN GetDynamicSize(e.type, tag);
  3655. END GetArrayOfBytesSize;
  3656. (*
  3657. to find imported symbol. not needed ?
  3658. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3659. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3660. BEGIN
  3661. IF AddImport(moduleName,importedModule,FALSE) THEN
  3662. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3663. RETURN symbol
  3664. ELSE
  3665. RETURN NIL
  3666. END
  3667. END SymbolByName;
  3668. *)
  3669. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3670. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3671. BEGIN
  3672. IF AddImport(moduleName,runtimeModule,force) THEN
  3673. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3674. IF procedure = NIL THEN
  3675. s := "Procedure ";
  3676. Strings.Append(s,moduleName);
  3677. Strings.Append(s,".");
  3678. Strings.Append(s,procedureName);
  3679. Strings.Append(s," not present");
  3680. Error(position,s);
  3681. RETURN FALSE
  3682. ELSE
  3683. RETURN TRUE
  3684. END;
  3685. ELSE RETURN FALSE
  3686. END;
  3687. END GetRuntimeProcedure;
  3688. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3689. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3690. s: Basic.MessageString;
  3691. BEGIN
  3692. Basic.InitSegmentedName(name);
  3693. name[0] := Basic.MakeString(moduleName);
  3694. name[1] := Basic.MakeString(typeName);
  3695. name[2] := -1;
  3696. IF AddImport(moduleName,importedModule, FALSE) THEN
  3697. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3698. IF symbol = NIL THEN
  3699. s := "type ";
  3700. Strings.Append(s,moduleName);
  3701. Strings.Append(s,".");
  3702. Strings.Append(s,typeName);
  3703. Strings.Append(s," not present");
  3704. Error(position,s);
  3705. END;
  3706. ELSE symbol := NIL;
  3707. END;
  3708. IF importedModule = moduleScope.ownerModule THEN
  3709. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3710. ELSE
  3711. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3712. END;
  3713. RETURN symbol
  3714. END GetTypeDescriptor;
  3715. (* 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. *)
  3716. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3717. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3718. pooledName: Basic.SegmentedName; size: LONGINT;
  3719. BEGIN
  3720. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3721. StaticCallOperand(result,procedure);
  3722. IF numberParameters < 0 THEN
  3723. size := ProcParametersSize(procedure);
  3724. ELSE
  3725. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3726. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3727. Error(position,"runtime call parameter count mismatch");
  3728. END;
  3729. END;
  3730. Emit(Call(position, result.op, size));
  3731. ReleaseOperand(result);
  3732. ELSE (* only static linking possible *)
  3733. ASSERT(numberParameters >= 0);
  3734. Basic.InitSegmentedName(pooledName);
  3735. pooledName[0] := Basic.MakeString(moduleName);
  3736. pooledName[1] := Basic.MakeString(procedureName);
  3737. pooledName[2] := -1;
  3738. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3739. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3740. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3741. END;
  3742. END CallThisChecked;
  3743. (* 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. *)
  3744. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3745. BEGIN
  3746. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3747. END CallThis;
  3748. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3749. VAR
  3750. left,right: Operand;
  3751. leftSize, rightSize: IntermediateCode.Operand;
  3752. saved: RegisterEntry;
  3753. reg: IntermediateCode.Operand;
  3754. procedureName: SyntaxTree.IdentifierString;
  3755. BEGIN
  3756. procedureName := "CompareString";
  3757. SaveRegisters();ReleaseUsedRegisters(saved);
  3758. Designate(leftExpression,left);
  3759. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3760. Emit(Push(position,leftSize));
  3761. ReleaseIntermediateOperand(leftSize);
  3762. Emit(Push(position,left.op));
  3763. ReleaseOperand(left);
  3764. Designate(rightExpression,right);
  3765. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3766. Emit(Push(position,rightSize));
  3767. ReleaseIntermediateOperand(rightSize);
  3768. Emit(Push(position,right.op));
  3769. ReleaseOperand(right);
  3770. CallThis(position,builtinsModuleName,procedureName, 4);
  3771. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3772. Emit(Result(position,reg));
  3773. RestoreRegisters(saved);
  3774. br(label,reg,IntermediateCode.Immediate(int8,0));
  3775. ReleaseIntermediateOperand(reg);
  3776. END CompareString;
  3777. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3778. VAR
  3779. left,right: Operand;
  3780. leftSize, rightSize: IntermediateCode.Operand;
  3781. saved: RegisterEntry;
  3782. procedureName: SyntaxTree.IdentifierString;
  3783. BEGIN
  3784. procedureName := "CopyString";
  3785. SaveRegisters();ReleaseUsedRegisters(saved);
  3786. Designate(leftExpression,left);
  3787. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3788. Emit(Push(position,leftSize));
  3789. ReleaseIntermediateOperand(leftSize);
  3790. Emit(Push(position,left.op));
  3791. ReleaseOperand(left);
  3792. Designate(rightExpression,right);
  3793. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3794. Emit(Push(position,rightSize));
  3795. ReleaseIntermediateOperand(rightSize);
  3796. Emit(Push(position,right.op));
  3797. ReleaseOperand(right);
  3798. CallThis(position,builtinsModuleName,procedureName,4);
  3799. RestoreRegisters(saved);
  3800. END CopyString;
  3801. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3802. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3803. leftType,rightType: SyntaxTree.Type;
  3804. leftExpression,rightExpression : SyntaxTree.Expression;
  3805. componentType: IntermediateCode.Type;
  3806. exit: Label; dest: IntermediateCode.Operand;
  3807. size: LONGINT;
  3808. BEGIN
  3809. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3810. dest := destination; destination := emptyOperand;
  3811. leftType := x.left.type.resolved;
  3812. rightType := x.right.type.resolved;
  3813. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3814. CASE x.operator OF
  3815. Scanner.Or, Scanner.And, Scanner.Is:
  3816. result := ConditionValue(x);
  3817. |Scanner.Plus:
  3818. Evaluate(x.left,left);
  3819. Evaluate(x.right,right);
  3820. IF leftType IS SyntaxTree.SetType THEN
  3821. InitOperand(result,ModeValue);
  3822. Reuse2a(result.op,left.op,right.op,dest);
  3823. Emit(Or(position,result.op,left.op,right.op));
  3824. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3825. InitOperand(result,ModeValue);
  3826. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3827. Reuse2(result.tag,left.tag,right.tag);
  3828. Emit(Add(position,result.op,left.op,right.op));
  3829. Emit(Add(position,result.tag,left.tag,right.tag))
  3830. ELSE
  3831. InitOperand(result,ModeValue);
  3832. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3833. AddInt(result.op, left.op, right.op) ;
  3834. ELSE
  3835. *)
  3836. Reuse2a(result.op,left.op,right.op,dest);
  3837. Emit(Add(position,result.op,left.op,right.op));
  3838. (*
  3839. END;
  3840. *)
  3841. END;
  3842. ReleaseOperand(left); ReleaseOperand(right);
  3843. |Scanner.Minus:
  3844. Evaluate(x.left,left);
  3845. Evaluate(x.right,right);
  3846. IF leftType IS SyntaxTree.SetType THEN
  3847. InitOperand(result,ModeValue);
  3848. Reuse1(result.op,right.op);
  3849. Emit(Not(position,result.op,right.op));
  3850. ReleaseOperand(right);
  3851. Emit(And(position,result.op,result.op,left.op));
  3852. ReleaseOperand(left);
  3853. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3854. InitOperand(result,ModeValue);
  3855. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3856. Reuse2(result.tag,left.tag,right.tag);
  3857. Emit(Sub(position,result.op,left.op,right.op));
  3858. Emit(Sub(position,result.tag,left.tag,right.tag));
  3859. ReleaseOperand(left); ReleaseOperand(right)
  3860. ELSE
  3861. InitOperand(result,ModeValue);
  3862. Reuse2a(result.op,left.op,right.op,dest);
  3863. Emit(Sub(position,result.op,left.op,right.op));
  3864. ReleaseOperand(left); ReleaseOperand(right);
  3865. END;
  3866. |Scanner.Times:
  3867. Evaluate(x.left,left);
  3868. Evaluate(x.right,right);
  3869. IF leftType IS SyntaxTree.SetType THEN
  3870. InitOperand(result,ModeValue);
  3871. Reuse2a(result.op,left.op,right.op,dest);
  3872. Emit(And(position,result.op,left.op,right.op));
  3873. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3874. InitOperand(result, ModeValue);
  3875. componentType := left.op.type;
  3876. (* TODO: review this *)
  3877. (*
  3878. result.op = left.op * right.op - left.tag * right.tag
  3879. result.tag = left.tag * right.op + left.op * right.tag
  3880. *)
  3881. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3882. Emit(Mul(position,result.op, left.op, right.op));
  3883. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3884. Emit(Mul(position,tempReg, left.tag, right.tag));
  3885. Emit(Sub(position,result.op, result.op, tempReg));
  3886. Reuse2(result.tag, left.tag, right.op);
  3887. Emit(Mul(position,result.tag, left.tag, right.op));
  3888. Emit(Mul(position,tempReg, left.op, right.tag));
  3889. Emit(Add(position,result.tag, result.tag, tempReg));
  3890. ReleaseIntermediateOperand(tempReg)
  3891. ELSE
  3892. InitOperand(result,ModeValue);
  3893. Reuse2a(result.op,left.op,right.op,dest);
  3894. Emit(Mul(position,result.op,left.op,right.op));
  3895. END;
  3896. ReleaseOperand(left); ReleaseOperand(right);
  3897. |Scanner.Div:
  3898. Evaluate(x.left,left);
  3899. Evaluate(x.right,right);
  3900. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3901. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3902. IF ~isUnchecked THEN
  3903. exit := NewLabel();
  3904. BrltL(exit,zero,right.op);
  3905. EmitTrap(position,NegativeDivisorTrap);
  3906. SetLabel(exit);
  3907. END;
  3908. END;
  3909. InitOperand(result,ModeValue);
  3910. Reuse2a(result.op,left.op,right.op,dest);
  3911. Emit(Div(position,result.op,left.op,right.op));
  3912. ReleaseOperand(left); ReleaseOperand(right);
  3913. |Scanner.Mod:
  3914. Evaluate(x.left,left);
  3915. Evaluate(x.right,right);
  3916. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3917. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3918. IF ~isUnchecked THEN
  3919. exit := NewLabel();
  3920. BrltL(exit,zero,right.op);
  3921. EmitTrap(position,NegativeDivisorTrap);
  3922. SetLabel(exit);
  3923. END;
  3924. END;
  3925. InitOperand(result,ModeValue);
  3926. Reuse2a(result.op,left.op,right.op,dest);
  3927. Emit(Mod(position,result.op,left.op,right.op));
  3928. ReleaseOperand(left); ReleaseOperand(right);
  3929. |Scanner.Slash:
  3930. Evaluate(x.left,left);
  3931. Evaluate(x.right,right);
  3932. IF leftType IS SyntaxTree.SetType THEN
  3933. InitOperand(result,ModeValue);
  3934. Reuse2a(result.op,left.op,right.op,dest);
  3935. Emit(Xor(position,result.op,left.op,right.op));
  3936. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3937. InitOperand(result,ModeValue);
  3938. componentType := left.op.type;
  3939. (* review this *)
  3940. (*
  3941. divisor = right.op * right.op + right.tag * right.tag
  3942. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3943. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3944. *)
  3945. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3946. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3947. Emit(Mul(position,tempReg, right.op, right.op));
  3948. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3949. Emit(Add(position,tempReg, tempReg, tempReg2));
  3950. result.op := tempReg2;
  3951. Emit(Mul(position,result.op, left.op, right.op));
  3952. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3953. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3954. Emit(Add(position,result.op, result.op, tempReg2));
  3955. Emit(Div(position,result.op, result.op, tempReg));
  3956. Reuse2(result.tag, left.tag, right.op);
  3957. Emit(Mul(position,result.tag, left.tag, right.op));
  3958. Emit(Mul(position,tempReg2, left.op, right.tag));
  3959. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3960. Emit(Div(position,result.tag, result.tag, tempReg));
  3961. ReleaseIntermediateOperand(tempReg);
  3962. ReleaseIntermediateOperand(tempReg2)
  3963. ELSE
  3964. InitOperand(result,ModeValue);
  3965. Reuse2a(result.op,left.op,right.op,dest);
  3966. Emit(Div(position,result.op,left.op,right.op));
  3967. END;
  3968. ReleaseOperand(left); ReleaseOperand(right);
  3969. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3970. result := ConditionValue(x);
  3971. |Scanner.In:
  3972. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3973. Evaluate(x.left,left);
  3974. Evaluate(x.right,right);
  3975. Convert(left.op,setType);
  3976. Convert(right.op,setType);
  3977. ReuseCopy(temp.op,right.op);
  3978. Emit(Shr(position,temp.op,temp.op,left.op));
  3979. ReleaseOperand(right); ReleaseOperand(left);
  3980. IntermediateCode.InitImmediate(one,setType,1);
  3981. Emit(And(position,temp.op,temp.op,one));
  3982. Convert(temp.op,bool);
  3983. result.mode := ModeValue;
  3984. result.op := temp.op;
  3985. result.tag := nil; (* may be left over from calls to evaluate *)
  3986. ELSE
  3987. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3988. IF x.operator = Scanner.Questionmarks THEN
  3989. leftExpression := x.left;
  3990. rightExpression := x.right;
  3991. ELSE
  3992. leftExpression := x.right;
  3993. rightExpression := x.left;
  3994. END;
  3995. Evaluate(leftExpression, left);
  3996. Emit(Push(position,left.op));
  3997. ReleaseOperand(left);
  3998. Designate(rightExpression, right);
  3999. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4000. IF ~backend.cellsAreObjects THEN
  4001. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  4002. END;
  4003. Emit(Push(position,right.op));
  4004. ReleaseOperand(right);
  4005. IF backend.cellsAreObjects THEN
  4006. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  4007. ELSE
  4008. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  4009. END;
  4010. InitOperand(result, ModeValue);
  4011. result.op := NewRegisterOperand(bool);
  4012. Emit(Result(position,result.op));
  4013. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  4014. leftExpression := x.left;
  4015. rightExpression := x.right;
  4016. Evaluate(leftExpression, left);
  4017. Emit(Push(position,left.op));
  4018. ReleaseOperand(left);
  4019. Evaluate(rightExpression, right);
  4020. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4021. IF ~backend.cellsAreObjects THEN
  4022. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  4023. END;
  4024. Emit(Push(position,right.op));
  4025. ReleaseOperand(right);
  4026. IF backend.cellsAreObjects THEN
  4027. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  4028. ELSE
  4029. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  4030. END;
  4031. InitOperand(result, ModeValue);
  4032. result.op := NewRegisterOperand(bool);
  4033. Emit(Result(position,result.op));
  4034. ELSE
  4035. HALT(100);
  4036. END;
  4037. END;
  4038. destination := dest;
  4039. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  4040. END VisitBinaryExpression;
  4041. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  4042. VAR localResult, operand: Operand;
  4043. BEGIN
  4044. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  4045. InitOperand(localResult, ModeValue);
  4046. ASSERT(x.first # NIL);
  4047. Evaluate(x.first, operand);
  4048. localResult.op := operand.op;
  4049. ReleaseOperand(operand);
  4050. UseIntermediateOperand(localResult.op);
  4051. ASSERT(x.last # NIL);
  4052. Evaluate(x.last, operand);
  4053. localResult.tag := operand.op;
  4054. ReleaseOperand(operand);
  4055. UseIntermediateOperand(localResult.tag);
  4056. IF x.step # NIL THEN
  4057. Evaluate(x.step, operand);
  4058. localResult.extra := operand.op;
  4059. ReleaseOperand(operand);
  4060. UseIntermediateOperand(localResult.extra);
  4061. END;
  4062. result := localResult;
  4063. IF Trace THEN TraceExit("VisitRangeExpression") END
  4064. END VisitRangeExpression;
  4065. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  4066. BEGIN
  4067. HALT(100); (* should never be evaluated *)
  4068. END VisitTensorRangeExpression;
  4069. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  4070. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  4071. BEGIN
  4072. IF Trace THEN TraceEnter("VisitConversion") END;
  4073. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  4074. dest := destination; destination := emptyOperand;
  4075. Evaluate(x.expression,old);
  4076. InitOperand(result,ModeValue);
  4077. result.op := old.op;
  4078. ASSERT(result.op.mode # 0);
  4079. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  4080. (* convert TO a complex number *)
  4081. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  4082. Convert(result.op,IntermediateCode.GetType(system, componentType));
  4083. ASSERT(result.op.mode # 0);
  4084. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  4085. (* convert FROM a complex number TO a complex number*)
  4086. result.tag := old.tag;
  4087. ASSERT(result.tag.mode # 0);
  4088. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  4089. ASSERT(result.tag.mode # 0)
  4090. ELSE
  4091. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  4092. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  4093. END
  4094. ELSE
  4095. Convert(result.op,IntermediateCode.GetType(system,x.type));
  4096. ASSERT(result.op.mode # 0);
  4097. result.tag := old.tag; (*! probably never used *)
  4098. END;
  4099. destination := dest;
  4100. IF Trace THEN TraceExit("VisitConversion") END;
  4101. END VisitConversion;
  4102. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  4103. BEGIN
  4104. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  4105. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  4106. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  4107. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  4108. END VisitTypeDeclaration;
  4109. (** designators (expressions) *)
  4110. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  4111. VAR ownerType, designatorType: SyntaxTree.RecordType;
  4112. BEGIN
  4113. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  4114. IF x.left # NIL THEN Expression(x.left) END;
  4115. Symbol(x.symbol,result);
  4116. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  4117. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  4118. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  4119. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  4120. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  4121. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  4122. END;
  4123. END;
  4124. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  4125. END VisitSymbolDesignator;
  4126. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  4127. BEGIN
  4128. IF isUnchecked THEN RETURN END;
  4129. IF tagsAvailable THEN
  4130. TrapC(BrltL,index,length,IndexCheckTrap);
  4131. END;
  4132. END BoundCheck;
  4133. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  4134. VAR d: IntermediateCode.Operand;
  4135. BEGIN
  4136. IF isUnchecked THEN RETURN END;
  4137. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  4138. TrapC(op,dim,d,ArraySizeTrap);
  4139. ReleaseIntermediateOperand(d);
  4140. END DimensionCheck;
  4141. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  4142. VAR
  4143. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  4144. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  4145. expression: SyntaxTree.Expression;
  4146. resultingType, leftType, baseType: SyntaxTree.Type;
  4147. skipLabel1: Label;
  4148. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  4149. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  4150. variableOp: Operand;
  4151. variable: SyntaxTree.Variable;
  4152. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  4153. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  4154. VAR e: SyntaxTree.Expression; i: LONGINT;
  4155. BEGIN
  4156. tensorFound := FALSE;
  4157. FOR i := 0 TO parameters.Length()-1 DO
  4158. e := parameters.GetExpression(i);
  4159. IF e IS SyntaxTree.TensorRangeExpression THEN
  4160. ASSERT(~tensorFound);
  4161. tensorFound := TRUE;
  4162. ELSIF e IS SyntaxTree.RangeExpression THEN
  4163. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4164. ELSE
  4165. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4166. END;
  4167. END;
  4168. END CountIndices;
  4169. BEGIN
  4170. ASSERT(tagsAvailable);
  4171. resultingType := x.type.resolved; (* resulting type *)
  4172. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  4173. InitOperand(localResult, ModeReference);
  4174. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4175. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  4176. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  4177. (* a globally defined array destination tag is available -> use and invalidate it*)
  4178. localResult.tag := arrayDestinationTag;
  4179. IntermediateCode.InitOperand(arrayDestinationTag)
  4180. ELSE
  4181. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  4182. (* the result is of array range type and thus does not provide any collectable pointers *)
  4183. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  4184. Symbol(variable, variableOp);
  4185. ReuseCopy(localResult.tag, variableOp.op);
  4186. ReleaseOperand(variableOp);
  4187. END
  4188. END;
  4189. indexListSize := x.parameters.Length();
  4190. CountIndices(x.parameters);
  4191. (*ASSERT(tensorRangeCount <= 1);*)
  4192. (* designate the array to be indexed over, perform tensor range check if known *)
  4193. Designate(x.left, array);
  4194. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4195. Dereference(array, leftType,FALSE);
  4196. IF ~tensorFound THEN
  4197. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  4198. END
  4199. END;
  4200. (* default base offset *)
  4201. srcDimOffset := 0;
  4202. destDimOffset := 0;
  4203. indexDim := 0;
  4204. (* use address of source array as basis *)
  4205. localResult.op := array.op;
  4206. UseIntermediateOperand(localResult.op);
  4207. (* go through the index list *)
  4208. FOR i := 0 TO indexListSize - 1 DO
  4209. expression := x.parameters.GetExpression(i);
  4210. IF expression IS SyntaxTree.TensorRangeExpression THEN
  4211. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  4212. srcDimOffset := -indexListSize;
  4213. destDimOffset := -suffixRanges;
  4214. ELSE
  4215. (* determine which dimension of source array is currently looked at *)
  4216. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  4217. (* get the memory operand pointing to array descriptor dimension *)
  4218. GetMathArrayField(tmp, array.tag, MathDimOffset);
  4219. (* make a reusable register from it *)
  4220. ReuseCopy(srcDim, tmp);
  4221. ReleaseIntermediateOperand(tmp);
  4222. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  4223. ELSE
  4224. srcDim := IntermediateCode.Immediate(sizeType, i);
  4225. END;
  4226. (* get length and increment of source array for current dimension *)
  4227. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  4228. Convert(sourceLength.op, sizeType);
  4229. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  4230. Convert(sourceIncrement.op, sizeType);
  4231. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  4232. ReleaseIntermediateOperand(srcDim);
  4233. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  4234. (* SINGLE INDEX *)
  4235. Evaluate(expression, index);
  4236. ReleaseIntermediateOperand(index.tag);
  4237. index.tag := emptyOperand;
  4238. Convert(index.op, sizeType);
  4239. (* lower bound check *)
  4240. IF IsIntegerImmediate(index.op, staticIndex) THEN
  4241. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  4242. ELSIF isUnchecked THEN (* do nothing *)
  4243. ELSE
  4244. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4245. END;
  4246. (* upper bound check *)
  4247. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4248. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  4249. ELSIF isUnchecked THEN (* do nothing *)
  4250. ELSE
  4251. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  4252. END;
  4253. ReleaseOperand(sourceLength);
  4254. Convert(index.op, addressType);
  4255. summand := index.op;
  4256. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  4257. (* RANGE OF INDICES *)
  4258. Evaluate(expression, range);
  4259. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  4260. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  4261. stepSize := range.extra; UseIntermediateOperand(stepSize);
  4262. ReleaseOperand(range);
  4263. Convert(firstIndex, sizeType);
  4264. Convert(lastIndex, sizeType);
  4265. Convert(stepSize, sizeType);
  4266. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  4267. if it is 'MAX(LONGINT)' *)
  4268. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4269. TransferToRegister(lastIndex, lastIndex);
  4270. skipLabel1 := NewLabel();
  4271. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  4272. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  4273. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  4274. SetLabel(skipLabel1)
  4275. END;
  4276. (* check if step size is valid *)
  4277. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  4278. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  4279. ELSIF isUnchecked THEN (* do nothing *)
  4280. ELSE
  4281. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  4282. END;
  4283. (* check lower bound check *)
  4284. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  4285. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  4286. ELSIF isUnchecked THEN (* do nothing *)
  4287. ELSE
  4288. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4289. END;
  4290. (* check upper bound check *)
  4291. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4292. (* statically open range: nothing to do *)
  4293. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4294. ASSERT(staticLastIndex < staticSourceLength)
  4295. ELSIF isUnchecked THEN (* do nothing *)
  4296. ELSE
  4297. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  4298. END;
  4299. (* determine length of target array for current dimension *)
  4300. (* 1. incorporate last index: *)
  4301. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4302. (* last index is static *)
  4303. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4304. targetLength := sourceLength.op
  4305. ELSE
  4306. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  4307. END;
  4308. UseIntermediateOperand(targetLength);
  4309. ELSE
  4310. (* targetLength := lastIndex + 1
  4311. Reuse1(targetLength, lastIndex);
  4312. *)
  4313. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  4314. END;
  4315. ReleaseOperand(sourceLength);
  4316. ReleaseIntermediateOperand(lastIndex);
  4317. (* 2. incorporate first index: *)
  4318. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4319. (* first index and current target length are static *)
  4320. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  4321. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  4322. (* first index = 0: nothing to do *)
  4323. ELSE
  4324. (* targetLength := targetLength - firstIndex *)
  4325. TransferToRegister(targetLength, targetLength);
  4326. Emit(Sub(position,targetLength, targetLength, firstIndex))
  4327. END;
  4328. (* clip negative lengths to 0 *)
  4329. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4330. IF staticTargetLength < 0 THEN
  4331. targetLength := IntermediateCode.Immediate(sizeType, 0)
  4332. END
  4333. ELSE
  4334. skipLabel1 := NewLabel();
  4335. TransferToRegister(targetLength, targetLength);
  4336. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  4337. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  4338. SetLabel(skipLabel1)
  4339. END;
  4340. (* 3. incorporate index step size: *)
  4341. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4342. (*step size and current target length are static *)
  4343. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  4344. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  4345. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4346. (* step size = 1: nothing to do *)
  4347. ELSE
  4348. (* emit code for this:
  4349. targetLength := (targetLength-1) DIV stepSize +1;
  4350. *)
  4351. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  4352. DivInt(targetLength, targetLength, stepSize);
  4353. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  4354. END;
  4355. (* determine increment of target array for current dimension *)
  4356. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  4357. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  4358. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4359. (* step size = 1 *)
  4360. targetIncrement := sourceIncrement.op;
  4361. UseIntermediateOperand(targetIncrement)
  4362. ELSE
  4363. (* targetIncrement := sourceIncrement * stepSize *)
  4364. Reuse1(targetIncrement, stepSize);
  4365. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  4366. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  4367. END;
  4368. ReleaseIntermediateOperand(stepSize);
  4369. (* write length and increment of target array to descriptor *)
  4370. IF destDimOffset < 0 THEN
  4371. (* determine which dimension of target array is currently looked at *)
  4372. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  4373. TransferToRegister(destDim, tmp);
  4374. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  4375. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  4376. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  4377. ReleaseIntermediateOperand(destDim);
  4378. INC(destDimOffset);
  4379. ELSE
  4380. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  4381. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  4382. END;
  4383. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  4384. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  4385. INC(indexDim);
  4386. Convert(firstIndex, addressType);
  4387. TransferToRegister(summand, firstIndex);
  4388. ELSE HALT(100);
  4389. END;
  4390. (*
  4391. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  4392. *)
  4393. Convert(sourceIncrement.op, addressType);
  4394. Convert(summand, addressType);
  4395. MulInt(summand, summand, sourceIncrement.op);
  4396. ReleaseIntermediateOperand(sourceIncrement.op);
  4397. AddInt(localResult.op, localResult.op, summand);
  4398. ReleaseIntermediateOperand(summand);
  4399. END
  4400. END;
  4401. result := localResult;
  4402. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4403. ReleaseIntermediateOperand(result.tag);
  4404. result.tag := TypeDescriptorAdr(resultingType);
  4405. ELSIF IsDelegate(resultingType) THEN
  4406. ReleaseIntermediateOperand(result.tag);
  4407. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4408. UseIntermediateOperand(result.tag);
  4409. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4410. ReleaseIntermediateOperand(result.tag);
  4411. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4412. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4413. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4414. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4415. (* finalize target array descriptor *)
  4416. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4417. (* write lengths and increments of target array for remaining dimensions *)
  4418. i := indexListSize;
  4419. WHILE indexDim < targetArrayDimensionality DO
  4420. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4421. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4422. ReleaseOperand(sourceLength);
  4423. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4424. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4425. ReleaseOperand(sourceIncrement);
  4426. INC(i); INC(indexDim);
  4427. END;
  4428. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4429. tmp := nil;
  4430. ELSE
  4431. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4432. END;
  4433. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4434. ReleaseIntermediateOperand(tmp);
  4435. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4436. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4437. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4438. ELSE
  4439. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4440. END;
  4441. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4442. ReleaseIntermediateOperand(tmp);
  4443. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4444. (* write dimensionality *)
  4445. IF targetArrayDimensionality # 0 THEN
  4446. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4447. END;
  4448. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4449. END;
  4450. ReleaseOperand(array);
  4451. END MathIndexDesignator;
  4452. (* get the length of an array , trying to make use of static information *)
  4453. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4454. VAR res: IntermediateCode.Operand; size: LONGINT;
  4455. BEGIN
  4456. type := type.resolved;
  4457. IF type IS SyntaxTree.ArrayType THEN
  4458. WITH type: SyntaxTree.ArrayType DO
  4459. IF type.form = SyntaxTree.Static THEN
  4460. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4461. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4462. Evaluate(type.length, op);
  4463. ReleaseIntermediateOperand(op.tag);
  4464. RETURN op.op;*)
  4465. ELSE
  4466. res := tag;
  4467. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4468. IntermediateCode.MakeMemory(res,addressType);
  4469. UseIntermediateOperand(res);
  4470. RETURN res
  4471. END
  4472. END;
  4473. ELSE
  4474. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4475. RETURN IntermediateCode.Immediate(addressType,size);
  4476. END;
  4477. END ArrayLength;
  4478. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4479. BEGIN
  4480. IF IsImmediate(x) THEN
  4481. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4482. ELSE
  4483. IF ~ReusableRegister(res) THEN
  4484. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4485. ELSE
  4486. UseIntermediateOperand(res);
  4487. END;
  4488. Emit(Mov(position,res,x))
  4489. END;
  4490. END CopyInt;
  4491. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4492. BEGIN
  4493. ReleaseIntermediateOperand(res);
  4494. IF IsImmediate(x) & IsImmediate(y) THEN
  4495. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4496. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4497. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4498. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4499. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4500. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4501. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4502. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4503. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4504. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4505. UseIntermediateOperand(res);
  4506. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4507. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4508. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4509. UseIntermediateOperand(res);
  4510. ELSE
  4511. IF ~ReusableRegister(res) THEN
  4512. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4513. ELSE
  4514. UseIntermediateOperand(res);
  4515. END;
  4516. IF IsImmediate(x) & (x.intValue = 0) THEN
  4517. Emit(Mov(position,res,y))
  4518. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4519. Emit(Mov(position,res,x))
  4520. ELSE
  4521. Emit(Add(position,res, x, y));
  4522. END;
  4523. END;
  4524. END AddInt;
  4525. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4526. BEGIN
  4527. ReleaseIntermediateOperand(res);
  4528. IF IsImmediate(x) & IsImmediate(y) THEN
  4529. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4530. ELSE
  4531. IF ~ReusableRegister(res) THEN
  4532. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4533. ELSE UseIntermediateOperand(res);
  4534. END;
  4535. IF IsImmediate(x) & (x.intValue = 1) THEN
  4536. Emit(Mov(position,res,y))
  4537. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4538. Emit(Mov(position,res,x))
  4539. ELSE
  4540. Emit(Mul(position,res, x, y));
  4541. END;
  4542. END;
  4543. END MulInt;
  4544. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4545. BEGIN
  4546. ReleaseIntermediateOperand(res);
  4547. IF IsImmediate(x) & IsImmediate(y) THEN
  4548. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4549. ELSE
  4550. IF ~ReusableRegister(res) THEN
  4551. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4552. ELSE UseIntermediateOperand(res);
  4553. END;
  4554. IF IsImmediate(x) & (x.intValue = 1) THEN
  4555. Emit(Mov(position,res,y))
  4556. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4557. Emit(Mov(position,res,x))
  4558. ELSE
  4559. Emit(Div(position,res, x, y));
  4560. END;
  4561. END;
  4562. END DivInt;
  4563. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4564. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4565. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4566. BEGIN
  4567. type := x.left.type.resolved;
  4568. IF type IS SyntaxTree.StringType THEN
  4569. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4570. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4571. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4572. type := atype;
  4573. x.left.SetType(type);
  4574. END;
  4575. IntermediateCode.InitImmediate(res,addressType,0);
  4576. maxDim := x.parameters.Length()-1;
  4577. (*
  4578. computation rule:
  4579. a: ARRAY X,Y,Z OF Element with size S
  4580. a[i,j,k] -->
  4581. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4582. *)
  4583. FOR i := 0 TO maxDim DO
  4584. e := x.parameters.GetExpression(i);
  4585. Evaluate(e,index);
  4586. Convert(index.op,addressType);
  4587. AddInt(res, res, index.op);
  4588. IF i = 0 THEN
  4589. (*
  4590. ReuseCopy(res, index.op);
  4591. *)
  4592. Designate(x.left,array);
  4593. type := x.left.type.resolved;
  4594. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4595. Dereference(array, type, FALSE);
  4596. END;
  4597. (*
  4598. ELSE AddInt(res, res, index.op);
  4599. *)
  4600. END;
  4601. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4602. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4603. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4604. BoundCheck(index.op, length);
  4605. END;
  4606. ReleaseIntermediateOperand(length);
  4607. END;
  4608. ReleaseOperand(index);
  4609. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4610. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4611. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4612. MulInt(res,res,length);
  4613. END;
  4614. ReleaseIntermediateOperand(length);
  4615. END;
  4616. (* remaining open dimensions -- compute address *)
  4617. i := maxDim+1;
  4618. IF type IS SyntaxTree.ArrayType THEN
  4619. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4620. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4621. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4622. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4623. MulInt(res,res,length);
  4624. END;
  4625. ReleaseIntermediateOperand(length);
  4626. INC(i);
  4627. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4628. END;
  4629. END;
  4630. IF (type IS SyntaxTree.ArrayType) THEN
  4631. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4632. size := StaticSize(system, type);
  4633. IF size # 1 THEN
  4634. length := IntermediateCode.Immediate(addressType,size);
  4635. MulInt(res,res,length);
  4636. END;
  4637. ELSE
  4638. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4639. IF size # 1 THEN
  4640. length := IntermediateCode.Immediate(addressType,size);
  4641. MulInt(res,res,length);
  4642. END;
  4643. END;
  4644. END;
  4645. AddInt(res,res,array.op);
  4646. InitOperand(result,ModeReference);
  4647. result.op := res;
  4648. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4649. ReleaseIntermediateOperand(result.tag);
  4650. result.tag := TypeDescriptorAdr(type);
  4651. ELSIF IsDelegate(type) THEN
  4652. ReleaseIntermediateOperand(result.tag);
  4653. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4654. UseIntermediateOperand(result.tag);
  4655. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4656. ReleaseIntermediateOperand(result.tag);
  4657. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4658. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4659. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4660. END;
  4661. ReleaseOperand(array);
  4662. END IndexDesignator;
  4663. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4664. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4665. BEGIN
  4666. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4667. dest := destination; destination := emptyOperand;
  4668. type := x.left.type.resolved;
  4669. IF type IS SyntaxTree.MathArrayType THEN
  4670. MathIndexDesignator(x);
  4671. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4672. IndexDesignator(x);
  4673. END;
  4674. destination := dest;
  4675. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4676. END VisitIndexDesignator;
  4677. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4678. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4679. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4680. procedure: SyntaxTree.Procedure;
  4681. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4682. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4683. BEGIN
  4684. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4685. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4686. parameters := expression.parameters;
  4687. moduleName := "FoxArrayBase";
  4688. procedureName := "CopyDescriptor";
  4689. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4690. SaveRegisters();ReleaseUsedRegisters(saved);
  4691. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4692. IF procedure = NIL THEN
  4693. s := "procedure ";
  4694. Strings.Append(s,moduleName);
  4695. Strings.Append(s,".");
  4696. Strings.Append(s,procedureName);
  4697. Strings.Append(s," not present");
  4698. Error(position,s);
  4699. ELSE
  4700. (* push address of temporary variable *)
  4701. Symbol(variable,destOperand);
  4702. Emit(Push(position,destOperand.op));
  4703. ReleaseOperand(destOperand);
  4704. (* push src *)
  4705. Evaluate(expression.left,srcOperand);
  4706. (*
  4707. Dereference(srcOperand,expression.type.resolved);
  4708. Emit(Push(position,srcOperand.tag));
  4709. *)
  4710. Emit(Push(position,srcOperand.op));
  4711. ReleaseOperand(srcOperand);
  4712. tensorFound := FALSE;
  4713. FOR i := 0 TO parameters.Length()-1 DO
  4714. e := parameters.GetExpression(i);
  4715. IF e IS SyntaxTree.TensorRangeExpression THEN
  4716. tensorFound := TRUE;
  4717. ELSIF e IS SyntaxTree.RangeExpression THEN
  4718. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4719. ELSE
  4720. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4721. END;
  4722. END;
  4723. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4724. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4725. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4726. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4727. StaticCallOperand(procOp,procedure);
  4728. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4729. ReleaseOperand(procOp);
  4730. END;
  4731. RestoreRegisters(saved);
  4732. END;
  4733. RETURN variable
  4734. END PrepareTensorDescriptor;
  4735. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4736. VAR
  4737. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4738. operand, tmpOperand, variableOp, variable2Op: Operand;
  4739. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4740. variable, variable2: SyntaxTree.Variable;
  4741. dim, i, size: LONGINT;
  4742. (* TODO: needed? *)
  4743. oldArrayDestinationTag: IntermediateCode.Operand;
  4744. oldArrayDestinationDimension: LONGINT;
  4745. position: Position;
  4746. saved: RegisterEntry;
  4747. arrayFlags: SET;
  4748. m, n: LONGINT;
  4749. PROCEDURE Pass(op: IntermediateCode.Operand);
  4750. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4751. BEGIN
  4752. IF register >= 0 THEN
  4753. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4754. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4755. Emit(Mov(position,parameterRegister, op));
  4756. ELSE
  4757. Emit(Push(position,op))
  4758. END
  4759. END Pass;
  4760. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4761. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4762. BEGIN
  4763. formalType := formalType.resolved; actualType := actualType.resolved;
  4764. IF IsOpenArray(formalType)THEN
  4765. IF actualType IS SyntaxTree.StringType THEN
  4766. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4767. RETURN;
  4768. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4769. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4770. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4771. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4772. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4773. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4774. ELSE
  4775. tmp := baseReg;
  4776. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4777. IntermediateCode.MakeMemory(tmp,addressType);
  4778. Pass((tmp));
  4779. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4780. END;
  4781. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4782. END;
  4783. END PushArrayLens;
  4784. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4785. BEGIN
  4786. CASE size OF
  4787. |2: INCL(flags,Size2Flag);
  4788. |3: INCL(flags,Size3Flag);
  4789. |4: INCL(flags,Size4Flag);
  4790. |5: INCL(flags,Size5Flag);
  4791. |6: INCL(flags,Size6Flag);
  4792. |7: INCL(flags,Size7Flag);
  4793. |8: INCL(flags,Size8Flag);
  4794. END;
  4795. END SetSmallArraySizeFlag;
  4796. BEGIN
  4797. IF Trace THEN TraceEnter("PushParameter") END;
  4798. position := expression.position;
  4799. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4800. type := expression.type.resolved;
  4801. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4802. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4803. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4804. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4805. );
  4806. (* TODO: needed? *)
  4807. oldArrayDestinationTag := arrayDestinationTag;
  4808. oldArrayDestinationDimension := arrayDestinationDimension;
  4809. IF IsArrayOfSystemByte(parameter.type) THEN
  4810. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4811. Designate(expression,operand);
  4812. ELSE
  4813. Evaluate(expression, tmpOperand);
  4814. (* array of system byte does not provide any pointers *)
  4815. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4816. Symbol(variable, operand);
  4817. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4818. Emit(Mov(position,tmp, tmpOperand.op));
  4819. ReleaseOperand(tmpOperand);
  4820. END;
  4821. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4822. ReleaseIntermediateOperand(operand.tag);
  4823. operand.tag := tmp;
  4824. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4825. Pass((operand.tag));
  4826. END;
  4827. Pass((operand.op));
  4828. ELSIF IsOpenArray(parameter.type) THEN
  4829. Designate(expression,operand);
  4830. baseReg := operand.tag;
  4831. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4832. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4833. END;
  4834. Pass((operand.op)); (* address of the array *)
  4835. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4836. (* case 1
  4837. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4838. *)
  4839. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4840. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4841. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4842. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4843. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4844. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4845. arrayDestinationTag := sp;
  4846. (* case 1b
  4847. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4848. *)
  4849. IF expression IS SyntaxTree.IndexDesignator THEN
  4850. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4851. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4852. arrayDestinationDimension := dim;
  4853. Designate(expression,operand);
  4854. (* case 1a
  4855. P(...,A,...) push: push array descriptor to stack
  4856. *)
  4857. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4858. Designate(expression,operand);
  4859. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4860. i := 0;
  4861. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4862. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4863. INC(i);
  4864. END;
  4865. type := expression.type.resolved;
  4866. WHILE (i<dim) DO (* remaining static dimensions *)
  4867. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4868. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4869. ReleaseOperand(tmpOperand);
  4870. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4871. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4872. ReleaseOperand(tmpOperand);
  4873. INC(i);
  4874. END;
  4875. dimOp := IntermediateCode.Immediate(addressType,dim);
  4876. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4877. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4878. (* case 1d
  4879. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4880. + case 1e
  4881. P(.. PT() ... );
  4882. *)
  4883. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4884. Designate(expression,operand);
  4885. Dereference(operand,type.resolved,FALSE);
  4886. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4887. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4888. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4889. (* case 1f
  4890. P(...,S,...) push: create array descriptor to S on stack
  4891. case 1g
  4892. P(... PS()...)
  4893. *)
  4894. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4895. Designate(expression,operand);
  4896. FOR i := 0 TO dim-1 DO
  4897. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4898. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4899. ReleaseOperand(tmpOperand);
  4900. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4901. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4902. ReleaseOperand(tmpOperand);
  4903. END;
  4904. (*******
  4905. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4906. *)
  4907. arrayFlags := {StaticFlag};
  4908. IF dim = 1 THEN
  4909. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4910. ReleaseOperand(tmpOperand);
  4911. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4912. m := LONGINT(tmpOperand.op.intValue);
  4913. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4914. ELSIF dim = 2 THEN
  4915. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4916. ReleaseOperand(tmpOperand);
  4917. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4918. m := LONGINT(tmpOperand.op.intValue);
  4919. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4920. ReleaseOperand(tmpOperand);
  4921. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4922. n := LONGINT(tmpOperand.op.intValue);
  4923. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4924. INCL(arrayFlags,SmallMatrixFlag);
  4925. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4926. END;
  4927. END;
  4928. (*******)
  4929. dimOp := IntermediateCode.Immediate(addressType,dim);
  4930. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4931. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4932. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4933. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4934. baseType := SemanticChecker.ArrayBase(type,dim);
  4935. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4936. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4937. ELSE HALT(100);
  4938. END;
  4939. (* case 2
  4940. procedure P([left args], var A: array [*,*] of Type, [right args])
  4941. *)
  4942. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4943. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4944. (* case 2b
  4945. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4946. push: push reference to pushed array descriptor
  4947. post: remove array descriptor.
  4948. *)
  4949. IF expression IS SyntaxTree.IndexDesignator THEN
  4950. descriptorType := GetMathArrayDescriptorType(dim);
  4951. (* range type : no allocation possible, should be untraced *)
  4952. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4953. Symbol(variable,variableOp);
  4954. arrayDestinationTag := variableOp.op;
  4955. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4956. arrayDestinationDimension := dim;
  4957. NeedDescriptor := TRUE;
  4958. Designate(expression,operand);
  4959. Pass((operand.tag));
  4960. NeedDescriptor := FALSE;
  4961. (* case 2a
  4962. P(...,A,...)
  4963. push: push reference to array descriptor on stack
  4964. *)
  4965. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4966. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4967. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4968. INC(i);
  4969. END;
  4970. IF i = dim THEN
  4971. Designate(expression,operand);
  4972. Pass((operand.tag));
  4973. ELSE (* open-static *)
  4974. type := expression.type.resolved;
  4975. descriptorType := GetMathArrayDescriptorType(dim);
  4976. (* static array , cannot be reallocated, untraced !*)
  4977. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4978. Symbol(variable,variableOp);
  4979. arrayDestinationTag := variableOp.op;
  4980. Designate(expression,operand);
  4981. FOR i := 0 TO dim-1 DO
  4982. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4983. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4984. ReleaseOperand(tmpOperand);
  4985. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4986. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4987. ReleaseOperand(tmpOperand);
  4988. END;
  4989. dimOp := IntermediateCode.Immediate(addressType,dim);
  4990. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4991. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4992. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4993. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4994. baseType := SemanticChecker.ArrayBase(type,dim);
  4995. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4996. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4997. Pass((arrayDestinationTag));
  4998. END;
  4999. (* case 2d
  5000. P(...,T,...) push: emit dimension check, push T
  5001. *)
  5002. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5003. Designate(expression,operand);
  5004. Dereference(operand,type.resolved,FALSE);
  5005. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  5006. Pass((operand.tag));
  5007. (* case 2f
  5008. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  5009. push: push reference to pushed array descriptor
  5010. post: remove array descriptor
  5011. *)
  5012. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5013. descriptorType := GetMathArrayDescriptorType(dim);
  5014. (* static array -- cannot be reallocatated, untraced *)
  5015. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5016. Symbol(variable,variableOp);
  5017. arrayDestinationTag := variableOp.op;
  5018. Designate(expression,operand);
  5019. FOR i := 0 TO dim-1 DO
  5020. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5021. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5022. ReleaseOperand(tmpOperand);
  5023. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5024. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5025. ReleaseOperand(tmpOperand);
  5026. END;
  5027. (*
  5028. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  5029. *)
  5030. arrayFlags := {StaticFlag};
  5031. IF dim = 1 THEN
  5032. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5033. ReleaseOperand(tmpOperand);
  5034. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5035. m := LONGINT(tmpOperand.op.intValue);
  5036. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  5037. ELSIF dim = 2 THEN
  5038. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5039. ReleaseOperand(tmpOperand);
  5040. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5041. m := LONGINT(tmpOperand.op.intValue);
  5042. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  5043. ReleaseOperand(tmpOperand);
  5044. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5045. n := LONGINT(tmpOperand.op.intValue);
  5046. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  5047. INCL(arrayFlags,SmallMatrixFlag);
  5048. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  5049. END;
  5050. END;
  5051. (*******)
  5052. dimOp := IntermediateCode.Immediate(addressType,dim);
  5053. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5054. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5055. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5056. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  5057. baseType := SemanticChecker.ArrayBase(type,dim);
  5058. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5059. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5060. Pass((arrayDestinationTag));
  5061. ELSE HALT(100);
  5062. END;
  5063. (* case 3
  5064. procedure P([left args], [const] A: array [?] of Type, [right args])
  5065. *)
  5066. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  5067. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5068. (* case 3b
  5069. P(...,A[a..b,c..d],...)
  5070. *)
  5071. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5072. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5073. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5074. Symbol(variable,variableOp);
  5075. LoadValue(variableOp,system.addressType);
  5076. ELSE
  5077. descriptorType := GetMathArrayDescriptorType(dim);
  5078. (* range -- cannot be reallocated *)
  5079. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5080. Symbol(variable,variableOp);
  5081. END;
  5082. arrayDestinationTag := variableOp.op;
  5083. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5084. arrayDestinationDimension := 0;
  5085. Designate(expression,operand);
  5086. Pass((operand.tag));
  5087. (* case 3a
  5088. P(...,A,...)
  5089. *)
  5090. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5091. i := 0;
  5092. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5093. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5094. INC(i);
  5095. END;
  5096. IF i = dim THEN
  5097. Designate(expression,operand);
  5098. Pass((operand.tag));
  5099. ELSE (* open-static *)
  5100. type := expression.type.resolved;
  5101. descriptorType := GetMathArrayDescriptorType(dim);
  5102. (* static array -- cannot be reallocated -- no pointer to be traced *)
  5103. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5104. Symbol(variable,variableOp);
  5105. arrayDestinationTag := variableOp.op;
  5106. Designate(expression,operand);
  5107. FOR i := 0 TO dim-1 DO
  5108. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5109. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5110. ReleaseOperand(tmpOperand);
  5111. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5112. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5113. ReleaseOperand(tmpOperand);
  5114. END;
  5115. dimOp := IntermediateCode.Immediate(addressType,dim);
  5116. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5117. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5118. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5119. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  5120. baseType := SemanticChecker.ArrayBase(type,dim);
  5121. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5122. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5123. Pass((arrayDestinationTag));
  5124. END;
  5125. (* case 3d
  5126. P(...,T,...)
  5127. case 3e
  5128. P(...,PT(...),...)
  5129. *)
  5130. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5131. Designate(expression,operand);
  5132. Dereference(operand,type.resolved,FALSE);
  5133. Pass((operand.tag));
  5134. (* case 3f
  5135. P(...,S,...)
  5136. case 3g
  5137. P(...,PS(...),...)
  5138. *)
  5139. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5140. descriptorType := GetMathArrayDescriptorType(dim);
  5141. (* static array does not need to be traced *)
  5142. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5143. Symbol(variable,variableOp);
  5144. arrayDestinationTag := variableOp.op;
  5145. Designate(expression,operand);
  5146. IF operand.op.type.length >1 THEN (* vector register *)
  5147. (* static array does not need to be traced *)
  5148. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  5149. Symbol(variable2, variable2Op);
  5150. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  5151. Emit(Mov(position,tmp, operand.op));
  5152. ReleaseOperand(operand);
  5153. Symbol(variable2, operand);
  5154. END;
  5155. FOR i := 0 TO dim-1 DO
  5156. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5157. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5158. ReleaseOperand(tmpOperand);
  5159. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5160. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5161. ReleaseOperand(tmpOperand);
  5162. END;
  5163. dimOp := IntermediateCode.Immediate(addressType,dim);
  5164. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5165. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5166. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5167. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5168. baseType := SemanticChecker.ArrayBase(type,dim);
  5169. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5170. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5171. Pass((arrayDestinationTag));
  5172. ELSE HALT(100);
  5173. END;
  5174. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  5175. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5176. (* case 4b
  5177. P(...,A[a..b,c..d],...)
  5178. *)
  5179. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5180. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5181. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5182. Symbol(variable,variableOp);
  5183. LoadValue(variableOp,system.addressType);
  5184. ELSE
  5185. descriptorType := GetMathArrayDescriptorType(dim);
  5186. (* range array -- cannot be allocated *)
  5187. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5188. Symbol(variable,variableOp);
  5189. END;
  5190. arrayDestinationTag := variableOp.op;
  5191. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5192. arrayDestinationDimension := 0;
  5193. Designate(expression,operand);
  5194. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5195. Symbol(variable,variableOp);
  5196. ELSE
  5197. (* alias to range -- untraced *)
  5198. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5199. Symbol(variable,variableOp);
  5200. MakeMemory(tmp,variableOp.op,addressType,0);
  5201. Emit(Mov(position,tmp,operand.tag));
  5202. ReleaseIntermediateOperand(tmp);
  5203. END;
  5204. Pass((variableOp.op));
  5205. ReleaseOperand(variableOp);
  5206. (* case 4a
  5207. P(...,A,...)
  5208. *)
  5209. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5210. i := 0;
  5211. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5212. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5213. INC(i);
  5214. END;
  5215. IF i = dim THEN
  5216. Designate(expression,operand);
  5217. arrayDestinationTag := operand.tag;
  5218. ELSE (* open-static *)
  5219. type := expression.type.resolved;
  5220. descriptorType := GetMathArrayDescriptorType(dim);
  5221. (* static array -- untraced *)
  5222. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5223. Symbol(variable,variableOp);
  5224. arrayDestinationTag := variableOp.op;
  5225. Designate(expression,operand);
  5226. FOR i := 0 TO dim-1 DO
  5227. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5228. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5229. ReleaseOperand(tmpOperand);
  5230. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5231. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5232. ReleaseOperand(tmpOperand);
  5233. END;
  5234. dimOp := IntermediateCode.Immediate(addressType,dim);
  5235. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5236. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5237. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5238. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  5239. baseType := SemanticChecker.ArrayBase(type,dim);
  5240. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5241. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5242. END;
  5243. (* tensor alias to open array -- untraced *)
  5244. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5245. Symbol(variable,variableOp);
  5246. MakeMemory(tmp,variableOp.op,addressType,0);
  5247. Emit(Mov(position,tmp,arrayDestinationTag));
  5248. ReleaseIntermediateOperand(tmp);
  5249. Pass((variableOp.op));
  5250. ReleaseOperand(variableOp);
  5251. (* case 4d
  5252. P(...,T,...)
  5253. *)
  5254. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5255. Designate(expression,operand);
  5256. Pass((operand.op));
  5257. (* case 4f
  5258. P(...,S,...)
  5259. *)
  5260. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5261. descriptorType := GetMathArrayDescriptorType(dim);
  5262. (* static array -- cannot be reallocated, untraced *)
  5263. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5264. Symbol(variable,variableOp);
  5265. arrayDestinationTag := variableOp.op;
  5266. Designate(expression,operand);
  5267. FOR i := 0 TO dim-1 DO
  5268. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5269. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5270. ReleaseOperand(tmpOperand);
  5271. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5272. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5273. ReleaseOperand(tmpOperand);
  5274. END;
  5275. dimOp := IntermediateCode.Immediate(addressType,dim);
  5276. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5277. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5278. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5279. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5280. baseType := SemanticChecker.ArrayBase(type,dim);
  5281. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5282. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5283. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5284. Symbol(variable,variableOp);
  5285. MakeMemory(tmp,variableOp.op,addressType,0);
  5286. Emit(Mov(position,tmp,arrayDestinationTag));
  5287. ReleaseIntermediateOperand(tmp);
  5288. Pass((variableOp.op));
  5289. ReleaseOperand(variableOp);
  5290. ELSE HALT(100);
  5291. END;
  5292. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  5293. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  5294. Designate(expression,operand);
  5295. IF operand.op.type.length > 1 THEN
  5296. Emit(Push(position, operand.op));
  5297. ELSE
  5298. size := system.SizeOf(type);
  5299. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  5300. size := ToMemoryUnits(system,size);
  5301. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5302. arrayDestinationTag := sp;
  5303. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  5304. END;
  5305. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  5306. Designate(expression,operand);
  5307. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  5308. (* static array no pointer *)
  5309. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5310. Symbol(variable,variableOp);
  5311. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  5312. Emit(Mov(position,tmp,operand.op));
  5313. Emit(Push(position,variableOp.op));
  5314. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5315. Pass((operand.op));
  5316. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  5317. END;
  5318. ELSE HALT(200)
  5319. END;
  5320. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  5321. IF parameter.kind = SyntaxTree.VarParameter THEN
  5322. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  5323. Designate(expression, operand);
  5324. Pass((operand.op));
  5325. ELSE
  5326. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5327. Evaluate(expression, operand);
  5328. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  5329. Pass((operand.extra)); (* step *)
  5330. Pass((operand.tag)); (* last *)
  5331. Pass((operand.op)); (* first *)
  5332. ELSE
  5333. (* pass range as structure in order to comply with the variable alignment of its components *)
  5334. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5335. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  5336. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5337. tmp := sp;
  5338. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5339. Emit(Mov(position,tmp,operand.op)); (* first *)
  5340. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  5341. IntermediateCode.AddOffset(tmp,size);
  5342. Emit(Mov(position,tmp,operand.tag)); (* last *)
  5343. IntermediateCode.AddOffset(tmp,size);
  5344. Emit(Mov(position,tmp,operand.extra)); (* step *)
  5345. END;
  5346. END
  5347. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  5348. IF parameter.kind = SyntaxTree.VarParameter THEN
  5349. Designate(expression, operand);
  5350. Pass((operand.op));
  5351. ELSE
  5352. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5353. Evaluate(expression, operand);
  5354. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  5355. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  5356. Pass((operand.tag)); (* imaginary part *)
  5357. Pass((operand.op)) (* real part *)
  5358. ELSE
  5359. (* pass complex as structure in order to comply with the variable alignment of its components *)
  5360. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5361. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  5362. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5363. tmp := sp;
  5364. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5365. Emit(Mov(position,tmp,operand.op)); (* real part *)
  5366. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  5367. IntermediateCode.AddOffset(tmp,size);
  5368. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  5369. END
  5370. END
  5371. ELSE
  5372. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5373. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  5374. Designate(expression,operand);
  5375. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  5376. (* stack allocation *)
  5377. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  5378. (*! parameter alignment to be discussed ... *)
  5379. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  5380. size := type(SyntaxTree.StringType).length;
  5381. END;
  5382. IF backend.cooperative & parameter.NeedsTrace() THEN
  5383. dst := NewRegisterOperand (addressType);
  5384. Emit(Mov(position,dst, sp));
  5385. IntermediateCode.InitImmediate(null, byteType, 0);
  5386. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  5387. ReleaseIntermediateOperand(dst);
  5388. SaveRegisters();ReleaseUsedRegisters(saved);
  5389. (* register dst has been freed before SaveRegisters already *)
  5390. CallAssignMethod(dst, operand.op, parameter.type);
  5391. RestoreRegisters(saved);
  5392. END;
  5393. IF operand.op.type.length > 1 THEN (* vector *)
  5394. MakeMemory(tmp,sp,operand.op.type,0);
  5395. Emit(Mov(position, tmp, operand.op));
  5396. ELSE
  5397. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5398. END;
  5399. ELSIF IsOpenArray(parameter.type) THEN
  5400. Designate(expression,operand);
  5401. baseReg := operand.tag;
  5402. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5403. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5404. END;
  5405. Pass((operand.op)); (* address of the array *)
  5406. ELSIF IsDelegate(parameter.type) THEN
  5407. Evaluate(expression,operand);
  5408. IF backend.cooperative & parameter.NeedsTrace() THEN
  5409. Emit(Push(position, nil));
  5410. dst := NewRegisterOperand (addressType);
  5411. Emit(Mov(position,dst, sp));
  5412. ReleaseIntermediateOperand(dst);
  5413. SaveRegisters();ReleaseUsedRegisters(saved);
  5414. Emit(Push(position, dst));
  5415. (* register dst has been freed before SaveRegisters already *)
  5416. Emit(Push(position, operand.tag));
  5417. CallThis(position,"GarbageCollector","Assign",2);
  5418. RestoreRegisters(saved);
  5419. ELSE
  5420. Pass((operand.tag));
  5421. END;
  5422. Pass((operand.op));
  5423. ELSE
  5424. Evaluate(expression,operand);
  5425. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5426. Emit(Push(position, nil));
  5427. dst := NewRegisterOperand (addressType);
  5428. Emit(Mov(position,dst, sp));
  5429. ReleaseIntermediateOperand(dst);
  5430. SaveRegisters();ReleaseUsedRegisters(saved);
  5431. Emit(Push(position, dst));
  5432. (* register dst has been freed before SaveRegisters already *)
  5433. Emit(Push(position, operand.op));
  5434. CallThis(position,"GarbageCollector","Assign",2);
  5435. RestoreRegisters(saved);
  5436. ELSE
  5437. Pass((operand.op));
  5438. END;
  5439. END;
  5440. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5441. Evaluate(expression,operand);
  5442. Pass((operand.op));
  5443. ELSE (* var parameter *)
  5444. Designate(expression,operand);
  5445. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5446. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5447. Pass((operand.tag));
  5448. END;
  5449. END;
  5450. Pass((operand.op));
  5451. END;
  5452. END;
  5453. (* TODO: needed? *)
  5454. arrayDestinationTag := oldArrayDestinationTag;
  5455. arrayDestinationDimension := oldArrayDestinationDimension;
  5456. IF needsParameterBackup THEN
  5457. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5458. ReuseCopy(parameterBackup, operand.op)
  5459. END;
  5460. ReleaseOperand(operand);
  5461. IF Trace THEN TraceExit("PushParameter") END;
  5462. END PushParameter;
  5463. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5464. BEGIN
  5465. 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
  5466. Expression(x.result); (* use register *)
  5467. END;
  5468. Statement(x.statement);
  5469. IF x.result # NIL THEN Expression(x.result) END;
  5470. 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
  5471. ReleaseIntermediateOperand(result.op);
  5472. END;
  5473. END VisitStatementDesignator;
  5474. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5475. VAR
  5476. procedure: SyntaxTree.Procedure;
  5477. procedureType: SyntaxTree.ProcedureType;
  5478. wasInline: BOOLEAN;
  5479. actualParameters: SyntaxTree.ExpressionList;
  5480. formalParameter: SyntaxTree.Parameter;
  5481. actualParameter: SyntaxTree.Expression;
  5482. i: LONGINT;
  5483. localVariable: SyntaxTree.Variable;
  5484. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5485. src, dest: Operand;
  5486. prevInlineExit : Label;
  5487. prevMapper: SymbolMapper;
  5488. tooComplex: BOOLEAN;
  5489. resultDesignator: SyntaxTree.Expression;
  5490. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5491. BEGIN
  5492. IF e = NIL THEN RETURN TRUE
  5493. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5494. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5495. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5496. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5497. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5498. ELSE RETURN FALSE
  5499. END;
  5500. END SimpleExpression;
  5501. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5502. BEGIN
  5503. RETURN checker.CanPassInRegister(type)
  5504. END FitsInRegister;
  5505. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5506. VAR
  5507. variable: SyntaxTree.Variable;
  5508. variableDesignator: SyntaxTree.Designator;
  5509. BEGIN
  5510. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5511. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5512. variableDesignator.SetType(type);
  5513. RETURN variableDesignator
  5514. END GetTemp;
  5515. BEGIN
  5516. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5517. wasInline := currentIsInline;
  5518. prevInlineExit := currentInlineExit;
  5519. prevMapper := currentMapper;
  5520. currentInlineExit := NewLabel();
  5521. tooComplex := FALSE;
  5522. NEW(currentMapper);
  5523. currentIsInline := TRUE;
  5524. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5525. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5526. formalParameter := procedureType.firstParameter;
  5527. actualParameters := x.parameters;
  5528. i := 0;
  5529. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5530. actualParameter := actualParameters.GetExpression(i);
  5531. IF actualParameter.resolved # NIL THEN
  5532. actualParameter := actualParameter.resolved
  5533. END;
  5534. (*
  5535. if expression is simple and can be passed immediately
  5536. or if type fits in register then we can proceed
  5537. otherwise we escape to ordinary procedure call.
  5538. *)
  5539. (* cases where the expression can be mapped identically *)
  5540. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5541. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5542. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5543. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5544. (*
  5545. Assign(variableDesignator, actualParameter);
  5546. *)
  5547. Evaluate(actualParameter, src);
  5548. Designate(variableDesignator, dest);
  5549. Emit(Mov(x.position, dest.op, src.op));
  5550. ReleaseOperand(dest);
  5551. ReleaseOperand(src);
  5552. (* the src operand should now have been completely released ! *)
  5553. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5554. ELSE tooComplex := TRUE
  5555. END;
  5556. (*
  5557. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5558. currentMapper.Add(formalParameter, actualParameter, NIL);
  5559. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5560. variableDesignator := GetTemp(system.addressType, FALSE);
  5561. Designate(actualParameter, src);
  5562. Designate(variableDesignator, dest);
  5563. IntermediateCode.MakeMemory(dest.op,addressType);
  5564. Emit(Mov(x.position, dest.op, src.op));
  5565. ReleaseOperand(dest);
  5566. IF src.tag.mode # IntermediateCode.Undefined THEN
  5567. tagDesignator := GetTemp(system.addressType, FALSE);
  5568. Designate(tagDesignator, dest);
  5569. IntermediateCode.MakeMemory(dest.op,addressType);
  5570. Emit(Mov(x.position, dest.op, src.op));
  5571. END;
  5572. ReleaseOperand(dest); ReleaseOperand(src);
  5573. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5574. END;
  5575. *)
  5576. formalParameter := formalParameter.nextParameter;
  5577. INC(i);
  5578. END;
  5579. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5580. IF resultDesignator # NIL THEN
  5581. returnDesignator := resultDesignator
  5582. ELSE
  5583. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5584. END;
  5585. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5586. END;
  5587. localVariable := procedure.procedureScope.firstVariable;
  5588. WHILE ~tooComplex & (localVariable # NIL) DO
  5589. variableDesignator := GetTemp(localVariable.type, FALSE);
  5590. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5591. localVariable := localVariable.nextVariable;
  5592. END;
  5593. IF ~tooComplex THEN
  5594. VisitStatementBlock(procedure.procedureScope.body);
  5595. SetLabel(currentInlineExit);
  5596. IF procedureType.returnType # NIL THEN
  5597. Designate(returnDesignator, result);
  5598. END;
  5599. END;
  5600. currentMapper := prevMapper;
  5601. currentInlineExit := prevInlineExit;
  5602. currentIsInline := wasInline;
  5603. RETURN ~tooComplex
  5604. END InlineProcedureCall;
  5605. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5606. VAR
  5607. parameters: SyntaxTree.ExpressionList;
  5608. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5609. procedureType: SyntaxTree.ProcedureType;
  5610. formalParameter: SyntaxTree.Parameter;
  5611. operand: Operand;
  5612. reg, size, mask, dest: IntermediateCode.Operand;
  5613. saved,saved2: RegisterEntry;
  5614. symbol: SyntaxTree.Symbol;
  5615. variable: SyntaxTree.Variable;
  5616. i, parametersSize : LONGINT;
  5617. structuredReturnType: BOOLEAN;
  5618. gap, alignment: LONGINT; (*fld*)
  5619. return: IntermediateCode.Operand;
  5620. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5621. arg: IntermediateCode.Operand;
  5622. dummy: IntermediateCode.Operand;
  5623. recordType: SyntaxTree.RecordType;
  5624. operatorSelectionProcedureOperand: Operand;
  5625. operatorSelectionProcedure: SyntaxTree.Procedure;
  5626. fingerPrint: SyntaxTree.FingerPrint;
  5627. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5628. identifierNumber: LONGINT;
  5629. parameterRegisters: SIZE;
  5630. registers: ARRAY 64 OF WORD;
  5631. procedure: SyntaxTree.Procedure;
  5632. callingConvention: SyntaxTree.CallingConvention;
  5633. type: IntermediateCode.Type;
  5634. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5635. (** do preparations before parameter push for array-structured object types (ASOTs):
  5636. if ASOT is passed as VAR parameter:
  5637. - allocate temporary variable of math array type
  5638. - copy contents of ASOT to be passed to temporary variable
  5639. - use temporary variable as the actual parameter instead
  5640. - 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)
  5641. **)
  5642. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5643. VAR
  5644. expression, left: SyntaxTree.Expression; tempVariableDesignator : SyntaxTree.Designator;
  5645. BEGIN
  5646. IF (formalParameter.kind = SyntaxTree.VarParameter) & SemanticChecker.IsIndexOperator(actualParameter) THEN
  5647. WITH actualParameter: SyntaxTree.ProcedureCallDesignator DO
  5648. (* prepare writeback for any other "normal" indexer *)
  5649. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5650. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5651. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5652. Assign(tempVariableDesignator, actualParameter);
  5653. IF firstWriteBackCall = NIL THEN
  5654. NEW(firstWriteBackCall);
  5655. currentWriteBackCall := firstWriteBackCall
  5656. ELSE
  5657. ASSERT(currentWriteBackCall # NIL);
  5658. NEW(currentWriteBackCall.next);
  5659. currentWriteBackCall := currentWriteBackCall.next
  5660. END;
  5661. (* a [^] . P[] ()*)
  5662. left := actualParameter.left; (* procedure call designator --> procedure call *)
  5663. left := left(SyntaxTree.Designator).left; (* procedure call --> caller object *)
  5664. IF left IS SyntaxTree.DereferenceDesignator THEN (* dereference, if required *)
  5665. left := left(SyntaxTree.Designator).left;
  5666. END;
  5667. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, left, 0, actualParameter.parameters, tempVariableDesignator);
  5668. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5669. END;
  5670. actualParameter := tempVariableDesignator;
  5671. END
  5672. END PrepareParameter;
  5673. BEGIN
  5674. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5675. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5676. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5677. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5678. IF InlineProcedureCall(x) THEN
  5679. RETURN
  5680. ELSE
  5681. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5682. END
  5683. END;
  5684. END;
  5685. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5686. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5687. callingConvention := procedureType.callingConvention;
  5688. dest := destination; destination := emptyOperand;
  5689. SaveRegisters();ReleaseUsedRegisters(saved);
  5690. parameters := x.parameters;
  5691. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5692. (* an operator is called *)
  5693. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5694. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5695. (* check if a dynamic operator call should be performed *)
  5696. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5697. ELSE
  5698. isCallOfDynamicOperator := FALSE
  5699. END;
  5700. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5701. Emit(Push(position, ap));
  5702. END;
  5703. alignment := procedureType.stackAlignment;
  5704. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5705. alignment := 16 (* bytes *);
  5706. END;
  5707. IF alignment > 1 THEN
  5708. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5709. Emit(Mov(position,reg, sp));
  5710. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5711. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5712. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5713. gap := 4*ToMemoryUnits(system,system.addressSize);
  5714. END;
  5715. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5716. backend.ResetParameterRegisters();
  5717. formalParameter := procedureType.firstParameter;
  5718. FOR i := 0 TO parameters.Length()-1 DO
  5719. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5720. type := addressType;
  5721. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5722. type := addressType;
  5723. ELSE
  5724. type := GetType(system, formalParameter.type);
  5725. END;
  5726. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5727. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5728. END;
  5729. formalParameter := formalParameter.nextParameter;
  5730. END;
  5731. IF gap < 0 THEN
  5732. gap := 0
  5733. END;
  5734. ELSE
  5735. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5736. END;
  5737. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5738. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5739. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5740. Emit(And(position,sp, sp, mask));
  5741. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5742. Emit(Push(position,reg));
  5743. ReleaseIntermediateOperand(reg);
  5744. END;
  5745. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5746. (* align stack to 16-byte boundary *)
  5747. IntermediateCode.InitImmediate(mask,addressType,-16);
  5748. Emit(And(position,sp, sp, mask));
  5749. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5750. IF gap # 0 THEN
  5751. IntermediateCode.InitImmediate(size,addressType,gap);
  5752. Emit(Sub(position,sp,sp,size))
  5753. END;
  5754. END;
  5755. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5756. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5757. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5758. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5759. ELSE
  5760. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5761. END;
  5762. IF procedureType.selfParameter # NIL THEN (* type bound procedure in a record *)
  5763. Designate(x.left(SyntaxTree.Designator).left, operand);
  5764. Emit(Push(position, operand.tag));
  5765. Emit(Push(position, operand.op));
  5766. Symbol(symbol, operand);
  5767. LoadValue(operand, symbol.type);
  5768. (*
  5769. PushParameter(x.left(SyntaxTree.Designator).left, procedureType.selfParameter, callingConvention, FALSE, dummy,-1);
  5770. Evaluate(x.left, operand);
  5771. *)
  5772. ELSE
  5773. Evaluate(x.left, operand);
  5774. IF symbol IS SyntaxTree.Procedure THEN
  5775. IF (procedureType.selfParameter # NIL) THEN
  5776. Emit(Push(position,operand.tag));
  5777. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5778. Emit(Push(position,operand.tag));
  5779. ELSIF (procedureType.isDelegate) THEN
  5780. Emit(Push(position,operand.tag));
  5781. END;
  5782. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5783. IF (procedureType.selfParameter # NIL) THEN
  5784. Emit(Push(position,operand.tag));
  5785. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5786. Emit(Push(position,operand.tag));
  5787. END;
  5788. ELSE HALT(200);
  5789. END;
  5790. END;
  5791. ReleaseIntermediateOperand(operand.tag);
  5792. operand.tag := emptyOperand;
  5793. (* determine if a structured return type is needed *)
  5794. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5795. IF structuredReturnType THEN
  5796. IF resultDesignator # NIL THEN
  5797. d := resultDesignator;
  5798. ELSE
  5799. (* temporary result that might be allocated, must potentially be traced *)
  5800. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5801. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5802. d.SetType(variable.type);
  5803. END;
  5804. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5805. Designate(d,returnValue);
  5806. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5807. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5808. Emit(Push(position,size));
  5809. Emit(Push(position,returnValue.op));
  5810. ReleaseOperand(returnValue);
  5811. ELSE*)
  5812. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5813. (*
  5814. END;
  5815. *)
  5816. END;
  5817. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5818. parameterRegisters := 0;
  5819. backend.ResetParameterRegisters();
  5820. formalParameter := procedureType.firstParameter;
  5821. FOR i := 0 TO parameters.Length()-1 DO
  5822. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5823. type := addressType;
  5824. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5825. type := addressType;
  5826. ELSE
  5827. type := GetType(system, formalParameter.type);
  5828. END;
  5829. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5830. INC(parameterRegisters);
  5831. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5832. Error(actualParameter.position,"cannot be passed by register")
  5833. END;
  5834. ELSE
  5835. registers[i] := -1;
  5836. END;
  5837. formalParameter := formalParameter.nextParameter;
  5838. END;
  5839. formalParameter := procedureType.lastParameter;
  5840. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5841. actualParameter := parameters.GetExpression(i);
  5842. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5843. formalParameter := formalParameter.prevParameter;
  5844. END;
  5845. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5846. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5847. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5848. END;
  5849. ELSE
  5850. hasDynamicOperands := FALSE;
  5851. formalParameter := procedureType.firstParameter;
  5852. FOR i := 0 TO parameters.Length() - 1 DO
  5853. actualParameter := parameters.GetExpression(i);
  5854. PrepareParameter(actualParameter, formalParameter);
  5855. IF formalParameter # NIL THEN (* TENTATIVE *)
  5856. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5857. ASSERT(i < 2);
  5858. hasDynamicOperands := TRUE;
  5859. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5860. ELSE
  5861. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5862. END;
  5863. formalParameter := formalParameter.nextParameter;
  5864. END;
  5865. END;
  5866. END;
  5867. IF symbol IS SyntaxTree.Procedure THEN
  5868. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5869. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5870. Emit(Push(position,reg));
  5871. ReleaseIntermediateOperand(reg);
  5872. END;
  5873. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5874. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5875. parametersSize := ParametersSize(system,procedureType, FALSE);
  5876. END;
  5877. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5878. (*
  5879. dynamic operator overloading:
  5880. first push parameters, regularly:
  5881. [self]
  5882. par1
  5883. par2
  5884. then push parameters for GetOperator
  5885. identifier
  5886. ptr1
  5887. tag
  5888. ptr2
  5889. tag
  5890. call GetOperatorRuntimeProc
  5891. call Operator
  5892. *)
  5893. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5894. (* push ID *)
  5895. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5896. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5897. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5898. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5899. formalParameter := procedureType.firstParameter;
  5900. FOR i := 0 TO parameters.Length() - 1 DO
  5901. IF formalParameter.access # SyntaxTree.Hidden THEN
  5902. ASSERT(i < 2);
  5903. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5904. (* push pointer *)
  5905. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5906. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5907. (* add dereference *)
  5908. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5909. (*! better: do refer to stack above than using parameter backups !!*)
  5910. ReleaseIntermediateOperand(parameterBackups[i]);
  5911. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5912. END;
  5913. Emit(Push(position,parameterBackups[i]));
  5914. ReleaseIntermediateOperand(parameterBackups[i]);
  5915. (* push typetag *)
  5916. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5917. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5918. arg := TypeDescriptorAdr(recordType);
  5919. Emit(Push(position,arg));
  5920. ELSE
  5921. (* push 'NonPointer' *)
  5922. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5923. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5924. (* push fingerprint *)
  5925. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5926. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5927. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5928. END
  5929. END;
  5930. formalParameter := formalParameter.nextParameter
  5931. END;
  5932. (* for unary operators: complete the information for the second parameter *)
  5933. IF procedureType.numberParameters < 2 THEN
  5934. (* push 'NonPointer' *)
  5935. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5936. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5937. (* push 'NoType' *)
  5938. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5939. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5940. END;
  5941. (* call operator selection procedure *)
  5942. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5943. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5944. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5945. ReleaseOperand(operatorSelectionProcedureOperand);
  5946. (* use the address that the operator selection procedure returned as the target address of the call *)
  5947. InitOperand(operand, ModeValue);
  5948. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5949. Emit(Result(position,operand.op))
  5950. END
  5951. END;
  5952. ReleaseParameterRegisters();
  5953. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5954. SaveRegisters();ReleaseUsedRegisters(saved2);
  5955. CallThis(position,"Objects","LeaveA2",0);
  5956. RestoreRegisters(saved2);
  5957. END;
  5958. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5959. Emit(Call(position,operand.op,0));
  5960. ELSE
  5961. Emit(Call(position,operand.op,parametersSize));
  5962. END;
  5963. ReleaseOperand(operand);
  5964. IF procedureType.noReturn THEN
  5965. EmitTrap(position,NoReturnTrap);
  5966. END;
  5967. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5968. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5969. Emit(Result(position,return));
  5970. END;
  5971. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5972. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5973. Emit(Push(position, return));
  5974. CallThis(position,"Objects","ReenterA2",0);
  5975. Emit(Pop(position, return));
  5976. ELSE
  5977. CallThis(position,"Objects","ReenterA2",0);
  5978. END;
  5979. END;
  5980. (* === return parameter space === *)
  5981. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5982. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5983. (* cleanup all space for all parameters *)
  5984. IF parametersSize < 32 THEN
  5985. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5986. parametersSize := 32
  5987. END;
  5988. size := IntermediateCode.Immediate(addressType,parametersSize);
  5989. Emit(Add(position,sp,sp,size))
  5990. END;
  5991. IF (callingConvention IN SysvABI) THEN
  5992. IF parameterRegisters > 0 THEN
  5993. IF parameters.Length() > parameterRegisters THEN
  5994. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5995. ELSE
  5996. parametersSize := 0
  5997. END;
  5998. ELSE
  5999. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  6000. INC( parametersSize, (-parametersSize) MOD 16 )
  6001. END;
  6002. IF parametersSize > 0 THEN
  6003. size := IntermediateCode.Immediate(addressType,parametersSize);
  6004. Emit(Add(position,sp,sp,size))
  6005. END;
  6006. END;
  6007. IF alignment > 1 THEN
  6008. Emit(Pop(position,sp));
  6009. END;
  6010. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  6011. Emit(Pop(position, ap));
  6012. END;
  6013. IF firstWriteBackCall # NIL THEN
  6014. SaveRegisters(); ReleaseUsedRegisters(saved2);
  6015. (* perform all write-back calls in the list *)
  6016. currentWriteBackCall := firstWriteBackCall;
  6017. WHILE currentWriteBackCall # NIL DO
  6018. VisitProcedureCallDesignator(currentWriteBackCall.call);
  6019. currentWriteBackCall := currentWriteBackCall.next
  6020. END;
  6021. RestoreRegisters(saved2);
  6022. END;
  6023. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  6024. IF structuredReturnType THEN
  6025. RestoreRegisters(saved);
  6026. InitOperand(result,ModeReference);
  6027. Symbol(variable,result);
  6028. ELSE
  6029. RestoreRegisters(saved);
  6030. InitOperand(result,ModeValue);
  6031. result.op := return;
  6032. END;
  6033. END;
  6034. destination := dest;
  6035. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  6036. END VisitProcedureCallDesignator;
  6037. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  6038. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  6039. td: SyntaxTree.Symbol;
  6040. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  6041. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6042. BEGIN
  6043. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6044. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6045. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6046. variable.SetType(system.anyType);
  6047. scope.AddVariable(variable);
  6048. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6049. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  6050. typeDeclaration.SetDeclaredType(hiddenPointerType);
  6051. typeDeclaration.SetScope(module.module.moduleScope);
  6052. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  6053. hiddenPointerType.SetState(SyntaxTree.Resolved);
  6054. END;
  6055. RETURN hiddenPointerType;
  6056. END GetHiddenPointerType;
  6057. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  6058. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6059. BEGIN
  6060. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6061. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6062. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  6063. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  6064. scope.AddVariable(variable);
  6065. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6066. variable.SetType(system.anyType);
  6067. scope.AddVariable(variable);
  6068. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6069. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  6070. typeDeclaration.SetDeclaredType(delegatePointerType);
  6071. typeDeclaration.SetScope(module.module.moduleScope);
  6072. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  6073. delegatePointerType.SetState(SyntaxTree.Resolved);
  6074. END;
  6075. RETURN delegatePointerType
  6076. END GetDelegateType;
  6077. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  6078. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  6079. such as in VAR a: RECORD ... END;
  6080. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  6081. and variables, constants and procedures the same mechanism can be used for fixups etc.
  6082. *)
  6083. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  6084. baseRecord: SyntaxTree.RecordType;
  6085. BEGIN (* no code emission *)
  6086. source := NIL;
  6087. x := x.resolved;
  6088. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  6089. x := GetHiddenPointerType();
  6090. ELSIF IsDelegate(x) THEN
  6091. x := GetDelegateType();
  6092. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  6093. ELSE HALT(200);
  6094. END;
  6095. td := x.typeDeclaration;
  6096. IF td = NIL THEN
  6097. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  6098. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  6099. ASSERT(td # NIL);
  6100. END;
  6101. GetCodeSectionNameForSymbol(td,name);
  6102. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  6103. meta.CheckTypeDeclaration(x);
  6104. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  6105. ELSE
  6106. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  6107. END;
  6108. IF backend.cooperative OR meta.simple THEN
  6109. offset := 0;
  6110. ELSE
  6111. IF x IS SyntaxTree.CellType THEN
  6112. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  6113. IF baseRecord = NIL THEN
  6114. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  6115. ELSE
  6116. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  6117. END;
  6118. ELSE
  6119. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  6120. END;
  6121. END;
  6122. RETURN td
  6123. END GetBackendType;
  6124. BEGIN
  6125. (*td := t.typeDeclaration;*)
  6126. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  6127. (*
  6128. IF t IS SyntaxTree.PointerType THEN
  6129. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  6130. ELSE
  6131. source := GetBackendType(t);
  6132. END;
  6133. *)
  6134. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  6135. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  6136. IntermediateCode.SetOffset(res,offset);
  6137. (*
  6138. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  6139. make memory should be used when tag is used, not earlier
  6140. *)
  6141. RETURN res
  6142. END TypeDescriptorAdr;
  6143. (*
  6144. PROCEDURE MakeTypeTag(VAR operand: Operand);
  6145. VAR result: IntermediateCode.Operand;
  6146. BEGIN
  6147. IF operand.tag.mode = IntermediateCode.Undefined THEN
  6148. operand.tag := TypeDescriptorAdr(operand.type);
  6149. IntermediateCode.MakeMemory(operand.tag,addressType);
  6150. UseIntermediateOperand(operand.tag);
  6151. END;
  6152. END MakeTypeTag;
  6153. *)
  6154. PROCEDURE ProfilerInit;
  6155. VAR reg: IntermediateCode.Operand;
  6156. BEGIN
  6157. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  6158. Emit(Call(position,reg,0));
  6159. END ProfilerInit;
  6160. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  6161. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  6162. BEGIN
  6163. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  6164. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  6165. THEN
  6166. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6167. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6168. Emit(Push(position,reg));
  6169. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6170. Emit(Push(position,reg));
  6171. StaticCallOperand(result,procedure);
  6172. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6173. ReleaseOperand(result);
  6174. END;
  6175. END ProfilerEnterExit;
  6176. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  6177. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  6178. BEGIN
  6179. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  6180. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6181. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6182. profileInit.Emit(Push(position,reg));
  6183. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6184. profileInit.Emit(Push(position,reg));
  6185. NEW(string, LEN(name)); COPY(name, string^);
  6186. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6187. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6188. sv.SetType(type);
  6189. Designate(sv,result);
  6190. profileInit.Emit(Push(position,result.tag));
  6191. profileInit.Emit(Push(position,result.op));
  6192. StaticCallOperand(result,procedure);
  6193. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6194. ReleaseOperand(result);
  6195. END;
  6196. END ProfilerAddProcedure;
  6197. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  6198. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  6199. BEGIN
  6200. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  6201. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6202. profileInit.Emit(Push(position,reg));
  6203. profileInitPatchPosition := profileInit.pc;
  6204. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  6205. NEW(string, LEN(name)); COPY(name, string^);
  6206. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  6207. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6208. sv.SetType(type);
  6209. Designate(sv,result);
  6210. profileInit.Emit(Push(position,result.tag));
  6211. profileInit.Emit(Push(position,result.op));
  6212. StaticCallOperand(result,procedure);
  6213. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6214. ReleaseOperand(result);
  6215. END;
  6216. END ProfilerAddModule;
  6217. PROCEDURE ProfilerPatchInit;
  6218. VAR reg: IntermediateCode.Operand;
  6219. BEGIN
  6220. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  6221. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  6222. EmitLeave(profileInit,position,NIL,0);
  6223. profileInit.Emit(Exit(position,0,0,0));
  6224. END ProfilerPatchInit;
  6225. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  6226. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  6227. VAR
  6228. id: LONGINT;
  6229. leftType, rightType: SyntaxTree.Type;
  6230. procedureType: SyntaxTree.ProcedureType;
  6231. runtimeProcedure: SyntaxTree.Procedure;
  6232. runtimeProcedureOperand, operatorOperand: Operand;
  6233. kind: SET;
  6234. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  6235. VAR
  6236. arg: IntermediateCode.Operand;
  6237. recordType: SyntaxTree.RecordType;
  6238. fingerPrint: SyntaxTree.FingerPrint;
  6239. BEGIN
  6240. IF type = NIL THEN
  6241. (* no type: push 'NoType' *)
  6242. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6243. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  6244. ELSIF IsStrictlyPointerToRecord(type) THEN
  6245. (* pointer to record type: push typetag *)
  6246. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6247. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6248. arg := TypeDescriptorAdr(recordType);
  6249. ELSE
  6250. (* non-pointer to record type: push fingerprint *)
  6251. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6252. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  6253. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  6254. END;
  6255. operatorInitializationCodeSection.Emit(Push(position,arg))
  6256. END PushTypeInfo;
  6257. BEGIN
  6258. ASSERT(operatorInitializationCodeSection # NIL);
  6259. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  6260. procedureType := operator.type(SyntaxTree.ProcedureType);
  6261. (* determine types *)
  6262. leftType := procedureType.firstParameter.type;
  6263. IF procedureType.numberParameters = 2 THEN
  6264. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  6265. rightType := procedureType.firstParameter.nextParameter.type;
  6266. ELSE
  6267. rightType := NIL
  6268. END;
  6269. (* determine operator kind *)
  6270. IF IsStrictlyPointerToRecord(leftType) THEN
  6271. kind := {LhsIsPointer}
  6272. ELSE
  6273. kind := {}
  6274. END;
  6275. IF IsStrictlyPointerToRecord(rightType) THEN
  6276. kind := kind + {RhsIsPointer}
  6277. END;
  6278. IF kind # {} THEN (* TODO: to be removed later on *)
  6279. (* at least one of the types is a pointer to record *)
  6280. (* emit a code that registers this specific operator in the runtime *)
  6281. dump := operatorInitializationCodeSection.comments;
  6282. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6283. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  6284. (* push ID *)
  6285. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6286. id := Global.GetSymbol(module.module.case, operator.name);
  6287. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  6288. (* push kind *)
  6289. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6290. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  6291. (* push type infos *)
  6292. PushTypeInfo(leftType);
  6293. PushTypeInfo(rightType);
  6294. (* push operator address *)
  6295. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6296. StaticCallOperand(operatorOperand, operator);
  6297. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  6298. ReleaseOperand(operatorOperand);
  6299. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  6300. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  6301. ReleaseOperand(runtimeProcedureOperand)
  6302. END
  6303. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  6304. END
  6305. END RegisterDynamicOperator;
  6306. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  6307. VAR
  6308. traceModule: SyntaxTree.Module;
  6309. procedure: SyntaxTree.Procedure;
  6310. procedureVariable: SyntaxTree.Variable;
  6311. s,msg: Basic.MessageString;
  6312. res: Operand;
  6313. i: LONGINT;
  6314. sv: SyntaxTree.StringValue;
  6315. type: SyntaxTree.Type;
  6316. recordType: SyntaxTree.RecordType;
  6317. printout: Printout.Printer;
  6318. stringWriter: Streams.StringWriter;
  6319. expression: SyntaxTree.Expression;
  6320. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  6321. BEGIN
  6322. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  6323. IF procedure = NIL THEN
  6324. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  6325. END;
  6326. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  6327. s := "procedure ";
  6328. Strings.Append(s,backend.traceModuleName);
  6329. Strings.Append(s,".");
  6330. Strings.Append(s,procedureName);
  6331. Strings.Append(s," not present");
  6332. Error(position,s);
  6333. RETURN FALSE
  6334. ELSE
  6335. RETURN TRUE
  6336. END;
  6337. END GetProcedure;
  6338. PROCEDURE CallProcedure;
  6339. VAR size: LONGINT;
  6340. BEGIN
  6341. IF procedure # NIL THEN
  6342. StaticCallOperand(result,procedure);
  6343. size := ProcParametersSize(procedure);
  6344. ELSE
  6345. Symbol(procedureVariable, result);
  6346. LoadValue(result, procedureVariable.type.resolved);
  6347. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6348. END;
  6349. Emit(Call(position,result.op,size));
  6350. END CallProcedure;
  6351. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6352. VAR res: Operand; string: SyntaxTree.String;
  6353. BEGIN
  6354. IF GetProcedure("String") THEN
  6355. NEW(string, LEN(s)); COPY(s, string^);
  6356. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6357. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6358. sv.SetType(type);
  6359. Designate(sv,res);
  6360. Emit(Push(position,res.tag));
  6361. Emit(Push(position,res.op));
  6362. ReleaseOperand(res);
  6363. CallProcedure;
  6364. END;
  6365. END String;
  6366. PROCEDURE Integer(op: IntermediateCode.Operand);
  6367. BEGIN
  6368. IF GetProcedure("Int") THEN
  6369. Emit(Push(position,op));
  6370. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6371. CallProcedure;
  6372. END;
  6373. END Integer;
  6374. PROCEDURE Float(op: IntermediateCode.Operand);
  6375. BEGIN
  6376. IF GetProcedure("HIntHex") THEN
  6377. Emit(Push(position,op));
  6378. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6379. CallProcedure;
  6380. END;
  6381. END Float;
  6382. PROCEDURE Set(op: IntermediateCode.Operand);
  6383. BEGIN
  6384. IF GetProcedure("Set") THEN
  6385. Emit(Push(position,op));
  6386. (*
  6387. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6388. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6389. *)
  6390. CallProcedure;
  6391. END;
  6392. END Set;
  6393. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6394. BEGIN
  6395. IF GetProcedure("Boolean") THEN
  6396. Emit(Push(position,op));
  6397. CallProcedure;
  6398. END;
  6399. END Boolean;
  6400. PROCEDURE Char(op: IntermediateCode.Operand);
  6401. BEGIN
  6402. IF GetProcedure("Char") THEN
  6403. Emit(Push(position,op));
  6404. CallProcedure;
  6405. END;
  6406. END Char;
  6407. PROCEDURE Address(op: IntermediateCode.Operand);
  6408. BEGIN
  6409. IF GetProcedure("Address") THEN
  6410. Emit(Push(position,op));
  6411. CallProcedure;
  6412. END;
  6413. END Address;
  6414. PROCEDURE Size(op: IntermediateCode.Operand);
  6415. BEGIN
  6416. IF GetProcedure("Size") THEN
  6417. Emit(Push(position,op));
  6418. CallProcedure;
  6419. END;
  6420. END Size;
  6421. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6422. VAR len: IntermediateCode.Operand;
  6423. BEGIN
  6424. IF GetProcedure("String") THEN
  6425. len := GetArrayLength(type, op.tag);
  6426. Emit(Push(position,len));
  6427. ReleaseIntermediateOperand(len);
  6428. Emit(Push(position,op.op));
  6429. CallProcedure;
  6430. END;
  6431. END StringOperand;
  6432. PROCEDURE Ln;
  6433. BEGIN
  6434. IF GetProcedure("Ln") THEN
  6435. CallProcedure;
  6436. END;
  6437. END Ln;
  6438. BEGIN
  6439. IF backend.traceModuleName = "" THEN RETURN END;
  6440. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6441. IF GetProcedure("Enter") THEN
  6442. CallProcedure
  6443. END;
  6444. NEW(stringWriter,LEN(s));
  6445. FOR i := 0 TO x.Length()-1 DO
  6446. msg := "";
  6447. expression := x.GetExpression(i);
  6448. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6449. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6450. ELSE
  6451. Global.GetModuleName(module.module, s);
  6452. END;
  6453. IF i = 0 THEN
  6454. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6455. stringWriter.String(":");
  6456. END;
  6457. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6458. IF ~(expression IS SyntaxTree.StringValue) THEN
  6459. printout.Expression(expression);
  6460. stringWriter.Get(s);
  6461. Strings.Append(msg,s);
  6462. Strings.Append(msg,"= ");
  6463. ELSE stringWriter.Get(s); (* remove from string writer *)
  6464. Strings.Append(msg, s);
  6465. END;
  6466. String(msg);
  6467. IF SemanticChecker.IsStringType(expression.type) THEN
  6468. Designate(expression,res);
  6469. StringOperand(res, expression.type);
  6470. ELSE
  6471. Evaluate(expression,res);
  6472. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6473. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6474. Convert(res.op,int64);
  6475. END;
  6476. Integer(res.op);
  6477. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6478. Boolean(res.op);
  6479. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6480. Set(res.op);
  6481. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6482. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6483. Convert(res.op,float64);
  6484. END;
  6485. Float(res.op);
  6486. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6487. Char(res.op);
  6488. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6489. Address(res.op);String("H");
  6490. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6491. Size(res.op);
  6492. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6493. Address(res.op);String("H");
  6494. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6495. Address(res.op);String("H");
  6496. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6497. String("NIL");
  6498. ELSE HALT(200);
  6499. END;
  6500. END;
  6501. ReleaseOperand(res);
  6502. String("; ");
  6503. END;
  6504. IF GetProcedure("Exit") THEN
  6505. CallProcedure
  6506. ELSE
  6507. Ln;
  6508. END;
  6509. END;
  6510. END SystemTrace;
  6511. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6512. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6513. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6514. BEGIN
  6515. type := type.resolved;
  6516. IF type IS SyntaxTree.RecordType THEN
  6517. WITH type: SyntaxTree.RecordType DO
  6518. baseType := type.baseType;
  6519. IF baseType # NIL THEN
  6520. baseType := baseType.resolved;
  6521. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6522. InitFields(baseType,adr,offset);
  6523. END;
  6524. variable := type.recordScope.firstVariable;
  6525. WHILE variable # NIL DO
  6526. IF variable.initializer # NIL THEN
  6527. Evaluate(variable.initializer,initializerOp);
  6528. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6529. Emit(Mov(position,mem,initializerOp.op));
  6530. ReleaseOperand(initializerOp);
  6531. ReleaseIntermediateOperand(mem);
  6532. END;
  6533. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6534. variable := variable.nextVariable
  6535. END;
  6536. END;
  6537. ELSIF type IS SyntaxTree.CellType THEN
  6538. WITH type: SyntaxTree.CellType DO
  6539. baseType := type.baseType;
  6540. IF baseType # NIL THEN
  6541. baseType := baseType.resolved;
  6542. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6543. InitFields(baseType,adr,offset);
  6544. END;
  6545. variable := type.cellScope.firstVariable;
  6546. WHILE variable # NIL DO
  6547. IF variable.initializer # NIL THEN
  6548. Evaluate(variable.initializer,initializerOp);
  6549. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6550. Emit(Mov(position,mem,initializerOp.op));
  6551. ReleaseOperand(initializerOp);
  6552. ReleaseIntermediateOperand(mem);
  6553. END;
  6554. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6555. variable := variable.nextVariable
  6556. END;
  6557. END;
  6558. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6559. WITH type: SyntaxTree.ArrayType DO
  6560. IF type.form = SyntaxTree.Static THEN
  6561. baseType := type.arrayBase;
  6562. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6563. FOR i := 0 TO type.staticLength-1 DO
  6564. InitFields(baseType,adr,offset+i*size);
  6565. END;
  6566. END;
  6567. END;
  6568. ELSIF type IS SyntaxTree.MathArrayType THEN
  6569. WITH type: SyntaxTree.MathArrayType DO
  6570. IF type.form = SyntaxTree.Open THEN
  6571. dim := DynamicDim(type);
  6572. imm := IntermediateCode.Immediate(addressType,dim);
  6573. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6574. baseType := SemanticChecker.ArrayBase(type,dim);
  6575. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6576. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6577. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6578. ReleaseIntermediateOperand(imm);
  6579. (* flags remain empty (=0) for open array *)
  6580. ELSIF type.form = SyntaxTree.Static THEN
  6581. baseType := type.arrayBase;
  6582. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6583. ASSERT(type.staticLength < 1024*1024*1024);
  6584. FOR i := 0 TO type.staticLength-1 DO
  6585. InitFields(baseType,adr,offset+i*size);
  6586. END;
  6587. END;
  6588. END;
  6589. END;
  6590. END InitFields;
  6591. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6592. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6593. saved: RegisterEntry;
  6594. BEGIN
  6595. type := variable.type.resolved;
  6596. IF (type IS SyntaxTree.MathArrayType) THEN
  6597. WITH type: SyntaxTree.MathArrayType DO
  6598. IF type.form = SyntaxTree.Open THEN
  6599. Symbol(variable,operand);
  6600. InitFields(type, operand.tag,0);
  6601. IF temporary THEN
  6602. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6603. END;
  6604. ELSIF type.form = SyntaxTree.Tensor THEN
  6605. IF temporary & backend.writeBarriers THEN
  6606. SaveRegisters();ReleaseUsedRegisters(saved);
  6607. Symbol(variable, operand);
  6608. Emit(Push(position,operand.op));
  6609. ReleaseOperand(operand);
  6610. Emit(Push(position,nil));
  6611. CallThis(position,"FoxArrayBase","Assign",2);
  6612. RestoreRegisters(saved);
  6613. ELSE
  6614. Symbol(variable, operand);
  6615. MakeMemory(tmp,operand.op,addressType,0);
  6616. ReleaseOperand(operand);
  6617. IF FALSE & temporary THEN
  6618. (* trick -- temporary object from array base *)
  6619. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6620. Symbol(symbol,operand);
  6621. MakeMemory(mem,operand.op,addressType,0);
  6622. ReleaseOperand(operand);
  6623. Emit(Mov(position,tmp, mem) );
  6624. ReleaseOperand(operand);
  6625. ELSE
  6626. Emit(Mov(position,tmp, nil ) );
  6627. END;
  6628. ReleaseIntermediateOperand(tmp)
  6629. END;
  6630. END;
  6631. END;
  6632. ELSE
  6633. Symbol(variable,operand);
  6634. IF variable.initializer # NIL THEN
  6635. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6636. reference.SetType(variable.type.resolved);
  6637. reference.SetAssignable(TRUE);
  6638. Assign(reference,variable.initializer);
  6639. ELSIF temporary THEN
  6640. IF SemanticChecker.IsPointerType(variable.type) THEN
  6641. IF backend.cooperative THEN
  6642. SaveRegisters();ReleaseUsedRegisters(saved);
  6643. Symbol(variable, operand);
  6644. CallAssignPointer(operand.op, nil);
  6645. ReleaseOperand(operand);
  6646. RestoreRegisters(saved);
  6647. ELSIF backend.writeBarriers THEN
  6648. SaveRegisters();ReleaseUsedRegisters(saved);
  6649. Symbol(variable, operand);
  6650. Emit(Push(position,operand.op));
  6651. ReleaseOperand(operand);
  6652. Emit(Push(position,nil));
  6653. CallThis(position,"Heaps","Assign",2);
  6654. RestoreRegisters(saved);
  6655. ELSE
  6656. Symbol(variable, operand);
  6657. MakeMemory(tmp,operand.op,addressType,0);
  6658. ReleaseOperand(operand);
  6659. Emit(Mov(position,tmp, nil ) );
  6660. ReleaseIntermediateOperand(tmp);
  6661. END;
  6662. END;
  6663. END;
  6664. InitFields(type, operand.op,0);
  6665. ReleaseOperand(operand);
  6666. END;
  6667. END InitVariable;
  6668. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6669. VAR end: Label;
  6670. BEGIN
  6671. IF type.form = SyntaxTree.Tensor THEN
  6672. InitOperand(result,ModeValue);
  6673. ReuseCopy(result.op,base);
  6674. end := NewLabel();
  6675. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6676. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6677. SetLabel(end);
  6678. Convert(result.op,lenType);
  6679. ELSE
  6680. InitOperand(result,ModeValue);
  6681. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6682. END
  6683. END MathArrayDim;
  6684. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6685. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6686. BEGIN
  6687. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6688. MakeMemory(mem,base,addressType,offset);
  6689. Emit(Mov(position,mem,value));
  6690. ReleaseIntermediateOperand(mem);
  6691. END PutMathArrayField;
  6692. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6693. VAR mem: IntermediateCode.Operand;
  6694. BEGIN
  6695. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6696. MakeMemory(mem,base,addressType,offset);
  6697. Emit(Mov(position,mem,value));
  6698. ReleaseIntermediateOperand(mem);
  6699. END PutMathArrayFieldOffset;
  6700. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6701. BEGIN
  6702. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6703. MakeMemory(value,base,addressType,offset);
  6704. END GetMathArrayField;
  6705. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6706. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6707. BEGIN
  6708. IF incr THEN
  6709. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6710. ELSE
  6711. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6712. END;
  6713. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6714. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6715. ELSE
  6716. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6717. Emit(Mov(position,reg,dim));
  6718. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6719. Emit(Add(position,reg,reg,base));
  6720. MakeMemory(mem, reg, addressType, offset);
  6721. ReleaseIntermediateOperand(reg);
  6722. Emit(Mov(position,mem,value));
  6723. ReleaseIntermediateOperand(mem);
  6724. END;
  6725. END PutMathArrayLenOrIncr;
  6726. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6727. BEGIN
  6728. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6729. END PutMathArrayLength;
  6730. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6731. BEGIN
  6732. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6733. END PutMathArrayIncrement;
  6734. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6735. BEGIN
  6736. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6737. END GetMathArrayIncrement;
  6738. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6739. BEGIN
  6740. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6741. END GetMathArrayLength;
  6742. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6743. VAR dimOp: IntermediateCode.Operand;
  6744. BEGIN
  6745. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6746. GetMathArrayLength(type, operand, dimOp, check, result);
  6747. END GetMathArrayLengthAt;
  6748. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6749. VAR dimOp: IntermediateCode.Operand;
  6750. BEGIN
  6751. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6752. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6753. END GetMathArrayIncrementAt;
  6754. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6755. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6756. offset: LONGINT;
  6757. BEGIN
  6758. IF increment THEN
  6759. offset := MathIncrOffset;
  6760. ELSE
  6761. offset := MathLenOffset;
  6762. END;
  6763. INC(offset,operand.dimOffset*2);
  6764. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6765. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6766. END;
  6767. (* static dimension *)
  6768. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6769. IF check & (type.form = SyntaxTree.Tensor) THEN
  6770. DimensionCheck(operand.tag,dim,BrltL);
  6771. END;
  6772. val := SHORT(dim.intValue);
  6773. IF type.form # SyntaxTree.Tensor THEN
  6774. t := SemanticChecker.ArrayBase(type,val);
  6775. type := t.resolved(SyntaxTree.MathArrayType);
  6776. IF type.form = SyntaxTree.Static THEN
  6777. IF increment THEN
  6778. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6779. ELSE
  6780. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6781. END;
  6782. InitOperand(result,ModeValue);
  6783. result.op := res;
  6784. RETURN;
  6785. END;
  6786. END;
  6787. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6788. MakeMemory(res,operand.tag,addressType,offset);
  6789. (*
  6790. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6791. *)
  6792. InitOperand(result,ModeValue);
  6793. result.op := res;
  6794. ELSE
  6795. Convert(dim,addressType);
  6796. IF check THEN
  6797. IF type.form = SyntaxTree.Tensor THEN
  6798. DimensionCheck(operand.tag,dim,BrltL);
  6799. ELSIF isUnchecked THEN (* do nothing *)
  6800. ELSE
  6801. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6802. END;
  6803. END;
  6804. end := NewLabel(); next := NIL;
  6805. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6806. Emit(Mov(position,res,dim));
  6807. Convert(res,sizeType);
  6808. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6809. WHILE t IS SyntaxTree.MathArrayType DO
  6810. type := t(SyntaxTree.MathArrayType);
  6811. IF type.form = SyntaxTree.Static THEN
  6812. imm := IntermediateCode.Immediate(sizeType,val);
  6813. next := NewLabel();
  6814. BrneL(next,imm,res);
  6815. IF increment THEN
  6816. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6817. ELSE
  6818. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6819. END;
  6820. Emit(MovReplace(position,res,imm));
  6821. BrL(end);
  6822. ELSE hasDynamicPart := TRUE;
  6823. END;
  6824. t := type.arrayBase.resolved;
  6825. val := val + 1;
  6826. IF next # NIL THEN SetLabel(next) END;
  6827. END;
  6828. IF hasDynamicPart THEN
  6829. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6830. Emit(Mov(position,res2,dim));
  6831. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6832. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6833. Emit(Add(position,res2,res2,imm));
  6834. Emit(Add(position,res2,res2,operand.tag));
  6835. IntermediateCode.MakeMemory(res2,sizeType);
  6836. Emit(MovReplace(position,res,res2));
  6837. ReleaseIntermediateOperand(res2);
  6838. END;
  6839. SetLabel(end);
  6840. Convert(res,sizeType);
  6841. InitOperand(result,ModeValue);
  6842. result.op := res;
  6843. END;
  6844. END MathArrayLenOrIncr;
  6845. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6846. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6847. offset: LONGINT;
  6848. BEGIN
  6849. offset := operand.dimOffset+DynamicDim(type)-1;
  6850. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6851. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6852. val := SHORT(dim.intValue);
  6853. t := SemanticChecker.ArrayBase(type,val);
  6854. type := t.resolved(SyntaxTree.ArrayType);
  6855. IF type.form = SyntaxTree.Static THEN
  6856. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6857. ELSE
  6858. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6859. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6860. END;
  6861. UseIntermediateOperand(res);
  6862. InitOperand(result,ModeValue);
  6863. result.op := res;
  6864. ELSE
  6865. Convert(dim,addressType);
  6866. IF ~isUnchecked THEN
  6867. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6868. END;
  6869. end := NewLabel(); next := NIL;
  6870. (* ReuseCopy(dim,res); *)
  6871. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6872. Emit(Mov(position,res,dim));
  6873. Convert(res,sizeType);
  6874. Convert(res,sizeType);
  6875. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6876. WHILE t IS SyntaxTree.ArrayType DO
  6877. type := t(SyntaxTree.ArrayType);
  6878. IF type.form = SyntaxTree.Static THEN
  6879. imm := IntermediateCode.Immediate(sizeType,val);
  6880. next := NewLabel();
  6881. BrneL(next,imm,res);
  6882. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6883. Emit(MovReplace(position,res,imm));
  6884. BrL(end);
  6885. ELSE hasDynamicPart := TRUE;
  6886. END;
  6887. t := type.arrayBase.resolved;
  6888. val := val + 1;
  6889. IF next # NIL THEN SetLabel(next) END;
  6890. END;
  6891. IF hasDynamicPart THEN
  6892. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6893. Convert(res2,addressType);
  6894. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6895. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6896. Emit(Sub(position,res2,imm,res2));
  6897. Emit(Add(position,res2,res2,operand.tag));
  6898. IntermediateCode.MakeMemory(res2,sizeType);
  6899. Emit(MovReplace(position,res,res2));
  6900. ReleaseIntermediateOperand(res2);
  6901. END;
  6902. SetLabel(end);
  6903. Convert(res,sizeType);
  6904. InitOperand(result,ModeValue);
  6905. result.op := res;
  6906. END;
  6907. END ArrayLen;
  6908. (**
  6909. create a temporary variable in current scope
  6910. **)
  6911. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6912. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6913. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6914. BEGIN
  6915. IF ~register THEN
  6916. v := temporaries.GetFreeVariable(type, untraced, index);
  6917. ELSE
  6918. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6919. END;
  6920. scope := currentScope;
  6921. IF (scope IS SyntaxTree.ProcedureScope) & (scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).noPAF) THEN
  6922. Error(scope(SyntaxTree.ProcedureScope).ownerProcedure.position,"implementation restriction: cannot allocate temporary variable in procedure without activation frame");
  6923. END;
  6924. (*
  6925. v := NIL; (* disable free variable managemenet for the time being *)
  6926. *)
  6927. name := temporaries.GetUID();
  6928. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6929. variable.SetType(type);
  6930. variable.SetAccess(SyntaxTree.Hidden);
  6931. variable.SetUntraced(untraced);
  6932. IF v = NIL THEN
  6933. temporaries.AddVariable(variable);
  6934. IF ~register THEN
  6935. IF scope.lastVariable # NIL THEN
  6936. offset := scope.lastVariable.offsetInBits;
  6937. ELSE
  6938. offset := 0;
  6939. END;
  6940. DEC(offset,system.SizeOf(variable.type));
  6941. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6942. variable(SyntaxTree.Variable).SetOffset(offset);
  6943. scope.AddVariable(variable(SyntaxTree.Variable));
  6944. scope.EnterSymbol(variable, duplicate);
  6945. ASSERT(~duplicate);
  6946. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6947. ELSE
  6948. variable.SetUseRegister(TRUE);
  6949. variable(SyntaxTree.Variable).SetOffset(0);
  6950. END;
  6951. ELSE (* v # NIL *)
  6952. (* reuse slot for new variable, do not create new slot ! *)
  6953. temporaries.SetVariable(index, variable);
  6954. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6955. ASSERT(~register);
  6956. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6957. ASSERT(v.offsetInBits # 0);
  6958. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6959. scope.EnterSymbol(variable, duplicate);
  6960. ASSERT(~duplicate);
  6961. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6962. END;
  6963. RETURN variable(SyntaxTree.Variable)
  6964. END GetTemporaryVariable;
  6965. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6966. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6967. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6968. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6969. i: LONGINT; duplicate: BOOLEAN;
  6970. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6971. VAR variable: SyntaxTree.Variable;
  6972. BEGIN
  6973. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6974. variable.SetType(type);
  6975. recordScope.AddVariable(variable);
  6976. END AddVariable;
  6977. BEGIN
  6978. name := "@ArrayDescriptor";
  6979. Basic.AppendNumber(name,dimensions);
  6980. identifier := SyntaxTree.NewIdentifier(name);
  6981. parentScope := module.module.moduleScope;
  6982. symbol := parentScope.FindSymbol(identifier);
  6983. IF symbol # NIL THEN
  6984. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6985. type := typeDeclaration.declaredType;
  6986. ELSE
  6987. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6988. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6989. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6990. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6991. recordType.SetTypeDeclaration(typeDeclaration);
  6992. recordType.SetState(SyntaxTree.Resolved);
  6993. typeDeclaration.SetDeclaredType(recordType);
  6994. AddVariable("@ptr",system.anyType);
  6995. AddVariable("@adr",system.addressType);
  6996. AddVariable("@flags",system.addressType);
  6997. AddVariable("@dim",system.addressType);
  6998. AddVariable("@elementSize",system.addressType);
  6999. FOR i := 0 TO dimensions-1 DO
  7000. name := "@len";
  7001. Basic.AppendNumber(name,i);
  7002. AddVariable(name,system.addressType);
  7003. name := "@incr";
  7004. Basic.AppendNumber(name,i);
  7005. AddVariable(name,system.addressType);
  7006. END;
  7007. parentScope.AddTypeDeclaration(typeDeclaration);
  7008. parentScope.EnterSymbol(typeDeclaration,duplicate);
  7009. ASSERT(~duplicate);
  7010. type := recordType;
  7011. END;
  7012. RETURN type
  7013. END GetMathArrayDescriptorType;
  7014. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  7015. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  7016. BEGIN
  7017. NEW(string, LEN(s)); COPY(s, string^);
  7018. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  7019. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  7020. sv.SetType(type);
  7021. Designate(sv,res);
  7022. Emit(Push(position,res.tag));
  7023. Emit(Push(position,res.op));
  7024. ReleaseOperand(res);
  7025. END PushConstString;
  7026. PROCEDURE PushConstBoolean(b: BOOLEAN);
  7027. BEGIN
  7028. IF b THEN
  7029. Emit(Push(Basic.invalidPosition, true));
  7030. ELSE
  7031. Emit(Push(Basic.invalidPosition, false));
  7032. END;
  7033. END PushConstBoolean;
  7034. PROCEDURE PushConstSet(v: SET);
  7035. VAR value: SyntaxTree.Value; op: Operand;
  7036. BEGIN
  7037. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  7038. value.SetType(system.setType);
  7039. Evaluate(value, op);
  7040. Emit(Push(Basic.invalidPosition, op.op));
  7041. ReleaseOperand(op);
  7042. END PushConstSet;
  7043. PROCEDURE PushConstInteger(v: LONGINT);
  7044. VAR value: SyntaxTree.Value; op: Operand;
  7045. BEGIN
  7046. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  7047. value.SetType(system.longintType);
  7048. Evaluate(value, op);
  7049. Emit(Push(Basic.invalidPosition, op.op));
  7050. ReleaseOperand(op);
  7051. END PushConstInteger;
  7052. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  7053. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  7054. section: IntermediateCode.Section;
  7055. BEGIN
  7056. procedureScope := SyntaxTree.NewProcedureScope(scope);
  7057. Global.GetSymbolSegmentedName(symbol, name);
  7058. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  7059. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  7060. procedure.SetScope(moduleScope);
  7061. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  7062. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  7063. procedure.SetAccess(SyntaxTree.Hidden);
  7064. currentScope := procedureScope;
  7065. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  7066. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  7067. RETURN section;
  7068. END OpenInitializer;
  7069. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  7070. BEGIN
  7071. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  7072. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  7073. section := prev;
  7074. END CloseInitializer;
  7075. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  7076. VAR name: SyntaxTree.IdentifierString;
  7077. parameter: SyntaxTree.Parameter;
  7078. type: SyntaxTree.Type;
  7079. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  7080. BEGIN
  7081. InitOperand(op,ModeReference);
  7082. op.op := fp;
  7083. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  7084. Dereference(op, x, FALSE);
  7085. result := op;
  7086. Symbol(symbol, op);
  7087. END Field;
  7088. PROCEDURE Direction(direction: LONGINT): SET;
  7089. BEGIN
  7090. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  7091. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  7092. ELSE HALT(100);
  7093. END;
  7094. END Direction;
  7095. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7096. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7097. BEGIN
  7098. Field(port, op);
  7099. ToMemory(op.op,addressType,0);
  7100. Emit(Push(Basic.invalidPosition, op.op));
  7101. ReleaseOperand(op);
  7102. Basic.GetString(modifier.identifier, name);
  7103. PushConstString(name);
  7104. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7105. ASSERT(SemanticChecker.IsStringType(value.type));
  7106. Designate(value, op);
  7107. Emit(Push(modifier.position, op.tag));
  7108. Emit(Push(modifier.position, op.op));
  7109. ReleaseOperand(op);
  7110. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  7111. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7112. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7113. Evaluate(value, op);
  7114. Emit(Push(modifier.position, op.op));
  7115. ReleaseOperand(op);
  7116. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  7117. ELSE
  7118. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  7119. END;
  7120. END AddPortProperty;
  7121. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  7122. VAR modifier: SyntaxTree.Modifier;
  7123. BEGIN
  7124. modifier := parameter.modifiers;
  7125. WHILE modifier # NIL DO
  7126. AddPortProperty(parameter,modifier, modifier.expression);
  7127. modifier := modifier.nextModifier;
  7128. END;
  7129. END AddPortProperties;
  7130. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  7131. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  7132. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  7133. PROCEDURE PushLens(type: SyntaxTree.Type);
  7134. BEGIN
  7135. IF IsSemiDynamicArray(type) THEN
  7136. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7137. Evaluate(type(SyntaxTree.ArrayType).length, op);
  7138. Emit(Push(Basic.invalidPosition, op.op));
  7139. ReleaseOperand(op);
  7140. INC(dim);
  7141. ELSIF IsStaticArray(type) THEN
  7142. len := len * type(SyntaxTree.ArrayType).staticLength;
  7143. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7144. INC(dim);
  7145. ELSE
  7146. baseType := type;
  7147. END;
  7148. END PushLens;
  7149. BEGIN
  7150. (* cell *)
  7151. IF parameter.type IS SyntaxTree.ArrayType THEN
  7152. type := parameter.type;
  7153. dim := 0;
  7154. len := 1;
  7155. PushLens(type);
  7156. portType := baseType.resolved(SyntaxTree.PortType);
  7157. ELSE
  7158. portType := parameter.type(SyntaxTree.PortType);
  7159. END;
  7160. PushSelfPointer();
  7161. (* port / array of ports *)
  7162. IF IsStaticArray(type) THEN
  7163. PushConstInteger(len);
  7164. END;
  7165. Field(parameter, op);
  7166. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7167. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  7168. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  7169. Designate(d, op);*)
  7170. Emit(Push(Basic.invalidPosition, op.op));
  7171. ReleaseOperand(op);
  7172. (* name *)
  7173. PushConstString(name);
  7174. (* inout *)
  7175. PushConstSet(Direction(portType.direction));
  7176. (* width *)
  7177. PushConstInteger(portType.sizeInBits);
  7178. IF parameter.type IS SyntaxTree.PortType THEN
  7179. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  7180. AddPortProperties(parameter);
  7181. ELSIF IsStaticArray(type)THEN
  7182. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  7183. ELSIF IsSemiDynamicArray(type) THEN
  7184. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7185. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  7186. Emit(Add(position,reg, sp, size));
  7187. (* dim *)
  7188. PushConstInteger(dim);
  7189. (* len array *)
  7190. Emit(Push(position, reg));
  7191. ReleaseIntermediateOperand(reg);
  7192. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  7193. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  7194. Emit(Add(position, sp,sp, size));
  7195. ELSE
  7196. HALT(100);
  7197. END;
  7198. END Parameter;
  7199. BEGIN
  7200. IF backend.cellsAreObjects THEN
  7201. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  7202. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  7203. END;
  7204. parameter := x.firstParameter;
  7205. WHILE (parameter # NIL) DO
  7206. type := parameter.type.resolved;
  7207. WHILE (type IS SyntaxTree.ArrayType) DO
  7208. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7209. END;
  7210. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  7211. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  7212. Parameter(name,parameter);
  7213. END;
  7214. parameter := parameter.nextParameter;
  7215. END;
  7216. ELSE HALT(200)
  7217. END;
  7218. END AddPorts;
  7219. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  7220. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  7221. BEGIN
  7222. Symbol(cell,op);
  7223. ToMemory(op.op,addressType,0);
  7224. Emit(Push(position,op.op));
  7225. ReleaseOperand(op);
  7226. property.GetName(name);
  7227. (* does not work when inheritance is used:
  7228. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  7229. *)
  7230. PushConstString(name);
  7231. IF (value # NIL) THEN
  7232. ASSERT(
  7233. SemanticChecker.IsStringType(property.type)
  7234. OR (property.type.resolved IS SyntaxTree.IntegerType)
  7235. OR (property.type.resolved IS SyntaxTree.FloatType)
  7236. OR (property.type.resolved IS SyntaxTree.BooleanType)
  7237. OR (property.type.resolved IS SyntaxTree.SetType)
  7238. );
  7239. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7240. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  7241. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  7242. Designate(d, op);
  7243. IF SemanticChecker.IsStringType(property.type) THEN
  7244. Emit(Push(Basic.invalidPosition, op.tag))
  7245. END;
  7246. Emit(Push(Basic.invalidPosition, op.op));
  7247. ReleaseOperand(op);
  7248. END;
  7249. IF value = NIL THEN
  7250. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  7251. ELSIF SemanticChecker.IsStringType(property.type) THEN
  7252. ASSERT(SemanticChecker.IsStringType(value.type));
  7253. Designate(value, op);
  7254. PushString(op, value.type);
  7255. ReleaseOperand(op);
  7256. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  7257. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  7258. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7259. Evaluate(value, op);
  7260. Emit(Push(property.position, op.op));
  7261. ReleaseOperand(op);
  7262. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  7263. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  7264. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  7265. Evaluate(value, op);
  7266. Emit(Push(property.position, op.op));
  7267. ReleaseOperand(op);
  7268. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  7269. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  7270. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  7271. Evaluate(value, op);
  7272. Emit(Push(property.position, op.op));
  7273. ReleaseOperand(op);
  7274. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  7275. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  7276. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  7277. Evaluate(value, op);
  7278. Emit(Push(property.position, op.op));
  7279. ReleaseOperand(op);
  7280. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  7281. ELSE
  7282. HALT(200);
  7283. END;
  7284. END AddProperty;
  7285. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  7286. VAR symbol: SyntaxTree.Symbol;
  7287. BEGIN
  7288. WHILE modifier # NIL DO
  7289. symbol := cellType.FindProperty(modifier.identifier);
  7290. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  7291. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  7292. modifier := modifier.nextModifier;
  7293. END;
  7294. END AddModifiers;
  7295. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7296. VAR last: SyntaxTree.Modifier;
  7297. BEGIN
  7298. IF to = NIL THEN
  7299. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  7300. ELSE
  7301. last := to;
  7302. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  7303. last := last.nextModifier;
  7304. END;
  7305. IF last.identifier # this.identifier THEN
  7306. ASSERT(last.nextModifier = NIL);
  7307. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  7308. END;
  7309. END;
  7310. END AppendModifier;
  7311. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7312. BEGIN
  7313. WHILE this # NIL DO
  7314. AppendModifier(to, this);
  7315. this := this.nextModifier;
  7316. END;
  7317. END AppendModifiers;
  7318. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  7319. VAR base: SyntaxTree.Type;
  7320. BEGIN
  7321. AppendModifiers(to, c.modifiers);
  7322. base := c.GetBaseValueType();
  7323. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  7324. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  7325. END;
  7326. END AppendCellTypeModifiers;
  7327. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7328. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7329. BEGIN
  7330. Basic.GetString(modifier.identifier, name);
  7331. PushConstString(name);
  7332. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7333. ASSERT(SemanticChecker.IsStringType(value.type));
  7334. Designate(value, op);
  7335. PushString(op, value.type);
  7336. ReleaseOperand(op);
  7337. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7338. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7339. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7340. Evaluate(value, op);
  7341. Emit(Push(modifier.position, op.op));
  7342. ReleaseOperand(op);
  7343. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7344. ELSE
  7345. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7346. END;
  7347. END AddPortProperty;
  7348. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7349. BEGIN
  7350. WHILE modifier # NIL DO
  7351. AddPortProperty(modifier, modifier.expression);
  7352. modifier := modifier.nextModifier;
  7353. END;
  7354. END AddPortProperties;
  7355. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7356. VAR op: Operand;
  7357. BEGIN
  7358. Evaluate(p, op);
  7359. Emit(Push(p.position, op.op));
  7360. ReleaseOperand(op);
  7361. IF p IS SyntaxTree.Designator THEN
  7362. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7363. END;
  7364. END PushPort;
  7365. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7366. VAR tmp: IntermediateCode.Operand;
  7367. BEGIN
  7368. actualType := actualType.resolved;
  7369. IF actualType IS SyntaxTree.StringType THEN
  7370. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7371. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7372. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7373. ELSE
  7374. tmp := op.tag;
  7375. IntermediateCode.MakeMemory(tmp,addressType);
  7376. Emit(Push(position,tmp));
  7377. END;
  7378. Emit(Push(position,op.op))
  7379. END PushString;
  7380. (* conservative check if x is potentially on the heap, excluding the module heap
  7381. required for generational garbage collector
  7382. *)
  7383. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7384. BEGIN
  7385. RETURN TRUE;
  7386. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7387. passed by reference.
  7388. pos := x.position.start;
  7389. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7390. x := x(SyntaxTree.Designator).left;
  7391. END;
  7392. RETURN x # NIL;
  7393. *)
  7394. END OnHeap;
  7395. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7396. VAR
  7397. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7398. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7399. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7400. tmp:IntermediateCode.Operand;
  7401. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,ignore: Label;
  7402. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7403. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7404. dest: IntermediateCode.Operand;
  7405. staticLength: LONGINT; itype: IntermediateCode.Type;
  7406. convert,isTensor: BOOLEAN;
  7407. recordType: SyntaxTree.RecordType;
  7408. baseType: SyntaxTree.Type;
  7409. left: SyntaxTree.Expression;
  7410. call: SyntaxTree.Designator;
  7411. procedure: SyntaxTree.Procedure;
  7412. temporaryVariable: SyntaxTree.Variable;
  7413. dummy: IntermediateCode.Operand;
  7414. customBuiltin: SyntaxTree.CustomBuiltin;
  7415. isVarPar: ARRAY 3 OF BOOLEAN;
  7416. callsection: Sections.Section;
  7417. segmentedName: Basic.SegmentedName;
  7418. needsTrace: BOOLEAN;
  7419. n: ARRAY 256 OF CHAR;
  7420. modifier: SyntaxTree.Modifier;
  7421. previous, init: IntermediateCode.Section;
  7422. prevScope: SyntaxTree.Scope;
  7423. firstPar: LONGINT;
  7424. saved: RegisterEntry;
  7425. callingConvention: SyntaxTree.CallingConvention;
  7426. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7427. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7428. priority: IntermediateCode.Operand;
  7429. op,callop: Operand;
  7430. BEGIN
  7431. IF type = NIL THEN RETURN END;
  7432. type := type.resolved;
  7433. IF type IS SyntaxTree.PointerType THEN
  7434. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7435. END;
  7436. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7437. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7438. recordScope := type(SyntaxTree.RecordType).recordScope;
  7439. IF recordScope.bodyProcedure # NIL THEN
  7440. procedure := recordScope.bodyProcedure;
  7441. body := procedure.procedureScope.body;
  7442. Emit(Push(position,self));
  7443. IF body.isActive THEN
  7444. StaticCallOperand(callop,procedure);
  7445. Emit(Push(position,callop.op));
  7446. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7447. Convert(priority,sizeType);
  7448. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7449. END;
  7450. Emit(Push(position,priority));
  7451. ReleaseIntermediateOperand(priority);
  7452. IF backend.cooperative THEN
  7453. Emit(Push(position,self));
  7454. CallThis(position,"Activities","Create",3)
  7455. ELSE
  7456. flags := 0;
  7457. IF body.isSafe THEN
  7458. flags := 1;
  7459. END;
  7460. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7461. Emit(Push(position,self));
  7462. CallThis(position,"Objects","CreateProcess",4)
  7463. END;
  7464. ELSE
  7465. Emit(Push(position,self));
  7466. StaticCallOperand(callop,procedure);
  7467. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7468. END;
  7469. Emit(Pop(position,self));
  7470. END;
  7471. END CallBodies;
  7472. PROCEDURE PushTD(type: SyntaxTree.Type);
  7473. VAR op: IntermediateCode.Operand;
  7474. BEGIN
  7475. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7476. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7477. ELSE
  7478. IF type.resolved IS SyntaxTree.PointerType THEN
  7479. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7480. END;
  7481. op := TypeDescriptorAdr(type.resolved);
  7482. Emit(Push(position,op));
  7483. END
  7484. END PushTD;
  7485. BEGIN
  7486. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7487. dest := destination; destination := emptyOperand;
  7488. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7489. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7490. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7491. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7492. CASE x.id OF
  7493. (* ---- COPY ----- *)
  7494. |Global.Copy:
  7495. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7496. (* ---- EXCL, INCL----- *)
  7497. |Global.Excl,Global.Incl:
  7498. Evaluate(p0,s0);
  7499. Evaluate(p1,s1);
  7500. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7501. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7502. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7503. END;
  7504. ReuseCopy(res,s0.op);
  7505. ReleaseOperand(s0);
  7506. Reuse1(tmp,s1.op);
  7507. ReleaseOperand(s1);
  7508. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7509. IF x.id = Global.Excl THEN
  7510. Emit(Not(position,tmp,tmp));
  7511. Emit(And(position,res,res,tmp));
  7512. ELSE
  7513. Emit(Or(position,res,res,tmp));
  7514. END;
  7515. ReleaseIntermediateOperand(tmp);
  7516. Designate(p0,s0);
  7517. ToMemory(s0.op,s1.op.type,0);
  7518. Emit(Mov(position,s0.op,res));
  7519. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7520. (* ---- DISPOSE ----- *)
  7521. |Global.Dispose:
  7522. Designate(p0,s0);
  7523. Emit(Push(position,s0.op));
  7524. ReleaseOperand(s0);
  7525. CallThis(position,"Runtime","Dispose", 1);
  7526. (* ---- GETPROCEDURE ----- *)
  7527. |Global.GetProcedure:
  7528. Designate(p0,s0);
  7529. PushString(s0,p0.type);
  7530. Designate(p1,s1);
  7531. PushString(s1,p1.type);
  7532. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7533. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7534. ELSE PushTD(procedureType.firstParameter.type)
  7535. END;
  7536. PushTD(procedureType.returnType);
  7537. Designate(p2,s2);
  7538. Emit(Push(position,s2.op));
  7539. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7540. CallThis(position,"Modules","GetProcedure", 7);
  7541. (* ---- ASH, LSH, ROT ----- *)
  7542. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7543. Evaluate(p0,s0);
  7544. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7545. (* make unsigned arguments in order to produced a logical shift *)
  7546. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7547. convert:= TRUE;
  7548. itype := s0.op.type;
  7549. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7550. Convert(s0.op,itype);
  7551. ELSE
  7552. convert := FALSE;
  7553. END;
  7554. END;
  7555. Evaluate(p1,s1);
  7556. IF IsIntegerConstant(p1,hint) THEN
  7557. ReuseCopy(reg,s0.op);
  7558. IF hint > 0 THEN
  7559. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7560. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7561. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7562. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7563. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7564. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7565. END;
  7566. ELSIF hint < 0 THEN
  7567. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7568. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7569. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7570. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7571. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7572. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7573. END;
  7574. END;
  7575. ReleaseOperand(s0); ReleaseOperand(s1);
  7576. ELSE
  7577. exit := NewLabel();
  7578. end := NewLabel();
  7579. ReuseCopy(reg,s0.op);
  7580. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7581. Reuse1(tmp,s1.op);
  7582. Emit(Neg(position,tmp,s1.op));
  7583. Convert(tmp,s1.op.type);
  7584. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7585. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7586. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7587. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7588. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7589. END;
  7590. ReleaseIntermediateOperand(tmp);
  7591. BrL(end);
  7592. SetLabel(exit);
  7593. ReuseCopy(tmp,s1.op);
  7594. Convert(tmp,s1.op.type);
  7595. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7596. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7597. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7598. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7599. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7600. END;
  7601. ReleaseIntermediateOperand(tmp);
  7602. SetLabel(end);
  7603. ReleaseOperand(s0); ReleaseOperand(s1);
  7604. END;
  7605. InitOperand(result,ModeValue);
  7606. IF convert THEN
  7607. itype := reg.type;
  7608. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7609. Convert(reg,itype);
  7610. END;
  7611. result.op := reg;
  7612. (* ---- CAP ----- *)
  7613. |Global.Cap:
  7614. Evaluate(p0,result);
  7615. ReuseCopy(reg,result.op);
  7616. ReleaseIntermediateOperand(result.op);
  7617. ignore := NewLabel();
  7618. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7619. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7620. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7621. SetLabel(ignore);
  7622. result.op := reg;
  7623. (* ---- CHR ----- *)
  7624. |Global.Chr, Global.Chr32:
  7625. Evaluate(p0,result);
  7626. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7627. |Global.Entier, Global.EntierH:
  7628. Evaluate(p0,result);
  7629. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7630. (* ---- MIN and MAX ----- *)
  7631. |Global.Max,Global.Min:
  7632. Evaluate(p0,s0);
  7633. Evaluate(p1,s1);
  7634. Reuse2(res,s0.op,s1.op);
  7635. else := NewLabel();
  7636. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7637. ELSE BrltL(else,s1.op,s0.op) END;
  7638. Emit(Mov(position,res,s0.op));
  7639. ReleaseOperand(s0);
  7640. end := NewLabel();
  7641. BrL(end);
  7642. SetLabel(else);
  7643. Emit(MovReplace(position,res,s1.op));
  7644. SetLabel(end);
  7645. ReleaseOperand(s1);
  7646. InitOperand(result,ModeValue);
  7647. result.op := res;
  7648. (* ---- ODD ----- *)
  7649. |Global.Odd:
  7650. Evaluate(p0,result);
  7651. Reuse1(res,result.op);
  7652. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7653. ReleaseIntermediateOperand(result.op);
  7654. result.op := res;
  7655. Convert(result.op,bool);
  7656. (* ---- ORD ----- *)
  7657. |Global.Ord, Global.Ord32:
  7658. Evaluate(p0,result);
  7659. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7660. (* ---- SHORT, LONG ----- *)
  7661. |Global.Short, Global.Long:
  7662. Evaluate(p0,result);
  7663. IF x.type IS SyntaxTree.ComplexType THEN
  7664. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7665. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7666. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7667. ELSE
  7668. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7669. END
  7670. (* ---- HALT, SYSTEM.HALT----- *)
  7671. |Global.Halt, Global.systemHalt:
  7672. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7673. EmitTrap (position, val);
  7674. (* ---- ASSERT ----- *)
  7675. |Global.Assert:
  7676. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7677. trueL := NewLabel();
  7678. Condition(p0,trueL,TRUE);
  7679. IF p1 = NIL THEN val := AssertTrap
  7680. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7681. END;
  7682. EmitTrap(position,val);
  7683. SetLabel(trueL);
  7684. END;
  7685. (*
  7686. Emit(TrapC(result.op,val);
  7687. *)
  7688. (* ---- INC, DEC----- *)
  7689. |Global.Inc,Global.Dec:
  7690. Expression(p0); adr := result.op;
  7691. s0 := result;
  7692. LoadValue(result,p0.type);
  7693. (* EXPERIMENTAL *)
  7694. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7695. availableSymbols[s0.availability].inMemory := FALSE;
  7696. END;
  7697. l := result;
  7698. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7699. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7700. END;
  7701. IF x.id = Global.Inc THEN
  7702. Emit(Add(position,l.op,l.op,r.op));
  7703. ELSE
  7704. Emit(Sub(position,l.op,l.op,r.op));
  7705. END;
  7706. ReleaseOperand(l); ReleaseOperand(r);
  7707. (* ---- LEN ----- *)
  7708. |Global.Len: (* dynamic length, static length done by checker *)
  7709. Designate(p0,operand);
  7710. IF p1 = NIL THEN
  7711. InitOperand(l,ModeValue);
  7712. l.op := IntermediateCode.Immediate(sizeType,0);
  7713. ELSE
  7714. Evaluate(p1,l);
  7715. END;
  7716. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7717. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7718. Dereference(operand, p0.type.resolved, FALSE);
  7719. END;
  7720. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7721. ReleaseOperand(operand); ReleaseOperand(l);
  7722. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7723. ASSERT(p1 # NIL);
  7724. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7725. Dereference(operand,p0.type.resolved,FALSE);
  7726. END;
  7727. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7728. ReleaseOperand(operand); ReleaseOperand(l);
  7729. ELSE HALT(100);
  7730. END;
  7731. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7732. (* ---- FIRST ---- *)
  7733. |Global.First:
  7734. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7735. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7736. ELSE
  7737. Designate(p0, result)
  7738. END
  7739. (* ---- LAST ---- *)
  7740. |Global.Last:
  7741. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7742. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7743. ELSE
  7744. Designate(p0, result);
  7745. (* make sure result.op is a register *)
  7746. tmp := result.op;
  7747. ReuseCopy(result.op, result.op);
  7748. ReleaseIntermediateOperand(tmp);
  7749. (* add offset to result.op *)
  7750. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7751. END
  7752. (* ---- STEP ---- *)
  7753. |Global.Step:
  7754. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7755. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7756. ELSE
  7757. Designate(p0, result);
  7758. (* make sure result.op is a register *)
  7759. tmp := result.op;
  7760. ReuseCopy(result.op, result.op);
  7761. ReleaseIntermediateOperand(tmp);
  7762. (* add offset to result.op *)
  7763. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7764. END
  7765. (* ---- RE ---- *)
  7766. |Global.Re:
  7767. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7768. Designate(p0, result)
  7769. ELSE
  7770. Evaluate(p0, result)
  7771. END
  7772. (* ---- IM ---- *)
  7773. |Global.Im:
  7774. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7775. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7776. Designate(p0, result);
  7777. (* make sure result.op is a register *)
  7778. tmp := result.op;
  7779. ReuseCopy(result.op, result.op);
  7780. ReleaseIntermediateOperand(tmp);
  7781. (* add offset to result.op *)
  7782. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7783. (* ---- ABS ----- *)
  7784. |Global.Abs:
  7785. Evaluate(p0,operand);
  7786. type := p0.type.resolved;
  7787. InitOperand(result,ModeValue);
  7788. Reuse1a(result.op,operand.op,dest);
  7789. Emit(Abs(position,result.op,operand.op));
  7790. ReleaseOperand(operand);
  7791. (* ---- WAIT ----- *)
  7792. |Global.Wait:
  7793. Evaluate(p0,operand);
  7794. Emit(Push(position,operand.op));
  7795. ReleaseOperand(operand);
  7796. CallThis(position,"Activities","Wait", 1);
  7797. (* ---- NEW ----- *)
  7798. |Global.New:
  7799. (*! the following code is only correct for "standard" Oberon calling convention *)
  7800. IF x.type # NIL THEN
  7801. type := x.type.resolved;
  7802. firstPar := 0;
  7803. ELSE
  7804. type := p0.type.resolved;
  7805. firstPar := 1;
  7806. END;
  7807. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7808. THEN
  7809. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7810. IF backend.cooperative THEN
  7811. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7812. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7813. IF recordType.isObject THEN
  7814. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7815. IF recordType.IsActive() THEN
  7816. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7817. END;
  7818. IF recordType.IsProtected() THEN
  7819. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7820. END;
  7821. ELSE
  7822. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7823. END;
  7824. END;
  7825. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7826. CallThis(position,"Runtime","New", 1);
  7827. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7828. Emit(Result(position, pointer));
  7829. exit := NewLabel();
  7830. BreqL(exit,pointer,nil);
  7831. GetRecordTypeName (recordType,name);
  7832. IF ~recordType.isObject THEN
  7833. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7834. END;
  7835. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7836. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7837. IF recordType.isObject THEN
  7838. IF recordType.IsProtected() THEN
  7839. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7840. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7841. END;
  7842. IF recordType.IsActive() THEN
  7843. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7844. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7845. END;
  7846. END;
  7847. (* initialize fields *)
  7848. IF type(SyntaxTree.PointerType).isPlain THEN
  7849. size := 0;
  7850. ELSIF recordType.isObject THEN
  7851. size := BaseObjectTypeSize;
  7852. ELSE
  7853. size := BaseRecordTypeSize;
  7854. END;
  7855. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7856. (* call initializer *)
  7857. constructor := GetConstructor(recordType);
  7858. IF constructor # NIL THEN
  7859. (*! should be unified with ProcedureCallDesignator *)
  7860. Emit(Push(position,pointer));
  7861. ReleaseIntermediateOperand(pointer);
  7862. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7863. FOR i := firstPar TO x.parameters.Length()-1 DO
  7864. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7865. formalParameter := formalParameter.nextParameter;
  7866. END;
  7867. (* static call of the constructor *)
  7868. GetCodeSectionNameForSymbol(constructor,name);
  7869. ASSERT(~constructor.isInline);
  7870. IF constructor.scope.ownerModule # module.module THEN
  7871. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7872. ELSE
  7873. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7874. END;
  7875. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7876. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7877. Emit(Pop(position,pointer));
  7878. END;
  7879. (* call bodies *)
  7880. CallBodies(pointer,type);
  7881. SetLabel(exit);
  7882. needsTrace := p0.NeedsTrace();
  7883. IF needsTrace THEN ModifyAssignments(true) END;
  7884. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7885. Emit(Push(position, pointer));
  7886. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7887. Emit(Pop(position, pointer));
  7888. END;
  7889. Designate(p0,l);
  7890. IF needsTrace THEN
  7891. CallAssignPointer(l.op, pointer);
  7892. ELSE
  7893. ToMemory(l.op,addressType,0);
  7894. Emit(Mov(position,l.op,pointer));
  7895. END;
  7896. ReleaseIntermediateOperand(pointer);
  7897. ReleaseOperand(l);
  7898. IF needsTrace THEN ModifyAssignments(false) END;
  7899. ELSE (* not cooperative backend *)
  7900. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7901. IF temporaryVariable # NIL THEN
  7902. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7903. ELSE
  7904. Designate(p0,l);
  7905. END;
  7906. (* l.op contains address of pointer to record *)
  7907. Emit(Push(position,l.op)); (* address for use after syscall *)
  7908. Emit(Push(position,l.op));
  7909. ReleaseOperand(l);
  7910. (* push type descriptor *)
  7911. reg := TypeDescriptorAdr(recordType);
  7912. Emit(Push(position,reg));
  7913. ReleaseIntermediateOperand(reg);
  7914. (* push realtime flag *)
  7915. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7916. ELSE Emit(Push(position,false));
  7917. END;
  7918. CallThis(position,"Heaps","NewRec", 3);
  7919. (* check allocation success, if not successful then do not call initializers and bodies *)
  7920. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7921. Emit(Pop(position,pointer));
  7922. MakeMemory(reg,pointer,addressType,0);
  7923. ReleaseIntermediateOperand(pointer);
  7924. pointer := reg;
  7925. exit := NewLabel();
  7926. BreqL(exit,pointer,nil);
  7927. Emit(Push(position,pointer));
  7928. (* initialize fields *)
  7929. InitFields(recordType, pointer,0);
  7930. (* call initializer *)
  7931. constructor := GetConstructor(recordType);
  7932. IF constructor # NIL THEN
  7933. (*! should be unified with ProcedureCallDesignator *)
  7934. Emit(Push(position,pointer));
  7935. ReleaseIntermediateOperand(pointer);
  7936. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7937. FOR i := firstPar TO x.parameters.Length()-1 DO
  7938. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7939. formalParameter := formalParameter.nextParameter;
  7940. END;
  7941. (* static call of the constructor *)
  7942. GetCodeSectionNameForSymbol(constructor,name);
  7943. ASSERT(~constructor.isInline);
  7944. IF constructor.scope.ownerModule # module.module THEN
  7945. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7946. ELSE
  7947. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7948. END;
  7949. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7950. ELSE
  7951. ReleaseIntermediateOperand(pointer);
  7952. END;
  7953. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7954. Emit(Pop(position,pointer));
  7955. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7956. Designate(p0,l);
  7957. IF backend.writeBarriers & OnHeap(p0) THEN
  7958. SaveRegisters();ReleaseUsedRegisters(saved);
  7959. Emit(Push(position,l.op));
  7960. Emit(Push(position,pointer));
  7961. CallThis(position,"Heaps","Assign",2);
  7962. RestoreRegisters(saved);
  7963. ELSE
  7964. ToMemory(l.op,addressType,0);
  7965. Emit(Mov(position,l.op,pointer));
  7966. END;
  7967. ReleaseOperand(l);
  7968. result.tag := emptyOperand;
  7969. ELSIF (x.type # NIL) THEN
  7970. result := l; (* temporary variable is the result of NEW Type() *)
  7971. END;
  7972. (* call bodies *)
  7973. CallBodies(pointer,type);
  7974. ReleaseIntermediateOperand(pointer);
  7975. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7976. end := NewLabel();
  7977. BrL(end);
  7978. SetLabel(exit);
  7979. Designate(p0,l);
  7980. ToMemory(l.op,addressType,0);
  7981. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7982. ReleaseOperand(l);
  7983. SetLabel(end);
  7984. ELSE
  7985. SetLabel(exit);
  7986. END;
  7987. END;
  7988. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7989. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7990. IF ~backend.cooperative THEN (* simpler version *)
  7991. (*
  7992. push len0
  7993. push len1
  7994. push len2
  7995. push len_size
  7996. push len_adr
  7997. push tag
  7998. push static elements
  7999. push element size
  8000. push adr
  8001. *)
  8002. dim := 0;
  8003. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8004. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8005. parameter := x.parameters.GetExpression(i);
  8006. Evaluate(parameter,r);
  8007. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8008. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8009. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8010. END;
  8011. Emit(Push(position,r.op));
  8012. ReleaseOperand(r);
  8013. INC(dim);
  8014. END;
  8015. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8016. Emit(Mov(position, adr, sp));
  8017. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8018. Emit(Push(position, adr));
  8019. ReleaseIntermediateOperand(adr);
  8020. openDim := dim;
  8021. staticLength := 1;
  8022. IF type IS SyntaxTree.ArrayType THEN
  8023. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8024. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8025. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8026. END;
  8027. END;
  8028. IF SemanticChecker.ContainsPointer(type) THEN
  8029. tmp := TypeDescriptorAdr(type);
  8030. ELSE
  8031. tmp := nil;
  8032. END;
  8033. Emit(Push(position,tmp)); (* type descriptor *)
  8034. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  8035. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  8036. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  8037. Designate(p0,l);
  8038. Emit(Push(position,l.op)); (* address *)
  8039. ReleaseOperand(l);
  8040. CallThis(position,"Heaps","NewArray", 6);
  8041. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8042. Emit(Add(position,sp,sp,tmp));
  8043. ELSE
  8044. dim := 0;
  8045. IntermediateCode.InitOperand(reg);
  8046. IF p1 # NIL THEN
  8047. FOR i := firstPar TO x.parameters.Length()-1 DO
  8048. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8049. parameter := x.parameters.GetExpression(i);
  8050. Evaluate(parameter,r);
  8051. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8052. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8053. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8054. END;
  8055. Emit(Push(position,r.op));
  8056. IF i=1 THEN
  8057. CopyInt(reg,r.op);
  8058. ELSE
  8059. MulInt(reg, reg, r.op);
  8060. END;
  8061. ReleaseOperand(r);
  8062. INC(dim);
  8063. END;
  8064. Convert(reg,addressType);
  8065. ELSE
  8066. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8067. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  8068. END;
  8069. openDim := dim;
  8070. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  8071. IF backend.cooperative THEN
  8072. size := ToMemoryUnits(system,system.SizeOf(type));
  8073. WHILE type IS SyntaxTree.ArrayType DO
  8074. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8075. END;
  8076. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  8077. IF (size # 1) THEN
  8078. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8079. END;
  8080. Emit(Push(position,reg));
  8081. size := ToMemoryUnits(system,system.SizeOf(type));
  8082. IF (size # 1) THEN
  8083. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8084. END;
  8085. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  8086. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  8087. Emit(Push(position,reg));
  8088. ReleaseIntermediateOperand(reg);
  8089. CallThis(position,"Runtime","New", 1);
  8090. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8091. Emit(Result(position, pointer));
  8092. exit := NewLabel();
  8093. else := NewLabel();
  8094. BreqL(else,pointer,nil);
  8095. IF ~type.hasPointers THEN
  8096. Basic.ToSegmentedName ("BaseTypes.Array",name);
  8097. ELSIF type IS SyntaxTree.RecordType THEN
  8098. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  8099. ELSIF type IS SyntaxTree.ProcedureType THEN
  8100. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  8101. ELSE
  8102. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  8103. END;
  8104. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  8105. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  8106. 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))));
  8107. IF type IS SyntaxTree.RecordType THEN
  8108. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  8109. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  8110. ELSE
  8111. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  8112. END;
  8113. i := openDim;
  8114. WHILE i > 0 DO
  8115. DEC (i);
  8116. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  8117. END;
  8118. needsTrace := p0.NeedsTrace();
  8119. IF needsTrace THEN ModifyAssignments(true) END;
  8120. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  8121. Emit(Push(position, pointer));
  8122. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  8123. Emit(Pop(position, pointer));
  8124. END;
  8125. Designate(p0,l);
  8126. IF needsTrace THEN
  8127. CallAssignPointer(l.op, pointer);
  8128. ModifyAssignments(false);
  8129. ELSE
  8130. ToMemory(l.op,addressType,0);
  8131. Emit(Mov(position,l.op,pointer));
  8132. END;
  8133. ReleaseIntermediateOperand(pointer);
  8134. ReleaseOperand(l);
  8135. BrL(exit);
  8136. SetLabel(else);
  8137. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  8138. Designate(p0,l);
  8139. IF needsTrace THEN
  8140. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  8141. ELSE
  8142. ToMemory(l.op,addressType,0);
  8143. Emit(Mov(position,l.op,pointer));
  8144. END;
  8145. ReleaseOperand(l);
  8146. SetLabel(exit);
  8147. ELSE
  8148. (*! the following code is only correct for "standard" Oberon calling convention *)
  8149. IF SemanticChecker.ContainsPointer(type) THEN
  8150. IF type IS SyntaxTree.ArrayType THEN
  8151. staticLength := 1;
  8152. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8153. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8154. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8155. END;
  8156. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  8157. MulInt(reg,reg,tmp);
  8158. END;
  8159. Designate(p0,l);
  8160. IF openDim > 0 THEN
  8161. Emit(Push(position,l.op)); (* address for use after syscall *)
  8162. END;
  8163. Emit(Push(position,l.op)); (* address *)
  8164. ReleaseOperand(l);
  8165. tmp := TypeDescriptorAdr(type);
  8166. Emit(Push(position,tmp)); (* type descriptor *)
  8167. ReleaseIntermediateOperand(tmp);
  8168. Emit(Push(position,reg)); (* number Elements *)
  8169. ReleaseIntermediateOperand(reg);
  8170. tmp := IntermediateCode.Immediate(addressType,dim);
  8171. Emit(Push(position,tmp)); (* dimensions *)
  8172. (* push realtime flag *)
  8173. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8174. ELSE Emit(Push(position,false));
  8175. END;
  8176. CallThis(position,"Heaps","NewArr",5)
  8177. ELSE
  8178. size := ToMemoryUnits(system,system.SizeOf(type));
  8179. IF (size # 1) THEN
  8180. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  8181. (*
  8182. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  8183. *)
  8184. END;
  8185. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  8186. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  8187. AddInt(reg, reg, tmp);
  8188. (*
  8189. Emit(Add(position,reg,reg,tmp));
  8190. *)
  8191. Designate(p0,l);
  8192. IF openDim >0 THEN
  8193. Emit(Push(position,l.op)); (* address for use after syscall *)
  8194. END;
  8195. Emit(Push(position,l.op)); (* address for syscall *)
  8196. ReleaseOperand(l); (* pointer address *)
  8197. Emit(Push(position,reg)); (* size *)
  8198. ReleaseIntermediateOperand(reg);
  8199. (* push realtime flag *)
  8200. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8201. ELSE Emit(Push(position,false));
  8202. END;
  8203. CallThis(position,"Heaps","NewSys", 3)
  8204. END;
  8205. IF openDim > 0 THEN
  8206. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8207. Emit(Pop(position,adr));
  8208. ToMemory(adr,addressType,0);
  8209. ReuseCopy(tmp,adr);
  8210. ReleaseIntermediateOperand(adr);
  8211. adr := tmp;
  8212. else := NewLabel();
  8213. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  8214. i := openDim-1;
  8215. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8216. WHILE (i >= 0) DO
  8217. Emit(Pop(position,reg));
  8218. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  8219. Emit(Mov(position,res,reg));
  8220. DEC(i);
  8221. END;
  8222. ReleaseIntermediateOperand(adr);
  8223. ReleaseIntermediateOperand(reg);
  8224. exit := NewLabel();
  8225. BrL(exit);
  8226. SetLabel(else);
  8227. (* else part: array could not be allocated *)
  8228. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  8229. Emit(Add(position,sp,sp,tmp));
  8230. SetLabel(exit);
  8231. END;
  8232. END;
  8233. END;
  8234. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8235. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  8236. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  8237. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8238. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8239. callingConvention := procedureType.callingConvention;
  8240. left.SetType(procedure.type);
  8241. formalParameter := procedureType.firstParameter;
  8242. (* push array to allocate *)
  8243. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  8244. formalParameter :=formalParameter.nextParameter;
  8245. (* push length array *)
  8246. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  8247. (* push size *)
  8248. type := t0;
  8249. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  8250. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8251. END;
  8252. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  8253. Emit(Push(position,tmp));
  8254. (* *)
  8255. IF SemanticChecker.ContainsPointer(type) THEN
  8256. tmp := TypeDescriptorAdr(type);
  8257. ELSE
  8258. tmp := IntermediateCode.Immediate(addressType, 0);
  8259. END;
  8260. Emit(Push(position,tmp)); (* type descriptor *)
  8261. StaticCallOperand(result,procedure);
  8262. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8263. ReleaseOperand(result);
  8264. END;
  8265. (*
  8266. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  8267. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  8268. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  8269. *)
  8270. ELSE
  8271. (*
  8272. push len0
  8273. push len1
  8274. push len2
  8275. push size
  8276. push len_adr
  8277. push element_size
  8278. push tag
  8279. push adr
  8280. *)
  8281. dim := 0;
  8282. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8283. isTensor := TRUE;
  8284. ELSE
  8285. isTensor := FALSE;
  8286. END;
  8287. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8288. IF ~isTensor THEN
  8289. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8290. END;
  8291. parameter := x.parameters.GetExpression(i);
  8292. Evaluate(parameter,r);
  8293. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8294. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8295. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8296. END;
  8297. Emit(Push(position,r.op));
  8298. ReleaseOperand(r);
  8299. INC(dim);
  8300. END;
  8301. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8302. Emit(Mov(position, adr, sp));
  8303. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8304. Emit(Push(position, adr));
  8305. ReleaseIntermediateOperand(adr);
  8306. openDim := dim;
  8307. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  8308. IF isTensor THEN
  8309. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  8310. ELSE
  8311. baseType := SemanticChecker.ArrayBase(type,openDim);
  8312. END;
  8313. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  8314. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  8315. IF SemanticChecker.ContainsPointer(baseType) THEN
  8316. tmp := TypeDescriptorAdr(baseType);
  8317. ELSE
  8318. tmp := nil;
  8319. END;
  8320. Emit(Push(position,tmp)); (* type descriptor *)
  8321. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  8322. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  8323. ELSE (* error message has already been emited *)
  8324. RETURN;
  8325. END;
  8326. Designate(p0,l);
  8327. IF isTensor THEN
  8328. Emit(Push(position,l.op)); (* address *)
  8329. ELSE
  8330. Emit(Push(position,l.tag)); (* address *)
  8331. END;
  8332. ReleaseOperand(l);
  8333. StaticCallOperand(result,procedure);
  8334. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8335. ReleaseOperand(result);
  8336. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8337. Emit(Add(position,sp,sp,tmp));
  8338. END;
  8339. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8340. THEN
  8341. IF ~backend.cellsAreObjects THEN RETURN END;
  8342. IF InCellScope(currentScope) THEN
  8343. PushSelfPointer()
  8344. ELSE
  8345. Emit(Push(position, nil));
  8346. END;
  8347. (* push temp address *)
  8348. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8349. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8350. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8351. (* l.op contains address of pointer to record *)
  8352. Emit(Push(position,l.op)); (* address for use after syscall *)
  8353. ReleaseOperand(l);
  8354. (* push type descriptor *)
  8355. reg := TypeDescriptorAdr(baseType);
  8356. Emit(Push(position,reg));
  8357. ReleaseIntermediateOperand(reg);
  8358. (* push name *)
  8359. (*Global.GetSymbolName(p0, n);*)
  8360. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8361. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8362. ELSE
  8363. Global.GetModuleName(module.module, n);
  8364. END;
  8365. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8366. (*type.typeDeclaration.GetName(n);*)
  8367. PushConstString(n);
  8368. (* push cellnet boolean *)
  8369. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8370. (* push engine boolean *)
  8371. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8372. (* allocate *)
  8373. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8374. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8375. (* l.op contains address of pointer to record *)
  8376. ToMemory(l.op,addressType,0);
  8377. (* l.op contains value of pointer to record *)
  8378. InitFields(baseType, l.op,0);
  8379. (* add capabilities *)
  8380. modifier := p0(SyntaxTree.Designator).modifiers;
  8381. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8382. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8383. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8384. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8385. END;
  8386. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8387. (*
  8388. modifier := baseType(SyntaxTree.CellType).modifiers;
  8389. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8390. modifier := p0(SyntaxTree.Designator).modifiers;
  8391. *)
  8392. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8393. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8394. (* l.op contains address of pointer to record *)
  8395. ToMemory(l.op,addressType,0);
  8396. (* l.op contains value of pointer to record *)
  8397. Emit(Push(position,l.op)); (* address for use after syscall *)
  8398. ReleaseOperand(l);
  8399. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8400. prevScope := currentScope;
  8401. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8402. previous := section;
  8403. section := init;
  8404. (* add ports *)
  8405. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8406. CloseInitializer(previous);
  8407. currentScope := prevScope;
  8408. Symbol(temporaryVariable,l);
  8409. ToMemory(l.op,addressType,0);
  8410. Emit(Push(position,l.op));
  8411. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8412. (*
  8413. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8414. IF constructor # NIL THEN
  8415. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8416. FOR i := 1 TO x.parameters.Length()-1 DO
  8417. p := x.parameters.GetExpression(i);
  8418. Global.GetSymbolName(parameter,name);
  8419. Evaluate(p, value);
  8420. ASSERT(value.type # NIL);
  8421. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8422. par := instance.AddParameter(name);
  8423. par.SetInteger(value.integer);
  8424. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8425. par := instance.AddParameter(name);
  8426. par.SetBoolean(value.boolean);
  8427. ELSE Error(x.position,NotYetImplemented)
  8428. END;
  8429. parameter := parameter.nextParameter
  8430. END;
  8431. END;
  8432. *)
  8433. (* call initializer *)
  8434. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8435. IF constructor # NIL THEN
  8436. (*! should be unified with ProcedureCallDesignator *)
  8437. IF backend.cellsAreObjects THEN
  8438. Symbol(temporaryVariable,l);
  8439. ToMemory(l.op,addressType,0);
  8440. Emit(Push(position,l.op));
  8441. ReleaseOperand(l);
  8442. END;
  8443. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8444. FOR i := firstPar TO x.parameters.Length()-1 DO
  8445. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8446. formalParameter := formalParameter.nextParameter;
  8447. END;
  8448. (* static call of the constructor *)
  8449. Global.GetSymbolSegmentedName(constructor,name);
  8450. ASSERT(~constructor.isInline);
  8451. IF constructor.scope.ownerModule # module.module THEN
  8452. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8453. ELSE
  8454. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8455. END;
  8456. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8457. (*ELSE
  8458. ReleaseIntermediateOperand(pointer);*)
  8459. END;
  8460. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8461. ToMemory(l.op, addressType, 0);
  8462. Designate(p0,s0);
  8463. ToMemory(s0.op,addressType,0);
  8464. Emit(Mov(position,s0.op,l.op));
  8465. ReleaseOperand(l);
  8466. ReleaseOperand(s0);
  8467. result.tag := emptyOperand;
  8468. (* start *)
  8469. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8470. (* push cell *)
  8471. Symbol(temporaryVariable, l);
  8472. ToMemory(l.op,addressType,0);
  8473. Emit(Push(Basic.invalidPosition,l.op));
  8474. (* push delegate *)
  8475. Emit(Push(Basic.invalidPosition,l.op));
  8476. ReleaseOperand(l);
  8477. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8478. Emit(Push(position, s1.op));
  8479. ReleaseOperand(s1);
  8480. CallThis(position,"ActiveCellsRuntime","Start",3);
  8481. END;
  8482. (*IF temporaryVariable # NIL THEN
  8483. end := NewLabel();
  8484. BrL(end);
  8485. SetLabel(exit);
  8486. Designate(p0,l);
  8487. ToMemory(l.op,addressType,0);
  8488. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8489. ReleaseOperand(l);
  8490. SetLabel(end);
  8491. ELSE
  8492. SetLabel(exit);
  8493. END;
  8494. *)
  8495. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8496. ELSE (* no pointer to record, no pointer to array *)
  8497. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8498. (* ignore new statement *)
  8499. Warning(p0.position, "cannot run on final hardware");
  8500. ELSE
  8501. HALT(200);
  8502. END;
  8503. END;
  8504. (* ---- ADDRESSOF----- *)
  8505. |Global.systemAdr:
  8506. Designate(p0,s0);
  8507. s0.mode := ModeValue;
  8508. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8509. ReleaseIntermediateOperand(s0.op);
  8510. s0.op := s0.tag;
  8511. IntermediateCode.InitOperand(s0.tag);
  8512. END;
  8513. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8514. result := s0;
  8515. (* ---- BIT ----- *)
  8516. |Global.systemBit:
  8517. Evaluate(p0,s0);
  8518. ToMemory(s0.op,addressType,0);
  8519. ReuseCopy(res,s0.op);
  8520. ReleaseOperand(s0);
  8521. Evaluate(p1,s1);
  8522. Emit(Ror(position,res,res,s1.op));
  8523. ReleaseOperand(s1);
  8524. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8525. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8526. InitOperand(result,ModeValue);
  8527. result.op := res;
  8528. (* --- MSK ----*)
  8529. |Global.systemMsk:
  8530. Evaluate(p0,s0);
  8531. Evaluate(p1,s1);
  8532. ReuseCopy(res,s0.op);
  8533. ReleaseOperand(s0);
  8534. Emit(And(position,res,res,s1.op));
  8535. ReleaseOperand(s1);
  8536. InitOperand(result,ModeValue);
  8537. result.op := res;
  8538. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8539. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8540. Evaluate(p0,s0);
  8541. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8542. ReleaseOperand(s0);
  8543. InitOperand(result,ModeValue);
  8544. result.op := res;
  8545. (* ---- SYSTEM.GetStackPointer ----- *)
  8546. |Global.systemGetStackPointer:
  8547. InitOperand(result,ModeValue);
  8548. result.op := sp;
  8549. (* ---- SYSTEM.GetFramePointer ----- *)
  8550. |Global.systemGetFramePointer:
  8551. InitOperand(result,ModeValue);
  8552. result.op := fp;
  8553. (* ---- SYSTEM.GetActivity ----- *)
  8554. |Global.systemGetActivity:
  8555. ASSERT(backend.cooperative);
  8556. InitOperand(result,ModeValue);
  8557. result.op := ap;
  8558. (* ---- SYSTEM.SetStackPointer ----- *)
  8559. |Global.systemSetStackPointer:
  8560. Evaluate(p0,s0); (* *)
  8561. Emit(Mov(position,sp,s0.op));
  8562. ReleaseOperand(s0);
  8563. (* ---- SYSTEM.SetFramePointer ----- *)
  8564. |Global.systemSetFramePointer:
  8565. Evaluate(p0,s0); (* *)
  8566. Emit(Mov(position,fp,s0.op));
  8567. ReleaseOperand(s0);
  8568. (* ---- SYSTEM.Activity ----- *)
  8569. |Global.systemSetActivity:
  8570. ASSERT(backend.cooperative);
  8571. Evaluate(p0,s0); (* *)
  8572. Emit(Mov(position,ap,s0.op));
  8573. ReleaseOperand(s0);
  8574. (* ---- SYSTEM.VAL ----- *)
  8575. |Global.systemVal:
  8576. Expression(p1);
  8577. s1 := result;
  8578. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8579. IF s1.mode = ModeReference THEN
  8580. (* nothing to be done if not record type, just take over new type *)
  8581. IF (type IS SyntaxTree.RecordType) THEN
  8582. ReleaseIntermediateOperand(s1.tag);
  8583. s1.tag := TypeDescriptorAdr(type);
  8584. UseIntermediateOperand(s1.tag);
  8585. END;
  8586. result := s1;
  8587. ELSE (* copy over result to different type, may not use convert *)
  8588. itype := IntermediateCode.GetType(system,type);
  8589. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8590. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8591. Emit(Mov(position,s0.op,s1.op));
  8592. ReleaseOperand(s1);
  8593. InitOperand(result,ModeValue);
  8594. result.op := s0.op;
  8595. ELSE (* different size, must convert *)
  8596. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8597. Convert(s1.op, IntermediateCode.GetType(system,type));
  8598. result := s1;
  8599. END;
  8600. END;
  8601. (* ---- SYSTEM.GET ----- *)
  8602. |Global.systemGet:
  8603. Evaluate(p0,s0); (* adr *)
  8604. Designate(p1,s1); (* variable *)
  8605. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8606. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8607. Emit(Mov(position,s1.op,s0.op));
  8608. ReleaseOperand(s1);
  8609. ReleaseOperand(s0);
  8610. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8611. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8612. Evaluate(p0,s0); (* *)
  8613. Evaluate(p1,s1); (* variable *)
  8614. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8615. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8616. (* real part *)
  8617. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8618. Emit(Mov(position,res, s1.op));
  8619. ReleaseIntermediateOperand(res);
  8620. (* imaginary part *)
  8621. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8622. Emit(Mov(position,res, s1.tag));
  8623. ReleaseIntermediateOperand(res);
  8624. ReleaseOperand(s1);
  8625. ReleaseOperand(s0);
  8626. ELSE
  8627. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8628. ReleaseOperand(s0);
  8629. Emit(Mov(position,res,s1.op));
  8630. ReleaseIntermediateOperand(res);
  8631. ReleaseOperand(s1);
  8632. END;
  8633. (* ---- SYSTEM.MOVE ----- *)
  8634. |Global.systemMove:
  8635. Evaluate(p0,s0);
  8636. Evaluate(p1,s1);
  8637. Evaluate(p2,s2);
  8638. Emit(Copy(position,s1.op,s0.op,s2.op));
  8639. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8640. (* ---- SYSTEM.NEW ----- *)
  8641. |Global.systemNew:
  8642. Designate(p0,s0);
  8643. Emit(Push(position,s0.op));
  8644. ReleaseOperand(s0);
  8645. Evaluate(p1,s1);
  8646. Emit(Push(position,s1.op));
  8647. ReleaseOperand(s1);
  8648. (* push realtime flag: false by default *)
  8649. Emit(Push(position,false));
  8650. CallThis(position,"Heaps","NewSys",3);
  8651. (* ---- SYSTEM.CALL ----- *)
  8652. |Global.systemRef:
  8653. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8654. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8655. s0.mode := ModeValue;
  8656. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8657. result := s0
  8658. (* ---- INCR ----- *)
  8659. |Global.Incr:
  8660. Designate(p0,operand);
  8661. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8662. Dereference(operand,p0.type.resolved,FALSE);
  8663. END;
  8664. ASSERT(p1 # NIL);
  8665. Evaluate(p1,l);
  8666. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8667. ReleaseOperand(operand); ReleaseOperand(l);
  8668. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8669. (* ---- SUM ----- *)
  8670. |Global.Sum: HALT(200);
  8671. (* ---- ALL ----- *)
  8672. |Global.All: HALT(200);
  8673. (* ---- CAS ----- *)
  8674. |Global.Cas:
  8675. needsTrace := p0.NeedsTrace();
  8676. IF needsTrace THEN ModifyAssignments(true) END;
  8677. Designate(p0,s0);
  8678. Evaluate(p1,s1);
  8679. Evaluate(p2,s2);
  8680. IF needsTrace THEN
  8681. Emit(Push(position, s0.op));
  8682. Emit(Push(position, s1.op));
  8683. Emit(Push(position, s2.op));
  8684. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8685. ELSE
  8686. Emit(Cas(position,s0.op,s1.op,s2.op));
  8687. END;
  8688. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8689. IF needsTrace THEN ModifyAssignments(false) END;
  8690. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8691. Emit(Result(position, res));
  8692. result.op := res;
  8693. result.mode := ModeValue;
  8694. (*
  8695. IF conditional THEN
  8696. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8697. BrL(falseLabel);
  8698. ReleaseIntermediateOperand(res);
  8699. END;
  8700. *)
  8701. (* ---- DIM ----- *)
  8702. |Global.Dim:
  8703. Designate(p0,s0);
  8704. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8705. Dereference(s0,p0.type.resolved,FALSE);
  8706. END;
  8707. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8708. ReleaseOperand(s0);
  8709. (* ---- RESHAPE ----- *)
  8710. |Global.Reshape:
  8711. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8712. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8713. left.SetType(procedure.type);
  8714. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8715. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8716. END;
  8717. (* ---- SYSTEM.TYPECODE ----- *)
  8718. |Global.systemTypeCode:
  8719. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8720. IF type.resolved IS SyntaxTree.PointerType THEN
  8721. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8722. END;
  8723. result.op := TypeDescriptorAdr(type);
  8724. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8725. result.mode := ModeValue;
  8726. (* ---- SYSTEM.TRACE ----- *)
  8727. |Global.systemTrace:
  8728. SystemTrace(x.parameters, x.position);
  8729. (* ----- CONNECT ------*)
  8730. |Global.Connect:
  8731. IF backend.cellsAreObjects THEN
  8732. PushPort(p0);
  8733. PushPort(p1);
  8734. IF p2 # NIL THEN
  8735. Evaluate(p2, s2);
  8736. Emit(Push(p2.position, s2.op));
  8737. ReleaseOperand(s2);
  8738. ELSE
  8739. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8740. END;
  8741. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8742. ELSE
  8743. Warning(x.position, "cannot run on final hardware");
  8744. END;
  8745. (* ----- DELEGATE ------*)
  8746. |Global.Delegate:
  8747. IF backend.cellsAreObjects THEN
  8748. PushPort(p0);
  8749. PushPort(p1);
  8750. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8751. ELSE
  8752. Warning(x.position, "cannot run on final hardware");
  8753. END;
  8754. (* ----- SEND ------*)
  8755. |Global.Send:
  8756. Evaluate(p0,s0);
  8757. Evaluate(p1,s1);
  8758. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8759. Emit(Push(position,s0.op));
  8760. Emit(Push(position,s1.op));
  8761. (*
  8762. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8763. *)
  8764. IF ~backend.cellsAreObjects THEN
  8765. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8766. END;
  8767. ReleaseOperand(s0);
  8768. ReleaseOperand(s1);
  8769. IF backend.cellsAreObjects THEN
  8770. CallThis(position,"ActiveCellsRuntime","Send",2);
  8771. ELSE
  8772. CallThis(position,ChannelModuleName,"Send",2);
  8773. END;
  8774. (* ----- RECEIVE ------*)
  8775. |Global.Receive:
  8776. Evaluate(p0,s0);
  8777. Emit(Push(position,s0.op));
  8778. Designate(p1,s1);
  8779. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8780. Emit(Push(position,s1.op));
  8781. IF p2 # NIL THEN
  8782. Designate(p2,s2);
  8783. Emit(Push(position,s2.op));
  8784. END;
  8785. (*
  8786. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8787. *)
  8788. IF ~backend.cellsAreObjects THEN
  8789. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8790. END;
  8791. ReleaseOperand(s0);
  8792. ReleaseOperand(s1);
  8793. ReleaseOperand(s2);
  8794. IF backend.cellsAreObjects THEN
  8795. IF p2 = NIL THEN
  8796. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8797. ELSE
  8798. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8799. END;
  8800. ELSE
  8801. IF p2 = NIL THEN
  8802. CallThis(position,ChannelModuleName,"Receive",2)
  8803. ELSE
  8804. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8805. END;
  8806. END;
  8807. | Global.systemSpecial:
  8808. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8809. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8810. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8811. (* determine if parameters are of the VAR kind *)
  8812. ASSERT(x.parameters.Length() <= 3);
  8813. formalParameter := procedureType.firstParameter;
  8814. FOR i := 0 TO x.parameters.Length() - 1 DO
  8815. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8816. formalParameter := formalParameter.nextParameter
  8817. END;
  8818. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8819. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8820. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8821. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8822. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8823. IF procedureType.returnType # NIL THEN
  8824. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8825. Emit(Result(position, res));
  8826. (*InitOperand(result,ModeValue);
  8827. result.op := res;
  8828. *)
  8829. InitOperand(result,ModeValue); result.op := res;
  8830. END
  8831. ELSE (* function not yet implemented *)
  8832. Error(position,"not yet implemented");
  8833. END;
  8834. destination := dest;
  8835. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8836. END VisitBuiltinCallDesignator;
  8837. PROCEDURE EvaluateBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator; VAR result: Operand);
  8838. VAR
  8839. p0,p1,p2: SyntaxTree.Expression; len: LONGINT; l: Operand; res,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8840. s0,s1,s2: Operand; hint: HUGEINT;
  8841. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  8842. tmp:IntermediateCode.Operand;
  8843. t0,t1,t2: SyntaxTree.Type; ignore: Label;
  8844. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  8845. operand: Operand;
  8846. dest: IntermediateCode.Operand;
  8847. itype: IntermediateCode.Type;
  8848. convert: BOOLEAN;
  8849. customBuiltin: SyntaxTree.CustomBuiltin;
  8850. isVarPar: ARRAY 3 OF BOOLEAN;
  8851. callsection: Sections.Section;
  8852. segmentedName: Basic.SegmentedName;
  8853. needsTrace: BOOLEAN;
  8854. BEGIN
  8855. IF Trace THEN TraceEnter("EvaluateBuiltinCallDesignator") END;
  8856. dest := destination; destination := emptyOperand;
  8857. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  8858. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  8859. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  8860. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  8861. CASE x.id OF
  8862. (* ---- ASH, LSH, ROT ----- *)
  8863. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  8864. EvaluateX(p0, s0);
  8865. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  8866. (* make unsigned arguments in order to produced a logical shift *)
  8867. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  8868. convert:= TRUE;
  8869. itype := s0.op.type;
  8870. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  8871. Convert(s0.op,itype);
  8872. ELSE
  8873. convert := FALSE;
  8874. END;
  8875. END;
  8876. EvaluateX(p1,s1);
  8877. IF IsIntegerConstant(p1,hint) THEN
  8878. ReuseCopy(reg,s0.op);
  8879. IF hint > 0 THEN
  8880. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  8881. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  8882. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  8883. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  8884. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  8885. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  8886. END;
  8887. ELSIF hint < 0 THEN
  8888. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  8889. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  8890. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  8891. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  8892. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  8893. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  8894. END;
  8895. END;
  8896. ReleaseOperand(s0); ReleaseOperand(s1);
  8897. ELSE
  8898. exit := NewLabel();
  8899. end := NewLabel();
  8900. ReuseCopy(reg,s0.op);
  8901. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  8902. Reuse1(tmp,s1.op);
  8903. Emit(Neg(position,tmp,s1.op));
  8904. Convert(tmp,s1.op.type);
  8905. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  8906. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  8907. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  8908. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  8909. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  8910. END;
  8911. ReleaseIntermediateOperand(tmp);
  8912. BrL(end);
  8913. SetLabel(exit);
  8914. ReuseCopy(tmp,s1.op);
  8915. Convert(tmp,s1.op.type);
  8916. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  8917. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  8918. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  8919. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  8920. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  8921. END;
  8922. ReleaseIntermediateOperand(tmp);
  8923. SetLabel(end);
  8924. ReleaseOperand(s0); ReleaseOperand(s1);
  8925. END;
  8926. InitOperand(result,ModeValue);
  8927. IF convert THEN
  8928. itype := reg.type;
  8929. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  8930. Convert(reg,itype);
  8931. END;
  8932. result.op := reg;
  8933. (* ---- CAP ----- *)
  8934. |Global.Cap:
  8935. EvaluateX(p0,result);
  8936. ReuseCopy(reg,result.op);
  8937. ReleaseIntermediateOperand(result.op);
  8938. ignore := NewLabel();
  8939. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  8940. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  8941. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  8942. SetLabel(ignore);
  8943. result.op := reg;
  8944. (* ---- CHR ----- *)
  8945. |Global.Chr, Global.Chr32:
  8946. EvaluateX(p0, result);
  8947. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8948. |Global.Entier, Global.EntierH:
  8949. EvaluateX(p0, result);
  8950. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8951. (* ---- MIN and MAX ----- *)
  8952. |Global.Max,Global.Min:
  8953. EvaluateX(p0, s0);
  8954. EvaluateX(p1, s1);
  8955. Reuse2(res,s0.op,s1.op);
  8956. else := NewLabel();
  8957. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  8958. ELSE BrltL(else,s1.op,s0.op) END;
  8959. Emit(Mov(position,res,s0.op));
  8960. ReleaseOperand(s0);
  8961. end := NewLabel();
  8962. BrL(end);
  8963. SetLabel(else);
  8964. Emit(MovReplace(position,res,s1.op));
  8965. SetLabel(end);
  8966. ReleaseOperand(s1);
  8967. InitOperand(result,ModeValue);
  8968. result.op := res;
  8969. (* ---- ODD ----- *)
  8970. |Global.Odd:
  8971. EvaluateX(p0, result);
  8972. Reuse1(res,result.op);
  8973. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8974. ReleaseIntermediateOperand(result.op);
  8975. result.op := res;
  8976. Convert(result.op,bool);
  8977. (* ---- ORD ----- *)
  8978. |Global.Ord, Global.Ord32:
  8979. EvaluateX(p0, result);
  8980. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8981. (* ---- SHORT, LONG ----- *)
  8982. |Global.Short, Global.Long:
  8983. EvaluateX(p0, result);
  8984. IF x.type IS SyntaxTree.ComplexType THEN
  8985. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8986. Convert(result.op, IntermediateCode.GetType(system, componentType));
  8987. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  8988. ELSE
  8989. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8990. END
  8991. (* ---- LEN ----- *)
  8992. |Global.Len: (* dynamic length, static length done by checker *)
  8993. Designate(p0,operand);
  8994. IF p1 = NIL THEN
  8995. InitOperand(l,ModeValue);
  8996. l.op := IntermediateCode.Immediate(sizeType,0);
  8997. ELSE
  8998. Evaluate(p1,l);
  8999. END;
  9000. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  9001. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  9002. Dereference(operand, p0.type.resolved, FALSE);
  9003. END;
  9004. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  9005. ReleaseOperand(operand); ReleaseOperand(l);
  9006. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  9007. ASSERT(p1 # NIL);
  9008. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9009. Dereference(operand,p0.type.resolved,FALSE);
  9010. END;
  9011. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  9012. ReleaseOperand(operand); ReleaseOperand(l);
  9013. ELSE HALT(100);
  9014. END;
  9015. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9016. (* ---- FIRST ---- *)
  9017. |Global.First:
  9018. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9019. EvaluateX(p0(SyntaxTree.RangeExpression).first, result)
  9020. ELSE
  9021. Designate(p0, result)
  9022. END
  9023. (* ---- LAST ---- *)
  9024. |Global.Last:
  9025. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9026. EvaluateX(p0(SyntaxTree.RangeExpression).last, result)
  9027. ELSE
  9028. Designate(p0, result);
  9029. (* make sure result.op is a register *)
  9030. tmp := result.op;
  9031. ReuseCopy(result.op, result.op);
  9032. ReleaseIntermediateOperand(tmp);
  9033. (* add offset to result.op *)
  9034. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9035. END
  9036. (* ---- STEP ---- *)
  9037. |Global.Step:
  9038. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9039. EvaluateX(p0(SyntaxTree.RangeExpression).step, result)
  9040. ELSE
  9041. Designate(p0, result);
  9042. (* make sure result.op is a register *)
  9043. tmp := result.op;
  9044. ReuseCopy(result.op, result.op);
  9045. ReleaseIntermediateOperand(tmp);
  9046. (* add offset to result.op *)
  9047. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9048. END
  9049. (* ---- RE ---- *)
  9050. |Global.Re:
  9051. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  9052. Designate(p0, result)
  9053. ELSE
  9054. EvaluateX(p0, result)
  9055. END
  9056. (* ---- IM ---- *)
  9057. |Global.Im:
  9058. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  9059. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  9060. Designate(p0, result);
  9061. (* make sure result.op is a register *)
  9062. tmp := result.op;
  9063. ReuseCopy(result.op, result.op);
  9064. ReleaseIntermediateOperand(tmp);
  9065. (* add offset to result.op *)
  9066. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  9067. (* ---- ABS ----- *)
  9068. |Global.Abs:
  9069. EvaluateX(p0,operand);
  9070. type := p0.type.resolved;
  9071. InitOperand(result,ModeValue);
  9072. Reuse1a(result.op,operand.op,dest);
  9073. Emit(Abs(position,result.op,operand.op));
  9074. ReleaseOperand(operand);
  9075. (* ---- ADDRESSOF----- *)
  9076. |Global.systemAdr:
  9077. Designate(p0,s0);
  9078. s0.mode := ModeValue;
  9079. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  9080. ReleaseIntermediateOperand(s0.op);
  9081. s0.op := s0.tag;
  9082. IntermediateCode.InitOperand(s0.tag);
  9083. END;
  9084. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  9085. result := s0;
  9086. (* ---- BIT ----- *)
  9087. |Global.systemBit:
  9088. EvaluateX(p0,s0);
  9089. ToMemory(s0.op,addressType,0);
  9090. ReuseCopy(res,s0.op);
  9091. ReleaseOperand(s0);
  9092. EvaluateX(p1, s1);
  9093. Emit(Ror(position,res,res,s1.op));
  9094. ReleaseOperand(s1);
  9095. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  9096. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  9097. InitOperand(result,ModeValue);
  9098. result.op := res;
  9099. (* --- MSK ----*)
  9100. |Global.systemMsk:
  9101. EvaluateX(p0, s0);
  9102. EvaluateX(p1, s1);
  9103. ReuseCopy(res,s0.op);
  9104. ReleaseOperand(s0);
  9105. Emit(And(position,res,res,s1.op));
  9106. ReleaseOperand(s1);
  9107. InitOperand(result,ModeValue);
  9108. result.op := res;
  9109. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  9110. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  9111. EvaluateX(p0, s0);
  9112. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  9113. ReleaseOperand(s0);
  9114. InitOperand(result,ModeValue);
  9115. result.op := res;
  9116. (* ---- SYSTEM.GetStackPointer ----- *)
  9117. |Global.systemGetStackPointer:
  9118. InitOperand(result,ModeValue);
  9119. result.op := sp;
  9120. (* ---- SYSTEM.GetFramePointer ----- *)
  9121. |Global.systemGetFramePointer:
  9122. InitOperand(result,ModeValue);
  9123. result.op := fp;
  9124. (* ---- SYSTEM.GetActivity ----- *)
  9125. |Global.systemGetActivity:
  9126. ASSERT(backend.cooperative);
  9127. InitOperand(result,ModeValue);
  9128. result.op := ap;
  9129. (* ---- SYSTEM.SetStackPointer ----- *)
  9130. |Global.systemSetStackPointer:
  9131. Evaluate(p0,s0); (* *)
  9132. Emit(Mov(position,sp,s0.op));
  9133. ReleaseOperand(s0);
  9134. (* ---- SYSTEM.SetFramePointer ----- *)
  9135. |Global.systemSetFramePointer:
  9136. Evaluate(p0,s0); (* *)
  9137. Emit(Mov(position,fp,s0.op));
  9138. ReleaseOperand(s0);
  9139. (* ---- SYSTEM.Activity ----- *)
  9140. |Global.systemSetActivity:
  9141. ASSERT(backend.cooperative);
  9142. Evaluate(p0,s0); (* *)
  9143. Emit(Mov(position,ap,s0.op));
  9144. ReleaseOperand(s0);
  9145. (* ---- SYSTEM.VAL ----- *)
  9146. |Global.systemVal:
  9147. Expression(p1);
  9148. s1 := result;
  9149. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9150. IF s1.mode = ModeReference THEN
  9151. (* nothing to be done if not record type, just take over new type *)
  9152. IF (type IS SyntaxTree.RecordType) THEN
  9153. ReleaseIntermediateOperand(s1.tag);
  9154. s1.tag := TypeDescriptorAdr(type);
  9155. UseIntermediateOperand(s1.tag);
  9156. END;
  9157. result := s1;
  9158. ELSE (* copy over result to different type, may not use convert *)
  9159. itype := IntermediateCode.GetType(system,type);
  9160. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  9161. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  9162. Emit(Mov(position,s0.op,s1.op));
  9163. ReleaseOperand(s1);
  9164. InitOperand(result,ModeValue);
  9165. result.op := s0.op;
  9166. ELSE (* different size, must convert *)
  9167. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  9168. Convert(s1.op, IntermediateCode.GetType(system,type));
  9169. result := s1;
  9170. END;
  9171. END;
  9172. (* ---- SYSTEM.GET ----- *)
  9173. |Global.systemGet:
  9174. Evaluate(p0,s0); (* adr *)
  9175. Designate(p1,s1); (* variable *)
  9176. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  9177. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  9178. Emit(Mov(position,s1.op,s0.op));
  9179. ReleaseOperand(s1);
  9180. ReleaseOperand(s0);
  9181. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  9182. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  9183. Evaluate(p0,s0); (* *)
  9184. Evaluate(p1,s1); (* variable *)
  9185. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  9186. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  9187. (* real part *)
  9188. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  9189. Emit(Mov(position,res, s1.op));
  9190. ReleaseIntermediateOperand(res);
  9191. (* imaginary part *)
  9192. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9193. Emit(Mov(position,res, s1.tag));
  9194. ReleaseIntermediateOperand(res);
  9195. ReleaseOperand(s1);
  9196. ReleaseOperand(s0);
  9197. ELSE
  9198. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  9199. ReleaseOperand(s0);
  9200. Emit(Mov(position,res,s1.op));
  9201. ReleaseIntermediateOperand(res);
  9202. ReleaseOperand(s1);
  9203. END;
  9204. (* ---- SYSTEM.MOVE ----- *)
  9205. |Global.systemMove:
  9206. Evaluate(p0,s0);
  9207. Evaluate(p1,s1);
  9208. Evaluate(p2,s2);
  9209. Emit(Copy(position,s1.op,s0.op,s2.op));
  9210. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9211. (* ---- SYSTEM.NEW ----- *)
  9212. |Global.systemNew:
  9213. Designate(p0,s0);
  9214. Emit(Push(position,s0.op));
  9215. ReleaseOperand(s0);
  9216. Evaluate(p1,s1);
  9217. Emit(Push(position,s1.op));
  9218. ReleaseOperand(s1);
  9219. (* push realtime flag: false by default *)
  9220. Emit(Push(position,false));
  9221. CallThis(position,"Heaps","NewSys",3);
  9222. (* ---- SYSTEM.CALL ----- *)
  9223. |Global.systemRef:
  9224. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  9225. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  9226. s0.mode := ModeValue;
  9227. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  9228. result := s0
  9229. (* ---- INCR ----- *)
  9230. |Global.Incr:
  9231. Designate(p0,operand);
  9232. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9233. Dereference(operand,p0.type.resolved,FALSE);
  9234. END;
  9235. ASSERT(p1 # NIL);
  9236. Evaluate(p1,l);
  9237. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  9238. ReleaseOperand(operand); ReleaseOperand(l);
  9239. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9240. (* ---- SUM ----- *)
  9241. |Global.Sum: HALT(200);
  9242. (* ---- ALL ----- *)
  9243. |Global.All: HALT(200);
  9244. (* ---- CAS ----- *)
  9245. |Global.Cas:
  9246. needsTrace := p0.NeedsTrace();
  9247. IF needsTrace THEN ModifyAssignments(true) END;
  9248. Designate(p0,s0);
  9249. Evaluate(p1,s1);
  9250. Evaluate(p2,s2);
  9251. IF needsTrace THEN
  9252. Emit(Push(position, s0.op));
  9253. Emit(Push(position, s1.op));
  9254. Emit(Push(position, s2.op));
  9255. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  9256. ELSE
  9257. Emit(Cas(position,s0.op,s1.op,s2.op));
  9258. END;
  9259. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9260. IF needsTrace THEN ModifyAssignments(false) END;
  9261. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  9262. Emit(Result(position, res));
  9263. result.op := res;
  9264. result.mode := ModeValue;
  9265. (*
  9266. IF conditional THEN
  9267. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  9268. BrL(falseLabel);
  9269. ReleaseIntermediateOperand(res);
  9270. END;
  9271. *)
  9272. (* ---- DIM ----- *)
  9273. |Global.Dim:
  9274. Designate(p0,s0);
  9275. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9276. Dereference(s0,p0.type.resolved,FALSE);
  9277. END;
  9278. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  9279. ReleaseOperand(s0);
  9280. (* ---- SYSTEM.TYPECODE ----- *)
  9281. |Global.systemTypeCode:
  9282. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9283. IF type.resolved IS SyntaxTree.PointerType THEN
  9284. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  9285. END;
  9286. result.op := TypeDescriptorAdr(type);
  9287. Convert(result.op, IntermediateCode.GetType(system,x.type));
  9288. result.mode := ModeValue;
  9289. (* ---- SYSTEM.TRACE ----- *)
  9290. |Global.systemTrace:
  9291. SystemTrace(x.parameters, x.position);
  9292. (* ----- CONNECT ------*)
  9293. |Global.Connect:
  9294. IF backend.cellsAreObjects THEN
  9295. PushPort(p0);
  9296. PushPort(p1);
  9297. IF p2 # NIL THEN
  9298. Evaluate(p2, s2);
  9299. Emit(Push(p2.position, s2.op));
  9300. ReleaseOperand(s2);
  9301. ELSE
  9302. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  9303. END;
  9304. CallThis(position,"ActiveCellsRuntime","Connect",3);
  9305. ELSE
  9306. Warning(x.position, "cannot run on final hardware");
  9307. END;
  9308. | Global.systemSpecial:
  9309. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  9310. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  9311. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  9312. (* determine if parameters are of the VAR kind *)
  9313. ASSERT(x.parameters.Length() <= 3);
  9314. formalParameter := procedureType.firstParameter;
  9315. FOR i := 0 TO x.parameters.Length() - 1 DO
  9316. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  9317. formalParameter := formalParameter.nextParameter
  9318. END;
  9319. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  9320. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  9321. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  9322. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  9323. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9324. IF procedureType.returnType # NIL THEN
  9325. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9326. Emit(Result(position, res));
  9327. (*InitOperand(result,ModeValue);
  9328. result.op := res;
  9329. *)
  9330. InitOperand(result,ModeValue); result.op := res;
  9331. END
  9332. ELSE (* function not yet implemented *)
  9333. Error(position,"not yet implemented");
  9334. END;
  9335. destination := dest;
  9336. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  9337. END EvaluateBuiltinCallDesignator;
  9338. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  9339. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  9340. BEGIN
  9341. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  9342. dest := destination; destination := emptyOperand;
  9343. Expression(x.left);
  9344. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  9345. ELSIF isUnchecked THEN (* no check *)
  9346. ELSE
  9347. trueL := NewLabel();
  9348. IF IsPointerToRecord(x.left.type,recordType) THEN
  9349. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  9350. Emit(Mov(position,tag, result.op));
  9351. IF result.mode # ModeValue THEN
  9352. ptr := tag;
  9353. IntermediateCode.MakeMemory(ptr,addressType);
  9354. Emit(Mov(position,tag, ptr));
  9355. END;
  9356. IF ~backend.cooperative THEN
  9357. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9358. END;
  9359. IntermediateCode.MakeMemory(tag,addressType);
  9360. ELSE
  9361. tag := result.tag;
  9362. UseIntermediateOperand(tag);
  9363. END;
  9364. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  9365. ReleaseIntermediateOperand(tag);
  9366. EmitTrap(position,TypeCheckTrap);
  9367. SetLabel(trueL);
  9368. END;
  9369. destination := dest;
  9370. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  9371. END VisitTypeGuardDesignator;
  9372. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  9373. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  9374. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  9375. VAR label: Label; pc: LONGINT;
  9376. BEGIN
  9377. IF backend.cooperative & ~isUnchecked THEN
  9378. pc := section.pc;
  9379. label := NewLabel();
  9380. BrneL(label, operand.op, nil);
  9381. EmitTrap(position, NilPointerTrap);
  9382. SetLabel(label);
  9383. INC(statCoopNilCheck, section.pc - pc);
  9384. END;
  9385. END NilCheck;
  9386. BEGIN
  9387. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  9388. ReuseCopy(dereferenced,operand.op);
  9389. ReleaseOperand(operand);
  9390. operand.mode := ModeReference;
  9391. operand.op := dereferenced;
  9392. operand.tag := dereferenced;
  9393. UseIntermediateOperand(operand.tag);
  9394. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  9395. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  9396. ReleaseIntermediateOperand(operand.tag);
  9397. operand.tag := TypeDescriptorAdr(type);
  9398. ELSE
  9399. IF ~backend.cooperative THEN
  9400. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9401. END;
  9402. IntermediateCode.MakeMemory(operand.tag,addressType);
  9403. END;
  9404. NilCheck(operand.op);
  9405. ELSIF type IS SyntaxTree.ArrayType THEN
  9406. IF isUnsafe THEN
  9407. NilCheck(operand.op);
  9408. ReleaseIntermediateOperand(operand.tag);
  9409. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  9410. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9411. ELSE
  9412. operand.tag := emptyOperand;
  9413. END;
  9414. ELSE
  9415. NilCheck(operand.op);
  9416. IF backend.cooperative THEN
  9417. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  9418. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9419. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  9420. ELSE
  9421. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  9422. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  9423. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9424. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  9425. END;
  9426. END;
  9427. ELSIF type IS SyntaxTree.MathArrayType THEN
  9428. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9429. IntermediateCode.MakeMemory(operand.op,addressType);
  9430. ELSE HALT(100);
  9431. END;
  9432. END Dereference;
  9433. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  9434. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  9435. BEGIN
  9436. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  9437. dest := destination; destination := emptyOperand;
  9438. Evaluate(x.left,d);
  9439. type := x.type.resolved;
  9440. prevIsUnchecked := isUnchecked;
  9441. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  9442. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  9443. END;
  9444. Dereference(d,type,IsUnsafePointer(x.left.type));
  9445. isUnchecked := prevIsUnchecked;
  9446. result := d;
  9447. 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
  9448. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  9449. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9450. END;
  9451. END;
  9452. destination := dest;
  9453. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  9454. END VisitDereferenceDesignator;
  9455. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  9456. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  9457. BEGIN
  9458. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  9459. dest := destination; destination := emptyOperand;
  9460. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  9461. tag := result.op;
  9462. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  9463. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  9464. StaticCallOperand(result,procedure.super);
  9465. ReleaseIntermediateOperand(result.tag);
  9466. UseIntermediateOperand(tag); (* necessary ? *)
  9467. result.tag := tag;
  9468. destination := dest;
  9469. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  9470. END VisitSupercallDesignator;
  9471. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  9472. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  9473. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9474. name: Basic.SegmentedName;
  9475. procedure: SyntaxTree.Procedure;
  9476. procedureType: SyntaxTree.ProcedureType;
  9477. BEGIN
  9478. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  9479. dest := destination; destination := emptyOperand;
  9480. scope := currentScope;
  9481. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9482. scope := scope.outerScope;
  9483. END;
  9484. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9485. moduleSection := meta.ModuleSection();
  9486. IF backend.cooperative THEN
  9487. moduleOffset := 0;
  9488. ELSE
  9489. moduleOffset := moduleSection.pc;
  9490. END;
  9491. result.mode := ModeValue;
  9492. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9493. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9494. result.mode := ModeValue;
  9495. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  9496. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  9497. ELSE
  9498. GetBaseRegister(basereg,currentScope,scope);
  9499. InitOperand(result,ModeReference);
  9500. result.op := basereg;
  9501. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9502. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9503. parametersSize := ProcParametersSize(procedure);
  9504. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9505. IF backend.cooperative THEN
  9506. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  9507. END;
  9508. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  9509. MakeMemory(result.op, result.op, addressType, 0);
  9510. END;
  9511. (* tag must be loaded when dereferencing SELF pointer *)
  9512. END;
  9513. destination := dest;
  9514. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  9515. END VisitSelfDesignator;
  9516. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  9517. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  9518. BEGIN
  9519. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  9520. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9521. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9522. parameter := procedureType.returnParameter;
  9523. IF currentIsInline THEN
  9524. map := currentMapper.Get(NIL);
  9525. IF map # NIL THEN
  9526. Designate(map.to, result);
  9527. ELSE
  9528. HALT(200);
  9529. END;
  9530. RETURN;
  9531. END;
  9532. VisitParameter(parameter);
  9533. IF Trace THEN TraceExit("VisitResultDesignator") END;
  9534. END VisitResultDesignator;
  9535. (** values *)
  9536. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  9537. BEGIN
  9538. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  9539. InitOperand(result,ModeValue);
  9540. IF x.value THEN result.op := true ELSE result.op := false END;
  9541. END VisitBooleanValue;
  9542. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  9543. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  9544. BEGIN
  9545. Global.GetModuleSegmentedName(module.module, name);
  9546. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  9547. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  9548. RETURN section
  9549. END GetDataSection;
  9550. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  9551. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  9552. BEGIN
  9553. type := vop.type;
  9554. data := GetDataSection();
  9555. pc := EnterImmediate(data,vop);
  9556. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  9557. IntermediateCode.MakeMemory(vop, type);
  9558. END GetImmediateMem;
  9559. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  9560. BEGIN
  9561. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  9562. InitOperand(result,ModeValue);
  9563. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9564. IF ~supportedImmediate(result.op) &~inData THEN
  9565. GetImmediateMem(result.op)
  9566. END;
  9567. END VisitIntegerValue;
  9568. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  9569. BEGIN
  9570. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  9571. InitOperand(result,ModeValue);
  9572. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  9573. END VisitCharacterValue;
  9574. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  9575. BEGIN
  9576. IF Trace THEN TraceEnter("VisitSetValue") END;
  9577. InitOperand(result,ModeValue);
  9578. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  9579. END VisitSetValue;
  9580. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  9581. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  9582. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  9583. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  9584. BEGIN
  9585. numberElements := x.elements.Length();
  9586. FOR i := 0 TO numberElements-1 DO
  9587. expression := x.elements.GetExpression(i);
  9588. IF expression IS SyntaxTree.MathArrayExpression THEN
  9589. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  9590. ELSE
  9591. inData := TRUE;
  9592. Evaluate(expression,op);
  9593. irv.Emit(Data(position,op.op));
  9594. inData := FALSE;
  9595. ReleaseOperand(op);
  9596. END;
  9597. END;
  9598. END RecursiveData;
  9599. BEGIN
  9600. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  9601. IF ~TryConstantDeclaration() THEN
  9602. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9603. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9604. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9605. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  9606. ELSE
  9607. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9608. END;
  9609. RecursiveData(x.array);
  9610. InitOperand(result,ModeReference);
  9611. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9612. END
  9613. END VisitMathArrayValue;
  9614. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  9615. VAR constant: Sections.Section;
  9616. BEGIN
  9617. IF constantDeclaration = NIL THEN
  9618. RETURN FALSE
  9619. ELSE
  9620. (* Is a constant in this module: did we generate it already? *)
  9621. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  9622. IF constant # NIL THEN
  9623. InitOperand(result,ModeReference);
  9624. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  9625. RETURN TRUE;
  9626. END;
  9627. END;
  9628. RETURN FALSE
  9629. END TryConstantDeclaration;
  9630. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  9631. BEGIN
  9632. constantDeclaration := x;
  9633. VExpression(x.value.resolved);
  9634. END VisitConstant;
  9635. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  9636. BEGIN
  9637. IF Trace THEN TraceEnter("VisitRealValue") END;
  9638. InitOperand(result,ModeValue);
  9639. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9640. END VisitRealValue;
  9641. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  9642. VAR
  9643. componentType: SyntaxTree.Type;
  9644. BEGIN
  9645. IF Trace THEN TraceEnter("VisitComplexValue") END;
  9646. ASSERT(x.type IS SyntaxTree.ComplexType);
  9647. componentType := x.type(SyntaxTree.ComplexType).componentType;
  9648. InitOperand(result,ModeValue);
  9649. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  9650. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  9651. END VisitComplexValue;
  9652. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  9653. VAR i: LONGINT; name: Basic.SegmentedName;
  9654. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  9655. BEGIN
  9656. IF Trace THEN TraceEnter("VisitStringValue") END;
  9657. IF ~TryConstantDeclaration() THEN
  9658. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9659. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9660. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9661. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9662. ELSE
  9663. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9664. END;
  9665. FOR i := 0 TO x.length-1 DO
  9666. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  9667. irv.Emit(Data(position,op));
  9668. END;
  9669. InitOperand(result,ModeReference);
  9670. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9671. result.tag := IntermediateCode.Immediate(addressType,x.length);
  9672. END
  9673. END VisitStringValue;
  9674. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  9675. BEGIN
  9676. IF Trace THEN TraceEnter("VisitNilValue") END;
  9677. InitOperand(result,ModeValue);
  9678. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9679. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9680. END VisitNilValue;
  9681. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  9682. BEGIN
  9683. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  9684. InitOperand(result,ModeValue);
  9685. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  9686. END VisitEnumerationValue;
  9687. (** symbols *)
  9688. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  9689. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  9690. END VisitImport;
  9691. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  9692. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  9693. BEGIN
  9694. IF scope # baseScope THEN
  9695. (* left := [fp+8] *)
  9696. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  9697. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9698. ReuseCopy(left,right);
  9699. ReleaseIntermediateOperand(right);
  9700. scope := scope.outerScope; DEC(level);
  9701. (* { left := [left+8] } *)
  9702. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  9703. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9704. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  9705. Emit(Mov(position,left,right));
  9706. scope := scope.outerScope; DEC(level);
  9707. END;
  9708. ASSERT((scope = baseScope) OR (baseScope = NIL));
  9709. result := left;
  9710. ELSE
  9711. result := fp;
  9712. END;
  9713. END GetBaseRegister;
  9714. (* EXPERIMENTAL *)
  9715. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  9716. VAR i: WORD;
  9717. BEGIN
  9718. IF ~backend.experiment THEN RETURN -1 END;
  9719. i := 0;
  9720. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  9721. INC(i);
  9722. END;
  9723. IF availableSymbols[i].symbol = NIL THEN
  9724. availableSymbols[i].inRegister := FALSE;
  9725. availableSymbols[i].inMemory := TRUE;
  9726. availableSymbols[i].symbol := x;
  9727. END;
  9728. RETURN i;
  9729. END GetAvailability;
  9730. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  9731. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  9732. BEGIN
  9733. IF Trace THEN TraceEnter("VisitVariable"); END;
  9734. type := x.type.resolved;
  9735. IF (x.useRegister) THEN
  9736. InitOperand(result, ModeValue);
  9737. IF x.registerNumber < 0 THEN
  9738. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  9739. reg := x.registerNumber;
  9740. ELSE
  9741. reg := registerUsageCount.Map(x.registerNumber);
  9742. UseRegister(reg);
  9743. END;
  9744. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  9745. ELSIF x.externalName # NIL THEN
  9746. InitOperand(result,ModeReference);
  9747. Basic.ToSegmentedName(x.externalName^, name);
  9748. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  9749. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  9750. InitOperand(result,ModeReference);
  9751. GetBaseRegister(result.op,currentScope,x.scope);
  9752. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9753. (* EXPERIMENTAL *)
  9754. result.availability := GetAvailability(x);
  9755. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  9756. InitOperand(result,ModeReference);
  9757. GetCodeSectionNameForSymbol(x,name);
  9758. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9759. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9760. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  9761. InitOperand(result,ModeReference);
  9762. GetCodeSectionNameForSymbol(x,name);
  9763. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9764. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  9765. ELSE (* field, left designator must have been emitted *)
  9766. ASSERT(result.mode = ModeReference);
  9767. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9768. ReuseCopy(temp,result.op);
  9769. ReleaseIntermediateOperand(result.op);
  9770. result.op := temp;
  9771. END;
  9772. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9773. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  9774. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9775. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  9776. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9777. END;
  9778. END;
  9779. END;
  9780. IF type IS SyntaxTree.ProcedureType THEN
  9781. ReleaseIntermediateOperand(result.tag);
  9782. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9783. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9784. UseIntermediateOperand(result.tag);
  9785. ELSE
  9786. result.tag := nil; (* nil *)
  9787. END;
  9788. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9789. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  9790. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9791. ReleaseIntermediateOperand(result.tag);
  9792. Global.GetSymbolSegmentedName(x,name);
  9793. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  9794. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  9795. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  9796. ELSE
  9797. END;
  9798. ELSE
  9799. ReleaseIntermediateOperand(result.tag);
  9800. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9801. END;
  9802. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9803. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  9804. ReleaseIntermediateOperand(result.tag);
  9805. result.tag := result.op;
  9806. UseIntermediateOperand(result.tag);
  9807. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9808. IntermediateCode.MakeMemory(result.op,addressType);
  9809. END;
  9810. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  9811. ReleaseIntermediateOperand(result.tag);
  9812. result.tag := TypeDescriptorAdr(type);
  9813. UseIntermediateOperand(result.tag);
  9814. (* tag for pointer type computed not here but during dereferencing *)
  9815. END;
  9816. IF Trace THEN TraceExit("VisitVariable") END;
  9817. END VisitVariable;
  9818. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  9819. BEGIN
  9820. VisitVariable(property);
  9821. END VisitProperty;
  9822. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  9823. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  9824. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  9825. BEGIN
  9826. type := x.type.resolved;
  9827. IF Trace THEN TraceEnter("VisitParameter") END;
  9828. IF x.ownerType IS SyntaxTree.CellType THEN
  9829. ptype := x.type.resolved;
  9830. IF backend.cellsAreObjects THEN
  9831. ASSERT(result.mode = ModeReference);
  9832. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9833. ReuseCopy(temp,result.op);
  9834. ReleaseIntermediateOperand(result.op);
  9835. result.op := temp;
  9836. END;
  9837. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9838. RETURN;
  9839. ELSE
  9840. InitOperand(result,ModeReference);
  9841. GetCodeSectionNameForSymbol(x,name);
  9842. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9843. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9844. RETURN;
  9845. END;
  9846. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9847. InitOperand(result,ModeReference);
  9848. GetCodeSectionNameForSymbol(x,name);
  9849. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9850. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9851. RETURN
  9852. ELSE
  9853. GetBaseRegister(basereg,currentScope,x.scope);
  9854. InitOperand(result,ModeReference);
  9855. result.op := basereg;
  9856. END;
  9857. IF IsOpenArray(type) THEN
  9858. result.tag := basereg;
  9859. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9860. IntermediateCode.MakeMemory(result.op,addressType);
  9861. IF Global.IsOberonProcedure(x.ownerType) THEN
  9862. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9863. UseIntermediateOperand(result.tag);
  9864. ELSE
  9865. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9866. END;
  9867. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9868. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9869. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9870. ELSIF IsStaticArray(type) THEN
  9871. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9872. IntermediateCode.MakeMemory(result.op,addressType);
  9873. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9874. ELSIF type IS SyntaxTree.MathArrayType THEN
  9875. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9876. WITH type: SyntaxTree.MathArrayType DO
  9877. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9878. IF type.form = SyntaxTree.Tensor THEN
  9879. ELSIF type.form = SyntaxTree.Open THEN
  9880. result.tag := result.op;
  9881. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9882. IntermediateCode.MakeMemory(result.op,addressType);
  9883. UseIntermediateOperand(result.tag);
  9884. ELSIF type.form = SyntaxTree.Static THEN
  9885. IF x.kind = SyntaxTree.ConstParameter THEN
  9886. IntermediateCode.MakeMemory(result.op,addressType);
  9887. END;
  9888. ELSE HALT(100)
  9889. END;
  9890. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9891. IF type.form = SyntaxTree.Tensor THEN
  9892. ToMemory(result.op,addressType,0);
  9893. ELSIF type.form = SyntaxTree.Open THEN
  9894. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9895. ReuseCopy(result.tag, mem);
  9896. ReleaseIntermediateOperand(mem);
  9897. ReleaseIntermediateOperand(result.op);
  9898. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9899. ELSIF type.form = SyntaxTree.Static THEN
  9900. IntermediateCode.MakeMemory(result.op,addressType);
  9901. ELSE HALT(100)
  9902. END;
  9903. ELSE HALT(100)
  9904. END;
  9905. END;
  9906. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9907. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9908. IntermediateCode.MakeMemory(result.op,addressType);
  9909. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9910. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9911. END;
  9912. IF type IS SyntaxTree.ProcedureType THEN
  9913. ReleaseIntermediateOperand(result.tag);
  9914. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9915. IF x.kind = SyntaxTree.VarParameter THEN
  9916. ReuseCopy(result.tag,result.op);
  9917. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9918. IntermediateCode.MakeMemory(result.tag,addressType);
  9919. ELSE
  9920. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9921. UseIntermediateOperand(result.tag);
  9922. END;
  9923. ELSE
  9924. result.tag := nil;
  9925. END;
  9926. (* tag for pointer type computed not here but during dereferencing *)
  9927. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) (* & ~(x.selfParameter) *) THEN
  9928. ReleaseIntermediateOperand(result.tag);
  9929. result.tag := basereg;
  9930. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9931. IntermediateCode.MakeMemory(result.tag,addressType);
  9932. UseIntermediateOperand(result.tag);
  9933. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9934. ReleaseIntermediateOperand(result.tag);
  9935. result.tag := TypeDescriptorAdr(type);
  9936. UseIntermediateOperand(result.tag);
  9937. END;
  9938. IF Trace THEN TraceExit("VisitParameter") END;
  9939. END VisitParameter;
  9940. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9941. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9942. BEGIN
  9943. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9944. (* left.p: left already emitted *)
  9945. tag := result.op; (* value of pointer to left *)
  9946. (* get type desc *)
  9947. tmp := result.tag;
  9948. IntermediateCode.MakeMemory(tmp,addressType);
  9949. (* get method adr *)
  9950. Reuse1(reg,tmp);
  9951. ReleaseIntermediateOperand(tmp);
  9952. IF backend.cooperative THEN
  9953. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9954. WHILE recordType.baseType # NIL DO
  9955. recordType := recordType.GetBaseRecord ();
  9956. END;
  9957. GetRecordTypeName (recordType,name);
  9958. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9959. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9960. offset := 0;
  9961. ELSE
  9962. offset := 2;
  9963. END;
  9964. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9965. ELSIF meta.simple THEN
  9966. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9967. ELSE
  9968. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9969. END;
  9970. InitOperand(operand,ModeReference);
  9971. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9972. operand.op := reg;
  9973. operand.tag := tag;
  9974. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9975. END DynamicCallOperand;
  9976. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9977. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9978. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9979. BEGIN
  9980. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9981. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9982. tag := operand.op;
  9983. ReleaseIntermediateOperand(operand.tag);
  9984. ELSE tag := nil
  9985. END;
  9986. IF x.isInline THEN
  9987. sectionType := Sections.InlineCodeSection;
  9988. ELSE
  9989. sectionType := Sections.CodeSection;
  9990. END;
  9991. IF x.externalName # NIL THEN
  9992. Basic.ToSegmentedName(x.externalName^, name);
  9993. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9994. ELSE
  9995. GetCodeSectionNameForSymbol(x, name);
  9996. IF (x.scope.ownerModule = module.module) THEN
  9997. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9998. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9999. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10000. IF source.pc = 0 THEN (* no code yet *)
  10001. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  10002. END;
  10003. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  10004. bits := x.procedureScope.body.code.inlineCode;
  10005. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  10006. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  10007. binary.CopyBits(bits, 0, bits.GetSize());
  10008. source.SetResolved(binary);
  10009. ELSE
  10010. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  10011. END;
  10012. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  10013. END;
  10014. InitOperand(operand,ModeValue);
  10015. operand.op := reg;
  10016. operand.tag := tag;
  10017. IF Trace THEN TraceExit("StaticCallOperand") END;
  10018. END StaticCallOperand;
  10019. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  10020. (* handle expressions of the form designator.procedure or procedure *)
  10021. BEGIN
  10022. IF Trace THEN TraceEnter("VisitProcedure") END;
  10023. EndBasicBlock;
  10024. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  10025. DynamicCallOperand(result,x);
  10026. ELSIF x.isInline THEN
  10027. StaticCallOperand(result,x);
  10028. ELSE
  10029. StaticCallOperand(result,x);
  10030. END;
  10031. IF Trace THEN TraceExit("VisitProcedure") END;
  10032. END VisitProcedure;
  10033. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  10034. BEGIN
  10035. VisitProcedure(x);
  10036. END VisitOperator;
  10037. (** statements *)
  10038. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  10039. BEGIN
  10040. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  10041. Expression(x.call);
  10042. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  10043. ReleaseOperand(result)
  10044. END;
  10045. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  10046. END VisitProcedureCallStatement;
  10047. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  10048. VAR leftType, rightType: SyntaxTree.MathArrayType;
  10049. leftBase, rightBase: SyntaxTree.Type;
  10050. procedureName,s: SyntaxTree.IdentifierString;
  10051. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  10052. size: LONGINT; rightKind: LONGINT;
  10053. dummy: IntermediateCode.Operand;
  10054. CONST moduleName = "FoxArrayBase";
  10055. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  10056. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  10057. BEGIN
  10058. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  10059. IF base IS SyntaxTree.MathArrayType THEN
  10060. base := OpenArray(base(SyntaxTree.MathArrayType));
  10061. END;
  10062. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  10063. result.SetArrayBase(base);
  10064. RETURN result
  10065. END OpenArray;
  10066. BEGIN
  10067. IF AddImport(moduleName,arrayBase,TRUE) THEN
  10068. SaveRegisters();ReleaseUsedRegisters(saved);
  10069. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  10070. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  10071. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  10072. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  10073. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  10074. IF leftType.form = SyntaxTree.Tensor THEN
  10075. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  10076. ELSIF leftType.form = SyntaxTree.Open THEN
  10077. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  10078. ELSIF leftType.form = SyntaxTree.Static THEN
  10079. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  10080. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  10081. END;
  10082. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  10083. IF procedure = NIL THEN
  10084. s := "Instruction not supported on target, emulation procedure ";
  10085. Strings.Append(s,moduleName);
  10086. Strings.Append(s,".");
  10087. Strings.Append(s,procedureName);
  10088. Strings.Append(s," not present");
  10089. Error(position,s);
  10090. ELSE
  10091. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  10092. parameter.SetType(leftType);
  10093. parameter.SetAccess(SyntaxTree.Internal);
  10094. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10095. parameter.SetKind(rightKind);
  10096. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10097. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  10098. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  10099. StaticCallOperand(result,procedure);
  10100. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  10101. ReleaseOperand(result);
  10102. END;
  10103. RestoreRegisters(saved);
  10104. END;
  10105. END AssignMathArray;
  10106. VAR modifyAssignmentCounter := 0: LONGINT;
  10107. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  10108. VAR processor,mem,dst: IntermediateCode.Operand;
  10109. BEGIN
  10110. IF value.intValue = true.intValue THEN
  10111. INC(modifyAssignmentCounter);
  10112. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  10113. modifyAssignmentsPC := section.pc;
  10114. ELSE
  10115. DEC(modifyAssignmentCounter);
  10116. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  10117. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  10118. END;
  10119. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  10120. dst := NewRegisterOperand (addressType);
  10121. Emit(Mov(position,dst, processor));
  10122. IntermediateCode.InitMemory(mem,bool, dst, 0);
  10123. Emit(Mov(position,mem, value));
  10124. ReleaseIntermediateOperand(dst);
  10125. END ModifyAssignments;
  10126. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  10127. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  10128. BEGIN
  10129. type := left.type.resolved;
  10130. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  10131. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  10132. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  10133. IF procedureType.returnParameter = parameter THEN
  10134. (* this is the only case where the destination can be dynamically smaller than the source
  10135. in all other cases the dynamic size has to be taken
  10136. *)
  10137. IF backend.cooperative THEN
  10138. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  10139. ELSE
  10140. MakeMemory(mem, tag, addressType, 0);
  10141. END;
  10142. RETURN mem;
  10143. END;
  10144. END;
  10145. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  10146. END CopySize;
  10147. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  10148. VAR
  10149. leftO, rightO: Operand;
  10150. arg,mem, sizeOp: IntermediateCode.Operand;
  10151. leftType, rightType, componentType, base: SyntaxTree.Type;
  10152. size: LONGINT;
  10153. parameters: SyntaxTree.ExpressionList;
  10154. procedure: SyntaxTree.Procedure;
  10155. call: SyntaxTree.ProcedureCallDesignator;
  10156. designator: SyntaxTree.Designator;
  10157. saved: RegisterEntry;
  10158. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  10159. VAR procedureType: SyntaxTree.ProcedureType;
  10160. BEGIN
  10161. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  10162. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  10163. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  10164. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  10165. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  10166. WITH right: SyntaxTree.BuiltinCallDesignator DO
  10167. IF right.id = Global.Reshape THEN RETURN TRUE
  10168. END;
  10169. END;
  10170. END;
  10171. END;
  10172. RETURN FALSE
  10173. END CanPassAsResultParameter;
  10174. BEGIN
  10175. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  10176. leftType := left.type.resolved; rightType:= right.type.resolved;
  10177. IF backend.cooperative & left.NeedsTrace() THEN
  10178. ModifyAssignments(true);
  10179. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  10180. Designate(right, rightO);
  10181. Designate(left, leftO);
  10182. ASSERT(leftO.mode = ModeReference);
  10183. TransferToRegister(leftO.op, leftO.op);
  10184. TransferToRegister(rightO.op, rightO.op);
  10185. Emit(Push(position, leftO.op));
  10186. Emit(Push(position, rightO.op));
  10187. CallAssignMethod(leftO.op, rightO.op, left.type);
  10188. Emit(Pop(position, rightO.op));
  10189. Emit(Pop(position, leftO.op));
  10190. sizeOp := CopySize(left, leftO.tag);
  10191. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10192. ReleaseIntermediateOperand(sizeOp);
  10193. ReleaseOperand(leftO);
  10194. ReleaseOperand(rightO);
  10195. ELSE
  10196. Evaluate(right,rightO);
  10197. Designate(left,leftO);
  10198. ASSERT(leftO.mode = ModeReference);
  10199. IF (leftType IS SyntaxTree.ProcedureType) THEN
  10200. (* copy procedure address first *)
  10201. MakeMemory(mem,leftO.op,addressType,0);
  10202. Emit(Mov(position,mem,rightO.op));
  10203. ReleaseIntermediateOperand(mem);
  10204. (* copy pointer address *)
  10205. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10206. CallAssignPointer(leftO.tag, rightO.tag);
  10207. ELSE
  10208. ASSERT(system.SizeOf(left.type) = system.addressSize);
  10209. CallAssignPointer(leftO.op, rightO.op);
  10210. END;
  10211. ReleaseOperand(leftO);
  10212. ReleaseOperand(rightO);
  10213. END;
  10214. ModifyAssignments(false);
  10215. RETURN;
  10216. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  10217. SaveRegisters();ReleaseUsedRegisters(saved);
  10218. IF SemanticChecker.IsPointerType(leftType) THEN
  10219. Evaluate(right,rightO);
  10220. Designate(left,leftO);
  10221. Emit(Push(position,leftO.op));
  10222. ReleaseOperand(leftO);
  10223. Emit(Push(position,rightO.op));
  10224. ReleaseOperand(rightO);
  10225. CallThis(position,"Heaps","Assign",2);
  10226. ELSIF leftType.IsRecordType() THEN
  10227. Designate(right,rightO);
  10228. Designate(left,leftO);
  10229. Emit(Push(position,leftO.op));
  10230. Emit(Push(position,leftO.tag)); (* type desc *)
  10231. ReleaseOperand(leftO);
  10232. Emit(Push(position,rightO.op));
  10233. ReleaseOperand(rightO);
  10234. CallThis(position,"Heaps","AssignRecord",3);
  10235. ELSIF IsStaticArray(leftType) THEN
  10236. size := StaticArrayNumElements(leftType);
  10237. base := StaticArrayBaseType(leftType);
  10238. Designate(right,rightO);
  10239. Designate(left,leftO);
  10240. Emit(Push(position,leftO.op));
  10241. ReleaseOperand(leftO);
  10242. arg := TypeDescriptorAdr(base);
  10243. Emit(Push(position,arg));
  10244. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10245. Emit(Push(position,rightO.op));
  10246. ReleaseOperand(rightO);
  10247. CallThis(position,"Heaps","AssignArray",4);
  10248. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  10249. size := StaticMathArrayNumElements(leftType);
  10250. base := StaticMathArrayBaseType(leftType);
  10251. Designate(right,rightO);
  10252. Designate(left,leftO);
  10253. Emit(Push(position,leftO.op));
  10254. ReleaseOperand(leftO);
  10255. arg := TypeDescriptorAdr(base);
  10256. Emit(Push(position,arg));
  10257. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10258. Emit(Push(position,rightO.op));
  10259. ReleaseOperand(rightO);
  10260. CallThis(position,"Heaps","AssignArray",4);
  10261. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  10262. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  10263. Evaluate(right,rightO);
  10264. Designate(left,leftO);
  10265. MakeMemory(mem,leftO.op,addressType,0);
  10266. Emit(Mov(position,mem,rightO.op));
  10267. ReleaseIntermediateOperand(mem);
  10268. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10269. Emit (Push(position, leftO.tag));
  10270. ReleaseOperand(leftO);
  10271. Emit (Push(position, rightO.tag));
  10272. ReleaseOperand(rightO);
  10273. CallThis(position,"Heaps","Assign", 2);
  10274. ELSE HALT(100); (* missing ? *)
  10275. END;
  10276. RestoreRegisters(saved);
  10277. RETURN;
  10278. END;
  10279. IF CanPassAsResultParameter(right) THEN
  10280. procedureResultDesignator := left(SyntaxTree.Designator);
  10281. Expression(right);
  10282. procedureResultDesignator := NIL;
  10283. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  10284. (* left <-- ALIAS OF right: zerocopy *)
  10285. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  10286. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  10287. designator.SetType(procedure.type);
  10288. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  10289. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  10290. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  10291. END;
  10292. ELSIF leftType IS SyntaxTree.RangeType THEN
  10293. (* LHS is of array range type *)
  10294. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  10295. Evaluate(right, rightO);
  10296. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  10297. (* first *)
  10298. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  10299. Emit(Mov(position,mem, rightO.op));
  10300. ReleaseIntermediateOperand(mem);
  10301. (* last *)
  10302. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10303. Emit(Mov(position,mem, rightO.tag));
  10304. ReleaseIntermediateOperand(mem);
  10305. (* step *)
  10306. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10307. Emit(Mov(position,mem, rightO.extra));
  10308. ReleaseIntermediateOperand(mem);
  10309. ReleaseOperand(rightO);
  10310. ReleaseOperand(leftO)
  10311. ELSIF leftType IS SyntaxTree.ComplexType THEN
  10312. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  10313. Evaluate(right, rightO);
  10314. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  10315. componentType := leftType(SyntaxTree.ComplexType).componentType;
  10316. (* real part *)
  10317. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  10318. Emit(Mov(position,mem, rightO.op));
  10319. ReleaseIntermediateOperand(mem);
  10320. (* imaginary part *)
  10321. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10322. Emit(Mov(position,mem, rightO.tag));
  10323. ReleaseIntermediateOperand(mem);
  10324. ReleaseOperand(rightO);
  10325. ReleaseOperand(leftO)
  10326. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  10327. OR (leftType IS SyntaxTree.PortType) THEN
  10328. (* rightO := leftO;*)
  10329. Evaluate(right,rightO);
  10330. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  10331. Designate(left,leftO);
  10332. IF leftO.mode = ModeReference THEN
  10333. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  10334. destination := mem;
  10335. ELSE
  10336. destination := leftO.op;
  10337. END;
  10338. ReleaseOperand(leftO);
  10339. (* EXPERIMENTAL *)
  10340. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  10341. ReleaseIntermediateOperand(destination);
  10342. destination := availableSymbols[leftO.availability].register;
  10343. UseIntermediateOperand(destination);
  10344. availableSymbols[leftO.availability].inMemory := FALSE;
  10345. END;
  10346. IF destination.mode # IntermediateCode.Undefined THEN
  10347. Emit(Mov(position,destination,rightO.op));
  10348. END;
  10349. ReleaseOperand(rightO);
  10350. ReleaseIntermediateOperand(mem);
  10351. IntermediateCode.InitOperand(destination);
  10352. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  10353. Evaluate(right,rightO);
  10354. Designate(left,leftO);
  10355. MakeMemory(mem,leftO.op,addressType,0);
  10356. Emit(Mov(position,mem,rightO.op));
  10357. ReleaseIntermediateOperand(mem);
  10358. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  10359. (* delegate *)
  10360. (*
  10361. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  10362. *)
  10363. Emit(Mov(position,leftO.tag,rightO.tag));
  10364. END;
  10365. ReleaseOperand(leftO);
  10366. ReleaseOperand(rightO);
  10367. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  10368. Designate(right,rightO);
  10369. Designate(left,leftO);
  10370. sizeOp := CopySize(left, leftO.tag);
  10371. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10372. ReleaseIntermediateOperand(sizeOp);
  10373. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10374. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  10375. IF (rightType IS SyntaxTree.StringType) THEN
  10376. CopyString(left,right);
  10377. 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
  10378. Designate(right,rightO);
  10379. Designate(left,leftO);
  10380. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10381. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10382. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10383. ELSE
  10384. HALT(201)
  10385. END;
  10386. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  10387. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  10388. Designate(right,rightO);
  10389. Designate(left,leftO);
  10390. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10391. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  10392. MakeMemory(mem, rightO.op, leftO.op.type,0);
  10393. Emit(Mov(position, leftO.op, mem));
  10394. ReleaseIntermediateOperand(mem);
  10395. ELSE
  10396. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10397. END;
  10398. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10399. ELSE
  10400. AssignMathArray(left,right);
  10401. END;
  10402. ELSE
  10403. HALT(200);
  10404. END;
  10405. END Assign;
  10406. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  10407. BEGIN
  10408. IF Trace THEN TraceEnter("VisitAssignment") END;
  10409. Assign(x.left,x.right);
  10410. IF Trace THEN TraceExit("VisitAssignment") END;
  10411. END VisitAssignment;
  10412. PROCEDURE EmitCooperativeSwitch;
  10413. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  10414. BEGIN
  10415. ASSERT (cooperativeSwitches);
  10416. pc := section.pc;
  10417. IF lastSwitchPC = section.pc THEN RETURN END;
  10418. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  10419. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  10420. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  10421. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  10422. INC(statCoopSwitch, section.pc - pc);
  10423. END EmitCooperativeSwitch;
  10424. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  10425. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  10426. BEGIN
  10427. p0 := communication.left; p1 := communication.right;
  10428. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  10429. Evaluate(p0,s0);
  10430. Evaluate(p1,s1);
  10431. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10432. Emit(Push(position,s0.op));
  10433. Emit(Push(position,s1.op));
  10434. (*
  10435. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10436. *)
  10437. IF ~backend.cellsAreObjects THEN
  10438. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  10439. END;
  10440. ReleaseOperand(s0);
  10441. ReleaseOperand(s1);
  10442. IF backend.cellsAreObjects THEN
  10443. CallThis(position,"ActiveCellsRuntime","Send",2);
  10444. ELSE
  10445. CallThis(position,ChannelModuleName,"Send",2);
  10446. END;
  10447. (* ----- RECEIVE ------*)
  10448. ELSE
  10449. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  10450. tmp := p0; p0 := p1; p1 := tmp;
  10451. END;
  10452. Evaluate(p0,s0);
  10453. Emit(Push(position,s0.op));
  10454. Designate(p1,s1);
  10455. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10456. Emit(Push(position,s1.op));
  10457. (*
  10458. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10459. *)
  10460. IF ~backend.cellsAreObjects THEN
  10461. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  10462. END;
  10463. ReleaseOperand(s0);
  10464. ReleaseOperand(s1);
  10465. IF backend.cellsAreObjects THEN
  10466. CallThis(position,"ActiveCellsRuntime","Receive",2);
  10467. ELSE
  10468. CallThis(position,ChannelModuleName,"Receive",2)
  10469. END;
  10470. END;
  10471. END VisitCommunicationStatement;
  10472. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  10473. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  10474. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  10475. VAR false: Label; condition, value: BOOLEAN;
  10476. BEGIN
  10477. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  10478. IF condition THEN
  10479. false := NewLabel();
  10480. Condition(if.condition,false,FALSE);
  10481. StatementSequence(if.statements);
  10482. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  10483. SetLabel(false);
  10484. ELSE
  10485. IF value THEN (* always true *)
  10486. escape := TRUE;
  10487. StatementSequence(if.statements);
  10488. (* no branch necessary -- rest skipped *)
  10489. END;
  10490. END;
  10491. END IfPart;
  10492. BEGIN
  10493. IF Trace THEN TraceEnter("VisitIfStatement") END;
  10494. end := NewLabel();
  10495. elsifs := x.ElsifParts();
  10496. IfPart(x.ifPart,elsifs=0);
  10497. FOR i := 0 TO elsifs-1 DO
  10498. IF ~escape THEN
  10499. elsif := x.GetElsifPart(i);
  10500. IfPart(elsif, i=elsifs-1);
  10501. END;
  10502. END;
  10503. IF (x.elsePart # NIL) & ~escape THEN
  10504. StatementSequence(x.elsePart);
  10505. END;
  10506. SetLabel(end);
  10507. IF Trace THEN TraceExit("VisitIfStatement") END;
  10508. END VisitIfStatement;
  10509. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  10510. VAR reg: IntermediateCode.Operand;
  10511. BEGIN
  10512. trueL := NewLabel();
  10513. IF backend.cooperative THEN
  10514. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  10515. Emit(Mov(position,reg,tag));
  10516. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  10517. ReleaseIntermediateOperand(reg);
  10518. ELSE
  10519. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  10520. END;
  10521. END BrWithPart;
  10522. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  10523. BEGIN
  10524. StatementSequence(x.statements);
  10525. END EmitWithPart;
  10526. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  10527. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  10528. tag: IntermediateCode.Operand;
  10529. BEGIN
  10530. IF Trace THEN TraceEnter("VisitWithStatement") END;
  10531. endL := NewLabel();
  10532. elseL := NewLabel();
  10533. Designate(x.variable,res);
  10534. IF IsPointerToRecord(x.variable.type,recordType) THEN
  10535. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  10536. END;
  10537. ReuseCopy(tag, res.tag);
  10538. ReleaseOperand(res);
  10539. NEW(trueL, x.WithParts());
  10540. FOR i := 0 TO x.WithParts()-1 DO
  10541. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  10542. END;
  10543. ReleaseIntermediateOperand(tag);
  10544. BrL(elseL);
  10545. FOR i := 0 TO x.WithParts()-1 DO
  10546. SetLabel(trueL[i]);
  10547. EmitWithPart(x.GetWithPart(i));
  10548. BrL(endL);
  10549. END;
  10550. SetLabel(elseL);
  10551. IF x.elsePart = NIL THEN
  10552. IF ~isUnchecked THEN
  10553. EmitTrap(position,WithTrap);
  10554. END;
  10555. ELSE
  10556. StatementSequence(x.elsePart)
  10557. END;
  10558. SetLabel(endL);
  10559. IF Trace THEN TraceExit("VisitWithStatement") END;
  10560. END VisitWithStatement;
  10561. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  10562. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  10563. out,else: Label; label: Label;
  10564. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  10565. symbol: SyntaxTree.Symbol;
  10566. table: BOOLEAN;
  10567. BEGIN
  10568. (*! split case statement into if-elsif statements for large case label lists *)
  10569. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  10570. range := x.max-x.min+1;
  10571. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  10572. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  10573. table := FALSE;
  10574. size := x.caseParts.Length();
  10575. ELSE
  10576. table := TRUE;
  10577. size := LONGINT(range);
  10578. END;
  10579. Evaluate(x.variable,var);
  10580. ReuseCopy(tmp,var.op);
  10581. ReleaseIntermediateOperand(var.op);
  10582. var.op := tmp;
  10583. (*
  10584. UniqueId(name,module.module,"case",caseId);
  10585. *)
  10586. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  10587. else := NewLabel();
  10588. IF table THEN
  10589. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  10590. Convert(var.op,addressType);
  10591. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  10592. ReuseCopy(res,var.op);
  10593. ReleaseOperand(var);
  10594. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  10595. Global.GetModuleSegmentedName(module.module, name);
  10596. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  10597. symbol := SyntaxTree.NewSymbol(name[1]);
  10598. symbol.SetScope(moduleScope);
  10599. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  10600. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  10601. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  10602. Emit(Add(position,res,res,jmp));
  10603. IntermediateCode.MakeMemory(res,addressType);
  10604. Emit(Br(position,res));
  10605. ReleaseIntermediateOperand(res);
  10606. ELSE
  10607. ReuseCopy(res,var.op); (* make sure it is in a register *)
  10608. ReleaseOperand(var);
  10609. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  10610. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  10611. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10612. part := x.GetCasePart(i);
  10613. constant := part.firstConstant;
  10614. fixups[i] := NewLabel();
  10615. WHILE(constant # NIL) DO (* case labels for this case part *)
  10616. IF constant.min = constant.max THEN
  10617. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  10618. ELSE
  10619. label := NewLabel();
  10620. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  10621. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  10622. BrL(fixups[i]);
  10623. SetLabel(label);
  10624. END;
  10625. constant := constant.next;
  10626. END;
  10627. END;
  10628. BrL(else);
  10629. ReleaseIntermediateOperand(res);
  10630. END;
  10631. out := NewLabel();
  10632. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10633. part := x.GetCasePart(i);
  10634. constant := part.firstConstant;
  10635. IF table THEN
  10636. label := NewLabel();
  10637. SetLabel(label);
  10638. WHILE(constant # NIL) DO (* case labels for this case part *)
  10639. FOR j := constant.min TO constant.max DO
  10640. fixups[j-x.min] := label;
  10641. END;
  10642. constant := constant.next;
  10643. END;
  10644. ELSE
  10645. SetLabel(fixups[i]);
  10646. END;
  10647. StatementSequence(part.statements);
  10648. BrL(out);
  10649. END;
  10650. SetLabel(else);
  10651. FOR i := 0 TO size-1 DO
  10652. IF fixups[i] = NIL THEN
  10653. fixups[i] := else;
  10654. END;
  10655. END;
  10656. IF x.elsePart # NIL THEN
  10657. StatementSequence(x.elsePart);
  10658. ELSIF ~isUnchecked THEN
  10659. EmitTrap(position,CaseTrap);
  10660. END;
  10661. SetLabel(out);
  10662. IF table THEN
  10663. FOR i := 0 TO size-1 DO
  10664. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  10665. section.Emit(Data(position,op));
  10666. END;
  10667. END;
  10668. IF Trace THEN TraceExit("VisitCaseStatement") END;
  10669. END VisitCaseStatement;
  10670. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  10671. VAR startL,falseL: Label;
  10672. BEGIN
  10673. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  10674. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10675. startL := NewLabel();
  10676. falseL := NewLabel();
  10677. SetLabel(startL);
  10678. Condition(x.condition,falseL,FALSE);
  10679. StatementSequence(x.statements);
  10680. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10681. BrL(startL);
  10682. SetLabel(falseL);
  10683. IF Trace THEN TraceExit("VisitWhileStatement") END;
  10684. END VisitWhileStatement;
  10685. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  10686. VAR falseL: Label;
  10687. BEGIN
  10688. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  10689. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10690. falseL := NewLabel();
  10691. SetLabel(falseL);
  10692. StatementSequence(x.statements);
  10693. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10694. Condition(x.condition,falseL,FALSE);
  10695. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  10696. END VisitRepeatStatement;
  10697. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  10698. VAR
  10699. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  10700. temporaryVariable: SyntaxTree.Variable;
  10701. temporaryVariableDesignator : SyntaxTree.Designator;
  10702. BEGIN
  10703. IF Trace THEN TraceEnter("VisitForStatement") END;
  10704. falseL := NewLabel();
  10705. startL := NewLabel();
  10706. Assign(x.variable,x.from);
  10707. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  10708. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  10709. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  10710. Assign(temporaryVariableDesignator,x.to);
  10711. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  10712. IF by > 0 THEN
  10713. cmp := Scanner.LessEqual
  10714. ELSE
  10715. cmp := Scanner.GreaterEqual
  10716. END;
  10717. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  10718. binary.SetType(system.booleanType);
  10719. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10720. SetLabel(startL);
  10721. Condition(binary,falseL, FALSE);
  10722. StatementSequence(x.statements);
  10723. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  10724. binary.SetType(x.variable.type);
  10725. Assign(x.variable,binary);
  10726. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10727. BrL(startL);
  10728. SetLabel(falseL);
  10729. IF Trace THEN TraceExit("VisitForStatement") END;
  10730. END VisitForStatement;
  10731. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  10732. VAR prevLoop: Label;
  10733. BEGIN
  10734. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  10735. prevLoop := currentLoop;
  10736. currentLoop := NewLabel();
  10737. StatementSequence(x.statements);
  10738. SetLabel(currentLoop);
  10739. currentLoop := prevLoop;
  10740. IF Trace THEN TraceExit("VisitExitableBlock") END;
  10741. END VisitExitableBlock;
  10742. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  10743. VAR prevLoop,start: Label;
  10744. BEGIN
  10745. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  10746. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10747. start := NewLabel();
  10748. prevLoop := currentLoop;
  10749. SetLabel(start);
  10750. currentLoop := NewLabel();
  10751. StatementSequence(x.statements);
  10752. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10753. BrL(start);
  10754. SetLabel(currentLoop);
  10755. currentLoop := prevLoop;
  10756. IF Trace THEN TraceExit("VisitLoopStatement") END;
  10757. END VisitLoopStatement;
  10758. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  10759. VAR outer: SyntaxTree.Statement;
  10760. BEGIN
  10761. IF Trace THEN TraceEnter("VisitExitStatement") END;
  10762. IF locked THEN (* r if we jump out of an exclusive block *)
  10763. outer := x.outer;
  10764. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  10765. outer := outer.outer;
  10766. END;
  10767. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  10768. Lock(FALSE);
  10769. END;
  10770. END;
  10771. BrL(currentLoop);
  10772. IF Trace THEN TraceExit("VisitExitStatement") END;
  10773. END VisitExitStatement;
  10774. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  10775. VAR
  10776. expression, parameterDesignator: SyntaxTree.Expression;
  10777. type, componentType: SyntaxTree.Type;
  10778. res, right: Operand;
  10779. left, mem, reg: IntermediateCode.Operand;
  10780. parameter: SyntaxTree.Parameter;
  10781. procedure: SyntaxTree.Procedure;
  10782. procedureType: SyntaxTree.ProcedureType;
  10783. returnTypeOffset: LONGINT;
  10784. delegate: BOOLEAN;
  10785. map: SymbolMap;
  10786. callingConvention, parametersSize: LONGINT;
  10787. BEGIN
  10788. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  10789. expression := x.returnValue;
  10790. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  10791. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10792. IF currentIsInline THEN
  10793. IF expression # NIL THEN
  10794. map := currentMapper.Get(NIL);
  10795. IF map # NIL THEN
  10796. Assign(map.to, expression);
  10797. ELSE
  10798. Evaluate(expression,res);
  10799. Emit(Return(position,res.op));
  10800. ReleaseOperand(res);
  10801. END;
  10802. END;
  10803. BrL(currentInlineExit);
  10804. RETURN;
  10805. END;
  10806. IF expression # NIL THEN
  10807. type := expression.type.resolved;
  10808. IF (expression IS SyntaxTree.ResultDesignator) THEN
  10809. IF locked THEN Lock(FALSE) END;
  10810. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10811. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10812. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  10813. 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
  10814. (* return without structured return parameter *)
  10815. Evaluate(expression,res);
  10816. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  10817. IF locked OR profile THEN
  10818. Emit(Push(position,res.op));
  10819. IF delegate THEN HALT(200) END;
  10820. ReleaseOperand(res);
  10821. IF locked THEN Lock(FALSE) END;
  10822. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10823. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10824. reg := NewRegisterOperand(res.op.type);
  10825. Emit(Pop(position,reg));
  10826. Emit(Return(position,reg));
  10827. ReleaseIntermediateOperand(reg);
  10828. ELSE
  10829. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10830. Emit(Return(position,res.op));
  10831. ReleaseOperand(res);
  10832. END;
  10833. 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()
  10834. THEN
  10835. (* return using structured return parameter *)
  10836. 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)
  10837. OR (type IS SyntaxTree.StringType)
  10838. OR SemanticChecker.IsPointerType(type));
  10839. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10840. parameter :=procedureType.returnParameter;
  10841. ASSERT(parameter # NIL);
  10842. returnTypeOffset := parameter.offsetInBits;
  10843. (*
  10844. IF parameter# NIL THEN
  10845. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10846. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10847. ELSE
  10848. returnTypeOffset := system.offsetFirstParameter
  10849. END;
  10850. *)
  10851. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10852. IF type IS SyntaxTree.RangeType THEN
  10853. (* array range type *)
  10854. Evaluate(expression, right);
  10855. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10856. Emit(Mov(position,mem, right.op)); (* first *)
  10857. ReleaseIntermediateOperand(mem);
  10858. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10859. Emit(Mov(position,mem, right.tag)); (* last *)
  10860. ReleaseIntermediateOperand(mem);
  10861. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10862. Emit(Mov(position,mem, right.extra)); (* step *)
  10863. ReleaseIntermediateOperand(mem);
  10864. ReleaseOperand(right);
  10865. ELSIF type IS SyntaxTree.ComplexType THEN
  10866. Evaluate(expression, right);
  10867. componentType := type(SyntaxTree.ComplexType).componentType;
  10868. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10869. Emit(Mov(position,mem, right.op)); (* real part *)
  10870. ReleaseIntermediateOperand(mem);
  10871. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10872. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10873. ReleaseIntermediateOperand(mem);
  10874. ReleaseOperand(right);
  10875. ELSE (* covers cases: pointer / record / array *)
  10876. parameter := procedureType.returnParameter;
  10877. checker.SetCurrentScope(currentScope);
  10878. ASSERT(parameter # NIL);
  10879. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10880. Assign(parameterDesignator,expression);
  10881. END;
  10882. ReleaseIntermediateOperand(left);
  10883. IF locked THEN Lock(FALSE) END;
  10884. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10885. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10886. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10887. parameter := procedureType.returnParameter;
  10888. checker.SetCurrentScope(currentScope);
  10889. IF parameter = NIL THEN
  10890. Error(procedure.position, "structured return of parameter of procedure not found");
  10891. ELSE
  10892. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10893. Assign(parameterDesignator,expression);
  10894. END;
  10895. IF locked THEN Lock(FALSE) END;
  10896. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10897. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10898. ELSE
  10899. HALT(200);
  10900. END;
  10901. ELSE
  10902. IF locked THEN Lock(FALSE) END;
  10903. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10904. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10905. END;
  10906. IF backend.cooperative THEN
  10907. BrL(exitLabel);
  10908. ELSE
  10909. callingConvention := procedureType.callingConvention;
  10910. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10911. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10912. ELSE
  10913. parametersSize := 0;
  10914. END;
  10915. EmitLeave(section, position,procedure, callingConvention);
  10916. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10917. END;
  10918. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10919. END VisitReturnStatement;
  10920. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10921. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10922. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10923. statements: SyntaxTree.StatementSequence;
  10924. name, suffix: SyntaxTree.IdentifierString;
  10925. BEGIN
  10926. Strings.IntToStr(awaitProcCounter,suffix);
  10927. Strings.Concat("@AwaitProcedure",suffix,name);
  10928. identifier := SyntaxTree.NewIdentifier(name);
  10929. INC(awaitProcCounter);
  10930. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10931. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10932. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10933. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10934. procedure.SetAccess(SyntaxTree.Hidden);
  10935. procedure.SetScope(currentScope);
  10936. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10937. procedureType.SetReturnType(system.booleanType);
  10938. procedure.SetType(procedureType);
  10939. body := SyntaxTree.NewBody(x.position,procedureScope);
  10940. procedureScope.SetBody(body);
  10941. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10942. returnStatement.SetReturnValue(x.condition);
  10943. statements := SyntaxTree.NewStatementSequence();
  10944. statements.AddStatement(returnStatement);
  10945. body.SetStatementSequence(statements);
  10946. currentScope.AddProcedure(procedure);
  10947. RETURN procedure
  10948. END MakeAwaitProcedure;
  10949. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10950. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10951. call: IntermediateCode.Operand; label, startL, trueL: Label; name: Basic.SegmentedName;
  10952. BEGIN
  10953. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10954. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10955. IF backend.cooperative THEN
  10956. startL := NewLabel();
  10957. trueL := NewLabel();
  10958. SetLabel(startL);
  10959. Condition(x.condition,trueL,TRUE);
  10960. PushSelfPointer();
  10961. CallThis(position,"ExclusiveBlocks","Await",1);
  10962. BrL(startL);
  10963. SetLabel(trueL);
  10964. PushSelfPointer();
  10965. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10966. ELSE
  10967. proc := MakeAwaitProcedure(x);
  10968. Emit(Push(position,fp));
  10969. GetCodeSectionNameForSymbol(proc,name);
  10970. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10971. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10972. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10973. Emit(Call(position,call,ProcParametersSize(proc)));
  10974. Emit(Result(position,res));
  10975. (*
  10976. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10977. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10978. *)
  10979. InitOperand(result,ModeValue);
  10980. result.op := res;
  10981. label := NewLabel();
  10982. BreqL(label, result.op, SELF.true);
  10983. ReleaseOperand(result);
  10984. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10985. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10986. Emit(Push(position,res));
  10987. Emit(Push(position,fp));
  10988. PushSelfPointer();
  10989. Emit(Push(position,nil));
  10990. CallThis(position,"Objects","Await",4);
  10991. SetLabel(label);
  10992. END;
  10993. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10994. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10995. END VisitAwaitStatement;
  10996. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10997. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10998. BEGIN
  10999. FOR i := 0 TO x.Length() - 1 DO
  11000. statement := x.GetStatement( i );
  11001. Statement(statement);
  11002. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  11003. END;
  11004. END StatementSequence;
  11005. PROCEDURE PushSelfPointer;
  11006. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  11007. procedureType: SyntaxTree.ProcedureType;
  11008. BEGIN
  11009. scope := currentScope;
  11010. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  11011. scope := scope.outerScope;
  11012. END;
  11013. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  11014. moduleSection := meta.ModuleSection();
  11015. IF backend.cooperative THEN
  11016. moduleOffset := 0;
  11017. ELSE
  11018. moduleOffset := moduleSection.pc;
  11019. END;
  11020. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  11021. ELSE
  11022. GetBaseRegister(op.op,currentScope,scope);
  11023. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11024. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11025. parametersSize := ProcParametersSize(procedure);
  11026. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  11027. IF backend.cooperative THEN
  11028. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  11029. END;
  11030. IntermediateCode.MakeMemory(op.op,addressType);
  11031. END;
  11032. Emit(Push(position,op.op));
  11033. ReleaseOperand(op);
  11034. END PushSelfPointer;
  11035. PROCEDURE Lock(lock: BOOLEAN);
  11036. BEGIN
  11037. IF Trace THEN TraceEnter("Lock") END;
  11038. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  11039. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  11040. ASSERT(modifyAssignmentCounter = 0);
  11041. IF dump # NIL THEN
  11042. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  11043. dump.Ln;dump.Update;
  11044. END;
  11045. PushSelfPointer;
  11046. IF backend.cooperative THEN
  11047. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  11048. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  11049. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  11050. END;
  11051. ELSE
  11052. Emit(Push(position,true));
  11053. IF lock THEN CallThis(position,"Objects","Lock",2)
  11054. ELSE CallThis(position,"Objects","Unlock",2);
  11055. END;
  11056. END;
  11057. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11058. IF Trace THEN TraceExit("Lock") END;
  11059. END Lock;
  11060. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  11061. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  11062. BEGIN
  11063. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  11064. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11065. previouslyUnchecked := isUnchecked;
  11066. isUnchecked := isUnchecked OR x.isUnchecked;
  11067. previouslyCooperativeSwitches := cooperativeSwitches;
  11068. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  11069. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  11070. IF x.statements # NIL THEN
  11071. StatementSequence(x.statements);
  11072. END;
  11073. IF (x IS SyntaxTree.Body) THEN
  11074. IF (x(SyntaxTree.Body).finally # NIL) THEN
  11075. section.SetFinally(section.pc);
  11076. StatementSequence(x(SyntaxTree.Body).finally)
  11077. ELSIF x.isExclusive THEN
  11078. end := NewLabel();
  11079. BrL(end);
  11080. section.SetFinally(section.pc);
  11081. Lock(FALSE);
  11082. EmitTrap(position,RethrowTrap);
  11083. SetLabel(end);
  11084. END;
  11085. END;
  11086. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  11087. isUnchecked := previouslyUnchecked;
  11088. cooperativeSwitches := previouslyCooperativeSwitches;
  11089. IF Trace THEN TraceExit("VisitStatementBlock") END;
  11090. END VisitStatementBlock;
  11091. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  11092. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  11093. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  11094. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  11095. procedure: SyntaxTree.Procedure;
  11096. map: SymbolMap;
  11097. callingConvention, parametersSize: LONGINT;
  11098. BEGIN
  11099. scope := currentScope;
  11100. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  11101. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11102. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11103. return := emptyOperand;
  11104. IF Trace THEN TraceEnter("VisitCode") END;
  11105. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  11106. NEW(in, x.inRules.Length());
  11107. FOR i := 0 TO LEN(in)-1 DO
  11108. statement := x.inRules.GetStatement(i);
  11109. WITH statement: SyntaxTree.Assignment DO
  11110. Evaluate(statement.right, operand);
  11111. result := operand.op;
  11112. NEW(str, 64);
  11113. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  11114. in[i] := result; IntermediateCode.SetString(in[i], str);
  11115. ReleaseIntermediateOperand(operand.tag);
  11116. END;
  11117. END;
  11118. ELSE in := NIL
  11119. END;
  11120. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  11121. NEW(out, x.outRules.Length());
  11122. FOR i := 0 TO LEN(out)-1 DO
  11123. statement := x.outRules.GetStatement(i);
  11124. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  11125. WITH statement:
  11126. SyntaxTree.Assignment DO
  11127. Designate(statement.left, operand);
  11128. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  11129. NEW(str, 64);
  11130. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  11131. out[i] := result; IntermediateCode.SetString(out[i], str);
  11132. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  11133. | SyntaxTree.ReturnStatement DO
  11134. NEW(str, 64);
  11135. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  11136. IF currentIsInline THEN
  11137. map := currentMapper.Get(NIL);
  11138. Designate(map.to, operand);
  11139. IF map.isAddress THEN
  11140. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11141. ELSE
  11142. result := operand.op;
  11143. END;
  11144. (*! only if it does not fit into register
  11145. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11146. *)
  11147. (*Evaluate(map.to, operand);*)
  11148. out[i] := result;
  11149. ELSE
  11150. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  11151. END;
  11152. IntermediateCode.SetString(out[i], str);
  11153. ReleaseIntermediateOperand(operand.tag);
  11154. return := out[i];
  11155. ELSE
  11156. END;
  11157. END;
  11158. ELSE out := NIL
  11159. END;
  11160. Emit(Asm(x.position,x.sourceCode, in, out));
  11161. IF in # NIL THEN
  11162. FOR i := 0 TO LEN(in)-1 DO
  11163. ReleaseIntermediateOperand(in[i]);
  11164. END;
  11165. END;
  11166. IF out # NIL THEN
  11167. FOR i := 0 TO LEN(out)-1 DO
  11168. WITH statement:
  11169. SyntaxTree.Assignment DO
  11170. ReleaseIntermediateOperand(out[i]);
  11171. |SyntaxTree.ReturnStatement DO
  11172. (* release happens below *)
  11173. ELSE
  11174. END;
  11175. statement := x.outRules.GetStatement(i);
  11176. END;
  11177. END;
  11178. IF return.mode # IntermediateCode.Undefined THEN
  11179. IF currentIsInline THEN
  11180. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  11181. Symbol(procedureType.returnParameter, par);
  11182. MakeMemory(mem, par.op, return.type, 0);
  11183. ReleaseOperand(par);
  11184. Emit(Mov(position, mem, return));
  11185. ReleaseIntermediateOperand(mem);
  11186. ELSE
  11187. Emit(Return(position,return));
  11188. END;
  11189. ReleaseIntermediateOperand(return);
  11190. IF currentIsInline THEN RETURN END;
  11191. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  11192. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  11193. parametersSize := ProcedureParametersSize(backend.system,procedure);
  11194. ELSE
  11195. parametersSize := 0;
  11196. END;
  11197. EmitLeave(section, position,procedure, callingConvention);
  11198. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  11199. END;
  11200. IF Trace THEN TraceExit("VisitCode") END;
  11201. END VisitCode;
  11202. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  11203. BEGIN
  11204. RETURN ProcedureParametersSize(system, procedure);
  11205. END ProcParametersSize;
  11206. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  11207. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  11208. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  11209. const, call: IntermediateCode.Operand;
  11210. parameterDesignator: SyntaxTree.Expression;
  11211. saved: RegisterEntry;
  11212. name: Basic.SegmentedName;
  11213. BEGIN
  11214. IF Trace THEN TraceEnter("ParameterCopies") END;
  11215. parameter := x.firstParameter;
  11216. WHILE parameter # NIL DO
  11217. IF parameter.kind = SyntaxTree.ValueParameter THEN
  11218. type := parameter.type.resolved;
  11219. IF IsOpenArray(type) THEN
  11220. VisitParameter(parameter);
  11221. op := result;
  11222. IF backend.cooperative & parameter.NeedsTrace() THEN
  11223. length := GetArrayLength(type, op.tag);
  11224. size := NewRegisterOperand(addressType);
  11225. base := ArrayBaseType(type);
  11226. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  11227. Emit(Mul(position, size, length, const));
  11228. dst := NewRegisterOperand (addressType);
  11229. Emit(Mov(position, dst, size));
  11230. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11231. Emit(Sub(position,dst,sp,dst));
  11232. Emit(And(position,dst,dst,const));
  11233. Emit(Mov(position,sp,dst));
  11234. par := fp;
  11235. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11236. IntermediateCode.InitImmediate(null, byteType, 0);
  11237. Emit(Fill(position, dst, size, null));
  11238. ReleaseIntermediateOperand(dst);
  11239. ReleaseIntermediateOperand(length);
  11240. SaveRegisters();ReleaseUsedRegisters(saved);
  11241. (* register dst has been freed before SaveRegisters already *)
  11242. base := ArrayBaseType(type);
  11243. (* assign method of open array *)
  11244. IF base.IsRecordType() THEN
  11245. Emit (Push(position, length));
  11246. Emit (Push(position, dst));
  11247. Emit (Push(position, op.op));
  11248. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  11249. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  11250. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  11251. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  11252. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  11253. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  11254. Emit (Push(position,length));
  11255. Emit (Push(position, dst));
  11256. Emit (Push(position, length));
  11257. Emit (Push(position, op.op));
  11258. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  11259. ELSE
  11260. Emit (Push(position, length));
  11261. Emit (Push(position, dst));
  11262. Emit (Push(position, length));
  11263. Emit (Push(position, op.op));
  11264. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  11265. ASSERT(ArrayBaseType(type).IsPointer());
  11266. END;
  11267. RestoreRegisters(saved);
  11268. ELSE
  11269. temp := GetDynamicSize(type,op.tag);
  11270. ReuseCopy(size,temp);
  11271. ReleaseIntermediateOperand(temp);
  11272. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11273. Emit(Sub(position,size,sp,size));
  11274. Emit(And(position,size,size,const));
  11275. Emit(Mov(position,sp,size));
  11276. par := fp;
  11277. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11278. ReleaseIntermediateOperand(size);
  11279. size := GetDynamicSize(type,op.tag);
  11280. END;
  11281. Emit(Copy(position,sp,op.op,size));
  11282. ReleaseIntermediateOperand(size);
  11283. ReleaseOperand(op);
  11284. IntermediateCode.MakeMemory(par,addressType);
  11285. Emit(Mov(position,par,sp));
  11286. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  11287. checker.SetCurrentScope(currentScope);
  11288. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  11289. Assign(parameterDesignator,parameterDesignator);
  11290. END;
  11291. END;
  11292. parameter := parameter.nextParameter;
  11293. END;
  11294. IF Trace THEN TraceExit("ParameterCopies") END;
  11295. END ParameterCopies;
  11296. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  11297. VAR x: SyntaxTree.Variable;
  11298. BEGIN
  11299. x := scope.firstVariable;
  11300. WHILE x # NIL DO
  11301. InitVariable(x,FALSE);
  11302. x := x.nextVariable;
  11303. END;
  11304. END InitVariables;
  11305. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  11306. BEGIN
  11307. IF (symbol # NIL) THEN
  11308. RETURN fingerPrinter.SymbolFP(symbol).public
  11309. ELSE
  11310. RETURN 0
  11311. END;
  11312. END GetFingerprint;
  11313. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  11314. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  11315. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  11316. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  11317. name: Basic.SegmentedName;
  11318. offset: LONGINT;
  11319. BEGIN
  11320. IF Trace THEN TraceEnter("Body") END;
  11321. ReleaseUsedRegisters(saved); (* just in case ... *)
  11322. section := ir;
  11323. exitLabel := NewLabel ();
  11324. IF moduleBody THEN moduleBodySection := section END;
  11325. IF ir.comments # NIL THEN
  11326. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  11327. commentPrintout.SingleStatement(TRUE);
  11328. dump := ir.comments;
  11329. ELSE
  11330. commentPrintout := NIL;
  11331. dump := NIL;
  11332. END;
  11333. prevScope := currentScope;
  11334. currentScope := scope;
  11335. lastSwitchPC := 0;
  11336. cooperativeSwitches := backend.cooperative;
  11337. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11338. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11339. IF x # NIL THEN
  11340. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11341. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  11342. IF moduleBody THEN
  11343. ProfilerInit();
  11344. ELSE
  11345. Basic.SegmentedNameToString(ir.name, string);
  11346. ProfilerAddProcedure(numberProcedures,string);
  11347. ProfilerEnterExit(numberProcedures,TRUE);
  11348. END;
  11349. END;
  11350. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  11351. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  11352. END;
  11353. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  11354. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  11355. cellScope := scope.outerScope(SyntaxTree.CellScope);
  11356. IF procedure = cellScope.bodyProcedure THEN
  11357. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  11358. StaticCallOperand(op, cellScope.constructor);
  11359. Emit(Call(position,op.op,0));
  11360. END;
  11361. END;
  11362. END;
  11363. InitVariables(scope);
  11364. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  11365. GetCodeSectionNameForSymbol(procedure, name);
  11366. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  11367. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  11368. IF ProtectModulesPointers THEN
  11369. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  11370. ELSE
  11371. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  11372. END;
  11373. IntermediateCode.SetOffset(right,offset); (* tag *)
  11374. IntermediateCode.InitMemory(left,addressType,fp,0);
  11375. Emit(Mov(position, left, right));
  11376. END;
  11377. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  11378. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  11379. ParameterCopies(procedureType);
  11380. IF x.code = NIL THEN
  11381. VisitStatementBlock(x);
  11382. ELSE
  11383. VisitCode(x.code)
  11384. END;
  11385. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  11386. IF ~backend.cooperative THEN
  11387. ProfilerEnterExit(numberProcedures,FALSE);
  11388. END;
  11389. INC(numberProcedures);
  11390. END;
  11391. END;
  11392. IF backend.cooperative THEN
  11393. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  11394. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  11395. END;
  11396. IF x # NIL THEN
  11397. SELF.position := x.position;
  11398. END;
  11399. EndBasicBlock;
  11400. CheckRegistersFree();
  11401. ASSERT(modifyAssignmentCounter = 0);
  11402. currentScope := prevScope;
  11403. IF Trace THEN TraceExit("Body") END;
  11404. END Body;
  11405. END ImplementationVisitor;
  11406. MetaDataGenerator=OBJECT
  11407. VAR
  11408. implementationVisitor: ImplementationVisitor;
  11409. declarationVisitor: DeclarationVisitor;
  11410. module: Sections.Module;
  11411. moduleName: ARRAY 128 OF CHAR;
  11412. moduleNamePool: Basic.HashTableInt;
  11413. moduleNamePoolSection: IntermediateCode.Section;
  11414. modulePointerSection: IntermediateCode.Section;
  11415. modulePointerSizePC: LONGINT;
  11416. modulePointerSectionOffset: LONGINT;
  11417. modulePointers: LONGINT;
  11418. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  11419. RecordBaseOffset: LONGINT;
  11420. MethodTableOffset: LONGINT; (* method table offset from zero *)
  11421. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  11422. TypeTags: LONGINT; (* type extension level support *)
  11423. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  11424. patchInfoPC: LONGINT;
  11425. patchCRC: LONGINT;
  11426. CONST
  11427. EmptyBlockOffset = 2;
  11428. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  11429. BEGIN
  11430. IF implementationVisitor.backend.cooperative THEN
  11431. TypeTags := MAX(LONGINT);
  11432. BaseTypesTableOffset := 0;
  11433. MethodTableOffset := 2;
  11434. TypeRecordBaseOffset := 0;
  11435. RecordBaseOffset := 0;
  11436. ELSIF simple THEN
  11437. TypeTags := 3; (* only 3 extensions allowed *)
  11438. BaseTypesTableOffset := 1;
  11439. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  11440. TypeRecordBaseOffset := 0;
  11441. RecordBaseOffset := 1;
  11442. ELSE
  11443. TypeTags := 16;
  11444. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  11445. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  11446. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  11447. (* change this when Heaps.HeapBlock is modified *)
  11448. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  11449. RecordBaseOffset := 8; (* addresses *)
  11450. ELSE
  11451. RecordBaseOffset := 9; (* addresses *)
  11452. END;
  11453. END;
  11454. SELF.simple := simple;
  11455. SELF.implementationVisitor := implementationVisitor;
  11456. SELF.declarationVisitor := declarationVisitor;
  11457. implementationVisitor.meta := SELF;
  11458. declarationVisitor.meta := SELF;
  11459. END InitMetaDataGenerator;
  11460. PROCEDURE SetModule(module: Sections.Module);
  11461. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  11462. BEGIN
  11463. SELF.module := module;
  11464. Global.GetModuleName(module.module,moduleName);
  11465. Global.GetSymbolSegmentedName(module.module, name);
  11466. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  11467. NEW(moduleNamePool, 32);
  11468. (*! require GC protection *)
  11469. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  11470. IF ProtectModulesPointers THEN
  11471. name := "Heaps.AnyPtr";
  11472. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11473. (* set base pointer *)
  11474. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  11475. END;
  11476. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  11477. modulePointers := 0;
  11478. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  11479. AddPointer(moduleNamePoolSection, namePoolOffset);
  11480. END;
  11481. END SetModule;
  11482. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  11483. BEGIN
  11484. IF ~implementationVisitor.backend.cooperative THEN
  11485. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  11486. INC(modulePointers);
  11487. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  11488. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  11489. END;
  11490. END AddPointer;
  11491. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  11492. BEGIN
  11493. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  11494. END GetTypeRecordBaseOffset;
  11495. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11496. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  11497. BEGIN
  11498. (* change this when Heaps.HeapBlock is modified *)
  11499. INC(dataAdrOffset,7);
  11500. Info(section,"headerAdr");
  11501. Address(section,0);
  11502. Info(section,"typeDesc");
  11503. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  11504. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11505. NamedSymbol(section, name, symbol, 0, offset);
  11506. Info(section,"mark: LONGINT;");
  11507. Longint(section,-1);
  11508. Info(section,"refCount: LONGINT;");
  11509. Longint(section,0);
  11510. (*
  11511. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  11512. *)
  11513. Info(section,"dataAdr-: ADDRESS");
  11514. Symbol(section,section, dataAdrOffset,0);
  11515. Info(section,"size-: SIZE");
  11516. Address(section,0);
  11517. Info(section,"nextMark: HeapBlock;");
  11518. Address(section,0);
  11519. END HeapBlock;
  11520. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11521. VAR i: LONGINT;
  11522. BEGIN
  11523. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  11524. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  11525. Info(section,"count*: LONGINT");
  11526. Longint(section,0);
  11527. Info(section,"locked*: BOOLEAN");
  11528. Longint(section,0);
  11529. Info(section,"awaitingLock*: ProcessQueue");
  11530. Address(section,0);
  11531. Address(section,0);
  11532. Info(section,"awaitingCond*: ProcessQueue");
  11533. Address(section,0);
  11534. Address(section,0);
  11535. Info(section,"lockedBy*: ANY");
  11536. Address(section,0);
  11537. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  11538. Longint(section,1);
  11539. FOR i := 2 TO 6 DO
  11540. Longint(section,0);
  11541. END;
  11542. Info(section,"lock*: ANY");
  11543. Address(section,0);
  11544. END ProtectedHeapBlock;
  11545. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  11546. BEGIN
  11547. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  11548. END Info;
  11549. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  11550. VAR op: IntermediateCode.Operand;
  11551. BEGIN
  11552. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  11553. section.Emit(Data(Basic.invalidPosition,op));
  11554. END Address;
  11555. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  11556. VAR op: IntermediateCode.Operand;
  11557. BEGIN
  11558. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11559. section.Emit(Data(Basic.invalidPosition,op));
  11560. END Size;
  11561. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  11562. VAR op: IntermediateCode.Operand;
  11563. BEGIN
  11564. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  11565. section.Emit(Data(Basic.invalidPosition,op));
  11566. END Set;
  11567. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  11568. VAR op: IntermediateCode.Operand;
  11569. BEGIN
  11570. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11571. section.Emit(Data(Basic.invalidPosition,op));
  11572. END Longint;
  11573. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11574. VAR op,noOperand: IntermediateCode.Operand;
  11575. BEGIN
  11576. IntermediateCode.InitOperand(noOperand);
  11577. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11578. section.PatchOperands(pc,op,noOperand,noOperand);
  11579. END PatchSize;
  11580. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11581. VAR op,noOperand: IntermediateCode.Operand;
  11582. BEGIN
  11583. IntermediateCode.InitOperand(noOperand);
  11584. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11585. section.PatchOperands(pc,op,noOperand,noOperand);
  11586. END PatchLongint;
  11587. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11588. VAR op, noOperand: IntermediateCode.Operand;
  11589. BEGIN
  11590. IntermediateCode.InitOperand(noOperand);
  11591. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11592. section.PatchOperands(pc,op,noOperand,noOperand);
  11593. END PatchSymbol;
  11594. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  11595. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  11596. BEGIN
  11597. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  11598. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  11599. section.Emit(Data(Basic.invalidPosition,op));
  11600. END Boolean;
  11601. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  11602. VAR op: IntermediateCode.Operand;
  11603. BEGIN
  11604. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  11605. section.Emit(Data(Basic.invalidPosition,op));
  11606. END Char;
  11607. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  11608. VAR i: LONGINT;
  11609. BEGIN
  11610. Info(section,str);
  11611. i := 0;
  11612. WHILE(str[i] # 0X) DO
  11613. Char(section,str[i]);
  11614. INC(i);
  11615. END;
  11616. Char(section,0X);
  11617. END String;
  11618. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  11619. VAR s: Basic.SectionName;
  11620. BEGIN
  11621. StringPool.GetString(str, s);
  11622. String(section, s);
  11623. END String0;
  11624. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11625. VAR op: IntermediateCode.Operand;
  11626. BEGIN
  11627. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11628. IntermediateCode.SetOffset(op,realOffset);
  11629. section.Emit(Data(Basic.invalidPosition,op));
  11630. END NamedSymbol;
  11631. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11632. VAR op: IntermediateCode.Operand;
  11633. BEGIN
  11634. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11635. IntermediateCode.SetOffset(op,realOffset);
  11636. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  11637. END NamedSymbolAt;
  11638. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  11639. BEGIN
  11640. IF symbol= NIL THEN
  11641. Address( section, realOffset);
  11642. ASSERT(virtualOffset = 0);
  11643. ELSE
  11644. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  11645. END;
  11646. END Symbol;
  11647. (* OutPointers delivers
  11648. {pointerOffset}
  11649. *)
  11650. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  11651. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  11652. BEGIN
  11653. type := type.resolved;
  11654. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  11655. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11656. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11657. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  11658. Symbol(section, symbol, 0, offset); INC(numberPointers);
  11659. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  11660. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11661. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  11662. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  11663. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  11664. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  11665. ELSIF (type IS SyntaxTree.RecordType) THEN
  11666. (* never treat a record like a pointer, even if the pointer field is set! *)
  11667. WITH type: SyntaxTree.RecordType DO
  11668. base := type.GetBaseRecord();
  11669. IF base # NIL THEN
  11670. Pointers(offset,symbol,section, base,numberPointers);
  11671. END;
  11672. variable := type.recordScope.firstVariable;
  11673. WHILE(variable # NIL) DO
  11674. IF ~(variable.untraced) THEN
  11675. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11676. END;
  11677. variable := variable.nextVariable;
  11678. END;
  11679. END;
  11680. ELSIF (type IS SyntaxTree.CellType) THEN
  11681. WITH type: SyntaxTree.CellType DO
  11682. base := type.GetBaseRecord();
  11683. IF base # NIL THEN
  11684. Pointers(offset,symbol,section, base,numberPointers);
  11685. END;
  11686. variable := type.cellScope.firstVariable;
  11687. WHILE(variable # NIL) DO
  11688. IF ~(variable.untraced) THEN
  11689. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11690. END;
  11691. variable := variable.nextVariable;
  11692. END;
  11693. property := type.firstProperty;
  11694. WHILE(property # NIL) DO
  11695. IF ~(property.untraced) THEN
  11696. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  11697. END;
  11698. property := property.nextProperty;
  11699. END;
  11700. parameter := type.firstParameter;
  11701. WHILE(parameter # NIL) DO
  11702. IF ~(parameter.untraced) THEN
  11703. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  11704. END;
  11705. parameter := parameter.nextParameter;
  11706. END;
  11707. END;
  11708. ELSIF (type IS SyntaxTree.ArrayType) THEN
  11709. WITH type: SyntaxTree.ArrayType DO
  11710. IF type.form= SyntaxTree.Static THEN
  11711. n := type.staticLength;
  11712. base := type.arrayBase.resolved;
  11713. WHILE(base IS SyntaxTree.ArrayType) DO
  11714. type := base(SyntaxTree.ArrayType);
  11715. n := n* type.staticLength;
  11716. base := type.arrayBase.resolved;
  11717. END;
  11718. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11719. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  11720. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11721. FOR i := 0 TO n-1 DO
  11722. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11723. END;
  11724. END;
  11725. ELSE
  11726. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  11727. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11728. END;
  11729. END;
  11730. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  11731. WITH type: SyntaxTree.MathArrayType DO
  11732. IF type.form = SyntaxTree.Static THEN
  11733. n := type.staticLength;
  11734. base := type.arrayBase.resolved;
  11735. WHILE(base IS SyntaxTree.MathArrayType) DO
  11736. type := base(SyntaxTree.MathArrayType);
  11737. n := n* type.staticLength;
  11738. base := type.arrayBase.resolved;
  11739. END;
  11740. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11741. IF SemanticChecker.ContainsPointer(base) THEN
  11742. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11743. FOR i := 0 TO n-1 DO
  11744. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11745. END;
  11746. END;
  11747. ELSE
  11748. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  11749. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11750. END
  11751. END;
  11752. (* ELSE no pointers in type *)
  11753. END;
  11754. END Pointers;
  11755. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  11756. VAR position,i: LONGINT; ch: CHAR;
  11757. BEGIN
  11758. IF pool.Has(index) THEN
  11759. RETURN pool.GetInt(index)
  11760. ELSE
  11761. position := source.pc;
  11762. pool.PutInt(index, position);
  11763. Info(source, name);
  11764. i := 0;
  11765. REPEAT
  11766. ch := name[i]; INC(i);
  11767. Char( source, ch);
  11768. UNTIL ch = 0X;
  11769. END;
  11770. RETURN position;
  11771. END EnterDynamicName;
  11772. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  11773. VAR name: Basic.SectionName; position: LONGINT;
  11774. BEGIN
  11775. IF pool.Has(index) THEN
  11776. RETURN pool.GetInt(index)
  11777. ELSE
  11778. StringPool.GetString(index, name);
  11779. position := EnterDynamicName(source,name,index, pool);
  11780. END;
  11781. RETURN position;
  11782. END DynamicName;
  11783. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  11784. VAR section: IntermediateCode.Section;
  11785. BEGIN
  11786. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11787. IF implementationVisitor.backend.cooperative THEN
  11788. Info(section, "TypeDescriptor");
  11789. Basic.ToSegmentedName("BaseTypes.Array", name);
  11790. NamedSymbol(section, name,NIL, 0, 0);
  11791. BasePointer(section);
  11792. offset := 0;
  11793. ELSE
  11794. IF ProtectModulesPointers THEN
  11795. HeapBlock(mName,typeName,section,2);
  11796. END;
  11797. Info(section, "HeapBlock");
  11798. IF ProtectModulesPointers THEN
  11799. Symbol(section,section,2,0);
  11800. ELSE
  11801. Address(section,0);
  11802. END;
  11803. Info(section, "TypeDescriptor");
  11804. Address(section,0);
  11805. offset := section.pc;
  11806. END;
  11807. RETURN section
  11808. END NamedBlock;
  11809. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  11810. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  11811. BEGIN
  11812. COPY(moduleName,name);
  11813. Strings.Append(name,suffix);
  11814. Basic.ToSegmentedName(name, pooledName);
  11815. RETURN NamedBlock(mName, typeName, pooledName, offset);
  11816. END Block;
  11817. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  11818. VAR name: Basic.SegmentedName;
  11819. BEGIN
  11820. Info(source,"ArrayHeader");
  11821. IF implementationVisitor.backend.cooperative THEN
  11822. sizePC := source.pc;
  11823. Address(source,0);
  11824. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  11825. IF baseType # "" THEN
  11826. Basic.ToSegmentedName(baseType, name);
  11827. NamedSymbol(source, name,NIL, 0, 0);
  11828. ELSE
  11829. Address(source,0);
  11830. END;
  11831. Address(source,0);
  11832. ELSE
  11833. Address(source,0);
  11834. Address(source,0);
  11835. (* first pointer for GC *)
  11836. IF hasPointer THEN
  11837. (* points to first element in the array, this is NOT the base type descriptor *)
  11838. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11839. ELSE
  11840. Address(source,0);
  11841. END;
  11842. sizePC := source.pc;
  11843. Address(source,0);
  11844. Info(source,"array data");
  11845. END;
  11846. END ArrayBlock;
  11847. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11848. BEGIN
  11849. IF implementationVisitor.backend.cooperative THEN
  11850. PatchSize(section, pc, size);
  11851. PatchSize(section, pc + 3, size);
  11852. ELSE
  11853. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11854. PatchSize(section, pc, size);
  11855. END;
  11856. END PatchArray;
  11857. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11858. VAR
  11859. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  11860. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11861. poolMap: Basic.HashTableInt;
  11862. namePool: IntermediateCode.Section;
  11863. namePoolOffset: LONGINT;
  11864. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11865. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11866. BEGIN
  11867. Basic.SegmentedNameToString(s1.name,n1);
  11868. Basic.SegmentedNameToString(s2.name,n2);
  11869. index := 0;
  11870. ch1 := n1[index];
  11871. ch2 := n2[index];
  11872. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11873. INC(index);
  11874. ch1 := n1[index];
  11875. ch2 := n2[index];
  11876. END;
  11877. RETURN ch1 < ch2;
  11878. END Compare;
  11879. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11880. VAR
  11881. i, j: LONGINT;
  11882. x, t: Sections.Section;
  11883. BEGIN
  11884. IF lo < hi THEN
  11885. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11886. WHILE i <= j DO
  11887. WHILE Compare(list[i], x) DO INC(i) END;
  11888. WHILE Compare(x, list[j]) DO DEC(j) END;
  11889. IF i <= j THEN
  11890. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11891. INC(i); DEC(j)
  11892. END
  11893. END;
  11894. IF lo < j THEN QuickSort(list, lo, j) END;
  11895. IF i < hi THEN QuickSort(list, i, hi) END
  11896. END;
  11897. END QuickSort;
  11898. (*
  11899. ExportDesc* = RECORD
  11900. fp*: ADDRESS;
  11901. name* {UNTRACED}: DynamicName;
  11902. adr*: ADDRESS;
  11903. exports*: LONGINT;
  11904. dsc* {UNTRACED}: ExportArray
  11905. END;
  11906. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11907. *)
  11908. PROCEDURE ExportDesc2(
  11909. source: IntermediateCode.Section;
  11910. namePool: IntermediateCode.Section;
  11911. fingerPrinter: FingerPrinter.FingerPrinter;
  11912. symbol: Sections.Section;
  11913. name: StringPool.Index;
  11914. VAR patchAdr: LONGINT
  11915. ): BOOLEAN;
  11916. VAR fingerPrint: SyntaxTree.FingerPrint;
  11917. BEGIN
  11918. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11919. & (symbol.type # Sections.InlineCodeSection)
  11920. THEN
  11921. *)
  11922. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11923. & (symbol.type # Sections.ExitCodeSection)
  11924. & (symbol.type # Sections.InlineCodeSection))
  11925. THEN
  11926. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11927. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11928. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11929. Longint(source,fingerPrint.public);
  11930. ELSE
  11931. Longint(source, 0);
  11932. END;
  11933. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11934. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11935. Symbol(source, symbol,0,0);
  11936. patchAdr := source.pc;
  11937. Longint(source, 0);
  11938. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11939. Address(source,0);
  11940. END;
  11941. RETURN TRUE
  11942. ELSE
  11943. RETURN FALSE
  11944. END;
  11945. END ExportDesc2;
  11946. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11947. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11948. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11949. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11950. nextPatch: LONGINT;
  11951. TYPE
  11952. Scope = RECORD
  11953. elements: LONGINT;
  11954. gelements: LONGINT;
  11955. section: IntermediateCode.Section;
  11956. patchAdr: LONGINT;
  11957. arraySizePC: LONGINT;
  11958. beginPC: LONGINT; (* current scope start pc *)
  11959. END;
  11960. BEGIN
  11961. Basic.InitSegmentedName(prev);
  11962. olevel := -1;
  11963. scopes[0].section := source;
  11964. scopes[0].arraySizePC := MIN(LONGINT);
  11965. FOR s := 0 TO LEN(sections)-1 DO
  11966. symbol := sections[s];
  11967. 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
  11968. this := sections[s].name;
  11969. level := 0;
  11970. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11971. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11972. INC(level);
  11973. END;
  11974. WHILE level < olevel DO
  11975. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11976. IF olevel > 0 THEN
  11977. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11978. nextPatch := scopes[olevel-1].patchAdr+1;
  11979. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11980. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11981. END;
  11982. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11983. DEC(olevel);
  11984. END;
  11985. IF (level < LEN(this)) & (this[level] > 0) THEN
  11986. IF level > olevel THEN
  11987. (*TRACE("opening",level); *)
  11988. IF scopes[level].section = NIL THEN
  11989. arrayName := ".@ExportArray";
  11990. Strings.AppendInt(arrayName, level);
  11991. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11992. AddPointer(scopes[level].section,offset);
  11993. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11994. END;
  11995. scopes[level].beginPC := scopes[level].section.pc;
  11996. olevel := level;
  11997. scopes[olevel].elements := 0;
  11998. END;
  11999. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  12000. sym := sections[s];
  12001. ELSE
  12002. sym := NIL;
  12003. END;
  12004. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  12005. THEN
  12006. INC(scopes[olevel].elements);
  12007. END;
  12008. (* enter string in scope *)
  12009. INC(level);
  12010. END;
  12011. END;
  12012. Basic.SegmentedNameToString(this, name);
  12013. prev := this;
  12014. END;
  12015. END;
  12016. WHILE 0 <= olevel DO
  12017. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  12018. IF olevel > 0 THEN
  12019. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12020. nextPatch := scopes[olevel-1].patchAdr+1;
  12021. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12022. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12023. END;
  12024. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12025. DEC(olevel);
  12026. END;
  12027. level := 0;
  12028. WHILE (level < LEN(scopes)) DO
  12029. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  12030. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  12031. END;
  12032. INC(level);
  12033. END;
  12034. END Export;
  12035. BEGIN
  12036. NEW(fingerPrinter);
  12037. NEW(poolMap, 64);
  12038. (* 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 *)
  12039. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  12040. NEW(sectionArray, module.allSections.Length());
  12041. FOR i := 0 TO module.allSections.Length() - 1 DO
  12042. section := module.allSections.GetSection(i);
  12043. sectionArray[i] := section;
  12044. END;
  12045. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  12046. Export(sectionArray^);
  12047. END ExportDesc;
  12048. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  12049. VAR
  12050. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  12051. BEGIN
  12052. Info(source, "exception table offsets array descriptor");
  12053. size := 0;
  12054. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  12055. Info(source, "exception table content");
  12056. FOR i := 0 TO module.allSections.Length() - 1 DO
  12057. p := module.allSections.GetSection(i);
  12058. IF p.type = Sections.CodeSection THEN
  12059. finallyPC := p(IntermediateCode.Section).finally;
  12060. IF finallyPC>=0 THEN
  12061. Symbol( source, p, 0,0);
  12062. Symbol( source, p, finallyPC, 0);
  12063. Symbol( source, p, finallyPC,0);
  12064. INC(size);
  12065. END;
  12066. END
  12067. END;
  12068. PatchArray(source,sizePC,size);
  12069. END ExceptionArray;
  12070. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  12071. VAR i: LONGINT; ch: CHAR;
  12072. BEGIN
  12073. i := 0;
  12074. REPEAT
  12075. ch := name[i]; INC(i);
  12076. Char( section, ch);
  12077. UNTIL ch = 0X;
  12078. WHILE i < 32 DO
  12079. Char( section, 0X); INC(i);
  12080. END;
  12081. END Name;
  12082. PROCEDURE References(section: IntermediateCode.Section);
  12083. CONST
  12084. sfTypeNone = 0X;
  12085. sfTypeCHAR = 01X;
  12086. sfTypeCHAR8 = 02X;
  12087. sfTypeCHAR16 = 03X;
  12088. sfTypeCHAR32 = 04X;
  12089. sfTypeRANGE = 05X;
  12090. sfTypeSHORTINT = 06X;
  12091. sfTypeINTEGER = 07X;
  12092. sfTypeLONGINT = 08X;
  12093. sfTypeHUGEINT = 09X;
  12094. sfTypeWORD = 0AX;
  12095. sfTypeLONGWORD = 0BX;
  12096. sfTypeSIGNED8 = 0CX;
  12097. sfTypeSIGNED16 = 0DX;
  12098. sfTypeSIGNED32 = 0EX;
  12099. sfTypeSIGNED64 = 0FX;
  12100. sfTypeUNSIGNED8 = 10X;
  12101. sfTypeUNSIGNED16 = 11X;
  12102. sfTypeUNSIGNED32 = 12X;
  12103. sfTypeUNSIGNED64 = 13X;
  12104. sfTypeREAL = 14X;
  12105. sfTypeLONGREAL = 15X;
  12106. sfTypeCOMPLEX = 16X;
  12107. sfTypeLONGCOMPLEX = 17X;
  12108. sfTypeBOOLEAN = 18X;
  12109. sfTypeSET = 19X;
  12110. sfTypeANY = 1AX;
  12111. sfTypeOBJECT = 1BX;
  12112. sfTypeBYTE = 1CX;
  12113. sfTypeADDRESS = 1DX;
  12114. sfTypeSIZE = 1EX;
  12115. sfTypeIndirect = 1FX;
  12116. sfTypeRecord = 20X;
  12117. sfTypePointerToRecord = 21X;
  12118. sfTypePointerToArray = 22X;
  12119. sfTypeOpenArray = 23X;
  12120. sfTypeStaticArray = 24X;
  12121. sfTypeDynamicArray = 25X;
  12122. sfTypeMathStaticArray = 26X;
  12123. sfTypeMathOpenArray = 27X;
  12124. sfTypeMathTensor = 28X;
  12125. sfTypeProcedure = 29X;
  12126. sfTypeDelegate = 2AX;
  12127. sfTypeENUM = 2BX;
  12128. (* sfTypeCELL = 2CX; *)
  12129. sfTypePORT = 2DX;
  12130. sfIN = 0X;
  12131. sfOUT = 1X;
  12132. flagDelegate = 0;
  12133. flagConstructor = 1;
  12134. (* variable / parameter addressing modes *)
  12135. sfAbsolute = 0X; (* global vars *)
  12136. sfRelative = 1X; (* variables, value parameters *)
  12137. sfIndirect = 2X; (* var parameters *)
  12138. sfScopeBegin = 0F0X;
  12139. sfScopeEnd = 0F1X;
  12140. sfProcedure = 0F2X;
  12141. sfVariable = 0F3X;
  12142. sfTypeDeclaration = 0F4X;
  12143. sfModule = 0FFX;
  12144. RefInfo = TRUE;
  12145. VAR
  12146. sizePC, startPC, lastOffset: LONGINT;
  12147. indirectTypes: Basic.HashTable;
  12148. PROCEDURE CurrentIndex(): LONGINT;
  12149. VAR i: LONGINT;
  12150. BEGIN
  12151. FOR i := startPC TO section.pc -1 DO
  12152. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  12153. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  12154. END;
  12155. startPC := section.pc;
  12156. RETURN lastOffset;
  12157. END CurrentIndex;
  12158. (*
  12159. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12160. Module = sfModule prevSymbol:SIZE name:String Scope.
  12161. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12162. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  12163. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12164. Type =
  12165. sfTypePointerToRecord
  12166. | sfTypePointerToArray Type
  12167. | sfTypeOpenArray Type
  12168. | sfTypeDynamicArray Type
  12169. | sfTypeStaticArray length:SIZE Type
  12170. | sfTypeMathOpenArray Type
  12171. | sfTypeMathStaticArray length:SIZE Type
  12172. | sfTypeMathTensor Type
  12173. | sfTypeRecord tdAdr:ADDRESS
  12174. | sfTypeProcedure {Parameter} return:Type
  12175. | sfTypeDelegate {Parameter} return:Type
  12176. | sfTypePort (sfIN | sfOUT)
  12177. | sfTypeBOOLEAN
  12178. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  12179. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  12180. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  12181. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  12182. | sfTypeWORD | sfTypeLONGWORD
  12183. | sfTypeREAL | sfTypeLONGREAL
  12184. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  12185. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  12186. | sfTypeIndirect offset:SIZE.
  12187. *)
  12188. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  12189. VAR offset: SIZE;
  12190. BEGIN
  12191. IF indirectTypes.Has(type) THEN
  12192. offset := indirectTypes.GetInt(type);
  12193. Char(section, sfTypeIndirect);
  12194. Size(section, offset);
  12195. RETURN TRUE;
  12196. ELSE
  12197. indirectTypes.PutInt(type, CurrentIndex());
  12198. RETURN FALSE;
  12199. END;
  12200. END Indirect;
  12201. PROCEDURE NType(type: SyntaxTree.Type);
  12202. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  12203. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  12204. BEGIN
  12205. IF type = NIL THEN
  12206. Char(section, sfTypeNone)
  12207. ELSE
  12208. type := type.resolved;
  12209. size := type.sizeInBits;
  12210. WITH type:
  12211. SyntaxTree.PointerType DO
  12212. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  12213. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12214. Char(section, sfTypePointerToRecord);
  12215. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  12216. ELSE
  12217. IF RefInfo THEN Info(section,"PointerToArray") END;
  12218. Char(section, sfTypePointerToArray);
  12219. NType(type.pointerBase);
  12220. END;
  12221. | SyntaxTree.ArrayType DO
  12222. IF ~Indirect(type) THEN
  12223. IF type.form = SyntaxTree.Open THEN
  12224. IF RefInfo THEN Info(section,"OpenArray") END;
  12225. Char(section, sfTypeOpenArray);
  12226. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  12227. IF RefInfo THEN Info(section,"DynamicArray") END;
  12228. Char(section, sfTypeDynamicArray);
  12229. ELSIF type.form = SyntaxTree.Static THEN
  12230. IF RefInfo THEN Info(section,"StaticArray") END;
  12231. Char(section, sfTypeStaticArray);
  12232. Size(section, type.staticLength);
  12233. ELSE
  12234. HALT(100);
  12235. END;
  12236. NType(type.arrayBase);
  12237. END;
  12238. | SyntaxTree.MathArrayType DO
  12239. IF ~Indirect(type) THEN
  12240. IF type.form = SyntaxTree.Open THEN
  12241. IF RefInfo THEN Info(section,"MathOpenArray") END;
  12242. Char(section, sfTypeMathOpenArray);
  12243. ELSIF type.form = SyntaxTree.Static THEN
  12244. IF RefInfo THEN Info(section,"MathStaticArray") END;
  12245. Char(section, sfTypeMathStaticArray);
  12246. Size(section, type.staticLength);
  12247. ELSIF type.form = SyntaxTree.Tensor THEN
  12248. IF RefInfo THEN Info(section,"MathTensor") END;
  12249. Char(section, sfTypeMathTensor);
  12250. ELSE
  12251. HALT(100);
  12252. END;
  12253. NType(type.arrayBase);
  12254. END;
  12255. | SyntaxTree.RecordType DO
  12256. IF ~Indirect(type) THEN
  12257. IF type.pointerType # NIL (* OBJECT *) THEN
  12258. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12259. Char(section, sfTypePointerToRecord)
  12260. ELSE
  12261. IF RefInfo THEN Info(section,"Record") END;
  12262. Char(section, sfTypeRecord);
  12263. td := type.typeDeclaration;
  12264. IF RefInfo THEN Info(section,"TD") END;
  12265. IF (td # NIL) THEN
  12266. Global.GetSymbolSegmentedName(td,segmentedName);
  12267. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12268. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12269. ELSE
  12270. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12271. END;
  12272. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  12273. Symbol(section, tir, 0, offset);
  12274. ELSE
  12275. Address(section, 0);
  12276. END;
  12277. END;
  12278. END;
  12279. | SyntaxTree.CellType DO
  12280. IF ~Indirect(type) THEN
  12281. IF RefInfo THEN Info(section,"Record") END;
  12282. Char(section, sfTypeRecord);
  12283. td := type.typeDeclaration;
  12284. IF RefInfo THEN Info(section,"TD") END;
  12285. IF (td # NIL) THEN
  12286. Global.GetSymbolSegmentedName(td,segmentedName);
  12287. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12288. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12289. ELSE
  12290. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12291. END;
  12292. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12293. Symbol(section, tir, 0, offset);
  12294. ELSE
  12295. Address(section, 0);
  12296. END;
  12297. END;
  12298. | SyntaxTree.PortType DO
  12299. Char(section, sfTypePORT);
  12300. IF type.direction = SyntaxTree.OutPort THEN
  12301. Char(section, sfOUT)
  12302. ELSE
  12303. Char(section, sfIN)
  12304. END;
  12305. | SyntaxTree.ProcedureType DO
  12306. IF ~Indirect(type) THEN
  12307. IF type.isDelegate THEN
  12308. Char(section, sfTypeDelegate);
  12309. ELSE
  12310. Char(section, sfTypeProcedure);
  12311. END;
  12312. parameter := type.firstParameter;
  12313. WHILE(parameter # NIL) DO
  12314. NParameter(parameter, -1);
  12315. parameter := parameter.nextParameter;
  12316. END;
  12317. NType(type.returnType);
  12318. END;
  12319. | SyntaxTree.EnumerationType DO
  12320. Char(section, sfTypeENUM);
  12321. | SyntaxTree.BasicType DO
  12322. WITH type:
  12323. SyntaxTree.BooleanType DO
  12324. IF RefInfo THEN Info(section,"Boolean") END;
  12325. Char(section, sfTypeBOOLEAN);
  12326. | SyntaxTree.CharacterType DO
  12327. IF type = module.system.characterType THEN
  12328. IF RefInfo THEN Info(section,"CHAR") END;
  12329. Char(section, sfTypeCHAR);
  12330. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  12331. IF RefInfo THEN Info(section,"CHAR8") END;
  12332. Char(section, sfTypeCHAR8)
  12333. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  12334. IF RefInfo THEN Info(section,"CHAR16") END;
  12335. Char(section, sfTypeCHAR16);
  12336. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  12337. IF RefInfo THEN Info(section,"CHAR32") END;
  12338. Char(section, sfTypeCHAR32);
  12339. ELSE
  12340. HALT(100);
  12341. END;
  12342. |SyntaxTree.IntegerType DO
  12343. IF type(SyntaxTree.IntegerType).signed THEN
  12344. IF (type = module.system.shortintType) THEN
  12345. IF RefInfo THEN Info(section,"SHORTINT") END;
  12346. Char(section, sfTypeSHORTINT)
  12347. ELSIF (type = module.system.integerType) THEN
  12348. IF RefInfo THEN Info(section,"INTEGER") END;
  12349. Char(section, sfTypeINTEGER)
  12350. ELSIF (type = module.system.longintType) THEN
  12351. IF RefInfo THEN Info(section,"LONGINT") END;
  12352. Char(section, sfTypeLONGINT)
  12353. ELSIF (type = module.system.hugeintType) THEN
  12354. IF RefInfo THEN Info(section,"HUGEINT") END;
  12355. Char(section, sfTypeHUGEINT)
  12356. ELSIF (type = module.system.wordType) THEN
  12357. IF RefInfo THEN Info(section,"WORD") END;
  12358. Char(section, sfTypeWORD)
  12359. ELSIF (type = module.system.longWordType) THEN
  12360. IF RefInfo THEN Info(section,"LONGWORD") END;
  12361. Char(section, sfTypeLONGWORD);
  12362. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  12363. IF RefInfo THEN Info(section,"SIGNED8") END;
  12364. Char(section, sfTypeSIGNED8)
  12365. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  12366. IF RefInfo THEN Info(section,"SIGNED16") END;
  12367. Char(section, sfTypeSIGNED16)
  12368. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  12369. IF RefInfo THEN Info(section,"SIGNED32") END;
  12370. Char(section, sfTypeSIGNED32)
  12371. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  12372. IF RefInfo THEN Info(section,"SIGNED64") END;
  12373. Char(section, sfTypeSIGNED64)
  12374. ELSE
  12375. HALT(100);
  12376. END
  12377. ELSE (* unsigned *)
  12378. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  12379. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  12380. Char(section, sfTypeUNSIGNED8)
  12381. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  12382. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  12383. Char(section, sfTypeUNSIGNED16)
  12384. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  12385. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  12386. Char(section, sfTypeUNSIGNED32)
  12387. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  12388. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  12389. Char(section, sfTypeUNSIGNED64)
  12390. ELSE
  12391. HALT(100)
  12392. END
  12393. END;
  12394. | SyntaxTree.FloatType DO
  12395. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  12396. IF RefInfo THEN Info(section,"REAL") END;
  12397. Char(section, sfTypeREAL);
  12398. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  12399. IF RefInfo THEN Info(section,"LONGREAL") END;
  12400. Char(section, sfTypeLONGREAL);
  12401. ELSE
  12402. HALT(100);
  12403. END;
  12404. | SyntaxTree.ComplexType DO
  12405. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  12406. IF RefInfo THEN Info(section,"COMPLEX") END;
  12407. Char(section, sfTypeCOMPLEX);
  12408. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  12409. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  12410. Char(section, sfTypeLONGCOMPLEX);
  12411. ELSE
  12412. HALT(100);
  12413. END;
  12414. |SyntaxTree.SetType DO
  12415. IF RefInfo THEN Info(section,"SET") END;
  12416. Char(section, sfTypeSET);
  12417. |SyntaxTree.AnyType DO
  12418. IF RefInfo THEN Info(section,"ANY") END;
  12419. Char(section, sfTypeANY);
  12420. |SyntaxTree.ObjectType DO
  12421. IF RefInfo THEN Info(section,"OBJECT") END;
  12422. Char(section, sfTypeOBJECT);
  12423. |SyntaxTree.ByteType DO
  12424. IF RefInfo THEN Info(section,"BYTE") END;
  12425. Char(section, sfTypeBYTE);
  12426. |SyntaxTree.RangeType DO
  12427. IF RefInfo THEN Info(section,"RANGE") END;
  12428. Char(section, sfTypeRANGE)
  12429. |SyntaxTree.AddressType DO
  12430. IF RefInfo THEN Info(section,"ADDRESS") END;
  12431. Char(section, sfTypeADDRESS)
  12432. |SyntaxTree.SizeType DO
  12433. IF RefInfo THEN Info(section,"SIZE") END;
  12434. Char(section, sfTypeSIZE)
  12435. ELSE
  12436. HALT(100)
  12437. END;
  12438. ELSE HALT(101);
  12439. END;
  12440. END;
  12441. END NType;
  12442. (*
  12443. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  12444. *)
  12445. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  12446. VAR type: SyntaxTree.Type;
  12447. BEGIN
  12448. IF RefInfo THEN Info(section, "Parameter") END;
  12449. Char(section, sfVariable);
  12450. Size(section, procOffset);
  12451. String0(section, parameter.name);
  12452. type := parameter.type.resolved;
  12453. IF parameter.kind = SyntaxTree.VarParameter THEN
  12454. IF IsOpenArray(type) THEN Char(section, sfRelative)
  12455. ELSE Char(section, sfIndirect)
  12456. END;
  12457. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12458. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  12459. Char(section, sfIndirect);
  12460. ELSE
  12461. Char(section, sfRelative);
  12462. END;
  12463. ELSE
  12464. Char(section, sfRelative);
  12465. END;
  12466. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  12467. NType(parameter.type);
  12468. END NParameter;
  12469. (*
  12470. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12471. *)
  12472. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  12473. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  12474. flags: SET;
  12475. BEGIN
  12476. IF procedure.externalName # NIL THEN RETURN END;
  12477. IF RefInfo THEN Info(section, "Procedure") END;
  12478. pos := CurrentIndex();
  12479. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  12480. Char(section, sfProcedure);
  12481. Size(section, scopeOffset);
  12482. String0(section,procedure.name);
  12483. s := module.allSections.FindBySymbol(procedure);
  12484. Symbol(section,s,0,0); (* start *)
  12485. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  12486. flags := {};
  12487. IF procedureType.isDelegate THEN
  12488. INCL(flags, flagDelegate);
  12489. END;
  12490. IF procedure.isConstructor THEN
  12491. INCL(flags, flagConstructor);
  12492. END;
  12493. Set(section, flags);
  12494. IF RefInfo THEN Info(section, "Parameters") END;
  12495. parameter := procedureType.firstParameter;
  12496. WHILE(parameter # NIL) DO
  12497. NParameter(parameter, pos);
  12498. parameter := parameter.nextParameter;
  12499. END;
  12500. IF procedureType.returnParameter # NIL THEN
  12501. NParameter(procedureType.returnParameter, pos);
  12502. END;
  12503. IF procedureType.selfParameter # NIL THEN
  12504. NParameter(procedureType.selfParameter, pos);
  12505. END;
  12506. IF RefInfo THEN Info(section, "ReturnType") END;
  12507. NType(procedureType.returnType);
  12508. NScope(procedure.procedureScope, pos);
  12509. END NProcedure;
  12510. (*
  12511. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  12512. *)
  12513. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  12514. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  12515. BEGIN
  12516. IF RefInfo THEN Info(section, "Variable") END;
  12517. pos := CurrentIndex();
  12518. Char(section, sfVariable);
  12519. Size(section, scopeOffset);
  12520. String0(section, variable.name);
  12521. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  12522. Char(section, sfAbsolute);
  12523. IF variable.externalName # NIL THEN
  12524. sn := variable.externalName^;
  12525. NamedSymbol(section, sn,NIL, 0,0);
  12526. ELSE
  12527. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  12528. NamedSymbol(section, sn,variable, 0,0);
  12529. END;
  12530. ELSE
  12531. Char(section, sfRelative);
  12532. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  12533. END;
  12534. NType(variable.type);
  12535. s := module.allSections.FindBySymbol(variable);
  12536. END NVariable;
  12537. (*
  12538. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12539. *)
  12540. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  12541. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  12542. BEGIN
  12543. IF typeDeclaration = NIL THEN RETURN END;
  12544. pos := CurrentIndex();
  12545. s := module.allSections.FindBySymbol(typeDeclaration);
  12546. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  12547. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  12548. Char(section, sfTypeDeclaration);
  12549. Size(section, scopeOffset);
  12550. String0(section, typeDeclaration.name);
  12551. declared := typeDeclaration.declaredType.resolved;
  12552. IF (declared IS SyntaxTree.PointerType) THEN
  12553. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  12554. END;
  12555. WITH declared:
  12556. SyntaxTree.RecordType DO
  12557. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  12558. Symbol(section, s, 0, offset);
  12559. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12560. Basic.AppendToSegmentedName(name,".@Info");
  12561. s := module.allSections.FindByName(name);
  12562. IF s # NIL THEN (* does not work for coop *)
  12563. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12564. END;
  12565. NScope(declared.recordScope, pos);
  12566. |SyntaxTree.CellType DO
  12567. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12568. Symbol(section, s, 0, offset);
  12569. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12570. Basic.AppendToSegmentedName(name,".@Info");
  12571. s := module.allSections.FindByName(name);
  12572. IF s # NIL THEN
  12573. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12574. END;
  12575. NScope(declared.cellScope, pos);
  12576. ELSE
  12577. Address(section, 0);
  12578. END;
  12579. END NTypeDeclaration;
  12580. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  12581. VAR pos: LONGINT;
  12582. BEGIN
  12583. pos := CurrentIndex();
  12584. Char(section,sfModule);
  12585. Size(section, prevSymbol);
  12586. String0(section, module.name);
  12587. NScope(module.moduleScope, pos);
  12588. END NModule;
  12589. (*
  12590. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12591. *)
  12592. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  12593. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  12594. BEGIN
  12595. IF scope = NIL THEN RETURN END;
  12596. IF RefInfo THEN Info(section, "Scope") END;
  12597. Char(section, sfScopeBegin);
  12598. variable := scope.firstVariable;
  12599. WHILE (variable # NIL) DO
  12600. NVariable(variable, prevSymbol);
  12601. variable := variable.nextVariable;
  12602. END;
  12603. WITH scope:
  12604. SyntaxTree.ModuleScope DO
  12605. bodyProcedure := scope.bodyProcedure;
  12606. |SyntaxTree.RecordScope DO
  12607. bodyProcedure := scope.bodyProcedure;
  12608. ELSE
  12609. bodyProcedure := NIL;
  12610. END;
  12611. IF bodyProcedure # NIL THEN
  12612. NProcedure(bodyProcedure, prevSymbol)
  12613. END;
  12614. procedure := scope.firstProcedure;
  12615. WHILE procedure # NIL DO
  12616. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  12617. procedure := procedure.nextProcedure;
  12618. END;
  12619. typeDeclaration := scope.firstTypeDeclaration;
  12620. WHILE typeDeclaration # NIL DO
  12621. NTypeDeclaration(typeDeclaration, prevSymbol);
  12622. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  12623. END;
  12624. Char(section, sfScopeEnd); (* scope ends *)
  12625. END NScope;
  12626. BEGIN
  12627. NEW(indirectTypes, 32);
  12628. ArrayBlock(section,sizePC,"", FALSE);
  12629. startPC := section.pc;
  12630. NModule(module.module, -1);
  12631. PatchArray(section,sizePC,CurrentIndex());
  12632. END References;
  12633. (*
  12634. Command* = RECORD
  12635. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  12636. name*: Name; (* name of the procedure *)
  12637. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  12638. entryAdr* : ADDRESS; (* entry address of procedure *)
  12639. END;
  12640. *)
  12641. PROCEDURE CommandArray(source: IntermediateCode.Section);
  12642. VAR
  12643. p: Sections.Section; sizePC, numberCommands: LONGINT;
  12644. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  12645. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  12646. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  12647. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  12648. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  12649. BEGIN
  12650. RETURN
  12651. (type = NIL) OR
  12652. (type.resolved IS SyntaxTree.RecordType) OR
  12653. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  12654. (type.resolved IS SyntaxTree.AnyType);
  12655. END TypeAllowed;
  12656. BEGIN
  12657. numberParameters := procedureType.numberParameters;
  12658. RETURN
  12659. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  12660. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  12661. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  12662. END GetProcedureAllowed;
  12663. PROCEDURE WriteType(type : SyntaxTree.Type);
  12664. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  12665. name: Basic.SegmentedName; offset: LONGINT;
  12666. BEGIN
  12667. IF type = NIL THEN
  12668. Address(source,0);
  12669. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  12670. Address(source,1);
  12671. ELSE
  12672. type := type.resolved;
  12673. IF type IS SyntaxTree.PointerType THEN
  12674. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  12675. END;
  12676. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  12677. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  12678. name[0] := typeDeclaration.name; name[1] := -1;
  12679. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  12680. ASSERT(section # NIL);
  12681. ELSE
  12682. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12683. (* TODO *)
  12684. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  12685. END;
  12686. IF implementationVisitor.backend.cooperative THEN
  12687. offset := 0;
  12688. ELSE
  12689. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  12690. END;
  12691. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  12692. END;
  12693. END WriteType;
  12694. BEGIN
  12695. Info(source, "command array descriptor");
  12696. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  12697. numberCommands := 0;
  12698. Info(source, "command array content");
  12699. FOR i := 0 TO module.allSections.Length() - 1 DO
  12700. p := module.allSections.GetSection(i);
  12701. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  12702. procedure := p.symbol(SyntaxTree.Procedure);
  12703. procedureType := procedure.type(SyntaxTree.ProcedureType);
  12704. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  12705. procedure.GetName(name);
  12706. Name(source,name);
  12707. numberParameters := procedureType.numberParameters;
  12708. (* offset of type of first parameter *)
  12709. IF (numberParameters = 0 ) THEN WriteType(NIL)
  12710. ELSE WriteType(procedureType.firstParameter.type)
  12711. END;
  12712. (* offset of type of return parameter *)
  12713. WriteType(procedureType.returnType);
  12714. (* command name *)
  12715. (* command code offset *)
  12716. Symbol(source,p,0,0);
  12717. INC(numberCommands);
  12718. IF Trace THEN
  12719. D.Ln;
  12720. END;
  12721. END;
  12722. END
  12723. END;
  12724. PatchArray(source,sizePC,numberCommands);
  12725. END CommandArray;
  12726. (* to prevent from double import of different module aliases *)
  12727. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  12728. VAR i: SyntaxTree.Import;
  12729. BEGIN
  12730. i := module.module.moduleScope.firstImport;
  12731. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  12732. i := i.nextImport;
  12733. END;
  12734. RETURN i = import
  12735. END IsFirstDirectOccurence;
  12736. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  12737. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  12738. BEGIN
  12739. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  12740. ArrayBlock(source,pc,"", FALSE);
  12741. Info(source, "import module array data");
  12742. IF implementationVisitor.backend.cooperative THEN
  12743. offset := 0;
  12744. ELSE
  12745. IF module.system.addressType.sizeInBits = 64 THEN
  12746. (* change this when Heaps.HeapBlock is modified *)
  12747. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12748. ELSE
  12749. (* change this when Heaps.HeapBlock is modified *)
  12750. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12751. END;
  12752. END;
  12753. import := module.module.moduleScope.firstImport;
  12754. numberImports := 0;
  12755. WHILE import # NIL DO
  12756. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  12757. Global.GetModuleSegmentedName(import.module,name);
  12758. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  12759. NamedSymbol(source, name, NIL, 0, offset);
  12760. INC(numberImports);
  12761. END;
  12762. import := import.nextImport
  12763. END;
  12764. PatchArray(source,pc,numberImports);
  12765. END ImportsArray;
  12766. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  12767. VAR
  12768. p: Sections.Section; sizePC, size, i: LONGINT;
  12769. BEGIN
  12770. Info(source, "Type info section");
  12771. size := 0;
  12772. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  12773. FOR i := 0 TO module.allSections.Length() - 1 DO
  12774. p := module.allSections.GetSection(i);
  12775. WITH p: IntermediateCode.Section DO
  12776. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  12777. Symbol(source,p,EmptyBlockOffset,0);
  12778. INC(size);
  12779. END;
  12780. END
  12781. END;
  12782. PatchArray(source,sizePC,size);
  12783. END TypeInfoSection;
  12784. (*
  12785. ProcTableEntry* = RECORD
  12786. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  12787. noPtr*: LONGINT;
  12788. END;
  12789. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  12790. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  12791. *)
  12792. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12793. VAR
  12794. numberPointers: LONGINT;
  12795. procedure: SyntaxTree.Procedure;
  12796. BEGIN
  12797. Info(section,"pcFrom");
  12798. Symbol(section,procedureSection,0,0);
  12799. Info(section,"pcTo");
  12800. Symbol(section, procedureSection, procedureSection.pc, 0);
  12801. Info(section,"pointer to offsets array");
  12802. Symbol(section, section,section.pc+1,0);
  12803. Info(section,"offsets array");
  12804. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  12805. PointerArray(section, procedure.procedureScope, numberPointers);
  12806. END ProcedureDescriptor;
  12807. (* only for tracing, the descriptor is otherwise not complete ! *)
  12808. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  12809. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  12810. BEGIN
  12811. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  12812. name := procedureSection.name;
  12813. Basic.AppendToSegmentedName(name,".@Info");
  12814. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12815. Address(section,0);
  12816. Symbol(section,section,2,0);
  12817. (*
  12818. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  12819. descSize: SIZE;
  12820. sentinel: ADDRESS; (* = MPO-4 *)
  12821. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12822. flags*: SET;
  12823. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12824. name*: Name;
  12825. END;
  12826. *)
  12827. Size(section, 0);
  12828. Address(section,0);
  12829. Address(section,0);
  12830. Set(section,{});
  12831. moduleSection := ModuleSection();
  12832. Symbol( section, moduleSection, moduleSection.pc,0);
  12833. IF procedureSection.symbol = NIL THEN
  12834. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12835. ELSE
  12836. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12837. END;
  12838. Name(section, infoName);
  12839. Size(section, 0);
  12840. RETURN section;
  12841. END MakeProcedureDescriptorTag;
  12842. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12843. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12844. BEGIN
  12845. name := procedureSection.name;
  12846. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12847. IF implementationVisitor.backend.cooperative THEN
  12848. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12849. Info(section, "TypeDescriptor");
  12850. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12851. NamedSymbol(dest, name,NIL, 0, 0);
  12852. BaseRecord(dest);
  12853. offset := 0;
  12854. ELSIF CreateProcedureDescInfo THEN
  12855. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12856. Address(dest,0);
  12857. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12858. offset := dest.pc;
  12859. ELSE
  12860. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12861. END;
  12862. ProcedureDescriptor(dest, procedureSection);
  12863. Symbol(section, dest, offset, 0);
  12864. END ProcedureDescriptorPointer;
  12865. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12866. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12867. BEGIN
  12868. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12869. numberProcs := 0;
  12870. FOR i := 0 TO module.allSections.Length() - 1 DO
  12871. destination := module.allSections.GetSection(i);
  12872. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12873. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12874. INC(numberProcs);
  12875. END
  12876. END;
  12877. PatchArray(section, sizePC, numberProcs);
  12878. END ProcedureDescriptorArray;
  12879. (*
  12880. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12881. VAR
  12882. next*: Module; (** once a module is published, all fields are read-only *)
  12883. name*: Name;
  12884. init, published: BOOLEAN;
  12885. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12886. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12887. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12888. command*: POINTER TO ARRAY OF Command;
  12889. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12890. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12891. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12892. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12893. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12894. data*, code*: Bytes;
  12895. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12896. export*: ExportDesc;
  12897. term*: TerminationHandler;
  12898. exTable*: ExceptionTable;
  12899. noProcs*: LONGINT;
  12900. firstProc*: ADDRESS; <- done by loader
  12901. maxPtrs*: LONGINT;
  12902. crc*: LONGINT;
  12903. *)
  12904. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12905. BEGIN
  12906. Info(section, "cycle");
  12907. Size(section,0);
  12908. Info(section, "references");
  12909. Size(section,0);
  12910. Info(section, "nextMarked");
  12911. Address(section,0);
  12912. Info(section, "nextWatched");
  12913. Address(section,0);
  12914. END BasePointer;
  12915. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12916. BEGIN
  12917. BasePointer(section);
  12918. Info(section, "action");
  12919. Address(section,0);
  12920. Info(section, "monitor");
  12921. Address(section,0);
  12922. END BaseObject;
  12923. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12924. BEGIN
  12925. BasePointer(section);
  12926. Info(section, "action");
  12927. Address(section,0);
  12928. Info(section, "monitor");
  12929. Address(section,0);
  12930. END BaseRecord;
  12931. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12932. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12933. pooledName: Basic.SegmentedName;
  12934. symbol: SyntaxTree.Symbol;
  12935. BEGIN
  12936. Global.GetModuleName(module.module,name);
  12937. Strings.Append(name,".@Module.@Descriptor");
  12938. Basic.ToSegmentedName(name, pooledName);
  12939. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12940. Symbol(section,descriptorSection,0,0);
  12941. Info(descriptorSection, "descriptor");
  12942. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12943. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12944. Address(descriptorSection,0);
  12945. Global.GetModuleName(module.module,name);
  12946. Strings.Append(name,".@Trace");
  12947. Basic.ToSegmentedName(name, pooledName);
  12948. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12949. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12950. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12951. END ModuleDescriptor;
  12952. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12953. VAR name: ARRAY 128 OF CHAR;
  12954. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12955. symbol: SyntaxTree.Symbol;
  12956. BEGIN
  12957. Global.GetModuleName(module.module,name);
  12958. Strings.Append(name,".@Module");
  12959. Basic.ToSegmentedName(name, pooledName);
  12960. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12961. moduleSection.SetExported(TRUE);
  12962. IF moduleSection.pc = 0 THEN
  12963. IF implementationVisitor.backend.cooperative THEN
  12964. Info(moduleSection, "descriptor");
  12965. ModuleDescriptor(moduleSection);
  12966. BaseObject(moduleSection);
  12967. implementationVisitor.CreateTraceModuleMethod(module.module);
  12968. ELSE
  12969. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12970. Info(moduleSection, "HeapBlock");
  12971. Symbol(moduleSection,moduleSection,2,0);
  12972. Info(moduleSection, "TypeDescriptor");
  12973. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12974. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12975. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12976. END;
  12977. END;
  12978. RETURN moduleSection;
  12979. END ModuleSection;
  12980. PROCEDURE NewModuleInfo();
  12981. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12982. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12983. sectionName: Basic.SectionName;
  12984. CONST MPO=-40000000H;
  12985. BEGIN
  12986. (*
  12987. TypeDesc* = POINTER TO RECORD
  12988. descSize: SIZE;
  12989. sentinel: LONGINT; (* = MPO-4 *)
  12990. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12991. flags*: SET;
  12992. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12993. name*: Name;
  12994. refsOffset: SIZE;
  12995. END;
  12996. *)
  12997. (*name is missing prefixes sometimes*)
  12998. Global.GetModuleSegmentedName(module.module,name);
  12999. Basic.AppendToSegmentedName(name,".@Info");
  13000. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13001. IF ~implementationVisitor.backend.cooperative THEN
  13002. Info(source, "HeapBlock");
  13003. Address(source,0); (* an empty heap block prevents GC marking *)
  13004. Info(source, "TypeDescriptor");
  13005. Address(source,0);
  13006. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13007. END;
  13008. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13009. Address(source,MPO-4);
  13010. Info(source, "type tag pointer");
  13011. Address( source,0);
  13012. Info(source, "type flags");
  13013. flags := {};
  13014. Set( source, flags);
  13015. Info(source, "pointer to module");
  13016. moduleSection := ModuleSection();
  13017. Symbol( source, moduleSection, moduleSection.pc,0);
  13018. Info(source, "type name");
  13019. i := 0;
  13020. sectionName := "@Self";
  13021. (*
  13022. Global.GetSymbolSegmentedName(td,name);
  13023. Basic.SegmentedNameToString(name, sectionName);
  13024. *)
  13025. Name(source,sectionName);
  13026. patchInfoPC := source.pc;
  13027. Size(source, 0);
  13028. END NewModuleInfo;
  13029. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  13030. VAR
  13031. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  13032. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  13033. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  13034. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  13035. referenceSectionOffset : LONGINT;
  13036. name: Basic.SegmentedName; offset: LONGINT;
  13037. flags: SET;
  13038. BEGIN
  13039. NewModuleInfo();
  13040. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  13041. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  13042. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  13043. ImportsArray(importSection);
  13044. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  13045. CommandArray(commandsSection);
  13046. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  13047. ExceptionArray(exceptionSection);
  13048. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  13049. AddPointer(typeInfoSection, typeInfoSectionOffset);
  13050. TypeInfoSection(typeInfoSection);
  13051. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  13052. referenceSection.SetExported(TRUE);
  13053. References(referenceSection);
  13054. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  13055. ProcedureDescriptorArray(procTableSection, numberProcs);
  13056. IF ProtectModulesPointers THEN
  13057. name := "Heaps.AnyPtr";
  13058. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  13059. (* set base pointer *)
  13060. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  13061. END;
  13062. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  13063. ArrayBlock(emptyArraySection,temp,"", FALSE);
  13064. moduleSection := ModuleSection();
  13065. Info(moduleSection, "nextRoot*: RootObject");
  13066. Address(moduleSection,0);
  13067. Info(moduleSection, "next*: Module");
  13068. Address(moduleSection,0);
  13069. Info(moduleSection, "name*: Name");
  13070. Name(moduleSection,moduleName);
  13071. Info(moduleSection, "init, published: BOOLEAN");
  13072. Boolean(moduleSection,FALSE);
  13073. Boolean(moduleSection,FALSE);
  13074. Info(moduleSection,"filler"); (*! introduce alignment! *)
  13075. Boolean(moduleSection,FALSE);
  13076. Boolean(moduleSection,FALSE);
  13077. Info(moduleSection, "refcnt*: LONGINT");
  13078. Longint(moduleSection,0);
  13079. Info(moduleSection, "sb*: ADDRESS");
  13080. Address(moduleSection,0);
  13081. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  13082. Address(moduleSection,0);
  13083. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  13084. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  13085. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  13086. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  13087. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  13088. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  13089. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  13090. Symbol(moduleSection,importSection,importSectionOffset,0);
  13091. Info(moduleSection, "procTable*: ProcTable");
  13092. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  13093. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  13094. Address(moduleSection,0);
  13095. Address(moduleSection,0);
  13096. Address(moduleSection,0);
  13097. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  13098. Info(moduleSection, "export*: ExportDesc");
  13099. ExportDesc(moduleSection);
  13100. Info(moduleSection, "term*: TerminationHandler");
  13101. Address(moduleSection,0);
  13102. Info(moduleSection, "exTable*: ExceptionTable");
  13103. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  13104. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  13105. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  13106. Info(moduleSection, "crc*: LONGINT");
  13107. patchCRC:= moduleSection.pc;
  13108. Longint(moduleSection, 0); (*! must be implemented *)
  13109. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  13110. Info(moduleSection, "body*: ADDRESS");
  13111. Symbol(moduleSection, bodyProc, 0,0);
  13112. Info(moduleSection, "module flags");
  13113. flags := {};
  13114. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  13115. Set( moduleSection, flags);
  13116. IF implementationVisitor.backend.cooperative THEN
  13117. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  13118. Info(moduleSection, "monitor.owner");
  13119. Address(moduleSection,0);
  13120. Info(moduleSection, "monitor.nestingLevel");
  13121. Address(moduleSection,0);
  13122. Info(moduleSection, "monitor.blockedQueue");
  13123. Address(moduleSection,0); Address(moduleSection,0);
  13124. Info(moduleSection, "monitor.waitingQueue");
  13125. Address(moduleSection,0); Address(moduleSection,0);
  13126. Info(moduleSection, "monitor.waitingSentinel");
  13127. Address(moduleSection,0);
  13128. END;
  13129. END Module;
  13130. PROCEDURE PatchCRC(crc: LONGINT);
  13131. BEGIN
  13132. IF ~simple THEN
  13133. PatchLongint(ModuleSection(), patchCRC, crc);
  13134. END;
  13135. END PatchCRC;
  13136. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  13137. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  13138. BEGIN
  13139. ArrayBlock(source,pc,"",FALSE);
  13140. Info(source, "pointer offsets array data");
  13141. IF scope IS SyntaxTree.RecordScope THEN
  13142. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  13143. ELSIF scope IS SyntaxTree.CellScope THEN
  13144. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  13145. ELSIF scope IS SyntaxTree.ModuleScope THEN
  13146. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  13147. WHILE variable # NIL DO
  13148. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13149. symbol := module.allSections.FindBySymbol(variable);
  13150. ASSERT(symbol # NIL);
  13151. Pointers(0,symbol, source,variable.type,numberPointers);
  13152. END;
  13153. variable := variable.nextVariable;
  13154. END;
  13155. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  13156. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13157. WHILE parameter # NIL DO
  13158. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  13159. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  13160. END;
  13161. parameter := parameter.nextParameter;
  13162. END;
  13163. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  13164. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  13165. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13166. IF implementationVisitor.backend.preciseGC THEN
  13167. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13168. END;
  13169. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  13170. END;
  13171. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  13172. WHILE(variable # NIL) DO
  13173. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13174. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  13175. END;
  13176. variable := variable.nextVariable
  13177. END;
  13178. END;
  13179. PatchArray(source,pc,numberPointers);
  13180. END PointerArray;
  13181. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  13182. VAR recordType: SyntaxTree.RecordType;
  13183. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  13184. section: Sections.Section; cellType: SyntaxTree.CellType;
  13185. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  13186. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13187. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13188. sectionName: Basic.SectionName;
  13189. CONST MPO=-40000000H;
  13190. BEGIN
  13191. (*
  13192. TypeDesc* = POINTER TO RECORD
  13193. descSize: SIZE;
  13194. sentinel: LONGINT; (* = MPO-4 *)
  13195. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13196. flags*: SET;
  13197. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13198. name*: Name;
  13199. refsOffset: SIZE;
  13200. END;
  13201. *)
  13202. (* source := module.sections.FindByName(...) *)
  13203. Global.GetSymbolSegmentedName(td,name);
  13204. Basic.AppendToSegmentedName(name,".@Info");
  13205. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13206. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  13207. Address(source,0);
  13208. Info(source, "TypeDescriptor");
  13209. Address(source,0);
  13210. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13211. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13212. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  13213. Info(source, "type tag pointer");
  13214. Symbol( source, tag, offset, 0);
  13215. Info(source, "type flags");
  13216. flags := {};
  13217. IF isProtected THEN INCL(flags,31) END;
  13218. Set( source, flags);
  13219. Info(source, "pointer to module");
  13220. moduleSection := ModuleSection();
  13221. Symbol( source, moduleSection, moduleSection.pc,0);
  13222. Info(source, "type name");
  13223. i := 0;
  13224. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  13225. (*
  13226. Global.GetSymbolSegmentedName(td,name);
  13227. Basic.SegmentedNameToString(name, sectionName);
  13228. *)
  13229. Name(source,sectionName);
  13230. Size(source, 0);
  13231. RETURN source;
  13232. END NewTypeDescriptorInfo;
  13233. PROCEDURE NewTypeDescriptor;
  13234. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  13235. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  13236. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  13237. numberPointers: LONGINT; padding, i: LONGINT;
  13238. CONST MPO=-40000000H;
  13239. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  13240. VAR i: LONGINT;
  13241. PROCEDURE Td(record: SyntaxTree.RecordType);
  13242. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  13243. BEGIN
  13244. IF record # NIL THEN
  13245. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  13246. baseTD := record.typeDeclaration;
  13247. Global.GetSymbolSegmentedName(baseTD,name);
  13248. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13249. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13250. ELSE
  13251. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13252. END;
  13253. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  13254. Symbol(source, tir, 0, offset);
  13255. IF reverse THEN Td(record.GetBaseRecord()) END;
  13256. END;
  13257. END Td;
  13258. BEGIN
  13259. Info(source, "tag table");
  13260. baseRecord := recordType;
  13261. i := 0;
  13262. WHILE baseRecord # NIL DO
  13263. INC(i);
  13264. baseRecord := baseRecord.GetBaseRecord();
  13265. END;
  13266. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  13267. IF ~reverse THEN Td(recordType) END;
  13268. WHILE i < size DO
  13269. Address(source,0);
  13270. INC(i);
  13271. END;
  13272. IF reverse THEN Td(recordType) END;
  13273. END TdTable;
  13274. PROCEDURE MethodTable(reverse: BOOLEAN);
  13275. VAR i,methods: LONGINT;
  13276. BEGIN
  13277. Info(source, "method table");
  13278. IF recordType # NIL THEN
  13279. methods := recordType.recordScope.numberMethods;
  13280. IF reverse THEN
  13281. FOR i := methods-1 TO 0 BY -1 DO
  13282. procedure := recordType.recordScope.FindMethod(i);
  13283. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13284. NamedSymbol(source, name,procedure, 0,0);
  13285. END;
  13286. ELSE
  13287. FOR i := 0 TO methods-1 DO
  13288. procedure := recordType.recordScope.FindMethod(i);
  13289. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13290. NamedSymbol(source, name,procedure, 0,0);
  13291. END;
  13292. END;
  13293. END;
  13294. END MethodTable;
  13295. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  13296. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  13297. BEGIN
  13298. Info(source, "method table");
  13299. baseRecord := recordType;
  13300. WHILE baseRecord.baseType # NIL DO
  13301. baseRecord := baseRecord.GetBaseRecord ();
  13302. END;
  13303. GetRecordTypeName (baseRecord, name);
  13304. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  13305. IF name = stackFrame THEN
  13306. start := 0;
  13307. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  13308. baseRecord := recordType;
  13309. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  13310. baseRecord := baseRecord.GetBaseRecord ();
  13311. END;
  13312. IF baseRecord # NIL THEN
  13313. GetRecordTypeName (baseRecord, name);
  13314. IF pointer & ~baseRecord.isObject THEN
  13315. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13316. END;
  13317. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  13318. ELSIF recordType.isObject THEN
  13319. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  13320. ELSIF pointer THEN
  13321. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  13322. ELSE
  13323. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  13324. END;
  13325. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13326. Symbol(source, tir, 0, 0);
  13327. start := 0;
  13328. baseRecord := recordType;
  13329. WHILE (baseRecord # NIL) DO
  13330. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  13331. baseRecord := baseRecord.GetBaseRecord ();
  13332. END;
  13333. ELSE
  13334. (* explicit trace method: *)
  13335. procedure := recordType.recordScope.FindMethod(0);
  13336. IF ~procedure.isFinalizer THEN
  13337. Global.GetSymbolSegmentedName(procedure, name);
  13338. NamedSymbol(source, name,procedure, 0,0);
  13339. END;
  13340. start := 1;
  13341. END;
  13342. IF (name # stackFrame) & recordType.isObject THEN
  13343. baseRecord := recordType;
  13344. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  13345. baseRecord := baseRecord.GetBaseRecord ();
  13346. END;
  13347. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  13348. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  13349. ELSE
  13350. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  13351. END;
  13352. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13353. Symbol(source, tir, 0, 0);
  13354. END;
  13355. methods := recordType.recordScope.numberMethods;
  13356. FOR i := start TO methods-1 DO
  13357. procedure := recordType.recordScope.FindMethod(i);
  13358. IF ~procedure.isFinalizer THEN
  13359. Global.GetSymbolSegmentedName(procedure, name);
  13360. NamedSymbol(source, name,procedure, 0,0);
  13361. END;
  13362. END;
  13363. END CooperativeMethodTable;
  13364. BEGIN
  13365. Global.GetSymbolSegmentedName(td,name);
  13366. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  13367. source.SetExported(IsExported(td));
  13368. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  13369. IF implementationVisitor.backend.cooperative THEN
  13370. base := NIL;
  13371. baseRecord := recordType.GetBaseRecord();
  13372. IF baseRecord # NIL THEN
  13373. baseTD := baseRecord.typeDeclaration;
  13374. END;
  13375. IF ~recordType.isObject THEN
  13376. Info(source, "parent");
  13377. IF baseRecord # NIL THEN
  13378. Global.GetSymbolSegmentedName(baseTD,name);
  13379. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13380. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13381. ELSE
  13382. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13383. END;
  13384. Symbol(source, tir, 0, 0);
  13385. ELSE
  13386. Address(source,0);
  13387. END;
  13388. Info(source, "record size");
  13389. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13390. CooperativeMethodTable(FALSE);
  13391. base := source;
  13392. Global.GetSymbolSegmentedName(td,name);
  13393. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13394. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13395. source.SetExported(IsExported(td));
  13396. END;
  13397. Info(source, "parent");
  13398. IF baseRecord # NIL THEN
  13399. Global.GetSymbolSegmentedName(baseTD,name);
  13400. sym := baseTD;
  13401. IF ~recordType.isObject THEN
  13402. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13403. sym := NIL;
  13404. END;
  13405. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13406. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13407. ELSE
  13408. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13409. END;
  13410. Symbol(source, tir, 0, 0);
  13411. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  13412. Address(source,0);
  13413. ELSE
  13414. IF recordType.isObject THEN
  13415. Basic.ToSegmentedName ("BaseTypes.Object",name);
  13416. ELSE
  13417. Basic.ToSegmentedName ("BaseTypes.Record",name);
  13418. END;
  13419. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13420. Symbol(source, tir, 0, 0);
  13421. END;
  13422. Info(source, "base record descriptor");
  13423. Symbol(source, base, 0, 0);
  13424. CooperativeMethodTable(TRUE);
  13425. IF recordType.hasPointers THEN
  13426. IF ~HasExplicitTraceMethod (recordType) THEN
  13427. implementationVisitor.CreateTraceMethod(recordType);
  13428. END;
  13429. implementationVisitor.CreateResetProcedure(recordType);
  13430. implementationVisitor.CreateAssignProcedure(recordType);
  13431. END;
  13432. ELSIF ~simple THEN
  13433. (*
  13434. MethodEnd = MPO
  13435. ---
  13436. methods (# methods)
  13437. ---
  13438. tags (16)
  13439. ---
  13440. TypeDesc = TypeInfoAdr
  13441. ---
  13442. td adr ---> rec size
  13443. ----
  13444. pointer offsets
  13445. ----
  13446. (padding)
  13447. -----
  13448. empty [2 addresses aligned]
  13449. empty
  13450. empty
  13451. numPtrs
  13452. ---
  13453. pointer offsets
  13454. ---
  13455. *)
  13456. Info(source, "MethodEnd = MPO");
  13457. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  13458. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  13459. MethodTable(TRUE);
  13460. TdTable(TypeTags, TRUE);
  13461. Info(source, "type descriptor info pointer");
  13462. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  13463. Symbol(source, tdInfo,EmptyBlockOffset,0);
  13464. IF (cellType # NIL) THEN
  13465. IF cellType.sizeInBits < 0 THEN
  13466. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  13467. END;
  13468. Info(source, "cell size");
  13469. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  13470. ELSE
  13471. Info(source, "record size");
  13472. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13473. END;
  13474. Info(source, "pointer offsets pointer");
  13475. padding := 1- source.pc MOD 2;
  13476. Symbol(source, source, source.pc+1+padding,0);
  13477. IF padding >0 THEN
  13478. Info(source, "padding");
  13479. FOR i := 1 TO padding DO Address(source,0) END;
  13480. END;
  13481. IF cellType # NIL THEN
  13482. PointerArray(source, cellType.cellScope, numberPointers);
  13483. ELSE
  13484. PointerArray(source, recordType.recordScope, numberPointers);
  13485. END;
  13486. ELSE
  13487. (*
  13488. simple:
  13489. td adr --> size
  13490. tag(1)
  13491. tag(2)
  13492. tag(3)
  13493. methods ->
  13494. *)
  13495. Info(source, "record size");
  13496. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13497. TdTable(TypeTags, FALSE);
  13498. MethodTable(FALSE);
  13499. END;
  13500. END NewTypeDescriptor;
  13501. BEGIN
  13502. x := x.resolved;
  13503. IF (x IS SyntaxTree.PointerType) THEN
  13504. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  13505. END;
  13506. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  13507. recordType := x(SyntaxTree.RecordType);
  13508. td := x.typeDeclaration;
  13509. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13510. ASSERT(td # NIL);
  13511. section := module.allSections.FindBySymbol(td); (* TODO *)
  13512. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13513. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13514. NewTypeDescriptor
  13515. END;
  13516. END;
  13517. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  13518. cellType := x(SyntaxTree.CellType);
  13519. td := x.typeDeclaration;
  13520. section := module.allSections.FindBySymbol(td); (* TODO *)
  13521. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13522. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13523. NewTypeDescriptor
  13524. END;
  13525. END;
  13526. END
  13527. END CheckTypeDeclaration
  13528. END MetaDataGenerator;
  13529. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  13530. VAR
  13531. trace-: BOOLEAN;
  13532. traceString-: SyntaxTree.IdentifierString;
  13533. traceModuleName-: SyntaxTree.IdentifierString;
  13534. profile-: BOOLEAN;
  13535. noRuntimeChecks: BOOLEAN;
  13536. simpleMetaData-: BOOLEAN;
  13537. noAsserts: BOOLEAN;
  13538. optimize-: BOOLEAN;
  13539. cooperative-: BOOLEAN;
  13540. preregisterStatic-: BOOLEAN;
  13541. dump-: Basic.Writer;
  13542. cellsAreObjects: BOOLEAN;
  13543. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  13544. experiment: BOOLEAN;
  13545. PROCEDURE &InitIntermediateBackend*;
  13546. BEGIN
  13547. simpleMetaData := FALSE;
  13548. InitBackend;
  13549. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  13550. SetTraceModuleName(DefaultTraceModuleName);
  13551. END InitIntermediateBackend;
  13552. (* must be overwritten by actual backend, if parameter registers should be used *)
  13553. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  13554. BEGIN
  13555. register := -1;
  13556. RETURN FALSE;
  13557. END GetParameterRegister;
  13558. PROCEDURE ResetParameterRegisters*;
  13559. BEGIN
  13560. END ResetParameterRegisters;
  13561. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  13562. VAR
  13563. declarationVisitor: DeclarationVisitor;
  13564. implementationVisitor: ImplementationVisitor;
  13565. module: Sections.Module;
  13566. name, platformName: SyntaxTree.IdentifierString;
  13567. meta: MetaDataGenerator;
  13568. crc: CRC.CRC32Stream;
  13569. BEGIN
  13570. ResetError;
  13571. Global.GetSymbolName(x,name);
  13572. NEW(module,x,system); (* backend structures *)
  13573. Global.GetModuleName(x, name);
  13574. module.SetModuleName(name);
  13575. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  13576. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  13577. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  13578. declarationVisitor.Module(x,module);
  13579. IF ~meta.simple THEN
  13580. meta.Module(implementationVisitor.moduleBodySection);
  13581. END;
  13582. GetDescription(platformName);
  13583. module.SetPlatformName(platformName);
  13584. NEW(crc);
  13585. module.allSections.WriteRaw(crc);
  13586. crc.Update;
  13587. meta.PatchCRC(crc.GetCRC());
  13588. RETURN module
  13589. END GenerateIntermediate;
  13590. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  13591. BEGIN RETURN TRUE
  13592. END SupportedImmediate;
  13593. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  13594. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  13595. END ProcessSyntaxTreeModule;
  13596. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  13597. VAR
  13598. result: Sections.Module;
  13599. traceName: Basic.MessageString;
  13600. BEGIN
  13601. ASSERT(intermediateCodeModule IS Sections.Module);
  13602. result := intermediateCodeModule(Sections.Module);
  13603. IF trace THEN
  13604. traceName := "intermediate code trace: ";
  13605. Strings.Append(traceName,traceString);
  13606. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  13607. IF (traceString="") OR (traceString="*") THEN
  13608. result.Dump(dump);
  13609. dump.Update
  13610. ELSE
  13611. Sections.DumpFiltered(dump, result, traceString);
  13612. END
  13613. END;
  13614. RETURN result
  13615. END ProcessIntermediateCodeModule;
  13616. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  13617. BEGIN instructionSet := "Intermediate";
  13618. END GetDescription;
  13619. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  13620. BEGIN
  13621. SELF.simpleMetaData := simpleMetaData;
  13622. END SetSimpleMetaData;
  13623. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  13624. BEGIN COPY(name, traceModuleName)
  13625. END SetTraceModuleName;
  13626. PROCEDURE DefineOptions*(options: Options.Options);
  13627. BEGIN
  13628. DefineOptions^(options);
  13629. options.Add(0X,"trace",Options.String);
  13630. options.Add(0X,"builtinsModule",Options.String);
  13631. options.Add(0X,"traceModule",Options.String);
  13632. options.Add(0X,"profile",Options.Flag);
  13633. options.Add(0X,"noRuntimeChecks",Options.Flag);
  13634. options.Add(0X,"noAsserts",Options.Flag);
  13635. options.Add(0X,"metaData",Options.String);
  13636. options.Add('o',"optimize", Options.Flag);
  13637. options.Add(0X,"preregisterStatic", Options.Flag);
  13638. options.Add(0X,"cellsAreObjects", Options.Flag);
  13639. options.Add(0X,"preciseGC", Options.Flag);
  13640. options.Add(0X,"trackLeave", Options.Flag);
  13641. options.Add(0X,"writeBarriers", Options.Flag);
  13642. options.Add(0X,"experiment", Options.Flag);
  13643. END DefineOptions;
  13644. PROCEDURE GetOptions*(options: Options.Options);
  13645. VAR name,string: SyntaxTree.IdentifierString;
  13646. BEGIN
  13647. GetOptions^(options);
  13648. trace := options.GetString("trace",traceString);
  13649. profile := options.GetFlag("profile");
  13650. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  13651. noAsserts := options.GetFlag("noAsserts");
  13652. cooperative := options.GetFlag("cooperative");
  13653. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  13654. simpleMetaData := TRUE
  13655. END;
  13656. IF options.GetString("metaData",string) THEN
  13657. IF string = "simple" THEN simpleMetaData := TRUE
  13658. ELSIF string ="full" THEN simpleMetaData := FALSE
  13659. END;
  13660. END;
  13661. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  13662. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  13663. optimize := options.GetFlag("optimize");
  13664. preregisterStatic := options.GetFlag("preregisterStatic");
  13665. cellsAreObjects := options.GetFlag("cellsAreObjects");
  13666. preciseGC := options.GetFlag("preciseGC");
  13667. trackLeave := options.GetFlag("trackLeave");
  13668. writeBarriers := options.GetFlag("writeBarriers");
  13669. experiment := options.GetFlag("experiment");
  13670. IF simpleMetaData THEN preciseGC := FALSE END;
  13671. END GetOptions;
  13672. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  13673. BEGIN RETURN SymbolFileFormat.Get()
  13674. END DefaultSymbolFileFormat;
  13675. END IntermediateBackend;
  13676. (* ----------------------------------- register allocation ------------------------------------- *)
  13677. (* register mapping scheme
  13678. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  13679. spill offset
  13680. part(n) --> ticket <--> physical register
  13681. spill offset
  13682. *)
  13683. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  13684. emptyOperand: IntermediateCode.Operand;
  13685. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  13686. statCoopResetVariables: LONGINT;
  13687. statCoopModifyAssignments: LONGINT;
  13688. modifyAssignmentsPC : LONGINT;
  13689. statCoopNilCheck: LONGINT;
  13690. statCoopSwitch: LONGINT;
  13691. statCoopAssignProcedure: LONGINT;
  13692. statCoopTraceMethod: LONGINT;
  13693. statCoopResetProcedure: LONGINT;
  13694. statCoopTraceModule: LONGINT;
  13695. PROCEDURE ResetStatistics*;
  13696. BEGIN
  13697. statCoopResetVariables := 0;
  13698. statCoopModifyAssignments := 0;
  13699. statCoopNilCheck:= 0;
  13700. statCoopSwitch:= 0;
  13701. statCoopAssignProcedure:= 0;
  13702. statCoopTraceMethod:= 0;
  13703. statCoopResetProcedure:= 0;
  13704. statCoopTraceModule:= 0;
  13705. END ResetStatistics;
  13706. PROCEDURE Statistics*;
  13707. BEGIN
  13708. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  13709. TRACE(statCoopNilCheck, statCoopSwitch);
  13710. TRACE(statCoopAssignProcedure,
  13711. statCoopTraceMethod,
  13712. statCoopResetProcedure,
  13713. statCoopTraceModule)
  13714. END Statistics;
  13715. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  13716. VAR h: LONGINT;
  13717. BEGIN
  13718. WHILE b # 0 DO
  13719. h := a MOD b;
  13720. a := b;
  13721. b := h;
  13722. END;
  13723. RETURN a
  13724. END GCD;
  13725. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  13726. BEGIN
  13727. RETURN a*b DIV GCD(a,b)
  13728. END SCM;
  13729. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  13730. BEGIN
  13731. (*TRACE(a,b);*)
  13732. IF a = 0 THEN RETURN b
  13733. ELSIF b = 0 THEN RETURN a
  13734. ELSE RETURN SCM(a,b)
  13735. END;
  13736. END CommonAlignment;
  13737. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13738. BEGIN
  13739. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  13740. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  13741. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13742. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  13743. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13744. END
  13745. END PassBySingleReference;
  13746. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13747. BEGIN
  13748. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  13749. END PassInRegister;
  13750. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  13751. VAR new: RegisterEntry;
  13752. BEGIN
  13753. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  13754. IF queue = NIL THEN
  13755. queue := new
  13756. ELSE
  13757. new.next := queue;
  13758. IF queue#NIL THEN queue.prev := new END;
  13759. queue := new
  13760. END;
  13761. END AddRegisterEntry;
  13762. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  13763. VAR this: RegisterEntry;
  13764. BEGIN
  13765. this := queue;
  13766. WHILE (this # NIL) & (this.register # register) DO
  13767. this := this.next;
  13768. END;
  13769. IF this = NIL THEN
  13770. RETURN FALSE
  13771. END;
  13772. ASSERT(this # NIL);
  13773. IF this = queue THEN queue := queue.next END;
  13774. IF this.prev # NIL THEN this.prev.next := this.next END;
  13775. IF this.next # NIL THEN this.next.prev := this.prev END;
  13776. RETURN TRUE
  13777. END RemoveRegisterEntry;
  13778. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  13779. BEGIN ASSERT(cond);
  13780. END Assert;
  13781. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  13782. BEGIN
  13783. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  13784. END ReusableRegister;
  13785. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  13786. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  13787. BEGIN
  13788. procedure := moduleScope.bodyProcedure;
  13789. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  13790. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  13791. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  13792. procedure.SetScope(moduleScope);
  13793. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  13794. procedure.SetAccess(SyntaxTree.Hidden);
  13795. moduleScope.SetBodyProcedure(procedure);
  13796. moduleScope.AddProcedure(procedure);
  13797. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  13798. END;
  13799. END EnsureBodyProcedure;
  13800. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  13801. VAR import: SyntaxTree.Import;
  13802. selfName: SyntaxTree.IdentifierString;
  13803. module: SyntaxTree.Module;
  13804. BEGIN
  13805. scope.ownerModule.GetName(selfName);
  13806. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  13807. module := scope.ownerModule
  13808. ELSE
  13809. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  13810. IF import = NIL THEN
  13811. RETURN NIL
  13812. ELSIF import.module = NIL THEN
  13813. RETURN NIL
  13814. ELSE module := import.module
  13815. END;
  13816. END;
  13817. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  13818. END GetSymbol;
  13819. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  13820. BEGIN
  13821. op.mode := mode;
  13822. IntermediateCode.InitOperand(op.op);
  13823. IntermediateCode.InitOperand(op.tag);
  13824. IntermediateCode.InitOperand(op.extra);
  13825. op.dimOffset := 0;
  13826. op.availability := -1;
  13827. END InitOperand;
  13828. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  13829. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  13830. BEGIN RETURN IntermediateCode.GetType(system, type)
  13831. END GetType;
  13832. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  13833. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  13834. BEGIN
  13835. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13836. (*
  13837. UniqueId(name,module,name,adr);
  13838. *)
  13839. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13840. constant.SetValue(value);
  13841. constant.SetAccess(SyntaxTree.Hidden);
  13842. module.moduleScope.AddConstant(constant);
  13843. constant.SetScope(module.moduleScope);
  13844. RETURN constant
  13845. END BuildConstant;
  13846. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13847. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13848. BEGIN
  13849. variable := scope.firstVariable;
  13850. WHILE variable # NIL DO
  13851. IF variable.NeedsTrace() THEN
  13852. RETURN TRUE;
  13853. END;
  13854. variable := variable.nextVariable;
  13855. END;
  13856. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13857. WHILE parameter # NIL DO
  13858. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13859. RETURN TRUE;
  13860. END;
  13861. parameter := parameter.nextParameter;
  13862. END;
  13863. RETURN FALSE;
  13864. END HasPointers;
  13865. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13866. 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));
  13867. END IsVariableParameter;
  13868. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13869. VAR parameter: SyntaxTree.Parameter;
  13870. BEGIN
  13871. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13872. WHILE parameter # NIL DO
  13873. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13874. IF parameter.movable THEN RETURN TRUE END;
  13875. parameter := parameter.nextParameter;
  13876. END;
  13877. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13878. END HasVariableParameters;
  13879. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13880. BEGIN
  13881. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13882. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13883. END HasExplicitTraceMethod;
  13884. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13885. BEGIN
  13886. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13887. IF (expression IS SyntaxTree.IntegerValue) THEN
  13888. val := expression(SyntaxTree.IntegerValue).value;
  13889. RETURN TRUE
  13890. ELSE
  13891. RETURN FALSE
  13892. END;
  13893. END IsIntegerConstant;
  13894. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13895. BEGIN
  13896. IF val <= 0 THEN RETURN FALSE END;
  13897. exp := 0;
  13898. WHILE ~ODD(val) DO
  13899. val := val DIV 2;
  13900. INC(exp)
  13901. END;
  13902. RETURN val = 1
  13903. END PowerOf2;
  13904. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13905. VAR procedure: SyntaxTree.Procedure;
  13906. BEGIN
  13907. procedure := record.recordScope.constructor;
  13908. IF procedure = NIL THEN
  13909. record := record.GetBaseRecord();
  13910. IF record # NIL THEN
  13911. procedure := GetConstructor(record)
  13912. END;
  13913. END;
  13914. RETURN procedure;
  13915. END GetConstructor;
  13916. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13917. BEGIN
  13918. value := SHORT(op.intValue);
  13919. RETURN op.mode = IntermediateCode.ModeImmediate;
  13920. END IsIntegerImmediate;
  13921. (** whether a type strictily is a pointer to record or object type
  13922. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13923. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13924. BEGIN
  13925. IF type = NIL THEN
  13926. RETURN FALSE
  13927. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13928. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13929. ELSE
  13930. RETURN FALSE
  13931. END
  13932. END IsStrictlyPointerToRecord;
  13933. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13934. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13935. END IsUnsafePointer;
  13936. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13937. BEGIN type := type.resolved;
  13938. IF type IS SyntaxTree.PointerType THEN
  13939. type := type(SyntaxTree.PointerType).pointerBase;
  13940. type := type.resolved;
  13941. IF type IS SyntaxTree.RecordType THEN
  13942. recordType := type(SyntaxTree.RecordType);
  13943. RETURN TRUE
  13944. ELSE
  13945. RETURN FALSE
  13946. END
  13947. ELSIF type IS SyntaxTree.RecordType THEN
  13948. recordType := type(SyntaxTree.RecordType);
  13949. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13950. ELSIF type IS SyntaxTree.ObjectType THEN
  13951. RETURN TRUE
  13952. ELSIF type IS SyntaxTree.AnyType THEN
  13953. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13954. ELSE
  13955. RETURN FALSE
  13956. END;
  13957. END IsPointerToRecord;
  13958. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13959. BEGIN
  13960. type := type.resolved;
  13961. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13962. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13963. END IsArrayOfSystemByte;
  13964. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13965. BEGIN
  13966. IF type = NIL THEN RETURN FALSE END;
  13967. type := type.resolved;
  13968. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13969. END IsOpenArray;
  13970. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13971. BEGIN
  13972. IF type = NIL THEN RETURN FALSE END;
  13973. type := type.resolved;
  13974. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13975. END IsSemiDynamicArray;
  13976. PROCEDURE IsStaticArray(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.Static);
  13981. END IsStaticArray;
  13982. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13983. BEGIN
  13984. IF type = NIL THEN RETURN FALSE END;
  13985. type := type.resolved;
  13986. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13987. END IsStaticMathArray;
  13988. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13989. BEGIN
  13990. WHILE (IsStaticMathArray(type)) DO
  13991. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13992. END;
  13993. RETURN type;
  13994. END StaticMathArrayBaseType;
  13995. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13996. VAR size: LONGINT;
  13997. BEGIN
  13998. size := 1;
  13999. WHILE (IsStaticArray(type)) DO
  14000. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  14001. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14002. END;
  14003. RETURN size;
  14004. END StaticArrayNumElements;
  14005. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14006. VAR size: LONGINT;
  14007. BEGIN
  14008. size := 1;
  14009. WHILE (IsStaticMathArray(type)) DO
  14010. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  14011. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14012. END;
  14013. RETURN size;
  14014. END StaticMathArrayNumElements;
  14015. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14016. BEGIN
  14017. WHILE (IsStaticArray(type)) DO
  14018. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14019. END;
  14020. RETURN type;
  14021. END StaticArrayBaseType;
  14022. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14023. BEGIN
  14024. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  14025. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14026. END;
  14027. RETURN type;
  14028. END ArrayBaseType;
  14029. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  14030. BEGIN
  14031. IF type = NIL THEN RETURN FALSE END;
  14032. type := type.resolved;
  14033. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  14034. END IsDelegate;
  14035. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  14036. VAR i: LONGINT;
  14037. BEGIN
  14038. i := 0; type := type.resolved;
  14039. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14040. INC(i);
  14041. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  14042. END;
  14043. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14044. INC(i);
  14045. type := type(SyntaxTree.MathArrayType).arrayBase;
  14046. IF type # NIL THEN type := type.resolved END;
  14047. END;
  14048. RETURN i
  14049. END DynamicDim;
  14050. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  14051. BEGIN
  14052. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14053. type := type(SyntaxTree.ArrayType).arrayBase;
  14054. END;
  14055. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14056. type := type(SyntaxTree.MathArrayType).arrayBase;
  14057. END;
  14058. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  14059. END StaticSize;
  14060. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  14061. BEGIN
  14062. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  14063. END IsImmediate;
  14064. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  14065. BEGIN
  14066. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  14067. END IsAddress;
  14068. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  14069. BEGIN
  14070. RETURN (x.mode = IntermediateCode.ModeRegister);
  14071. END IsRegister;
  14072. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  14073. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  14074. BEGIN
  14075. typeDeclaration := recordType.typeDeclaration;
  14076. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  14077. Global.GetSymbolSegmentedName(typeDeclaration,name);
  14078. END GetRecordTypeName;
  14079. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  14080. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  14081. BEGIN
  14082. parSize := 0;
  14083. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  14084. parameter := procedureType.returnParameter;
  14085. INC(parSize,system.SizeOfParameter(parameter));
  14086. parSize := parSize + (-parSize) MOD system.addressSize;
  14087. END;
  14088. parameter :=procedureType.lastParameter;
  14089. WHILE (parameter # NIL) DO
  14090. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  14091. INC(parSize, system.addressSize);
  14092. ELSE
  14093. INC(parSize,system.SizeOfParameter(parameter));
  14094. parSize := parSize + (-parSize) MOD system.addressSize;
  14095. END;
  14096. parameter := parameter.prevParameter;
  14097. END;
  14098. IF procedureType.selfParameter # NIL THEN
  14099. parameter := procedureType.selfParameter;
  14100. INC(parSize,system.SizeOfParameter(parameter));
  14101. parSize := parSize + (-parSize) MOD system.addressSize;
  14102. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  14103. END; (* method => self pointer *)
  14104. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  14105. RETURN ToMemoryUnits(system,parSize)
  14106. END ParametersSize;
  14107. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  14108. BEGIN
  14109. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  14110. END IsNested;
  14111. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  14112. BEGIN
  14113. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  14114. scope := scope.outerScope;
  14115. END;
  14116. RETURN scope # NIL;
  14117. END InCellScope;
  14118. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  14119. BEGIN
  14120. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  14121. END ProcedureParametersSize;
  14122. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  14123. VAR dataUnit: LONGINT;
  14124. BEGIN dataUnit := system.dataUnit;
  14125. ASSERT(size MOD system.dataUnit = 0);
  14126. RETURN LONGINT(size DIV system.dataUnit)
  14127. END ToMemoryUnits;
  14128. PROCEDURE Get*(): Backend.Backend;
  14129. VAR backend: IntermediateBackend;
  14130. BEGIN NEW(backend); RETURN backend
  14131. END Get;
  14132. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  14133. VAR instruction: IntermediateCode.Instruction;
  14134. BEGIN
  14135. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  14136. RETURN instruction
  14137. END Nop;
  14138. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14139. VAR instruction: IntermediateCode.Instruction;
  14140. BEGIN
  14141. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  14142. RETURN instruction
  14143. END Mov;
  14144. (* like Mov but ensures that no new register will be allocated for dest *)
  14145. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14146. VAR instruction: IntermediateCode.Instruction;
  14147. BEGIN
  14148. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  14149. RETURN instruction
  14150. END MovReplace;
  14151. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14152. VAR instruction: IntermediateCode.Instruction;
  14153. BEGIN
  14154. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  14155. RETURN instruction
  14156. END Conv;
  14157. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  14158. VAR instruction: IntermediateCode.Instruction;
  14159. BEGIN
  14160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  14161. RETURN instruction
  14162. END Call;
  14163. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  14164. VAR op1, op2, op3: IntermediateCode.Operand;
  14165. VAR instruction: IntermediateCode.Instruction;
  14166. BEGIN
  14167. IntermediateCode.InitNumber(op1,pcOffset);
  14168. IntermediateCode.InitNumber(op2,callingConvention);
  14169. IntermediateCode.InitNumber(op3,unwind);
  14170. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  14171. RETURN instruction
  14172. END Exit;
  14173. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14174. VAR instruction: IntermediateCode.Instruction;
  14175. BEGIN
  14176. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  14177. RETURN instruction
  14178. END Return;
  14179. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14180. VAR instruction: IntermediateCode.Instruction;
  14181. BEGIN
  14182. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  14183. RETURN instruction
  14184. END Result;
  14185. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  14186. VAR op1: IntermediateCode.Operand;
  14187. VAR instruction: IntermediateCode.Instruction;
  14188. BEGIN
  14189. IntermediateCode.InitNumber(op1,nr);
  14190. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  14191. RETURN instruction
  14192. END Trap;
  14193. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  14194. VAR instruction: IntermediateCode.Instruction;
  14195. BEGIN
  14196. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  14197. RETURN instruction
  14198. END Br;
  14199. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14200. VAR instruction: IntermediateCode.Instruction;
  14201. BEGIN
  14202. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  14203. RETURN instruction
  14204. END Breq;
  14205. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14206. VAR instruction: IntermediateCode.Instruction;
  14207. BEGIN
  14208. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  14209. RETURN instruction
  14210. END Brne;
  14211. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14212. VAR instruction: IntermediateCode.Instruction;
  14213. BEGIN
  14214. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  14215. RETURN instruction
  14216. END Brge;
  14217. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14218. VAR instruction: IntermediateCode.Instruction;
  14219. BEGIN
  14220. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  14221. RETURN instruction
  14222. END Brlt;
  14223. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  14224. VAR instruction: IntermediateCode.Instruction;
  14225. BEGIN
  14226. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  14227. RETURN instruction
  14228. END Pop;
  14229. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14230. VAR instruction: IntermediateCode.Instruction;
  14231. BEGIN
  14232. ASSERT(op.mode # IntermediateCode.Undefined);
  14233. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  14234. RETURN instruction
  14235. END Push;
  14236. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14237. VAR instruction: IntermediateCode.Instruction;
  14238. BEGIN
  14239. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  14240. RETURN instruction
  14241. END Neg;
  14242. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14243. VAR instruction: IntermediateCode.Instruction;
  14244. BEGIN
  14245. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  14246. RETURN instruction
  14247. END Not;
  14248. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14249. VAR instruction: IntermediateCode.Instruction;
  14250. BEGIN
  14251. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  14252. RETURN instruction
  14253. END Abs;
  14254. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14255. VAR instruction: IntermediateCode.Instruction;
  14256. BEGIN
  14257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  14258. ASSERT(~IsImmediate(instruction.op1));
  14259. RETURN instruction
  14260. END Mul;
  14261. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14262. VAR instruction: IntermediateCode.Instruction;
  14263. BEGIN
  14264. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  14265. RETURN instruction
  14266. END Div;
  14267. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14268. VAR instruction: IntermediateCode.Instruction;
  14269. BEGIN
  14270. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  14271. RETURN instruction
  14272. END Mod;
  14273. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14274. VAR instruction: IntermediateCode.Instruction;
  14275. BEGIN
  14276. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  14277. RETURN instruction
  14278. END Sub;
  14279. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14280. VAR instruction: IntermediateCode.Instruction;
  14281. BEGIN
  14282. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  14283. RETURN instruction
  14284. END Add;
  14285. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14286. VAR instruction: IntermediateCode.Instruction;
  14287. BEGIN
  14288. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  14289. RETURN instruction
  14290. END And;
  14291. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14292. VAR instruction: IntermediateCode.Instruction;
  14293. BEGIN
  14294. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  14295. RETURN instruction
  14296. END Or;
  14297. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14298. VAR instruction: IntermediateCode.Instruction;
  14299. BEGIN
  14300. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  14301. RETURN instruction
  14302. END Xor;
  14303. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14304. VAR instruction: IntermediateCode.Instruction;
  14305. BEGIN
  14306. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  14307. RETURN instruction
  14308. END Shl;
  14309. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14310. VAR instruction: IntermediateCode.Instruction;
  14311. BEGIN
  14312. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  14313. RETURN instruction
  14314. END Shr;
  14315. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14316. VAR instruction: IntermediateCode.Instruction;
  14317. BEGIN
  14318. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  14319. RETURN instruction
  14320. END Rol;
  14321. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14322. VAR instruction: IntermediateCode.Instruction;
  14323. BEGIN
  14324. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  14325. RETURN instruction
  14326. END Ror;
  14327. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14328. VAR instruction: IntermediateCode.Instruction;
  14329. BEGIN
  14330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  14331. RETURN instruction
  14332. END Cas;
  14333. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14334. VAR instruction: IntermediateCode.Instruction;
  14335. BEGIN
  14336. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  14337. ASSERT(~IntermediateCode.IsVectorRegister(src));
  14338. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  14339. RETURN instruction
  14340. END Copy;
  14341. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  14342. VAR instruction: IntermediateCode.Instruction;
  14343. BEGIN
  14344. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  14345. RETURN instruction
  14346. END Fill;
  14347. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  14348. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  14349. BEGIN
  14350. string := IntermediateCode.String(s);
  14351. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  14352. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  14353. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  14354. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  14355. RETURN instruction
  14356. END Asm;
  14357. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14358. VAR instruction: IntermediateCode.Instruction;
  14359. BEGIN
  14360. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  14361. RETURN instruction
  14362. END Data;
  14363. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  14364. VAR instruction: IntermediateCode.Instruction;
  14365. BEGIN
  14366. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  14367. IntermediateCode.SetSubType(instruction, subtype);
  14368. RETURN instruction
  14369. END SpecialInstruction;
  14370. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  14371. VAR op1: IntermediateCode.Operand;
  14372. VAR instruction: IntermediateCode.Instruction;
  14373. BEGIN
  14374. (*! generate a warning if size exceeds a certain limit *)
  14375. (*
  14376. ASSERT(bytes < 1000000); (* sanity check *)
  14377. *)
  14378. ASSERT(0 <= units); (* sanity check *)
  14379. IntermediateCode.InitNumber(op1,units);
  14380. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  14381. RETURN instruction
  14382. END Reserve;
  14383. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  14384. VAR op1: IntermediateCode.Operand;
  14385. VAR instruction: IntermediateCode.Instruction;
  14386. BEGIN
  14387. IntermediateCode.InitNumber(op1,position.start);
  14388. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  14389. RETURN instruction
  14390. END LabelInstruction;
  14391. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  14392. VAR pc: LONGINT;
  14393. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  14394. BEGIN
  14395. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  14396. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  14397. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  14398. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  14399. IF instr.op1.type.form = IntermediateCode.Float THEN
  14400. RETURN instr.op1.floatValue = op.floatValue
  14401. ELSE
  14402. RETURN instr.op1.intValue = op.intValue
  14403. END;
  14404. END ProvidesValue;
  14405. BEGIN
  14406. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  14407. pc := 0;
  14408. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  14409. INC(pc);
  14410. END;
  14411. IF pc = data.pc THEN
  14412. data.Emit(Data(Basic.invalidPosition,vop));
  14413. END;
  14414. RETURN pc
  14415. END EnterImmediate;
  14416. PROCEDURE Init;
  14417. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  14418. BEGIN
  14419. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  14420. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  14421. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  14422. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  14423. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  14424. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  14425. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  14426. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  14427. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  14428. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  14429. IntermediateCode.InitOperand(emptyOperand);
  14430. FOR i := 0 TO NumberSystemCalls-1 DO
  14431. name := "@SystemCall";
  14432. Basic.AppendNumber(name,i);
  14433. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  14434. END;
  14435. END Init;
  14436. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  14437. BEGIN
  14438. RETURN (symbol # NIL) & symbol.NeedsSection();
  14439. END IsExported;
  14440. BEGIN
  14441. Init;
  14442. END FoxIntermediateBackend.
  14443. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  14444. # Release.Build --path="/temp/obg/" Win32 ~
  14445. # 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 ~
  14446. FStols.CloseFiles A2Z.exe ~
  14447. System.FreeDownTo FoxIntermediateBackend ~
  14448. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  14449. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  14450. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  14451. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  14452. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  14453. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  14454. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  14455. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  14456. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  14457. GenericLinker.Mod Loader.Mod BootConsole.Mod