FoxIntermediateBackend.Mod 615 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973149741497514976149771497814979149801498114982149831498414985149861498714988149891499014991149921499314994149951499614997149981499915000150011500215003150041500515006150071500815009150101501115012150131501415015150161501715018150191502015021150221502315024150251502615027150281502915030150311503215033150341503515036150371503815039150401504115042150431504415045150461504715048150491505015051150521505315054150551505615057150581505915060150611506215063150641506515066150671506815069150701507115072150731507415075150761507715078150791508015081150821508315084150851508615087150881508915090150911509215093150941509515096150971509815099151001510115102151031510415105151061510715108151091511015111151121511315114151151511615117151181511915120151211512215123151241512515126151271512815129151301513115132151331513415135151361513715138151391514015141151421514315144151451514615147151481514915150151511515215153151541515515156151571515815159151601516115162151631516415165151661516715168151691517015171151721517315174151751517615177151781517915180151811518215183151841518515186151871518815189151901519115192151931519415195151961519715198151991520015201152021520315204152051520615207152081520915210152111521215213152141521515216152171521815219152201522115222152231522415225152261522715228152291523015231152321523315234152351523615237152381523915240152411524215243152441524515246152471524815249152501525115252152531525415255152561525715258152591526015261152621526315264152651526615267152681526915270152711527215273152741527515276152771527815279152801528115282152831528415285152861528715288152891529015291152921529315294152951529615297152981529915300153011530215303153041530515306153071530815309153101531115312153131531415315153161531715318153191532015321153221532315324153251532615327153281532915330153311533215333153341533515336153371533815339153401534115342153431534415345153461534715348153491535015351153521535315354153551535615357153581535915360153611536215363153641536515366153671536815369153701537115372153731537415375153761537715378153791538015381153821538315384153851538615387153881538915390153911539215393153941539515396153971539815399154001540115402154031540415405154061540715408154091541015411154121541315414154151541615417154181541915420154211542215423154241542515426154271542815429154301543115432154331543415435154361543715438154391544015441154421544315444154451544615447154481544915450154511545215453154541545515456154571545815459154601546115462154631546415465154661546715468154691547015471154721547315474154751547615477154781547915480154811548215483154841548515486154871548815489154901549115492154931549415495154961549715498154991550015501155021550315504155051550615507155081550915510155111551215513155141551515516155171551815519155201552115522155231552415525155261552715528155291553015531155321553315534155351553615537155381553915540155411554215543155441554515546155471554815549155501555115552155531555415555155561555715558155591556015561155621556315564155651556615567155681556915570155711557215573155741557515576155771557815579155801558115582155831558415585155861558715588155891559015591155921559315594155951559615597155981559915600156011560215603156041560515606156071560815609156101561115612156131561415615156161561715618156191562015621156221562315624156251562615627156281562915630156311563215633156341563515636156371563815639156401564115642156431564415645156461564715648156491565015651156521565315654156551565615657156581565915660156611566215663156641566515666156671566815669156701567115672156731567415675156761567715678156791568015681156821568315684156851568615687156881568915690156911569215693156941569515696156971569815699157001570115702157031570415705157061570715708157091571015711157121571315714157151571615717157181571915720157211572215723157241572515726157271572815729157301573115732157331573415735157361573715738157391574015741157421574315744157451574615747157481574915750157511575215753157541575515756157571575815759157601576115762157631576415765157661576715768157691577015771157721577315774157751577615777157781577915780157811578215783157841578515786157871578815789157901579115792157931579415795157961579715798157991580015801158021580315804158051580615807158081580915810158111581215813158141581515816158171581815819158201582115822158231582415825158261582715828158291583015831158321583315834158351583615837158381583915840158411584215843158441584515846158471584815849
  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 callconv IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention} THEN
  1375. Emit(Push(Basic.invalidPosition, one)) ;
  1376. ELSE
  1377. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1378. GetCodeSectionNameForSymbol(procedure, name);
  1379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1380. ELSE
  1381. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1382. END;
  1383. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1384. IntermediateCode.AddOffset(op1, 1);
  1385. Emit(Push(Basic.invalidPosition,op1));
  1386. END;
  1387. Emit(Mov(Basic.invalidPosition,fp, sp));
  1388. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1389. NEW(call, section);
  1390. NEW(nocall, section);
  1391. reg := NewRegisterOperand(addressType);
  1392. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1393. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1394. BrltL(call, sp, reg);
  1395. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1396. BrgeL(nocall, sp, op2);
  1397. call.Resolve(section.pc);
  1398. Emit(Push(Basic.invalidPosition, reg));
  1399. ReleaseIntermediateOperand(reg);
  1400. parametersSize := ProcParametersSize(procedure);
  1401. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1402. Emit(Push(Basic.invalidPosition, op2));
  1403. CallThis(position, "Activities","ExpandStack",2);
  1404. Emit(Result(Basic.invalidPosition, sp));
  1405. nocall.Resolve(section.pc);
  1406. END;
  1407. ELSE
  1408. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1409. Emit(Push(Basic.invalidPosition, one)) ;
  1410. procedureType.SetParametersOffset(1);
  1411. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1412. END;
  1413. Emit(Mov(Basic.invalidPosition, fp, sp));
  1414. END;
  1415. END;
  1416. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1417. SELF.section := prevSection;
  1418. dump := prevDump;
  1419. END EmitEnter;
  1420. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1421. VAR op1,op2: IntermediateCode.Operand;
  1422. VAR instruction: IntermediateCode.Instruction;
  1423. BEGIN
  1424. IntermediateCode.InitNumber(op1,callconv);
  1425. IntermediateCode.InitNumber(op2,varSize);
  1426. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1427. RETURN instruction
  1428. END Enter;
  1429. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1430. VAR op1: IntermediateCode.Operand;
  1431. VAR instruction: IntermediateCode.Instruction;
  1432. BEGIN
  1433. IntermediateCode.InitNumber(op1,callconv);
  1434. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1435. RETURN instruction
  1436. END Leave;
  1437. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1438. VAR prevSection: IntermediateCode.Section;
  1439. VAR op2: IntermediateCode.Operand;
  1440. VAR body: SyntaxTree.Body;
  1441. BEGIN
  1442. prevSection := SELF.section;
  1443. SELF.section := section;
  1444. Emit(Leave(position, callconv));
  1445. IF procedure # NIL THEN
  1446. body := procedure.procedureScope.body;
  1447. ELSE
  1448. body := NIL;
  1449. END;
  1450. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1451. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1452. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1453. Emit(Add(position, sp, fp, op2));
  1454. ELSE
  1455. Emit(Mov(position, sp, fp));
  1456. END;
  1457. Emit(Pop(position, fp));
  1458. END;
  1459. SELF.section := prevSection;
  1460. END EmitLeave;
  1461. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1462. VAR m: SymbolMap;
  1463. BEGIN
  1464. position := x.position;
  1465. IF currentIsInline THEN
  1466. m := currentMapper.Get(x);
  1467. IF m # NIL THEN
  1468. (*
  1469. Printout.Info("mapping from", x);
  1470. Printout.Info("mapping to ", m.to);
  1471. *)
  1472. VExpression(m.to);
  1473. op := result;
  1474. IF m.tag # NIL THEN
  1475. ReleaseIntermediateOperand(result.tag);
  1476. VExpression(m.tag);
  1477. op.tag := result.op;
  1478. ReleaseIntermediateOperand(result.tag);
  1479. END;
  1480. RETURN
  1481. END;
  1482. END;
  1483. VSymbol(x);
  1484. op := result;
  1485. END Symbol;
  1486. PROCEDURE Expression(x: SyntaxTree.Expression);
  1487. BEGIN
  1488. position := x.position;
  1489. constantDeclaration := NIL;
  1490. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1491. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1492. END;
  1493. IF x.resolved # NIL THEN
  1494. VExpression(x.resolved);
  1495. ELSE
  1496. VExpression(x);
  1497. END;
  1498. (* check this, was commented out in ActiveCells3 *)
  1499. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1500. Error(x.position, "unsupported modifier");
  1501. END;
  1502. END Expression;
  1503. (*
  1504. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1505. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1506. BEGIN
  1507. temporaries.GetUsage(current);
  1508. FOR i := 0 TO LEN(current)-1 DO
  1509. set := current[i] - previous[i];
  1510. IF set # {} THEN
  1511. FOR j := 0 TO MAX(SET)-1 DO
  1512. IF j IN set THEN
  1513. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1514. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1515. Symbol(variable, op);
  1516. MakeMemory(tmp,op.op,addressType,0);
  1517. ReleaseOperand(op);
  1518. Emit(Mov(position,tmp, nil ) );
  1519. ReleaseIntermediateOperand(tmp);
  1520. END;
  1521. END;
  1522. END;
  1523. END;
  1524. END;
  1525. END ResetUsedTemporaries;
  1526. *)
  1527. PROCEDURE Statement(x: SyntaxTree.Statement);
  1528. VAR use: VariableUse;
  1529. BEGIN
  1530. temporaries.GetUsage(use);
  1531. position := x.position;
  1532. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1533. IF commentPrintout # NIL THEN
  1534. commentPrintout.Statement(x);
  1535. dump.Ln;
  1536. (*dump.Update;*)
  1537. END;
  1538. VStatement(x);
  1539. (*
  1540. CheckRegistersFree();
  1541. *)
  1542. (*ResetUsedTemporaries(use);*)
  1543. temporaries.SetUsage(use);
  1544. END Statement;
  1545. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1546. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1547. *)
  1548. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1549. BEGIN
  1550. ASSERT(op.mode # IntermediateCode.Undefined);
  1551. IF op.mode = IntermediateCode.ModeMemory THEN
  1552. ReuseCopy(res,op);
  1553. ELSE
  1554. res := op;
  1555. UseIntermediateOperand(res);
  1556. END;
  1557. IntermediateCode.AddOffset(res,offset);
  1558. IntermediateCode.MakeMemory(res,type);
  1559. END MakeMemory;
  1560. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1561. VAR mem: IntermediateCode.Operand;
  1562. BEGIN
  1563. MakeMemory(mem,res,type,offset);
  1564. ReleaseIntermediateOperand(res);
  1565. res := mem;
  1566. END ToMemory;
  1567. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1568. VAR mem: IntermediateCode.Operand;
  1569. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1570. componentType: SyntaxTree.Type;
  1571. BEGIN
  1572. type := type.resolved;
  1573. IF operand.mode = ModeReference THEN
  1574. IF type IS SyntaxTree.RangeType THEN
  1575. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1576. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1577. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1578. ReleaseOperand(operand);
  1579. operand.op := firstOp;
  1580. operand.tag := lastOp;
  1581. operand.extra := stepOp;
  1582. ELSIF type IS SyntaxTree.ComplexType THEN
  1583. componentType := type(SyntaxTree.ComplexType).componentType;
  1584. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1585. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1586. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1587. ReleaseOperand(operand);
  1588. operand.op := firstOp;
  1589. operand.tag := lastOp
  1590. ELSE
  1591. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1592. ReleaseIntermediateOperand(operand.op);
  1593. (* EXPERIMENTAL *)
  1594. IF operand.availability >= 0 THEN
  1595. IF availableSymbols[operand.availability].inRegister THEN
  1596. operand.op := availableSymbols[operand.availability].register;
  1597. UseIntermediateOperand(operand.op);
  1598. ELSE
  1599. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1600. availableSymbols[operand.availability].memory := mem;
  1601. operand.op := availableSymbols[operand.availability].register;
  1602. Emit(Mov(position, operand.op, mem));
  1603. availableSymbols[operand.availability].inRegister := TRUE;
  1604. END;
  1605. ReleaseIntermediateOperand(mem);
  1606. ELSE
  1607. operand.op := mem;
  1608. END;
  1609. END;
  1610. operand.mode := ModeValue;
  1611. END;
  1612. ASSERT(operand.mode = ModeValue);
  1613. END LoadValue;
  1614. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1615. BEGIN
  1616. InitOperand(result, ModeUndefined);
  1617. Expression(x);
  1618. op := result;
  1619. LoadValue(op,x.type.resolved);
  1620. END Evaluate;
  1621. PROCEDURE EvaluateX(CONST x: SyntaxTree.Expression; VAR result: Operand);
  1622. VAR operand: Operand; type: SyntaxTree.Type; symbol: SyntaxTree.Symbol;
  1623. BEGIN
  1624. Evaluate(x, result); RETURN;
  1625. IF (x.resolved # NIL) & (x.resolved # x) THEN EvaluateX(x.resolved, result); RETURN END;
  1626. WITH x:
  1627. SyntaxTree.UnaryExpression DO
  1628. EvaluateUnaryExpression(x, result);
  1629. RETURN;
  1630. |SyntaxTree.BinaryExpression DO
  1631. EvaluateBinaryExpression(x, result);
  1632. RETURN;
  1633. |SyntaxTree.Set DO
  1634. EvaluateSet(x, result);
  1635. RETURN;
  1636. |SyntaxTree.RangeExpression DO
  1637. InitOperand(result, ModeValue);
  1638. ASSERT(x.first # NIL);
  1639. EvaluateX(x.first, operand);
  1640. result.op := operand.op;
  1641. UseIntermediateOperand(result.op);
  1642. ReleaseOperand(operand);
  1643. ASSERT(x.last # NIL);
  1644. EvaluateX(x.last, operand);
  1645. result.tag := operand.op;
  1646. UseIntermediateOperand(result.tag);
  1647. ReleaseOperand(operand);
  1648. IF x.step # NIL THEN
  1649. EvaluateX(x.step, operand);
  1650. result.extra := operand.op;
  1651. UseIntermediateOperand(result.extra);
  1652. ReleaseOperand(operand);
  1653. END;
  1654. |SyntaxTree.SymbolDesignator DO
  1655. symbol := x.symbol;
  1656. WITH symbol: SyntaxTree.Constant DO
  1657. EvaluateX(symbol.value, result);
  1658. RETURN
  1659. ELSE (* designate and load --> below *)
  1660. END;
  1661. |SyntaxTree.BuiltinCallDesignator DO
  1662. EvaluateBuiltinCallDesignator(x,result);
  1663. (*
  1664. |SyntaxTree.Conversion DO
  1665. |SyntaxTree.ProcedureCallDesignator
  1666. |SyntaxTree.TypeGuardDesignator
  1667. |SyntaxTree.DereferenceDesignator
  1668. |SyntaxTree.SupercallDesignator
  1669. |SyntaxTree.SelfDesignator
  1670. *)
  1671. |SyntaxTree.BooleanValue DO
  1672. InitOperand(result,ModeValue);
  1673. IF x.value THEN result.op := true ELSE result.op := false END;
  1674. RETURN;
  1675. |SyntaxTree.IntegerValue DO
  1676. InitOperand(result,ModeValue);
  1677. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1678. IF ~supportedImmediate(result.op) &~inData THEN
  1679. GetImmediateMem(result.op)
  1680. END;
  1681. RETURN;
  1682. |SyntaxTree.CharacterValue DO
  1683. InitOperand(result,ModeValue);
  1684. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  1685. RETURN;
  1686. |SyntaxTree.RealValue DO
  1687. InitOperand(result,ModeValue);
  1688. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1689. RETURN;
  1690. |SyntaxTree.ComplexValue DO
  1691. ASSERT(x.type IS SyntaxTree.ComplexType);
  1692. type := x.type(SyntaxTree.ComplexType).componentType;
  1693. InitOperand(result,ModeValue);
  1694. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,type),x.realValue); (* real part *)
  1695. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,type),x.imagValue); (* imaginary part *)
  1696. RETURN;
  1697. |SyntaxTree.NilValue DO
  1698. InitOperand(result,ModeValue);
  1699. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1700. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1701. RETURN;
  1702. |SyntaxTree.EnumerationValue DO
  1703. InitOperand(result,ModeValue);
  1704. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  1705. RETURN;
  1706. ELSE (* other designators *)
  1707. END;
  1708. Designate(x, result);
  1709. LoadValue(result, x.type);
  1710. END EvaluateX;
  1711. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1712. BEGIN
  1713. InitOperand(result,ModeUndefined);
  1714. Expression(x);
  1715. (* ASSERT(x.mode = ModeReference *)
  1716. op := result;
  1717. END Designate;
  1718. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1719. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1720. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1721. leftExpression, rightExpression: SyntaxTree.Expression;
  1722. BEGIN
  1723. ASSERT(label # NIL);
  1724. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1725. WITH x:
  1726. SyntaxTree.UnaryExpression DO
  1727. CASE x.operator OF
  1728. Scanner.Not:
  1729. Condition(x.left,label,~reason);
  1730. RETURN;
  1731. ELSE
  1732. END;
  1733. | SyntaxTree.BinaryExpression DO
  1734. leftType := x.left.type.resolved;
  1735. rightType := x.right.type.resolved;
  1736. CASE x.operator OF
  1737. Scanner.Or:
  1738. (* shortcut evaluation of left OR right *)
  1739. IF reason THEN (*left or right*)
  1740. Condition(x.left,label,TRUE);
  1741. Condition(x.right,label,TRUE);
  1742. ELSE (* ~ (left or right) = ~left & ~right *)
  1743. skip := NewLabel();
  1744. Condition(x.left,skip,TRUE);
  1745. Condition(x.right,label,FALSE);
  1746. SetLabel(skip);
  1747. END;
  1748. RETURN;
  1749. |Scanner.And:
  1750. (* shortcut evaluation of left & right *)
  1751. IF reason THEN (* left and right *)
  1752. skip := NewLabel();
  1753. Condition(x.left,skip,FALSE);
  1754. Condition(x.right,label,TRUE);
  1755. SetLabel(skip);
  1756. ELSE (* ~(left and right) = ~left or ~right *)
  1757. Condition(x.left,label,FALSE);
  1758. Condition(x.right,label,FALSE);
  1759. END;
  1760. RETURN;
  1761. |Scanner.Is:
  1762. (* get type desc tag *)
  1763. IF IsPointerToRecord(x.left.type,recordType) THEN
  1764. EvaluateX(x.left, left);
  1765. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1766. ELSE
  1767. Designate(x.left,left);
  1768. END;
  1769. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1770. ReleaseOperand(left);
  1771. RETURN;
  1772. |Scanner.Equal:
  1773. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1774. IF reason THEN
  1775. CompareString(BreqL,label,x.left,x.right);
  1776. ELSE
  1777. CompareString(BrneL,label,x.left,x.right);
  1778. END;
  1779. ELSE
  1780. Evaluate(x.left,left);
  1781. Evaluate(x.right,right);
  1782. IF leftType IS SyntaxTree.RangeType THEN
  1783. ASSERT(rightType IS SyntaxTree.RangeType);
  1784. IF reason THEN
  1785. skip := NewLabel();
  1786. BrneL(skip, left.op, right.op); (* first *)
  1787. BrneL(skip, left.tag, right.tag); (* last *)
  1788. BreqL(label, left.extra, right.extra); (* step *)
  1789. SetLabel(skip);
  1790. ELSE
  1791. BrneL(label, left.op, right.op); (* first *)
  1792. BrneL(label, left.tag, right.tag); (* last *)
  1793. BrneL(label, left.extra, right.extra); (* step *)
  1794. END;
  1795. ReleaseOperand(left); ReleaseOperand(right);
  1796. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1797. IF reason THEN
  1798. skip := NewLabel();
  1799. BrneL(skip, left.op, right.op); (* first *)
  1800. BreqL(label, left.tag, right.tag); (* last *)
  1801. SetLabel(skip);
  1802. ELSE
  1803. BrneL(label, left.op, right.op); (* first *)
  1804. BrneL(label, left.tag, right.tag); (* last *)
  1805. END;
  1806. ReleaseOperand(left); ReleaseOperand(right);
  1807. ELSE
  1808. IF reason THEN
  1809. BreqL(label,left.op,right.op);
  1810. ELSE
  1811. BrneL(label,left.op,right.op);
  1812. END;
  1813. ReleaseOperand(left); ReleaseOperand(right);
  1814. END;
  1815. END;
  1816. RETURN;
  1817. |Scanner.LessEqual:
  1818. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1819. IF reason THEN
  1820. CompareString(BrgeL,label,x.right,x.left);
  1821. ELSE
  1822. CompareString(BrltL,label,x.right,x.left);
  1823. END;
  1824. ELSE
  1825. Evaluate(x.left,left);
  1826. Evaluate(x.right,right);
  1827. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1828. Reuse1(temp,right.op);
  1829. Emit(And(position,temp,left.op,right.op));
  1830. ReleaseOperand(right);
  1831. IF reason THEN
  1832. BreqL(label,temp,left.op);
  1833. ELSE
  1834. BrneL(label,temp,left.op);
  1835. END;
  1836. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1837. ELSE
  1838. IF reason THEN
  1839. BrgeL(label,right.op,left.op);
  1840. ELSE
  1841. BrltL(label,right.op,left.op);
  1842. END;
  1843. ReleaseOperand(left); ReleaseOperand(right);
  1844. END;
  1845. END;
  1846. RETURN;
  1847. |Scanner.Less:
  1848. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1849. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1850. leftExpression.SetType(system.booleanType);
  1851. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1852. rightExpression.SetType(system.booleanType);
  1853. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1854. leftExpression.SetType(system.booleanType);
  1855. Condition(leftExpression,label,reason);
  1856. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1857. IF reason THEN
  1858. CompareString(BrltL,label,x.left,x.right);
  1859. ELSE
  1860. CompareString(BrgeL,label,x.left,x.right);
  1861. END;
  1862. ELSE
  1863. Evaluate(x.left,left);
  1864. Evaluate(x.right,right);
  1865. IF reason THEN
  1866. BrltL(label,left.op,right.op);
  1867. ELSE
  1868. BrgeL(label,left.op,right.op);
  1869. END;
  1870. ReleaseOperand(left); ReleaseOperand(right);
  1871. END;
  1872. RETURN;
  1873. |Scanner.Greater:
  1874. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1875. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1876. leftExpression.SetType(system.booleanType);
  1877. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1878. rightExpression.SetType(system.booleanType);
  1879. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1880. leftExpression.SetType(system.booleanType);
  1881. Condition(leftExpression,label,reason);
  1882. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1883. IF reason THEN
  1884. CompareString(BrltL,label,x.right,x.left);
  1885. ELSE
  1886. CompareString(BrgeL,label,x.right,x.left);
  1887. END;
  1888. ELSE
  1889. Evaluate(x.left,left);
  1890. Evaluate(x.right,right);
  1891. IF reason THEN
  1892. BrltL(label, right.op,left.op);
  1893. ELSE
  1894. BrgeL(label, right.op,left.op);
  1895. END;
  1896. ReleaseOperand(left); ReleaseOperand(right);
  1897. END;
  1898. RETURN;
  1899. |Scanner.GreaterEqual:
  1900. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1901. IF reason THEN
  1902. CompareString(BrgeL,label,x.left,x.right);
  1903. ELSE
  1904. CompareString(BrltL,label,x.left,x.right);
  1905. END;
  1906. ELSE
  1907. Evaluate(x.left,left);
  1908. Evaluate(x.right,right);
  1909. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1910. Reuse1(temp,left.op);
  1911. Emit(And(position,temp,left.op,right.op));
  1912. ReleaseOperand(left);
  1913. IF reason THEN
  1914. BreqL(label, temp, right.op);
  1915. ELSE
  1916. BrneL(label, temp, right.op);
  1917. END;
  1918. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1919. ELSE
  1920. IF reason THEN
  1921. BrgeL(label,left.op,right.op);
  1922. ELSE
  1923. BrltL(label, left.op,right.op);
  1924. END;
  1925. ReleaseOperand(left); ReleaseOperand(right);
  1926. END;
  1927. END;
  1928. RETURN;
  1929. |Scanner.Unequal:
  1930. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1931. IF reason THEN
  1932. CompareString(BrneL,label,x.left,x.right);
  1933. ELSE
  1934. CompareString(BreqL,label,x.left,x.right);
  1935. END
  1936. ELSE
  1937. Evaluate(x.left,left);
  1938. Evaluate(x.right,right);
  1939. IF leftType IS SyntaxTree.RangeType THEN
  1940. ASSERT(rightType IS SyntaxTree.RangeType);
  1941. IF ~reason THEN
  1942. skip := NewLabel();
  1943. BrneL(skip, left.op, right.op); (* first *)
  1944. BrneL(skip, left.tag, right.tag); (* last *)
  1945. BreqL(label, left.extra, right.extra); (* step *)
  1946. SetLabel(skip);
  1947. ELSE
  1948. BrneL(label, left.op, right.op); (* first *)
  1949. BrneL(label, left.tag, right.tag); (* last *)
  1950. BrneL(label, left.extra, right.extra); (* step *)
  1951. END;
  1952. ReleaseOperand(left); ReleaseOperand(right);
  1953. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1954. IF reason THEN
  1955. BrneL(label, left.op, right.op);
  1956. BrneL(label, left.tag, right.tag);
  1957. ELSE
  1958. skip := NewLabel();
  1959. BrneL(skip, left.op, right.op);
  1960. BreqL(label, left.tag, right.tag);
  1961. SetLabel(skip);
  1962. END;
  1963. ReleaseOperand(left); ReleaseOperand(right);
  1964. ELSE
  1965. IF reason THEN
  1966. BrneL(label,left.op,right.op);
  1967. ELSE
  1968. BreqL(label,left.op,right.op);
  1969. END;
  1970. ReleaseOperand(left); ReleaseOperand(right);
  1971. END;
  1972. END;
  1973. RETURN;
  1974. ELSE (* case *)
  1975. END;
  1976. |SyntaxTree.BooleanValue DO
  1977. IF reason = x.value THEN BrL(label) END;
  1978. RETURN;
  1979. ELSE (* with *)
  1980. END;
  1981. (* default case: evaluate and compare result *)
  1982. EvaluateX(x,left);
  1983. IF reason THEN
  1984. BrneL(label,left.op, false);
  1985. ELSE
  1986. BreqL(label,left.op, false);
  1987. END;
  1988. ReleaseOperand(left);
  1989. END Condition;
  1990. PROCEDURE EvaluateUnaryExpression(x: SyntaxTree.UnaryExpression; VAR result: Operand);
  1991. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1992. BEGIN
  1993. IF Trace THEN TraceEnter("EvaluateUnaryExpression") END;
  1994. dest := destination; destination := emptyOperand;
  1995. CASE x.operator OF
  1996. Scanner.Not:
  1997. EvaluateX(x.left, operand);
  1998. InitOperand(result,ModeValue);
  1999. Reuse1a(result.op,operand.op,dest);
  2000. Emit(Xor(position,result.op,operand.op,true));
  2001. ReleaseOperand(operand);
  2002. |Scanner.Minus:
  2003. EvaluateX(x.left, operand);
  2004. InitOperand(result,ModeValue);
  2005. Reuse1a(result.op,operand.op,dest);
  2006. type := x.left.type.resolved;
  2007. IF type IS SyntaxTree.SetType THEN
  2008. Emit(Not(position,result.op,operand.op));
  2009. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2010. Reuse1(result.tag,operand.tag);
  2011. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2012. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2013. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2014. Emit(Neg(position,result.op,operand.op));
  2015. ELSE HALT(200)
  2016. END;
  2017. ReleaseOperand(operand);
  2018. |Scanner.Address:
  2019. Designate(x.left,result);
  2020. result.mode := ModeValue;
  2021. t0 := x.left.type.resolved;
  2022. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2023. ReleaseIntermediateOperand(result.op);
  2024. result.op := result.tag;
  2025. IntermediateCode.InitOperand(result.tag);
  2026. END;
  2027. Convert(result.op,IntermediateCode.GetType(system,x.type));
  2028. END;
  2029. destination := dest;
  2030. IF Trace THEN TraceExit("UnaryExpression") END;
  2031. END EvaluateUnaryExpression;
  2032. PROCEDURE EvaluateBinaryExpression(x: SyntaxTree.BinaryExpression; VAR result: Operand);
  2033. VAR left,right: Operand;zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2034. leftType,rightType: SyntaxTree.Type;
  2035. leftExpression,rightExpression : SyntaxTree.Expression;
  2036. componentType: IntermediateCode.Type;
  2037. exit: Label; dest: IntermediateCode.Operand;
  2038. size: LONGINT;
  2039. BEGIN
  2040. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2041. dest := destination; destination := emptyOperand;
  2042. leftType := x.left.type.resolved;
  2043. rightType := x.right.type.resolved;
  2044. CASE x.operator OF
  2045. Scanner.Or, Scanner.And, Scanner.Is:
  2046. result := ConditionValue(x);
  2047. |Scanner.Plus:
  2048. EvaluateX(x.left,left);
  2049. EvaluateX(x.right,right);
  2050. IF leftType IS SyntaxTree.SetType THEN
  2051. InitOperand(result,ModeValue);
  2052. Reuse2a(result.op,left.op,right.op,dest);
  2053. Emit(Or(position,result.op,left.op,right.op));
  2054. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2055. InitOperand(result,ModeValue);
  2056. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2057. Reuse2(result.tag,left.tag,right.tag);
  2058. Emit(Add(position,result.op,left.op,right.op));
  2059. Emit(Add(position,result.tag,left.tag,right.tag))
  2060. ELSE
  2061. InitOperand(result,ModeValue);
  2062. Reuse2a(result.op,left.op,right.op,dest);
  2063. Emit(Add(position,result.op,left.op,right.op));
  2064. END;
  2065. ReleaseOperand(left); ReleaseOperand(right);
  2066. |Scanner.Minus:
  2067. EvaluateX(x.left,left);
  2068. EvaluateX(x.right,right);
  2069. IF leftType IS SyntaxTree.SetType THEN
  2070. InitOperand(result,ModeValue);
  2071. Reuse1(result.op,right.op);
  2072. Emit(Not(position,result.op,right.op));
  2073. ReleaseOperand(right);
  2074. Emit(And(position,result.op,result.op,left.op));
  2075. ReleaseOperand(left);
  2076. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2077. InitOperand(result,ModeValue);
  2078. Reuse2a(result.op,left.op,right.op,dest);
  2079. Reuse2(result.tag,left.tag,right.tag);
  2080. Emit(Sub(position,result.op,left.op,right.op));
  2081. Emit(Sub(position,result.tag,left.tag,right.tag));
  2082. ReleaseOperand(left); ReleaseOperand(right)
  2083. ELSE
  2084. InitOperand(result,ModeValue);
  2085. Reuse2a(result.op,left.op,right.op,dest);
  2086. Emit(Sub(position,result.op,left.op,right.op));
  2087. ReleaseOperand(left); ReleaseOperand(right);
  2088. END;
  2089. |Scanner.Times:
  2090. EvaluateX(x.left, left);
  2091. EvaluateX(x.right, right);
  2092. IF leftType IS SyntaxTree.SetType THEN
  2093. InitOperand(result,ModeValue);
  2094. Reuse2a(result.op,left.op,right.op,dest);
  2095. Emit(And(position,result.op,left.op,right.op));
  2096. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2097. InitOperand(result, ModeValue);
  2098. componentType := left.op.type;
  2099. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2100. Emit(Mul(position,result.op, left.op, right.op));
  2101. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2102. Emit(Mul(position,tempReg, left.tag, right.tag));
  2103. Emit(Sub(position,result.op, result.op, tempReg));
  2104. Reuse2(result.tag, left.tag, right.op);
  2105. Emit(Mul(position,result.tag, left.tag, right.op));
  2106. Emit(Mul(position,tempReg, left.op, right.tag));
  2107. Emit(Add(position,result.tag, result.tag, tempReg));
  2108. ReleaseIntermediateOperand(tempReg)
  2109. ELSE
  2110. InitOperand(result,ModeValue);
  2111. Reuse2a(result.op,left.op,right.op,dest);
  2112. Emit(Mul(position,result.op,left.op,right.op));
  2113. END;
  2114. ReleaseOperand(left); ReleaseOperand(right);
  2115. |Scanner.Div:
  2116. EvaluateX(x.left, left);
  2117. EvaluateX(x.right, right);
  2118. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2119. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2120. IF ~isUnchecked THEN
  2121. exit := NewLabel();
  2122. BrltL(exit,zero,right.op);
  2123. EmitTrap(position,NegativeDivisorTrap);
  2124. SetLabel(exit);
  2125. END;
  2126. END;
  2127. InitOperand(result,ModeValue);
  2128. Reuse2a(result.op,left.op,right.op,dest);
  2129. Emit(Div(position,result.op,left.op,right.op));
  2130. ReleaseOperand(left); ReleaseOperand(right);
  2131. |Scanner.Mod:
  2132. EvaluateX(x.left, left);
  2133. EvaluateX(x.right, right);
  2134. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2135. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2136. IF ~isUnchecked THEN
  2137. exit := NewLabel();
  2138. BrltL(exit,zero,right.op);
  2139. EmitTrap(position,NegativeDivisorTrap);
  2140. SetLabel(exit);
  2141. END;
  2142. END;
  2143. InitOperand(result,ModeValue);
  2144. Reuse2a(result.op,left.op,right.op,dest);
  2145. Emit(Mod(position,result.op,left.op,right.op));
  2146. ReleaseOperand(left); ReleaseOperand(right);
  2147. |Scanner.Slash:
  2148. EvaluateX(x.left, left);
  2149. EvaluateX(x.right, right);
  2150. IF leftType IS SyntaxTree.SetType THEN
  2151. InitOperand(result,ModeValue);
  2152. Reuse2a(result.op,left.op,right.op,dest);
  2153. Emit(Xor(position,result.op,left.op,right.op));
  2154. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2155. InitOperand(result,ModeValue);
  2156. componentType := left.op.type;
  2157. (*
  2158. divisor = right.op * right.op + right.tag * right.tag
  2159. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2160. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2161. *)
  2162. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2163. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2164. Emit(Mul(position,tempReg, right.op, right.op));
  2165. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2166. Emit(Add(position,tempReg, tempReg, tempReg2));
  2167. result.op := tempReg2;
  2168. Emit(Mul(position,result.op, left.op, right.op));
  2169. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2170. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2171. Emit(Add(position,result.op, result.op, tempReg2));
  2172. Emit(Div(position,result.op, result.op, tempReg));
  2173. Reuse2(result.tag, left.tag, right.op);
  2174. Emit(Mul(position,result.tag, left.tag, right.op));
  2175. Emit(Mul(position,tempReg2, left.op, right.tag));
  2176. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2177. Emit(Div(position,result.tag, result.tag, tempReg));
  2178. ReleaseIntermediateOperand(tempReg);
  2179. ReleaseIntermediateOperand(tempReg2)
  2180. ELSE
  2181. InitOperand(result,ModeValue);
  2182. Reuse2a(result.op,left.op,right.op,dest);
  2183. Emit(Div(position,result.op,left.op,right.op));
  2184. END;
  2185. ReleaseOperand(left); ReleaseOperand(right);
  2186. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  2187. result := ConditionValue(x);
  2188. |Scanner.In:
  2189. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  2190. EvaluateX(x.left, left);
  2191. EvaluateX(x.right, right);
  2192. Convert(left.op,setType);
  2193. Convert(right.op,setType);
  2194. result.mode := ModeValue;
  2195. result.tag := nil; (* may be left over from calls to evaluate *)
  2196. ReuseCopy(result.op,right.op);
  2197. Emit(Shr(position,result.op,result.op,left.op));
  2198. ReleaseOperand(right); ReleaseOperand(left);
  2199. IntermediateCode.InitImmediate(one,setType,1);
  2200. Emit(And(position,result.op,result.op,one));
  2201. Convert(result.op,bool);
  2202. ELSE
  2203. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  2204. IF x.operator = Scanner.Questionmarks THEN
  2205. leftExpression := x.left;
  2206. rightExpression := x.right;
  2207. ELSE
  2208. leftExpression := x.right;
  2209. rightExpression := x.left;
  2210. END;
  2211. EvaluateX(leftExpression, left);
  2212. Emit(Push(position,left.op));
  2213. ReleaseOperand(left);
  2214. Designate(rightExpression, right);
  2215. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2216. IF ~backend.cellsAreObjects THEN
  2217. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  2218. END;
  2219. Emit(Push(position,right.op));
  2220. ReleaseOperand(right);
  2221. IF backend.cellsAreObjects THEN
  2222. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  2223. ELSE
  2224. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  2225. END;
  2226. InitOperand(result, ModeValue);
  2227. result.op := NewRegisterOperand(bool);
  2228. Emit(Result(position,result.op));
  2229. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  2230. leftExpression := x.left;
  2231. rightExpression := x.right;
  2232. EvaluateX(leftExpression, left);
  2233. Emit(Push(position,left.op));
  2234. ReleaseOperand(left);
  2235. EvaluateX(rightExpression, right);
  2236. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2237. IF ~backend.cellsAreObjects THEN
  2238. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  2239. END;
  2240. Emit(Push(position,right.op));
  2241. ReleaseOperand(right);
  2242. IF backend.cellsAreObjects THEN
  2243. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  2244. ELSE
  2245. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  2246. END;
  2247. InitOperand(result, ModeValue);
  2248. result.op := NewRegisterOperand(bool);
  2249. Emit(Result(position,result.op));
  2250. ELSE
  2251. HALT(100);
  2252. END;
  2253. END;
  2254. destination := dest;
  2255. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  2256. END EvaluateBinaryExpression;
  2257. PROCEDURE EvaluateSet(x: SyntaxTree.Set; VAR result: Operand);
  2258. VAR
  2259. operand: Operand;
  2260. temp, one, noBits, dest: IntermediateCode.Operand;
  2261. expression: SyntaxTree.Expression;
  2262. i: LONGINT;
  2263. BEGIN
  2264. IF Trace THEN TraceEnter("VisitSet") END;
  2265. dest := destination;
  2266. destination := emptyOperand;
  2267. noBits := IntermediateCode.Immediate(setType, 0);
  2268. one := IntermediateCode.Immediate(setType, 1);
  2269. (* start off with the empty set *)
  2270. InitOperand(result, ModeValue);
  2271. IntermediateCode.InitRegister(result.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2272. Emit(Mov(position,result.op, noBits));
  2273. FOR i := 0 TO x.elements.Length() - 1 DO
  2274. expression := x.elements.GetExpression(i);
  2275. IF expression IS SyntaxTree.RangeExpression THEN
  2276. (* range of set elements *)
  2277. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2278. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2279. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2280. ReleaseIntermediateOperand(temp)
  2281. ELSE
  2282. (* singelton element *)
  2283. Evaluate(expression, operand);
  2284. Convert(operand.op, setType);
  2285. CheckSetElement(operand.op);
  2286. (* create subset containing single element *)
  2287. Reuse1(temp, operand.op);
  2288. Emit(Shl(position,temp, one, operand.op));
  2289. ReleaseOperand(operand);
  2290. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2291. ReleaseIntermediateOperand(temp);
  2292. END
  2293. END;
  2294. destination := dest;
  2295. IF Trace THEN TraceExit("VisitSet") END;
  2296. END EvaluateSet;
  2297. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  2298. VAR op: IntermediateCode.Operand; reg: LONGINT;
  2299. BEGIN
  2300. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  2301. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  2302. RETURN op
  2303. END NewRegisterOperand;
  2304. PROCEDURE UnuseRegister(register: LONGINT);
  2305. BEGIN
  2306. IF (register > 0) THEN
  2307. register := registerUsageCount.Map(register);
  2308. registerUsageCount.DecUse(register);
  2309. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2310. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2311. END;
  2312. IF registerUsageCount.Use(register)=0 THEN
  2313. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  2314. Warning(position, "register cannot be removed");
  2315. END;
  2316. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2317. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  2318. END;
  2319. ELSIF registerUsageCount.Use(register)<0 THEN
  2320. Warning(position, "register removed too often");
  2321. IF dump # NIL THEN
  2322. dump.String("register removed too often"); dump.Ln; dump.Update;
  2323. END;
  2324. END;
  2325. END;
  2326. END UnuseRegister;
  2327. PROCEDURE UseRegister(register: LONGINT);
  2328. BEGIN
  2329. IF (register > 0) THEN
  2330. register := registerUsageCount.Map(register);
  2331. registerUsageCount.IncUse(register);
  2332. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2333. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2334. END;
  2335. IF registerUsageCount.Use(register)=1 THEN
  2336. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  2337. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2338. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  2339. END;
  2340. END;
  2341. END;
  2342. END UseRegister;
  2343. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2344. BEGIN
  2345. UnuseRegister(op.register)
  2346. END ReleaseIntermediateOperand;
  2347. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2348. BEGIN
  2349. UseRegister(op.register)
  2350. END UseIntermediateOperand;
  2351. PROCEDURE ReleaseOperand(CONST op: Operand);
  2352. BEGIN
  2353. UnuseRegister(op.op.register);
  2354. UnuseRegister(op.tag.register);
  2355. UnuseRegister(op.extra.register);
  2356. END ReleaseOperand;
  2357. (* save registers marked in array "markedRegisters" to the stack
  2358. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  2359. *)
  2360. PROCEDURE SaveRegisters();
  2361. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  2362. BEGIN
  2363. entry := usedRegisters;
  2364. WHILE entry # NIL DO
  2365. type := registerUsageCount.used[entry.register].type;
  2366. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  2367. Emit(Push(position,op));
  2368. entry := entry.next;
  2369. END;
  2370. END SaveRegisters;
  2371. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  2372. BEGIN
  2373. saved := usedRegisters;
  2374. usedRegisters := NIL;
  2375. END ReleaseUsedRegisters;
  2376. (** remove parameter registers from used queue *)
  2377. PROCEDURE ReleaseParameterRegisters;
  2378. VAR entry,prev,next: RegisterEntry;
  2379. BEGIN
  2380. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  2381. WHILE entry # NIL DO
  2382. next := entry.next;
  2383. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  2384. registerUsageCount.DecUse(entry.register);
  2385. ASSERT(registerUsageCount.Use(entry.register)=0);
  2386. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2387. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  2388. END;
  2389. ELSIF prev = NIL THEN
  2390. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  2391. ELSE
  2392. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  2393. END;
  2394. entry := next;
  2395. END;
  2396. END ReleaseParameterRegisters;
  2397. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  2398. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  2399. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2400. BEGIN
  2401. entry := saved;
  2402. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2403. entry := prev;
  2404. WHILE entry # NIL DO
  2405. prev := entry.prev;
  2406. type := entry.type;
  2407. class := entry.registerClass;
  2408. IntermediateCode.InitRegister(op,type,class,entry.register);
  2409. Emit(Pop(position,op));
  2410. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2411. entry := prev;
  2412. END;
  2413. END RestoreRegisters;
  2414. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2415. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2416. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2417. BEGIN
  2418. entry := saved;
  2419. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2420. entry := prev;
  2421. WHILE entry # NIL DO
  2422. prev := entry.prev;
  2423. type := entry.type;
  2424. class := entry.registerClass;
  2425. IntermediateCode.InitRegister(op,type,class,entry.register);
  2426. Emit(Mov(position,op,op));
  2427. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2428. entry := prev;
  2429. END;
  2430. END RestoreRegisterUse;
  2431. PROCEDURE CheckRegistersFree;
  2432. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2433. BEGIN
  2434. IF usedRegisters # NIL THEN
  2435. r := usedRegisters;
  2436. WHILE r # NIL DO
  2437. warning := "register ";
  2438. Strings.AppendInt(warning, r.register);
  2439. Strings.Append(warning, " not released.");
  2440. Warning(position,warning);
  2441. r := r .next;
  2442. END;
  2443. END;
  2444. FOR i := 0 TO registerUsageCount.count-1 DO
  2445. IF registerUsageCount.used[i].count < 0 THEN
  2446. warning := "register ";
  2447. Strings.AppendInt(warning, i);
  2448. Strings.Append(warning, " unused too often.");
  2449. Warning(position,warning);
  2450. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2451. warning := "register ";
  2452. Strings.AppendInt(warning, i);
  2453. Strings.Append(warning, " not unused often enough.");
  2454. Warning(position,warning);
  2455. END;
  2456. END;
  2457. END CheckRegistersFree;
  2458. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2459. Otherwise allocate a new register.
  2460. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2461. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2462. BEGIN
  2463. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2464. UseIntermediateOperand(result);
  2465. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2466. UseIntermediateOperand(result);
  2467. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2468. END;
  2469. END Reuse2;
  2470. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2471. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2472. If not then allocate a new register.
  2473. Does NOT necessarily keep the content of src1 or src2 in result!
  2474. *)
  2475. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2476. BEGIN
  2477. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2478. UseIntermediateOperand(result);
  2479. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2480. UseIntermediateOperand(result);
  2481. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2482. result := alternative; alternative := emptyOperand;
  2483. UseIntermediateOperand(result);
  2484. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2485. END;
  2486. END Reuse2a;
  2487. (* like reuse2 but only one source *)
  2488. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2489. BEGIN
  2490. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2491. UseIntermediateOperand(result);
  2492. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2493. END;
  2494. END Reuse1;
  2495. (* like reuse2a but only one source *)
  2496. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2497. BEGIN
  2498. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2499. UseIntermediateOperand(result);
  2500. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2501. UseIntermediateOperand(result);
  2502. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2503. END;
  2504. END Reuse1a;
  2505. (* like reuse1 but guarantees that content of src1 is in result *)
  2506. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2507. BEGIN
  2508. IF ReusableRegister(src1) THEN
  2509. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2510. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2511. UseIntermediateOperand(result);
  2512. ELSE
  2513. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2514. Emit(Mov(position,result,src1));
  2515. END
  2516. END ReuseCopy;
  2517. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2518. BEGIN
  2519. IF ReusableRegister(src) THEN
  2520. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2521. ELSE
  2522. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2523. Emit(Mov(position,result,src));
  2524. ReleaseIntermediateOperand(src);
  2525. END
  2526. END TransferToRegister;
  2527. (** labels and branches **)
  2528. PROCEDURE NewLabel(): Label;
  2529. VAR label: Label;
  2530. BEGIN
  2531. NEW(label,section); RETURN label;
  2532. END NewLabel;
  2533. (* EXPERIMENTAL *)
  2534. PROCEDURE EndBasicBlock;
  2535. VAR i: LONGINT;
  2536. BEGIN
  2537. i := 0;
  2538. WHILE (availableSymbols[i].symbol # NIL) DO
  2539. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2540. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2541. END;
  2542. availableSymbols[i].symbol := NIL;
  2543. INC(i);
  2544. END;
  2545. END EndBasicBlock;
  2546. (* EXPERIMENTAL *)
  2547. PROCEDURE BeginBasicBlock;
  2548. BEGIN
  2549. ASSERT(availableSymbols[0].symbol = NIL);
  2550. END BeginBasicBlock;
  2551. PROCEDURE SetLabel(label: Label);
  2552. BEGIN
  2553. (* EXPERIMENTAL *)
  2554. EndBasicBlock;
  2555. BeginBasicBlock;
  2556. label.Resolve(section.pc);
  2557. END SetLabel;
  2558. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2559. BEGIN
  2560. ASSERT(label # NIL);
  2561. IF label.pc < 0 THEN (* label not yet set *)
  2562. label.AddFixup(section.pc);
  2563. END;
  2564. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2565. END LabelOperand;
  2566. PROCEDURE BrL(label: Label);
  2567. BEGIN
  2568. (* EXPERIMENTAL *)
  2569. EndBasicBlock;
  2570. Emit(Br(position,LabelOperand(label)));
  2571. END BrL;
  2572. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2573. BEGIN
  2574. Emit(Brge(position,LabelOperand(label),left,right));
  2575. END BrgeL;
  2576. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2577. BEGIN
  2578. Emit(Brlt(position,LabelOperand(label),left,right));
  2579. END BrltL;
  2580. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2581. BEGIN
  2582. Emit(Breq(position,LabelOperand(label),left,right));
  2583. END BreqL;
  2584. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2585. BEGIN
  2586. Emit(Brne(position,LabelOperand(label),left,right));
  2587. END BrneL;
  2588. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2589. VAR new: IntermediateCode.Operand;
  2590. BEGIN
  2591. IF Trace THEN TraceEnter("Convert") END;
  2592. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2593. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2594. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2595. & (operand.offset = 0)
  2596. THEN
  2597. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2598. Emit(Conv(position,new,operand));
  2599. ELSE
  2600. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2601. Emit(Conv(position,new,operand));
  2602. ReleaseIntermediateOperand(operand);
  2603. END;
  2604. operand := new;
  2605. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  2606. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2607. ELSE
  2608. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2609. Emit(Conv(position,new,operand));
  2610. ReleaseIntermediateOperand(operand);
  2611. operand := new;
  2612. END;
  2613. IF Trace THEN TraceExit("Convert") END;
  2614. END Convert;
  2615. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2616. VAR exit: Label;
  2617. BEGIN
  2618. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2619. exit := NewLabel();
  2620. br(exit,left,right);
  2621. EmitTrap(position,trapNo);
  2622. SetLabel(exit);
  2623. END TrapC;
  2624. (** expressions *)
  2625. (** emit necessary runtime check for set elements **)
  2626. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2627. VAR max: IntermediateCode.Operand;
  2628. BEGIN
  2629. IF isUnchecked THEN RETURN END;
  2630. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2631. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2632. TrapC(BrgeL, max, o, SetElementTrap);
  2633. END;
  2634. END CheckSetElement;
  2635. (** the set that a range represents **)
  2636. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2637. VAR
  2638. operand: Operand;
  2639. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2640. BEGIN
  2641. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2642. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2643. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2644. one := IntermediateCode.Immediate(setType, 1);
  2645. Evaluate(x, operand);
  2646. Convert(operand.op, setType);
  2647. Convert(operand.tag, setType);
  2648. CheckSetElement(operand.op);
  2649. CheckSetElement(operand.tag);
  2650. (* create mask for lower bound
  2651. i.e. shift 11111111 to the left by the value of the lower bound
  2652. *)
  2653. Reuse1(temp, operand.op);
  2654. Emit(Shl(position,temp, allBits, operand.op));
  2655. ReleaseIntermediateOperand(operand.op);
  2656. operand.op := temp;
  2657. (* create mask for upper bound
  2658. i.e. shift 11111111 to the right by the difference between the
  2659. upper bound and the maximum number of set elements
  2660. *)
  2661. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2662. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2663. Reuse1(temp, operand.tag);
  2664. ELSE
  2665. Reuse1(temp, operand.tag);
  2666. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2667. Emit(Sub(position,temp, size, operand.tag));
  2668. END;
  2669. Emit(Shr(position,temp, allBits, operand.tag));
  2670. ReleaseIntermediateOperand(operand.tag);
  2671. operand.tag := temp;
  2672. Reuse2(resultingSet, operand.op, operand.tag);
  2673. (* intersect the two masks *)
  2674. Emit(And(position,resultingSet, operand.op, operand.tag));
  2675. ReleaseOperand(operand);
  2676. RETURN resultingSet
  2677. END SetFromRange;
  2678. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2679. VAR
  2680. res, operand: Operand;
  2681. temp, one, noBits, dest: IntermediateCode.Operand;
  2682. expression: SyntaxTree.Expression;
  2683. i: LONGINT;
  2684. BEGIN
  2685. IF Trace THEN TraceEnter("VisitSet") END;
  2686. dest := destination;
  2687. destination := emptyOperand;
  2688. noBits := IntermediateCode.Immediate(setType, 0);
  2689. one := IntermediateCode.Immediate(setType, 1);
  2690. (* start off with the empty set *)
  2691. InitOperand(res, ModeValue);
  2692. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2693. Emit(Mov(position,res.op, noBits));
  2694. FOR i := 0 TO x.elements.Length() - 1 DO
  2695. expression := x.elements.GetExpression(i);
  2696. IF expression IS SyntaxTree.RangeExpression THEN
  2697. (* range of set elements *)
  2698. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2699. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2700. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2701. ReleaseIntermediateOperand(temp)
  2702. ELSE
  2703. (* singelton element *)
  2704. Evaluate(expression, operand);
  2705. Convert(operand.op, setType);
  2706. CheckSetElement(operand.op);
  2707. (* create subset containing single element *)
  2708. Reuse1(temp, operand.op);
  2709. Emit(Shl(position,temp, one, operand.op));
  2710. ReleaseOperand(operand);
  2711. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2712. ReleaseIntermediateOperand(temp);
  2713. END
  2714. END;
  2715. result := res;
  2716. destination := dest;
  2717. IF Trace THEN TraceExit("VisitSet") END;
  2718. END VisitSet;
  2719. (* math arrays of the form [a,b,c]
  2720. x is a static array and thus does not provide any pointers
  2721. *)
  2722. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2723. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2724. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2725. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2726. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2727. element: SyntaxTree.IntegerValue;
  2728. BEGIN
  2729. numberElements := x.elements.Length();
  2730. expression := index.parameters.GetExpression(dim);
  2731. element := expression(SyntaxTree.IntegerValue);
  2732. FOR i := 0 TO numberElements-1 DO
  2733. expression := x.elements.GetExpression(i);
  2734. element.SetValue(i);
  2735. IF expression IS SyntaxTree.MathArrayExpression THEN
  2736. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2737. ELSE
  2738. Assign(index,expression);
  2739. END;
  2740. END;
  2741. END RecursiveAssignment;
  2742. PROCEDURE Dimension(): LONGINT;
  2743. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2744. BEGIN
  2745. dim := 0;
  2746. expression := x;
  2747. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2748. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2749. INC(dim);
  2750. END;
  2751. RETURN dim;
  2752. END Dimension;
  2753. BEGIN
  2754. (*static math array not providing pointers anyway *)
  2755. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2756. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2757. designator.SetType(variable.type);
  2758. dim := Dimension();
  2759. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2760. FOR i := 0 TO dim-1 DO
  2761. element := SyntaxTree.NewIntegerValue(x.position,0);
  2762. element.SetType(system.longintType);
  2763. index.parameters.AddExpression(element);
  2764. END;
  2765. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2766. RecursiveAssignment(x,0);
  2767. Expression(designator);
  2768. END VisitMathArrayExpression;
  2769. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2770. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2771. BEGIN
  2772. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2773. dest := destination; destination := emptyOperand;
  2774. IF x.operator = Scanner.Not THEN
  2775. Evaluate(x.left,operand);
  2776. InitOperand(result,ModeValue);
  2777. Reuse1a(result.op,operand.op,dest);
  2778. Emit(Xor(position,result.op,operand.op,true));
  2779. ReleaseOperand(operand);
  2780. ELSIF x.operator = Scanner.Minus THEN
  2781. Evaluate(x.left,operand);
  2782. InitOperand(result,ModeValue);
  2783. Reuse1a(result.op,operand.op,dest);
  2784. type := x.left.type.resolved;
  2785. IF type IS SyntaxTree.SetType THEN
  2786. Emit(Not(position,result.op,operand.op));
  2787. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2788. Reuse1(result.tag,operand.tag);
  2789. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2790. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2791. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2792. Emit(Neg(position,result.op,operand.op));
  2793. ELSE HALT(200)
  2794. END;
  2795. ReleaseOperand(operand);
  2796. ELSIF x.operator = Scanner.Address THEN
  2797. Designate(x.left,operand);
  2798. operand.mode := ModeValue;
  2799. t0 := x.left.type.resolved;
  2800. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2801. ReleaseIntermediateOperand(operand.op);
  2802. operand.op := operand.tag;
  2803. IntermediateCode.InitOperand(operand.tag);
  2804. END;
  2805. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2806. result := operand;
  2807. ELSE HALT(100)
  2808. END;
  2809. destination := dest;
  2810. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2811. END VisitUnaryExpression;
  2812. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2813. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2814. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2815. BEGIN
  2816. type := type.resolved;
  2817. originalType := type;
  2818. IF type IS SyntaxTree.PointerType THEN
  2819. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2820. END;
  2821. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2822. BrL(label);
  2823. ELSE
  2824. ASSERT(type IS SyntaxTree.RecordType);
  2825. (*
  2826. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2827. *)
  2828. IF withPart THEN
  2829. left := tag;
  2830. ELSE
  2831. ReuseCopy(left,tag);
  2832. END;
  2833. right := TypeDescriptorAdr(type);
  2834. IF backend.cooperative THEN
  2835. repeatL := NewLabel();
  2836. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2837. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2838. END;
  2839. SetLabel(repeatL);
  2840. IF reason THEN
  2841. BreqL(label,left,right);
  2842. ELSE
  2843. skip := NewLabel();
  2844. BreqL(skip,left,right);
  2845. END;
  2846. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2847. BrneL(repeatL,left,nil);
  2848. IF ~reason THEN
  2849. BrL(label);
  2850. SetLabel(skip);
  2851. END;
  2852. ELSIF meta.simple THEN
  2853. level := type(SyntaxTree.RecordType).Level();
  2854. (* get type desc tag of level relative to base tag *)
  2855. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2856. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2857. IntermediateCode.MakeMemory(left,addressType);
  2858. IF reason THEN
  2859. BreqL(label,left,right);
  2860. ELSE
  2861. BrneL(label,left,right);
  2862. END;
  2863. ELSE
  2864. level := type(SyntaxTree.RecordType).Level();
  2865. (* get type desc tag of level relative to base tag *)
  2866. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2867. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2868. IntermediateCode.MakeMemory(left,addressType);
  2869. IF reason THEN
  2870. BreqL(label,left,right);
  2871. ELSE
  2872. BrneL(label,left,right);
  2873. END;
  2874. END;
  2875. IF ~withPart THEN
  2876. ReleaseIntermediateOperand(left);
  2877. END;
  2878. ReleaseIntermediateOperand(right);
  2879. END;
  2880. END TypeTest;
  2881. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2882. BEGIN
  2883. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2884. IF dump # NIL THEN
  2885. dump.String(s); dump.Ln;
  2886. END;
  2887. END Error;
  2888. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2889. BEGIN
  2890. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2891. IF dump # NIL THEN
  2892. dump.String(s); dump.Ln; dump.Update;
  2893. END;
  2894. END Warning;
  2895. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2896. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2897. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2898. operand:Operand;
  2899. BEGIN
  2900. previousSection := section;
  2901. Global.GetModuleName(mod,name);
  2902. Strings.Append(name,".@Trace");
  2903. Basic.ToSegmentedName(name, pooledName);
  2904. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2905. IF dump # NIL THEN dump := section.comments END;
  2906. IF backend.hasLinkRegister THEN
  2907. Emit(Push(Basic.invalidPosition, lr));
  2908. END;
  2909. variable := mod.moduleScope.firstVariable;
  2910. WHILE variable # NIL DO
  2911. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2912. Symbol(variable, operand);
  2913. register := operand.op;
  2914. CallTraceMethod(register, variable.type);
  2915. ReleaseIntermediateOperand(register);
  2916. END;
  2917. variable := variable.nextVariable;
  2918. END;
  2919. IF backend.hasLinkRegister THEN
  2920. Emit(Pop(Basic.invalidPosition, lr));
  2921. END;
  2922. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2923. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2924. Emit(Br(position,op));
  2925. INC(statCoopTraceModule, section.pc);
  2926. section := previousSection;
  2927. IF dump # NIL THEN dump := section.comments END;
  2928. END CreateTraceModuleMethod;
  2929. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2930. BEGIN
  2931. Emit (Push(position, dst));
  2932. Emit (Push(position, src));
  2933. CallThis(position,"GarbageCollector","Assign", 2);
  2934. END CallAssignPointer;
  2935. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2936. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2937. BEGIN
  2938. IF SemanticChecker.IsPointerType (type) THEN
  2939. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2940. ELSIF type.IsRecordType() THEN
  2941. Emit (Push(position,dst));
  2942. Emit (Push(position,src));
  2943. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2944. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2945. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2946. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2947. ELSIF IsStaticArray(type) THEN
  2948. size := StaticArrayNumElements(type);
  2949. base := StaticArrayBaseType(type);
  2950. IF base.IsRecordType() THEN
  2951. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2952. Emit (Push(position, dst));
  2953. Emit (Push(position, src));
  2954. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2955. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2956. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2957. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2958. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2959. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2960. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2961. Emit (Push(position, dst));
  2962. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2963. Emit (Push(position, src));
  2964. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2965. ELSE
  2966. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2967. Emit (Push(position, dst));
  2968. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2969. Emit (Push(position, src));
  2970. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2971. ASSERT(StaticArrayBaseType(type).IsPointer());
  2972. END;
  2973. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2974. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2975. Emit (Push(position, dst));
  2976. Emit (Push(position, src));
  2977. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2978. ELSE HALT(100); (* missing ? *)
  2979. END;
  2980. END CallAssignMethod;
  2981. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2982. VAR name: Basic.SegmentedName;
  2983. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2984. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2985. context: Context;
  2986. BEGIN
  2987. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2988. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2989. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2990. GetRecordTypeName (recordType,name);
  2991. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2992. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2993. section.SetExported (TRUE);
  2994. IF dump # NIL THEN dump := section.comments END;
  2995. IF backend.hasLinkRegister THEN
  2996. Emit(Push(Basic.invalidPosition, lr));
  2997. END;
  2998. variable := recordType.recordScope.firstVariable;
  2999. WHILE variable # NIL DO
  3000. IF variable.NeedsTrace() THEN
  3001. dst := NewRegisterOperand (addressType);
  3002. src := NewRegisterOperand (addressType);
  3003. Emit (Mov(position, dst, parameter1));
  3004. Emit (Mov(position, src, parameter2));
  3005. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3006. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  3007. CallAssignMethod(dst, src, variable.type);
  3008. ReleaseIntermediateOperand(src);
  3009. ReleaseIntermediateOperand(dst);
  3010. END;
  3011. variable := variable.nextVariable;
  3012. END;
  3013. recordBase := recordType.GetBaseRecord();
  3014. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3015. IF backend.hasLinkRegister THEN
  3016. Emit(Pop(Basic.invalidPosition, lr));
  3017. END;
  3018. GetRecordTypeName (recordBase,name);
  3019. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3020. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3021. Emit(Br(position,op));
  3022. ELSE
  3023. Emit(Exit(position,0,0, 0));
  3024. END;
  3025. IF ~recordType.isObject THEN
  3026. GetRecordTypeName (recordType,name);
  3027. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3028. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3029. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3030. section.SetExported (TRUE);
  3031. NEW(registerUsageCount);
  3032. usedRegisters := NIL;
  3033. dst := NewRegisterOperand (addressType);
  3034. src := NewRegisterOperand (addressType);
  3035. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3036. Emit(Mov(position, dst, parameter1));
  3037. Emit(Mov(position, src, parameter2));
  3038. label := NewLabel();
  3039. SetLabel(label);
  3040. Emit(Push(position, dst));
  3041. Emit(Push(position, src));
  3042. GetRecordTypeName (recordType,name);
  3043. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3044. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3045. Emit(Call(position, op, 0));
  3046. Emit(Pop(position, src));
  3047. Emit(Pop(position, dst));
  3048. Emit(Add(position, dst, dst, ofs));
  3049. Emit(Add(position, src, src, ofs));
  3050. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3051. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3052. Emit(Exit(position,0,0, 0));
  3053. END;
  3054. INC(statCoopAssignProcedure, section.pc);
  3055. ReturnToContext(context);
  3056. IF dump # NIL THEN dump := section.comments END;
  3057. END CreateAssignProcedure;
  3058. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  3059. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  3060. BEGIN
  3061. IF IsUnsafePointer (type) THEN
  3062. skip := NewLabel();
  3063. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  3064. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  3065. BreqL (skip, op, nil);
  3066. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  3067. SetLabel (skip);
  3068. ELSIF SemanticChecker.IsPointerType (type) THEN
  3069. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  3070. CallThis(position,"GarbageCollector","Mark", 1);
  3071. ELSIF type.IsRecordType() THEN
  3072. Emit (Push(position,register));
  3073. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3074. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3075. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3076. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3077. ELSIF IsStaticArray(type) THEN
  3078. size := StaticArrayNumElements(type);
  3079. base := StaticArrayBaseType(type);
  3080. IF base.IsRecordType() THEN
  3081. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3082. Emit (Push(position, register));
  3083. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  3084. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3085. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3086. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3087. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  3088. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3089. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3090. Emit (Push(position, register));
  3091. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  3092. ELSE
  3093. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3094. Emit (Push(position, register));
  3095. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  3096. ASSERT(base.IsPointer());
  3097. END;
  3098. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3099. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  3100. CallThis(position,"GarbageCollector","Mark", 1);
  3101. ELSE HALT(100); (* missing ? *)
  3102. END;
  3103. END CallTraceMethod;
  3104. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  3105. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  3106. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3107. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  3108. BEGIN
  3109. previousSection := section;
  3110. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3111. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3112. GetRecordTypeName (recordType,name);
  3113. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3114. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3115. section.SetExported (TRUE);
  3116. IF dump # NIL THEN dump := section.comments END;
  3117. IF backend.hasLinkRegister THEN
  3118. Emit(Push(Basic.invalidPosition, lr));
  3119. END;
  3120. variable := recordType.recordScope.firstVariable;
  3121. WHILE variable # NIL DO
  3122. IF variable.NeedsTrace() THEN
  3123. register := NewRegisterOperand (addressType);
  3124. Emit (Mov(position,register,parameter1));
  3125. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  3126. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3127. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3128. END;
  3129. CallTraceMethod(register, variable.type);
  3130. ReleaseIntermediateOperand(register);
  3131. END;
  3132. variable := variable.nextVariable;
  3133. END;
  3134. recordBase := recordType.GetBaseRecord();
  3135. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  3136. recordBase := recordBase.GetBaseRecord();
  3137. END;
  3138. IF recordBase # NIL THEN
  3139. IF backend.hasLinkRegister THEN
  3140. Emit(Pop(Basic.invalidPosition, lr));
  3141. END;
  3142. GetRecordTypeName (recordBase,name);
  3143. IF HasExplicitTraceMethod (recordBase) THEN
  3144. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  3145. ELSE
  3146. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3147. END;
  3148. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3149. Emit(Br(position,op));
  3150. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  3151. Emit(Exit(position,0,0,0));
  3152. ELSE
  3153. IF backend.hasLinkRegister THEN
  3154. Emit(Pop(Basic.invalidPosition, lr));
  3155. END;
  3156. IF recordType.isObject THEN
  3157. Basic.ToSegmentedName ("BaseTypes.Object",name);
  3158. ELSE
  3159. Basic.ToSegmentedName ("BaseTypes.Record",name);
  3160. END;
  3161. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3162. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3163. Emit(Br(position,op));
  3164. END;
  3165. IF ~recordType.isObject THEN
  3166. GetRecordTypeName (recordType,name);
  3167. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  3168. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3169. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3170. section.SetExported (TRUE);
  3171. NEW(registerUsageCount);
  3172. usedRegisters := NIL;
  3173. IF dump # NIL THEN dump := section.comments END;
  3174. register := NewRegisterOperand (addressType);
  3175. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  3176. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  3177. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3178. END;
  3179. Emit (Push(position,register));
  3180. GetRecordTypeName (recordType,name);
  3181. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3182. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3183. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3184. ReleaseIntermediateOperand(register);
  3185. Emit(Exit(position,0,0,0));
  3186. GetRecordTypeName (recordType,name);
  3187. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3188. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3189. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3190. section.SetExported (TRUE);
  3191. NEW(registerUsageCount);
  3192. usedRegisters := NIL;
  3193. register := NewRegisterOperand (addressType);
  3194. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3195. Emit(Mov(position, register, parameter1));
  3196. label := NewLabel();
  3197. SetLabel(label);
  3198. Emit(Push(position, register));
  3199. GetRecordTypeName (recordType,name);
  3200. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3201. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3202. Emit(Call(position, op, 0));
  3203. Emit(Pop(position, register));
  3204. Emit(Add(position, register, register, ofs));
  3205. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3206. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3207. Emit(Exit(position,0,0,0));
  3208. END;
  3209. INC(statCoopTraceMethod, section.pc);
  3210. ReturnToContext(context);
  3211. IF dump # NIL THEN dump := section.comments END;
  3212. END CreateTraceMethod;
  3213. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  3214. VAR name: Basic.SegmentedName;
  3215. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3216. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  3217. context: Context;
  3218. BEGIN
  3219. IF recordType.isObject THEN RETURN END;
  3220. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3221. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3222. GetRecordTypeName (recordType,name);
  3223. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3224. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3225. section.SetExported (TRUE);
  3226. IF dump # NIL THEN dump := section.comments END;
  3227. IF backend.hasLinkRegister THEN
  3228. Emit(Push(Basic.invalidPosition, lr));
  3229. END;
  3230. variable := recordType.recordScope.firstVariable;
  3231. WHILE variable # NIL DO
  3232. IF variable.NeedsTrace() THEN
  3233. dst := NewRegisterOperand (addressType);
  3234. Emit (Mov(position, dst, parameter1));
  3235. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3236. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3237. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3238. END;
  3239. CallResetProcedure(dst, nil, variable.type);
  3240. ReleaseIntermediateOperand(dst);
  3241. END;
  3242. variable := variable.nextVariable;
  3243. END;
  3244. recordBase := recordType.GetBaseRecord();
  3245. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3246. IF backend.hasLinkRegister THEN
  3247. Emit(Pop(Basic.invalidPosition, lr));
  3248. END;
  3249. GetRecordTypeName (recordBase,name);
  3250. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3251. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3252. Emit(Br(position,op));
  3253. ELSE
  3254. Emit(Exit(position,0,0, 0));
  3255. END;
  3256. GetRecordTypeName (recordType,name);
  3257. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3258. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3259. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3260. section.SetExported (TRUE);
  3261. NEW(registerUsageCount);
  3262. usedRegisters := NIL;
  3263. dst := NewRegisterOperand (addressType);
  3264. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3265. Emit(Mov(position, dst, parameter1));
  3266. label := NewLabel();
  3267. SetLabel(label);
  3268. Emit(Push(position, dst));
  3269. GetRecordTypeName (recordType,name);
  3270. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3271. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3272. Emit(Call(position, op, 0));
  3273. Emit(Pop(position, dst));
  3274. Emit(Add(position, dst, dst, ofs));
  3275. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3276. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3277. Emit(Exit(position,0,0, 0));
  3278. INC(statCoopResetProcedure, section.pc);
  3279. ReturnToContext(context);
  3280. IF dump # NIL THEN dump := section.comments END;
  3281. END CreateResetProcedure;
  3282. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  3283. VAR name: Basic.SegmentedName; context: Context;
  3284. BEGIN
  3285. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  3286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3287. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3288. IF dump # NIL THEN dump := section.comments END;
  3289. IF backend.hasLinkRegister THEN
  3290. Emit(Push(Basic.invalidPosition, lr));
  3291. END;
  3292. Emit(Push(position,fp));
  3293. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  3294. ResetVariables(scope);
  3295. Emit(Pop(position,fp));
  3296. Emit(Exit(position,0,0, 0));
  3297. ReturnToContext(context);
  3298. IF dump # NIL THEN dump := section.comments END;
  3299. END CreateResetMethod;
  3300. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  3301. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  3302. BEGIN
  3303. IF SemanticChecker.IsPointerType (type) THEN
  3304. Emit (Push(position, dest));
  3305. CallThis(position,"GarbageCollector","Reset", 1);
  3306. ELSIF type.IsRecordType() THEN
  3307. Emit (Push(position, dest));
  3308. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3309. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3310. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3311. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3312. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  3313. size := GetArrayLength(type, tag);
  3314. base := ArrayBaseType(type);
  3315. IF base.IsRecordType() THEN
  3316. Emit (Push(position, size));
  3317. Emit (Push(position, dest));
  3318. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  3319. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3320. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3321. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3322. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  3323. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3324. Emit (Push(position, size));
  3325. Emit (Push(position, dest));
  3326. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  3327. ELSE
  3328. Emit (Push(position, size));
  3329. Emit (Push(position, dest));
  3330. CallThis(position,"GarbageCollector","ResetArray", 2);
  3331. ASSERT(ArrayBaseType(type).IsPointer());
  3332. END;
  3333. ReleaseIntermediateOperand(size);
  3334. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3335. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  3336. Emit (Push(position, dest));
  3337. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  3338. ELSE HALT(100); (* missing ? *)
  3339. END;
  3340. END CallResetProcedure;
  3341. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  3342. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  3343. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  3344. VAR operand: Operand;
  3345. BEGIN
  3346. Symbol (symbol, operand);
  3347. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  3348. ReleaseOperand(operand);
  3349. END Reset;
  3350. BEGIN
  3351. previousScope := currentScope;
  3352. currentScope := scope;
  3353. pc := section.pc;
  3354. prevOffset := MAX(SIZE);
  3355. variable := scope.firstVariable;
  3356. WHILE variable # NIL DO
  3357. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3358. Reset (variable);
  3359. prevOffset := variable.offsetInBits;
  3360. END;
  3361. variable := variable.nextVariable;
  3362. END;
  3363. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3364. WHILE parameter # NIL DO
  3365. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  3366. Reset (parameter);
  3367. END;
  3368. parameter := parameter.nextParameter;
  3369. END;
  3370. INC(statCoopResetVariables, section.pc - pc);
  3371. currentScope := previousScope;
  3372. END ResetVariables;
  3373. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  3374. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  3375. BEGIN
  3376. type := symbol.type.resolved;
  3377. SaveRegisters();ReleaseUsedRegisters(saved);
  3378. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  3379. Symbol(symbol, operand);
  3380. ToMemory(operand.op,addressType,0);
  3381. Emit(Push(position,operand.op));
  3382. IF refer THEN
  3383. CallThis(position,"Heaps","Refer",1);
  3384. ELSE
  3385. CallThis(position,"Heaps","Reset",1);
  3386. END;
  3387. ELSIF type.IsRecordType() THEN
  3388. Symbol(symbol, operand);
  3389. Emit(Push(position,operand.op));
  3390. Emit(Push(position,operand.tag)); (* type desc *)
  3391. IF refer THEN
  3392. CallThis(position,"Heaps","ReferRecord",2);
  3393. ELSE
  3394. CallThis(position,"Heaps","ResetRecord",2);
  3395. END;
  3396. ELSIF IsStaticArray(type) THEN
  3397. size := StaticArrayNumElements(type);
  3398. base := StaticArrayBaseType(type);
  3399. Symbol(symbol, operand);
  3400. arg := TypeDescriptorAdr(base);
  3401. Emit(Push(position,operand.op));
  3402. Emit(Push(position,arg));
  3403. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3404. ReleaseIntermediateOperand(arg);
  3405. IF refer THEN
  3406. CallThis(position,"Heaps","ReferArray",3);
  3407. ELSE
  3408. CallThis(position,"Heaps","ResetArray",3);
  3409. END;
  3410. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  3411. size := StaticMathArrayNumElements(type);
  3412. base := StaticMathArrayBaseType(type);
  3413. Symbol(symbol, operand);
  3414. arg := TypeDescriptorAdr(base);
  3415. Emit(Push(position,operand.op));
  3416. Emit(Push(position,arg));
  3417. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3418. ReleaseIntermediateOperand(arg);
  3419. IF refer THEN
  3420. CallThis(position,"Heaps","ReferArray",3);
  3421. ELSE
  3422. CallThis(position,"Heaps","ResetArray",3);
  3423. END;
  3424. ELSIF type IS SyntaxTree.MathArrayType THEN
  3425. Symbol(symbol, operand);
  3426. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3427. Emit (Push(position, operand.op));
  3428. ELSE
  3429. Emit (Push(position, operand.tag));
  3430. END;
  3431. IF refer THEN
  3432. CallThis(position,"Heaps","ReferMathArray", 1);
  3433. ELSE
  3434. CallThis(position,"Heaps","ResetMathArray", 1);
  3435. END;
  3436. ELSIF type IS SyntaxTree.ProcedureType THEN
  3437. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  3438. Symbol(symbol, operand);
  3439. Emit (Push(position, operand.tag));
  3440. IF refer THEN
  3441. CallThis(position,"Heaps","Refer", 1);
  3442. ELSE
  3443. CallThis(position,"Heaps","Reset", 1);
  3444. END;
  3445. ELSE HALT(100); (* missing ? *)
  3446. END;
  3447. ReleaseOperand(operand);
  3448. RestoreRegisters(saved);
  3449. END Reset;
  3450. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  3451. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  3452. BEGIN
  3453. previousScope := currentScope;
  3454. currentScope := scope;
  3455. pc := section.pc;
  3456. IF ~ refer THEN
  3457. variable := scope.firstVariable;
  3458. prevOffset := MAX(SIZE);
  3459. WHILE variable # NIL DO
  3460. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3461. Reset (variable,refer);
  3462. prevOffset := variable.offsetInBits;
  3463. END;
  3464. variable := variable.nextVariable;
  3465. END;
  3466. END;
  3467. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3468. WHILE parameter # NIL DO
  3469. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  3470. Reset (parameter,refer);
  3471. END;
  3472. parameter := parameter.nextParameter;
  3473. END;
  3474. INC(statCoopResetVariables, section.pc - pc);
  3475. currentScope := previousScope;
  3476. END ResetVariables2;
  3477. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  3478. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  3479. VAR op: IntermediateCode.Operand; context: Context;
  3480. BEGIN
  3481. previousSection := section;
  3482. GetCodeSectionNameForSymbol(procedure, name);
  3483. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3484. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3485. IF dump # NIL THEN dump := section.comments END;
  3486. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3487. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3488. Emit(Data(position,op));
  3489. Emit(Data(position,nil));
  3490. IF HasPointers (procedure.procedureScope) THEN
  3491. GetCodeSectionNameForSymbol(procedure, name);
  3492. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3493. ELSE
  3494. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3495. END;
  3496. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3497. Emit(Data(position,op));
  3498. ReturnToContext(context);
  3499. IF dump # NIL THEN dump := section.comments END;
  3500. END CreateProcedureDescriptor;
  3501. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3502. VAR import: SyntaxTree.Import;
  3503. s: Basic.MessageString;
  3504. selfName: SyntaxTree.IdentifierString;
  3505. BEGIN
  3506. moduleScope.ownerModule.GetName(selfName);
  3507. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3508. module := moduleScope.ownerModule
  3509. ELSE
  3510. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3511. IF import = NIL THEN
  3512. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3513. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3514. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3515. s := "Module ";
  3516. Strings.Append(s,moduleName);
  3517. Strings.Append(s," cannot be imported.");
  3518. IF force THEN
  3519. Error(position,s);
  3520. ELSIF canBeLoaded THEN
  3521. IF WarningDynamicLoading THEN
  3522. Strings.Append(s, "=> no dynamic linking.");
  3523. Warning(position, s);
  3524. END;
  3525. canBeLoaded := FALSE;
  3526. END;
  3527. RETURN FALSE
  3528. ELSE
  3529. SELF.module.imports.AddName(moduleName)
  3530. END;
  3531. ELSIF import.module = NIL THEN (* already tried *)
  3532. RETURN FALSE
  3533. END;
  3534. module := import.module;
  3535. END;
  3536. RETURN TRUE
  3537. END AddImport;
  3538. (* needed for old binary object file format*)
  3539. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3540. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  3541. BEGIN
  3542. IF AddImport(moduleName,module,TRUE) THEN
  3543. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3544. IF procedure = NIL THEN
  3545. s := "Instruction not supported on target, emulation procedure ";
  3546. Strings.Append(s,moduleName);
  3547. Strings.Append(s,".");
  3548. Strings.Append(s,procedureName);
  3549. Strings.Append(s," not present");
  3550. Error(position,s);
  3551. ELSE
  3552. StaticCallOperand(r,procedure);
  3553. ReleaseOperand(r);
  3554. fp := GetFingerprint(procedure);
  3555. END;
  3556. END;
  3557. END EnsureSymbol;
  3558. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3559. VAR trueL, exitL: Label; op: Operand;
  3560. BEGIN
  3561. InitOperand(op,ModeValue);
  3562. trueL := NewLabel();
  3563. exitL := NewLabel();
  3564. Condition(x,trueL,TRUE);
  3565. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3566. Emit(Mov(position,op.op,false));
  3567. BrL(exitL);
  3568. SetLabel(trueL);
  3569. Emit(MovReplace(position,op.op,true));
  3570. SetLabel(exitL);
  3571. RETURN op;
  3572. END ConditionValue;
  3573. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3574. VAR size: LONGINT;
  3575. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3576. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3577. BEGIN
  3578. ASSERT(type.form = SyntaxTree.Open);
  3579. baseType := type.arrayBase.resolved;
  3580. IF IsOpenArray(baseType) THEN
  3581. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3582. ELSE
  3583. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3584. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3585. END;
  3586. len := tag;
  3587. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3588. IntermediateCode.MakeMemory(len,addressType);
  3589. UseIntermediateOperand(len);
  3590. Reuse2(res,sizeOperand,len);
  3591. Emit(Mul(position,res,sizeOperand,len));
  3592. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3593. RETURN res
  3594. END GetArraySize;
  3595. BEGIN
  3596. type := type.resolved;
  3597. IF IsOpenArray(type) THEN
  3598. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3599. RETURN tag
  3600. ELSE
  3601. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3602. END;
  3603. ELSE
  3604. size := ToMemoryUnits(system,system.SizeOf(type));
  3605. RETURN IntermediateCode.Immediate(addressType,size)
  3606. END;
  3607. END GetDynamicSize;
  3608. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3609. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3610. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3611. BEGIN
  3612. ASSERT(type.form = SyntaxTree.Open);
  3613. baseType := type.arrayBase.resolved;
  3614. IF IsOpenArray(baseType) THEN
  3615. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3616. ELSE
  3617. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3618. END;
  3619. len := tag;
  3620. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3621. IntermediateCode.MakeMemory(len,addressType);
  3622. UseIntermediateOperand(len);
  3623. Reuse2(res,sizeOperand,len);
  3624. Emit(Mul(position,res,sizeOperand,len));
  3625. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3626. RETURN res
  3627. END GetLength;
  3628. BEGIN
  3629. type := type.resolved;
  3630. IF IsOpenArray(type) THEN
  3631. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3632. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3633. ELSIF type IS SyntaxTree.StringType THEN
  3634. RETURN tag;
  3635. ELSE
  3636. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3637. END;
  3638. END GetArrayLength;
  3639. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3640. VAR result: IntermediateCode.Operand;
  3641. BEGIN
  3642. IF backend.cooperative THEN
  3643. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3644. ELSE
  3645. MakeMemory(result, tag, addressType, 0);
  3646. END;
  3647. RETURN result
  3648. END GetSizeFromTag;
  3649. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3650. VAR parameter: SyntaxTree.Parameter;
  3651. BEGIN
  3652. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3653. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3654. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3655. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3656. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3657. END;
  3658. RETURN GetDynamicSize(e.type, tag);
  3659. END GetArrayOfBytesSize;
  3660. (*
  3661. to find imported symbol. not needed ?
  3662. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3663. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3664. BEGIN
  3665. IF AddImport(moduleName,importedModule,FALSE) THEN
  3666. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3667. RETURN symbol
  3668. ELSE
  3669. RETURN NIL
  3670. END
  3671. END SymbolByName;
  3672. *)
  3673. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3674. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3675. BEGIN
  3676. IF AddImport(moduleName,runtimeModule,force) THEN
  3677. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3678. IF procedure = NIL THEN
  3679. s := "Procedure ";
  3680. Strings.Append(s,moduleName);
  3681. Strings.Append(s,".");
  3682. Strings.Append(s,procedureName);
  3683. Strings.Append(s," not present");
  3684. Error(position,s);
  3685. RETURN FALSE
  3686. ELSE
  3687. RETURN TRUE
  3688. END;
  3689. ELSE RETURN FALSE
  3690. END;
  3691. END GetRuntimeProcedure;
  3692. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3693. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3694. s: Basic.MessageString;
  3695. BEGIN
  3696. Basic.InitSegmentedName(name);
  3697. name[0] := Basic.MakeString(moduleName);
  3698. name[1] := Basic.MakeString(typeName);
  3699. name[2] := -1;
  3700. IF AddImport(moduleName,importedModule, FALSE) THEN
  3701. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3702. IF symbol = NIL THEN
  3703. s := "type ";
  3704. Strings.Append(s,moduleName);
  3705. Strings.Append(s,".");
  3706. Strings.Append(s,typeName);
  3707. Strings.Append(s," not present");
  3708. Error(position,s);
  3709. END;
  3710. ELSE symbol := NIL;
  3711. END;
  3712. IF importedModule = moduleScope.ownerModule THEN
  3713. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3714. ELSE
  3715. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3716. END;
  3717. RETURN symbol
  3718. END GetTypeDescriptor;
  3719. (* 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. *)
  3720. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3721. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3722. pooledName: Basic.SegmentedName; size: LONGINT;
  3723. BEGIN
  3724. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3725. StaticCallOperand(result,procedure);
  3726. IF numberParameters < 0 THEN
  3727. size := ProcParametersSize(procedure);
  3728. ELSE
  3729. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3730. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3731. Error(position,"runtime call parameter count mismatch");
  3732. END;
  3733. END;
  3734. Emit(Call(position, result.op, size));
  3735. ReleaseOperand(result);
  3736. ELSE (* only static linking possible *)
  3737. ASSERT(numberParameters >= 0);
  3738. Basic.InitSegmentedName(pooledName);
  3739. pooledName[0] := Basic.MakeString(moduleName);
  3740. pooledName[1] := Basic.MakeString(procedureName);
  3741. pooledName[2] := -1;
  3742. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3743. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3744. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3745. END;
  3746. END CallThisChecked;
  3747. (* 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. *)
  3748. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3749. BEGIN
  3750. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3751. END CallThis;
  3752. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3753. VAR
  3754. left,right: Operand;
  3755. leftSize, rightSize: IntermediateCode.Operand;
  3756. saved: RegisterEntry;
  3757. reg: IntermediateCode.Operand;
  3758. procedureName: SyntaxTree.IdentifierString;
  3759. BEGIN
  3760. procedureName := "CompareString";
  3761. SaveRegisters();ReleaseUsedRegisters(saved);
  3762. Designate(leftExpression,left);
  3763. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3764. Emit(Push(position,leftSize));
  3765. ReleaseIntermediateOperand(leftSize);
  3766. Emit(Push(position,left.op));
  3767. ReleaseOperand(left);
  3768. Designate(rightExpression,right);
  3769. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3770. Emit(Push(position,rightSize));
  3771. ReleaseIntermediateOperand(rightSize);
  3772. Emit(Push(position,right.op));
  3773. ReleaseOperand(right);
  3774. CallThis(position,builtinsModuleName,procedureName, 4);
  3775. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3776. Emit(Result(position,reg));
  3777. RestoreRegisters(saved);
  3778. br(label,reg,IntermediateCode.Immediate(int8,0));
  3779. ReleaseIntermediateOperand(reg);
  3780. END CompareString;
  3781. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3782. VAR
  3783. left,right: Operand;
  3784. leftSize, rightSize: IntermediateCode.Operand;
  3785. saved: RegisterEntry;
  3786. procedureName: SyntaxTree.IdentifierString;
  3787. BEGIN
  3788. procedureName := "CopyString";
  3789. SaveRegisters();ReleaseUsedRegisters(saved);
  3790. Designate(leftExpression,left);
  3791. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3792. Emit(Push(position,leftSize));
  3793. ReleaseIntermediateOperand(leftSize);
  3794. Emit(Push(position,left.op));
  3795. ReleaseOperand(left);
  3796. Designate(rightExpression,right);
  3797. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3798. Emit(Push(position,rightSize));
  3799. ReleaseIntermediateOperand(rightSize);
  3800. Emit(Push(position,right.op));
  3801. ReleaseOperand(right);
  3802. CallThis(position,builtinsModuleName,procedureName,4);
  3803. RestoreRegisters(saved);
  3804. END CopyString;
  3805. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3806. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3807. leftType,rightType: SyntaxTree.Type;
  3808. leftExpression,rightExpression : SyntaxTree.Expression;
  3809. componentType: IntermediateCode.Type;
  3810. exit: Label; dest: IntermediateCode.Operand;
  3811. size: LONGINT;
  3812. BEGIN
  3813. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3814. dest := destination; destination := emptyOperand;
  3815. leftType := x.left.type.resolved;
  3816. rightType := x.right.type.resolved;
  3817. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3818. CASE x.operator OF
  3819. Scanner.Or, Scanner.And, Scanner.Is:
  3820. result := ConditionValue(x);
  3821. |Scanner.Plus:
  3822. Evaluate(x.left,left);
  3823. Evaluate(x.right,right);
  3824. IF leftType IS SyntaxTree.SetType THEN
  3825. InitOperand(result,ModeValue);
  3826. Reuse2a(result.op,left.op,right.op,dest);
  3827. Emit(Or(position,result.op,left.op,right.op));
  3828. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3829. InitOperand(result,ModeValue);
  3830. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3831. Reuse2(result.tag,left.tag,right.tag);
  3832. Emit(Add(position,result.op,left.op,right.op));
  3833. Emit(Add(position,result.tag,left.tag,right.tag))
  3834. ELSE
  3835. InitOperand(result,ModeValue);
  3836. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3837. AddInt(result.op, left.op, right.op) ;
  3838. ELSE
  3839. *)
  3840. Reuse2a(result.op,left.op,right.op,dest);
  3841. Emit(Add(position,result.op,left.op,right.op));
  3842. (*
  3843. END;
  3844. *)
  3845. END;
  3846. ReleaseOperand(left); ReleaseOperand(right);
  3847. |Scanner.Minus:
  3848. Evaluate(x.left,left);
  3849. Evaluate(x.right,right);
  3850. IF leftType IS SyntaxTree.SetType THEN
  3851. InitOperand(result,ModeValue);
  3852. Reuse1(result.op,right.op);
  3853. Emit(Not(position,result.op,right.op));
  3854. ReleaseOperand(right);
  3855. Emit(And(position,result.op,result.op,left.op));
  3856. ReleaseOperand(left);
  3857. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3858. InitOperand(result,ModeValue);
  3859. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3860. Reuse2(result.tag,left.tag,right.tag);
  3861. Emit(Sub(position,result.op,left.op,right.op));
  3862. Emit(Sub(position,result.tag,left.tag,right.tag));
  3863. ReleaseOperand(left); ReleaseOperand(right)
  3864. ELSE
  3865. InitOperand(result,ModeValue);
  3866. Reuse2a(result.op,left.op,right.op,dest);
  3867. Emit(Sub(position,result.op,left.op,right.op));
  3868. ReleaseOperand(left); ReleaseOperand(right);
  3869. END;
  3870. |Scanner.Times:
  3871. Evaluate(x.left,left);
  3872. Evaluate(x.right,right);
  3873. IF leftType IS SyntaxTree.SetType THEN
  3874. InitOperand(result,ModeValue);
  3875. Reuse2a(result.op,left.op,right.op,dest);
  3876. Emit(And(position,result.op,left.op,right.op));
  3877. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3878. InitOperand(result, ModeValue);
  3879. componentType := left.op.type;
  3880. (* TODO: review this *)
  3881. (*
  3882. result.op = left.op * right.op - left.tag * right.tag
  3883. result.tag = left.tag * right.op + left.op * right.tag
  3884. *)
  3885. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3886. Emit(Mul(position,result.op, left.op, right.op));
  3887. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3888. Emit(Mul(position,tempReg, left.tag, right.tag));
  3889. Emit(Sub(position,result.op, result.op, tempReg));
  3890. Reuse2(result.tag, left.tag, right.op);
  3891. Emit(Mul(position,result.tag, left.tag, right.op));
  3892. Emit(Mul(position,tempReg, left.op, right.tag));
  3893. Emit(Add(position,result.tag, result.tag, tempReg));
  3894. ReleaseIntermediateOperand(tempReg)
  3895. ELSE
  3896. InitOperand(result,ModeValue);
  3897. Reuse2a(result.op,left.op,right.op,dest);
  3898. Emit(Mul(position,result.op,left.op,right.op));
  3899. END;
  3900. ReleaseOperand(left); ReleaseOperand(right);
  3901. |Scanner.Div:
  3902. Evaluate(x.left,left);
  3903. Evaluate(x.right,right);
  3904. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3905. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3906. IF ~isUnchecked THEN
  3907. exit := NewLabel();
  3908. BrltL(exit,zero,right.op);
  3909. EmitTrap(position,NegativeDivisorTrap);
  3910. SetLabel(exit);
  3911. END;
  3912. END;
  3913. InitOperand(result,ModeValue);
  3914. Reuse2a(result.op,left.op,right.op,dest);
  3915. Emit(Div(position,result.op,left.op,right.op));
  3916. ReleaseOperand(left); ReleaseOperand(right);
  3917. |Scanner.Mod:
  3918. Evaluate(x.left,left);
  3919. Evaluate(x.right,right);
  3920. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3921. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3922. IF ~isUnchecked THEN
  3923. exit := NewLabel();
  3924. BrltL(exit,zero,right.op);
  3925. EmitTrap(position,NegativeDivisorTrap);
  3926. SetLabel(exit);
  3927. END;
  3928. END;
  3929. InitOperand(result,ModeValue);
  3930. Reuse2a(result.op,left.op,right.op,dest);
  3931. Emit(Mod(position,result.op,left.op,right.op));
  3932. ReleaseOperand(left); ReleaseOperand(right);
  3933. |Scanner.Slash:
  3934. Evaluate(x.left,left);
  3935. Evaluate(x.right,right);
  3936. IF leftType IS SyntaxTree.SetType THEN
  3937. InitOperand(result,ModeValue);
  3938. Reuse2a(result.op,left.op,right.op,dest);
  3939. Emit(Xor(position,result.op,left.op,right.op));
  3940. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3941. InitOperand(result,ModeValue);
  3942. componentType := left.op.type;
  3943. (* review this *)
  3944. (*
  3945. divisor = right.op * right.op + right.tag * right.tag
  3946. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3947. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3948. *)
  3949. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3950. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3951. Emit(Mul(position,tempReg, right.op, right.op));
  3952. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3953. Emit(Add(position,tempReg, tempReg, tempReg2));
  3954. result.op := tempReg2;
  3955. Emit(Mul(position,result.op, left.op, right.op));
  3956. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3957. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3958. Emit(Add(position,result.op, result.op, tempReg2));
  3959. Emit(Div(position,result.op, result.op, tempReg));
  3960. Reuse2(result.tag, left.tag, right.op);
  3961. Emit(Mul(position,result.tag, left.tag, right.op));
  3962. Emit(Mul(position,tempReg2, left.op, right.tag));
  3963. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3964. Emit(Div(position,result.tag, result.tag, tempReg));
  3965. ReleaseIntermediateOperand(tempReg);
  3966. ReleaseIntermediateOperand(tempReg2)
  3967. ELSE
  3968. InitOperand(result,ModeValue);
  3969. Reuse2a(result.op,left.op,right.op,dest);
  3970. Emit(Div(position,result.op,left.op,right.op));
  3971. END;
  3972. ReleaseOperand(left); ReleaseOperand(right);
  3973. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3974. result := ConditionValue(x);
  3975. |Scanner.In:
  3976. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3977. Evaluate(x.left,left);
  3978. Evaluate(x.right,right);
  3979. Convert(left.op,setType);
  3980. Convert(right.op,setType);
  3981. ReuseCopy(temp.op,right.op);
  3982. Emit(Shr(position,temp.op,temp.op,left.op));
  3983. ReleaseOperand(right); ReleaseOperand(left);
  3984. IntermediateCode.InitImmediate(one,setType,1);
  3985. Emit(And(position,temp.op,temp.op,one));
  3986. Convert(temp.op,bool);
  3987. result.mode := ModeValue;
  3988. result.op := temp.op;
  3989. result.tag := nil; (* may be left over from calls to evaluate *)
  3990. ELSE
  3991. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3992. IF x.operator = Scanner.Questionmarks THEN
  3993. leftExpression := x.left;
  3994. rightExpression := x.right;
  3995. ELSE
  3996. leftExpression := x.right;
  3997. rightExpression := x.left;
  3998. END;
  3999. Evaluate(leftExpression, left);
  4000. Emit(Push(position,left.op));
  4001. ReleaseOperand(left);
  4002. Designate(rightExpression, right);
  4003. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4004. IF ~backend.cellsAreObjects THEN
  4005. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  4006. END;
  4007. Emit(Push(position,right.op));
  4008. ReleaseOperand(right);
  4009. IF backend.cellsAreObjects THEN
  4010. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  4011. ELSE
  4012. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  4013. END;
  4014. InitOperand(result, ModeValue);
  4015. result.op := NewRegisterOperand(bool);
  4016. Emit(Result(position,result.op));
  4017. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  4018. leftExpression := x.left;
  4019. rightExpression := x.right;
  4020. Evaluate(leftExpression, left);
  4021. Emit(Push(position,left.op));
  4022. ReleaseOperand(left);
  4023. Evaluate(rightExpression, right);
  4024. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4025. IF ~backend.cellsAreObjects THEN
  4026. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  4027. END;
  4028. Emit(Push(position,right.op));
  4029. ReleaseOperand(right);
  4030. IF backend.cellsAreObjects THEN
  4031. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  4032. ELSE
  4033. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  4034. END;
  4035. InitOperand(result, ModeValue);
  4036. result.op := NewRegisterOperand(bool);
  4037. Emit(Result(position,result.op));
  4038. ELSE
  4039. HALT(100);
  4040. END;
  4041. END;
  4042. destination := dest;
  4043. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  4044. END VisitBinaryExpression;
  4045. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  4046. VAR localResult, operand: Operand;
  4047. BEGIN
  4048. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  4049. InitOperand(localResult, ModeValue);
  4050. ASSERT(x.first # NIL);
  4051. Evaluate(x.first, operand);
  4052. localResult.op := operand.op;
  4053. ReleaseOperand(operand);
  4054. UseIntermediateOperand(localResult.op);
  4055. ASSERT(x.last # NIL);
  4056. Evaluate(x.last, operand);
  4057. localResult.tag := operand.op;
  4058. ReleaseOperand(operand);
  4059. UseIntermediateOperand(localResult.tag);
  4060. IF x.step # NIL THEN
  4061. Evaluate(x.step, operand);
  4062. localResult.extra := operand.op;
  4063. ReleaseOperand(operand);
  4064. UseIntermediateOperand(localResult.extra);
  4065. END;
  4066. result := localResult;
  4067. IF Trace THEN TraceExit("VisitRangeExpression") END
  4068. END VisitRangeExpression;
  4069. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  4070. BEGIN
  4071. HALT(100); (* should never be evaluated *)
  4072. END VisitTensorRangeExpression;
  4073. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  4074. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  4075. BEGIN
  4076. IF Trace THEN TraceEnter("VisitConversion") END;
  4077. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  4078. dest := destination; destination := emptyOperand;
  4079. Evaluate(x.expression,old);
  4080. InitOperand(result,ModeValue);
  4081. result.op := old.op;
  4082. ASSERT(result.op.mode # 0);
  4083. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  4084. (* convert TO a complex number *)
  4085. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  4086. Convert(result.op,IntermediateCode.GetType(system, componentType));
  4087. ASSERT(result.op.mode # 0);
  4088. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  4089. (* convert FROM a complex number TO a complex number*)
  4090. result.tag := old.tag;
  4091. ASSERT(result.tag.mode # 0);
  4092. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  4093. ASSERT(result.tag.mode # 0)
  4094. ELSE
  4095. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  4096. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  4097. END
  4098. ELSE
  4099. Convert(result.op,IntermediateCode.GetType(system,x.type));
  4100. ASSERT(result.op.mode # 0);
  4101. result.tag := old.tag; (*! probably never used *)
  4102. END;
  4103. destination := dest;
  4104. IF Trace THEN TraceExit("VisitConversion") END;
  4105. END VisitConversion;
  4106. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  4107. BEGIN
  4108. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  4109. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  4110. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  4111. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  4112. END VisitTypeDeclaration;
  4113. (** designators (expressions) *)
  4114. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  4115. VAR ownerType, designatorType: SyntaxTree.RecordType;
  4116. BEGIN
  4117. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  4118. IF x.left # NIL THEN Expression(x.left) END;
  4119. Symbol(x.symbol,result);
  4120. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  4121. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  4122. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  4123. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  4124. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  4125. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  4126. END;
  4127. END;
  4128. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  4129. END VisitSymbolDesignator;
  4130. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  4131. BEGIN
  4132. IF isUnchecked THEN RETURN END;
  4133. IF tagsAvailable THEN
  4134. TrapC(BrltL,index,length,IndexCheckTrap);
  4135. END;
  4136. END BoundCheck;
  4137. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  4138. VAR d: IntermediateCode.Operand;
  4139. BEGIN
  4140. IF isUnchecked THEN RETURN END;
  4141. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  4142. TrapC(op,dim,d,ArraySizeTrap);
  4143. ReleaseIntermediateOperand(d);
  4144. END DimensionCheck;
  4145. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  4146. VAR
  4147. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  4148. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  4149. expression: SyntaxTree.Expression;
  4150. resultingType, leftType, baseType: SyntaxTree.Type;
  4151. skipLabel1: Label;
  4152. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  4153. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  4154. variableOp: Operand;
  4155. variable: SyntaxTree.Variable;
  4156. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  4157. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  4158. VAR e: SyntaxTree.Expression; i: LONGINT;
  4159. BEGIN
  4160. tensorFound := FALSE;
  4161. FOR i := 0 TO parameters.Length()-1 DO
  4162. e := parameters.GetExpression(i);
  4163. IF e IS SyntaxTree.TensorRangeExpression THEN
  4164. ASSERT(~tensorFound);
  4165. tensorFound := TRUE;
  4166. ELSIF e IS SyntaxTree.RangeExpression THEN
  4167. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4168. ELSE
  4169. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4170. END;
  4171. END;
  4172. END CountIndices;
  4173. BEGIN
  4174. ASSERT(tagsAvailable);
  4175. resultingType := x.type.resolved; (* resulting type *)
  4176. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  4177. InitOperand(localResult, ModeReference);
  4178. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4179. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  4180. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  4181. (* a globally defined array destination tag is available -> use and invalidate it*)
  4182. localResult.tag := arrayDestinationTag;
  4183. IntermediateCode.InitOperand(arrayDestinationTag)
  4184. ELSE
  4185. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  4186. (* the result is of array range type and thus does not provide any collectable pointers *)
  4187. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  4188. Symbol(variable, variableOp);
  4189. ReuseCopy(localResult.tag, variableOp.op);
  4190. ReleaseOperand(variableOp);
  4191. END
  4192. END;
  4193. indexListSize := x.parameters.Length();
  4194. CountIndices(x.parameters);
  4195. (*ASSERT(tensorRangeCount <= 1);*)
  4196. (* designate the array to be indexed over, perform tensor range check if known *)
  4197. Designate(x.left, array);
  4198. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4199. Dereference(array, leftType,FALSE);
  4200. IF ~tensorFound THEN
  4201. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  4202. END
  4203. END;
  4204. (* default base offset *)
  4205. srcDimOffset := 0;
  4206. destDimOffset := 0;
  4207. indexDim := 0;
  4208. (* use address of source array as basis *)
  4209. localResult.op := array.op;
  4210. UseIntermediateOperand(localResult.op);
  4211. (* go through the index list *)
  4212. FOR i := 0 TO indexListSize - 1 DO
  4213. expression := x.parameters.GetExpression(i);
  4214. IF expression IS SyntaxTree.TensorRangeExpression THEN
  4215. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  4216. srcDimOffset := -indexListSize;
  4217. destDimOffset := -suffixRanges;
  4218. ELSE
  4219. (* determine which dimension of source array is currently looked at *)
  4220. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  4221. (* get the memory operand pointing to array descriptor dimension *)
  4222. GetMathArrayField(tmp, array.tag, MathDimOffset);
  4223. (* make a reusable register from it *)
  4224. ReuseCopy(srcDim, tmp);
  4225. ReleaseIntermediateOperand(tmp);
  4226. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  4227. ELSE
  4228. srcDim := IntermediateCode.Immediate(sizeType, i);
  4229. END;
  4230. (* get length and increment of source array for current dimension *)
  4231. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  4232. Convert(sourceLength.op, sizeType);
  4233. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  4234. Convert(sourceIncrement.op, sizeType);
  4235. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  4236. ReleaseIntermediateOperand(srcDim);
  4237. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  4238. (* SINGLE INDEX *)
  4239. Evaluate(expression, index);
  4240. ReleaseIntermediateOperand(index.tag);
  4241. index.tag := emptyOperand;
  4242. Convert(index.op, sizeType);
  4243. (* lower bound check *)
  4244. IF IsIntegerImmediate(index.op, staticIndex) THEN
  4245. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  4246. ELSIF isUnchecked THEN (* do nothing *)
  4247. ELSE
  4248. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4249. END;
  4250. (* upper bound check *)
  4251. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4252. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  4253. ELSIF isUnchecked THEN (* do nothing *)
  4254. ELSE
  4255. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  4256. END;
  4257. ReleaseOperand(sourceLength);
  4258. Convert(index.op, addressType);
  4259. summand := index.op;
  4260. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  4261. (* RANGE OF INDICES *)
  4262. Evaluate(expression, range);
  4263. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  4264. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  4265. stepSize := range.extra; UseIntermediateOperand(stepSize);
  4266. ReleaseOperand(range);
  4267. Convert(firstIndex, sizeType);
  4268. Convert(lastIndex, sizeType);
  4269. Convert(stepSize, sizeType);
  4270. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  4271. if it is 'MAX(LONGINT)' *)
  4272. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4273. TransferToRegister(lastIndex, lastIndex);
  4274. skipLabel1 := NewLabel();
  4275. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  4276. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  4277. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  4278. SetLabel(skipLabel1)
  4279. END;
  4280. (* check if step size is valid *)
  4281. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  4282. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  4283. ELSIF isUnchecked THEN (* do nothing *)
  4284. ELSE
  4285. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  4286. END;
  4287. (* check lower bound check *)
  4288. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  4289. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  4290. ELSIF isUnchecked THEN (* do nothing *)
  4291. ELSE
  4292. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4293. END;
  4294. (* check upper bound check *)
  4295. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4296. (* statically open range: nothing to do *)
  4297. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4298. ASSERT(staticLastIndex < staticSourceLength)
  4299. ELSIF isUnchecked THEN (* do nothing *)
  4300. ELSE
  4301. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  4302. END;
  4303. (* determine length of target array for current dimension *)
  4304. (* 1. incorporate last index: *)
  4305. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4306. (* last index is static *)
  4307. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4308. targetLength := sourceLength.op
  4309. ELSE
  4310. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  4311. END;
  4312. UseIntermediateOperand(targetLength);
  4313. ELSE
  4314. (* targetLength := lastIndex + 1
  4315. Reuse1(targetLength, lastIndex);
  4316. *)
  4317. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  4318. END;
  4319. ReleaseOperand(sourceLength);
  4320. ReleaseIntermediateOperand(lastIndex);
  4321. (* 2. incorporate first index: *)
  4322. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4323. (* first index and current target length are static *)
  4324. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  4325. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  4326. (* first index = 0: nothing to do *)
  4327. ELSE
  4328. (* targetLength := targetLength - firstIndex *)
  4329. TransferToRegister(targetLength, targetLength);
  4330. Emit(Sub(position,targetLength, targetLength, firstIndex))
  4331. END;
  4332. (* clip negative lengths to 0 *)
  4333. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4334. IF staticTargetLength < 0 THEN
  4335. targetLength := IntermediateCode.Immediate(sizeType, 0)
  4336. END
  4337. ELSE
  4338. skipLabel1 := NewLabel();
  4339. TransferToRegister(targetLength, targetLength);
  4340. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  4341. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  4342. SetLabel(skipLabel1)
  4343. END;
  4344. (* 3. incorporate index step size: *)
  4345. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4346. (*step size and current target length are static *)
  4347. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  4348. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  4349. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4350. (* step size = 1: nothing to do *)
  4351. ELSE
  4352. (* emit code for this:
  4353. targetLength := (targetLength-1) DIV stepSize +1;
  4354. *)
  4355. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  4356. DivInt(targetLength, targetLength, stepSize);
  4357. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  4358. END;
  4359. (* determine increment of target array for current dimension *)
  4360. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  4361. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  4362. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4363. (* step size = 1 *)
  4364. targetIncrement := sourceIncrement.op;
  4365. UseIntermediateOperand(targetIncrement)
  4366. ELSE
  4367. (* targetIncrement := sourceIncrement * stepSize *)
  4368. Reuse1(targetIncrement, stepSize);
  4369. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  4370. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  4371. END;
  4372. ReleaseIntermediateOperand(stepSize);
  4373. (* write length and increment of target array to descriptor *)
  4374. IF destDimOffset < 0 THEN
  4375. (* determine which dimension of target array is currently looked at *)
  4376. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  4377. TransferToRegister(destDim, tmp);
  4378. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  4379. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  4380. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  4381. ReleaseIntermediateOperand(destDim);
  4382. INC(destDimOffset);
  4383. ELSE
  4384. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  4385. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  4386. END;
  4387. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  4388. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  4389. INC(indexDim);
  4390. Convert(firstIndex, addressType);
  4391. TransferToRegister(summand, firstIndex);
  4392. ELSE HALT(100);
  4393. END;
  4394. (*
  4395. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  4396. *)
  4397. Convert(sourceIncrement.op, addressType);
  4398. Convert(summand, addressType);
  4399. MulInt(summand, summand, sourceIncrement.op);
  4400. ReleaseIntermediateOperand(sourceIncrement.op);
  4401. AddInt(localResult.op, localResult.op, summand);
  4402. ReleaseIntermediateOperand(summand);
  4403. END
  4404. END;
  4405. result := localResult;
  4406. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4407. ReleaseIntermediateOperand(result.tag);
  4408. result.tag := TypeDescriptorAdr(resultingType);
  4409. ELSIF IsDelegate(resultingType) THEN
  4410. ReleaseIntermediateOperand(result.tag);
  4411. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4412. UseIntermediateOperand(result.tag);
  4413. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4414. ReleaseIntermediateOperand(result.tag);
  4415. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4416. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4417. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4418. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4419. (* finalize target array descriptor *)
  4420. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4421. (* write lengths and increments of target array for remaining dimensions *)
  4422. i := indexListSize;
  4423. WHILE indexDim < targetArrayDimensionality DO
  4424. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4425. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4426. ReleaseOperand(sourceLength);
  4427. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4428. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4429. ReleaseOperand(sourceIncrement);
  4430. INC(i); INC(indexDim);
  4431. END;
  4432. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4433. tmp := nil;
  4434. ELSE
  4435. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4436. END;
  4437. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4438. ReleaseIntermediateOperand(tmp);
  4439. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4440. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4441. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4442. ELSE
  4443. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4444. END;
  4445. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4446. ReleaseIntermediateOperand(tmp);
  4447. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4448. (* write dimensionality *)
  4449. IF targetArrayDimensionality # 0 THEN
  4450. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4451. END;
  4452. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4453. END;
  4454. ReleaseOperand(array);
  4455. END MathIndexDesignator;
  4456. (* get the length of an array , trying to make use of static information *)
  4457. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4458. VAR res: IntermediateCode.Operand; size: LONGINT;
  4459. BEGIN
  4460. type := type.resolved;
  4461. IF type IS SyntaxTree.ArrayType THEN
  4462. WITH type: SyntaxTree.ArrayType DO
  4463. IF type.form = SyntaxTree.Static THEN
  4464. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4465. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4466. Evaluate(type.length, op);
  4467. ReleaseIntermediateOperand(op.tag);
  4468. RETURN op.op;*)
  4469. ELSE
  4470. res := tag;
  4471. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4472. IntermediateCode.MakeMemory(res,addressType);
  4473. UseIntermediateOperand(res);
  4474. RETURN res
  4475. END
  4476. END;
  4477. ELSE
  4478. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4479. RETURN IntermediateCode.Immediate(addressType,size);
  4480. END;
  4481. END ArrayLength;
  4482. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4483. BEGIN
  4484. IF IsImmediate(x) THEN
  4485. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4486. ELSE
  4487. IF ~ReusableRegister(res) THEN
  4488. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4489. ELSE
  4490. UseIntermediateOperand(res);
  4491. END;
  4492. Emit(Mov(position,res,x))
  4493. END;
  4494. END CopyInt;
  4495. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4496. BEGIN
  4497. ReleaseIntermediateOperand(res);
  4498. IF IsImmediate(x) & IsImmediate(y) THEN
  4499. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4500. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4501. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4502. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4503. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4504. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4505. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4506. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4507. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4508. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4509. UseIntermediateOperand(res);
  4510. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4511. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4512. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4513. UseIntermediateOperand(res);
  4514. ELSE
  4515. IF ~ReusableRegister(res) THEN
  4516. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4517. ELSE
  4518. UseIntermediateOperand(res);
  4519. END;
  4520. IF IsImmediate(x) & (x.intValue = 0) THEN
  4521. Emit(Mov(position,res,y))
  4522. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4523. Emit(Mov(position,res,x))
  4524. ELSE
  4525. Emit(Add(position,res, x, y));
  4526. END;
  4527. END;
  4528. END AddInt;
  4529. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4530. BEGIN
  4531. ReleaseIntermediateOperand(res);
  4532. IF IsImmediate(x) & IsImmediate(y) THEN
  4533. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4534. ELSE
  4535. IF ~ReusableRegister(res) THEN
  4536. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4537. ELSE UseIntermediateOperand(res);
  4538. END;
  4539. IF IsImmediate(x) & (x.intValue = 1) THEN
  4540. Emit(Mov(position,res,y))
  4541. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4542. Emit(Mov(position,res,x))
  4543. ELSE
  4544. Emit(Mul(position,res, x, y));
  4545. END;
  4546. END;
  4547. END MulInt;
  4548. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4549. BEGIN
  4550. ReleaseIntermediateOperand(res);
  4551. IF IsImmediate(x) & IsImmediate(y) THEN
  4552. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4553. ELSE
  4554. IF ~ReusableRegister(res) THEN
  4555. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4556. ELSE UseIntermediateOperand(res);
  4557. END;
  4558. IF IsImmediate(x) & (x.intValue = 1) THEN
  4559. Emit(Mov(position,res,y))
  4560. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4561. Emit(Mov(position,res,x))
  4562. ELSE
  4563. Emit(Div(position,res, x, y));
  4564. END;
  4565. END;
  4566. END DivInt;
  4567. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4568. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4569. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4570. BEGIN
  4571. type := x.left.type.resolved;
  4572. IF type IS SyntaxTree.StringType THEN
  4573. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4574. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4575. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4576. type := atype;
  4577. x.left.SetType(type);
  4578. END;
  4579. IntermediateCode.InitImmediate(res,addressType,0);
  4580. maxDim := x.parameters.Length()-1;
  4581. (*
  4582. computation rule:
  4583. a: ARRAY X,Y,Z OF Element with size S
  4584. a[i,j,k] -->
  4585. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4586. *)
  4587. FOR i := 0 TO maxDim DO
  4588. e := x.parameters.GetExpression(i);
  4589. Evaluate(e,index);
  4590. Convert(index.op,addressType);
  4591. AddInt(res, res, index.op);
  4592. IF i = 0 THEN
  4593. (*
  4594. ReuseCopy(res, index.op);
  4595. *)
  4596. Designate(x.left,array);
  4597. type := x.left.type.resolved;
  4598. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4599. Dereference(array, type, FALSE);
  4600. END;
  4601. (*
  4602. ELSE AddInt(res, res, index.op);
  4603. *)
  4604. END;
  4605. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4606. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4607. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4608. BoundCheck(index.op, length);
  4609. END;
  4610. ReleaseIntermediateOperand(length);
  4611. END;
  4612. ReleaseOperand(index);
  4613. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4614. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4615. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4616. MulInt(res,res,length);
  4617. END;
  4618. ReleaseIntermediateOperand(length);
  4619. END;
  4620. (* remaining open dimensions -- compute address *)
  4621. i := maxDim+1;
  4622. IF type IS SyntaxTree.ArrayType THEN
  4623. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4624. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4625. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4626. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4627. MulInt(res,res,length);
  4628. END;
  4629. ReleaseIntermediateOperand(length);
  4630. INC(i);
  4631. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4632. END;
  4633. END;
  4634. IF (type IS SyntaxTree.ArrayType) THEN
  4635. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4636. size := StaticSize(system, type);
  4637. IF size # 1 THEN
  4638. length := IntermediateCode.Immediate(addressType,size);
  4639. MulInt(res,res,length);
  4640. END;
  4641. ELSE
  4642. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4643. IF size # 1 THEN
  4644. length := IntermediateCode.Immediate(addressType,size);
  4645. MulInt(res,res,length);
  4646. END;
  4647. END;
  4648. END;
  4649. AddInt(res,res,array.op);
  4650. InitOperand(result,ModeReference);
  4651. result.op := res;
  4652. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4653. ReleaseIntermediateOperand(result.tag);
  4654. result.tag := TypeDescriptorAdr(type);
  4655. ELSIF IsDelegate(type) THEN
  4656. ReleaseIntermediateOperand(result.tag);
  4657. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4658. UseIntermediateOperand(result.tag);
  4659. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4660. ReleaseIntermediateOperand(result.tag);
  4661. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4662. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4663. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4664. END;
  4665. ReleaseOperand(array);
  4666. END IndexDesignator;
  4667. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4668. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4669. BEGIN
  4670. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4671. dest := destination; destination := emptyOperand;
  4672. type := x.left.type.resolved;
  4673. IF type IS SyntaxTree.MathArrayType THEN
  4674. MathIndexDesignator(x);
  4675. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4676. IndexDesignator(x);
  4677. END;
  4678. destination := dest;
  4679. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4680. END VisitIndexDesignator;
  4681. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4682. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4683. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4684. procedure: SyntaxTree.Procedure;
  4685. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4686. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4687. BEGIN
  4688. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4689. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4690. parameters := expression.parameters;
  4691. moduleName := "FoxArrayBase";
  4692. procedureName := "CopyDescriptor";
  4693. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4694. SaveRegisters();ReleaseUsedRegisters(saved);
  4695. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4696. IF procedure = NIL THEN
  4697. s := "procedure ";
  4698. Strings.Append(s,moduleName);
  4699. Strings.Append(s,".");
  4700. Strings.Append(s,procedureName);
  4701. Strings.Append(s," not present");
  4702. Error(position,s);
  4703. ELSE
  4704. (* push address of temporary variable *)
  4705. Symbol(variable,destOperand);
  4706. Emit(Push(position,destOperand.op));
  4707. ReleaseOperand(destOperand);
  4708. (* push src *)
  4709. Evaluate(expression.left,srcOperand);
  4710. (*
  4711. Dereference(srcOperand,expression.type.resolved);
  4712. Emit(Push(position,srcOperand.tag));
  4713. *)
  4714. Emit(Push(position,srcOperand.op));
  4715. ReleaseOperand(srcOperand);
  4716. tensorFound := FALSE;
  4717. FOR i := 0 TO parameters.Length()-1 DO
  4718. e := parameters.GetExpression(i);
  4719. IF e IS SyntaxTree.TensorRangeExpression THEN
  4720. tensorFound := TRUE;
  4721. ELSIF e IS SyntaxTree.RangeExpression THEN
  4722. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4723. ELSE
  4724. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4725. END;
  4726. END;
  4727. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4728. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4729. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4730. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4731. StaticCallOperand(procOp,procedure);
  4732. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4733. ReleaseOperand(procOp);
  4734. END;
  4735. RestoreRegisters(saved);
  4736. END;
  4737. RETURN variable
  4738. END PrepareTensorDescriptor;
  4739. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4740. VAR
  4741. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4742. operand, tmpOperand, variableOp, variable2Op: Operand;
  4743. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4744. variable, variable2: SyntaxTree.Variable;
  4745. dim, i, size: LONGINT;
  4746. (* TODO: needed? *)
  4747. oldArrayDestinationTag: IntermediateCode.Operand;
  4748. oldArrayDestinationDimension: LONGINT;
  4749. position: Position;
  4750. saved: RegisterEntry;
  4751. arrayFlags: SET;
  4752. m, n: LONGINT;
  4753. PROCEDURE Pass(op: IntermediateCode.Operand);
  4754. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4755. BEGIN
  4756. IF register >= 0 THEN
  4757. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4758. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4759. Emit(Mov(position,parameterRegister, op));
  4760. ELSE
  4761. Emit(Push(position,op))
  4762. END
  4763. END Pass;
  4764. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4765. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4766. BEGIN
  4767. formalType := formalType.resolved; actualType := actualType.resolved;
  4768. IF IsOpenArray(formalType)THEN
  4769. IF actualType IS SyntaxTree.StringType THEN
  4770. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4771. RETURN;
  4772. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4773. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4774. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4775. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4776. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4777. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4778. ELSE
  4779. tmp := baseReg;
  4780. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4781. IntermediateCode.MakeMemory(tmp,addressType);
  4782. Pass((tmp));
  4783. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4784. END;
  4785. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4786. END;
  4787. END PushArrayLens;
  4788. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4789. BEGIN
  4790. CASE size OF
  4791. |2: INCL(flags,Size2Flag);
  4792. |3: INCL(flags,Size3Flag);
  4793. |4: INCL(flags,Size4Flag);
  4794. |5: INCL(flags,Size5Flag);
  4795. |6: INCL(flags,Size6Flag);
  4796. |7: INCL(flags,Size7Flag);
  4797. |8: INCL(flags,Size8Flag);
  4798. END;
  4799. END SetSmallArraySizeFlag;
  4800. BEGIN
  4801. IF Trace THEN TraceEnter("PushParameter") END;
  4802. position := expression.position;
  4803. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4804. type := expression.type.resolved;
  4805. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4806. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4807. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4808. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4809. );
  4810. (* TODO: needed? *)
  4811. oldArrayDestinationTag := arrayDestinationTag;
  4812. oldArrayDestinationDimension := arrayDestinationDimension;
  4813. IF IsArrayOfSystemByte(parameter.type) THEN
  4814. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4815. Designate(expression,operand);
  4816. ELSE
  4817. Evaluate(expression, tmpOperand);
  4818. (* array of system byte does not provide any pointers *)
  4819. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4820. Symbol(variable, operand);
  4821. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4822. Emit(Mov(position,tmp, tmpOperand.op));
  4823. ReleaseOperand(tmpOperand);
  4824. END;
  4825. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4826. ReleaseIntermediateOperand(operand.tag);
  4827. operand.tag := tmp;
  4828. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4829. Pass((operand.tag));
  4830. END;
  4831. Pass((operand.op));
  4832. ELSIF IsOpenArray(parameter.type) THEN
  4833. Designate(expression,operand);
  4834. baseReg := operand.tag;
  4835. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4836. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4837. END;
  4838. Pass((operand.op)); (* address of the array *)
  4839. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4840. (* case 1
  4841. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4842. *)
  4843. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4844. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4845. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4846. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4847. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4848. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4849. arrayDestinationTag := sp;
  4850. (* case 1b
  4851. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4852. *)
  4853. IF expression IS SyntaxTree.IndexDesignator THEN
  4854. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4855. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4856. arrayDestinationDimension := dim;
  4857. Designate(expression,operand);
  4858. (* case 1a
  4859. P(...,A,...) push: push array descriptor to stack
  4860. *)
  4861. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4862. Designate(expression,operand);
  4863. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4864. i := 0;
  4865. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4866. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4867. INC(i);
  4868. END;
  4869. type := expression.type.resolved;
  4870. WHILE (i<dim) DO (* remaining static dimensions *)
  4871. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4872. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4873. ReleaseOperand(tmpOperand);
  4874. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4875. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4876. ReleaseOperand(tmpOperand);
  4877. INC(i);
  4878. END;
  4879. dimOp := IntermediateCode.Immediate(addressType,dim);
  4880. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4881. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4882. (* case 1d
  4883. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4884. + case 1e
  4885. P(.. PT() ... );
  4886. *)
  4887. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4888. Designate(expression,operand);
  4889. Dereference(operand,type.resolved,FALSE);
  4890. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4891. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4892. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4893. (* case 1f
  4894. P(...,S,...) push: create array descriptor to S on stack
  4895. case 1g
  4896. P(... PS()...)
  4897. *)
  4898. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4899. Designate(expression,operand);
  4900. FOR i := 0 TO dim-1 DO
  4901. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4902. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4903. ReleaseOperand(tmpOperand);
  4904. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4905. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4906. ReleaseOperand(tmpOperand);
  4907. END;
  4908. (*******
  4909. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4910. *)
  4911. arrayFlags := {StaticFlag};
  4912. IF dim = 1 THEN
  4913. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4914. ReleaseOperand(tmpOperand);
  4915. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4916. m := LONGINT(tmpOperand.op.intValue);
  4917. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4918. ELSIF dim = 2 THEN
  4919. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4920. ReleaseOperand(tmpOperand);
  4921. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4922. m := LONGINT(tmpOperand.op.intValue);
  4923. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4924. ReleaseOperand(tmpOperand);
  4925. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4926. n := LONGINT(tmpOperand.op.intValue);
  4927. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4928. INCL(arrayFlags,SmallMatrixFlag);
  4929. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4930. END;
  4931. END;
  4932. (*******)
  4933. dimOp := IntermediateCode.Immediate(addressType,dim);
  4934. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4935. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4936. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4937. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4938. baseType := SemanticChecker.ArrayBase(type,dim);
  4939. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4940. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4941. ELSE HALT(100);
  4942. END;
  4943. (* case 2
  4944. procedure P([left args], var A: array [*,*] of Type, [right args])
  4945. *)
  4946. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4947. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4948. (* case 2b
  4949. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4950. push: push reference to pushed array descriptor
  4951. post: remove array descriptor.
  4952. *)
  4953. IF expression IS SyntaxTree.IndexDesignator THEN
  4954. descriptorType := GetMathArrayDescriptorType(dim);
  4955. (* range type : no allocation possible, should be untraced *)
  4956. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4957. Symbol(variable,variableOp);
  4958. arrayDestinationTag := variableOp.op;
  4959. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4960. arrayDestinationDimension := dim;
  4961. NeedDescriptor := TRUE;
  4962. Designate(expression,operand);
  4963. Pass((operand.tag));
  4964. NeedDescriptor := FALSE;
  4965. (* case 2a
  4966. P(...,A,...)
  4967. push: push reference to array descriptor on stack
  4968. *)
  4969. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4970. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4971. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4972. INC(i);
  4973. END;
  4974. IF i = dim THEN
  4975. Designate(expression,operand);
  4976. Pass((operand.tag));
  4977. ELSE (* open-static *)
  4978. type := expression.type.resolved;
  4979. descriptorType := GetMathArrayDescriptorType(dim);
  4980. (* static array , cannot be reallocated, untraced !*)
  4981. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4982. Symbol(variable,variableOp);
  4983. arrayDestinationTag := variableOp.op;
  4984. Designate(expression,operand);
  4985. FOR i := 0 TO dim-1 DO
  4986. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4987. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4988. ReleaseOperand(tmpOperand);
  4989. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4990. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4991. ReleaseOperand(tmpOperand);
  4992. END;
  4993. dimOp := IntermediateCode.Immediate(addressType,dim);
  4994. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4995. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4996. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4997. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4998. baseType := SemanticChecker.ArrayBase(type,dim);
  4999. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5000. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5001. Pass((arrayDestinationTag));
  5002. END;
  5003. (* case 2d
  5004. P(...,T,...) push: emit dimension check, push T
  5005. *)
  5006. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5007. Designate(expression,operand);
  5008. Dereference(operand,type.resolved,FALSE);
  5009. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  5010. Pass((operand.tag));
  5011. (* case 2f
  5012. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  5013. push: push reference to pushed array descriptor
  5014. post: remove array descriptor
  5015. *)
  5016. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5017. descriptorType := GetMathArrayDescriptorType(dim);
  5018. (* static array -- cannot be reallocatated, untraced *)
  5019. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5020. Symbol(variable,variableOp);
  5021. arrayDestinationTag := variableOp.op;
  5022. Designate(expression,operand);
  5023. FOR i := 0 TO dim-1 DO
  5024. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5025. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5026. ReleaseOperand(tmpOperand);
  5027. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5028. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5029. ReleaseOperand(tmpOperand);
  5030. END;
  5031. (*
  5032. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  5033. *)
  5034. arrayFlags := {StaticFlag};
  5035. IF dim = 1 THEN
  5036. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5037. ReleaseOperand(tmpOperand);
  5038. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5039. m := LONGINT(tmpOperand.op.intValue);
  5040. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  5041. ELSIF dim = 2 THEN
  5042. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5043. ReleaseOperand(tmpOperand);
  5044. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5045. m := LONGINT(tmpOperand.op.intValue);
  5046. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  5047. ReleaseOperand(tmpOperand);
  5048. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5049. n := LONGINT(tmpOperand.op.intValue);
  5050. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  5051. INCL(arrayFlags,SmallMatrixFlag);
  5052. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  5053. END;
  5054. END;
  5055. (*******)
  5056. dimOp := IntermediateCode.Immediate(addressType,dim);
  5057. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5058. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5059. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5060. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  5061. baseType := SemanticChecker.ArrayBase(type,dim);
  5062. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5063. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5064. Pass((arrayDestinationTag));
  5065. ELSE HALT(100);
  5066. END;
  5067. (* case 3
  5068. procedure P([left args], [const] A: array [?] of Type, [right args])
  5069. *)
  5070. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  5071. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5072. (* case 3b
  5073. P(...,A[a..b,c..d],...)
  5074. *)
  5075. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5076. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5077. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5078. Symbol(variable,variableOp);
  5079. LoadValue(variableOp,system.addressType);
  5080. ELSE
  5081. descriptorType := GetMathArrayDescriptorType(dim);
  5082. (* range -- cannot be reallocated *)
  5083. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5084. Symbol(variable,variableOp);
  5085. END;
  5086. arrayDestinationTag := variableOp.op;
  5087. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5088. arrayDestinationDimension := 0;
  5089. Designate(expression,operand);
  5090. Pass((operand.tag));
  5091. (* case 3a
  5092. P(...,A,...)
  5093. *)
  5094. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5095. i := 0;
  5096. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5097. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5098. INC(i);
  5099. END;
  5100. IF i = dim THEN
  5101. Designate(expression,operand);
  5102. Pass((operand.tag));
  5103. ELSE (* open-static *)
  5104. type := expression.type.resolved;
  5105. descriptorType := GetMathArrayDescriptorType(dim);
  5106. (* static array -- cannot be reallocated -- no pointer to be traced *)
  5107. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5108. Symbol(variable,variableOp);
  5109. arrayDestinationTag := variableOp.op;
  5110. Designate(expression,operand);
  5111. FOR i := 0 TO dim-1 DO
  5112. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5113. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5114. ReleaseOperand(tmpOperand);
  5115. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5116. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5117. ReleaseOperand(tmpOperand);
  5118. END;
  5119. dimOp := IntermediateCode.Immediate(addressType,dim);
  5120. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5121. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5122. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5123. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  5124. baseType := SemanticChecker.ArrayBase(type,dim);
  5125. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5126. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5127. Pass((arrayDestinationTag));
  5128. END;
  5129. (* case 3d
  5130. P(...,T,...)
  5131. case 3e
  5132. P(...,PT(...),...)
  5133. *)
  5134. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5135. Designate(expression,operand);
  5136. Dereference(operand,type.resolved,FALSE);
  5137. Pass((operand.tag));
  5138. (* case 3f
  5139. P(...,S,...)
  5140. case 3g
  5141. P(...,PS(...),...)
  5142. *)
  5143. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5144. descriptorType := GetMathArrayDescriptorType(dim);
  5145. (* static array does not need to be traced *)
  5146. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5147. Symbol(variable,variableOp);
  5148. arrayDestinationTag := variableOp.op;
  5149. Designate(expression,operand);
  5150. IF operand.op.type.length >1 THEN (* vector register *)
  5151. (* static array does not need to be traced *)
  5152. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  5153. Symbol(variable2, variable2Op);
  5154. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  5155. Emit(Mov(position,tmp, operand.op));
  5156. ReleaseOperand(operand);
  5157. Symbol(variable2, operand);
  5158. END;
  5159. FOR i := 0 TO dim-1 DO
  5160. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5161. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5162. ReleaseOperand(tmpOperand);
  5163. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5164. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5165. ReleaseOperand(tmpOperand);
  5166. END;
  5167. dimOp := IntermediateCode.Immediate(addressType,dim);
  5168. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5169. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5170. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5171. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5172. baseType := SemanticChecker.ArrayBase(type,dim);
  5173. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5174. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5175. Pass((arrayDestinationTag));
  5176. ELSE HALT(100);
  5177. END;
  5178. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  5179. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5180. (* case 4b
  5181. P(...,A[a..b,c..d],...)
  5182. *)
  5183. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5184. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5185. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5186. Symbol(variable,variableOp);
  5187. LoadValue(variableOp,system.addressType);
  5188. ELSE
  5189. descriptorType := GetMathArrayDescriptorType(dim);
  5190. (* range array -- cannot be allocated *)
  5191. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5192. Symbol(variable,variableOp);
  5193. END;
  5194. arrayDestinationTag := variableOp.op;
  5195. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5196. arrayDestinationDimension := 0;
  5197. Designate(expression,operand);
  5198. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5199. Symbol(variable,variableOp);
  5200. ELSE
  5201. (* alias to range -- untraced *)
  5202. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5203. Symbol(variable,variableOp);
  5204. MakeMemory(tmp,variableOp.op,addressType,0);
  5205. Emit(Mov(position,tmp,operand.tag));
  5206. ReleaseIntermediateOperand(tmp);
  5207. END;
  5208. Pass((variableOp.op));
  5209. ReleaseOperand(variableOp);
  5210. (* case 4a
  5211. P(...,A,...)
  5212. *)
  5213. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5214. i := 0;
  5215. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5216. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5217. INC(i);
  5218. END;
  5219. IF i = dim THEN
  5220. Designate(expression,operand);
  5221. arrayDestinationTag := operand.tag;
  5222. ELSE (* open-static *)
  5223. type := expression.type.resolved;
  5224. descriptorType := GetMathArrayDescriptorType(dim);
  5225. (* static array -- untraced *)
  5226. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5227. Symbol(variable,variableOp);
  5228. arrayDestinationTag := variableOp.op;
  5229. Designate(expression,operand);
  5230. FOR i := 0 TO dim-1 DO
  5231. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5232. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5233. ReleaseOperand(tmpOperand);
  5234. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5235. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5236. ReleaseOperand(tmpOperand);
  5237. END;
  5238. dimOp := IntermediateCode.Immediate(addressType,dim);
  5239. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5240. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5241. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5242. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  5243. baseType := SemanticChecker.ArrayBase(type,dim);
  5244. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5245. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5246. END;
  5247. (* tensor alias to open array -- untraced *)
  5248. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5249. Symbol(variable,variableOp);
  5250. MakeMemory(tmp,variableOp.op,addressType,0);
  5251. Emit(Mov(position,tmp,arrayDestinationTag));
  5252. ReleaseIntermediateOperand(tmp);
  5253. Pass((variableOp.op));
  5254. ReleaseOperand(variableOp);
  5255. (* case 4d
  5256. P(...,T,...)
  5257. *)
  5258. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5259. Designate(expression,operand);
  5260. Pass((operand.op));
  5261. (* case 4f
  5262. P(...,S,...)
  5263. *)
  5264. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5265. descriptorType := GetMathArrayDescriptorType(dim);
  5266. (* static array -- cannot be reallocated, untraced *)
  5267. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5268. Symbol(variable,variableOp);
  5269. arrayDestinationTag := variableOp.op;
  5270. Designate(expression,operand);
  5271. FOR i := 0 TO dim-1 DO
  5272. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5273. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5274. ReleaseOperand(tmpOperand);
  5275. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5276. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5277. ReleaseOperand(tmpOperand);
  5278. END;
  5279. dimOp := IntermediateCode.Immediate(addressType,dim);
  5280. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5281. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5282. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5283. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5284. baseType := SemanticChecker.ArrayBase(type,dim);
  5285. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5286. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5287. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5288. Symbol(variable,variableOp);
  5289. MakeMemory(tmp,variableOp.op,addressType,0);
  5290. Emit(Mov(position,tmp,arrayDestinationTag));
  5291. ReleaseIntermediateOperand(tmp);
  5292. Pass((variableOp.op));
  5293. ReleaseOperand(variableOp);
  5294. ELSE HALT(100);
  5295. END;
  5296. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  5297. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  5298. Designate(expression,operand);
  5299. IF operand.op.type.length > 1 THEN
  5300. Emit(Push(position, operand.op));
  5301. ELSE
  5302. size := system.SizeOf(type);
  5303. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  5304. size := ToMemoryUnits(system,size);
  5305. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5306. arrayDestinationTag := sp;
  5307. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  5308. END;
  5309. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  5310. Designate(expression,operand);
  5311. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  5312. (* static array no pointer *)
  5313. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5314. Symbol(variable,variableOp);
  5315. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  5316. Emit(Mov(position,tmp,operand.op));
  5317. Emit(Push(position,variableOp.op));
  5318. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5319. Pass((operand.op));
  5320. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  5321. END;
  5322. ELSE HALT(200)
  5323. END;
  5324. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  5325. IF parameter.kind = SyntaxTree.VarParameter THEN
  5326. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  5327. Designate(expression, operand);
  5328. Pass((operand.op));
  5329. ELSE
  5330. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5331. Evaluate(expression, operand);
  5332. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  5333. Pass((operand.extra)); (* step *)
  5334. Pass((operand.tag)); (* last *)
  5335. Pass((operand.op)); (* first *)
  5336. ELSE
  5337. (* pass range as structure in order to comply with the variable alignment of its components *)
  5338. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5339. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  5340. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5341. tmp := sp;
  5342. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5343. Emit(Mov(position,tmp,operand.op)); (* first *)
  5344. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  5345. IntermediateCode.AddOffset(tmp,size);
  5346. Emit(Mov(position,tmp,operand.tag)); (* last *)
  5347. IntermediateCode.AddOffset(tmp,size);
  5348. Emit(Mov(position,tmp,operand.extra)); (* step *)
  5349. END;
  5350. END
  5351. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  5352. IF parameter.kind = SyntaxTree.VarParameter THEN
  5353. Designate(expression, operand);
  5354. Pass((operand.op));
  5355. ELSE
  5356. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5357. Evaluate(expression, operand);
  5358. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  5359. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  5360. Pass((operand.tag)); (* imaginary part *)
  5361. Pass((operand.op)) (* real part *)
  5362. ELSE
  5363. (* pass complex as structure in order to comply with the variable alignment of its components *)
  5364. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5365. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  5366. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5367. tmp := sp;
  5368. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5369. Emit(Mov(position,tmp,operand.op)); (* real part *)
  5370. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  5371. IntermediateCode.AddOffset(tmp,size);
  5372. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  5373. END
  5374. END
  5375. ELSE
  5376. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5377. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  5378. Designate(expression,operand);
  5379. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  5380. (* stack allocation *)
  5381. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  5382. (*! parameter alignment to be discussed ... *)
  5383. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  5384. size := type(SyntaxTree.StringType).length;
  5385. END;
  5386. IF backend.cooperative & parameter.NeedsTrace() THEN
  5387. dst := NewRegisterOperand (addressType);
  5388. Emit(Mov(position,dst, sp));
  5389. IntermediateCode.InitImmediate(null, byteType, 0);
  5390. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  5391. ReleaseIntermediateOperand(dst);
  5392. SaveRegisters();ReleaseUsedRegisters(saved);
  5393. (* register dst has been freed before SaveRegisters already *)
  5394. CallAssignMethod(dst, operand.op, parameter.type);
  5395. RestoreRegisters(saved);
  5396. END;
  5397. IF operand.op.type.length > 1 THEN (* vector *)
  5398. MakeMemory(tmp,sp,operand.op.type,0);
  5399. Emit(Mov(position, tmp, operand.op));
  5400. ELSE
  5401. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5402. END;
  5403. ELSIF IsOpenArray(parameter.type) THEN
  5404. Designate(expression,operand);
  5405. baseReg := operand.tag;
  5406. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5407. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5408. END;
  5409. Pass((operand.op)); (* address of the array *)
  5410. ELSIF IsDelegate(parameter.type) THEN
  5411. Evaluate(expression,operand);
  5412. IF backend.cooperative & parameter.NeedsTrace() THEN
  5413. Emit(Push(position, nil));
  5414. dst := NewRegisterOperand (addressType);
  5415. Emit(Mov(position,dst, sp));
  5416. ReleaseIntermediateOperand(dst);
  5417. SaveRegisters();ReleaseUsedRegisters(saved);
  5418. Emit(Push(position, dst));
  5419. (* register dst has been freed before SaveRegisters already *)
  5420. Emit(Push(position, operand.tag));
  5421. CallThis(position,"GarbageCollector","Assign",2);
  5422. RestoreRegisters(saved);
  5423. ELSE
  5424. Pass((operand.tag));
  5425. END;
  5426. Pass((operand.op));
  5427. ELSE
  5428. Evaluate(expression,operand);
  5429. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5430. Emit(Push(position, nil));
  5431. dst := NewRegisterOperand (addressType);
  5432. Emit(Mov(position,dst, sp));
  5433. ReleaseIntermediateOperand(dst);
  5434. SaveRegisters();ReleaseUsedRegisters(saved);
  5435. Emit(Push(position, dst));
  5436. (* register dst has been freed before SaveRegisters already *)
  5437. Emit(Push(position, operand.op));
  5438. CallThis(position,"GarbageCollector","Assign",2);
  5439. RestoreRegisters(saved);
  5440. ELSE
  5441. Pass((operand.op));
  5442. END;
  5443. END;
  5444. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5445. Evaluate(expression,operand);
  5446. Pass((operand.op));
  5447. ELSE (* var parameter *)
  5448. Designate(expression,operand);
  5449. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5450. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5451. Pass((operand.tag));
  5452. END;
  5453. END;
  5454. Pass((operand.op));
  5455. END;
  5456. END;
  5457. (* TODO: needed? *)
  5458. arrayDestinationTag := oldArrayDestinationTag;
  5459. arrayDestinationDimension := oldArrayDestinationDimension;
  5460. IF needsParameterBackup THEN
  5461. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5462. ReuseCopy(parameterBackup, operand.op)
  5463. END;
  5464. ReleaseOperand(operand);
  5465. IF Trace THEN TraceExit("PushParameter") END;
  5466. END PushParameter;
  5467. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5468. BEGIN
  5469. 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
  5470. Expression(x.result); (* use register *)
  5471. END;
  5472. Statement(x.statement);
  5473. IF x.result # NIL THEN Expression(x.result) END;
  5474. 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
  5475. ReleaseIntermediateOperand(result.op);
  5476. END;
  5477. END VisitStatementDesignator;
  5478. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5479. VAR
  5480. procedure: SyntaxTree.Procedure;
  5481. procedureType: SyntaxTree.ProcedureType;
  5482. wasInline: BOOLEAN;
  5483. actualParameters: SyntaxTree.ExpressionList;
  5484. formalParameter: SyntaxTree.Parameter;
  5485. actualParameter: SyntaxTree.Expression;
  5486. i: LONGINT;
  5487. localVariable: SyntaxTree.Variable;
  5488. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5489. src, dest: Operand;
  5490. prevInlineExit : Label;
  5491. prevMapper: SymbolMapper;
  5492. tooComplex: BOOLEAN;
  5493. resultDesignator: SyntaxTree.Expression;
  5494. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5495. BEGIN
  5496. IF e = NIL THEN RETURN TRUE
  5497. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5498. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5499. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5500. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5501. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5502. ELSE RETURN FALSE
  5503. END;
  5504. END SimpleExpression;
  5505. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5506. BEGIN
  5507. RETURN checker.CanPassInRegister(type)
  5508. END FitsInRegister;
  5509. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5510. VAR
  5511. variable: SyntaxTree.Variable;
  5512. variableDesignator: SyntaxTree.Designator;
  5513. BEGIN
  5514. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5515. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5516. variableDesignator.SetType(type);
  5517. RETURN variableDesignator
  5518. END GetTemp;
  5519. BEGIN
  5520. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5521. wasInline := currentIsInline;
  5522. prevInlineExit := currentInlineExit;
  5523. prevMapper := currentMapper;
  5524. currentInlineExit := NewLabel();
  5525. tooComplex := FALSE;
  5526. NEW(currentMapper);
  5527. currentIsInline := TRUE;
  5528. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5529. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5530. formalParameter := procedureType.firstParameter;
  5531. actualParameters := x.parameters;
  5532. i := 0;
  5533. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5534. actualParameter := actualParameters.GetExpression(i);
  5535. IF actualParameter.resolved # NIL THEN
  5536. actualParameter := actualParameter.resolved
  5537. END;
  5538. (*
  5539. if expression is simple and can be passed immediately
  5540. or if type fits in register then we can proceed
  5541. otherwise we escape to ordinary procedure call.
  5542. *)
  5543. (* cases where the expression can be mapped identically *)
  5544. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5545. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5546. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5547. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5548. (*
  5549. Assign(variableDesignator, actualParameter);
  5550. *)
  5551. Evaluate(actualParameter, src);
  5552. Designate(variableDesignator, dest);
  5553. Emit(Mov(x.position, dest.op, src.op));
  5554. ReleaseOperand(dest);
  5555. ReleaseOperand(src);
  5556. (* the src operand should now have been completely released ! *)
  5557. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5558. ELSE tooComplex := TRUE
  5559. END;
  5560. (*
  5561. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5562. currentMapper.Add(formalParameter, actualParameter, NIL);
  5563. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5564. variableDesignator := GetTemp(system.addressType, FALSE);
  5565. Designate(actualParameter, src);
  5566. Designate(variableDesignator, dest);
  5567. IntermediateCode.MakeMemory(dest.op,addressType);
  5568. Emit(Mov(x.position, dest.op, src.op));
  5569. ReleaseOperand(dest);
  5570. IF src.tag.mode # IntermediateCode.Undefined THEN
  5571. tagDesignator := GetTemp(system.addressType, FALSE);
  5572. Designate(tagDesignator, dest);
  5573. IntermediateCode.MakeMemory(dest.op,addressType);
  5574. Emit(Mov(x.position, dest.op, src.op));
  5575. END;
  5576. ReleaseOperand(dest); ReleaseOperand(src);
  5577. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5578. END;
  5579. *)
  5580. formalParameter := formalParameter.nextParameter;
  5581. INC(i);
  5582. END;
  5583. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5584. IF resultDesignator # NIL THEN
  5585. returnDesignator := resultDesignator
  5586. ELSE
  5587. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5588. END;
  5589. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5590. END;
  5591. localVariable := procedure.procedureScope.firstVariable;
  5592. WHILE ~tooComplex & (localVariable # NIL) DO
  5593. variableDesignator := GetTemp(localVariable.type, FALSE);
  5594. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5595. localVariable := localVariable.nextVariable;
  5596. END;
  5597. IF ~tooComplex THEN
  5598. VisitStatementBlock(procedure.procedureScope.body);
  5599. SetLabel(currentInlineExit);
  5600. IF procedureType.returnType # NIL THEN
  5601. Designate(returnDesignator, result);
  5602. END;
  5603. END;
  5604. currentMapper := prevMapper;
  5605. currentInlineExit := prevInlineExit;
  5606. currentIsInline := wasInline;
  5607. RETURN ~tooComplex
  5608. END InlineProcedureCall;
  5609. PROCEDURE VisitInlineCallDesignator*(x: SyntaxTree.InlineCallDesignator);
  5610. BEGIN
  5611. VisitStatementBlock(x.block);
  5612. END VisitInlineCallDesignator;
  5613. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5614. VAR
  5615. parameters: SyntaxTree.ExpressionList;
  5616. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5617. procedureType: SyntaxTree.ProcedureType;
  5618. formalParameter: SyntaxTree.Parameter;
  5619. operand: Operand;
  5620. reg, size, mask, dest: IntermediateCode.Operand;
  5621. saved,saved2: RegisterEntry;
  5622. symbol: SyntaxTree.Symbol;
  5623. variable: SyntaxTree.Variable;
  5624. i, parametersSize : LONGINT;
  5625. structuredReturnType: BOOLEAN;
  5626. gap, alignment: LONGINT; (*fld*)
  5627. return: IntermediateCode.Operand;
  5628. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5629. arg: IntermediateCode.Operand;
  5630. dummy: IntermediateCode.Operand;
  5631. recordType: SyntaxTree.RecordType;
  5632. operatorSelectionProcedureOperand: Operand;
  5633. operatorSelectionProcedure: SyntaxTree.Procedure;
  5634. fingerprint: SyntaxTree.Fingerprint;
  5635. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5636. identifierNumber: LONGINT;
  5637. parameterRegisters: SIZE;
  5638. registers: ARRAY 64 OF WORD;
  5639. procedure: SyntaxTree.Procedure;
  5640. callingConvention: SyntaxTree.CallingConvention;
  5641. type: IntermediateCode.Type;
  5642. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5643. (** do preparations before parameter push for array-structured object types (ASOTs):
  5644. if ASOT is passed as VAR parameter:
  5645. - allocate temporary variable of math array type
  5646. - copy contents of ASOT to be passed to temporary variable
  5647. - use temporary variable as the actual parameter instead
  5648. - 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)
  5649. **)
  5650. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5651. VAR
  5652. expression, left: SyntaxTree.Expression; tempVariableDesignator : SyntaxTree.Designator;
  5653. BEGIN
  5654. IF (formalParameter.kind = SyntaxTree.VarParameter) & SemanticChecker.IsIndexOperator(actualParameter) THEN
  5655. WITH actualParameter: SyntaxTree.ProcedureCallDesignator DO
  5656. (* prepare writeback for any other "normal" indexer *)
  5657. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5658. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5659. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5660. Assign(tempVariableDesignator, actualParameter);
  5661. IF firstWriteBackCall = NIL THEN
  5662. NEW(firstWriteBackCall);
  5663. currentWriteBackCall := firstWriteBackCall
  5664. ELSE
  5665. ASSERT(currentWriteBackCall # NIL);
  5666. NEW(currentWriteBackCall.next);
  5667. currentWriteBackCall := currentWriteBackCall.next
  5668. END;
  5669. (* a [^] . P[] ()*)
  5670. left := actualParameter.left; (* procedure call designator --> procedure call *)
  5671. left := left(SyntaxTree.Designator).left; (* procedure call --> caller object *)
  5672. IF left IS SyntaxTree.DereferenceDesignator THEN (* dereference, if required *)
  5673. left := left(SyntaxTree.Designator).left;
  5674. END;
  5675. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, left, 0, actualParameter.parameters, tempVariableDesignator);
  5676. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5677. END;
  5678. actualParameter := tempVariableDesignator;
  5679. END
  5680. END PrepareParameter;
  5681. BEGIN
  5682. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5683. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5684. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5685. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5686. IF InlineProcedureCall(x) THEN
  5687. RETURN
  5688. ELSE
  5689. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5690. END
  5691. END;
  5692. END;
  5693. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5694. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5695. callingConvention := procedureType.callingConvention;
  5696. dest := destination; destination := emptyOperand;
  5697. SaveRegisters();ReleaseUsedRegisters(saved);
  5698. parameters := x.parameters;
  5699. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5700. (* an operator is called *)
  5701. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5702. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5703. (* check if a dynamic operator call should be performed *)
  5704. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5705. ELSE
  5706. isCallOfDynamicOperator := FALSE
  5707. END;
  5708. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5709. Emit(Push(position, ap));
  5710. END;
  5711. alignment := procedureType.stackAlignment;
  5712. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5713. alignment := 16 (* bytes *);
  5714. END;
  5715. IF alignment > 1 THEN
  5716. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5717. Emit(Mov(position,reg, sp));
  5718. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5719. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5720. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5721. gap := 4*ToMemoryUnits(system,system.addressSize);
  5722. END;
  5723. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5724. backend.ResetParameterRegisters();
  5725. formalParameter := procedureType.firstParameter;
  5726. FOR i := 0 TO parameters.Length()-1 DO
  5727. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5728. type := addressType;
  5729. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5730. type := addressType;
  5731. ELSE
  5732. type := GetType(system, formalParameter.type);
  5733. END;
  5734. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5735. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5736. END;
  5737. formalParameter := formalParameter.nextParameter;
  5738. END;
  5739. IF gap < 0 THEN
  5740. gap := 0
  5741. END;
  5742. ELSE
  5743. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5744. END;
  5745. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5746. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5747. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5748. Emit(And(position,sp, sp, mask));
  5749. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5750. Emit(Push(position,reg));
  5751. ReleaseIntermediateOperand(reg);
  5752. END;
  5753. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5754. (* align stack to 16-byte boundary *)
  5755. IntermediateCode.InitImmediate(mask,addressType,-16);
  5756. Emit(And(position,sp, sp, mask));
  5757. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5758. IF gap # 0 THEN
  5759. IntermediateCode.InitImmediate(size,addressType,gap);
  5760. Emit(Sub(position,sp,sp,size))
  5761. END;
  5762. END;
  5763. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5764. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5765. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5766. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5767. ELSE
  5768. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5769. END;
  5770. IF procedureType.selfParameter # NIL THEN (* type bound procedure in a record *)
  5771. Designate(x.left(SyntaxTree.Designator).left, operand);
  5772. Emit(Push(position, operand.tag));
  5773. Emit(Push(position, operand.op));
  5774. Symbol(symbol, operand);
  5775. LoadValue(operand, symbol.type);
  5776. (*
  5777. PushParameter(x.left(SyntaxTree.Designator).left, procedureType.selfParameter, callingConvention, FALSE, dummy,-1);
  5778. Evaluate(x.left, operand);
  5779. *)
  5780. ELSE
  5781. Evaluate(x.left, operand);
  5782. IF symbol IS SyntaxTree.Procedure THEN
  5783. IF (procedureType.selfParameter # NIL) THEN
  5784. Emit(Push(position,operand.tag));
  5785. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5786. Emit(Push(position,operand.tag));
  5787. ELSIF (procedureType.isDelegate) THEN
  5788. Emit(Push(position,operand.tag));
  5789. END;
  5790. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5791. IF (procedureType.selfParameter # NIL) THEN
  5792. Emit(Push(position,operand.tag));
  5793. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5794. Emit(Push(position,operand.tag));
  5795. END;
  5796. ELSE HALT(200);
  5797. END;
  5798. END;
  5799. ReleaseIntermediateOperand(operand.tag);
  5800. operand.tag := emptyOperand;
  5801. (* determine if a structured return type is needed *)
  5802. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5803. IF structuredReturnType THEN
  5804. IF resultDesignator # NIL THEN
  5805. d := resultDesignator;
  5806. ELSE
  5807. (* temporary result that might be allocated, must potentially be traced *)
  5808. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5809. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5810. d.SetType(variable.type);
  5811. END;
  5812. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5813. Designate(d,returnValue);
  5814. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5815. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5816. Emit(Push(position,size));
  5817. Emit(Push(position,returnValue.op));
  5818. ReleaseOperand(returnValue);
  5819. ELSE*)
  5820. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5821. (*
  5822. END;
  5823. *)
  5824. END;
  5825. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5826. parameterRegisters := 0;
  5827. backend.ResetParameterRegisters();
  5828. formalParameter := procedureType.firstParameter;
  5829. FOR i := 0 TO parameters.Length()-1 DO
  5830. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5831. type := addressType;
  5832. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5833. type := addressType;
  5834. ELSE
  5835. type := GetType(system, formalParameter.type);
  5836. END;
  5837. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5838. INC(parameterRegisters);
  5839. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5840. Error(actualParameter.position,"cannot be passed by register")
  5841. END;
  5842. ELSE
  5843. registers[i] := -1;
  5844. END;
  5845. formalParameter := formalParameter.nextParameter;
  5846. END;
  5847. formalParameter := procedureType.lastParameter;
  5848. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5849. actualParameter := parameters.GetExpression(i);
  5850. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5851. formalParameter := formalParameter.prevParameter;
  5852. END;
  5853. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5854. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5855. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5856. END;
  5857. ELSE
  5858. hasDynamicOperands := FALSE;
  5859. formalParameter := procedureType.firstParameter;
  5860. FOR i := 0 TO parameters.Length() - 1 DO
  5861. actualParameter := parameters.GetExpression(i);
  5862. PrepareParameter(actualParameter, formalParameter);
  5863. IF formalParameter # NIL THEN (* TENTATIVE *)
  5864. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5865. ASSERT(i < 2);
  5866. hasDynamicOperands := TRUE;
  5867. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5868. ELSE
  5869. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5870. END;
  5871. formalParameter := formalParameter.nextParameter;
  5872. END;
  5873. END;
  5874. END;
  5875. IF symbol IS SyntaxTree.Procedure THEN
  5876. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5877. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5878. Emit(Push(position,reg));
  5879. ReleaseIntermediateOperand(reg);
  5880. END;
  5881. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5882. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5883. parametersSize := ParametersSize(system,procedureType, FALSE);
  5884. END;
  5885. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5886. (*
  5887. dynamic operator overloading:
  5888. first push parameters, regularly:
  5889. [self]
  5890. par1
  5891. par2
  5892. then push parameters for GetOperator
  5893. identifier
  5894. ptr1
  5895. tag
  5896. ptr2
  5897. tag
  5898. call GetOperatorRuntimeProc
  5899. call Operator
  5900. *)
  5901. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5902. (* push ID *)
  5903. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5904. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5905. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5906. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5907. formalParameter := procedureType.firstParameter;
  5908. FOR i := 0 TO parameters.Length() - 1 DO
  5909. IF formalParameter.access # SyntaxTree.Hidden THEN
  5910. ASSERT(i < 2);
  5911. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5912. (* push pointer *)
  5913. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5914. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5915. (* add dereference *)
  5916. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5917. (*! better: do refer to stack above than using parameter backups !!*)
  5918. ReleaseIntermediateOperand(parameterBackups[i]);
  5919. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5920. END;
  5921. Emit(Push(position,parameterBackups[i]));
  5922. ReleaseIntermediateOperand(parameterBackups[i]);
  5923. (* push typetag *)
  5924. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5925. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5926. arg := TypeDescriptorAdr(recordType);
  5927. Emit(Push(position,arg));
  5928. ELSE
  5929. (* push 'NonPointer' *)
  5930. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5931. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5932. (* push fingerprint *)
  5933. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5934. fingerprint := fingerprinter.TypeFP(formalParameter.type.resolved);
  5935. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerprint.public))) (* TODO: push the type's fingerprint *)
  5936. END
  5937. END;
  5938. formalParameter := formalParameter.nextParameter
  5939. END;
  5940. (* for unary operators: complete the information for the second parameter *)
  5941. IF procedureType.numberParameters < 2 THEN
  5942. (* push 'NonPointer' *)
  5943. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5944. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5945. (* push 'NoType' *)
  5946. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5947. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5948. END;
  5949. (* call operator selection procedure *)
  5950. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5951. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5952. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5953. ReleaseOperand(operatorSelectionProcedureOperand);
  5954. (* use the address that the operator selection procedure returned as the target address of the call *)
  5955. InitOperand(operand, ModeValue);
  5956. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5957. Emit(Result(position,operand.op))
  5958. END
  5959. END;
  5960. ReleaseParameterRegisters();
  5961. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5962. SaveRegisters();ReleaseUsedRegisters(saved2);
  5963. CallThis(position,"Objects","LeaveA2",0);
  5964. RestoreRegisters(saved2);
  5965. END;
  5966. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5967. Emit(Call(position,operand.op,0));
  5968. ELSE
  5969. Emit(Call(position,operand.op,parametersSize));
  5970. END;
  5971. ReleaseOperand(operand);
  5972. IF procedureType.noReturn THEN
  5973. EmitTrap(position,NoReturnTrap);
  5974. END;
  5975. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5976. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5977. Emit(Result(position,return));
  5978. END;
  5979. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5980. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5981. Emit(Push(position, return));
  5982. CallThis(position,"Objects","ReenterA2",0);
  5983. Emit(Pop(position, return));
  5984. ELSE
  5985. CallThis(position,"Objects","ReenterA2",0);
  5986. END;
  5987. END;
  5988. (* === return parameter space === *)
  5989. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5990. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5991. (* cleanup all space for all parameters *)
  5992. IF parametersSize < 32 THEN
  5993. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5994. parametersSize := 32
  5995. END;
  5996. size := IntermediateCode.Immediate(addressType,parametersSize);
  5997. Emit(Add(position,sp,sp,size))
  5998. END;
  5999. IF (callingConvention IN SysvABI) THEN
  6000. IF parameterRegisters > 0 THEN
  6001. IF parameters.Length() > parameterRegisters THEN
  6002. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  6003. ELSE
  6004. parametersSize := 0
  6005. END;
  6006. ELSE
  6007. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  6008. INC( parametersSize, (-parametersSize) MOD 16 )
  6009. END;
  6010. IF parametersSize > 0 THEN
  6011. size := IntermediateCode.Immediate(addressType,parametersSize);
  6012. Emit(Add(position,sp,sp,size))
  6013. END;
  6014. END;
  6015. IF alignment > 1 THEN
  6016. Emit(Pop(position,sp));
  6017. END;
  6018. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  6019. Emit(Pop(position, ap));
  6020. END;
  6021. IF firstWriteBackCall # NIL THEN
  6022. SaveRegisters(); ReleaseUsedRegisters(saved2);
  6023. (* perform all write-back calls in the list *)
  6024. currentWriteBackCall := firstWriteBackCall;
  6025. WHILE currentWriteBackCall # NIL DO
  6026. VisitProcedureCallDesignator(currentWriteBackCall.call);
  6027. currentWriteBackCall := currentWriteBackCall.next
  6028. END;
  6029. RestoreRegisters(saved2);
  6030. END;
  6031. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  6032. IF structuredReturnType THEN
  6033. RestoreRegisters(saved);
  6034. InitOperand(result,ModeReference);
  6035. Symbol(variable,result);
  6036. ELSE
  6037. RestoreRegisters(saved);
  6038. InitOperand(result,ModeValue);
  6039. result.op := return;
  6040. END;
  6041. END;
  6042. destination := dest;
  6043. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  6044. END VisitProcedureCallDesignator;
  6045. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  6046. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  6047. td: SyntaxTree.Symbol;
  6048. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  6049. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6050. BEGIN
  6051. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6052. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6053. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6054. variable.SetType(system.anyType);
  6055. scope.AddVariable(variable);
  6056. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6057. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  6058. typeDeclaration.SetDeclaredType(hiddenPointerType);
  6059. typeDeclaration.SetScope(module.module.moduleScope);
  6060. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  6061. hiddenPointerType.SetState(SyntaxTree.Resolved);
  6062. END;
  6063. RETURN hiddenPointerType;
  6064. END GetHiddenPointerType;
  6065. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  6066. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6067. BEGIN
  6068. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6069. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6070. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  6071. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  6072. scope.AddVariable(variable);
  6073. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6074. variable.SetType(system.anyType);
  6075. scope.AddVariable(variable);
  6076. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6077. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  6078. typeDeclaration.SetDeclaredType(delegatePointerType);
  6079. typeDeclaration.SetScope(module.module.moduleScope);
  6080. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  6081. delegatePointerType.SetState(SyntaxTree.Resolved);
  6082. END;
  6083. RETURN delegatePointerType
  6084. END GetDelegateType;
  6085. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  6086. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  6087. such as in VAR a: RECORD ... END;
  6088. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  6089. and variables, constants and procedures the same mechanism can be used for fixups etc.
  6090. *)
  6091. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  6092. baseRecord: SyntaxTree.RecordType;
  6093. BEGIN (* no code emission *)
  6094. source := NIL;
  6095. x := x.resolved;
  6096. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  6097. x := GetHiddenPointerType();
  6098. ELSIF IsDelegate(x) THEN
  6099. x := GetDelegateType();
  6100. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  6101. ELSE HALT(200);
  6102. END;
  6103. td := x.typeDeclaration;
  6104. IF td = NIL THEN
  6105. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  6106. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  6107. ASSERT(td # NIL);
  6108. END;
  6109. GetCodeSectionNameForSymbol(td,name);
  6110. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  6111. meta.CheckTypeDeclaration(x);
  6112. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  6113. ELSE
  6114. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  6115. END;
  6116. IF backend.cooperative OR meta.simple THEN
  6117. offset := 0;
  6118. ELSE
  6119. IF x IS SyntaxTree.CellType THEN
  6120. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  6121. IF baseRecord = NIL THEN
  6122. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  6123. ELSE
  6124. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  6125. END;
  6126. ELSE
  6127. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  6128. END;
  6129. END;
  6130. RETURN td
  6131. END GetBackendType;
  6132. BEGIN
  6133. (*td := t.typeDeclaration;*)
  6134. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  6135. (*
  6136. IF t IS SyntaxTree.PointerType THEN
  6137. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  6138. ELSE
  6139. source := GetBackendType(t);
  6140. END;
  6141. *)
  6142. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  6143. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  6144. IntermediateCode.SetOffset(res,offset);
  6145. (*
  6146. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  6147. make memory should be used when tag is used, not earlier
  6148. *)
  6149. RETURN res
  6150. END TypeDescriptorAdr;
  6151. (*
  6152. PROCEDURE MakeTypeTag(VAR operand: Operand);
  6153. VAR result: IntermediateCode.Operand;
  6154. BEGIN
  6155. IF operand.tag.mode = IntermediateCode.Undefined THEN
  6156. operand.tag := TypeDescriptorAdr(operand.type);
  6157. IntermediateCode.MakeMemory(operand.tag,addressType);
  6158. UseIntermediateOperand(operand.tag);
  6159. END;
  6160. END MakeTypeTag;
  6161. *)
  6162. PROCEDURE ProfilerInit;
  6163. VAR reg: IntermediateCode.Operand;
  6164. BEGIN
  6165. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  6166. Emit(Call(position,reg,0));
  6167. END ProfilerInit;
  6168. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  6169. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  6170. BEGIN
  6171. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  6172. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  6173. THEN
  6174. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6175. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6176. Emit(Push(position,reg));
  6177. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6178. Emit(Push(position,reg));
  6179. StaticCallOperand(result,procedure);
  6180. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6181. ReleaseOperand(result);
  6182. END;
  6183. END ProfilerEnterExit;
  6184. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  6185. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  6186. BEGIN
  6187. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  6188. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6189. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6190. profileInit.Emit(Push(position,reg));
  6191. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6192. profileInit.Emit(Push(position,reg));
  6193. NEW(string, LEN(name)); COPY(name, string^);
  6194. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6195. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6196. sv.SetType(type);
  6197. Designate(sv,result);
  6198. profileInit.Emit(Push(position,result.tag));
  6199. profileInit.Emit(Push(position,result.op));
  6200. StaticCallOperand(result,procedure);
  6201. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6202. ReleaseOperand(result);
  6203. END;
  6204. END ProfilerAddProcedure;
  6205. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  6206. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  6207. BEGIN
  6208. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  6209. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6210. profileInit.Emit(Push(position,reg));
  6211. profileInitPatchPosition := profileInit.pc;
  6212. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  6213. NEW(string, LEN(name)); COPY(name, string^);
  6214. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  6215. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6216. sv.SetType(type);
  6217. Designate(sv,result);
  6218. profileInit.Emit(Push(position,result.tag));
  6219. profileInit.Emit(Push(position,result.op));
  6220. StaticCallOperand(result,procedure);
  6221. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6222. ReleaseOperand(result);
  6223. END;
  6224. END ProfilerAddModule;
  6225. PROCEDURE ProfilerPatchInit;
  6226. VAR reg: IntermediateCode.Operand;
  6227. BEGIN
  6228. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  6229. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  6230. EmitLeave(profileInit,position,NIL,0);
  6231. profileInit.Emit(Exit(position,0,0,0));
  6232. END ProfilerPatchInit;
  6233. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  6234. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  6235. VAR
  6236. id: LONGINT;
  6237. leftType, rightType: SyntaxTree.Type;
  6238. procedureType: SyntaxTree.ProcedureType;
  6239. runtimeProcedure: SyntaxTree.Procedure;
  6240. runtimeProcedureOperand, operatorOperand: Operand;
  6241. kind: SET;
  6242. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  6243. VAR
  6244. arg: IntermediateCode.Operand;
  6245. recordType: SyntaxTree.RecordType;
  6246. fingerprint: SyntaxTree.Fingerprint;
  6247. BEGIN
  6248. IF type = NIL THEN
  6249. (* no type: push 'NoType' *)
  6250. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6251. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  6252. ELSIF IsStrictlyPointerToRecord(type) THEN
  6253. (* pointer to record type: push typetag *)
  6254. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6255. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6256. arg := TypeDescriptorAdr(recordType);
  6257. ELSE
  6258. (* non-pointer to record type: push fingerprint *)
  6259. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6260. fingerprint := fingerprinter.TypeFP(type.resolved);
  6261. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerprint.public)
  6262. END;
  6263. operatorInitializationCodeSection.Emit(Push(position,arg))
  6264. END PushTypeInfo;
  6265. BEGIN
  6266. ASSERT(operatorInitializationCodeSection # NIL);
  6267. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  6268. procedureType := operator.type(SyntaxTree.ProcedureType);
  6269. (* determine types *)
  6270. leftType := procedureType.firstParameter.type;
  6271. IF procedureType.numberParameters = 2 THEN
  6272. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  6273. rightType := procedureType.firstParameter.nextParameter.type;
  6274. ELSE
  6275. rightType := NIL
  6276. END;
  6277. (* determine operator kind *)
  6278. IF IsStrictlyPointerToRecord(leftType) THEN
  6279. kind := {LhsIsPointer}
  6280. ELSE
  6281. kind := {}
  6282. END;
  6283. IF IsStrictlyPointerToRecord(rightType) THEN
  6284. kind := kind + {RhsIsPointer}
  6285. END;
  6286. IF kind # {} THEN (* TODO: to be removed later on *)
  6287. (* at least one of the types is a pointer to record *)
  6288. (* emit a code that registers this specific operator in the runtime *)
  6289. dump := operatorInitializationCodeSection.comments;
  6290. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6291. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  6292. (* push ID *)
  6293. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6294. id := Global.GetSymbol(module.module.case, operator.name);
  6295. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  6296. (* push kind *)
  6297. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6298. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  6299. (* push type infos *)
  6300. PushTypeInfo(leftType);
  6301. PushTypeInfo(rightType);
  6302. (* push operator address *)
  6303. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6304. StaticCallOperand(operatorOperand, operator);
  6305. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  6306. ReleaseOperand(operatorOperand);
  6307. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  6308. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  6309. ReleaseOperand(runtimeProcedureOperand)
  6310. END
  6311. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  6312. END
  6313. END RegisterDynamicOperator;
  6314. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  6315. VAR
  6316. traceModule: SyntaxTree.Module;
  6317. procedure: SyntaxTree.Procedure;
  6318. procedureVariable: SyntaxTree.Variable;
  6319. s,msg: Basic.MessageString;
  6320. res: Operand;
  6321. i: LONGINT;
  6322. sv: SyntaxTree.StringValue;
  6323. type: SyntaxTree.Type;
  6324. recordType: SyntaxTree.RecordType;
  6325. printout: Printout.Printer;
  6326. stringWriter: Streams.StringWriter;
  6327. expression: SyntaxTree.Expression;
  6328. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  6329. BEGIN
  6330. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  6331. IF procedure = NIL THEN
  6332. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  6333. END;
  6334. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  6335. s := "procedure ";
  6336. Strings.Append(s,backend.traceModuleName);
  6337. Strings.Append(s,".");
  6338. Strings.Append(s,procedureName);
  6339. Strings.Append(s," not present");
  6340. Error(position,s);
  6341. RETURN FALSE
  6342. ELSE
  6343. RETURN TRUE
  6344. END;
  6345. END GetProcedure;
  6346. PROCEDURE CallProcedure;
  6347. VAR size: LONGINT;
  6348. BEGIN
  6349. IF procedure # NIL THEN
  6350. StaticCallOperand(result,procedure);
  6351. size := ProcParametersSize(procedure);
  6352. ELSE
  6353. Symbol(procedureVariable, result);
  6354. LoadValue(result, procedureVariable.type.resolved);
  6355. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6356. END;
  6357. Emit(Call(position,result.op,size));
  6358. END CallProcedure;
  6359. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6360. VAR res: Operand; string: SyntaxTree.String;
  6361. BEGIN
  6362. IF GetProcedure("String") THEN
  6363. NEW(string, LEN(s)); COPY(s, string^);
  6364. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6365. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6366. sv.SetType(type);
  6367. Designate(sv,res);
  6368. Emit(Push(position,res.tag));
  6369. Emit(Push(position,res.op));
  6370. ReleaseOperand(res);
  6371. CallProcedure;
  6372. END;
  6373. END String;
  6374. PROCEDURE Integer(op: IntermediateCode.Operand);
  6375. BEGIN
  6376. IF GetProcedure("Int") THEN
  6377. Emit(Push(position,op));
  6378. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6379. CallProcedure;
  6380. END;
  6381. END Integer;
  6382. PROCEDURE Float(op: IntermediateCode.Operand);
  6383. BEGIN
  6384. IF GetProcedure("HIntHex") THEN
  6385. Emit(Push(position,op));
  6386. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6387. CallProcedure;
  6388. END;
  6389. END Float;
  6390. PROCEDURE Set(op: IntermediateCode.Operand);
  6391. BEGIN
  6392. IF GetProcedure("Set") THEN
  6393. Emit(Push(position,op));
  6394. (*
  6395. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6396. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6397. *)
  6398. CallProcedure;
  6399. END;
  6400. END Set;
  6401. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6402. BEGIN
  6403. IF GetProcedure("Boolean") THEN
  6404. Emit(Push(position,op));
  6405. CallProcedure;
  6406. END;
  6407. END Boolean;
  6408. PROCEDURE Char(op: IntermediateCode.Operand);
  6409. BEGIN
  6410. IF GetProcedure("Char") THEN
  6411. Emit(Push(position,op));
  6412. CallProcedure;
  6413. END;
  6414. END Char;
  6415. PROCEDURE Address(op: IntermediateCode.Operand);
  6416. BEGIN
  6417. IF GetProcedure("Address") THEN
  6418. Emit(Push(position,op));
  6419. CallProcedure;
  6420. END;
  6421. END Address;
  6422. PROCEDURE Size(op: IntermediateCode.Operand);
  6423. BEGIN
  6424. IF GetProcedure("Size") THEN
  6425. Emit(Push(position,op));
  6426. CallProcedure;
  6427. END;
  6428. END Size;
  6429. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6430. VAR len: IntermediateCode.Operand;
  6431. BEGIN
  6432. IF GetProcedure("String") THEN
  6433. len := GetArrayLength(type, op.tag);
  6434. Emit(Push(position,len));
  6435. ReleaseIntermediateOperand(len);
  6436. Emit(Push(position,op.op));
  6437. CallProcedure;
  6438. END;
  6439. END StringOperand;
  6440. PROCEDURE Ln;
  6441. BEGIN
  6442. IF GetProcedure("Ln") THEN
  6443. CallProcedure;
  6444. END;
  6445. END Ln;
  6446. BEGIN
  6447. IF backend.traceModuleName = "" THEN RETURN END;
  6448. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6449. IF GetProcedure("Enter") THEN
  6450. CallProcedure
  6451. END;
  6452. NEW(stringWriter,LEN(s));
  6453. FOR i := 0 TO x.Length()-1 DO
  6454. msg := "";
  6455. expression := x.GetExpression(i);
  6456. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6457. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6458. ELSE
  6459. Global.GetModuleName(module.module, s);
  6460. END;
  6461. IF i = 0 THEN
  6462. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6463. stringWriter.String(":");
  6464. END;
  6465. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6466. IF ~(expression IS SyntaxTree.StringValue) THEN
  6467. printout.Expression(expression);
  6468. stringWriter.Get(s);
  6469. Strings.Append(msg,s);
  6470. Strings.Append(msg,"= ");
  6471. ELSE stringWriter.Get(s); (* remove from string writer *)
  6472. Strings.Append(msg, s);
  6473. END;
  6474. String(msg);
  6475. IF SemanticChecker.IsStringType(expression.type) THEN
  6476. Designate(expression,res);
  6477. StringOperand(res, expression.type);
  6478. ELSE
  6479. Evaluate(expression,res);
  6480. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6481. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6482. Convert(res.op,int64);
  6483. END;
  6484. Integer(res.op);
  6485. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6486. Boolean(res.op);
  6487. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6488. Set(res.op);
  6489. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6490. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6491. Convert(res.op,float64);
  6492. END;
  6493. Float(res.op);
  6494. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6495. Char(res.op);
  6496. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6497. Address(res.op);String("H");
  6498. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6499. Size(res.op);
  6500. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6501. Address(res.op);String("H");
  6502. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6503. Address(res.op);String("H");
  6504. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6505. String("NIL");
  6506. ELSE HALT(200);
  6507. END;
  6508. END;
  6509. ReleaseOperand(res);
  6510. String("; ");
  6511. END;
  6512. IF GetProcedure("Exit") THEN
  6513. CallProcedure
  6514. ELSE
  6515. Ln;
  6516. END;
  6517. END;
  6518. END SystemTrace;
  6519. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6520. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6521. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6522. BEGIN
  6523. type := type.resolved;
  6524. IF type IS SyntaxTree.RecordType THEN
  6525. WITH type: SyntaxTree.RecordType DO
  6526. baseType := type.baseType;
  6527. IF baseType # NIL THEN
  6528. baseType := baseType.resolved;
  6529. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6530. InitFields(baseType,adr,offset);
  6531. END;
  6532. variable := type.recordScope.firstVariable;
  6533. WHILE variable # NIL DO
  6534. IF variable.initializer # NIL THEN
  6535. Evaluate(variable.initializer,initializerOp);
  6536. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6537. Emit(Mov(position,mem,initializerOp.op));
  6538. ReleaseOperand(initializerOp);
  6539. ReleaseIntermediateOperand(mem);
  6540. END;
  6541. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6542. variable := variable.nextVariable
  6543. END;
  6544. END;
  6545. ELSIF type IS SyntaxTree.CellType THEN
  6546. WITH type: SyntaxTree.CellType DO
  6547. baseType := type.baseType;
  6548. IF baseType # NIL THEN
  6549. baseType := baseType.resolved;
  6550. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6551. InitFields(baseType,adr,offset);
  6552. END;
  6553. variable := type.cellScope.firstVariable;
  6554. WHILE variable # NIL DO
  6555. IF variable.initializer # NIL THEN
  6556. Evaluate(variable.initializer,initializerOp);
  6557. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6558. Emit(Mov(position,mem,initializerOp.op));
  6559. ReleaseOperand(initializerOp);
  6560. ReleaseIntermediateOperand(mem);
  6561. END;
  6562. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6563. variable := variable.nextVariable
  6564. END;
  6565. END;
  6566. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6567. WITH type: SyntaxTree.ArrayType DO
  6568. IF type.form = SyntaxTree.Static THEN
  6569. baseType := type.arrayBase;
  6570. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6571. FOR i := 0 TO type.staticLength-1 DO
  6572. InitFields(baseType,adr,offset+i*size);
  6573. END;
  6574. END;
  6575. END;
  6576. ELSIF type IS SyntaxTree.MathArrayType THEN
  6577. WITH type: SyntaxTree.MathArrayType DO
  6578. IF type.form = SyntaxTree.Open THEN
  6579. dim := DynamicDim(type);
  6580. imm := IntermediateCode.Immediate(addressType,dim);
  6581. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6582. baseType := SemanticChecker.ArrayBase(type,dim);
  6583. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6584. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6585. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6586. ReleaseIntermediateOperand(imm);
  6587. (* flags remain empty (=0) for open array *)
  6588. ELSIF type.form = SyntaxTree.Static THEN
  6589. baseType := type.arrayBase;
  6590. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6591. ASSERT(type.staticLength < 1024*1024*1024);
  6592. FOR i := 0 TO type.staticLength-1 DO
  6593. InitFields(baseType,adr,offset+i*size);
  6594. END;
  6595. END;
  6596. END;
  6597. END;
  6598. END InitFields;
  6599. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6600. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6601. saved: RegisterEntry;
  6602. BEGIN
  6603. type := variable.type.resolved;
  6604. IF (type IS SyntaxTree.MathArrayType) THEN
  6605. WITH type: SyntaxTree.MathArrayType DO
  6606. IF type.form = SyntaxTree.Open THEN
  6607. Symbol(variable,operand);
  6608. InitFields(type, operand.tag,0);
  6609. IF temporary THEN
  6610. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6611. END;
  6612. ELSIF type.form = SyntaxTree.Tensor THEN
  6613. IF temporary & backend.writeBarriers THEN
  6614. SaveRegisters();ReleaseUsedRegisters(saved);
  6615. Symbol(variable, operand);
  6616. Emit(Push(position,operand.op));
  6617. ReleaseOperand(operand);
  6618. Emit(Push(position,nil));
  6619. CallThis(position,"FoxArrayBase","Assign",2);
  6620. RestoreRegisters(saved);
  6621. ELSE
  6622. Symbol(variable, operand);
  6623. MakeMemory(tmp,operand.op,addressType,0);
  6624. ReleaseOperand(operand);
  6625. IF FALSE & temporary THEN
  6626. (* trick -- temporary object from array base *)
  6627. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6628. Symbol(symbol,operand);
  6629. MakeMemory(mem,operand.op,addressType,0);
  6630. ReleaseOperand(operand);
  6631. Emit(Mov(position,tmp, mem) );
  6632. ReleaseOperand(operand);
  6633. ELSE
  6634. Emit(Mov(position,tmp, nil ) );
  6635. END;
  6636. ReleaseIntermediateOperand(tmp)
  6637. END;
  6638. END;
  6639. END;
  6640. ELSE
  6641. Symbol(variable,operand);
  6642. IF variable.initializer # NIL THEN
  6643. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6644. reference.SetType(variable.type.resolved);
  6645. reference.SetAssignable(TRUE);
  6646. Assign(reference,variable.initializer);
  6647. ELSIF temporary THEN
  6648. IF SemanticChecker.IsPointerType(variable.type) THEN
  6649. IF backend.cooperative THEN
  6650. SaveRegisters();ReleaseUsedRegisters(saved);
  6651. Symbol(variable, operand);
  6652. CallAssignPointer(operand.op, nil);
  6653. ReleaseOperand(operand);
  6654. RestoreRegisters(saved);
  6655. ELSIF backend.writeBarriers THEN
  6656. SaveRegisters();ReleaseUsedRegisters(saved);
  6657. Symbol(variable, operand);
  6658. Emit(Push(position,operand.op));
  6659. ReleaseOperand(operand);
  6660. Emit(Push(position,nil));
  6661. CallThis(position,"Heaps","Assign",2);
  6662. RestoreRegisters(saved);
  6663. ELSE
  6664. Symbol(variable, operand);
  6665. MakeMemory(tmp,operand.op,addressType,0);
  6666. ReleaseOperand(operand);
  6667. Emit(Mov(position,tmp, nil ) );
  6668. ReleaseIntermediateOperand(tmp);
  6669. END;
  6670. END;
  6671. END;
  6672. InitFields(type, operand.op,0);
  6673. ReleaseOperand(operand);
  6674. END;
  6675. END InitVariable;
  6676. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6677. VAR end: Label;
  6678. BEGIN
  6679. IF type.form = SyntaxTree.Tensor THEN
  6680. InitOperand(result,ModeValue);
  6681. ReuseCopy(result.op,base);
  6682. end := NewLabel();
  6683. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6684. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6685. SetLabel(end);
  6686. Convert(result.op,lenType);
  6687. ELSE
  6688. InitOperand(result,ModeValue);
  6689. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6690. END
  6691. END MathArrayDim;
  6692. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6693. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6694. BEGIN
  6695. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6696. MakeMemory(mem,base,addressType,offset);
  6697. Emit(Mov(position,mem,value));
  6698. ReleaseIntermediateOperand(mem);
  6699. END PutMathArrayField;
  6700. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6701. VAR mem: IntermediateCode.Operand;
  6702. BEGIN
  6703. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6704. MakeMemory(mem,base,addressType,offset);
  6705. Emit(Mov(position,mem,value));
  6706. ReleaseIntermediateOperand(mem);
  6707. END PutMathArrayFieldOffset;
  6708. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6709. BEGIN
  6710. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6711. MakeMemory(value,base,addressType,offset);
  6712. END GetMathArrayField;
  6713. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6714. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6715. BEGIN
  6716. IF incr THEN
  6717. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6718. ELSE
  6719. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6720. END;
  6721. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6722. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6723. ELSE
  6724. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6725. Emit(Mov(position,reg,dim));
  6726. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6727. Emit(Add(position,reg,reg,base));
  6728. MakeMemory(mem, reg, addressType, offset);
  6729. ReleaseIntermediateOperand(reg);
  6730. Emit(Mov(position,mem,value));
  6731. ReleaseIntermediateOperand(mem);
  6732. END;
  6733. END PutMathArrayLenOrIncr;
  6734. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6735. BEGIN
  6736. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6737. END PutMathArrayLength;
  6738. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6739. BEGIN
  6740. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6741. END PutMathArrayIncrement;
  6742. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6743. BEGIN
  6744. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6745. END GetMathArrayIncrement;
  6746. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6747. BEGIN
  6748. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6749. END GetMathArrayLength;
  6750. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6751. VAR dimOp: IntermediateCode.Operand;
  6752. BEGIN
  6753. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6754. GetMathArrayLength(type, operand, dimOp, check, result);
  6755. END GetMathArrayLengthAt;
  6756. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6757. VAR dimOp: IntermediateCode.Operand;
  6758. BEGIN
  6759. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6760. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6761. END GetMathArrayIncrementAt;
  6762. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6763. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6764. offset: LONGINT;
  6765. BEGIN
  6766. IF increment THEN
  6767. offset := MathIncrOffset;
  6768. ELSE
  6769. offset := MathLenOffset;
  6770. END;
  6771. INC(offset,operand.dimOffset*2);
  6772. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6773. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6774. END;
  6775. (* static dimension *)
  6776. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6777. IF check & (type.form = SyntaxTree.Tensor) THEN
  6778. DimensionCheck(operand.tag,dim,BrltL);
  6779. END;
  6780. val := SHORT(dim.intValue);
  6781. IF type.form # SyntaxTree.Tensor THEN
  6782. t := SemanticChecker.ArrayBase(type,val);
  6783. type := t.resolved(SyntaxTree.MathArrayType);
  6784. IF type.form = SyntaxTree.Static THEN
  6785. IF increment THEN
  6786. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6787. ELSE
  6788. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6789. END;
  6790. InitOperand(result,ModeValue);
  6791. result.op := res;
  6792. RETURN;
  6793. END;
  6794. END;
  6795. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6796. MakeMemory(res,operand.tag,addressType,offset);
  6797. (*
  6798. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6799. *)
  6800. InitOperand(result,ModeValue);
  6801. result.op := res;
  6802. ELSE
  6803. Convert(dim,addressType);
  6804. IF check THEN
  6805. IF type.form = SyntaxTree.Tensor THEN
  6806. DimensionCheck(operand.tag,dim,BrltL);
  6807. ELSIF isUnchecked THEN (* do nothing *)
  6808. ELSE
  6809. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6810. END;
  6811. END;
  6812. end := NewLabel(); next := NIL;
  6813. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6814. Emit(Mov(position,res,dim));
  6815. Convert(res,sizeType);
  6816. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6817. WHILE t IS SyntaxTree.MathArrayType DO
  6818. type := t(SyntaxTree.MathArrayType);
  6819. IF type.form = SyntaxTree.Static THEN
  6820. imm := IntermediateCode.Immediate(sizeType,val);
  6821. next := NewLabel();
  6822. BrneL(next,imm,res);
  6823. IF increment THEN
  6824. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6825. ELSE
  6826. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6827. END;
  6828. Emit(MovReplace(position,res,imm));
  6829. BrL(end);
  6830. ELSE hasDynamicPart := TRUE;
  6831. END;
  6832. t := type.arrayBase.resolved;
  6833. val := val + 1;
  6834. IF next # NIL THEN SetLabel(next) END;
  6835. END;
  6836. IF hasDynamicPart THEN
  6837. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6838. Emit(Mov(position,res2,dim));
  6839. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6840. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6841. Emit(Add(position,res2,res2,imm));
  6842. Emit(Add(position,res2,res2,operand.tag));
  6843. IntermediateCode.MakeMemory(res2,sizeType);
  6844. Emit(MovReplace(position,res,res2));
  6845. ReleaseIntermediateOperand(res2);
  6846. END;
  6847. SetLabel(end);
  6848. Convert(res,sizeType);
  6849. InitOperand(result,ModeValue);
  6850. result.op := res;
  6851. END;
  6852. END MathArrayLenOrIncr;
  6853. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6854. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6855. offset: LONGINT;
  6856. BEGIN
  6857. offset := operand.dimOffset+DynamicDim(type)-1;
  6858. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6859. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6860. val := SHORT(dim.intValue);
  6861. t := SemanticChecker.ArrayBase(type,val);
  6862. type := t.resolved(SyntaxTree.ArrayType);
  6863. IF type.form = SyntaxTree.Static THEN
  6864. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6865. ELSE
  6866. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6867. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6868. END;
  6869. UseIntermediateOperand(res);
  6870. InitOperand(result,ModeValue);
  6871. result.op := res;
  6872. ELSE
  6873. Convert(dim,addressType);
  6874. IF ~isUnchecked THEN
  6875. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6876. END;
  6877. end := NewLabel(); next := NIL;
  6878. (* ReuseCopy(dim,res); *)
  6879. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6880. Emit(Mov(position,res,dim));
  6881. Convert(res,sizeType);
  6882. Convert(res,sizeType);
  6883. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6884. WHILE t IS SyntaxTree.ArrayType DO
  6885. type := t(SyntaxTree.ArrayType);
  6886. IF type.form = SyntaxTree.Static THEN
  6887. imm := IntermediateCode.Immediate(sizeType,val);
  6888. next := NewLabel();
  6889. BrneL(next,imm,res);
  6890. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6891. Emit(MovReplace(position,res,imm));
  6892. BrL(end);
  6893. ELSE hasDynamicPart := TRUE;
  6894. END;
  6895. t := type.arrayBase.resolved;
  6896. val := val + 1;
  6897. IF next # NIL THEN SetLabel(next) END;
  6898. END;
  6899. IF hasDynamicPart THEN
  6900. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6901. Convert(res2,addressType);
  6902. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6903. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6904. Emit(Sub(position,res2,imm,res2));
  6905. Emit(Add(position,res2,res2,operand.tag));
  6906. IntermediateCode.MakeMemory(res2,sizeType);
  6907. Emit(MovReplace(position,res,res2));
  6908. ReleaseIntermediateOperand(res2);
  6909. END;
  6910. SetLabel(end);
  6911. Convert(res,sizeType);
  6912. InitOperand(result,ModeValue);
  6913. result.op := res;
  6914. END;
  6915. END ArrayLen;
  6916. (**
  6917. create a temporary variable in current scope
  6918. **)
  6919. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6920. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6921. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6922. BEGIN
  6923. IF ~register THEN
  6924. v := temporaries.GetFreeVariable(type, untraced, index);
  6925. ELSE
  6926. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6927. END;
  6928. scope := currentScope;
  6929. IF (scope IS SyntaxTree.ProcedureScope) & (scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).noPAF) THEN
  6930. Error(scope(SyntaxTree.ProcedureScope).ownerProcedure.position,"implementation restriction: cannot allocate temporary variable in procedure without activation frame");
  6931. END;
  6932. (*
  6933. v := NIL; (* disable free variable managemenet for the time being *)
  6934. *)
  6935. name := temporaries.GetUID();
  6936. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6937. variable.SetType(type);
  6938. variable.SetAccess(SyntaxTree.Hidden);
  6939. variable.SetUntraced(untraced);
  6940. IF v = NIL THEN
  6941. temporaries.AddVariable(variable);
  6942. IF ~register THEN
  6943. IF scope.lastVariable # NIL THEN
  6944. offset := scope.lastVariable.offsetInBits;
  6945. ELSE
  6946. offset := 0;
  6947. END;
  6948. DEC(offset,system.SizeOf(variable.type));
  6949. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6950. variable(SyntaxTree.Variable).SetOffset(offset);
  6951. scope.AddVariable(variable(SyntaxTree.Variable));
  6952. scope.EnterSymbol(variable, duplicate);
  6953. ASSERT(~duplicate);
  6954. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6955. ELSE
  6956. variable.SetUseRegister(TRUE);
  6957. variable(SyntaxTree.Variable).SetOffset(0);
  6958. END;
  6959. ELSE (* v # NIL *)
  6960. (* reuse slot for new variable, do not create new slot ! *)
  6961. temporaries.SetVariable(index, variable);
  6962. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6963. ASSERT(~register);
  6964. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6965. ASSERT(v.offsetInBits # 0);
  6966. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6967. scope.EnterSymbol(variable, duplicate);
  6968. ASSERT(~duplicate);
  6969. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6970. END;
  6971. RETURN variable(SyntaxTree.Variable)
  6972. END GetTemporaryVariable;
  6973. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6974. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6975. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6976. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6977. i: LONGINT; duplicate: BOOLEAN;
  6978. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6979. VAR variable: SyntaxTree.Variable;
  6980. BEGIN
  6981. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6982. variable.SetType(type);
  6983. recordScope.AddVariable(variable);
  6984. END AddVariable;
  6985. BEGIN
  6986. name := "@ArrayDescriptor";
  6987. Basic.AppendNumber(name,dimensions);
  6988. identifier := SyntaxTree.NewIdentifier(name);
  6989. parentScope := module.module.moduleScope;
  6990. symbol := parentScope.FindSymbol(identifier);
  6991. IF symbol # NIL THEN
  6992. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6993. type := typeDeclaration.declaredType;
  6994. ELSE
  6995. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6996. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6997. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6998. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6999. recordType.SetTypeDeclaration(typeDeclaration);
  7000. recordType.SetState(SyntaxTree.Resolved);
  7001. typeDeclaration.SetDeclaredType(recordType);
  7002. AddVariable("@ptr",system.anyType);
  7003. AddVariable("@adr",system.addressType);
  7004. AddVariable("@flags",system.addressType);
  7005. AddVariable("@dim",system.addressType);
  7006. AddVariable("@elementSize",system.addressType);
  7007. FOR i := 0 TO dimensions-1 DO
  7008. name := "@len";
  7009. Basic.AppendNumber(name,i);
  7010. AddVariable(name,system.addressType);
  7011. name := "@incr";
  7012. Basic.AppendNumber(name,i);
  7013. AddVariable(name,system.addressType);
  7014. END;
  7015. parentScope.AddTypeDeclaration(typeDeclaration);
  7016. parentScope.EnterSymbol(typeDeclaration,duplicate);
  7017. ASSERT(~duplicate);
  7018. type := recordType;
  7019. END;
  7020. RETURN type
  7021. END GetMathArrayDescriptorType;
  7022. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  7023. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  7024. BEGIN
  7025. NEW(string, LEN(s)); COPY(s, string^);
  7026. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  7027. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  7028. sv.SetType(type);
  7029. Designate(sv,res);
  7030. Emit(Push(position,res.tag));
  7031. Emit(Push(position,res.op));
  7032. ReleaseOperand(res);
  7033. END PushConstString;
  7034. PROCEDURE PushConstBoolean(b: BOOLEAN);
  7035. BEGIN
  7036. IF b THEN
  7037. Emit(Push(Basic.invalidPosition, true));
  7038. ELSE
  7039. Emit(Push(Basic.invalidPosition, false));
  7040. END;
  7041. END PushConstBoolean;
  7042. PROCEDURE PushConstSet(v: SET);
  7043. VAR value: SyntaxTree.Value; op: Operand;
  7044. BEGIN
  7045. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  7046. value.SetType(system.setType);
  7047. Evaluate(value, op);
  7048. Emit(Push(Basic.invalidPosition, op.op));
  7049. ReleaseOperand(op);
  7050. END PushConstSet;
  7051. PROCEDURE PushConstInteger(v: LONGINT);
  7052. VAR value: SyntaxTree.Value; op: Operand;
  7053. BEGIN
  7054. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  7055. value.SetType(system.longintType);
  7056. Evaluate(value, op);
  7057. Emit(Push(Basic.invalidPosition, op.op));
  7058. ReleaseOperand(op);
  7059. END PushConstInteger;
  7060. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  7061. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  7062. section: IntermediateCode.Section;
  7063. BEGIN
  7064. procedureScope := SyntaxTree.NewProcedureScope(scope);
  7065. Global.GetSymbolSegmentedName(symbol, name);
  7066. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  7067. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  7068. procedure.SetScope(moduleScope);
  7069. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  7070. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  7071. procedure.SetAccess(SyntaxTree.Hidden);
  7072. currentScope := procedureScope;
  7073. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  7074. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  7075. RETURN section;
  7076. END OpenInitializer;
  7077. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  7078. BEGIN
  7079. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  7080. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  7081. section := prev;
  7082. END CloseInitializer;
  7083. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  7084. VAR name: SyntaxTree.IdentifierString;
  7085. parameter: SyntaxTree.Parameter;
  7086. type: SyntaxTree.Type;
  7087. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  7088. BEGIN
  7089. InitOperand(op,ModeReference);
  7090. op.op := fp;
  7091. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  7092. Dereference(op, x, FALSE);
  7093. result := op;
  7094. Symbol(symbol, op);
  7095. END Field;
  7096. PROCEDURE Direction(direction: LONGINT): SET;
  7097. BEGIN
  7098. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  7099. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  7100. ELSE HALT(100);
  7101. END;
  7102. END Direction;
  7103. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7104. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7105. BEGIN
  7106. Field(port, op);
  7107. ToMemory(op.op,addressType,0);
  7108. Emit(Push(Basic.invalidPosition, op.op));
  7109. ReleaseOperand(op);
  7110. Basic.GetString(modifier.identifier, name);
  7111. PushConstString(name);
  7112. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7113. ASSERT(SemanticChecker.IsStringType(value.type));
  7114. Designate(value, op);
  7115. Emit(Push(modifier.position, op.tag));
  7116. Emit(Push(modifier.position, op.op));
  7117. ReleaseOperand(op);
  7118. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  7119. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7120. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7121. Evaluate(value, op);
  7122. Emit(Push(modifier.position, op.op));
  7123. ReleaseOperand(op);
  7124. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  7125. ELSE
  7126. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  7127. END;
  7128. END AddPortProperty;
  7129. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  7130. VAR modifier: SyntaxTree.Modifier;
  7131. BEGIN
  7132. modifier := parameter.modifiers;
  7133. WHILE modifier # NIL DO
  7134. AddPortProperty(parameter,modifier, modifier.expression);
  7135. modifier := modifier.nextModifier;
  7136. END;
  7137. END AddPortProperties;
  7138. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  7139. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  7140. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  7141. PROCEDURE PushLens(type: SyntaxTree.Type);
  7142. BEGIN
  7143. IF IsSemiDynamicArray(type) THEN
  7144. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7145. Evaluate(type(SyntaxTree.ArrayType).length, op);
  7146. Emit(Push(Basic.invalidPosition, op.op));
  7147. ReleaseOperand(op);
  7148. INC(dim);
  7149. ELSIF IsStaticArray(type) THEN
  7150. len := len * type(SyntaxTree.ArrayType).staticLength;
  7151. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7152. INC(dim);
  7153. ELSE
  7154. baseType := type;
  7155. END;
  7156. END PushLens;
  7157. BEGIN
  7158. (* cell *)
  7159. IF parameter.type IS SyntaxTree.ArrayType THEN
  7160. type := parameter.type;
  7161. dim := 0;
  7162. len := 1;
  7163. PushLens(type);
  7164. portType := baseType.resolved(SyntaxTree.PortType);
  7165. ELSE
  7166. portType := parameter.type(SyntaxTree.PortType);
  7167. END;
  7168. PushSelfPointer();
  7169. (* port / array of ports *)
  7170. IF IsStaticArray(type) THEN
  7171. PushConstInteger(len);
  7172. END;
  7173. Field(parameter, op);
  7174. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7175. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  7176. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  7177. Designate(d, op);*)
  7178. Emit(Push(Basic.invalidPosition, op.op));
  7179. ReleaseOperand(op);
  7180. (* name *)
  7181. PushConstString(name);
  7182. (* inout *)
  7183. PushConstSet(Direction(portType.direction));
  7184. (* width *)
  7185. PushConstInteger(portType.sizeInBits);
  7186. IF parameter.type IS SyntaxTree.PortType THEN
  7187. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  7188. AddPortProperties(parameter);
  7189. ELSIF IsStaticArray(type)THEN
  7190. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  7191. ELSIF IsSemiDynamicArray(type) THEN
  7192. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7193. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  7194. Emit(Add(position,reg, sp, size));
  7195. (* dim *)
  7196. PushConstInteger(dim);
  7197. (* len array *)
  7198. Emit(Push(position, reg));
  7199. ReleaseIntermediateOperand(reg);
  7200. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  7201. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  7202. Emit(Add(position, sp,sp, size));
  7203. ELSE
  7204. HALT(100);
  7205. END;
  7206. END Parameter;
  7207. BEGIN
  7208. IF backend.cellsAreObjects THEN
  7209. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  7210. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  7211. END;
  7212. parameter := x.firstParameter;
  7213. WHILE (parameter # NIL) DO
  7214. type := parameter.type.resolved;
  7215. WHILE (type IS SyntaxTree.ArrayType) DO
  7216. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7217. END;
  7218. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  7219. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  7220. Parameter(name,parameter);
  7221. END;
  7222. parameter := parameter.nextParameter;
  7223. END;
  7224. ELSE HALT(200)
  7225. END;
  7226. END AddPorts;
  7227. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  7228. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  7229. BEGIN
  7230. Symbol(cell,op);
  7231. ToMemory(op.op,addressType,0);
  7232. Emit(Push(position,op.op));
  7233. ReleaseOperand(op);
  7234. property.GetName(name);
  7235. (* does not work when inheritance is used:
  7236. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  7237. *)
  7238. PushConstString(name);
  7239. IF (value # NIL) THEN
  7240. ASSERT(
  7241. SemanticChecker.IsStringType(property.type)
  7242. OR (property.type.resolved IS SyntaxTree.IntegerType)
  7243. OR (property.type.resolved IS SyntaxTree.FloatType)
  7244. OR (property.type.resolved IS SyntaxTree.BooleanType)
  7245. OR (property.type.resolved IS SyntaxTree.SetType)
  7246. );
  7247. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7248. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  7249. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  7250. Designate(d, op);
  7251. IF SemanticChecker.IsStringType(property.type) THEN
  7252. Emit(Push(Basic.invalidPosition, op.tag))
  7253. END;
  7254. Emit(Push(Basic.invalidPosition, op.op));
  7255. ReleaseOperand(op);
  7256. END;
  7257. IF value = NIL THEN
  7258. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  7259. ELSIF SemanticChecker.IsStringType(property.type) THEN
  7260. ASSERT(SemanticChecker.IsStringType(value.type));
  7261. Designate(value, op);
  7262. PushString(op, value.type);
  7263. ReleaseOperand(op);
  7264. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  7265. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  7266. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7267. Evaluate(value, op);
  7268. Emit(Push(property.position, op.op));
  7269. ReleaseOperand(op);
  7270. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  7271. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  7272. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  7273. Evaluate(value, op);
  7274. Emit(Push(property.position, op.op));
  7275. ReleaseOperand(op);
  7276. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  7277. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  7278. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  7279. Evaluate(value, op);
  7280. Emit(Push(property.position, op.op));
  7281. ReleaseOperand(op);
  7282. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  7283. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  7284. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  7285. Evaluate(value, op);
  7286. Emit(Push(property.position, op.op));
  7287. ReleaseOperand(op);
  7288. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  7289. ELSE
  7290. HALT(200);
  7291. END;
  7292. END AddProperty;
  7293. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  7294. VAR symbol: SyntaxTree.Symbol;
  7295. BEGIN
  7296. WHILE modifier # NIL DO
  7297. symbol := cellType.FindProperty(modifier.identifier);
  7298. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  7299. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  7300. modifier := modifier.nextModifier;
  7301. END;
  7302. END AddModifiers;
  7303. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7304. VAR last: SyntaxTree.Modifier;
  7305. BEGIN
  7306. IF to = NIL THEN
  7307. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  7308. ELSE
  7309. last := to;
  7310. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  7311. last := last.nextModifier;
  7312. END;
  7313. IF last.identifier # this.identifier THEN
  7314. ASSERT(last.nextModifier = NIL);
  7315. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  7316. END;
  7317. END;
  7318. END AppendModifier;
  7319. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7320. BEGIN
  7321. WHILE this # NIL DO
  7322. AppendModifier(to, this);
  7323. this := this.nextModifier;
  7324. END;
  7325. END AppendModifiers;
  7326. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  7327. VAR base: SyntaxTree.Type;
  7328. BEGIN
  7329. AppendModifiers(to, c.modifiers);
  7330. base := c.GetBaseValueType();
  7331. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  7332. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  7333. END;
  7334. END AppendCellTypeModifiers;
  7335. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7336. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7337. BEGIN
  7338. Basic.GetString(modifier.identifier, name);
  7339. PushConstString(name);
  7340. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7341. ASSERT(SemanticChecker.IsStringType(value.type));
  7342. Designate(value, op);
  7343. PushString(op, value.type);
  7344. ReleaseOperand(op);
  7345. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7346. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7347. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7348. Evaluate(value, op);
  7349. Emit(Push(modifier.position, op.op));
  7350. ReleaseOperand(op);
  7351. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7352. ELSE
  7353. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7354. END;
  7355. END AddPortProperty;
  7356. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7357. BEGIN
  7358. WHILE modifier # NIL DO
  7359. AddPortProperty(modifier, modifier.expression);
  7360. modifier := modifier.nextModifier;
  7361. END;
  7362. END AddPortProperties;
  7363. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7364. VAR op: Operand;
  7365. BEGIN
  7366. Evaluate(p, op);
  7367. Emit(Push(p.position, op.op));
  7368. ReleaseOperand(op);
  7369. IF p IS SyntaxTree.Designator THEN
  7370. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7371. END;
  7372. END PushPort;
  7373. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7374. VAR tmp: IntermediateCode.Operand;
  7375. BEGIN
  7376. actualType := actualType.resolved;
  7377. IF actualType IS SyntaxTree.StringType THEN
  7378. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7379. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7380. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7381. ELSE
  7382. tmp := op.tag;
  7383. IntermediateCode.MakeMemory(tmp,addressType);
  7384. Emit(Push(position,tmp));
  7385. END;
  7386. Emit(Push(position,op.op))
  7387. END PushString;
  7388. (* conservative check if x is potentially on the heap, excluding the module heap
  7389. required for generational garbage collector
  7390. *)
  7391. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7392. BEGIN
  7393. RETURN TRUE;
  7394. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7395. passed by reference.
  7396. pos := x.position.start;
  7397. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7398. x := x(SyntaxTree.Designator).left;
  7399. END;
  7400. RETURN x # NIL;
  7401. *)
  7402. END OnHeap;
  7403. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7404. VAR
  7405. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7406. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7407. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7408. tmp:IntermediateCode.Operand;
  7409. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,ignore: Label;
  7410. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7411. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7412. dest: IntermediateCode.Operand;
  7413. staticLength: LONGINT; itype: IntermediateCode.Type;
  7414. convert,isTensor: BOOLEAN;
  7415. recordType: SyntaxTree.RecordType;
  7416. baseType: SyntaxTree.Type;
  7417. left: SyntaxTree.Expression;
  7418. call: SyntaxTree.Designator;
  7419. procedure: SyntaxTree.Procedure;
  7420. temporaryVariable: SyntaxTree.Variable;
  7421. dummy: IntermediateCode.Operand;
  7422. customBuiltin: SyntaxTree.CustomBuiltin;
  7423. isVarPar: ARRAY 3 OF BOOLEAN;
  7424. callsection: Sections.Section;
  7425. segmentedName: Basic.SegmentedName;
  7426. needsTrace: BOOLEAN;
  7427. n: ARRAY 256 OF CHAR;
  7428. modifier: SyntaxTree.Modifier;
  7429. previous, init: IntermediateCode.Section;
  7430. prevScope: SyntaxTree.Scope;
  7431. firstPar: LONGINT;
  7432. saved: RegisterEntry;
  7433. callingConvention: SyntaxTree.CallingConvention;
  7434. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7435. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7436. priority: IntermediateCode.Operand;
  7437. op,callop: Operand;
  7438. BEGIN
  7439. IF type = NIL THEN RETURN END;
  7440. type := type.resolved;
  7441. IF type IS SyntaxTree.PointerType THEN
  7442. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7443. END;
  7444. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7445. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7446. recordScope := type(SyntaxTree.RecordType).recordScope;
  7447. IF recordScope.bodyProcedure # NIL THEN
  7448. procedure := recordScope.bodyProcedure;
  7449. body := procedure.procedureScope.body;
  7450. Emit(Push(position,self));
  7451. IF body.isActive THEN
  7452. StaticCallOperand(callop,procedure);
  7453. Emit(Push(position,callop.op));
  7454. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7455. Convert(priority,sizeType);
  7456. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7457. END;
  7458. Emit(Push(position,priority));
  7459. ReleaseIntermediateOperand(priority);
  7460. IF backend.cooperative THEN
  7461. Emit(Push(position,self));
  7462. CallThis(position,"Activities","Create",3)
  7463. ELSE
  7464. flags := 0;
  7465. IF body.isSafe THEN
  7466. flags := 1;
  7467. END;
  7468. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7469. Emit(Push(position,self));
  7470. CallThis(position,"Objects","CreateProcess",4)
  7471. END;
  7472. ELSE
  7473. Emit(Push(position,self));
  7474. StaticCallOperand(callop,procedure);
  7475. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7476. END;
  7477. Emit(Pop(position,self));
  7478. END;
  7479. END CallBodies;
  7480. PROCEDURE PushTD(type: SyntaxTree.Type);
  7481. VAR op: IntermediateCode.Operand;
  7482. BEGIN
  7483. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7484. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7485. ELSE
  7486. IF type.resolved IS SyntaxTree.PointerType THEN
  7487. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7488. END;
  7489. op := TypeDescriptorAdr(type.resolved);
  7490. Emit(Push(position,op));
  7491. END
  7492. END PushTD;
  7493. BEGIN
  7494. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7495. dest := destination; destination := emptyOperand;
  7496. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7497. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7498. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7499. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7500. CASE x.id OF
  7501. (* ---- COPY ----- *)
  7502. |Global.Copy:
  7503. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7504. (* ---- EXCL, INCL----- *)
  7505. |Global.Excl,Global.Incl:
  7506. Evaluate(p0,s0);
  7507. Evaluate(p1,s1);
  7508. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7509. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7510. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7511. END;
  7512. ReuseCopy(res,s0.op);
  7513. ReleaseOperand(s0);
  7514. Reuse1(tmp,s1.op);
  7515. ReleaseOperand(s1);
  7516. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7517. IF x.id = Global.Excl THEN
  7518. Emit(Not(position,tmp,tmp));
  7519. Emit(And(position,res,res,tmp));
  7520. ELSE
  7521. Emit(Or(position,res,res,tmp));
  7522. END;
  7523. ReleaseIntermediateOperand(tmp);
  7524. Designate(p0,s0);
  7525. ToMemory(s0.op,s1.op.type,0);
  7526. Emit(Mov(position,s0.op,res));
  7527. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7528. (* ---- DISPOSE ----- *)
  7529. |Global.Dispose:
  7530. Designate(p0,s0);
  7531. Emit(Push(position,s0.op));
  7532. ReleaseOperand(s0);
  7533. CallThis(position,"Runtime","Dispose", 1);
  7534. (* ---- GETPROCEDURE ----- *)
  7535. |Global.GetProcedure:
  7536. Designate(p0,s0);
  7537. PushString(s0,p0.type);
  7538. Designate(p1,s1);
  7539. PushString(s1,p1.type);
  7540. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7541. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7542. ELSE PushTD(procedureType.firstParameter.type)
  7543. END;
  7544. PushTD(procedureType.returnType);
  7545. Designate(p2,s2);
  7546. Emit(Push(position,s2.op));
  7547. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7548. CallThis(position,"Modules","GetProcedure", 7);
  7549. (* ---- ASH, LSH, ROT ----- *)
  7550. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7551. Evaluate(p0,s0);
  7552. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7553. (* make unsigned arguments in order to produced a logical shift *)
  7554. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7555. convert:= TRUE;
  7556. itype := s0.op.type;
  7557. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7558. Convert(s0.op,itype);
  7559. ELSE
  7560. convert := FALSE;
  7561. END;
  7562. END;
  7563. Evaluate(p1,s1);
  7564. IF IsIntegerConstant(p1,hint) THEN
  7565. ReuseCopy(reg,s0.op);
  7566. IF hint > 0 THEN
  7567. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7568. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7569. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7570. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7571. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7572. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7573. END;
  7574. ELSIF hint < 0 THEN
  7575. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7576. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7577. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7578. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7579. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7580. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7581. END;
  7582. END;
  7583. ReleaseOperand(s0); ReleaseOperand(s1);
  7584. ELSE
  7585. exit := NewLabel();
  7586. end := NewLabel();
  7587. ReuseCopy(reg,s0.op);
  7588. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7589. Reuse1(tmp,s1.op);
  7590. Emit(Neg(position,tmp,s1.op));
  7591. Convert(tmp,s1.op.type);
  7592. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7593. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7594. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7595. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7596. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7597. END;
  7598. ReleaseIntermediateOperand(tmp);
  7599. BrL(end);
  7600. SetLabel(exit);
  7601. ReuseCopy(tmp,s1.op);
  7602. Convert(tmp,s1.op.type);
  7603. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7604. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7605. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7606. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7607. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7608. END;
  7609. ReleaseIntermediateOperand(tmp);
  7610. SetLabel(end);
  7611. ReleaseOperand(s0); ReleaseOperand(s1);
  7612. END;
  7613. InitOperand(result,ModeValue);
  7614. IF convert THEN
  7615. itype := reg.type;
  7616. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7617. Convert(reg,itype);
  7618. END;
  7619. result.op := reg;
  7620. (* ---- CAP ----- *)
  7621. |Global.Cap:
  7622. Evaluate(p0,result);
  7623. ReuseCopy(reg,result.op);
  7624. ReleaseIntermediateOperand(result.op);
  7625. ignore := NewLabel();
  7626. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7627. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7628. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7629. SetLabel(ignore);
  7630. result.op := reg;
  7631. (* ---- CHR ----- *)
  7632. |Global.Chr, Global.Chr32:
  7633. Evaluate(p0,result);
  7634. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7635. |Global.Entier, Global.EntierH:
  7636. Evaluate(p0,result);
  7637. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7638. (* ---- MIN and MAX ----- *)
  7639. |Global.Max,Global.Min:
  7640. Evaluate(p0,s0);
  7641. Evaluate(p1,s1);
  7642. Reuse2(res,s0.op,s1.op);
  7643. else := NewLabel();
  7644. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7645. ELSE BrltL(else,s1.op,s0.op) END;
  7646. Emit(Mov(position,res,s0.op));
  7647. ReleaseOperand(s0);
  7648. end := NewLabel();
  7649. BrL(end);
  7650. SetLabel(else);
  7651. Emit(MovReplace(position,res,s1.op));
  7652. SetLabel(end);
  7653. ReleaseOperand(s1);
  7654. InitOperand(result,ModeValue);
  7655. result.op := res;
  7656. (* ---- ODD ----- *)
  7657. |Global.Odd:
  7658. Evaluate(p0,result);
  7659. Reuse1(res,result.op);
  7660. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7661. ReleaseIntermediateOperand(result.op);
  7662. result.op := res;
  7663. Convert(result.op,bool);
  7664. (* ---- ORD ----- *)
  7665. |Global.Ord, Global.Ord32:
  7666. Evaluate(p0,result);
  7667. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7668. (* ---- SHORT, LONG ----- *)
  7669. |Global.Short, Global.Long:
  7670. Evaluate(p0,result);
  7671. IF x.type IS SyntaxTree.ComplexType THEN
  7672. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7673. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7674. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7675. ELSE
  7676. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7677. END
  7678. (* ---- HALT, SYSTEM.HALT----- *)
  7679. |Global.Halt, Global.systemHalt:
  7680. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7681. EmitTrap (position, val);
  7682. (* ---- ASSERT ----- *)
  7683. |Global.Assert:
  7684. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7685. trueL := NewLabel();
  7686. Condition(p0,trueL,TRUE);
  7687. IF p1 = NIL THEN val := AssertTrap
  7688. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7689. END;
  7690. EmitTrap(position,val);
  7691. SetLabel(trueL);
  7692. END;
  7693. (*
  7694. Emit(TrapC(result.op,val);
  7695. *)
  7696. (* ---- INC, DEC----- *)
  7697. |Global.Inc,Global.Dec:
  7698. Expression(p0); adr := result.op;
  7699. s0 := result;
  7700. LoadValue(result,p0.type);
  7701. (* EXPERIMENTAL *)
  7702. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7703. availableSymbols[s0.availability].inMemory := FALSE;
  7704. END;
  7705. l := result;
  7706. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7707. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7708. END;
  7709. IF x.id = Global.Inc THEN
  7710. Emit(Add(position,l.op,l.op,r.op));
  7711. ELSE
  7712. Emit(Sub(position,l.op,l.op,r.op));
  7713. END;
  7714. ReleaseOperand(l); ReleaseOperand(r);
  7715. (* ---- LEN ----- *)
  7716. |Global.Len: (* dynamic length, static length done by checker *)
  7717. Designate(p0,operand);
  7718. IF p1 = NIL THEN
  7719. InitOperand(l,ModeValue);
  7720. l.op := IntermediateCode.Immediate(sizeType,0);
  7721. ELSE
  7722. Evaluate(p1,l);
  7723. END;
  7724. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7725. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7726. Dereference(operand, p0.type.resolved, FALSE);
  7727. END;
  7728. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7729. ReleaseOperand(operand); ReleaseOperand(l);
  7730. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7731. ASSERT(p1 # NIL);
  7732. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7733. Dereference(operand,p0.type.resolved,FALSE);
  7734. END;
  7735. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7736. ReleaseOperand(operand); ReleaseOperand(l);
  7737. ELSE HALT(100);
  7738. END;
  7739. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7740. (* ---- FIRST ---- *)
  7741. |Global.First:
  7742. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7743. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7744. ELSE
  7745. Designate(p0, result)
  7746. END
  7747. (* ---- LAST ---- *)
  7748. |Global.Last:
  7749. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7750. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7751. ELSE
  7752. Designate(p0, result);
  7753. (* make sure result.op is a register *)
  7754. tmp := result.op;
  7755. ReuseCopy(result.op, result.op);
  7756. ReleaseIntermediateOperand(tmp);
  7757. (* add offset to result.op *)
  7758. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7759. END
  7760. (* ---- STEP ---- *)
  7761. |Global.Step:
  7762. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7763. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7764. ELSE
  7765. Designate(p0, result);
  7766. (* make sure result.op is a register *)
  7767. tmp := result.op;
  7768. ReuseCopy(result.op, result.op);
  7769. ReleaseIntermediateOperand(tmp);
  7770. (* add offset to result.op *)
  7771. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7772. END
  7773. (* ---- RE ---- *)
  7774. |Global.Re:
  7775. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7776. Designate(p0, result)
  7777. ELSE
  7778. Evaluate(p0, result)
  7779. END
  7780. (* ---- IM ---- *)
  7781. |Global.Im:
  7782. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7783. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7784. Designate(p0, result);
  7785. (* make sure result.op is a register *)
  7786. tmp := result.op;
  7787. ReuseCopy(result.op, result.op);
  7788. ReleaseIntermediateOperand(tmp);
  7789. (* add offset to result.op *)
  7790. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7791. (* ---- ABS ----- *)
  7792. |Global.Abs:
  7793. Evaluate(p0,operand);
  7794. type := p0.type.resolved;
  7795. InitOperand(result,ModeValue);
  7796. Reuse1a(result.op,operand.op,dest);
  7797. Emit(Abs(position,result.op,operand.op));
  7798. ReleaseOperand(operand);
  7799. (* ---- WAIT ----- *)
  7800. |Global.Wait:
  7801. Evaluate(p0,operand);
  7802. Emit(Push(position,operand.op));
  7803. ReleaseOperand(operand);
  7804. CallThis(position,"Activities","Wait", 1);
  7805. (* ---- NEW ----- *)
  7806. |Global.New:
  7807. (*! the following code is only correct for "standard" Oberon calling convention *)
  7808. IF x.type # NIL THEN
  7809. type := x.type.resolved;
  7810. firstPar := 0;
  7811. ELSE
  7812. type := p0.type.resolved;
  7813. firstPar := 1;
  7814. END;
  7815. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7816. THEN
  7817. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7818. IF backend.cooperative THEN
  7819. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7820. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7821. IF recordType.isObject THEN
  7822. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7823. IF recordType.IsActive() THEN
  7824. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7825. END;
  7826. IF recordType.IsProtected() THEN
  7827. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7828. END;
  7829. ELSE
  7830. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7831. END;
  7832. END;
  7833. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7834. CallThis(position,"Runtime","New", 1);
  7835. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7836. Emit(Result(position, pointer));
  7837. exit := NewLabel();
  7838. BreqL(exit,pointer,nil);
  7839. GetRecordTypeName (recordType,name);
  7840. IF ~recordType.isObject THEN
  7841. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7842. END;
  7843. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7844. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7845. IF recordType.isObject THEN
  7846. IF recordType.IsProtected() THEN
  7847. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7848. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7849. END;
  7850. IF recordType.IsActive() THEN
  7851. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7852. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7853. END;
  7854. END;
  7855. (* initialize fields *)
  7856. IF type(SyntaxTree.PointerType).isPlain THEN
  7857. size := 0;
  7858. ELSIF recordType.isObject THEN
  7859. size := BaseObjectTypeSize;
  7860. ELSE
  7861. size := BaseRecordTypeSize;
  7862. END;
  7863. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7864. (* call initializer *)
  7865. constructor := GetConstructor(recordType);
  7866. IF constructor # NIL THEN
  7867. (*! should be unified with ProcedureCallDesignator *)
  7868. Emit(Push(position,pointer));
  7869. ReleaseIntermediateOperand(pointer);
  7870. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7871. FOR i := firstPar TO x.parameters.Length()-1 DO
  7872. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7873. formalParameter := formalParameter.nextParameter;
  7874. END;
  7875. (* static call of the constructor *)
  7876. GetCodeSectionNameForSymbol(constructor,name);
  7877. ASSERT(~constructor.isInline);
  7878. IF constructor.scope.ownerModule # module.module THEN
  7879. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7880. ELSE
  7881. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7882. END;
  7883. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7884. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7885. Emit(Pop(position,pointer));
  7886. END;
  7887. (* call bodies *)
  7888. CallBodies(pointer,type);
  7889. SetLabel(exit);
  7890. needsTrace := p0.NeedsTrace();
  7891. IF needsTrace THEN ModifyAssignments(true) END;
  7892. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7893. Emit(Push(position, pointer));
  7894. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7895. Emit(Pop(position, pointer));
  7896. END;
  7897. Designate(p0,l);
  7898. IF needsTrace THEN
  7899. CallAssignPointer(l.op, pointer);
  7900. ELSE
  7901. ToMemory(l.op,addressType,0);
  7902. Emit(Mov(position,l.op,pointer));
  7903. END;
  7904. ReleaseIntermediateOperand(pointer);
  7905. ReleaseOperand(l);
  7906. IF needsTrace THEN ModifyAssignments(false) END;
  7907. ELSE (* not cooperative backend *)
  7908. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7909. IF temporaryVariable # NIL THEN
  7910. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7911. ELSE
  7912. Designate(p0,l);
  7913. END;
  7914. (* l.op contains address of pointer to record *)
  7915. Emit(Push(position,l.op)); (* address for use after syscall *)
  7916. Emit(Push(position,l.op));
  7917. ReleaseOperand(l);
  7918. (* push type descriptor *)
  7919. reg := TypeDescriptorAdr(recordType);
  7920. Emit(Push(position,reg));
  7921. ReleaseIntermediateOperand(reg);
  7922. (* push realtime flag *)
  7923. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7924. ELSE Emit(Push(position,false));
  7925. END;
  7926. CallThis(position,"Heaps","NewRec", 3);
  7927. (* check allocation success, if not successful then do not call initializers and bodies *)
  7928. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7929. Emit(Pop(position,pointer));
  7930. MakeMemory(reg,pointer,addressType,0);
  7931. ReleaseIntermediateOperand(pointer);
  7932. pointer := reg;
  7933. exit := NewLabel();
  7934. BreqL(exit,pointer,nil);
  7935. Emit(Push(position,pointer));
  7936. (* initialize fields *)
  7937. InitFields(recordType, pointer,0);
  7938. (* call initializer *)
  7939. constructor := GetConstructor(recordType);
  7940. IF constructor # NIL THEN
  7941. (*! should be unified with ProcedureCallDesignator *)
  7942. Emit(Push(position,pointer));
  7943. ReleaseIntermediateOperand(pointer);
  7944. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7945. FOR i := firstPar TO x.parameters.Length()-1 DO
  7946. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7947. formalParameter := formalParameter.nextParameter;
  7948. END;
  7949. (* static call of the constructor *)
  7950. GetCodeSectionNameForSymbol(constructor,name);
  7951. ASSERT(~constructor.isInline);
  7952. IF constructor.scope.ownerModule # module.module THEN
  7953. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7954. ELSE
  7955. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7956. END;
  7957. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7958. ELSE
  7959. ReleaseIntermediateOperand(pointer);
  7960. END;
  7961. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7962. Emit(Pop(position,pointer));
  7963. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7964. Designate(p0,l);
  7965. IF backend.writeBarriers & OnHeap(p0) THEN
  7966. SaveRegisters();ReleaseUsedRegisters(saved);
  7967. Emit(Push(position,l.op));
  7968. Emit(Push(position,pointer));
  7969. CallThis(position,"Heaps","Assign",2);
  7970. RestoreRegisters(saved);
  7971. ELSE
  7972. ToMemory(l.op,addressType,0);
  7973. Emit(Mov(position,l.op,pointer));
  7974. END;
  7975. ReleaseOperand(l);
  7976. result.tag := emptyOperand;
  7977. ELSIF (x.type # NIL) THEN
  7978. result := l; (* temporary variable is the result of NEW Type() *)
  7979. END;
  7980. (* call bodies *)
  7981. CallBodies(pointer,type);
  7982. ReleaseIntermediateOperand(pointer);
  7983. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7984. end := NewLabel();
  7985. BrL(end);
  7986. SetLabel(exit);
  7987. Designate(p0,l);
  7988. ToMemory(l.op,addressType,0);
  7989. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7990. ReleaseOperand(l);
  7991. SetLabel(end);
  7992. ELSE
  7993. SetLabel(exit);
  7994. END;
  7995. END;
  7996. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7997. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7998. IF ~backend.cooperative THEN (* simpler version *)
  7999. (*
  8000. push len0
  8001. push len1
  8002. push len2
  8003. push len_size
  8004. push len_adr
  8005. push tag
  8006. push static elements
  8007. push element size
  8008. push adr
  8009. *)
  8010. dim := 0;
  8011. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8012. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8013. parameter := x.parameters.GetExpression(i);
  8014. Evaluate(parameter,r);
  8015. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8016. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8017. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8018. END;
  8019. Emit(Push(position,r.op));
  8020. ReleaseOperand(r);
  8021. INC(dim);
  8022. END;
  8023. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8024. Emit(Mov(position, adr, sp));
  8025. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8026. Emit(Push(position, adr));
  8027. ReleaseIntermediateOperand(adr);
  8028. openDim := dim;
  8029. staticLength := 1;
  8030. IF type IS SyntaxTree.ArrayType THEN
  8031. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8032. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8033. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8034. END;
  8035. END;
  8036. IF SemanticChecker.ContainsPointer(type) THEN
  8037. tmp := TypeDescriptorAdr(type);
  8038. ELSE
  8039. tmp := nil;
  8040. END;
  8041. Emit(Push(position,tmp)); (* type descriptor *)
  8042. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  8043. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  8044. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  8045. Designate(p0,l);
  8046. Emit(Push(position,l.op)); (* address *)
  8047. ReleaseOperand(l);
  8048. CallThis(position,"Heaps","NewArray", 6);
  8049. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8050. Emit(Add(position,sp,sp,tmp));
  8051. ELSE
  8052. dim := 0;
  8053. IntermediateCode.InitOperand(reg);
  8054. IF p1 # NIL THEN
  8055. FOR i := firstPar TO x.parameters.Length()-1 DO
  8056. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8057. parameter := x.parameters.GetExpression(i);
  8058. Evaluate(parameter,r);
  8059. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8060. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8061. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8062. END;
  8063. Emit(Push(position,r.op));
  8064. IF i=1 THEN
  8065. CopyInt(reg,r.op);
  8066. ELSE
  8067. MulInt(reg, reg, r.op);
  8068. END;
  8069. ReleaseOperand(r);
  8070. INC(dim);
  8071. END;
  8072. Convert(reg,addressType);
  8073. ELSE
  8074. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8075. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  8076. END;
  8077. openDim := dim;
  8078. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  8079. IF backend.cooperative THEN
  8080. size := ToMemoryUnits(system,system.SizeOf(type));
  8081. WHILE type IS SyntaxTree.ArrayType DO
  8082. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8083. END;
  8084. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  8085. IF (size # 1) THEN
  8086. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8087. END;
  8088. Emit(Push(position,reg));
  8089. size := ToMemoryUnits(system,system.SizeOf(type));
  8090. IF (size # 1) THEN
  8091. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8092. END;
  8093. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  8094. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  8095. Emit(Push(position,reg));
  8096. ReleaseIntermediateOperand(reg);
  8097. CallThis(position,"Runtime","New", 1);
  8098. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8099. Emit(Result(position, pointer));
  8100. exit := NewLabel();
  8101. else := NewLabel();
  8102. BreqL(else,pointer,nil);
  8103. IF ~type.hasPointers THEN
  8104. Basic.ToSegmentedName ("BaseTypes.Array",name);
  8105. ELSIF type IS SyntaxTree.RecordType THEN
  8106. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  8107. ELSIF type IS SyntaxTree.ProcedureType THEN
  8108. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  8109. ELSE
  8110. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  8111. END;
  8112. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  8113. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  8114. 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))));
  8115. IF type IS SyntaxTree.RecordType THEN
  8116. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  8117. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  8118. ELSE
  8119. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  8120. END;
  8121. i := openDim;
  8122. WHILE i > 0 DO
  8123. DEC (i);
  8124. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  8125. END;
  8126. needsTrace := p0.NeedsTrace();
  8127. IF needsTrace THEN ModifyAssignments(true) END;
  8128. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  8129. Emit(Push(position, pointer));
  8130. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  8131. Emit(Pop(position, pointer));
  8132. END;
  8133. Designate(p0,l);
  8134. IF needsTrace THEN
  8135. CallAssignPointer(l.op, pointer);
  8136. ModifyAssignments(false);
  8137. ELSE
  8138. ToMemory(l.op,addressType,0);
  8139. Emit(Mov(position,l.op,pointer));
  8140. END;
  8141. ReleaseIntermediateOperand(pointer);
  8142. ReleaseOperand(l);
  8143. BrL(exit);
  8144. SetLabel(else);
  8145. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  8146. Designate(p0,l);
  8147. IF needsTrace THEN
  8148. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  8149. ELSE
  8150. ToMemory(l.op,addressType,0);
  8151. Emit(Mov(position,l.op,pointer));
  8152. END;
  8153. ReleaseOperand(l);
  8154. SetLabel(exit);
  8155. ELSE
  8156. (*! the following code is only correct for "standard" Oberon calling convention *)
  8157. IF SemanticChecker.ContainsPointer(type) THEN
  8158. IF type IS SyntaxTree.ArrayType THEN
  8159. staticLength := 1;
  8160. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8161. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8162. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8163. END;
  8164. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  8165. MulInt(reg,reg,tmp);
  8166. END;
  8167. Designate(p0,l);
  8168. IF openDim > 0 THEN
  8169. Emit(Push(position,l.op)); (* address for use after syscall *)
  8170. END;
  8171. Emit(Push(position,l.op)); (* address *)
  8172. ReleaseOperand(l);
  8173. tmp := TypeDescriptorAdr(type);
  8174. Emit(Push(position,tmp)); (* type descriptor *)
  8175. ReleaseIntermediateOperand(tmp);
  8176. Emit(Push(position,reg)); (* number Elements *)
  8177. ReleaseIntermediateOperand(reg);
  8178. tmp := IntermediateCode.Immediate(addressType,dim);
  8179. Emit(Push(position,tmp)); (* dimensions *)
  8180. (* push realtime flag *)
  8181. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8182. ELSE Emit(Push(position,false));
  8183. END;
  8184. CallThis(position,"Heaps","NewArr",5)
  8185. ELSE
  8186. size := ToMemoryUnits(system,system.SizeOf(type));
  8187. IF (size # 1) THEN
  8188. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  8189. (*
  8190. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  8191. *)
  8192. END;
  8193. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  8194. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  8195. AddInt(reg, reg, tmp);
  8196. (*
  8197. Emit(Add(position,reg,reg,tmp));
  8198. *)
  8199. Designate(p0,l);
  8200. IF openDim >0 THEN
  8201. Emit(Push(position,l.op)); (* address for use after syscall *)
  8202. END;
  8203. Emit(Push(position,l.op)); (* address for syscall *)
  8204. ReleaseOperand(l); (* pointer address *)
  8205. Emit(Push(position,reg)); (* size *)
  8206. ReleaseIntermediateOperand(reg);
  8207. (* push realtime flag *)
  8208. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8209. ELSE Emit(Push(position,false));
  8210. END;
  8211. CallThis(position,"Heaps","NewSys", 3)
  8212. END;
  8213. IF openDim > 0 THEN
  8214. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8215. Emit(Pop(position,adr));
  8216. ToMemory(adr,addressType,0);
  8217. ReuseCopy(tmp,adr);
  8218. ReleaseIntermediateOperand(adr);
  8219. adr := tmp;
  8220. else := NewLabel();
  8221. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  8222. i := openDim-1;
  8223. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8224. WHILE (i >= 0) DO
  8225. Emit(Pop(position,reg));
  8226. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  8227. Emit(Mov(position,res,reg));
  8228. DEC(i);
  8229. END;
  8230. ReleaseIntermediateOperand(adr);
  8231. ReleaseIntermediateOperand(reg);
  8232. exit := NewLabel();
  8233. BrL(exit);
  8234. SetLabel(else);
  8235. (* else part: array could not be allocated *)
  8236. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  8237. Emit(Add(position,sp,sp,tmp));
  8238. SetLabel(exit);
  8239. END;
  8240. END;
  8241. END;
  8242. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8243. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  8244. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  8245. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8246. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8247. callingConvention := procedureType.callingConvention;
  8248. left.SetType(procedure.type);
  8249. formalParameter := procedureType.firstParameter;
  8250. (* push array to allocate *)
  8251. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  8252. formalParameter :=formalParameter.nextParameter;
  8253. (* push length array *)
  8254. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  8255. (* push size *)
  8256. type := t0;
  8257. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  8258. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8259. END;
  8260. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  8261. Emit(Push(position,tmp));
  8262. (* *)
  8263. IF SemanticChecker.ContainsPointer(type) THEN
  8264. tmp := TypeDescriptorAdr(type);
  8265. ELSE
  8266. tmp := IntermediateCode.Immediate(addressType, 0);
  8267. END;
  8268. Emit(Push(position,tmp)); (* type descriptor *)
  8269. StaticCallOperand(result,procedure);
  8270. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8271. ReleaseOperand(result);
  8272. END;
  8273. (*
  8274. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  8275. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  8276. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  8277. *)
  8278. ELSE
  8279. (*
  8280. push len0
  8281. push len1
  8282. push len2
  8283. push size
  8284. push len_adr
  8285. push element_size
  8286. push tag
  8287. push adr
  8288. *)
  8289. dim := 0;
  8290. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8291. isTensor := TRUE;
  8292. ELSE
  8293. isTensor := FALSE;
  8294. END;
  8295. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8296. IF ~isTensor THEN
  8297. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8298. END;
  8299. parameter := x.parameters.GetExpression(i);
  8300. Evaluate(parameter,r);
  8301. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8302. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8303. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8304. END;
  8305. Emit(Push(position,r.op));
  8306. ReleaseOperand(r);
  8307. INC(dim);
  8308. END;
  8309. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8310. Emit(Mov(position, adr, sp));
  8311. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8312. Emit(Push(position, adr));
  8313. ReleaseIntermediateOperand(adr);
  8314. openDim := dim;
  8315. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  8316. IF isTensor THEN
  8317. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  8318. ELSE
  8319. baseType := SemanticChecker.ArrayBase(type,openDim);
  8320. END;
  8321. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  8322. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  8323. IF SemanticChecker.ContainsPointer(baseType) THEN
  8324. tmp := TypeDescriptorAdr(baseType);
  8325. ELSE
  8326. tmp := nil;
  8327. END;
  8328. Emit(Push(position,tmp)); (* type descriptor *)
  8329. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  8330. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  8331. ELSE (* error message has already been emited *)
  8332. RETURN;
  8333. END;
  8334. Designate(p0,l);
  8335. IF isTensor THEN
  8336. Emit(Push(position,l.op)); (* address *)
  8337. ELSE
  8338. Emit(Push(position,l.tag)); (* address *)
  8339. END;
  8340. ReleaseOperand(l);
  8341. StaticCallOperand(result,procedure);
  8342. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8343. ReleaseOperand(result);
  8344. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8345. Emit(Add(position,sp,sp,tmp));
  8346. END;
  8347. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8348. THEN
  8349. IF ~backend.cellsAreObjects THEN RETURN END;
  8350. IF InCellScope(currentScope) THEN
  8351. PushSelfPointer()
  8352. ELSE
  8353. Emit(Push(position, nil));
  8354. END;
  8355. (* push temp address *)
  8356. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8357. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8358. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8359. (* l.op contains address of pointer to record *)
  8360. Emit(Push(position,l.op)); (* address for use after syscall *)
  8361. ReleaseOperand(l);
  8362. (* push type descriptor *)
  8363. reg := TypeDescriptorAdr(baseType);
  8364. Emit(Push(position,reg));
  8365. ReleaseIntermediateOperand(reg);
  8366. (* push name *)
  8367. (*Global.GetSymbolName(p0, n);*)
  8368. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8369. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8370. ELSE
  8371. Global.GetModuleName(module.module, n);
  8372. END;
  8373. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8374. (*type.typeDeclaration.GetName(n);*)
  8375. PushConstString(n);
  8376. (* push cellnet boolean *)
  8377. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8378. (* push engine boolean *)
  8379. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8380. (* allocate *)
  8381. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8382. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8383. (* l.op contains address of pointer to record *)
  8384. ToMemory(l.op,addressType,0);
  8385. (* l.op contains value of pointer to record *)
  8386. InitFields(baseType, l.op,0);
  8387. (* add capabilities *)
  8388. modifier := p0(SyntaxTree.Designator).modifiers;
  8389. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8390. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8391. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8392. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8393. END;
  8394. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8395. (*
  8396. modifier := baseType(SyntaxTree.CellType).modifiers;
  8397. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8398. modifier := p0(SyntaxTree.Designator).modifiers;
  8399. *)
  8400. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8401. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8402. (* l.op contains address of pointer to record *)
  8403. ToMemory(l.op,addressType,0);
  8404. (* l.op contains value of pointer to record *)
  8405. Emit(Push(position,l.op)); (* address for use after syscall *)
  8406. ReleaseOperand(l);
  8407. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8408. prevScope := currentScope;
  8409. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8410. previous := section;
  8411. section := init;
  8412. (* add ports *)
  8413. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8414. CloseInitializer(previous);
  8415. currentScope := prevScope;
  8416. Symbol(temporaryVariable,l);
  8417. ToMemory(l.op,addressType,0);
  8418. Emit(Push(position,l.op));
  8419. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8420. (*
  8421. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8422. IF constructor # NIL THEN
  8423. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8424. FOR i := 1 TO x.parameters.Length()-1 DO
  8425. p := x.parameters.GetExpression(i);
  8426. Global.GetSymbolName(parameter,name);
  8427. Evaluate(p, value);
  8428. ASSERT(value.type # NIL);
  8429. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8430. par := instance.AddParameter(name);
  8431. par.SetInteger(value.integer);
  8432. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8433. par := instance.AddParameter(name);
  8434. par.SetBoolean(value.boolean);
  8435. ELSE Error(x.position,NotYetImplemented)
  8436. END;
  8437. parameter := parameter.nextParameter
  8438. END;
  8439. END;
  8440. *)
  8441. (* call initializer *)
  8442. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8443. IF constructor # NIL THEN
  8444. (*! should be unified with ProcedureCallDesignator *)
  8445. IF backend.cellsAreObjects THEN
  8446. Symbol(temporaryVariable,l);
  8447. ToMemory(l.op,addressType,0);
  8448. Emit(Push(position,l.op));
  8449. ReleaseOperand(l);
  8450. END;
  8451. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8452. FOR i := firstPar TO x.parameters.Length()-1 DO
  8453. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8454. formalParameter := formalParameter.nextParameter;
  8455. END;
  8456. (* static call of the constructor *)
  8457. Global.GetSymbolSegmentedName(constructor,name);
  8458. ASSERT(~constructor.isInline);
  8459. IF constructor.scope.ownerModule # module.module THEN
  8460. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8461. ELSE
  8462. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8463. END;
  8464. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8465. (*ELSE
  8466. ReleaseIntermediateOperand(pointer);*)
  8467. END;
  8468. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8469. ToMemory(l.op, addressType, 0);
  8470. Designate(p0,s0);
  8471. ToMemory(s0.op,addressType,0);
  8472. Emit(Mov(position,s0.op,l.op));
  8473. ReleaseOperand(l);
  8474. ReleaseOperand(s0);
  8475. result.tag := emptyOperand;
  8476. (* start *)
  8477. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8478. (* push cell *)
  8479. Symbol(temporaryVariable, l);
  8480. ToMemory(l.op,addressType,0);
  8481. Emit(Push(Basic.invalidPosition,l.op));
  8482. (* push delegate *)
  8483. Emit(Push(Basic.invalidPosition,l.op));
  8484. ReleaseOperand(l);
  8485. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8486. Emit(Push(position, s1.op));
  8487. ReleaseOperand(s1);
  8488. CallThis(position,"ActiveCellsRuntime","Start",3);
  8489. END;
  8490. (*IF temporaryVariable # NIL THEN
  8491. end := NewLabel();
  8492. BrL(end);
  8493. SetLabel(exit);
  8494. Designate(p0,l);
  8495. ToMemory(l.op,addressType,0);
  8496. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8497. ReleaseOperand(l);
  8498. SetLabel(end);
  8499. ELSE
  8500. SetLabel(exit);
  8501. END;
  8502. *)
  8503. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8504. ELSE (* no pointer to record, no pointer to array *)
  8505. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8506. (* ignore new statement *)
  8507. Warning(p0.position, "cannot run on final hardware");
  8508. ELSE
  8509. HALT(200);
  8510. END;
  8511. END;
  8512. (* ---- ADDRESSOF----- *)
  8513. |Global.systemAdr:
  8514. Designate(p0,s0);
  8515. s0.mode := ModeValue;
  8516. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8517. ReleaseIntermediateOperand(s0.op);
  8518. s0.op := s0.tag;
  8519. IntermediateCode.InitOperand(s0.tag);
  8520. END;
  8521. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8522. result := s0;
  8523. (* ---- BIT ----- *)
  8524. |Global.systemBit:
  8525. Evaluate(p0,s0);
  8526. ToMemory(s0.op,addressType,0);
  8527. ReuseCopy(res,s0.op);
  8528. ReleaseOperand(s0);
  8529. Evaluate(p1,s1);
  8530. Emit(Ror(position,res,res,s1.op));
  8531. ReleaseOperand(s1);
  8532. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8533. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8534. InitOperand(result,ModeValue);
  8535. result.op := res;
  8536. (* --- MSK ----*)
  8537. |Global.systemMsk:
  8538. Evaluate(p0,s0);
  8539. Evaluate(p1,s1);
  8540. ReuseCopy(res,s0.op);
  8541. ReleaseOperand(s0);
  8542. Emit(And(position,res,res,s1.op));
  8543. ReleaseOperand(s1);
  8544. InitOperand(result,ModeValue);
  8545. result.op := res;
  8546. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8547. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8548. Evaluate(p0,s0);
  8549. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8550. ReleaseOperand(s0);
  8551. InitOperand(result,ModeValue);
  8552. result.op := res;
  8553. (* ---- SYSTEM.GetStackPointer ----- *)
  8554. |Global.systemGetStackPointer:
  8555. InitOperand(result,ModeValue);
  8556. result.op := sp;
  8557. (* ---- SYSTEM.GetFramePointer ----- *)
  8558. |Global.systemGetFramePointer:
  8559. InitOperand(result,ModeValue);
  8560. result.op := fp;
  8561. (* ---- SYSTEM.GetActivity ----- *)
  8562. |Global.systemGetActivity:
  8563. ASSERT(backend.cooperative);
  8564. InitOperand(result,ModeValue);
  8565. result.op := ap;
  8566. (* ---- SYSTEM.SetStackPointer ----- *)
  8567. |Global.systemSetStackPointer:
  8568. Evaluate(p0,s0); (* *)
  8569. Emit(Mov(position,sp,s0.op));
  8570. ReleaseOperand(s0);
  8571. (* ---- SYSTEM.SetFramePointer ----- *)
  8572. |Global.systemSetFramePointer:
  8573. Evaluate(p0,s0); (* *)
  8574. Emit(Mov(position,fp,s0.op));
  8575. ReleaseOperand(s0);
  8576. (* ---- SYSTEM.Activity ----- *)
  8577. |Global.systemSetActivity:
  8578. ASSERT(backend.cooperative);
  8579. Evaluate(p0,s0); (* *)
  8580. Emit(Mov(position,ap,s0.op));
  8581. ReleaseOperand(s0);
  8582. (* ---- SYSTEM.VAL ----- *)
  8583. |Global.systemVal:
  8584. Expression(p1);
  8585. s1 := result;
  8586. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8587. IF s1.mode = ModeReference THEN
  8588. (* nothing to be done if not record type, just take over new type *)
  8589. IF (type IS SyntaxTree.RecordType) THEN
  8590. ReleaseIntermediateOperand(s1.tag);
  8591. s1.tag := TypeDescriptorAdr(type);
  8592. UseIntermediateOperand(s1.tag);
  8593. END;
  8594. result := s1;
  8595. ELSE (* copy over result to different type, may not use convert *)
  8596. itype := IntermediateCode.GetType(system,type);
  8597. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8598. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8599. Emit(Mov(position,s0.op,s1.op));
  8600. ReleaseOperand(s1);
  8601. InitOperand(result,ModeValue);
  8602. result.op := s0.op;
  8603. ELSE (* different size, must convert *)
  8604. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8605. Convert(s1.op, IntermediateCode.GetType(system,type));
  8606. result := s1;
  8607. END;
  8608. END;
  8609. (* ---- SYSTEM.GET ----- *)
  8610. |Global.systemGet:
  8611. Evaluate(p0,s0); (* adr *)
  8612. Designate(p1,s1); (* variable *)
  8613. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8614. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8615. Emit(Mov(position,s1.op,s0.op));
  8616. ReleaseOperand(s1);
  8617. ReleaseOperand(s0);
  8618. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8619. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8620. Evaluate(p0,s0); (* *)
  8621. Evaluate(p1,s1); (* variable *)
  8622. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8623. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8624. (* real part *)
  8625. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8626. Emit(Mov(position,res, s1.op));
  8627. ReleaseIntermediateOperand(res);
  8628. (* imaginary part *)
  8629. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8630. Emit(Mov(position,res, s1.tag));
  8631. ReleaseIntermediateOperand(res);
  8632. ReleaseOperand(s1);
  8633. ReleaseOperand(s0);
  8634. ELSE
  8635. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8636. ReleaseOperand(s0);
  8637. Emit(Mov(position,res,s1.op));
  8638. ReleaseIntermediateOperand(res);
  8639. ReleaseOperand(s1);
  8640. END;
  8641. (* ---- SYSTEM.MOVE ----- *)
  8642. |Global.systemMove:
  8643. Evaluate(p0,s0);
  8644. Evaluate(p1,s1);
  8645. Evaluate(p2,s2);
  8646. Emit(Copy(position,s1.op,s0.op,s2.op));
  8647. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8648. (* ---- SYSTEM.NEW ----- *)
  8649. |Global.systemNew:
  8650. Designate(p0,s0);
  8651. Emit(Push(position,s0.op));
  8652. ReleaseOperand(s0);
  8653. Evaluate(p1,s1);
  8654. Emit(Push(position,s1.op));
  8655. ReleaseOperand(s1);
  8656. (* push realtime flag: false by default *)
  8657. Emit(Push(position,false));
  8658. CallThis(position,"Heaps","NewSys",3);
  8659. (* ---- SYSTEM.CALL ----- *)
  8660. |Global.systemRef:
  8661. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8662. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8663. s0.mode := ModeValue;
  8664. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8665. result := s0
  8666. (* ---- INCR ----- *)
  8667. |Global.Incr:
  8668. Designate(p0,operand);
  8669. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8670. Dereference(operand,p0.type.resolved,FALSE);
  8671. END;
  8672. ASSERT(p1 # NIL);
  8673. Evaluate(p1,l);
  8674. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8675. ReleaseOperand(operand); ReleaseOperand(l);
  8676. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8677. (* ---- SUM ----- *)
  8678. |Global.Sum: HALT(200);
  8679. (* ---- ALL ----- *)
  8680. |Global.All: HALT(200);
  8681. (* ---- CAS ----- *)
  8682. |Global.Cas:
  8683. needsTrace := p0.NeedsTrace();
  8684. IF needsTrace THEN ModifyAssignments(true) END;
  8685. Designate(p0,s0);
  8686. Evaluate(p1,s1);
  8687. Evaluate(p2,s2);
  8688. IF needsTrace THEN
  8689. Emit(Push(position, s0.op));
  8690. Emit(Push(position, s1.op));
  8691. Emit(Push(position, s2.op));
  8692. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8693. ELSE
  8694. Emit(Cas(position,s0.op,s1.op,s2.op));
  8695. END;
  8696. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8697. IF needsTrace THEN ModifyAssignments(false) END;
  8698. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8699. Emit(Result(position, res));
  8700. result.op := res;
  8701. result.mode := ModeValue;
  8702. (*
  8703. IF conditional THEN
  8704. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8705. BrL(falseLabel);
  8706. ReleaseIntermediateOperand(res);
  8707. END;
  8708. *)
  8709. (* ---- DIM ----- *)
  8710. |Global.Dim:
  8711. Designate(p0,s0);
  8712. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8713. Dereference(s0,p0.type.resolved,FALSE);
  8714. END;
  8715. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8716. ReleaseOperand(s0);
  8717. (* ---- RESHAPE ----- *)
  8718. |Global.Reshape:
  8719. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8720. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8721. left.SetType(procedure.type);
  8722. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8723. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8724. END;
  8725. (* ---- SYSTEM.TYPECODE ----- *)
  8726. |Global.systemTypeCode:
  8727. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8728. IF type.resolved IS SyntaxTree.PointerType THEN
  8729. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8730. END;
  8731. result.op := TypeDescriptorAdr(type);
  8732. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8733. result.mode := ModeValue;
  8734. (* ---- SYSTEM.TRACE ----- *)
  8735. |Global.systemTrace:
  8736. SystemTrace(x.parameters, x.position);
  8737. (* ----- CONNECT ------*)
  8738. |Global.Connect:
  8739. IF backend.cellsAreObjects THEN
  8740. PushPort(p0);
  8741. PushPort(p1);
  8742. IF p2 # NIL THEN
  8743. Evaluate(p2, s2);
  8744. Emit(Push(p2.position, s2.op));
  8745. ReleaseOperand(s2);
  8746. ELSE
  8747. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8748. END;
  8749. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8750. ELSE
  8751. Warning(x.position, "cannot run on final hardware");
  8752. END;
  8753. (* ----- DELEGATE ------*)
  8754. |Global.Delegate:
  8755. IF backend.cellsAreObjects THEN
  8756. PushPort(p0);
  8757. PushPort(p1);
  8758. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8759. ELSE
  8760. Warning(x.position, "cannot run on final hardware");
  8761. END;
  8762. (* ----- SEND ------*)
  8763. |Global.Send:
  8764. Evaluate(p0,s0);
  8765. Evaluate(p1,s1);
  8766. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8767. Emit(Push(position,s0.op));
  8768. Emit(Push(position,s1.op));
  8769. (*
  8770. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8771. *)
  8772. IF ~backend.cellsAreObjects THEN
  8773. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8774. END;
  8775. ReleaseOperand(s0);
  8776. ReleaseOperand(s1);
  8777. IF backend.cellsAreObjects THEN
  8778. CallThis(position,"ActiveCellsRuntime","Send",2);
  8779. ELSE
  8780. CallThis(position,ChannelModuleName,"Send",2);
  8781. END;
  8782. (* ----- RECEIVE ------*)
  8783. |Global.Receive:
  8784. Evaluate(p0,s0);
  8785. Emit(Push(position,s0.op));
  8786. Designate(p1,s1);
  8787. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8788. Emit(Push(position,s1.op));
  8789. IF p2 # NIL THEN
  8790. Designate(p2,s2);
  8791. Emit(Push(position,s2.op));
  8792. END;
  8793. (*
  8794. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8795. *)
  8796. IF ~backend.cellsAreObjects THEN
  8797. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8798. END;
  8799. ReleaseOperand(s0);
  8800. ReleaseOperand(s1);
  8801. ReleaseOperand(s2);
  8802. IF backend.cellsAreObjects THEN
  8803. IF p2 = NIL THEN
  8804. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8805. ELSE
  8806. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8807. END;
  8808. ELSE
  8809. IF p2 = NIL THEN
  8810. CallThis(position,ChannelModuleName,"Receive",2)
  8811. ELSE
  8812. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8813. END;
  8814. END;
  8815. | Global.systemSpecial:
  8816. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8817. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8818. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8819. (* determine if parameters are of the VAR kind *)
  8820. ASSERT(x.parameters.Length() <= 3);
  8821. formalParameter := procedureType.firstParameter;
  8822. FOR i := 0 TO x.parameters.Length() - 1 DO
  8823. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8824. formalParameter := formalParameter.nextParameter
  8825. END;
  8826. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8827. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8828. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8829. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8830. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8831. IF procedureType.returnType # NIL THEN
  8832. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8833. Emit(Result(position, res));
  8834. (*InitOperand(result,ModeValue);
  8835. result.op := res;
  8836. *)
  8837. InitOperand(result,ModeValue); result.op := res;
  8838. END
  8839. ELSE (* function not yet implemented *)
  8840. Error(position,"not yet implemented");
  8841. END;
  8842. destination := dest;
  8843. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8844. END VisitBuiltinCallDesignator;
  8845. PROCEDURE EvaluateBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator; VAR result: Operand);
  8846. VAR
  8847. p0,p1,p2: SyntaxTree.Expression; len: LONGINT; l: Operand; res,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8848. s0,s1,s2: Operand; hint: HUGEINT;
  8849. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  8850. tmp:IntermediateCode.Operand;
  8851. t0,t1,t2: SyntaxTree.Type; ignore: Label;
  8852. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  8853. operand: Operand;
  8854. dest: IntermediateCode.Operand;
  8855. itype: IntermediateCode.Type;
  8856. convert: BOOLEAN;
  8857. customBuiltin: SyntaxTree.CustomBuiltin;
  8858. isVarPar: ARRAY 3 OF BOOLEAN;
  8859. callsection: Sections.Section;
  8860. segmentedName: Basic.SegmentedName;
  8861. needsTrace: BOOLEAN;
  8862. BEGIN
  8863. IF Trace THEN TraceEnter("EvaluateBuiltinCallDesignator") END;
  8864. dest := destination; destination := emptyOperand;
  8865. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  8866. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  8867. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  8868. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  8869. CASE x.id OF
  8870. (* ---- ASH, LSH, ROT ----- *)
  8871. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  8872. EvaluateX(p0, s0);
  8873. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  8874. (* make unsigned arguments in order to produced a logical shift *)
  8875. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  8876. convert:= TRUE;
  8877. itype := s0.op.type;
  8878. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  8879. Convert(s0.op,itype);
  8880. ELSE
  8881. convert := FALSE;
  8882. END;
  8883. END;
  8884. EvaluateX(p1,s1);
  8885. IF IsIntegerConstant(p1,hint) THEN
  8886. ReuseCopy(reg,s0.op);
  8887. IF hint > 0 THEN
  8888. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  8889. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  8890. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  8891. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  8892. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  8893. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  8894. END;
  8895. ELSIF hint < 0 THEN
  8896. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  8897. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  8898. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  8899. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  8900. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  8901. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  8902. END;
  8903. END;
  8904. ReleaseOperand(s0); ReleaseOperand(s1);
  8905. ELSE
  8906. exit := NewLabel();
  8907. end := NewLabel();
  8908. ReuseCopy(reg,s0.op);
  8909. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  8910. Reuse1(tmp,s1.op);
  8911. Emit(Neg(position,tmp,s1.op));
  8912. Convert(tmp,s1.op.type);
  8913. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  8914. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  8915. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  8916. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  8917. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  8918. END;
  8919. ReleaseIntermediateOperand(tmp);
  8920. BrL(end);
  8921. SetLabel(exit);
  8922. ReuseCopy(tmp,s1.op);
  8923. Convert(tmp,s1.op.type);
  8924. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  8925. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  8926. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  8927. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  8928. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  8929. END;
  8930. ReleaseIntermediateOperand(tmp);
  8931. SetLabel(end);
  8932. ReleaseOperand(s0); ReleaseOperand(s1);
  8933. END;
  8934. InitOperand(result,ModeValue);
  8935. IF convert THEN
  8936. itype := reg.type;
  8937. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  8938. Convert(reg,itype);
  8939. END;
  8940. result.op := reg;
  8941. (* ---- CAP ----- *)
  8942. |Global.Cap:
  8943. EvaluateX(p0,result);
  8944. ReuseCopy(reg,result.op);
  8945. ReleaseIntermediateOperand(result.op);
  8946. ignore := NewLabel();
  8947. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  8948. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  8949. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  8950. SetLabel(ignore);
  8951. result.op := reg;
  8952. (* ---- CHR ----- *)
  8953. |Global.Chr, Global.Chr32:
  8954. EvaluateX(p0, result);
  8955. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8956. |Global.Entier, Global.EntierH:
  8957. EvaluateX(p0, result);
  8958. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8959. (* ---- MIN and MAX ----- *)
  8960. |Global.Max,Global.Min:
  8961. EvaluateX(p0, s0);
  8962. EvaluateX(p1, s1);
  8963. Reuse2(res,s0.op,s1.op);
  8964. else := NewLabel();
  8965. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  8966. ELSE BrltL(else,s1.op,s0.op) END;
  8967. Emit(Mov(position,res,s0.op));
  8968. ReleaseOperand(s0);
  8969. end := NewLabel();
  8970. BrL(end);
  8971. SetLabel(else);
  8972. Emit(MovReplace(position,res,s1.op));
  8973. SetLabel(end);
  8974. ReleaseOperand(s1);
  8975. InitOperand(result,ModeValue);
  8976. result.op := res;
  8977. (* ---- ODD ----- *)
  8978. |Global.Odd:
  8979. EvaluateX(p0, result);
  8980. Reuse1(res,result.op);
  8981. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8982. ReleaseIntermediateOperand(result.op);
  8983. result.op := res;
  8984. Convert(result.op,bool);
  8985. (* ---- ORD ----- *)
  8986. |Global.Ord, Global.Ord32:
  8987. EvaluateX(p0, result);
  8988. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8989. (* ---- SHORT, LONG ----- *)
  8990. |Global.Short, Global.Long:
  8991. EvaluateX(p0, result);
  8992. IF x.type IS SyntaxTree.ComplexType THEN
  8993. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8994. Convert(result.op, IntermediateCode.GetType(system, componentType));
  8995. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  8996. ELSE
  8997. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8998. END
  8999. (* ---- LEN ----- *)
  9000. |Global.Len: (* dynamic length, static length done by checker *)
  9001. Designate(p0,operand);
  9002. IF p1 = NIL THEN
  9003. InitOperand(l,ModeValue);
  9004. l.op := IntermediateCode.Immediate(sizeType,0);
  9005. ELSE
  9006. Evaluate(p1,l);
  9007. END;
  9008. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  9009. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  9010. Dereference(operand, p0.type.resolved, FALSE);
  9011. END;
  9012. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  9013. ReleaseOperand(operand); ReleaseOperand(l);
  9014. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  9015. ASSERT(p1 # NIL);
  9016. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9017. Dereference(operand,p0.type.resolved,FALSE);
  9018. END;
  9019. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  9020. ReleaseOperand(operand); ReleaseOperand(l);
  9021. ELSE HALT(100);
  9022. END;
  9023. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9024. (* ---- FIRST ---- *)
  9025. |Global.First:
  9026. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9027. EvaluateX(p0(SyntaxTree.RangeExpression).first, result)
  9028. ELSE
  9029. Designate(p0, result)
  9030. END
  9031. (* ---- LAST ---- *)
  9032. |Global.Last:
  9033. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9034. EvaluateX(p0(SyntaxTree.RangeExpression).last, result)
  9035. ELSE
  9036. Designate(p0, result);
  9037. (* make sure result.op is a register *)
  9038. tmp := result.op;
  9039. ReuseCopy(result.op, result.op);
  9040. ReleaseIntermediateOperand(tmp);
  9041. (* add offset to result.op *)
  9042. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9043. END
  9044. (* ---- STEP ---- *)
  9045. |Global.Step:
  9046. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9047. EvaluateX(p0(SyntaxTree.RangeExpression).step, result)
  9048. ELSE
  9049. Designate(p0, result);
  9050. (* make sure result.op is a register *)
  9051. tmp := result.op;
  9052. ReuseCopy(result.op, result.op);
  9053. ReleaseIntermediateOperand(tmp);
  9054. (* add offset to result.op *)
  9055. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9056. END
  9057. (* ---- RE ---- *)
  9058. |Global.Re:
  9059. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  9060. Designate(p0, result)
  9061. ELSE
  9062. EvaluateX(p0, result)
  9063. END
  9064. (* ---- IM ---- *)
  9065. |Global.Im:
  9066. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  9067. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  9068. Designate(p0, result);
  9069. (* make sure result.op is a register *)
  9070. tmp := result.op;
  9071. ReuseCopy(result.op, result.op);
  9072. ReleaseIntermediateOperand(tmp);
  9073. (* add offset to result.op *)
  9074. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  9075. (* ---- ABS ----- *)
  9076. |Global.Abs:
  9077. EvaluateX(p0,operand);
  9078. type := p0.type.resolved;
  9079. InitOperand(result,ModeValue);
  9080. Reuse1a(result.op,operand.op,dest);
  9081. Emit(Abs(position,result.op,operand.op));
  9082. ReleaseOperand(operand);
  9083. (* ---- ADDRESSOF----- *)
  9084. |Global.systemAdr:
  9085. Designate(p0,s0);
  9086. s0.mode := ModeValue;
  9087. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  9088. ReleaseIntermediateOperand(s0.op);
  9089. s0.op := s0.tag;
  9090. IntermediateCode.InitOperand(s0.tag);
  9091. END;
  9092. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  9093. result := s0;
  9094. (* ---- BIT ----- *)
  9095. |Global.systemBit:
  9096. EvaluateX(p0,s0);
  9097. ToMemory(s0.op,addressType,0);
  9098. ReuseCopy(res,s0.op);
  9099. ReleaseOperand(s0);
  9100. EvaluateX(p1, s1);
  9101. Emit(Ror(position,res,res,s1.op));
  9102. ReleaseOperand(s1);
  9103. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  9104. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  9105. InitOperand(result,ModeValue);
  9106. result.op := res;
  9107. (* --- MSK ----*)
  9108. |Global.systemMsk:
  9109. EvaluateX(p0, s0);
  9110. EvaluateX(p1, s1);
  9111. ReuseCopy(res,s0.op);
  9112. ReleaseOperand(s0);
  9113. Emit(And(position,res,res,s1.op));
  9114. ReleaseOperand(s1);
  9115. InitOperand(result,ModeValue);
  9116. result.op := res;
  9117. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  9118. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  9119. EvaluateX(p0, s0);
  9120. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  9121. ReleaseOperand(s0);
  9122. InitOperand(result,ModeValue);
  9123. result.op := res;
  9124. (* ---- SYSTEM.GetStackPointer ----- *)
  9125. |Global.systemGetStackPointer:
  9126. InitOperand(result,ModeValue);
  9127. result.op := sp;
  9128. (* ---- SYSTEM.GetFramePointer ----- *)
  9129. |Global.systemGetFramePointer:
  9130. InitOperand(result,ModeValue);
  9131. result.op := fp;
  9132. (* ---- SYSTEM.GetActivity ----- *)
  9133. |Global.systemGetActivity:
  9134. ASSERT(backend.cooperative);
  9135. InitOperand(result,ModeValue);
  9136. result.op := ap;
  9137. (* ---- SYSTEM.SetStackPointer ----- *)
  9138. |Global.systemSetStackPointer:
  9139. Evaluate(p0,s0); (* *)
  9140. Emit(Mov(position,sp,s0.op));
  9141. ReleaseOperand(s0);
  9142. (* ---- SYSTEM.SetFramePointer ----- *)
  9143. |Global.systemSetFramePointer:
  9144. Evaluate(p0,s0); (* *)
  9145. Emit(Mov(position,fp,s0.op));
  9146. ReleaseOperand(s0);
  9147. (* ---- SYSTEM.Activity ----- *)
  9148. |Global.systemSetActivity:
  9149. ASSERT(backend.cooperative);
  9150. Evaluate(p0,s0); (* *)
  9151. Emit(Mov(position,ap,s0.op));
  9152. ReleaseOperand(s0);
  9153. (* ---- SYSTEM.VAL ----- *)
  9154. |Global.systemVal:
  9155. Expression(p1);
  9156. s1 := result;
  9157. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9158. IF s1.mode = ModeReference THEN
  9159. (* nothing to be done if not record type, just take over new type *)
  9160. IF (type IS SyntaxTree.RecordType) THEN
  9161. ReleaseIntermediateOperand(s1.tag);
  9162. s1.tag := TypeDescriptorAdr(type);
  9163. UseIntermediateOperand(s1.tag);
  9164. END;
  9165. result := s1;
  9166. ELSE (* copy over result to different type, may not use convert *)
  9167. itype := IntermediateCode.GetType(system,type);
  9168. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  9169. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  9170. Emit(Mov(position,s0.op,s1.op));
  9171. ReleaseOperand(s1);
  9172. InitOperand(result,ModeValue);
  9173. result.op := s0.op;
  9174. ELSE (* different size, must convert *)
  9175. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  9176. Convert(s1.op, IntermediateCode.GetType(system,type));
  9177. result := s1;
  9178. END;
  9179. END;
  9180. (* ---- SYSTEM.GET ----- *)
  9181. |Global.systemGet:
  9182. Evaluate(p0,s0); (* adr *)
  9183. Designate(p1,s1); (* variable *)
  9184. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  9185. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  9186. Emit(Mov(position,s1.op,s0.op));
  9187. ReleaseOperand(s1);
  9188. ReleaseOperand(s0);
  9189. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  9190. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  9191. Evaluate(p0,s0); (* *)
  9192. Evaluate(p1,s1); (* variable *)
  9193. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  9194. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  9195. (* real part *)
  9196. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  9197. Emit(Mov(position,res, s1.op));
  9198. ReleaseIntermediateOperand(res);
  9199. (* imaginary part *)
  9200. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9201. Emit(Mov(position,res, s1.tag));
  9202. ReleaseIntermediateOperand(res);
  9203. ReleaseOperand(s1);
  9204. ReleaseOperand(s0);
  9205. ELSE
  9206. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  9207. ReleaseOperand(s0);
  9208. Emit(Mov(position,res,s1.op));
  9209. ReleaseIntermediateOperand(res);
  9210. ReleaseOperand(s1);
  9211. END;
  9212. (* ---- SYSTEM.MOVE ----- *)
  9213. |Global.systemMove:
  9214. Evaluate(p0,s0);
  9215. Evaluate(p1,s1);
  9216. Evaluate(p2,s2);
  9217. Emit(Copy(position,s1.op,s0.op,s2.op));
  9218. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9219. (* ---- SYSTEM.NEW ----- *)
  9220. |Global.systemNew:
  9221. Designate(p0,s0);
  9222. Emit(Push(position,s0.op));
  9223. ReleaseOperand(s0);
  9224. Evaluate(p1,s1);
  9225. Emit(Push(position,s1.op));
  9226. ReleaseOperand(s1);
  9227. (* push realtime flag: false by default *)
  9228. Emit(Push(position,false));
  9229. CallThis(position,"Heaps","NewSys",3);
  9230. (* ---- SYSTEM.CALL ----- *)
  9231. |Global.systemRef:
  9232. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  9233. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  9234. s0.mode := ModeValue;
  9235. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  9236. result := s0
  9237. (* ---- INCR ----- *)
  9238. |Global.Incr:
  9239. Designate(p0,operand);
  9240. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9241. Dereference(operand,p0.type.resolved,FALSE);
  9242. END;
  9243. ASSERT(p1 # NIL);
  9244. Evaluate(p1,l);
  9245. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  9246. ReleaseOperand(operand); ReleaseOperand(l);
  9247. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9248. (* ---- SUM ----- *)
  9249. |Global.Sum: HALT(200);
  9250. (* ---- ALL ----- *)
  9251. |Global.All: HALT(200);
  9252. (* ---- CAS ----- *)
  9253. |Global.Cas:
  9254. needsTrace := p0.NeedsTrace();
  9255. IF needsTrace THEN ModifyAssignments(true) END;
  9256. Designate(p0,s0);
  9257. Evaluate(p1,s1);
  9258. Evaluate(p2,s2);
  9259. IF needsTrace THEN
  9260. Emit(Push(position, s0.op));
  9261. Emit(Push(position, s1.op));
  9262. Emit(Push(position, s2.op));
  9263. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  9264. ELSE
  9265. Emit(Cas(position,s0.op,s1.op,s2.op));
  9266. END;
  9267. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9268. IF needsTrace THEN ModifyAssignments(false) END;
  9269. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  9270. Emit(Result(position, res));
  9271. result.op := res;
  9272. result.mode := ModeValue;
  9273. (*
  9274. IF conditional THEN
  9275. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  9276. BrL(falseLabel);
  9277. ReleaseIntermediateOperand(res);
  9278. END;
  9279. *)
  9280. (* ---- DIM ----- *)
  9281. |Global.Dim:
  9282. Designate(p0,s0);
  9283. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9284. Dereference(s0,p0.type.resolved,FALSE);
  9285. END;
  9286. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  9287. ReleaseOperand(s0);
  9288. (* ---- SYSTEM.TYPECODE ----- *)
  9289. |Global.systemTypeCode:
  9290. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9291. IF type.resolved IS SyntaxTree.PointerType THEN
  9292. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  9293. END;
  9294. result.op := TypeDescriptorAdr(type);
  9295. Convert(result.op, IntermediateCode.GetType(system,x.type));
  9296. result.mode := ModeValue;
  9297. (* ---- SYSTEM.TRACE ----- *)
  9298. |Global.systemTrace:
  9299. SystemTrace(x.parameters, x.position);
  9300. (* ----- CONNECT ------*)
  9301. |Global.Connect:
  9302. IF backend.cellsAreObjects THEN
  9303. PushPort(p0);
  9304. PushPort(p1);
  9305. IF p2 # NIL THEN
  9306. Evaluate(p2, s2);
  9307. Emit(Push(p2.position, s2.op));
  9308. ReleaseOperand(s2);
  9309. ELSE
  9310. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  9311. END;
  9312. CallThis(position,"ActiveCellsRuntime","Connect",3);
  9313. ELSE
  9314. Warning(x.position, "cannot run on final hardware");
  9315. END;
  9316. | Global.systemSpecial:
  9317. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  9318. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  9319. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  9320. (* determine if parameters are of the VAR kind *)
  9321. ASSERT(x.parameters.Length() <= 3);
  9322. formalParameter := procedureType.firstParameter;
  9323. FOR i := 0 TO x.parameters.Length() - 1 DO
  9324. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  9325. formalParameter := formalParameter.nextParameter
  9326. END;
  9327. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  9328. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  9329. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  9330. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  9331. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9332. IF procedureType.returnType # NIL THEN
  9333. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9334. Emit(Result(position, res));
  9335. (*InitOperand(result,ModeValue);
  9336. result.op := res;
  9337. *)
  9338. InitOperand(result,ModeValue); result.op := res;
  9339. END
  9340. ELSE (* function not yet implemented *)
  9341. Error(position,"not yet implemented");
  9342. END;
  9343. destination := dest;
  9344. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  9345. END EvaluateBuiltinCallDesignator;
  9346. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  9347. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  9348. BEGIN
  9349. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  9350. dest := destination; destination := emptyOperand;
  9351. Expression(x.left);
  9352. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  9353. ELSIF isUnchecked THEN (* no check *)
  9354. ELSE
  9355. trueL := NewLabel();
  9356. IF IsPointerToRecord(x.left.type,recordType) THEN
  9357. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  9358. Emit(Mov(position,tag, result.op));
  9359. IF result.mode # ModeValue THEN
  9360. ptr := tag;
  9361. IntermediateCode.MakeMemory(ptr,addressType);
  9362. Emit(Mov(position,tag, ptr));
  9363. END;
  9364. IF ~backend.cooperative THEN
  9365. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9366. END;
  9367. IntermediateCode.MakeMemory(tag,addressType);
  9368. ELSE
  9369. tag := result.tag;
  9370. UseIntermediateOperand(tag);
  9371. END;
  9372. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  9373. ReleaseIntermediateOperand(tag);
  9374. EmitTrap(position,TypeCheckTrap);
  9375. SetLabel(trueL);
  9376. END;
  9377. destination := dest;
  9378. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  9379. END VisitTypeGuardDesignator;
  9380. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  9381. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  9382. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  9383. VAR label: Label; pc: LONGINT;
  9384. BEGIN
  9385. IF backend.cooperative & ~isUnchecked THEN
  9386. pc := section.pc;
  9387. label := NewLabel();
  9388. BrneL(label, operand.op, nil);
  9389. EmitTrap(position, NilPointerTrap);
  9390. SetLabel(label);
  9391. INC(statCoopNilCheck, section.pc - pc);
  9392. END;
  9393. END NilCheck;
  9394. BEGIN
  9395. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  9396. ReuseCopy(dereferenced,operand.op);
  9397. ReleaseOperand(operand);
  9398. operand.mode := ModeReference;
  9399. operand.op := dereferenced;
  9400. operand.tag := dereferenced;
  9401. UseIntermediateOperand(operand.tag);
  9402. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  9403. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  9404. ReleaseIntermediateOperand(operand.tag);
  9405. operand.tag := TypeDescriptorAdr(type);
  9406. ELSE
  9407. IF ~backend.cooperative THEN
  9408. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9409. END;
  9410. IntermediateCode.MakeMemory(operand.tag,addressType);
  9411. END;
  9412. NilCheck(operand.op);
  9413. ELSIF type IS SyntaxTree.ArrayType THEN
  9414. IF isUnsafe THEN
  9415. NilCheck(operand.op);
  9416. ReleaseIntermediateOperand(operand.tag);
  9417. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  9418. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9419. ELSE
  9420. operand.tag := emptyOperand;
  9421. END;
  9422. ELSE
  9423. NilCheck(operand.op);
  9424. IF backend.cooperative THEN
  9425. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  9426. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9427. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  9428. ELSE
  9429. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  9430. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  9431. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9432. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  9433. END;
  9434. END;
  9435. ELSIF type IS SyntaxTree.MathArrayType THEN
  9436. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9437. IntermediateCode.MakeMemory(operand.op,addressType);
  9438. ELSE HALT(100);
  9439. END;
  9440. END Dereference;
  9441. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  9442. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  9443. BEGIN
  9444. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  9445. dest := destination; destination := emptyOperand;
  9446. Evaluate(x.left,d);
  9447. type := x.type.resolved;
  9448. prevIsUnchecked := isUnchecked;
  9449. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  9450. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  9451. END;
  9452. Dereference(d,type,IsUnsafePointer(x.left.type));
  9453. isUnchecked := prevIsUnchecked;
  9454. result := d;
  9455. 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
  9456. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  9457. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9458. END;
  9459. END;
  9460. destination := dest;
  9461. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  9462. END VisitDereferenceDesignator;
  9463. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  9464. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  9465. BEGIN
  9466. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  9467. dest := destination; destination := emptyOperand;
  9468. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  9469. tag := result.op;
  9470. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  9471. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  9472. StaticCallOperand(result,procedure.super);
  9473. ReleaseIntermediateOperand(result.tag);
  9474. UseIntermediateOperand(tag); (* necessary ? *)
  9475. result.tag := tag;
  9476. destination := dest;
  9477. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  9478. END VisitSupercallDesignator;
  9479. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  9480. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  9481. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9482. name: Basic.SegmentedName;
  9483. procedure: SyntaxTree.Procedure;
  9484. procedureType: SyntaxTree.ProcedureType;
  9485. BEGIN
  9486. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  9487. dest := destination; destination := emptyOperand;
  9488. scope := currentScope;
  9489. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9490. scope := scope.outerScope;
  9491. END;
  9492. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9493. moduleSection := meta.ModuleSection();
  9494. IF backend.cooperative THEN
  9495. moduleOffset := 0;
  9496. ELSE
  9497. moduleOffset := moduleSection.pc;
  9498. END;
  9499. result.mode := ModeValue;
  9500. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9501. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9502. result.mode := ModeValue;
  9503. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  9504. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  9505. ELSE
  9506. GetBaseRegister(basereg,currentScope,scope);
  9507. InitOperand(result,ModeReference);
  9508. result.op := basereg;
  9509. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9510. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9511. parametersSize := ProcParametersSize(procedure);
  9512. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9513. IF backend.cooperative THEN
  9514. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  9515. END;
  9516. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  9517. MakeMemory(result.op, result.op, addressType, 0);
  9518. END;
  9519. (* tag must be loaded when dereferencing SELF pointer *)
  9520. END;
  9521. destination := dest;
  9522. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  9523. END VisitSelfDesignator;
  9524. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  9525. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  9526. BEGIN
  9527. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  9528. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9529. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9530. parameter := procedureType.returnParameter;
  9531. IF currentIsInline THEN
  9532. map := currentMapper.Get(NIL);
  9533. IF map # NIL THEN
  9534. Designate(map.to, result);
  9535. ELSE
  9536. HALT(200);
  9537. END;
  9538. RETURN;
  9539. END;
  9540. VisitParameter(parameter);
  9541. IF Trace THEN TraceExit("VisitResultDesignator") END;
  9542. END VisitResultDesignator;
  9543. (** values *)
  9544. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  9545. BEGIN
  9546. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  9547. InitOperand(result,ModeValue);
  9548. IF x.value THEN result.op := true ELSE result.op := false END;
  9549. END VisitBooleanValue;
  9550. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  9551. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  9552. BEGIN
  9553. Global.GetModuleSegmentedName(module.module, name);
  9554. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  9555. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  9556. RETURN section
  9557. END GetDataSection;
  9558. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  9559. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  9560. BEGIN
  9561. type := vop.type;
  9562. data := GetDataSection();
  9563. pc := EnterImmediate(data,vop);
  9564. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  9565. IntermediateCode.MakeMemory(vop, type);
  9566. END GetImmediateMem;
  9567. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  9568. BEGIN
  9569. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  9570. InitOperand(result,ModeValue);
  9571. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9572. IF ~supportedImmediate(result.op) &~inData THEN
  9573. GetImmediateMem(result.op)
  9574. END;
  9575. END VisitIntegerValue;
  9576. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  9577. BEGIN
  9578. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  9579. InitOperand(result,ModeValue);
  9580. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  9581. END VisitCharacterValue;
  9582. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  9583. BEGIN
  9584. IF Trace THEN TraceEnter("VisitSetValue") END;
  9585. InitOperand(result,ModeValue);
  9586. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  9587. END VisitSetValue;
  9588. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  9589. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  9590. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  9591. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  9592. BEGIN
  9593. numberElements := x.elements.Length();
  9594. FOR i := 0 TO numberElements-1 DO
  9595. expression := x.elements.GetExpression(i);
  9596. IF expression IS SyntaxTree.MathArrayExpression THEN
  9597. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  9598. ELSE
  9599. inData := TRUE;
  9600. Evaluate(expression,op);
  9601. irv.Emit(Data(position,op.op));
  9602. inData := FALSE;
  9603. ReleaseOperand(op);
  9604. END;
  9605. END;
  9606. END RecursiveData;
  9607. BEGIN
  9608. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  9609. IF ~TryConstantDeclaration() THEN
  9610. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9611. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9612. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9613. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  9614. ELSE
  9615. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9616. END;
  9617. RecursiveData(x.array);
  9618. InitOperand(result,ModeReference);
  9619. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9620. END
  9621. END VisitMathArrayValue;
  9622. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  9623. VAR constant: Sections.Section;
  9624. BEGIN
  9625. IF constantDeclaration = NIL THEN
  9626. RETURN FALSE
  9627. ELSE
  9628. (* Is a constant in this module: did we generate it already? *)
  9629. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  9630. IF constant # NIL THEN
  9631. InitOperand(result,ModeReference);
  9632. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  9633. RETURN TRUE;
  9634. END;
  9635. END;
  9636. RETURN FALSE
  9637. END TryConstantDeclaration;
  9638. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  9639. BEGIN
  9640. constantDeclaration := x;
  9641. VExpression(x.value.resolved);
  9642. END VisitConstant;
  9643. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  9644. BEGIN
  9645. IF Trace THEN TraceEnter("VisitRealValue") END;
  9646. InitOperand(result,ModeValue);
  9647. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9648. END VisitRealValue;
  9649. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  9650. VAR
  9651. componentType: SyntaxTree.Type;
  9652. BEGIN
  9653. IF Trace THEN TraceEnter("VisitComplexValue") END;
  9654. ASSERT(x.type IS SyntaxTree.ComplexType);
  9655. componentType := x.type(SyntaxTree.ComplexType).componentType;
  9656. InitOperand(result,ModeValue);
  9657. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  9658. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  9659. END VisitComplexValue;
  9660. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  9661. VAR i: LONGINT; name: Basic.SegmentedName;
  9662. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  9663. BEGIN
  9664. IF Trace THEN TraceEnter("VisitStringValue") END;
  9665. IF ~TryConstantDeclaration() THEN
  9666. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9667. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9668. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9669. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9670. ELSE
  9671. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9672. END;
  9673. FOR i := 0 TO x.length-1 DO
  9674. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  9675. irv.Emit(Data(position,op));
  9676. END;
  9677. InitOperand(result,ModeReference);
  9678. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9679. result.tag := IntermediateCode.Immediate(addressType,x.length);
  9680. END
  9681. END VisitStringValue;
  9682. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  9683. BEGIN
  9684. IF Trace THEN TraceEnter("VisitNilValue") END;
  9685. InitOperand(result,ModeValue);
  9686. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9687. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9688. END VisitNilValue;
  9689. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  9690. BEGIN
  9691. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  9692. InitOperand(result,ModeValue);
  9693. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  9694. END VisitEnumerationValue;
  9695. (** symbols *)
  9696. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  9697. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  9698. END VisitImport;
  9699. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  9700. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  9701. BEGIN
  9702. WHILE (scope # NIL) & (scope IS SyntaxTree.BlockScope) DO
  9703. scope := scope.outerScope;
  9704. END;
  9705. IF scope # baseScope THEN
  9706. (* left := [fp+8] *)
  9707. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  9708. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9709. ReuseCopy(left,right);
  9710. ReleaseIntermediateOperand(right);
  9711. scope := scope.outerScope; DEC(level);
  9712. (* { left := [left+8] } *)
  9713. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  9714. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9715. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  9716. Emit(Mov(position,left,right));
  9717. scope := scope.outerScope; DEC(level);
  9718. END;
  9719. ASSERT((scope = baseScope) OR (baseScope = NIL));
  9720. result := left;
  9721. ELSE
  9722. result := fp;
  9723. END;
  9724. END GetBaseRegister;
  9725. (* EXPERIMENTAL *)
  9726. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  9727. VAR i: WORD;
  9728. BEGIN
  9729. IF ~backend.experiment THEN RETURN -1 END;
  9730. i := 0;
  9731. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  9732. INC(i);
  9733. END;
  9734. IF availableSymbols[i].symbol = NIL THEN
  9735. availableSymbols[i].inRegister := FALSE;
  9736. availableSymbols[i].inMemory := TRUE;
  9737. availableSymbols[i].symbol := x;
  9738. END;
  9739. RETURN i;
  9740. END GetAvailability;
  9741. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  9742. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  9743. BEGIN
  9744. IF Trace THEN TraceEnter("VisitVariable"); END;
  9745. type := x.type.resolved;
  9746. IF (x.useRegister) THEN
  9747. InitOperand(result, ModeValue);
  9748. IF x.registerNumber < 0 THEN
  9749. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  9750. reg := x.registerNumber;
  9751. ELSE
  9752. reg := registerUsageCount.Map(x.registerNumber);
  9753. UseRegister(reg);
  9754. END;
  9755. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  9756. ELSIF x.externalName # NIL THEN
  9757. InitOperand(result,ModeReference);
  9758. Basic.ToSegmentedName(x.externalName^, name);
  9759. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  9760. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  9761. InitOperand(result,ModeReference);
  9762. GetBaseRegister(result.op,currentScope,x.scope);
  9763. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9764. (* EXPERIMENTAL *)
  9765. result.availability := GetAvailability(x);
  9766. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  9767. InitOperand(result,ModeReference);
  9768. GetCodeSectionNameForSymbol(x,name);
  9769. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9770. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9771. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  9772. InitOperand(result,ModeReference);
  9773. GetCodeSectionNameForSymbol(x,name);
  9774. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9775. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  9776. ELSE (* field, left designator must have been emitted *)
  9777. ASSERT(result.mode = ModeReference);
  9778. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9779. ReuseCopy(temp,result.op);
  9780. ReleaseIntermediateOperand(result.op);
  9781. result.op := temp;
  9782. END;
  9783. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9784. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  9785. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9786. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  9787. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9788. END;
  9789. END;
  9790. END;
  9791. IF type IS SyntaxTree.ProcedureType THEN
  9792. ReleaseIntermediateOperand(result.tag);
  9793. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9794. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9795. UseIntermediateOperand(result.tag);
  9796. ELSE
  9797. result.tag := nil; (* nil *)
  9798. END;
  9799. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9800. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  9801. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9802. ReleaseIntermediateOperand(result.tag);
  9803. Global.GetSymbolSegmentedName(x,name);
  9804. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  9805. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  9806. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  9807. ELSE
  9808. END;
  9809. ELSE
  9810. ReleaseIntermediateOperand(result.tag);
  9811. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9812. END;
  9813. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9814. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  9815. ReleaseIntermediateOperand(result.tag);
  9816. result.tag := result.op;
  9817. UseIntermediateOperand(result.tag);
  9818. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9819. IntermediateCode.MakeMemory(result.op,addressType);
  9820. END;
  9821. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  9822. ReleaseIntermediateOperand(result.tag);
  9823. result.tag := TypeDescriptorAdr(type);
  9824. UseIntermediateOperand(result.tag);
  9825. (* tag for pointer type computed not here but during dereferencing *)
  9826. END;
  9827. IF Trace THEN TraceExit("VisitVariable") END;
  9828. END VisitVariable;
  9829. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  9830. BEGIN
  9831. VisitVariable(property);
  9832. END VisitProperty;
  9833. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  9834. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  9835. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  9836. BEGIN
  9837. type := x.type.resolved;
  9838. IF Trace THEN TraceEnter("VisitParameter") END;
  9839. IF x.ownerType IS SyntaxTree.CellType THEN
  9840. ptype := x.type.resolved;
  9841. IF backend.cellsAreObjects THEN
  9842. ASSERT(result.mode = ModeReference);
  9843. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9844. ReuseCopy(temp,result.op);
  9845. ReleaseIntermediateOperand(result.op);
  9846. result.op := temp;
  9847. END;
  9848. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9849. RETURN;
  9850. ELSE
  9851. InitOperand(result,ModeReference);
  9852. GetCodeSectionNameForSymbol(x,name);
  9853. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9854. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9855. RETURN;
  9856. END;
  9857. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9858. InitOperand(result,ModeReference);
  9859. GetCodeSectionNameForSymbol(x,name);
  9860. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9861. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9862. RETURN
  9863. ELSE
  9864. GetBaseRegister(basereg,currentScope,x.scope);
  9865. InitOperand(result,ModeReference);
  9866. result.op := basereg;
  9867. END;
  9868. IF IsOpenArray(type) THEN
  9869. result.tag := basereg;
  9870. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9871. IntermediateCode.MakeMemory(result.op,addressType);
  9872. IF Global.IsOberonProcedure(x.ownerType) THEN
  9873. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9874. UseIntermediateOperand(result.tag);
  9875. ELSE
  9876. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9877. END;
  9878. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9879. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9880. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9881. ELSIF IsStaticArray(type) THEN
  9882. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9883. IntermediateCode.MakeMemory(result.op,addressType);
  9884. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9885. ELSIF type IS SyntaxTree.MathArrayType THEN
  9886. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9887. WITH type: SyntaxTree.MathArrayType DO
  9888. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9889. IF type.form = SyntaxTree.Tensor THEN
  9890. ELSIF type.form = SyntaxTree.Open THEN
  9891. result.tag := result.op;
  9892. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9893. IntermediateCode.MakeMemory(result.op,addressType);
  9894. UseIntermediateOperand(result.tag);
  9895. ELSIF type.form = SyntaxTree.Static THEN
  9896. IF x.kind = SyntaxTree.ConstParameter THEN
  9897. IntermediateCode.MakeMemory(result.op,addressType);
  9898. END;
  9899. ELSE HALT(100)
  9900. END;
  9901. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9902. IF type.form = SyntaxTree.Tensor THEN
  9903. ToMemory(result.op,addressType,0);
  9904. ELSIF type.form = SyntaxTree.Open THEN
  9905. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9906. ReuseCopy(result.tag, mem);
  9907. ReleaseIntermediateOperand(mem);
  9908. ReleaseIntermediateOperand(result.op);
  9909. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9910. ELSIF type.form = SyntaxTree.Static THEN
  9911. IntermediateCode.MakeMemory(result.op,addressType);
  9912. ELSE HALT(100)
  9913. END;
  9914. ELSE HALT(100)
  9915. END;
  9916. END;
  9917. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9918. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9919. IntermediateCode.MakeMemory(result.op,addressType);
  9920. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9921. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9922. END;
  9923. IF type IS SyntaxTree.ProcedureType THEN
  9924. ReleaseIntermediateOperand(result.tag);
  9925. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9926. IF x.kind = SyntaxTree.VarParameter THEN
  9927. ReuseCopy(result.tag,result.op);
  9928. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9929. IntermediateCode.MakeMemory(result.tag,addressType);
  9930. ELSE
  9931. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9932. UseIntermediateOperand(result.tag);
  9933. END;
  9934. ELSE
  9935. result.tag := nil;
  9936. END;
  9937. (* tag for pointer type computed not here but during dereferencing *)
  9938. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) (* & ~(x.selfParameter) *) THEN
  9939. ReleaseIntermediateOperand(result.tag);
  9940. result.tag := basereg;
  9941. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9942. IntermediateCode.MakeMemory(result.tag,addressType);
  9943. UseIntermediateOperand(result.tag);
  9944. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9945. ReleaseIntermediateOperand(result.tag);
  9946. result.tag := TypeDescriptorAdr(type);
  9947. UseIntermediateOperand(result.tag);
  9948. END;
  9949. IF Trace THEN TraceExit("VisitParameter") END;
  9950. END VisitParameter;
  9951. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9952. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9953. BEGIN
  9954. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9955. (* left.p: left already emitted *)
  9956. tag := result.op; (* value of pointer to left *)
  9957. (* get type desc *)
  9958. tmp := result.tag;
  9959. IntermediateCode.MakeMemory(tmp,addressType);
  9960. (* get method adr *)
  9961. Reuse1(reg,tmp);
  9962. ReleaseIntermediateOperand(tmp);
  9963. IF backend.cooperative THEN
  9964. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9965. WHILE recordType.baseType # NIL DO
  9966. recordType := recordType.GetBaseRecord ();
  9967. END;
  9968. GetRecordTypeName (recordType,name);
  9969. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9970. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9971. offset := 0;
  9972. ELSE
  9973. offset := 2;
  9974. END;
  9975. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9976. ELSIF meta.simple THEN
  9977. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9978. ELSE
  9979. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9980. END;
  9981. InitOperand(operand,ModeReference);
  9982. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9983. operand.op := reg;
  9984. operand.tag := tag;
  9985. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9986. END DynamicCallOperand;
  9987. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9988. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9989. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9990. BEGIN
  9991. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9992. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9993. tag := operand.op;
  9994. ReleaseIntermediateOperand(operand.tag);
  9995. ELSE tag := nil
  9996. END;
  9997. IF x.isInline THEN
  9998. sectionType := Sections.InlineCodeSection;
  9999. ELSE
  10000. sectionType := Sections.CodeSection;
  10001. END;
  10002. IF x.externalName # NIL THEN
  10003. Basic.ToSegmentedName(x.externalName^, name);
  10004. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  10005. ELSE
  10006. GetCodeSectionNameForSymbol(x, name);
  10007. IF (x.scope.ownerModule = module.module) THEN
  10008. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10009. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  10010. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10011. IF source.pc = 0 THEN (* no code yet *)
  10012. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  10013. END;
  10014. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  10015. bits := x.procedureScope.body.code.inlineCode;
  10016. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  10017. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  10018. binary.CopyBits(bits, 0, bits.GetSize());
  10019. source.SetResolved(binary);
  10020. ELSE
  10021. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  10022. END;
  10023. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  10024. END;
  10025. InitOperand(operand,ModeValue);
  10026. operand.op := reg;
  10027. operand.tag := tag;
  10028. IF Trace THEN TraceExit("StaticCallOperand") END;
  10029. END StaticCallOperand;
  10030. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  10031. (* handle expressions of the form designator.procedure or procedure *)
  10032. BEGIN
  10033. IF Trace THEN TraceEnter("VisitProcedure") END;
  10034. EndBasicBlock;
  10035. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  10036. DynamicCallOperand(result,x);
  10037. ELSIF x.isInline THEN
  10038. StaticCallOperand(result,x);
  10039. ELSE
  10040. StaticCallOperand(result,x);
  10041. END;
  10042. IF Trace THEN TraceExit("VisitProcedure") END;
  10043. END VisitProcedure;
  10044. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  10045. BEGIN
  10046. VisitProcedure(x);
  10047. END VisitOperator;
  10048. PROCEDURE VisitAlias(x: SyntaxTree.Alias);
  10049. BEGIN
  10050. VExpression(x.expression);
  10051. END VisitAlias;
  10052. (** statements *)
  10053. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  10054. BEGIN
  10055. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  10056. Expression(x.call);
  10057. IF (x.call.type # NIL) THEN (* procedure returning ignored value *)
  10058. ReleaseOperand(result)
  10059. END;
  10060. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  10061. END VisitProcedureCallStatement;
  10062. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  10063. VAR leftType, rightType: SyntaxTree.MathArrayType;
  10064. leftBase, rightBase: SyntaxTree.Type;
  10065. procedureName,s: SyntaxTree.IdentifierString;
  10066. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  10067. size: LONGINT; rightKind: LONGINT;
  10068. dummy: IntermediateCode.Operand;
  10069. CONST moduleName = "FoxArrayBase";
  10070. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  10071. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  10072. BEGIN
  10073. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  10074. IF base IS SyntaxTree.MathArrayType THEN
  10075. base := OpenArray(base(SyntaxTree.MathArrayType));
  10076. END;
  10077. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  10078. result.SetArrayBase(base);
  10079. RETURN result
  10080. END OpenArray;
  10081. BEGIN
  10082. IF AddImport(moduleName,arrayBase,TRUE) THEN
  10083. SaveRegisters();ReleaseUsedRegisters(saved);
  10084. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  10085. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  10086. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  10087. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  10088. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  10089. IF leftType.form = SyntaxTree.Tensor THEN
  10090. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  10091. ELSIF leftType.form = SyntaxTree.Open THEN
  10092. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  10093. ELSIF leftType.form = SyntaxTree.Static THEN
  10094. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  10095. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  10096. END;
  10097. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  10098. IF procedure = NIL THEN
  10099. s := "Instruction not supported on target, emulation procedure ";
  10100. Strings.Append(s,moduleName);
  10101. Strings.Append(s,".");
  10102. Strings.Append(s,procedureName);
  10103. Strings.Append(s," not present");
  10104. Error(position,s);
  10105. ELSE
  10106. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  10107. parameter.SetType(leftType);
  10108. parameter.SetAccess(SyntaxTree.Internal);
  10109. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10110. parameter.SetKind(rightKind);
  10111. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10112. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  10113. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  10114. StaticCallOperand(result,procedure);
  10115. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  10116. ReleaseOperand(result);
  10117. END;
  10118. RestoreRegisters(saved);
  10119. END;
  10120. END AssignMathArray;
  10121. VAR modifyAssignmentCounter := 0: LONGINT;
  10122. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  10123. VAR processor,mem,dst: IntermediateCode.Operand;
  10124. BEGIN
  10125. IF value.intValue = true.intValue THEN
  10126. INC(modifyAssignmentCounter);
  10127. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  10128. modifyAssignmentsPC := section.pc;
  10129. ELSE
  10130. DEC(modifyAssignmentCounter);
  10131. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  10132. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  10133. END;
  10134. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  10135. dst := NewRegisterOperand (addressType);
  10136. Emit(Mov(position,dst, processor));
  10137. IntermediateCode.InitMemory(mem,bool, dst, 0);
  10138. Emit(Mov(position,mem, value));
  10139. ReleaseIntermediateOperand(dst);
  10140. END ModifyAssignments;
  10141. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  10142. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  10143. BEGIN
  10144. type := left.type.resolved;
  10145. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  10146. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  10147. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  10148. IF procedureType.returnParameter = parameter THEN
  10149. (* this is the only case where the destination can be dynamically smaller than the source
  10150. in all other cases the dynamic size has to be taken
  10151. *)
  10152. IF backend.cooperative THEN
  10153. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  10154. ELSE
  10155. MakeMemory(mem, tag, addressType, 0);
  10156. END;
  10157. RETURN mem;
  10158. END;
  10159. END;
  10160. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  10161. END CopySize;
  10162. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  10163. VAR
  10164. leftO, rightO: Operand;
  10165. arg,mem, sizeOp: IntermediateCode.Operand;
  10166. leftType, rightType, componentType, base: SyntaxTree.Type;
  10167. size: LONGINT;
  10168. parameters: SyntaxTree.ExpressionList;
  10169. procedure: SyntaxTree.Procedure;
  10170. call: SyntaxTree.ProcedureCallDesignator;
  10171. designator: SyntaxTree.Designator;
  10172. saved: RegisterEntry;
  10173. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  10174. VAR procedureType: SyntaxTree.ProcedureType;
  10175. BEGIN
  10176. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  10177. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  10178. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  10179. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  10180. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  10181. WITH right: SyntaxTree.BuiltinCallDesignator DO
  10182. IF right.id = Global.Reshape THEN RETURN TRUE
  10183. END;
  10184. END;
  10185. END;
  10186. END;
  10187. RETURN FALSE
  10188. END CanPassAsResultParameter;
  10189. BEGIN
  10190. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  10191. leftType := left.type.resolved; rightType:= right.type.resolved;
  10192. IF backend.cooperative & left.NeedsTrace() THEN
  10193. ModifyAssignments(true);
  10194. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  10195. Designate(right, rightO);
  10196. Designate(left, leftO);
  10197. ASSERT(leftO.mode = ModeReference);
  10198. TransferToRegister(leftO.op, leftO.op);
  10199. TransferToRegister(rightO.op, rightO.op);
  10200. Emit(Push(position, leftO.op));
  10201. Emit(Push(position, rightO.op));
  10202. CallAssignMethod(leftO.op, rightO.op, left.type);
  10203. Emit(Pop(position, rightO.op));
  10204. Emit(Pop(position, leftO.op));
  10205. sizeOp := CopySize(left, leftO.tag);
  10206. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10207. ReleaseIntermediateOperand(sizeOp);
  10208. ReleaseOperand(leftO);
  10209. ReleaseOperand(rightO);
  10210. ELSE
  10211. Evaluate(right,rightO);
  10212. Designate(left,leftO);
  10213. ASSERT(leftO.mode = ModeReference);
  10214. IF (leftType IS SyntaxTree.ProcedureType) THEN
  10215. (* copy procedure address first *)
  10216. MakeMemory(mem,leftO.op,addressType,0);
  10217. Emit(Mov(position,mem,rightO.op));
  10218. ReleaseIntermediateOperand(mem);
  10219. (* copy pointer address *)
  10220. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10221. CallAssignPointer(leftO.tag, rightO.tag);
  10222. ELSE
  10223. ASSERT(system.SizeOf(left.type) = system.addressSize);
  10224. CallAssignPointer(leftO.op, rightO.op);
  10225. END;
  10226. ReleaseOperand(leftO);
  10227. ReleaseOperand(rightO);
  10228. END;
  10229. ModifyAssignments(false);
  10230. RETURN;
  10231. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  10232. SaveRegisters();ReleaseUsedRegisters(saved);
  10233. IF SemanticChecker.IsPointerType(leftType) THEN
  10234. Evaluate(right,rightO);
  10235. Designate(left,leftO);
  10236. Emit(Push(position,leftO.op));
  10237. ReleaseOperand(leftO);
  10238. Emit(Push(position,rightO.op));
  10239. ReleaseOperand(rightO);
  10240. CallThis(position,"Heaps","Assign",2);
  10241. ELSIF leftType.IsRecordType() THEN
  10242. Designate(right,rightO);
  10243. Designate(left,leftO);
  10244. Emit(Push(position,leftO.op));
  10245. Emit(Push(position,leftO.tag)); (* type desc *)
  10246. ReleaseOperand(leftO);
  10247. Emit(Push(position,rightO.op));
  10248. ReleaseOperand(rightO);
  10249. CallThis(position,"Heaps","AssignRecord",3);
  10250. ELSIF IsStaticArray(leftType) THEN
  10251. size := StaticArrayNumElements(leftType);
  10252. base := StaticArrayBaseType(leftType);
  10253. Designate(right,rightO);
  10254. Designate(left,leftO);
  10255. Emit(Push(position,leftO.op));
  10256. ReleaseOperand(leftO);
  10257. arg := TypeDescriptorAdr(base);
  10258. Emit(Push(position,arg));
  10259. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10260. Emit(Push(position,rightO.op));
  10261. ReleaseOperand(rightO);
  10262. CallThis(position,"Heaps","AssignArray",4);
  10263. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  10264. size := StaticMathArrayNumElements(leftType);
  10265. base := StaticMathArrayBaseType(leftType);
  10266. Designate(right,rightO);
  10267. Designate(left,leftO);
  10268. Emit(Push(position,leftO.op));
  10269. ReleaseOperand(leftO);
  10270. arg := TypeDescriptorAdr(base);
  10271. Emit(Push(position,arg));
  10272. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10273. Emit(Push(position,rightO.op));
  10274. ReleaseOperand(rightO);
  10275. CallThis(position,"Heaps","AssignArray",4);
  10276. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  10277. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  10278. Evaluate(right,rightO);
  10279. Designate(left,leftO);
  10280. MakeMemory(mem,leftO.op,addressType,0);
  10281. Emit(Mov(position,mem,rightO.op));
  10282. ReleaseIntermediateOperand(mem);
  10283. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10284. Emit (Push(position, leftO.tag));
  10285. ReleaseOperand(leftO);
  10286. Emit (Push(position, rightO.tag));
  10287. ReleaseOperand(rightO);
  10288. CallThis(position,"Heaps","Assign", 2);
  10289. ELSE HALT(100); (* missing ? *)
  10290. END;
  10291. RestoreRegisters(saved);
  10292. RETURN;
  10293. END;
  10294. IF CanPassAsResultParameter(right) THEN
  10295. procedureResultDesignator := left(SyntaxTree.Designator);
  10296. Expression(right);
  10297. procedureResultDesignator := NIL;
  10298. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  10299. (* left <-- ALIAS OF right: zerocopy *)
  10300. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  10301. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  10302. designator.SetType(procedure.type);
  10303. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  10304. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  10305. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  10306. END;
  10307. ELSIF leftType IS SyntaxTree.RangeType THEN
  10308. (* LHS is of array range type *)
  10309. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  10310. Evaluate(right, rightO);
  10311. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  10312. (* first *)
  10313. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  10314. Emit(Mov(position,mem, rightO.op));
  10315. ReleaseIntermediateOperand(mem);
  10316. (* last *)
  10317. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10318. Emit(Mov(position,mem, rightO.tag));
  10319. ReleaseIntermediateOperand(mem);
  10320. (* step *)
  10321. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10322. Emit(Mov(position,mem, rightO.extra));
  10323. ReleaseIntermediateOperand(mem);
  10324. ReleaseOperand(rightO);
  10325. ReleaseOperand(leftO)
  10326. ELSIF leftType IS SyntaxTree.ComplexType THEN
  10327. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  10328. Evaluate(right, rightO);
  10329. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  10330. componentType := leftType(SyntaxTree.ComplexType).componentType;
  10331. (* real part *)
  10332. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  10333. Emit(Mov(position,mem, rightO.op));
  10334. ReleaseIntermediateOperand(mem);
  10335. (* imaginary part *)
  10336. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10337. Emit(Mov(position,mem, rightO.tag));
  10338. ReleaseIntermediateOperand(mem);
  10339. ReleaseOperand(rightO);
  10340. ReleaseOperand(leftO)
  10341. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  10342. OR (leftType IS SyntaxTree.PortType) THEN
  10343. (* rightO := leftO;*)
  10344. Evaluate(right,rightO);
  10345. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  10346. Designate(left,leftO);
  10347. IF leftO.mode = ModeReference THEN
  10348. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  10349. destination := mem;
  10350. ELSE
  10351. destination := leftO.op;
  10352. END;
  10353. ReleaseOperand(leftO);
  10354. (* EXPERIMENTAL *)
  10355. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  10356. ReleaseIntermediateOperand(destination);
  10357. destination := availableSymbols[leftO.availability].register;
  10358. UseIntermediateOperand(destination);
  10359. availableSymbols[leftO.availability].inMemory := FALSE;
  10360. END;
  10361. IF destination.mode # IntermediateCode.Undefined THEN
  10362. Emit(Mov(position,destination,rightO.op));
  10363. END;
  10364. ReleaseOperand(rightO);
  10365. ReleaseIntermediateOperand(mem);
  10366. IntermediateCode.InitOperand(destination);
  10367. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  10368. Evaluate(right,rightO);
  10369. Designate(left,leftO);
  10370. MakeMemory(mem,leftO.op,addressType,0);
  10371. Emit(Mov(position,mem,rightO.op));
  10372. ReleaseIntermediateOperand(mem);
  10373. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  10374. (* delegate *)
  10375. (*
  10376. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  10377. *)
  10378. Emit(Mov(position,leftO.tag,rightO.tag));
  10379. END;
  10380. ReleaseOperand(leftO);
  10381. ReleaseOperand(rightO);
  10382. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  10383. Designate(right,rightO);
  10384. Designate(left,leftO);
  10385. sizeOp := CopySize(left, leftO.tag);
  10386. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10387. ReleaseIntermediateOperand(sizeOp);
  10388. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10389. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  10390. IF (rightType IS SyntaxTree.StringType) THEN
  10391. CopyString(left,right);
  10392. 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
  10393. Designate(right,rightO);
  10394. Designate(left,leftO);
  10395. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10396. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10397. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10398. ELSE
  10399. HALT(201)
  10400. END;
  10401. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  10402. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  10403. Designate(right,rightO);
  10404. Designate(left,leftO);
  10405. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10406. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  10407. MakeMemory(mem, rightO.op, leftO.op.type,0);
  10408. Emit(Mov(position, leftO.op, mem));
  10409. ReleaseIntermediateOperand(mem);
  10410. ELSE
  10411. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10412. END;
  10413. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10414. ELSE
  10415. AssignMathArray(left,right);
  10416. END;
  10417. ELSE
  10418. HALT(200);
  10419. END;
  10420. END Assign;
  10421. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  10422. BEGIN
  10423. IF Trace THEN TraceEnter("VisitAssignment") END;
  10424. Assign(x.left,x.right);
  10425. IF Trace THEN TraceExit("VisitAssignment") END;
  10426. END VisitAssignment;
  10427. PROCEDURE EmitCooperativeSwitch;
  10428. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  10429. BEGIN
  10430. ASSERT (cooperativeSwitches);
  10431. pc := section.pc;
  10432. IF lastSwitchPC = section.pc THEN RETURN END;
  10433. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  10434. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  10435. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  10436. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  10437. INC(statCoopSwitch, section.pc - pc);
  10438. END EmitCooperativeSwitch;
  10439. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  10440. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  10441. BEGIN
  10442. p0 := communication.left; p1 := communication.right;
  10443. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  10444. Evaluate(p0,s0);
  10445. Evaluate(p1,s1);
  10446. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10447. Emit(Push(position,s0.op));
  10448. Emit(Push(position,s1.op));
  10449. (*
  10450. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10451. *)
  10452. IF ~backend.cellsAreObjects THEN
  10453. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  10454. END;
  10455. ReleaseOperand(s0);
  10456. ReleaseOperand(s1);
  10457. IF backend.cellsAreObjects THEN
  10458. CallThis(position,"ActiveCellsRuntime","Send",2);
  10459. ELSE
  10460. CallThis(position,ChannelModuleName,"Send",2);
  10461. END;
  10462. (* ----- RECEIVE ------*)
  10463. ELSE
  10464. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  10465. tmp := p0; p0 := p1; p1 := tmp;
  10466. END;
  10467. Evaluate(p0,s0);
  10468. Emit(Push(position,s0.op));
  10469. Designate(p1,s1);
  10470. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10471. Emit(Push(position,s1.op));
  10472. (*
  10473. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10474. *)
  10475. IF ~backend.cellsAreObjects THEN
  10476. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  10477. END;
  10478. ReleaseOperand(s0);
  10479. ReleaseOperand(s1);
  10480. IF backend.cellsAreObjects THEN
  10481. CallThis(position,"ActiveCellsRuntime","Receive",2);
  10482. ELSE
  10483. CallThis(position,ChannelModuleName,"Receive",2)
  10484. END;
  10485. END;
  10486. END VisitCommunicationStatement;
  10487. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  10488. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  10489. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  10490. VAR false: Label; condition, value: BOOLEAN;
  10491. BEGIN
  10492. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  10493. IF condition THEN
  10494. false := NewLabel();
  10495. Condition(if.condition,false,FALSE);
  10496. StatementSequence(if.statements);
  10497. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  10498. SetLabel(false);
  10499. ELSE
  10500. IF value THEN (* always true *)
  10501. escape := TRUE;
  10502. StatementSequence(if.statements);
  10503. (* no branch necessary -- rest skipped *)
  10504. END;
  10505. END;
  10506. END IfPart;
  10507. BEGIN
  10508. IF Trace THEN TraceEnter("VisitIfStatement") END;
  10509. end := NewLabel();
  10510. elsifs := x.ElsifParts();
  10511. IfPart(x.ifPart,elsifs=0);
  10512. FOR i := 0 TO elsifs-1 DO
  10513. IF ~escape THEN
  10514. elsif := x.GetElsifPart(i);
  10515. IfPart(elsif, i=elsifs-1);
  10516. END;
  10517. END;
  10518. IF (x.elsePart # NIL) & ~escape THEN
  10519. StatementSequence(x.elsePart);
  10520. END;
  10521. SetLabel(end);
  10522. IF Trace THEN TraceExit("VisitIfStatement") END;
  10523. END VisitIfStatement;
  10524. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  10525. VAR reg: IntermediateCode.Operand;
  10526. BEGIN
  10527. trueL := NewLabel();
  10528. IF backend.cooperative THEN
  10529. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  10530. Emit(Mov(position,reg,tag));
  10531. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  10532. ReleaseIntermediateOperand(reg);
  10533. ELSE
  10534. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  10535. END;
  10536. END BrWithPart;
  10537. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  10538. BEGIN
  10539. StatementSequence(x.statements);
  10540. END EmitWithPart;
  10541. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  10542. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  10543. tag: IntermediateCode.Operand;
  10544. BEGIN
  10545. IF Trace THEN TraceEnter("VisitWithStatement") END;
  10546. endL := NewLabel();
  10547. elseL := NewLabel();
  10548. Designate(x.variable,res);
  10549. IF IsPointerToRecord(x.variable.type,recordType) THEN
  10550. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  10551. END;
  10552. ReuseCopy(tag, res.tag);
  10553. ReleaseOperand(res);
  10554. NEW(trueL, x.WithParts());
  10555. FOR i := 0 TO x.WithParts()-1 DO
  10556. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  10557. END;
  10558. ReleaseIntermediateOperand(tag);
  10559. BrL(elseL);
  10560. FOR i := 0 TO x.WithParts()-1 DO
  10561. SetLabel(trueL[i]);
  10562. EmitWithPart(x.GetWithPart(i));
  10563. BrL(endL);
  10564. END;
  10565. SetLabel(elseL);
  10566. IF x.elsePart = NIL THEN
  10567. IF ~isUnchecked THEN
  10568. EmitTrap(position,WithTrap);
  10569. END;
  10570. ELSE
  10571. StatementSequence(x.elsePart)
  10572. END;
  10573. SetLabel(endL);
  10574. IF Trace THEN TraceExit("VisitWithStatement") END;
  10575. END VisitWithStatement;
  10576. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  10577. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  10578. out,else: Label; label: Label;
  10579. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  10580. symbol: SyntaxTree.Symbol;
  10581. table: BOOLEAN;
  10582. BEGIN
  10583. (*! split case statement into if-elsif statements for large case label lists *)
  10584. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  10585. range := x.max-x.min+1;
  10586. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  10587. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  10588. table := FALSE;
  10589. size := x.caseParts.Length();
  10590. ELSE
  10591. table := TRUE;
  10592. size := LONGINT(range);
  10593. END;
  10594. Evaluate(x.variable,var);
  10595. ReuseCopy(tmp,var.op);
  10596. ReleaseIntermediateOperand(var.op);
  10597. var.op := tmp;
  10598. (*
  10599. UniqueId(name,module.module,"case",caseId);
  10600. *)
  10601. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  10602. else := NewLabel();
  10603. IF table THEN
  10604. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  10605. Convert(var.op,addressType);
  10606. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  10607. ReuseCopy(res,var.op);
  10608. ReleaseOperand(var);
  10609. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  10610. Global.GetModuleSegmentedName(module.module, name);
  10611. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  10612. symbol := SyntaxTree.NewSymbol(name[1]);
  10613. symbol.SetScope(moduleScope);
  10614. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  10615. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  10616. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  10617. Emit(Add(position,res,res,jmp));
  10618. IntermediateCode.MakeMemory(res,addressType);
  10619. Emit(Br(position,res));
  10620. ReleaseIntermediateOperand(res);
  10621. ELSE
  10622. ReuseCopy(res,var.op); (* make sure it is in a register *)
  10623. ReleaseOperand(var);
  10624. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  10625. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  10626. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10627. part := x.GetCasePart(i);
  10628. constant := part.firstConstant;
  10629. fixups[i] := NewLabel();
  10630. WHILE(constant # NIL) DO (* case labels for this case part *)
  10631. IF constant.min = constant.max THEN
  10632. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  10633. ELSE
  10634. label := NewLabel();
  10635. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  10636. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  10637. BrL(fixups[i]);
  10638. SetLabel(label);
  10639. END;
  10640. constant := constant.next;
  10641. END;
  10642. END;
  10643. BrL(else);
  10644. ReleaseIntermediateOperand(res);
  10645. END;
  10646. out := NewLabel();
  10647. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10648. part := x.GetCasePart(i);
  10649. constant := part.firstConstant;
  10650. IF table THEN
  10651. label := NewLabel();
  10652. SetLabel(label);
  10653. WHILE(constant # NIL) DO (* case labels for this case part *)
  10654. FOR j := constant.min TO constant.max DO
  10655. fixups[j-x.min] := label;
  10656. END;
  10657. constant := constant.next;
  10658. END;
  10659. ELSE
  10660. SetLabel(fixups[i]);
  10661. END;
  10662. StatementSequence(part.statements);
  10663. BrL(out);
  10664. END;
  10665. SetLabel(else);
  10666. FOR i := 0 TO size-1 DO
  10667. IF fixups[i] = NIL THEN
  10668. fixups[i] := else;
  10669. END;
  10670. END;
  10671. IF x.elsePart # NIL THEN
  10672. StatementSequence(x.elsePart);
  10673. ELSIF ~isUnchecked THEN
  10674. EmitTrap(position,CaseTrap);
  10675. END;
  10676. SetLabel(out);
  10677. IF table THEN
  10678. FOR i := 0 TO size-1 DO
  10679. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  10680. section.Emit(Data(position,op));
  10681. END;
  10682. END;
  10683. IF Trace THEN TraceExit("VisitCaseStatement") END;
  10684. END VisitCaseStatement;
  10685. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  10686. VAR startL,falseL: Label;
  10687. BEGIN
  10688. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  10689. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10690. startL := NewLabel();
  10691. falseL := NewLabel();
  10692. SetLabel(startL);
  10693. Condition(x.condition,falseL,FALSE);
  10694. StatementSequence(x.statements);
  10695. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10696. BrL(startL);
  10697. SetLabel(falseL);
  10698. IF Trace THEN TraceExit("VisitWhileStatement") END;
  10699. END VisitWhileStatement;
  10700. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  10701. VAR falseL: Label;
  10702. BEGIN
  10703. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  10704. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10705. falseL := NewLabel();
  10706. SetLabel(falseL);
  10707. StatementSequence(x.statements);
  10708. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10709. Condition(x.condition,falseL,FALSE);
  10710. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  10711. END VisitRepeatStatement;
  10712. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  10713. VAR
  10714. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  10715. temporaryVariable: SyntaxTree.Variable;
  10716. temporaryVariableDesignator : SyntaxTree.Designator;
  10717. BEGIN
  10718. IF Trace THEN TraceEnter("VisitForStatement") END;
  10719. falseL := NewLabel();
  10720. startL := NewLabel();
  10721. Assign(x.variable,x.from);
  10722. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  10723. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  10724. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  10725. Assign(temporaryVariableDesignator,x.to);
  10726. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  10727. IF by > 0 THEN
  10728. cmp := Scanner.LessEqual
  10729. ELSE
  10730. cmp := Scanner.GreaterEqual
  10731. END;
  10732. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  10733. binary.SetType(system.booleanType);
  10734. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10735. SetLabel(startL);
  10736. Condition(binary,falseL, FALSE);
  10737. StatementSequence(x.statements);
  10738. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  10739. binary.SetType(x.variable.type);
  10740. Assign(x.variable,binary);
  10741. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10742. BrL(startL);
  10743. SetLabel(falseL);
  10744. IF Trace THEN TraceExit("VisitForStatement") END;
  10745. END VisitForStatement;
  10746. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  10747. VAR prevLoop: Label;
  10748. BEGIN
  10749. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  10750. prevLoop := currentLoop;
  10751. currentLoop := NewLabel();
  10752. StatementSequence(x.statements);
  10753. SetLabel(currentLoop);
  10754. currentLoop := prevLoop;
  10755. IF Trace THEN TraceExit("VisitExitableBlock") END;
  10756. END VisitExitableBlock;
  10757. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  10758. VAR prevLoop,start: Label;
  10759. BEGIN
  10760. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  10761. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10762. start := NewLabel();
  10763. prevLoop := currentLoop;
  10764. SetLabel(start);
  10765. currentLoop := NewLabel();
  10766. StatementSequence(x.statements);
  10767. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10768. BrL(start);
  10769. SetLabel(currentLoop);
  10770. currentLoop := prevLoop;
  10771. IF Trace THEN TraceExit("VisitLoopStatement") END;
  10772. END VisitLoopStatement;
  10773. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  10774. VAR outer: SyntaxTree.Statement;
  10775. BEGIN
  10776. IF Trace THEN TraceEnter("VisitExitStatement") END;
  10777. IF locked THEN (* r if we jump out of an exclusive block *)
  10778. outer := x.outer;
  10779. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  10780. outer := outer.outer;
  10781. END;
  10782. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  10783. Lock(FALSE);
  10784. END;
  10785. END;
  10786. BrL(currentLoop);
  10787. IF Trace THEN TraceExit("VisitExitStatement") END;
  10788. END VisitExitStatement;
  10789. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  10790. VAR
  10791. expression, parameterDesignator: SyntaxTree.Expression;
  10792. type, componentType: SyntaxTree.Type;
  10793. res, right: Operand;
  10794. left, mem, reg: IntermediateCode.Operand;
  10795. parameter: SyntaxTree.Parameter;
  10796. procedure: SyntaxTree.Procedure;
  10797. procedureType: SyntaxTree.ProcedureType;
  10798. returnTypeOffset: LONGINT;
  10799. delegate: BOOLEAN;
  10800. map: SymbolMap;
  10801. callingConvention, parametersSize: LONGINT;
  10802. BEGIN
  10803. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  10804. expression := x.returnValue;
  10805. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  10806. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10807. IF currentIsInline THEN
  10808. IF expression # NIL THEN
  10809. map := currentMapper.Get(NIL);
  10810. IF map # NIL THEN
  10811. Assign(map.to, expression);
  10812. ELSE
  10813. Evaluate(expression,res);
  10814. Emit(Return(position,res.op));
  10815. ReleaseOperand(res);
  10816. END;
  10817. END;
  10818. BrL(currentInlineExit);
  10819. RETURN;
  10820. END;
  10821. IF expression # NIL THEN
  10822. type := expression.type.resolved;
  10823. IF (expression IS SyntaxTree.ResultDesignator) THEN
  10824. IF locked THEN Lock(FALSE) END;
  10825. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10826. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10827. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  10828. 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
  10829. (* return without structured return parameter *)
  10830. Evaluate(expression,res);
  10831. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  10832. IF locked OR profile THEN
  10833. Emit(Push(position,res.op));
  10834. IF delegate THEN HALT(200) END;
  10835. ReleaseOperand(res);
  10836. IF locked THEN Lock(FALSE) END;
  10837. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10838. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10839. reg := NewRegisterOperand(res.op.type);
  10840. Emit(Pop(position,reg));
  10841. Emit(Return(position,reg));
  10842. ReleaseIntermediateOperand(reg);
  10843. ELSE
  10844. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10845. Emit(Return(position,res.op));
  10846. ReleaseOperand(res);
  10847. END;
  10848. 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()
  10849. THEN
  10850. (* return using structured return parameter *)
  10851. 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)
  10852. OR (type IS SyntaxTree.StringType)
  10853. OR SemanticChecker.IsPointerType(type));
  10854. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10855. parameter :=procedureType.returnParameter;
  10856. ASSERT(parameter # NIL);
  10857. returnTypeOffset := parameter.offsetInBits;
  10858. (*
  10859. IF parameter# NIL THEN
  10860. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10861. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10862. ELSE
  10863. returnTypeOffset := system.offsetFirstParameter
  10864. END;
  10865. *)
  10866. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10867. IF type IS SyntaxTree.RangeType THEN
  10868. (* array range type *)
  10869. Evaluate(expression, right);
  10870. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10871. Emit(Mov(position,mem, right.op)); (* first *)
  10872. ReleaseIntermediateOperand(mem);
  10873. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10874. Emit(Mov(position,mem, right.tag)); (* last *)
  10875. ReleaseIntermediateOperand(mem);
  10876. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10877. Emit(Mov(position,mem, right.extra)); (* step *)
  10878. ReleaseIntermediateOperand(mem);
  10879. ReleaseOperand(right);
  10880. ELSIF type IS SyntaxTree.ComplexType THEN
  10881. Evaluate(expression, right);
  10882. componentType := type(SyntaxTree.ComplexType).componentType;
  10883. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10884. Emit(Mov(position,mem, right.op)); (* real part *)
  10885. ReleaseIntermediateOperand(mem);
  10886. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10887. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10888. ReleaseIntermediateOperand(mem);
  10889. ReleaseOperand(right);
  10890. ELSE (* covers cases: pointer / record / array *)
  10891. parameter := procedureType.returnParameter;
  10892. checker.SetCurrentScope(currentScope);
  10893. ASSERT(parameter # NIL);
  10894. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10895. Assign(parameterDesignator,expression);
  10896. END;
  10897. ReleaseIntermediateOperand(left);
  10898. IF locked THEN Lock(FALSE) END;
  10899. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10900. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10901. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10902. parameter := procedureType.returnParameter;
  10903. checker.SetCurrentScope(currentScope);
  10904. IF parameter = NIL THEN
  10905. Error(procedure.position, "structured return of parameter of procedure not found");
  10906. ELSE
  10907. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10908. Assign(parameterDesignator,expression);
  10909. END;
  10910. IF locked THEN Lock(FALSE) END;
  10911. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10912. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10913. ELSE
  10914. HALT(200);
  10915. END;
  10916. ELSE
  10917. IF locked THEN Lock(FALSE) END;
  10918. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10919. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10920. END;
  10921. IF backend.cooperative THEN
  10922. BrL(exitLabel);
  10923. ELSE
  10924. callingConvention := procedureType.callingConvention;
  10925. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10926. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10927. ELSE
  10928. parametersSize := 0;
  10929. END;
  10930. EmitLeave(section, position,procedure, callingConvention);
  10931. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10932. END;
  10933. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10934. END VisitReturnStatement;
  10935. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10936. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10937. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10938. statements: SyntaxTree.StatementSequence;
  10939. name, suffix: SyntaxTree.IdentifierString;
  10940. BEGIN
  10941. Strings.IntToStr(awaitProcCounter,suffix);
  10942. Strings.Concat("@AwaitProcedure",suffix,name);
  10943. identifier := SyntaxTree.NewIdentifier(name);
  10944. INC(awaitProcCounter);
  10945. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10946. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10947. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10948. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10949. procedure.SetAccess(SyntaxTree.Hidden);
  10950. procedure.SetScope(currentScope);
  10951. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10952. procedureType.SetReturnType(system.booleanType);
  10953. procedure.SetType(procedureType);
  10954. body := SyntaxTree.NewBody(x.position,procedureScope);
  10955. procedureScope.SetBody(body);
  10956. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10957. returnStatement.SetReturnValue(x.condition);
  10958. statements := SyntaxTree.NewStatementSequence();
  10959. statements.AddStatement(returnStatement);
  10960. body.SetStatementSequence(statements);
  10961. currentScope.AddProcedure(procedure);
  10962. RETURN procedure
  10963. END MakeAwaitProcedure;
  10964. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10965. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10966. call: IntermediateCode.Operand; label, startL, trueL: Label; name: Basic.SegmentedName;
  10967. BEGIN
  10968. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10969. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10970. IF backend.cooperative THEN
  10971. startL := NewLabel();
  10972. trueL := NewLabel();
  10973. SetLabel(startL);
  10974. Condition(x.condition,trueL,TRUE);
  10975. PushSelfPointer();
  10976. CallThis(position,"ExclusiveBlocks","Await",1);
  10977. BrL(startL);
  10978. SetLabel(trueL);
  10979. PushSelfPointer();
  10980. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10981. ELSE
  10982. proc := MakeAwaitProcedure(x);
  10983. Emit(Push(position,fp));
  10984. GetCodeSectionNameForSymbol(proc,name);
  10985. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10986. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10987. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10988. Emit(Call(position,call,ProcParametersSize(proc)));
  10989. Emit(Result(position,res));
  10990. (*
  10991. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10992. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10993. *)
  10994. InitOperand(result,ModeValue);
  10995. result.op := res;
  10996. label := NewLabel();
  10997. BreqL(label, result.op, SELF.true);
  10998. ReleaseOperand(result);
  10999. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  11000. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  11001. Emit(Push(position,res));
  11002. Emit(Push(position,fp));
  11003. PushSelfPointer();
  11004. Emit(Push(position,nil));
  11005. CallThis(position,"Objects","Await",4);
  11006. SetLabel(label);
  11007. END;
  11008. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11009. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  11010. END VisitAwaitStatement;
  11011. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  11012. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  11013. BEGIN
  11014. FOR i := 0 TO x.Length() - 1 DO
  11015. statement := x.GetStatement( i );
  11016. Statement(statement);
  11017. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  11018. END;
  11019. END StatementSequence;
  11020. PROCEDURE PushSelfPointer;
  11021. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  11022. procedureType: SyntaxTree.ProcedureType;
  11023. BEGIN
  11024. scope := currentScope;
  11025. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  11026. scope := scope.outerScope;
  11027. END;
  11028. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  11029. moduleSection := meta.ModuleSection();
  11030. IF backend.cooperative THEN
  11031. moduleOffset := 0;
  11032. ELSE
  11033. moduleOffset := moduleSection.pc;
  11034. END;
  11035. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  11036. ELSE
  11037. GetBaseRegister(op.op,currentScope,scope);
  11038. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11039. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11040. parametersSize := ProcParametersSize(procedure);
  11041. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  11042. IF backend.cooperative THEN
  11043. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  11044. END;
  11045. IntermediateCode.MakeMemory(op.op,addressType);
  11046. END;
  11047. Emit(Push(position,op.op));
  11048. ReleaseOperand(op);
  11049. END PushSelfPointer;
  11050. PROCEDURE Lock(lock: BOOLEAN);
  11051. BEGIN
  11052. IF Trace THEN TraceEnter("Lock") END;
  11053. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  11054. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  11055. ASSERT(modifyAssignmentCounter = 0);
  11056. IF dump # NIL THEN
  11057. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  11058. dump.Ln;dump.Update;
  11059. END;
  11060. PushSelfPointer;
  11061. IF backend.cooperative THEN
  11062. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  11063. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  11064. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  11065. END;
  11066. ELSE
  11067. Emit(Push(position,true));
  11068. IF lock THEN CallThis(position,"Objects","Lock",2)
  11069. ELSE CallThis(position,"Objects","Unlock",2);
  11070. END;
  11071. END;
  11072. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11073. IF Trace THEN TraceExit("Lock") END;
  11074. END Lock;
  11075. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  11076. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  11077. prevScope: SyntaxTree.Scope;
  11078. BEGIN
  11079. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  11080. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11081. previouslyUnchecked := isUnchecked;
  11082. isUnchecked := isUnchecked OR x.isUnchecked;
  11083. previouslyCooperativeSwitches := cooperativeSwitches;
  11084. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  11085. prevScope := currentScope;
  11086. IF x.scope # NIL THEN currentScope := x.scope END;
  11087. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  11088. IF x.statements # NIL THEN
  11089. StatementSequence(x.statements);
  11090. END;
  11091. IF (x IS SyntaxTree.Body) THEN
  11092. IF (x(SyntaxTree.Body).finally # NIL) THEN
  11093. section.SetFinally(section.pc);
  11094. StatementSequence(x(SyntaxTree.Body).finally)
  11095. ELSIF x.isExclusive THEN
  11096. end := NewLabel();
  11097. BrL(end);
  11098. section.SetFinally(section.pc);
  11099. Lock(FALSE);
  11100. EmitTrap(position,RethrowTrap);
  11101. SetLabel(end);
  11102. END;
  11103. END;
  11104. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  11105. isUnchecked := previouslyUnchecked;
  11106. cooperativeSwitches := previouslyCooperativeSwitches;
  11107. currentScope := prevScope;
  11108. IF Trace THEN TraceExit("VisitStatementBlock") END;
  11109. END VisitStatementBlock;
  11110. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  11111. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  11112. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  11113. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  11114. procedure: SyntaxTree.Procedure;
  11115. map: SymbolMap;
  11116. callingConvention, parametersSize: LONGINT;
  11117. BEGIN
  11118. scope := currentScope;
  11119. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  11120. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11121. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11122. return := emptyOperand;
  11123. IF Trace THEN TraceEnter("VisitCode") END;
  11124. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  11125. NEW(in, x.inRules.Length());
  11126. FOR i := 0 TO LEN(in)-1 DO
  11127. statement := x.inRules.GetStatement(i);
  11128. WITH statement: SyntaxTree.Assignment DO
  11129. Evaluate(statement.right, operand);
  11130. result := operand.op;
  11131. NEW(str, 64);
  11132. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  11133. in[i] := result; IntermediateCode.SetString(in[i], str);
  11134. ReleaseIntermediateOperand(operand.tag);
  11135. END;
  11136. END;
  11137. ELSE in := NIL
  11138. END;
  11139. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  11140. NEW(out, x.outRules.Length());
  11141. FOR i := 0 TO LEN(out)-1 DO
  11142. statement := x.outRules.GetStatement(i);
  11143. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  11144. WITH statement:
  11145. SyntaxTree.Assignment DO
  11146. Designate(statement.left, operand);
  11147. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  11148. NEW(str, 64);
  11149. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  11150. out[i] := result; IntermediateCode.SetString(out[i], str);
  11151. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  11152. | SyntaxTree.ReturnStatement DO
  11153. NEW(str, 64);
  11154. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  11155. IF currentIsInline THEN
  11156. map := currentMapper.Get(NIL);
  11157. Designate(map.to, operand);
  11158. IF map.isAddress THEN
  11159. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11160. ELSE
  11161. result := operand.op;
  11162. END;
  11163. (*! only if it does not fit into register
  11164. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11165. *)
  11166. (*Evaluate(map.to, operand);*)
  11167. out[i] := result;
  11168. ELSE
  11169. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  11170. END;
  11171. IntermediateCode.SetString(out[i], str);
  11172. ReleaseIntermediateOperand(operand.tag);
  11173. return := out[i];
  11174. ELSE
  11175. END;
  11176. END;
  11177. ELSE out := NIL
  11178. END;
  11179. Emit(Asm(x.position,x.sourceCode, in, out));
  11180. IF in # NIL THEN
  11181. FOR i := 0 TO LEN(in)-1 DO
  11182. ReleaseIntermediateOperand(in[i]);
  11183. END;
  11184. END;
  11185. IF out # NIL THEN
  11186. FOR i := 0 TO LEN(out)-1 DO
  11187. WITH statement:
  11188. SyntaxTree.Assignment DO
  11189. ReleaseIntermediateOperand(out[i]);
  11190. |SyntaxTree.ReturnStatement DO
  11191. (* release happens below *)
  11192. ELSE
  11193. END;
  11194. statement := x.outRules.GetStatement(i);
  11195. END;
  11196. END;
  11197. IF return.mode # IntermediateCode.Undefined THEN
  11198. IF currentIsInline THEN
  11199. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  11200. Symbol(procedureType.returnParameter, par);
  11201. MakeMemory(mem, par.op, return.type, 0);
  11202. ReleaseOperand(par);
  11203. Emit(Mov(position, mem, return));
  11204. ReleaseIntermediateOperand(mem);
  11205. ELSE
  11206. Emit(Return(position,return));
  11207. END;
  11208. ReleaseIntermediateOperand(return);
  11209. IF currentIsInline THEN RETURN END;
  11210. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  11211. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  11212. parametersSize := ProcedureParametersSize(backend.system,procedure);
  11213. ELSE
  11214. parametersSize := 0;
  11215. END;
  11216. EmitLeave(section, position,procedure, callingConvention);
  11217. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  11218. END;
  11219. IF Trace THEN TraceExit("VisitCode") END;
  11220. END VisitCode;
  11221. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  11222. BEGIN
  11223. RETURN ProcedureParametersSize(system, procedure);
  11224. END ProcParametersSize;
  11225. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  11226. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  11227. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  11228. const, call: IntermediateCode.Operand;
  11229. parameterDesignator: SyntaxTree.Expression;
  11230. saved: RegisterEntry;
  11231. name: Basic.SegmentedName;
  11232. BEGIN
  11233. IF Trace THEN TraceEnter("ParameterCopies") END;
  11234. parameter := x.firstParameter;
  11235. WHILE parameter # NIL DO
  11236. IF parameter.kind = SyntaxTree.ValueParameter THEN
  11237. type := parameter.type.resolved;
  11238. IF IsOpenArray(type) THEN
  11239. VisitParameter(parameter);
  11240. op := result;
  11241. IF backend.cooperative & parameter.NeedsTrace() THEN
  11242. length := GetArrayLength(type, op.tag);
  11243. size := NewRegisterOperand(addressType);
  11244. base := ArrayBaseType(type);
  11245. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  11246. Emit(Mul(position, size, length, const));
  11247. dst := NewRegisterOperand (addressType);
  11248. Emit(Mov(position, dst, size));
  11249. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11250. Emit(Sub(position,dst,sp,dst));
  11251. Emit(And(position,dst,dst,const));
  11252. Emit(Mov(position,sp,dst));
  11253. par := fp;
  11254. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11255. IntermediateCode.InitImmediate(null, byteType, 0);
  11256. Emit(Fill(position, dst, size, null));
  11257. ReleaseIntermediateOperand(dst);
  11258. ReleaseIntermediateOperand(length);
  11259. SaveRegisters();ReleaseUsedRegisters(saved);
  11260. (* register dst has been freed before SaveRegisters already *)
  11261. base := ArrayBaseType(type);
  11262. (* assign method of open array *)
  11263. IF base.IsRecordType() THEN
  11264. Emit (Push(position, length));
  11265. Emit (Push(position, dst));
  11266. Emit (Push(position, op.op));
  11267. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  11268. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  11269. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  11270. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  11271. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  11272. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  11273. Emit (Push(position,length));
  11274. Emit (Push(position, dst));
  11275. Emit (Push(position, length));
  11276. Emit (Push(position, op.op));
  11277. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  11278. ELSE
  11279. Emit (Push(position, length));
  11280. Emit (Push(position, dst));
  11281. Emit (Push(position, length));
  11282. Emit (Push(position, op.op));
  11283. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  11284. ASSERT(ArrayBaseType(type).IsPointer());
  11285. END;
  11286. RestoreRegisters(saved);
  11287. ELSE
  11288. temp := GetDynamicSize(type,op.tag);
  11289. ReuseCopy(size,temp);
  11290. ReleaseIntermediateOperand(temp);
  11291. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11292. Emit(Sub(position,size,sp,size));
  11293. Emit(And(position,size,size,const));
  11294. Emit(Mov(position,sp,size));
  11295. par := fp;
  11296. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11297. ReleaseIntermediateOperand(size);
  11298. size := GetDynamicSize(type,op.tag);
  11299. END;
  11300. Emit(Copy(position,sp,op.op,size));
  11301. ReleaseIntermediateOperand(size);
  11302. ReleaseOperand(op);
  11303. IntermediateCode.MakeMemory(par,addressType);
  11304. Emit(Mov(position,par,sp));
  11305. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  11306. checker.SetCurrentScope(currentScope);
  11307. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  11308. Assign(parameterDesignator,parameterDesignator);
  11309. END;
  11310. END;
  11311. parameter := parameter.nextParameter;
  11312. END;
  11313. IF Trace THEN TraceExit("ParameterCopies") END;
  11314. END ParameterCopies;
  11315. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  11316. VAR x: SyntaxTree.Variable;
  11317. BEGIN
  11318. x := scope.firstVariable;
  11319. WHILE x # NIL DO
  11320. InitVariable(x,FALSE);
  11321. x := x.nextVariable;
  11322. END;
  11323. END InitVariables;
  11324. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  11325. BEGIN
  11326. IF (symbol # NIL) THEN
  11327. RETURN fingerprinter.SymbolFP(symbol).public
  11328. ELSE
  11329. RETURN 0
  11330. END;
  11331. END GetFingerprint;
  11332. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  11333. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  11334. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  11335. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  11336. name: Basic.SegmentedName;
  11337. offset: LONGINT;
  11338. BEGIN
  11339. IF Trace THEN TraceEnter("Body") END;
  11340. ReleaseUsedRegisters(saved); (* just in case ... *)
  11341. section := ir;
  11342. exitLabel := NewLabel ();
  11343. IF moduleBody THEN moduleBodySection := section END;
  11344. IF ir.comments # NIL THEN
  11345. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  11346. commentPrintout.SingleStatement(TRUE);
  11347. dump := ir.comments;
  11348. ELSE
  11349. commentPrintout := NIL;
  11350. dump := NIL;
  11351. END;
  11352. prevScope := currentScope;
  11353. currentScope := scope;
  11354. lastSwitchPC := 0;
  11355. cooperativeSwitches := backend.cooperative;
  11356. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11357. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11358. IF x # NIL THEN
  11359. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11360. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  11361. IF moduleBody THEN
  11362. ProfilerInit();
  11363. ELSE
  11364. Basic.SegmentedNameToString(ir.name, string);
  11365. ProfilerAddProcedure(numberProcedures,string);
  11366. ProfilerEnterExit(numberProcedures,TRUE);
  11367. END;
  11368. END;
  11369. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  11370. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  11371. END;
  11372. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  11373. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  11374. cellScope := scope.outerScope(SyntaxTree.CellScope);
  11375. IF procedure = cellScope.bodyProcedure THEN
  11376. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  11377. StaticCallOperand(op, cellScope.constructor);
  11378. Emit(Call(position,op.op,0));
  11379. END;
  11380. END;
  11381. END;
  11382. InitVariables(scope);
  11383. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  11384. GetCodeSectionNameForSymbol(procedure, name);
  11385. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  11386. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  11387. IF ProtectModulesPointers THEN
  11388. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  11389. ELSE
  11390. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  11391. END;
  11392. IntermediateCode.SetOffset(right,offset); (* tag *)
  11393. IntermediateCode.InitMemory(left,addressType,fp,0);
  11394. Emit(Mov(position, left, right));
  11395. END;
  11396. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  11397. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  11398. ParameterCopies(procedureType);
  11399. IF x.code = NIL THEN
  11400. VisitStatementBlock(x);
  11401. ELSE
  11402. VisitCode(x.code)
  11403. END;
  11404. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  11405. IF ~backend.cooperative THEN
  11406. ProfilerEnterExit(numberProcedures,FALSE);
  11407. END;
  11408. INC(numberProcedures);
  11409. END;
  11410. END;
  11411. IF backend.cooperative THEN
  11412. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  11413. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  11414. END;
  11415. IF x # NIL THEN
  11416. SELF.position := x.position;
  11417. END;
  11418. EndBasicBlock;
  11419. CheckRegistersFree();
  11420. ASSERT(modifyAssignmentCounter = 0);
  11421. currentScope := prevScope;
  11422. IF Trace THEN TraceExit("Body") END;
  11423. END Body;
  11424. END ImplementationVisitor;
  11425. MetaDataGenerator=OBJECT
  11426. VAR
  11427. implementationVisitor: ImplementationVisitor;
  11428. declarationVisitor: DeclarationVisitor;
  11429. module: Sections.Module;
  11430. moduleName: ARRAY 128 OF CHAR;
  11431. moduleNamePool: Basic.HashTableInt;
  11432. moduleNamePoolSection: IntermediateCode.Section;
  11433. modulePointerSection: IntermediateCode.Section;
  11434. modulePointerSizePC: LONGINT;
  11435. modulePointerSectionOffset: LONGINT;
  11436. modulePointers: LONGINT;
  11437. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  11438. RecordBaseOffset: LONGINT;
  11439. MethodTableOffset: LONGINT; (* method table offset from zero *)
  11440. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  11441. TypeTags: LONGINT; (* type extension level support *)
  11442. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  11443. patchInfoPC: LONGINT;
  11444. patchCRC: LONGINT;
  11445. CONST
  11446. EmptyBlockOffset = 2;
  11447. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  11448. BEGIN
  11449. IF implementationVisitor.backend.cooperative THEN
  11450. TypeTags := MAX(LONGINT);
  11451. BaseTypesTableOffset := 0;
  11452. MethodTableOffset := 2;
  11453. TypeRecordBaseOffset := 0;
  11454. RecordBaseOffset := 0;
  11455. ELSIF simple THEN
  11456. TypeTags := 3; (* only 3 extensions allowed *)
  11457. BaseTypesTableOffset := 1;
  11458. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  11459. TypeRecordBaseOffset := 0;
  11460. RecordBaseOffset := 1;
  11461. ELSE
  11462. TypeTags := 16;
  11463. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  11464. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  11465. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  11466. (* change this when Heaps.HeapBlock is modified *)
  11467. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  11468. RecordBaseOffset := 8; (* addresses *)
  11469. ELSE
  11470. RecordBaseOffset := 9; (* addresses *)
  11471. END;
  11472. END;
  11473. SELF.simple := simple;
  11474. SELF.implementationVisitor := implementationVisitor;
  11475. SELF.declarationVisitor := declarationVisitor;
  11476. implementationVisitor.meta := SELF;
  11477. declarationVisitor.meta := SELF;
  11478. END InitMetaDataGenerator;
  11479. PROCEDURE SetModule(module: Sections.Module);
  11480. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  11481. BEGIN
  11482. SELF.module := module;
  11483. Global.GetModuleName(module.module,moduleName);
  11484. Global.GetSymbolSegmentedName(module.module, name);
  11485. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  11486. NEW(moduleNamePool, 32);
  11487. (*! require GC protection *)
  11488. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  11489. IF ProtectModulesPointers THEN
  11490. name := "Heaps.AnyPtr";
  11491. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11492. (* set base pointer *)
  11493. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  11494. END;
  11495. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  11496. modulePointers := 0;
  11497. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  11498. AddPointer(moduleNamePoolSection, namePoolOffset);
  11499. END;
  11500. END SetModule;
  11501. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  11502. BEGIN
  11503. IF ~implementationVisitor.backend.cooperative THEN
  11504. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  11505. INC(modulePointers);
  11506. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  11507. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  11508. END;
  11509. END AddPointer;
  11510. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  11511. BEGIN
  11512. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  11513. END GetTypeRecordBaseOffset;
  11514. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11515. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  11516. BEGIN
  11517. (* change this when Heaps.HeapBlock is modified *)
  11518. INC(dataAdrOffset,7);
  11519. Info(section,"headerAdr");
  11520. Address(section,0);
  11521. Info(section,"typeDesc");
  11522. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  11523. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11524. NamedSymbol(section, name, symbol, 0, offset);
  11525. Info(section,"mark: LONGINT;");
  11526. Longint(section,-1);
  11527. Info(section,"refCount: LONGINT;");
  11528. Longint(section,0);
  11529. (*
  11530. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  11531. *)
  11532. Info(section,"dataAdr-: ADDRESS");
  11533. Symbol(section,section, dataAdrOffset,0);
  11534. Info(section,"size-: SIZE");
  11535. Address(section,0);
  11536. Info(section,"nextMark: HeapBlock;");
  11537. Address(section,0);
  11538. END HeapBlock;
  11539. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11540. VAR i: LONGINT;
  11541. BEGIN
  11542. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  11543. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  11544. Info(section,"count*: LONGINT");
  11545. Longint(section,0);
  11546. Info(section,"locked*: BOOLEAN");
  11547. Longint(section,0);
  11548. Info(section,"awaitingLock*: ProcessQueue");
  11549. Address(section,0);
  11550. Address(section,0);
  11551. Info(section,"awaitingCond*: ProcessQueue");
  11552. Address(section,0);
  11553. Address(section,0);
  11554. Info(section,"lockedBy*: ANY");
  11555. Address(section,0);
  11556. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  11557. Longint(section,1);
  11558. FOR i := 2 TO 6 DO
  11559. Longint(section,0);
  11560. END;
  11561. Info(section,"lock*: ANY");
  11562. Address(section,0);
  11563. END ProtectedHeapBlock;
  11564. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  11565. BEGIN
  11566. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  11567. END Info;
  11568. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  11569. VAR op: IntermediateCode.Operand;
  11570. BEGIN
  11571. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  11572. section.Emit(Data(Basic.invalidPosition,op));
  11573. END Address;
  11574. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  11575. VAR op: IntermediateCode.Operand;
  11576. BEGIN
  11577. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11578. section.Emit(Data(Basic.invalidPosition,op));
  11579. END Size;
  11580. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  11581. VAR op: IntermediateCode.Operand;
  11582. BEGIN
  11583. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  11584. section.Emit(Data(Basic.invalidPosition,op));
  11585. END Set;
  11586. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  11587. VAR op: IntermediateCode.Operand;
  11588. BEGIN
  11589. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11590. section.Emit(Data(Basic.invalidPosition,op));
  11591. END Longint;
  11592. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11593. VAR op,noOperand: IntermediateCode.Operand;
  11594. BEGIN
  11595. IntermediateCode.InitOperand(noOperand);
  11596. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11597. section.PatchOperands(pc,op,noOperand,noOperand);
  11598. END PatchSize;
  11599. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11600. VAR op,noOperand: IntermediateCode.Operand;
  11601. BEGIN
  11602. IntermediateCode.InitOperand(noOperand);
  11603. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11604. section.PatchOperands(pc,op,noOperand,noOperand);
  11605. END PatchLongint;
  11606. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11607. VAR op, noOperand: IntermediateCode.Operand;
  11608. BEGIN
  11609. IntermediateCode.InitOperand(noOperand);
  11610. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11611. section.PatchOperands(pc,op,noOperand,noOperand);
  11612. END PatchSymbol;
  11613. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  11614. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  11615. BEGIN
  11616. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  11617. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  11618. section.Emit(Data(Basic.invalidPosition,op));
  11619. END Boolean;
  11620. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  11621. VAR op: IntermediateCode.Operand;
  11622. BEGIN
  11623. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  11624. section.Emit(Data(Basic.invalidPosition,op));
  11625. END Char;
  11626. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  11627. VAR i: LONGINT;
  11628. BEGIN
  11629. Info(section,str);
  11630. i := 0;
  11631. WHILE(str[i] # 0X) DO
  11632. Char(section,str[i]);
  11633. INC(i);
  11634. END;
  11635. Char(section,0X);
  11636. END String;
  11637. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  11638. VAR s: Basic.SectionName;
  11639. BEGIN
  11640. StringPool.GetString(str, s);
  11641. String(section, s);
  11642. END String0;
  11643. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11644. VAR op: IntermediateCode.Operand;
  11645. BEGIN
  11646. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11647. IntermediateCode.SetOffset(op,realOffset);
  11648. section.Emit(Data(Basic.invalidPosition,op));
  11649. END NamedSymbol;
  11650. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11651. VAR op: IntermediateCode.Operand;
  11652. BEGIN
  11653. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11654. IntermediateCode.SetOffset(op,realOffset);
  11655. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  11656. END NamedSymbolAt;
  11657. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  11658. BEGIN
  11659. IF symbol= NIL THEN
  11660. Address( section, realOffset);
  11661. ASSERT(virtualOffset = 0);
  11662. ELSE
  11663. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  11664. END;
  11665. END Symbol;
  11666. (* OutPointers delivers
  11667. {pointerOffset}
  11668. *)
  11669. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  11670. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  11671. BEGIN
  11672. type := type.resolved;
  11673. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  11674. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11675. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11676. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  11677. Symbol(section, symbol, 0, offset); INC(numberPointers);
  11678. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  11679. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11680. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  11681. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  11682. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  11683. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  11684. ELSIF (type IS SyntaxTree.RecordType) THEN
  11685. (* never treat a record like a pointer, even if the pointer field is set! *)
  11686. WITH type: SyntaxTree.RecordType DO
  11687. base := type.GetBaseRecord();
  11688. IF base # NIL THEN
  11689. Pointers(offset,symbol,section, base,numberPointers);
  11690. END;
  11691. variable := type.recordScope.firstVariable;
  11692. WHILE(variable # NIL) DO
  11693. IF ~(variable.untraced) THEN
  11694. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11695. END;
  11696. variable := variable.nextVariable;
  11697. END;
  11698. END;
  11699. ELSIF (type IS SyntaxTree.CellType) THEN
  11700. WITH type: SyntaxTree.CellType DO
  11701. base := type.GetBaseRecord();
  11702. IF base # NIL THEN
  11703. Pointers(offset,symbol,section, base,numberPointers);
  11704. END;
  11705. variable := type.cellScope.firstVariable;
  11706. WHILE(variable # NIL) DO
  11707. IF ~(variable.untraced) THEN
  11708. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11709. END;
  11710. variable := variable.nextVariable;
  11711. END;
  11712. property := type.firstProperty;
  11713. WHILE(property # NIL) DO
  11714. IF ~(property.untraced) THEN
  11715. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  11716. END;
  11717. property := property.nextProperty;
  11718. END;
  11719. parameter := type.firstParameter;
  11720. WHILE(parameter # NIL) DO
  11721. IF ~(parameter.untraced) THEN
  11722. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  11723. END;
  11724. parameter := parameter.nextParameter;
  11725. END;
  11726. END;
  11727. ELSIF (type IS SyntaxTree.ArrayType) THEN
  11728. WITH type: SyntaxTree.ArrayType DO
  11729. IF type.form= SyntaxTree.Static THEN
  11730. n := type.staticLength;
  11731. base := type.arrayBase.resolved;
  11732. WHILE(base IS SyntaxTree.ArrayType) DO
  11733. type := base(SyntaxTree.ArrayType);
  11734. n := n* type.staticLength;
  11735. base := type.arrayBase.resolved;
  11736. END;
  11737. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11738. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  11739. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11740. FOR i := 0 TO n-1 DO
  11741. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11742. END;
  11743. END;
  11744. ELSE
  11745. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  11746. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11747. END;
  11748. END;
  11749. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  11750. WITH type: SyntaxTree.MathArrayType DO
  11751. IF type.form = SyntaxTree.Static THEN
  11752. n := type.staticLength;
  11753. base := type.arrayBase.resolved;
  11754. WHILE(base IS SyntaxTree.MathArrayType) DO
  11755. type := base(SyntaxTree.MathArrayType);
  11756. n := n* type.staticLength;
  11757. base := type.arrayBase.resolved;
  11758. END;
  11759. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11760. IF SemanticChecker.ContainsPointer(base) THEN
  11761. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11762. FOR i := 0 TO n-1 DO
  11763. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11764. END;
  11765. END;
  11766. ELSE
  11767. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  11768. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11769. END
  11770. END;
  11771. (* ELSE no pointers in type *)
  11772. END;
  11773. END Pointers;
  11774. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  11775. VAR position,i: LONGINT; ch: CHAR;
  11776. BEGIN
  11777. IF pool.Has(index) THEN
  11778. RETURN pool.GetInt(index)
  11779. ELSE
  11780. position := source.pc;
  11781. pool.PutInt(index, position);
  11782. Info(source, name);
  11783. i := 0;
  11784. REPEAT
  11785. ch := name[i]; INC(i);
  11786. Char( source, ch);
  11787. UNTIL ch = 0X;
  11788. END;
  11789. RETURN position;
  11790. END EnterDynamicName;
  11791. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  11792. VAR name: Basic.SectionName; position: LONGINT;
  11793. BEGIN
  11794. IF pool.Has(index) THEN
  11795. RETURN pool.GetInt(index)
  11796. ELSE
  11797. StringPool.GetString(index, name);
  11798. position := EnterDynamicName(source,name,index, pool);
  11799. END;
  11800. RETURN position;
  11801. END DynamicName;
  11802. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  11803. VAR section: IntermediateCode.Section;
  11804. BEGIN
  11805. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11806. IF implementationVisitor.backend.cooperative THEN
  11807. Info(section, "TypeDescriptor");
  11808. Basic.ToSegmentedName("BaseTypes.Array", name);
  11809. NamedSymbol(section, name,NIL, 0, 0);
  11810. BasePointer(section);
  11811. offset := 0;
  11812. ELSE
  11813. IF ProtectModulesPointers THEN
  11814. HeapBlock(mName,typeName,section,2);
  11815. END;
  11816. Info(section, "HeapBlock");
  11817. IF ProtectModulesPointers THEN
  11818. Symbol(section,section,2,0);
  11819. ELSE
  11820. Address(section,0);
  11821. END;
  11822. Info(section, "TypeDescriptor");
  11823. Address(section,0);
  11824. offset := section.pc;
  11825. END;
  11826. RETURN section
  11827. END NamedBlock;
  11828. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  11829. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  11830. BEGIN
  11831. COPY(moduleName,name);
  11832. Strings.Append(name,suffix);
  11833. Basic.ToSegmentedName(name, pooledName);
  11834. RETURN NamedBlock(mName, typeName, pooledName, offset);
  11835. END Block;
  11836. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  11837. VAR name: Basic.SegmentedName;
  11838. BEGIN
  11839. Info(source,"ArrayHeader");
  11840. IF implementationVisitor.backend.cooperative THEN
  11841. sizePC := source.pc;
  11842. Address(source,0);
  11843. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  11844. IF baseType # "" THEN
  11845. Basic.ToSegmentedName(baseType, name);
  11846. NamedSymbol(source, name,NIL, 0, 0);
  11847. ELSE
  11848. Address(source,0);
  11849. END;
  11850. Address(source,0);
  11851. ELSE
  11852. Address(source,0);
  11853. Address(source,0);
  11854. (* first pointer for GC *)
  11855. IF hasPointer THEN
  11856. (* points to first element in the array, this is NOT the base type descriptor *)
  11857. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11858. ELSE
  11859. Address(source,0);
  11860. END;
  11861. sizePC := source.pc;
  11862. Address(source,0);
  11863. Info(source,"array data");
  11864. END;
  11865. END ArrayBlock;
  11866. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11867. BEGIN
  11868. IF implementationVisitor.backend.cooperative THEN
  11869. PatchSize(section, pc, size);
  11870. PatchSize(section, pc + 3, size);
  11871. ELSE
  11872. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11873. PatchSize(section, pc, size);
  11874. END;
  11875. END PatchArray;
  11876. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11877. VAR
  11878. i: LONGINT; section: Sections.Section; fingerprinter : Fingerprinter.Fingerprinter;
  11879. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11880. poolMap: Basic.HashTableInt;
  11881. namePool: IntermediateCode.Section;
  11882. namePoolOffset: LONGINT;
  11883. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11884. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11885. BEGIN
  11886. Basic.SegmentedNameToString(s1.name,n1);
  11887. Basic.SegmentedNameToString(s2.name,n2);
  11888. index := 0;
  11889. ch1 := n1[index];
  11890. ch2 := n2[index];
  11891. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11892. INC(index);
  11893. ch1 := n1[index];
  11894. ch2 := n2[index];
  11895. END;
  11896. RETURN ch1 < ch2;
  11897. END Compare;
  11898. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11899. VAR
  11900. i, j: LONGINT;
  11901. x, t: Sections.Section;
  11902. BEGIN
  11903. IF lo < hi THEN
  11904. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11905. WHILE i <= j DO
  11906. WHILE Compare(list[i], x) DO INC(i) END;
  11907. WHILE Compare(x, list[j]) DO DEC(j) END;
  11908. IF i <= j THEN
  11909. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11910. INC(i); DEC(j)
  11911. END
  11912. END;
  11913. IF lo < j THEN QuickSort(list, lo, j) END;
  11914. IF i < hi THEN QuickSort(list, i, hi) END
  11915. END;
  11916. END QuickSort;
  11917. (*
  11918. ExportDesc* = RECORD
  11919. fp*: ADDRESS;
  11920. name* {UNTRACED}: DynamicName;
  11921. adr*: ADDRESS;
  11922. exports*: LONGINT;
  11923. dsc* {UNTRACED}: ExportArray
  11924. END;
  11925. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11926. *)
  11927. PROCEDURE ExportDesc2(
  11928. source: IntermediateCode.Section;
  11929. namePool: IntermediateCode.Section;
  11930. fingerprinter: Fingerprinter.Fingerprinter;
  11931. symbol: Sections.Section;
  11932. name: StringPool.Index;
  11933. VAR patchAdr: LONGINT
  11934. ): BOOLEAN;
  11935. VAR fingerprint: SyntaxTree.Fingerprint;
  11936. BEGIN
  11937. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11938. & (symbol.type # Sections.InlineCodeSection)
  11939. THEN
  11940. *)
  11941. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11942. & (symbol.type # Sections.ExitCodeSection)
  11943. & (symbol.type # Sections.InlineCodeSection))
  11944. THEN
  11945. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11946. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11947. fingerprint := fingerprinter.SymbolFP(symbol.symbol);
  11948. Longint(source,fingerprint.public);
  11949. ELSE
  11950. Longint(source, 0);
  11951. END;
  11952. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11953. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11954. Symbol(source, symbol,0,0);
  11955. patchAdr := source.pc;
  11956. Longint(source, 0);
  11957. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11958. Address(source,0);
  11959. END;
  11960. RETURN TRUE
  11961. ELSE
  11962. RETURN FALSE
  11963. END;
  11964. END ExportDesc2;
  11965. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11966. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11967. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11968. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11969. nextPatch: LONGINT;
  11970. TYPE
  11971. Scope = RECORD
  11972. elements: LONGINT;
  11973. gelements: LONGINT;
  11974. section: IntermediateCode.Section;
  11975. patchAdr: LONGINT;
  11976. arraySizePC: LONGINT;
  11977. beginPC: LONGINT; (* current scope start pc *)
  11978. END;
  11979. BEGIN
  11980. Basic.InitSegmentedName(prev);
  11981. olevel := -1;
  11982. scopes[0].section := source;
  11983. scopes[0].arraySizePC := MIN(LONGINT);
  11984. FOR s := 0 TO LEN(sections)-1 DO
  11985. symbol := sections[s];
  11986. 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
  11987. this := sections[s].name;
  11988. level := 0;
  11989. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11990. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11991. INC(level);
  11992. END;
  11993. WHILE level < olevel DO
  11994. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11995. IF olevel > 0 THEN
  11996. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11997. nextPatch := scopes[olevel-1].patchAdr+1;
  11998. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11999. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12000. END;
  12001. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12002. DEC(olevel);
  12003. END;
  12004. IF (level < LEN(this)) & (this[level] > 0) THEN
  12005. IF level > olevel THEN
  12006. (*TRACE("opening",level); *)
  12007. IF scopes[level].section = NIL THEN
  12008. arrayName := ".@ExportArray";
  12009. Strings.AppendInt(arrayName, level);
  12010. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  12011. AddPointer(scopes[level].section,offset);
  12012. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  12013. END;
  12014. scopes[level].beginPC := scopes[level].section.pc;
  12015. olevel := level;
  12016. scopes[olevel].elements := 0;
  12017. END;
  12018. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  12019. sym := sections[s];
  12020. ELSE
  12021. sym := NIL;
  12022. END;
  12023. IF ExportDesc2(scopes[level].section, namePool, fingerprinter, sym, this[level], scopes[level].patchAdr)
  12024. THEN
  12025. INC(scopes[olevel].elements);
  12026. END;
  12027. (* enter string in scope *)
  12028. INC(level);
  12029. END;
  12030. END;
  12031. Basic.SegmentedNameToString(this, name);
  12032. prev := this;
  12033. END;
  12034. END;
  12035. WHILE 0 <= olevel DO
  12036. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  12037. IF olevel > 0 THEN
  12038. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12039. nextPatch := scopes[olevel-1].patchAdr+1;
  12040. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12041. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12042. END;
  12043. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12044. DEC(olevel);
  12045. END;
  12046. level := 0;
  12047. WHILE (level < LEN(scopes)) DO
  12048. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  12049. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  12050. END;
  12051. INC(level);
  12052. END;
  12053. END Export;
  12054. BEGIN
  12055. NEW(fingerprinter);
  12056. NEW(poolMap, 64);
  12057. (* 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 *)
  12058. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  12059. NEW(sectionArray, module.allSections.Length());
  12060. FOR i := 0 TO module.allSections.Length() - 1 DO
  12061. section := module.allSections.GetSection(i);
  12062. sectionArray[i] := section;
  12063. END;
  12064. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  12065. Export(sectionArray^);
  12066. END ExportDesc;
  12067. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  12068. VAR
  12069. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  12070. BEGIN
  12071. Info(source, "exception table offsets array descriptor");
  12072. size := 0;
  12073. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  12074. Info(source, "exception table content");
  12075. FOR i := 0 TO module.allSections.Length() - 1 DO
  12076. p := module.allSections.GetSection(i);
  12077. IF p.type = Sections.CodeSection THEN
  12078. finallyPC := p(IntermediateCode.Section).finally;
  12079. IF finallyPC>=0 THEN
  12080. Symbol( source, p, 0,0);
  12081. Symbol( source, p, finallyPC, 0);
  12082. Symbol( source, p, finallyPC,0);
  12083. INC(size);
  12084. END;
  12085. END
  12086. END;
  12087. PatchArray(source,sizePC,size);
  12088. END ExceptionArray;
  12089. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  12090. VAR i: LONGINT; ch: CHAR;
  12091. BEGIN
  12092. i := 0;
  12093. REPEAT
  12094. ch := name[i]; INC(i);
  12095. Char( section, ch);
  12096. UNTIL ch = 0X;
  12097. WHILE i < 32 DO
  12098. Char( section, 0X); INC(i);
  12099. END;
  12100. END Name;
  12101. PROCEDURE References(section: IntermediateCode.Section);
  12102. CONST
  12103. sfTypeNone = 0X;
  12104. sfTypeCHAR = 01X;
  12105. sfTypeCHAR8 = 02X;
  12106. sfTypeCHAR16 = 03X;
  12107. sfTypeCHAR32 = 04X;
  12108. sfTypeRANGE = 05X;
  12109. sfTypeSHORTINT = 06X;
  12110. sfTypeINTEGER = 07X;
  12111. sfTypeLONGINT = 08X;
  12112. sfTypeHUGEINT = 09X;
  12113. sfTypeWORD = 0AX;
  12114. sfTypeLONGWORD = 0BX;
  12115. sfTypeSIGNED8 = 0CX;
  12116. sfTypeSIGNED16 = 0DX;
  12117. sfTypeSIGNED32 = 0EX;
  12118. sfTypeSIGNED64 = 0FX;
  12119. sfTypeUNSIGNED8 = 10X;
  12120. sfTypeUNSIGNED16 = 11X;
  12121. sfTypeUNSIGNED32 = 12X;
  12122. sfTypeUNSIGNED64 = 13X;
  12123. sfTypeREAL = 14X;
  12124. sfTypeLONGREAL = 15X;
  12125. sfTypeCOMPLEX = 16X;
  12126. sfTypeLONGCOMPLEX = 17X;
  12127. sfTypeBOOLEAN = 18X;
  12128. sfTypeSET = 19X;
  12129. sfTypeANY = 1AX;
  12130. sfTypeOBJECT = 1BX;
  12131. sfTypeBYTE = 1CX;
  12132. sfTypeADDRESS = 1DX;
  12133. sfTypeSIZE = 1EX;
  12134. sfTypeIndirect = 1FX;
  12135. sfTypeRecord = 20X;
  12136. sfTypePointerToRecord = 21X;
  12137. sfTypePointerToArray = 22X;
  12138. sfTypeOpenArray = 23X;
  12139. sfTypeStaticArray = 24X;
  12140. sfTypeDynamicArray = 25X;
  12141. sfTypeMathStaticArray = 26X;
  12142. sfTypeMathOpenArray = 27X;
  12143. sfTypeMathTensor = 28X;
  12144. sfTypeProcedure = 29X;
  12145. sfTypeDelegate = 2AX;
  12146. sfTypeENUM = 2BX;
  12147. (* sfTypeCELL = 2CX; *)
  12148. sfTypePORT = 2DX;
  12149. sfIN = 0X;
  12150. sfOUT = 1X;
  12151. flagDelegate = 0;
  12152. flagConstructor = 1;
  12153. (* variable / parameter addressing modes *)
  12154. sfAbsolute = 0X; (* global vars *)
  12155. sfRelative = 1X; (* variables, value parameters *)
  12156. sfIndirect = 2X; (* var parameters *)
  12157. sfScopeBegin = 0F0X;
  12158. sfScopeEnd = 0F1X;
  12159. sfProcedure = 0F2X;
  12160. sfVariable = 0F3X;
  12161. sfTypeDeclaration = 0F4X;
  12162. sfModule = 0FFX;
  12163. RefInfo = TRUE;
  12164. VAR
  12165. sizePC, startPC, lastOffset: LONGINT;
  12166. indirectTypes: Basic.HashTable;
  12167. PROCEDURE CurrentIndex(): LONGINT;
  12168. VAR i: LONGINT;
  12169. BEGIN
  12170. FOR i := startPC TO section.pc -1 DO
  12171. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  12172. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  12173. END;
  12174. startPC := section.pc;
  12175. RETURN lastOffset;
  12176. END CurrentIndex;
  12177. (*
  12178. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12179. Module = sfModule prevSymbol:SIZE name:String Scope.
  12180. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12181. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  12182. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12183. Type =
  12184. sfTypePointerToRecord
  12185. | sfTypePointerToArray Type
  12186. | sfTypeOpenArray Type
  12187. | sfTypeDynamicArray Type
  12188. | sfTypeStaticArray length:SIZE Type
  12189. | sfTypeMathOpenArray Type
  12190. | sfTypeMathStaticArray length:SIZE Type
  12191. | sfTypeMathTensor Type
  12192. | sfTypeRecord tdAdr:ADDRESS
  12193. | sfTypeProcedure {Parameter} return:Type
  12194. | sfTypeDelegate {Parameter} return:Type
  12195. | sfTypePort (sfIN | sfOUT)
  12196. | sfTypeBOOLEAN
  12197. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  12198. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  12199. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  12200. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  12201. | sfTypeWORD | sfTypeLONGWORD
  12202. | sfTypeREAL | sfTypeLONGREAL
  12203. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  12204. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  12205. | sfTypeIndirect offset:SIZE.
  12206. *)
  12207. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  12208. VAR offset: SIZE;
  12209. BEGIN
  12210. IF indirectTypes.Has(type) THEN
  12211. offset := indirectTypes.GetInt(type);
  12212. Char(section, sfTypeIndirect);
  12213. Size(section, offset);
  12214. RETURN TRUE;
  12215. ELSE
  12216. indirectTypes.PutInt(type, CurrentIndex());
  12217. RETURN FALSE;
  12218. END;
  12219. END Indirect;
  12220. PROCEDURE NType(type: SyntaxTree.Type);
  12221. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  12222. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  12223. BEGIN
  12224. IF type = NIL THEN
  12225. Char(section, sfTypeNone)
  12226. ELSE
  12227. type := type.resolved;
  12228. size := type.sizeInBits;
  12229. WITH type:
  12230. SyntaxTree.PointerType DO
  12231. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  12232. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12233. Char(section, sfTypePointerToRecord);
  12234. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  12235. ELSE
  12236. IF RefInfo THEN Info(section,"PointerToArray") END;
  12237. Char(section, sfTypePointerToArray);
  12238. NType(type.pointerBase);
  12239. END;
  12240. | SyntaxTree.ArrayType DO
  12241. IF ~Indirect(type) THEN
  12242. IF type.form = SyntaxTree.Open THEN
  12243. IF RefInfo THEN Info(section,"OpenArray") END;
  12244. Char(section, sfTypeOpenArray);
  12245. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  12246. IF RefInfo THEN Info(section,"DynamicArray") END;
  12247. Char(section, sfTypeDynamicArray);
  12248. ELSIF type.form = SyntaxTree.Static THEN
  12249. IF RefInfo THEN Info(section,"StaticArray") END;
  12250. Char(section, sfTypeStaticArray);
  12251. Size(section, type.staticLength);
  12252. ELSE
  12253. HALT(100);
  12254. END;
  12255. NType(type.arrayBase);
  12256. END;
  12257. | SyntaxTree.MathArrayType DO
  12258. IF ~Indirect(type) THEN
  12259. IF type.form = SyntaxTree.Open THEN
  12260. IF RefInfo THEN Info(section,"MathOpenArray") END;
  12261. Char(section, sfTypeMathOpenArray);
  12262. ELSIF type.form = SyntaxTree.Static THEN
  12263. IF RefInfo THEN Info(section,"MathStaticArray") END;
  12264. Char(section, sfTypeMathStaticArray);
  12265. Size(section, type.staticLength);
  12266. ELSIF type.form = SyntaxTree.Tensor THEN
  12267. IF RefInfo THEN Info(section,"MathTensor") END;
  12268. Char(section, sfTypeMathTensor);
  12269. ELSE
  12270. HALT(100);
  12271. END;
  12272. NType(type.arrayBase);
  12273. END;
  12274. | SyntaxTree.RecordType DO
  12275. IF ~Indirect(type) THEN
  12276. IF type.pointerType # NIL (* OBJECT *) THEN
  12277. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12278. Char(section, sfTypePointerToRecord)
  12279. ELSE
  12280. IF RefInfo THEN Info(section,"Record") END;
  12281. Char(section, sfTypeRecord);
  12282. td := type.typeDeclaration;
  12283. IF RefInfo THEN Info(section,"TD") END;
  12284. IF (td # NIL) THEN
  12285. Global.GetSymbolSegmentedName(td,segmentedName);
  12286. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12287. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12288. ELSE
  12289. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12290. END;
  12291. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  12292. Symbol(section, tir, 0, offset);
  12293. ELSE
  12294. Address(section, 0);
  12295. END;
  12296. END;
  12297. END;
  12298. | SyntaxTree.CellType DO
  12299. IF ~Indirect(type) THEN
  12300. IF RefInfo THEN Info(section,"Record") END;
  12301. Char(section, sfTypeRecord);
  12302. td := type.typeDeclaration;
  12303. IF RefInfo THEN Info(section,"TD") END;
  12304. IF (td # NIL) THEN
  12305. Global.GetSymbolSegmentedName(td,segmentedName);
  12306. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12307. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12308. ELSE
  12309. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12310. END;
  12311. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12312. Symbol(section, tir, 0, offset);
  12313. ELSE
  12314. Address(section, 0);
  12315. END;
  12316. END;
  12317. | SyntaxTree.PortType DO
  12318. Char(section, sfTypePORT);
  12319. IF type.direction = SyntaxTree.OutPort THEN
  12320. Char(section, sfOUT)
  12321. ELSE
  12322. Char(section, sfIN)
  12323. END;
  12324. | SyntaxTree.ProcedureType DO
  12325. IF ~Indirect(type) THEN
  12326. IF type.isDelegate THEN
  12327. Char(section, sfTypeDelegate);
  12328. ELSE
  12329. Char(section, sfTypeProcedure);
  12330. END;
  12331. parameter := type.firstParameter;
  12332. WHILE(parameter # NIL) DO
  12333. NParameter(parameter, -1);
  12334. parameter := parameter.nextParameter;
  12335. END;
  12336. NType(type.returnType);
  12337. END;
  12338. | SyntaxTree.EnumerationType DO
  12339. Char(section, sfTypeENUM);
  12340. | SyntaxTree.BasicType DO
  12341. WITH type:
  12342. SyntaxTree.BooleanType DO
  12343. IF RefInfo THEN Info(section,"Boolean") END;
  12344. Char(section, sfTypeBOOLEAN);
  12345. | SyntaxTree.CharacterType DO
  12346. IF type = module.system.characterType THEN
  12347. IF RefInfo THEN Info(section,"CHAR") END;
  12348. Char(section, sfTypeCHAR);
  12349. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  12350. IF RefInfo THEN Info(section,"CHAR8") END;
  12351. Char(section, sfTypeCHAR8)
  12352. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  12353. IF RefInfo THEN Info(section,"CHAR16") END;
  12354. Char(section, sfTypeCHAR16);
  12355. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  12356. IF RefInfo THEN Info(section,"CHAR32") END;
  12357. Char(section, sfTypeCHAR32);
  12358. ELSE
  12359. HALT(100);
  12360. END;
  12361. |SyntaxTree.IntegerType DO
  12362. IF type(SyntaxTree.IntegerType).signed THEN
  12363. IF (type = module.system.shortintType) THEN
  12364. IF RefInfo THEN Info(section,"SHORTINT") END;
  12365. Char(section, sfTypeSHORTINT)
  12366. ELSIF (type = module.system.integerType) THEN
  12367. IF RefInfo THEN Info(section,"INTEGER") END;
  12368. Char(section, sfTypeINTEGER)
  12369. ELSIF (type = module.system.longintType) THEN
  12370. IF RefInfo THEN Info(section,"LONGINT") END;
  12371. Char(section, sfTypeLONGINT)
  12372. ELSIF (type = module.system.hugeintType) THEN
  12373. IF RefInfo THEN Info(section,"HUGEINT") END;
  12374. Char(section, sfTypeHUGEINT)
  12375. ELSIF (type = module.system.wordType) THEN
  12376. IF RefInfo THEN Info(section,"WORD") END;
  12377. Char(section, sfTypeWORD)
  12378. ELSIF (type = module.system.longWordType) THEN
  12379. IF RefInfo THEN Info(section,"LONGWORD") END;
  12380. Char(section, sfTypeLONGWORD);
  12381. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  12382. IF RefInfo THEN Info(section,"SIGNED8") END;
  12383. Char(section, sfTypeSIGNED8)
  12384. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  12385. IF RefInfo THEN Info(section,"SIGNED16") END;
  12386. Char(section, sfTypeSIGNED16)
  12387. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  12388. IF RefInfo THEN Info(section,"SIGNED32") END;
  12389. Char(section, sfTypeSIGNED32)
  12390. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  12391. IF RefInfo THEN Info(section,"SIGNED64") END;
  12392. Char(section, sfTypeSIGNED64)
  12393. ELSE
  12394. HALT(100);
  12395. END
  12396. ELSE (* unsigned *)
  12397. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  12398. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  12399. Char(section, sfTypeUNSIGNED8)
  12400. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  12401. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  12402. Char(section, sfTypeUNSIGNED16)
  12403. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  12404. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  12405. Char(section, sfTypeUNSIGNED32)
  12406. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  12407. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  12408. Char(section, sfTypeUNSIGNED64)
  12409. ELSE
  12410. HALT(100)
  12411. END
  12412. END;
  12413. | SyntaxTree.FloatType DO
  12414. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  12415. IF RefInfo THEN Info(section,"REAL") END;
  12416. Char(section, sfTypeREAL);
  12417. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  12418. IF RefInfo THEN Info(section,"LONGREAL") END;
  12419. Char(section, sfTypeLONGREAL);
  12420. ELSE
  12421. HALT(100);
  12422. END;
  12423. | SyntaxTree.ComplexType DO
  12424. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  12425. IF RefInfo THEN Info(section,"COMPLEX") END;
  12426. Char(section, sfTypeCOMPLEX);
  12427. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  12428. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  12429. Char(section, sfTypeLONGCOMPLEX);
  12430. ELSE
  12431. HALT(100);
  12432. END;
  12433. |SyntaxTree.SetType DO
  12434. IF RefInfo THEN Info(section,"SET") END;
  12435. Char(section, sfTypeSET);
  12436. |SyntaxTree.AnyType DO
  12437. IF RefInfo THEN Info(section,"ANY") END;
  12438. Char(section, sfTypeANY);
  12439. |SyntaxTree.ObjectType DO
  12440. IF RefInfo THEN Info(section,"OBJECT") END;
  12441. Char(section, sfTypeOBJECT);
  12442. |SyntaxTree.ByteType DO
  12443. IF RefInfo THEN Info(section,"BYTE") END;
  12444. Char(section, sfTypeBYTE);
  12445. |SyntaxTree.RangeType DO
  12446. IF RefInfo THEN Info(section,"RANGE") END;
  12447. Char(section, sfTypeRANGE)
  12448. |SyntaxTree.AddressType DO
  12449. IF RefInfo THEN Info(section,"ADDRESS") END;
  12450. Char(section, sfTypeADDRESS)
  12451. |SyntaxTree.SizeType DO
  12452. IF RefInfo THEN Info(section,"SIZE") END;
  12453. Char(section, sfTypeSIZE)
  12454. ELSE
  12455. HALT(100)
  12456. END;
  12457. ELSE HALT(101);
  12458. END;
  12459. END;
  12460. END NType;
  12461. (*
  12462. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  12463. *)
  12464. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  12465. VAR type: SyntaxTree.Type;
  12466. BEGIN
  12467. IF RefInfo THEN Info(section, "Parameter") END;
  12468. Char(section, sfVariable);
  12469. Size(section, procOffset);
  12470. String0(section, parameter.name);
  12471. type := parameter.type.resolved;
  12472. IF parameter.kind = SyntaxTree.VarParameter THEN
  12473. IF IsOpenArray(type) THEN Char(section, sfRelative)
  12474. ELSE Char(section, sfIndirect)
  12475. END;
  12476. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12477. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  12478. Char(section, sfIndirect);
  12479. ELSE
  12480. Char(section, sfRelative);
  12481. END;
  12482. ELSE
  12483. Char(section, sfRelative);
  12484. END;
  12485. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  12486. NType(parameter.type);
  12487. END NParameter;
  12488. (*
  12489. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12490. *)
  12491. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  12492. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  12493. flags: SET;
  12494. BEGIN
  12495. IF procedure.externalName # NIL THEN RETURN END;
  12496. IF RefInfo THEN Info(section, "Procedure") END;
  12497. pos := CurrentIndex();
  12498. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  12499. Char(section, sfProcedure);
  12500. Size(section, scopeOffset);
  12501. String0(section,procedure.name);
  12502. s := module.allSections.FindBySymbol(procedure);
  12503. Symbol(section,s,0,0); (* start *)
  12504. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  12505. flags := {};
  12506. IF procedureType.isDelegate THEN
  12507. INCL(flags, flagDelegate);
  12508. END;
  12509. IF procedure.isConstructor THEN
  12510. INCL(flags, flagConstructor);
  12511. END;
  12512. Set(section, flags);
  12513. IF RefInfo THEN Info(section, "Parameters") END;
  12514. parameter := procedureType.firstParameter;
  12515. WHILE(parameter # NIL) DO
  12516. NParameter(parameter, pos);
  12517. parameter := parameter.nextParameter;
  12518. END;
  12519. IF procedureType.returnParameter # NIL THEN
  12520. NParameter(procedureType.returnParameter, pos);
  12521. END;
  12522. IF procedureType.selfParameter # NIL THEN
  12523. NParameter(procedureType.selfParameter, pos);
  12524. END;
  12525. IF RefInfo THEN Info(section, "ReturnType") END;
  12526. NType(procedureType.returnType);
  12527. NScope(procedure.procedureScope, pos);
  12528. END NProcedure;
  12529. (*
  12530. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  12531. *)
  12532. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  12533. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  12534. BEGIN
  12535. IF RefInfo THEN Info(section, "Variable") END;
  12536. pos := CurrentIndex();
  12537. Char(section, sfVariable);
  12538. Size(section, scopeOffset);
  12539. String0(section, variable.name);
  12540. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  12541. Char(section, sfAbsolute);
  12542. IF variable.externalName # NIL THEN
  12543. sn := variable.externalName^;
  12544. NamedSymbol(section, sn,NIL, 0,0);
  12545. ELSE
  12546. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  12547. NamedSymbol(section, sn,variable, 0,0);
  12548. END;
  12549. ELSE
  12550. Char(section, sfRelative);
  12551. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  12552. END;
  12553. NType(variable.type);
  12554. s := module.allSections.FindBySymbol(variable);
  12555. END NVariable;
  12556. (*
  12557. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12558. *)
  12559. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  12560. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  12561. BEGIN
  12562. IF typeDeclaration = NIL THEN RETURN END;
  12563. pos := CurrentIndex();
  12564. s := module.allSections.FindBySymbol(typeDeclaration);
  12565. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  12566. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  12567. Char(section, sfTypeDeclaration);
  12568. Size(section, scopeOffset);
  12569. String0(section, typeDeclaration.name);
  12570. declared := typeDeclaration.declaredType.resolved;
  12571. IF (declared IS SyntaxTree.PointerType) THEN
  12572. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  12573. END;
  12574. WITH declared:
  12575. SyntaxTree.RecordType DO
  12576. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  12577. Symbol(section, s, 0, offset);
  12578. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12579. Basic.AppendToSegmentedName(name,".@Info");
  12580. s := module.allSections.FindByName(name);
  12581. IF s # NIL THEN (* does not work for coop *)
  12582. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12583. END;
  12584. NScope(declared.recordScope, pos);
  12585. |SyntaxTree.CellType DO
  12586. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12587. Symbol(section, s, 0, offset);
  12588. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12589. Basic.AppendToSegmentedName(name,".@Info");
  12590. s := module.allSections.FindByName(name);
  12591. IF s # NIL THEN
  12592. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12593. END;
  12594. NScope(declared.cellScope, pos);
  12595. ELSE
  12596. Address(section, 0);
  12597. END;
  12598. END NTypeDeclaration;
  12599. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  12600. VAR pos: LONGINT;
  12601. BEGIN
  12602. pos := CurrentIndex();
  12603. Char(section,sfModule);
  12604. Size(section, prevSymbol);
  12605. String0(section, module.name);
  12606. NScope(module.moduleScope, pos);
  12607. END NModule;
  12608. (*
  12609. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12610. *)
  12611. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  12612. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  12613. BEGIN
  12614. IF scope = NIL THEN RETURN END;
  12615. IF RefInfo THEN Info(section, "Scope") END;
  12616. Char(section, sfScopeBegin);
  12617. variable := scope.firstVariable;
  12618. WHILE (variable # NIL) DO
  12619. NVariable(variable, prevSymbol);
  12620. variable := variable.nextVariable;
  12621. END;
  12622. WITH scope:
  12623. SyntaxTree.ModuleScope DO
  12624. bodyProcedure := scope.bodyProcedure;
  12625. |SyntaxTree.RecordScope DO
  12626. bodyProcedure := scope.bodyProcedure;
  12627. ELSE
  12628. bodyProcedure := NIL;
  12629. END;
  12630. IF bodyProcedure # NIL THEN
  12631. NProcedure(bodyProcedure, prevSymbol)
  12632. END;
  12633. procedure := scope.firstProcedure;
  12634. WHILE procedure # NIL DO
  12635. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  12636. procedure := procedure.nextProcedure;
  12637. END;
  12638. typeDeclaration := scope.firstTypeDeclaration;
  12639. WHILE typeDeclaration # NIL DO
  12640. NTypeDeclaration(typeDeclaration, prevSymbol);
  12641. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  12642. END;
  12643. Char(section, sfScopeEnd); (* scope ends *)
  12644. END NScope;
  12645. BEGIN
  12646. NEW(indirectTypes, 32);
  12647. ArrayBlock(section,sizePC,"", FALSE);
  12648. startPC := section.pc;
  12649. NModule(module.module, -1);
  12650. PatchArray(section,sizePC,CurrentIndex());
  12651. END References;
  12652. (*
  12653. Command* = RECORD
  12654. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  12655. name*: Name; (* name of the procedure *)
  12656. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  12657. entryAdr* : ADDRESS; (* entry address of procedure *)
  12658. END;
  12659. *)
  12660. PROCEDURE CommandArray(source: IntermediateCode.Section);
  12661. VAR
  12662. p: Sections.Section; sizePC, numberCommands: LONGINT;
  12663. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  12664. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  12665. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  12666. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  12667. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  12668. BEGIN
  12669. RETURN
  12670. (type = NIL) OR
  12671. (type.resolved IS SyntaxTree.RecordType) OR
  12672. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  12673. (type.resolved IS SyntaxTree.AnyType);
  12674. END TypeAllowed;
  12675. BEGIN
  12676. numberParameters := procedureType.numberParameters;
  12677. RETURN
  12678. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  12679. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  12680. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  12681. END GetProcedureAllowed;
  12682. PROCEDURE WriteType(type : SyntaxTree.Type);
  12683. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  12684. name: Basic.SegmentedName; offset: LONGINT;
  12685. BEGIN
  12686. IF type = NIL THEN
  12687. Address(source,0);
  12688. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  12689. Address(source,1);
  12690. ELSE
  12691. type := type.resolved;
  12692. IF type IS SyntaxTree.PointerType THEN
  12693. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  12694. END;
  12695. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  12696. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  12697. name[0] := typeDeclaration.name; name[1] := -1;
  12698. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  12699. ASSERT(section # NIL);
  12700. ELSE
  12701. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12702. (* TODO *)
  12703. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  12704. END;
  12705. IF implementationVisitor.backend.cooperative THEN
  12706. offset := 0;
  12707. ELSE
  12708. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  12709. END;
  12710. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  12711. END;
  12712. END WriteType;
  12713. BEGIN
  12714. Info(source, "command array descriptor");
  12715. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  12716. numberCommands := 0;
  12717. Info(source, "command array content");
  12718. FOR i := 0 TO module.allSections.Length() - 1 DO
  12719. p := module.allSections.GetSection(i);
  12720. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  12721. procedure := p.symbol(SyntaxTree.Procedure);
  12722. procedureType := procedure.type(SyntaxTree.ProcedureType);
  12723. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  12724. procedure.GetName(name);
  12725. Name(source,name);
  12726. numberParameters := procedureType.numberParameters;
  12727. (* offset of type of first parameter *)
  12728. IF (numberParameters = 0 ) THEN WriteType(NIL)
  12729. ELSE WriteType(procedureType.firstParameter.type)
  12730. END;
  12731. (* offset of type of return parameter *)
  12732. WriteType(procedureType.returnType);
  12733. (* command name *)
  12734. (* command code offset *)
  12735. Symbol(source,p,0,0);
  12736. INC(numberCommands);
  12737. IF Trace THEN
  12738. D.Ln;
  12739. END;
  12740. END;
  12741. END
  12742. END;
  12743. PatchArray(source,sizePC,numberCommands);
  12744. END CommandArray;
  12745. (* to prevent from double import of different module aliases *)
  12746. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  12747. VAR i: SyntaxTree.Import;
  12748. BEGIN
  12749. i := module.module.moduleScope.firstImport;
  12750. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  12751. i := i.nextImport;
  12752. END;
  12753. RETURN i = import
  12754. END IsFirstDirectOccurence;
  12755. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  12756. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  12757. BEGIN
  12758. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  12759. ArrayBlock(source,pc,"", FALSE);
  12760. Info(source, "import module array data");
  12761. IF implementationVisitor.backend.cooperative THEN
  12762. offset := 0;
  12763. ELSE
  12764. IF module.system.addressType.sizeInBits = 64 THEN
  12765. (* change this when Heaps.HeapBlock is modified *)
  12766. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12767. ELSE
  12768. (* change this when Heaps.HeapBlock is modified *)
  12769. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12770. END;
  12771. END;
  12772. import := module.module.moduleScope.firstImport;
  12773. numberImports := 0;
  12774. WHILE import # NIL DO
  12775. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  12776. Global.GetModuleSegmentedName(import.module,name);
  12777. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  12778. NamedSymbol(source, name, NIL, 0, offset);
  12779. INC(numberImports);
  12780. END;
  12781. import := import.nextImport
  12782. END;
  12783. PatchArray(source,pc,numberImports);
  12784. END ImportsArray;
  12785. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  12786. VAR
  12787. p: Sections.Section; sizePC, size, i: LONGINT;
  12788. BEGIN
  12789. Info(source, "Type info section");
  12790. size := 0;
  12791. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  12792. FOR i := 0 TO module.allSections.Length() - 1 DO
  12793. p := module.allSections.GetSection(i);
  12794. WITH p: IntermediateCode.Section DO
  12795. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  12796. Symbol(source,p,EmptyBlockOffset,0);
  12797. INC(size);
  12798. END;
  12799. END
  12800. END;
  12801. PatchArray(source,sizePC,size);
  12802. END TypeInfoSection;
  12803. (*
  12804. ProcTableEntry* = RECORD
  12805. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  12806. noPtr*: LONGINT;
  12807. END;
  12808. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  12809. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  12810. *)
  12811. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12812. VAR
  12813. numberPointers: LONGINT;
  12814. procedure: SyntaxTree.Procedure;
  12815. BEGIN
  12816. Info(section,"pcFrom");
  12817. Symbol(section,procedureSection,0,0);
  12818. Info(section,"pcTo");
  12819. Symbol(section, procedureSection, procedureSection.pc, 0);
  12820. Info(section,"pointer to offsets array");
  12821. Symbol(section, section,section.pc+1,0);
  12822. Info(section,"offsets array");
  12823. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  12824. PointerArray(section, procedure.procedureScope, numberPointers);
  12825. END ProcedureDescriptor;
  12826. (* only for tracing, the descriptor is otherwise not complete ! *)
  12827. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  12828. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  12829. BEGIN
  12830. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  12831. name := procedureSection.name;
  12832. Basic.AppendToSegmentedName(name,".@Info");
  12833. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12834. Address(section,0);
  12835. Symbol(section,section,2,0);
  12836. (*
  12837. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  12838. descSize: SIZE;
  12839. sentinel: ADDRESS; (* = MPO-4 *)
  12840. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12841. flags*: SET;
  12842. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12843. name*: Name;
  12844. END;
  12845. *)
  12846. Size(section, 0);
  12847. Address(section,0);
  12848. Address(section,0);
  12849. Set(section,{});
  12850. moduleSection := ModuleSection();
  12851. Symbol( section, moduleSection, moduleSection.pc,0);
  12852. IF procedureSection.symbol = NIL THEN
  12853. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12854. ELSE
  12855. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12856. END;
  12857. Name(section, infoName);
  12858. Size(section, 0);
  12859. RETURN section;
  12860. END MakeProcedureDescriptorTag;
  12861. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12862. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12863. BEGIN
  12864. name := procedureSection.name;
  12865. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12866. IF implementationVisitor.backend.cooperative THEN
  12867. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12868. Info(section, "TypeDescriptor");
  12869. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12870. NamedSymbol(dest, name,NIL, 0, 0);
  12871. BaseRecord(dest);
  12872. offset := 0;
  12873. ELSIF CreateProcedureDescInfo THEN
  12874. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12875. Address(dest,0);
  12876. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12877. offset := dest.pc;
  12878. ELSE
  12879. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12880. END;
  12881. ProcedureDescriptor(dest, procedureSection);
  12882. Symbol(section, dest, offset, 0);
  12883. END ProcedureDescriptorPointer;
  12884. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12885. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12886. BEGIN
  12887. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12888. numberProcs := 0;
  12889. FOR i := 0 TO module.allSections.Length() - 1 DO
  12890. destination := module.allSections.GetSection(i);
  12891. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12892. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12893. INC(numberProcs);
  12894. END
  12895. END;
  12896. PatchArray(section, sizePC, numberProcs);
  12897. END ProcedureDescriptorArray;
  12898. (*
  12899. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12900. VAR
  12901. next*: Module; (** once a module is published, all fields are read-only *)
  12902. name*: Name;
  12903. init, published: BOOLEAN;
  12904. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12905. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12906. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12907. command*: POINTER TO ARRAY OF Command;
  12908. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12909. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12910. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12911. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12912. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12913. data*, code*: Bytes;
  12914. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12915. export*: ExportDesc;
  12916. term*: TerminationHandler;
  12917. exTable*: ExceptionTable;
  12918. noProcs*: LONGINT;
  12919. firstProc*: ADDRESS; <- done by loader
  12920. maxPtrs*: LONGINT;
  12921. crc*: LONGINT;
  12922. *)
  12923. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12924. BEGIN
  12925. Info(section, "cycle");
  12926. Size(section,0);
  12927. Info(section, "references");
  12928. Size(section,0);
  12929. Info(section, "nextMarked");
  12930. Address(section,0);
  12931. Info(section, "nextWatched");
  12932. Address(section,0);
  12933. END BasePointer;
  12934. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12935. BEGIN
  12936. BasePointer(section);
  12937. Info(section, "action");
  12938. Address(section,0);
  12939. Info(section, "monitor");
  12940. Address(section,0);
  12941. END BaseObject;
  12942. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12943. BEGIN
  12944. BasePointer(section);
  12945. Info(section, "action");
  12946. Address(section,0);
  12947. Info(section, "monitor");
  12948. Address(section,0);
  12949. END BaseRecord;
  12950. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12951. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12952. pooledName: Basic.SegmentedName;
  12953. symbol: SyntaxTree.Symbol;
  12954. BEGIN
  12955. Global.GetModuleName(module.module,name);
  12956. Strings.Append(name,".@Module.@Descriptor");
  12957. Basic.ToSegmentedName(name, pooledName);
  12958. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12959. Symbol(section,descriptorSection,0,0);
  12960. Info(descriptorSection, "descriptor");
  12961. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12962. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12963. Address(descriptorSection,0);
  12964. Global.GetModuleName(module.module,name);
  12965. Strings.Append(name,".@Trace");
  12966. Basic.ToSegmentedName(name, pooledName);
  12967. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12968. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12969. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12970. END ModuleDescriptor;
  12971. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12972. VAR name: ARRAY 128 OF CHAR;
  12973. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12974. symbol: SyntaxTree.Symbol;
  12975. BEGIN
  12976. Global.GetModuleName(module.module,name);
  12977. Strings.Append(name,".@Module");
  12978. Basic.ToSegmentedName(name, pooledName);
  12979. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12980. moduleSection.SetExported(TRUE);
  12981. IF moduleSection.pc = 0 THEN
  12982. IF implementationVisitor.backend.cooperative THEN
  12983. Info(moduleSection, "descriptor");
  12984. ModuleDescriptor(moduleSection);
  12985. BaseObject(moduleSection);
  12986. implementationVisitor.CreateTraceModuleMethod(module.module);
  12987. ELSE
  12988. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12989. Info(moduleSection, "HeapBlock");
  12990. Symbol(moduleSection,moduleSection,2,0);
  12991. Info(moduleSection, "TypeDescriptor");
  12992. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12993. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12994. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12995. END;
  12996. END;
  12997. RETURN moduleSection;
  12998. END ModuleSection;
  12999. PROCEDURE NewModuleInfo();
  13000. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13001. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13002. sectionName: Basic.SectionName;
  13003. CONST MPO=-40000000H;
  13004. BEGIN
  13005. (*
  13006. TypeDesc* = POINTER TO RECORD
  13007. descSize: SIZE;
  13008. sentinel: LONGINT; (* = MPO-4 *)
  13009. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13010. flags*: SET;
  13011. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13012. name*: Name;
  13013. refsOffset: SIZE;
  13014. END;
  13015. *)
  13016. (*name is missing prefixes sometimes*)
  13017. Global.GetModuleSegmentedName(module.module,name);
  13018. Basic.AppendToSegmentedName(name,".@Info");
  13019. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13020. IF ~implementationVisitor.backend.cooperative THEN
  13021. Info(source, "HeapBlock");
  13022. Address(source,0); (* an empty heap block prevents GC marking *)
  13023. Info(source, "TypeDescriptor");
  13024. Address(source,0);
  13025. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13026. END;
  13027. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13028. Address(source,MPO-4);
  13029. Info(source, "type tag pointer");
  13030. Address( source,0);
  13031. Info(source, "type flags");
  13032. flags := {};
  13033. Set( source, flags);
  13034. Info(source, "pointer to module");
  13035. moduleSection := ModuleSection();
  13036. Symbol( source, moduleSection, moduleSection.pc,0);
  13037. Info(source, "type name");
  13038. i := 0;
  13039. sectionName := "@Self";
  13040. (*
  13041. Global.GetSymbolSegmentedName(td,name);
  13042. Basic.SegmentedNameToString(name, sectionName);
  13043. *)
  13044. Name(source,sectionName);
  13045. patchInfoPC := source.pc;
  13046. Size(source, 0);
  13047. END NewModuleInfo;
  13048. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  13049. VAR
  13050. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  13051. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  13052. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  13053. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  13054. referenceSectionOffset : LONGINT;
  13055. name: Basic.SegmentedName; offset: LONGINT;
  13056. flags: SET;
  13057. BEGIN
  13058. NewModuleInfo();
  13059. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  13060. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  13061. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  13062. ImportsArray(importSection);
  13063. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  13064. CommandArray(commandsSection);
  13065. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  13066. ExceptionArray(exceptionSection);
  13067. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  13068. AddPointer(typeInfoSection, typeInfoSectionOffset);
  13069. TypeInfoSection(typeInfoSection);
  13070. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  13071. referenceSection.SetExported(TRUE);
  13072. References(referenceSection);
  13073. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  13074. ProcedureDescriptorArray(procTableSection, numberProcs);
  13075. IF ProtectModulesPointers THEN
  13076. name := "Heaps.AnyPtr";
  13077. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  13078. (* set base pointer *)
  13079. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  13080. END;
  13081. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  13082. ArrayBlock(emptyArraySection,temp,"", FALSE);
  13083. moduleSection := ModuleSection();
  13084. Info(moduleSection, "nextRoot*: RootObject");
  13085. Address(moduleSection,0);
  13086. Info(moduleSection, "next*: Module");
  13087. Address(moduleSection,0);
  13088. Info(moduleSection, "name*: Name");
  13089. Name(moduleSection,moduleName);
  13090. Info(moduleSection, "init, published: BOOLEAN");
  13091. Boolean(moduleSection,FALSE);
  13092. Boolean(moduleSection,FALSE);
  13093. Info(moduleSection,"filler"); (*! introduce alignment! *)
  13094. Boolean(moduleSection,FALSE);
  13095. Boolean(moduleSection,FALSE);
  13096. Info(moduleSection, "refcnt*: LONGINT");
  13097. Longint(moduleSection,0);
  13098. Info(moduleSection, "sb*: ADDRESS");
  13099. Address(moduleSection,0);
  13100. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  13101. Address(moduleSection,0);
  13102. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  13103. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  13104. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  13105. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  13106. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  13107. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  13108. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  13109. Symbol(moduleSection,importSection,importSectionOffset,0);
  13110. Info(moduleSection, "procTable*: ProcTable");
  13111. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  13112. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  13113. Address(moduleSection,0);
  13114. Address(moduleSection,0);
  13115. Address(moduleSection,0);
  13116. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  13117. Info(moduleSection, "export*: ExportDesc");
  13118. ExportDesc(moduleSection);
  13119. Info(moduleSection, "term*: TerminationHandler");
  13120. Address(moduleSection,0);
  13121. Info(moduleSection, "exTable*: ExceptionTable");
  13122. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  13123. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  13124. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  13125. Info(moduleSection, "crc*: LONGINT");
  13126. patchCRC:= moduleSection.pc;
  13127. Longint(moduleSection, 0); (*! must be implemented *)
  13128. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  13129. Info(moduleSection, "body*: ADDRESS");
  13130. Symbol(moduleSection, bodyProc, 0,0);
  13131. Info(moduleSection, "module flags");
  13132. flags := {};
  13133. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  13134. Set( moduleSection, flags);
  13135. IF implementationVisitor.backend.cooperative THEN
  13136. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  13137. Info(moduleSection, "monitor.owner");
  13138. Address(moduleSection,0);
  13139. Info(moduleSection, "monitor.nestingLevel");
  13140. Address(moduleSection,0);
  13141. Info(moduleSection, "monitor.blockedQueue");
  13142. Address(moduleSection,0); Address(moduleSection,0);
  13143. Info(moduleSection, "monitor.waitingQueue");
  13144. Address(moduleSection,0); Address(moduleSection,0);
  13145. Info(moduleSection, "monitor.waitingSentinel");
  13146. Address(moduleSection,0);
  13147. END;
  13148. END Module;
  13149. PROCEDURE PatchCRC(crc: LONGINT);
  13150. BEGIN
  13151. IF ~simple THEN
  13152. PatchLongint(ModuleSection(), patchCRC, crc);
  13153. END;
  13154. END PatchCRC;
  13155. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  13156. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  13157. BEGIN
  13158. ArrayBlock(source,pc,"",FALSE);
  13159. Info(source, "pointer offsets array data");
  13160. IF scope IS SyntaxTree.RecordScope THEN
  13161. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  13162. ELSIF scope IS SyntaxTree.CellScope THEN
  13163. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  13164. ELSIF scope IS SyntaxTree.ModuleScope THEN
  13165. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  13166. WHILE variable # NIL DO
  13167. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13168. symbol := module.allSections.FindBySymbol(variable);
  13169. ASSERT(symbol # NIL);
  13170. Pointers(0,symbol, source,variable.type,numberPointers);
  13171. END;
  13172. variable := variable.nextVariable;
  13173. END;
  13174. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  13175. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13176. WHILE parameter # NIL DO
  13177. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  13178. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  13179. END;
  13180. parameter := parameter.nextParameter;
  13181. END;
  13182. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  13183. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  13184. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13185. IF implementationVisitor.backend.preciseGC THEN
  13186. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13187. END;
  13188. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  13189. END;
  13190. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  13191. WHILE(variable # NIL) DO
  13192. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13193. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  13194. END;
  13195. variable := variable.nextVariable
  13196. END;
  13197. END;
  13198. PatchArray(source,pc,numberPointers);
  13199. END PointerArray;
  13200. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  13201. VAR recordType: SyntaxTree.RecordType;
  13202. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  13203. section: Sections.Section; cellType: SyntaxTree.CellType;
  13204. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  13205. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13206. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13207. sectionName: Basic.SectionName;
  13208. CONST MPO=-40000000H;
  13209. BEGIN
  13210. (*
  13211. TypeDesc* = POINTER TO RECORD
  13212. descSize: SIZE;
  13213. sentinel: LONGINT; (* = MPO-4 *)
  13214. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13215. flags*: SET;
  13216. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13217. name*: Name;
  13218. refsOffset: SIZE;
  13219. END;
  13220. *)
  13221. (* source := module.sections.FindByName(...) *)
  13222. Global.GetSymbolSegmentedName(td,name);
  13223. Basic.AppendToSegmentedName(name,".@Info");
  13224. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13225. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  13226. Address(source,0);
  13227. Info(source, "TypeDescriptor");
  13228. Address(source,0);
  13229. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13230. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13231. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  13232. Info(source, "type tag pointer");
  13233. Symbol( source, tag, offset, 0);
  13234. Info(source, "type flags");
  13235. flags := {};
  13236. IF isProtected THEN INCL(flags,31) END;
  13237. Set( source, flags);
  13238. Info(source, "pointer to module");
  13239. moduleSection := ModuleSection();
  13240. Symbol( source, moduleSection, moduleSection.pc,0);
  13241. Info(source, "type name");
  13242. i := 0;
  13243. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  13244. (*
  13245. Global.GetSymbolSegmentedName(td,name);
  13246. Basic.SegmentedNameToString(name, sectionName);
  13247. *)
  13248. Name(source,sectionName);
  13249. Size(source, 0);
  13250. RETURN source;
  13251. END NewTypeDescriptorInfo;
  13252. PROCEDURE NewTypeDescriptor;
  13253. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  13254. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  13255. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  13256. numberPointers: LONGINT; padding, i: LONGINT;
  13257. CONST MPO=-40000000H;
  13258. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  13259. VAR i: LONGINT;
  13260. PROCEDURE Td(record: SyntaxTree.RecordType);
  13261. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  13262. BEGIN
  13263. IF record # NIL THEN
  13264. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  13265. baseTD := record.typeDeclaration;
  13266. Global.GetSymbolSegmentedName(baseTD,name);
  13267. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13268. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13269. ELSE
  13270. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13271. END;
  13272. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  13273. Symbol(source, tir, 0, offset);
  13274. IF reverse THEN Td(record.GetBaseRecord()) END;
  13275. END;
  13276. END Td;
  13277. BEGIN
  13278. Info(source, "tag table");
  13279. baseRecord := recordType;
  13280. i := 0;
  13281. WHILE baseRecord # NIL DO
  13282. INC(i);
  13283. baseRecord := baseRecord.GetBaseRecord();
  13284. END;
  13285. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  13286. IF ~reverse THEN Td(recordType) END;
  13287. WHILE i < size DO
  13288. Address(source,0);
  13289. INC(i);
  13290. END;
  13291. IF reverse THEN Td(recordType) END;
  13292. END TdTable;
  13293. PROCEDURE MethodTable(reverse: BOOLEAN);
  13294. VAR i,methods: LONGINT;
  13295. BEGIN
  13296. Info(source, "method table");
  13297. IF recordType # NIL THEN
  13298. methods := recordType.recordScope.numberMethods;
  13299. IF reverse THEN
  13300. FOR i := methods-1 TO 0 BY -1 DO
  13301. procedure := recordType.recordScope.FindMethod(i);
  13302. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13303. NamedSymbol(source, name,procedure, 0,0);
  13304. END;
  13305. ELSE
  13306. FOR i := 0 TO methods-1 DO
  13307. procedure := recordType.recordScope.FindMethod(i);
  13308. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13309. NamedSymbol(source, name,procedure, 0,0);
  13310. END;
  13311. END;
  13312. END;
  13313. END MethodTable;
  13314. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  13315. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  13316. BEGIN
  13317. Info(source, "method table");
  13318. baseRecord := recordType;
  13319. WHILE baseRecord.baseType # NIL DO
  13320. baseRecord := baseRecord.GetBaseRecord ();
  13321. END;
  13322. GetRecordTypeName (baseRecord, name);
  13323. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  13324. IF name = stackFrame THEN
  13325. start := 0;
  13326. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  13327. baseRecord := recordType;
  13328. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  13329. baseRecord := baseRecord.GetBaseRecord ();
  13330. END;
  13331. IF baseRecord # NIL THEN
  13332. GetRecordTypeName (baseRecord, name);
  13333. IF pointer & ~baseRecord.isObject THEN
  13334. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13335. END;
  13336. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  13337. ELSIF recordType.isObject THEN
  13338. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  13339. ELSIF pointer THEN
  13340. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  13341. ELSE
  13342. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  13343. END;
  13344. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13345. Symbol(source, tir, 0, 0);
  13346. start := 0;
  13347. baseRecord := recordType;
  13348. WHILE (baseRecord # NIL) DO
  13349. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  13350. baseRecord := baseRecord.GetBaseRecord ();
  13351. END;
  13352. ELSE
  13353. (* explicit trace method: *)
  13354. procedure := recordType.recordScope.FindMethod(0);
  13355. IF ~procedure.isFinalizer THEN
  13356. Global.GetSymbolSegmentedName(procedure, name);
  13357. NamedSymbol(source, name,procedure, 0,0);
  13358. END;
  13359. start := 1;
  13360. END;
  13361. IF (name # stackFrame) & recordType.isObject THEN
  13362. baseRecord := recordType;
  13363. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  13364. baseRecord := baseRecord.GetBaseRecord ();
  13365. END;
  13366. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  13367. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  13368. ELSE
  13369. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  13370. END;
  13371. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13372. Symbol(source, tir, 0, 0);
  13373. END;
  13374. methods := recordType.recordScope.numberMethods;
  13375. FOR i := start TO methods-1 DO
  13376. procedure := recordType.recordScope.FindMethod(i);
  13377. IF ~procedure.isFinalizer THEN
  13378. Global.GetSymbolSegmentedName(procedure, name);
  13379. NamedSymbol(source, name,procedure, 0,0);
  13380. END;
  13381. END;
  13382. END CooperativeMethodTable;
  13383. BEGIN
  13384. Global.GetSymbolSegmentedName(td,name);
  13385. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  13386. source.SetExported(IsExported(td));
  13387. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  13388. IF implementationVisitor.backend.cooperative THEN
  13389. base := NIL;
  13390. baseRecord := recordType.GetBaseRecord();
  13391. IF baseRecord # NIL THEN
  13392. baseTD := baseRecord.typeDeclaration;
  13393. END;
  13394. IF ~recordType.isObject THEN
  13395. Info(source, "parent");
  13396. IF baseRecord # NIL THEN
  13397. Global.GetSymbolSegmentedName(baseTD,name);
  13398. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13399. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13400. ELSE
  13401. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13402. END;
  13403. Symbol(source, tir, 0, 0);
  13404. ELSE
  13405. Address(source,0);
  13406. END;
  13407. Info(source, "record size");
  13408. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13409. CooperativeMethodTable(FALSE);
  13410. base := source;
  13411. Global.GetSymbolSegmentedName(td,name);
  13412. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13413. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13414. source.SetExported(IsExported(td));
  13415. END;
  13416. Info(source, "parent");
  13417. IF baseRecord # NIL THEN
  13418. Global.GetSymbolSegmentedName(baseTD,name);
  13419. sym := baseTD;
  13420. IF ~recordType.isObject THEN
  13421. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13422. sym := NIL;
  13423. END;
  13424. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13425. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13426. ELSE
  13427. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13428. END;
  13429. Symbol(source, tir, 0, 0);
  13430. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  13431. Address(source,0);
  13432. ELSE
  13433. IF recordType.isObject THEN
  13434. Basic.ToSegmentedName ("BaseTypes.Object",name);
  13435. ELSE
  13436. Basic.ToSegmentedName ("BaseTypes.Record",name);
  13437. END;
  13438. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13439. Symbol(source, tir, 0, 0);
  13440. END;
  13441. Info(source, "base record descriptor");
  13442. Symbol(source, base, 0, 0);
  13443. CooperativeMethodTable(TRUE);
  13444. IF recordType.hasPointers THEN
  13445. IF ~HasExplicitTraceMethod (recordType) THEN
  13446. implementationVisitor.CreateTraceMethod(recordType);
  13447. END;
  13448. implementationVisitor.CreateResetProcedure(recordType);
  13449. implementationVisitor.CreateAssignProcedure(recordType);
  13450. END;
  13451. ELSIF ~simple THEN
  13452. (*
  13453. MethodEnd = MPO
  13454. ---
  13455. methods (# methods)
  13456. ---
  13457. tags (16)
  13458. ---
  13459. TypeDesc = TypeInfoAdr
  13460. ---
  13461. td adr ---> rec size
  13462. ----
  13463. pointer offsets
  13464. ----
  13465. (padding)
  13466. -----
  13467. empty [2 addresses aligned]
  13468. empty
  13469. empty
  13470. numPtrs
  13471. ---
  13472. pointer offsets
  13473. ---
  13474. *)
  13475. Info(source, "MethodEnd = MPO");
  13476. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  13477. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  13478. MethodTable(TRUE);
  13479. TdTable(TypeTags, TRUE);
  13480. Info(source, "type descriptor info pointer");
  13481. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  13482. Symbol(source, tdInfo,EmptyBlockOffset,0);
  13483. IF (cellType # NIL) THEN
  13484. IF cellType.sizeInBits < 0 THEN
  13485. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  13486. END;
  13487. Info(source, "cell size");
  13488. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  13489. ELSE
  13490. Info(source, "record size");
  13491. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13492. END;
  13493. Info(source, "pointer offsets pointer");
  13494. padding := 1- source.pc MOD 2;
  13495. Symbol(source, source, source.pc+1+padding,0);
  13496. IF padding >0 THEN
  13497. Info(source, "padding");
  13498. FOR i := 1 TO padding DO Address(source,0) END;
  13499. END;
  13500. IF cellType # NIL THEN
  13501. PointerArray(source, cellType.cellScope, numberPointers);
  13502. ELSE
  13503. PointerArray(source, recordType.recordScope, numberPointers);
  13504. END;
  13505. ELSE
  13506. (*
  13507. simple:
  13508. td adr --> size
  13509. tag(1)
  13510. tag(2)
  13511. tag(3)
  13512. methods ->
  13513. *)
  13514. Info(source, "record size");
  13515. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13516. TdTable(TypeTags, FALSE);
  13517. MethodTable(FALSE);
  13518. END;
  13519. END NewTypeDescriptor;
  13520. BEGIN
  13521. x := x.resolved;
  13522. IF (x IS SyntaxTree.PointerType) THEN
  13523. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  13524. END;
  13525. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  13526. recordType := x(SyntaxTree.RecordType);
  13527. td := x.typeDeclaration;
  13528. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13529. ASSERT(td # NIL);
  13530. section := module.allSections.FindBySymbol(td); (* TODO *)
  13531. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13532. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13533. NewTypeDescriptor
  13534. END;
  13535. END;
  13536. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  13537. cellType := x(SyntaxTree.CellType);
  13538. td := x.typeDeclaration;
  13539. section := module.allSections.FindBySymbol(td); (* TODO *)
  13540. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13541. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13542. NewTypeDescriptor
  13543. END;
  13544. END;
  13545. END
  13546. END CheckTypeDeclaration
  13547. END MetaDataGenerator;
  13548. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  13549. VAR
  13550. trace-: BOOLEAN;
  13551. traceString-: SyntaxTree.IdentifierString;
  13552. traceModuleName-: SyntaxTree.IdentifierString;
  13553. profile-: BOOLEAN;
  13554. noRuntimeChecks: BOOLEAN;
  13555. simpleMetaData-: BOOLEAN;
  13556. noAsserts: BOOLEAN;
  13557. optimize-: BOOLEAN;
  13558. cooperative-: BOOLEAN;
  13559. preregisterStatic-: BOOLEAN;
  13560. dump-: Basic.Writer;
  13561. cellsAreObjects: BOOLEAN;
  13562. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  13563. experiment: BOOLEAN;
  13564. PROCEDURE &InitIntermediateBackend*;
  13565. BEGIN
  13566. simpleMetaData := FALSE;
  13567. InitBackend;
  13568. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  13569. SetTraceModuleName(DefaultTraceModuleName);
  13570. END InitIntermediateBackend;
  13571. (* must be overwritten by actual backend, if parameter registers should be used *)
  13572. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  13573. BEGIN
  13574. register := -1;
  13575. RETURN FALSE;
  13576. END GetParameterRegister;
  13577. PROCEDURE ResetParameterRegisters*;
  13578. BEGIN
  13579. END ResetParameterRegisters;
  13580. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  13581. VAR
  13582. declarationVisitor: DeclarationVisitor;
  13583. implementationVisitor: ImplementationVisitor;
  13584. module: Sections.Module;
  13585. name, platformName: SyntaxTree.IdentifierString;
  13586. meta: MetaDataGenerator;
  13587. crc: CRC.CRC32Stream;
  13588. BEGIN
  13589. ResetError;
  13590. Global.GetSymbolName(x,name);
  13591. NEW(module,x,system); (* backend structures *)
  13592. Global.GetModuleName(x, name);
  13593. module.SetModuleName(name);
  13594. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  13595. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  13596. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  13597. declarationVisitor.Module(x,module);
  13598. IF ~meta.simple THEN
  13599. meta.Module(implementationVisitor.moduleBodySection);
  13600. END;
  13601. GetDescription(platformName);
  13602. module.SetPlatformName(platformName);
  13603. NEW(crc);
  13604. module.allSections.WriteRaw(crc);
  13605. crc.Update;
  13606. meta.PatchCRC(crc.GetCRC());
  13607. RETURN module
  13608. END GenerateIntermediate;
  13609. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  13610. BEGIN RETURN TRUE
  13611. END SupportedImmediate;
  13612. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  13613. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  13614. END ProcessSyntaxTreeModule;
  13615. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  13616. VAR
  13617. result: Sections.Module;
  13618. traceName: Basic.MessageString;
  13619. BEGIN
  13620. ASSERT(intermediateCodeModule IS Sections.Module);
  13621. result := intermediateCodeModule(Sections.Module);
  13622. IF trace THEN
  13623. traceName := "intermediate code trace: ";
  13624. Strings.Append(traceName,traceString);
  13625. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  13626. IF (traceString="") OR (traceString="*") THEN
  13627. result.Dump(dump);
  13628. dump.Update
  13629. ELSE
  13630. Sections.DumpFiltered(dump, result, traceString);
  13631. END
  13632. END;
  13633. RETURN result
  13634. END ProcessIntermediateCodeModule;
  13635. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  13636. BEGIN instructionSet := "Intermediate";
  13637. END GetDescription;
  13638. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  13639. BEGIN
  13640. SELF.simpleMetaData := simpleMetaData;
  13641. END SetSimpleMetaData;
  13642. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  13643. BEGIN COPY(name, traceModuleName)
  13644. END SetTraceModuleName;
  13645. PROCEDURE DefineOptions*(options: Options.Options);
  13646. BEGIN
  13647. DefineOptions^(options);
  13648. options.Add(0X,"trace",Options.String);
  13649. options.Add(0X,"builtinsModule",Options.String);
  13650. options.Add(0X,"traceModule",Options.String);
  13651. options.Add(0X,"profile",Options.Flag);
  13652. options.Add(0X,"noRuntimeChecks",Options.Flag);
  13653. options.Add(0X,"noAsserts",Options.Flag);
  13654. options.Add(0X,"metaData",Options.String);
  13655. options.Add('o',"optimize", Options.Flag);
  13656. options.Add(0X,"preregisterStatic", Options.Flag);
  13657. options.Add(0X,"cellsAreObjects", Options.Flag);
  13658. options.Add(0X,"preciseGC", Options.Flag);
  13659. options.Add(0X,"trackLeave", Options.Flag);
  13660. options.Add(0X,"writeBarriers", Options.Flag);
  13661. options.Add(0X,"experiment", Options.Flag);
  13662. END DefineOptions;
  13663. PROCEDURE GetOptions*(options: Options.Options);
  13664. VAR name,string: SyntaxTree.IdentifierString;
  13665. BEGIN
  13666. GetOptions^(options);
  13667. trace := options.GetString("trace",traceString);
  13668. profile := options.GetFlag("profile");
  13669. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  13670. noAsserts := options.GetFlag("noAsserts");
  13671. cooperative := options.GetFlag("cooperative");
  13672. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  13673. simpleMetaData := TRUE
  13674. END;
  13675. IF options.GetString("metaData",string) THEN
  13676. IF string = "simple" THEN simpleMetaData := TRUE
  13677. ELSIF string ="full" THEN simpleMetaData := FALSE
  13678. END;
  13679. END;
  13680. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  13681. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  13682. optimize := options.GetFlag("optimize");
  13683. preregisterStatic := options.GetFlag("preregisterStatic");
  13684. cellsAreObjects := options.GetFlag("cellsAreObjects");
  13685. preciseGC := options.GetFlag("preciseGC");
  13686. trackLeave := options.GetFlag("trackLeave");
  13687. writeBarriers := options.GetFlag("writeBarriers");
  13688. experiment := options.GetFlag("experiment");
  13689. IF simpleMetaData THEN preciseGC := FALSE END;
  13690. END GetOptions;
  13691. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  13692. BEGIN RETURN SymbolFileFormat.Get()
  13693. END DefaultSymbolFileFormat;
  13694. END IntermediateBackend;
  13695. (* ----------------------------------- register allocation ------------------------------------- *)
  13696. (* register mapping scheme
  13697. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  13698. spill offset
  13699. part(n) --> ticket <--> physical register
  13700. spill offset
  13701. *)
  13702. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  13703. emptyOperand: IntermediateCode.Operand;
  13704. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  13705. statCoopResetVariables: LONGINT;
  13706. statCoopModifyAssignments: LONGINT;
  13707. modifyAssignmentsPC : LONGINT;
  13708. statCoopNilCheck: LONGINT;
  13709. statCoopSwitch: LONGINT;
  13710. statCoopAssignProcedure: LONGINT;
  13711. statCoopTraceMethod: LONGINT;
  13712. statCoopResetProcedure: LONGINT;
  13713. statCoopTraceModule: LONGINT;
  13714. PROCEDURE ResetStatistics*;
  13715. BEGIN
  13716. statCoopResetVariables := 0;
  13717. statCoopModifyAssignments := 0;
  13718. statCoopNilCheck:= 0;
  13719. statCoopSwitch:= 0;
  13720. statCoopAssignProcedure:= 0;
  13721. statCoopTraceMethod:= 0;
  13722. statCoopResetProcedure:= 0;
  13723. statCoopTraceModule:= 0;
  13724. END ResetStatistics;
  13725. PROCEDURE Statistics*;
  13726. BEGIN
  13727. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  13728. TRACE(statCoopNilCheck, statCoopSwitch);
  13729. TRACE(statCoopAssignProcedure,
  13730. statCoopTraceMethod,
  13731. statCoopResetProcedure,
  13732. statCoopTraceModule)
  13733. END Statistics;
  13734. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  13735. VAR h: LONGINT;
  13736. BEGIN
  13737. WHILE b # 0 DO
  13738. h := a MOD b;
  13739. a := b;
  13740. b := h;
  13741. END;
  13742. RETURN a
  13743. END GCD;
  13744. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  13745. BEGIN
  13746. RETURN a*b DIV GCD(a,b)
  13747. END SCM;
  13748. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  13749. BEGIN
  13750. (*TRACE(a,b);*)
  13751. IF a = 0 THEN RETURN b
  13752. ELSIF b = 0 THEN RETURN a
  13753. ELSE RETURN SCM(a,b)
  13754. END;
  13755. END CommonAlignment;
  13756. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13757. BEGIN
  13758. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  13759. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  13760. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13761. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  13762. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13763. END
  13764. END PassBySingleReference;
  13765. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13766. BEGIN
  13767. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  13768. END PassInRegister;
  13769. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  13770. VAR new: RegisterEntry;
  13771. BEGIN
  13772. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  13773. IF queue = NIL THEN
  13774. queue := new
  13775. ELSE
  13776. new.next := queue;
  13777. IF queue#NIL THEN queue.prev := new END;
  13778. queue := new
  13779. END;
  13780. END AddRegisterEntry;
  13781. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  13782. VAR this: RegisterEntry;
  13783. BEGIN
  13784. this := queue;
  13785. WHILE (this # NIL) & (this.register # register) DO
  13786. this := this.next;
  13787. END;
  13788. IF this = NIL THEN
  13789. RETURN FALSE
  13790. END;
  13791. ASSERT(this # NIL);
  13792. IF this = queue THEN queue := queue.next END;
  13793. IF this.prev # NIL THEN this.prev.next := this.next END;
  13794. IF this.next # NIL THEN this.next.prev := this.prev END;
  13795. RETURN TRUE
  13796. END RemoveRegisterEntry;
  13797. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  13798. BEGIN ASSERT(cond);
  13799. END Assert;
  13800. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  13801. BEGIN
  13802. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  13803. END ReusableRegister;
  13804. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  13805. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  13806. BEGIN
  13807. procedure := moduleScope.bodyProcedure;
  13808. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  13809. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  13810. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  13811. procedure.SetScope(moduleScope);
  13812. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  13813. procedure.SetAccess(SyntaxTree.Hidden);
  13814. moduleScope.SetBodyProcedure(procedure);
  13815. moduleScope.AddProcedure(procedure);
  13816. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  13817. END;
  13818. END EnsureBodyProcedure;
  13819. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  13820. VAR import: SyntaxTree.Import;
  13821. selfName: SyntaxTree.IdentifierString;
  13822. module: SyntaxTree.Module;
  13823. BEGIN
  13824. scope.ownerModule.GetName(selfName);
  13825. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  13826. module := scope.ownerModule
  13827. ELSE
  13828. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  13829. IF import = NIL THEN
  13830. RETURN NIL
  13831. ELSIF import.module = NIL THEN
  13832. RETURN NIL
  13833. ELSE module := import.module
  13834. END;
  13835. END;
  13836. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  13837. END GetSymbol;
  13838. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  13839. BEGIN
  13840. op.mode := mode;
  13841. IntermediateCode.InitOperand(op.op);
  13842. IntermediateCode.InitOperand(op.tag);
  13843. IntermediateCode.InitOperand(op.extra);
  13844. op.dimOffset := 0;
  13845. op.availability := -1;
  13846. END InitOperand;
  13847. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  13848. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  13849. BEGIN RETURN IntermediateCode.GetType(system, type)
  13850. END GetType;
  13851. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  13852. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  13853. BEGIN
  13854. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13855. (*
  13856. UniqueId(name,module,name,adr);
  13857. *)
  13858. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13859. constant.SetValue(value);
  13860. constant.SetAccess(SyntaxTree.Hidden);
  13861. module.moduleScope.AddConstant(constant);
  13862. constant.SetScope(module.moduleScope);
  13863. RETURN constant
  13864. END BuildConstant;
  13865. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13866. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13867. BEGIN
  13868. variable := scope.firstVariable;
  13869. WHILE variable # NIL DO
  13870. IF variable.NeedsTrace() THEN
  13871. RETURN TRUE;
  13872. END;
  13873. variable := variable.nextVariable;
  13874. END;
  13875. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13876. WHILE parameter # NIL DO
  13877. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13878. RETURN TRUE;
  13879. END;
  13880. parameter := parameter.nextParameter;
  13881. END;
  13882. RETURN FALSE;
  13883. END HasPointers;
  13884. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13885. 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));
  13886. END IsVariableParameter;
  13887. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13888. VAR parameter: SyntaxTree.Parameter;
  13889. BEGIN
  13890. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13891. WHILE parameter # NIL DO
  13892. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13893. IF parameter.movable THEN RETURN TRUE END;
  13894. parameter := parameter.nextParameter;
  13895. END;
  13896. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13897. END HasVariableParameters;
  13898. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13899. BEGIN
  13900. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13901. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13902. END HasExplicitTraceMethod;
  13903. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13904. BEGIN
  13905. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13906. IF (expression IS SyntaxTree.IntegerValue) THEN
  13907. val := expression(SyntaxTree.IntegerValue).value;
  13908. RETURN TRUE
  13909. ELSE
  13910. RETURN FALSE
  13911. END;
  13912. END IsIntegerConstant;
  13913. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13914. BEGIN
  13915. IF val <= 0 THEN RETURN FALSE END;
  13916. exp := 0;
  13917. WHILE ~ODD(val) DO
  13918. val := val DIV 2;
  13919. INC(exp)
  13920. END;
  13921. RETURN val = 1
  13922. END PowerOf2;
  13923. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13924. VAR procedure: SyntaxTree.Procedure;
  13925. BEGIN
  13926. procedure := record.recordScope.constructor;
  13927. IF procedure = NIL THEN
  13928. record := record.GetBaseRecord();
  13929. IF record # NIL THEN
  13930. procedure := GetConstructor(record)
  13931. END;
  13932. END;
  13933. RETURN procedure;
  13934. END GetConstructor;
  13935. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13936. BEGIN
  13937. value := SHORT(op.intValue);
  13938. RETURN op.mode = IntermediateCode.ModeImmediate;
  13939. END IsIntegerImmediate;
  13940. (** whether a type strictily is a pointer to record or object type
  13941. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13942. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13943. BEGIN
  13944. IF type = NIL THEN
  13945. RETURN FALSE
  13946. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13947. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13948. ELSE
  13949. RETURN FALSE
  13950. END
  13951. END IsStrictlyPointerToRecord;
  13952. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13953. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13954. END IsUnsafePointer;
  13955. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13956. BEGIN type := type.resolved;
  13957. IF type IS SyntaxTree.PointerType THEN
  13958. type := type(SyntaxTree.PointerType).pointerBase;
  13959. type := type.resolved;
  13960. IF type IS SyntaxTree.RecordType THEN
  13961. recordType := type(SyntaxTree.RecordType);
  13962. RETURN TRUE
  13963. ELSE
  13964. RETURN FALSE
  13965. END
  13966. ELSIF type IS SyntaxTree.RecordType THEN
  13967. recordType := type(SyntaxTree.RecordType);
  13968. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13969. ELSIF type IS SyntaxTree.ObjectType THEN
  13970. RETURN TRUE
  13971. ELSIF type IS SyntaxTree.AnyType THEN
  13972. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13973. ELSE
  13974. RETURN FALSE
  13975. END;
  13976. END IsPointerToRecord;
  13977. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13978. BEGIN
  13979. type := type.resolved;
  13980. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13981. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13982. END IsArrayOfSystemByte;
  13983. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13984. BEGIN
  13985. IF type = NIL THEN RETURN FALSE END;
  13986. type := type.resolved;
  13987. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13988. END IsOpenArray;
  13989. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13990. BEGIN
  13991. IF type = NIL THEN RETURN FALSE END;
  13992. type := type.resolved;
  13993. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13994. END IsSemiDynamicArray;
  13995. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13996. BEGIN
  13997. IF type = NIL THEN RETURN FALSE END;
  13998. type := type.resolved;
  13999. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  14000. END IsStaticArray;
  14001. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  14002. BEGIN
  14003. IF type = NIL THEN RETURN FALSE END;
  14004. type := type.resolved;
  14005. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  14006. END IsStaticMathArray;
  14007. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14008. BEGIN
  14009. WHILE (IsStaticMathArray(type)) DO
  14010. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14011. END;
  14012. RETURN type;
  14013. END StaticMathArrayBaseType;
  14014. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14015. VAR size: LONGINT;
  14016. BEGIN
  14017. size := 1;
  14018. WHILE (IsStaticArray(type)) DO
  14019. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  14020. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14021. END;
  14022. RETURN size;
  14023. END StaticArrayNumElements;
  14024. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14025. VAR size: LONGINT;
  14026. BEGIN
  14027. size := 1;
  14028. WHILE (IsStaticMathArray(type)) DO
  14029. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  14030. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14031. END;
  14032. RETURN size;
  14033. END StaticMathArrayNumElements;
  14034. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14035. BEGIN
  14036. WHILE (IsStaticArray(type)) DO
  14037. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14038. END;
  14039. RETURN type;
  14040. END StaticArrayBaseType;
  14041. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14042. BEGIN
  14043. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  14044. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14045. END;
  14046. RETURN type;
  14047. END ArrayBaseType;
  14048. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  14049. BEGIN
  14050. IF type = NIL THEN RETURN FALSE END;
  14051. type := type.resolved;
  14052. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  14053. END IsDelegate;
  14054. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  14055. VAR i: LONGINT;
  14056. BEGIN
  14057. i := 0; type := type.resolved;
  14058. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14059. INC(i);
  14060. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  14061. END;
  14062. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14063. INC(i);
  14064. type := type(SyntaxTree.MathArrayType).arrayBase;
  14065. IF type # NIL THEN type := type.resolved END;
  14066. END;
  14067. RETURN i
  14068. END DynamicDim;
  14069. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  14070. BEGIN
  14071. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14072. type := type(SyntaxTree.ArrayType).arrayBase;
  14073. END;
  14074. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14075. type := type(SyntaxTree.MathArrayType).arrayBase;
  14076. END;
  14077. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  14078. END StaticSize;
  14079. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  14080. BEGIN
  14081. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  14082. END IsImmediate;
  14083. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  14084. BEGIN
  14085. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  14086. END IsAddress;
  14087. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  14088. BEGIN
  14089. RETURN (x.mode = IntermediateCode.ModeRegister);
  14090. END IsRegister;
  14091. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  14092. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  14093. BEGIN
  14094. typeDeclaration := recordType.typeDeclaration;
  14095. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  14096. Global.GetSymbolSegmentedName(typeDeclaration,name);
  14097. END GetRecordTypeName;
  14098. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  14099. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  14100. BEGIN
  14101. parSize := 0;
  14102. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  14103. parameter := procedureType.returnParameter;
  14104. INC(parSize,system.SizeOfParameter(parameter));
  14105. parSize := parSize + (-parSize) MOD system.addressSize;
  14106. END;
  14107. parameter :=procedureType.lastParameter;
  14108. WHILE (parameter # NIL) DO
  14109. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  14110. INC(parSize, system.addressSize);
  14111. ELSE
  14112. INC(parSize,system.SizeOfParameter(parameter));
  14113. parSize := parSize + (-parSize) MOD system.addressSize;
  14114. END;
  14115. parameter := parameter.prevParameter;
  14116. END;
  14117. IF procedureType.selfParameter # NIL THEN
  14118. parameter := procedureType.selfParameter;
  14119. INC(parSize,system.SizeOfParameter(parameter));
  14120. parSize := parSize + (-parSize) MOD system.addressSize;
  14121. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  14122. END; (* method => self pointer *)
  14123. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  14124. RETURN ToMemoryUnits(system,parSize)
  14125. END ParametersSize;
  14126. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  14127. BEGIN
  14128. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  14129. END IsNested;
  14130. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  14131. BEGIN
  14132. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  14133. scope := scope.outerScope;
  14134. END;
  14135. RETURN scope # NIL;
  14136. END InCellScope;
  14137. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  14138. BEGIN
  14139. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  14140. END ProcedureParametersSize;
  14141. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  14142. VAR dataUnit: LONGINT;
  14143. BEGIN dataUnit := system.dataUnit;
  14144. ASSERT(size MOD system.dataUnit = 0);
  14145. RETURN LONGINT(size DIV system.dataUnit)
  14146. END ToMemoryUnits;
  14147. PROCEDURE Get*(): Backend.Backend;
  14148. VAR backend: IntermediateBackend;
  14149. BEGIN NEW(backend); RETURN backend
  14150. END Get;
  14151. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  14152. VAR instruction: IntermediateCode.Instruction;
  14153. BEGIN
  14154. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  14155. RETURN instruction
  14156. END Nop;
  14157. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14158. VAR instruction: IntermediateCode.Instruction;
  14159. BEGIN
  14160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  14161. RETURN instruction
  14162. END Mov;
  14163. (* like Mov but ensures that no new register will be allocated for dest *)
  14164. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14165. VAR instruction: IntermediateCode.Instruction;
  14166. BEGIN
  14167. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  14168. RETURN instruction
  14169. END MovReplace;
  14170. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14171. VAR instruction: IntermediateCode.Instruction;
  14172. BEGIN
  14173. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  14174. RETURN instruction
  14175. END Conv;
  14176. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  14177. VAR instruction: IntermediateCode.Instruction;
  14178. BEGIN
  14179. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  14180. RETURN instruction
  14181. END Call;
  14182. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  14183. VAR op1, op2, op3: IntermediateCode.Operand;
  14184. VAR instruction: IntermediateCode.Instruction;
  14185. BEGIN
  14186. IntermediateCode.InitNumber(op1,pcOffset);
  14187. IntermediateCode.InitNumber(op2,callingConvention);
  14188. IntermediateCode.InitNumber(op3,unwind);
  14189. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  14190. RETURN instruction
  14191. END Exit;
  14192. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14193. VAR instruction: IntermediateCode.Instruction;
  14194. BEGIN
  14195. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  14196. RETURN instruction
  14197. END Return;
  14198. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14199. VAR instruction: IntermediateCode.Instruction;
  14200. BEGIN
  14201. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  14202. RETURN instruction
  14203. END Result;
  14204. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  14205. VAR op1: IntermediateCode.Operand;
  14206. VAR instruction: IntermediateCode.Instruction;
  14207. BEGIN
  14208. IntermediateCode.InitNumber(op1,nr);
  14209. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  14210. RETURN instruction
  14211. END Trap;
  14212. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  14213. VAR instruction: IntermediateCode.Instruction;
  14214. BEGIN
  14215. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  14216. RETURN instruction
  14217. END Br;
  14218. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14219. VAR instruction: IntermediateCode.Instruction;
  14220. BEGIN
  14221. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  14222. RETURN instruction
  14223. END Breq;
  14224. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14225. VAR instruction: IntermediateCode.Instruction;
  14226. BEGIN
  14227. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  14228. RETURN instruction
  14229. END Brne;
  14230. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14231. VAR instruction: IntermediateCode.Instruction;
  14232. BEGIN
  14233. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  14234. RETURN instruction
  14235. END Brge;
  14236. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14237. VAR instruction: IntermediateCode.Instruction;
  14238. BEGIN
  14239. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  14240. RETURN instruction
  14241. END Brlt;
  14242. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  14243. VAR instruction: IntermediateCode.Instruction;
  14244. BEGIN
  14245. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  14246. RETURN instruction
  14247. END Pop;
  14248. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14249. VAR instruction: IntermediateCode.Instruction;
  14250. BEGIN
  14251. ASSERT(op.mode # IntermediateCode.Undefined);
  14252. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  14253. RETURN instruction
  14254. END Push;
  14255. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14256. VAR instruction: IntermediateCode.Instruction;
  14257. BEGIN
  14258. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  14259. RETURN instruction
  14260. END Neg;
  14261. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14262. VAR instruction: IntermediateCode.Instruction;
  14263. BEGIN
  14264. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  14265. RETURN instruction
  14266. END Not;
  14267. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14268. VAR instruction: IntermediateCode.Instruction;
  14269. BEGIN
  14270. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  14271. RETURN instruction
  14272. END Abs;
  14273. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14274. VAR instruction: IntermediateCode.Instruction;
  14275. BEGIN
  14276. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  14277. ASSERT(~IsImmediate(instruction.op1));
  14278. RETURN instruction
  14279. END Mul;
  14280. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14281. VAR instruction: IntermediateCode.Instruction;
  14282. BEGIN
  14283. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  14284. RETURN instruction
  14285. END Div;
  14286. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14287. VAR instruction: IntermediateCode.Instruction;
  14288. BEGIN
  14289. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  14290. RETURN instruction
  14291. END Mod;
  14292. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14293. VAR instruction: IntermediateCode.Instruction;
  14294. BEGIN
  14295. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  14296. RETURN instruction
  14297. END Sub;
  14298. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14299. VAR instruction: IntermediateCode.Instruction;
  14300. BEGIN
  14301. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  14302. RETURN instruction
  14303. END Add;
  14304. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14305. VAR instruction: IntermediateCode.Instruction;
  14306. BEGIN
  14307. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  14308. RETURN instruction
  14309. END And;
  14310. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14311. VAR instruction: IntermediateCode.Instruction;
  14312. BEGIN
  14313. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  14314. RETURN instruction
  14315. END Or;
  14316. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14317. VAR instruction: IntermediateCode.Instruction;
  14318. BEGIN
  14319. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  14320. RETURN instruction
  14321. END Xor;
  14322. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14323. VAR instruction: IntermediateCode.Instruction;
  14324. BEGIN
  14325. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  14326. RETURN instruction
  14327. END Shl;
  14328. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14329. VAR instruction: IntermediateCode.Instruction;
  14330. BEGIN
  14331. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  14332. RETURN instruction
  14333. END Shr;
  14334. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14335. VAR instruction: IntermediateCode.Instruction;
  14336. BEGIN
  14337. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  14338. RETURN instruction
  14339. END Rol;
  14340. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14341. VAR instruction: IntermediateCode.Instruction;
  14342. BEGIN
  14343. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  14344. RETURN instruction
  14345. END Ror;
  14346. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14347. VAR instruction: IntermediateCode.Instruction;
  14348. BEGIN
  14349. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  14350. RETURN instruction
  14351. END Cas;
  14352. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14353. VAR instruction: IntermediateCode.Instruction;
  14354. BEGIN
  14355. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  14356. ASSERT(~IntermediateCode.IsVectorRegister(src));
  14357. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  14358. RETURN instruction
  14359. END Copy;
  14360. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  14361. VAR instruction: IntermediateCode.Instruction;
  14362. BEGIN
  14363. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  14364. RETURN instruction
  14365. END Fill;
  14366. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  14367. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  14368. BEGIN
  14369. string := IntermediateCode.String(s);
  14370. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  14371. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  14372. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  14373. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  14374. RETURN instruction
  14375. END Asm;
  14376. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14377. VAR instruction: IntermediateCode.Instruction;
  14378. BEGIN
  14379. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  14380. RETURN instruction
  14381. END Data;
  14382. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  14383. VAR instruction: IntermediateCode.Instruction;
  14384. BEGIN
  14385. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  14386. IntermediateCode.SetSubType(instruction, subtype);
  14387. RETURN instruction
  14388. END SpecialInstruction;
  14389. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  14390. VAR op1: IntermediateCode.Operand;
  14391. VAR instruction: IntermediateCode.Instruction;
  14392. BEGIN
  14393. (*! generate a warning if size exceeds a certain limit *)
  14394. (*
  14395. ASSERT(bytes < 1000000); (* sanity check *)
  14396. *)
  14397. ASSERT(0 <= units); (* sanity check *)
  14398. IntermediateCode.InitNumber(op1,units);
  14399. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  14400. RETURN instruction
  14401. END Reserve;
  14402. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  14403. VAR op1: IntermediateCode.Operand;
  14404. VAR instruction: IntermediateCode.Instruction;
  14405. BEGIN
  14406. IntermediateCode.InitNumber(op1,position.start);
  14407. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  14408. RETURN instruction
  14409. END LabelInstruction;
  14410. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  14411. VAR pc: LONGINT;
  14412. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  14413. BEGIN
  14414. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  14415. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  14416. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  14417. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  14418. IF instr.op1.type.form = IntermediateCode.Float THEN
  14419. RETURN instr.op1.floatValue = op.floatValue
  14420. ELSE
  14421. RETURN instr.op1.intValue = op.intValue
  14422. END;
  14423. END ProvidesValue;
  14424. BEGIN
  14425. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  14426. pc := 0;
  14427. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  14428. INC(pc);
  14429. END;
  14430. IF pc = data.pc THEN
  14431. data.Emit(Data(Basic.invalidPosition,vop));
  14432. END;
  14433. RETURN pc
  14434. END EnterImmediate;
  14435. PROCEDURE Init;
  14436. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  14437. BEGIN
  14438. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  14439. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  14440. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  14441. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  14442. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  14443. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  14444. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  14445. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  14446. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  14447. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  14448. IntermediateCode.InitOperand(emptyOperand);
  14449. FOR i := 0 TO NumberSystemCalls-1 DO
  14450. name := "@SystemCall";
  14451. Basic.AppendNumber(name,i);
  14452. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  14453. END;
  14454. END Init;
  14455. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  14456. BEGIN
  14457. RETURN (symbol # NIL) & symbol.NeedsSection();
  14458. END IsExported;
  14459. BEGIN
  14460. Init;
  14461. END FoxIntermediateBackend.
  14462. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  14463. # Release.Build --path="/temp/obg/" Win32 ~
  14464. # 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 ~
  14465. FStols.CloseFiles A2Z.exe ~
  14466. System.FreeDownTo FoxIntermediateBackend ~
  14467. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  14468. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  14469. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  14470. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  14471. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  14472. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  14473. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  14474. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  14475. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  14476. GenericLinker.Mod Loader.Mod BootConsole.Mod