FoxIntermediateBackend.Mod 615 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973149741497514976149771497814979149801498114982149831498414985149861498714988149891499014991149921499314994149951499614997149981499915000150011500215003150041500515006150071500815009150101501115012150131501415015150161501715018150191502015021150221502315024150251502615027150281502915030150311503215033150341503515036150371503815039150401504115042150431504415045150461504715048150491505015051150521505315054150551505615057150581505915060150611506215063150641506515066150671506815069150701507115072150731507415075150761507715078150791508015081150821508315084150851508615087150881508915090150911509215093150941509515096150971509815099151001510115102151031510415105151061510715108151091511015111151121511315114151151511615117151181511915120151211512215123151241512515126151271512815129151301513115132151331513415135151361513715138151391514015141151421514315144151451514615147151481514915150151511515215153151541515515156151571515815159151601516115162151631516415165151661516715168151691517015171151721517315174151751517615177151781517915180151811518215183151841518515186151871518815189151901519115192151931519415195151961519715198151991520015201152021520315204152051520615207152081520915210152111521215213152141521515216152171521815219152201522115222152231522415225152261522715228152291523015231152321523315234152351523615237152381523915240152411524215243152441524515246152471524815249152501525115252152531525415255152561525715258152591526015261152621526315264152651526615267152681526915270152711527215273152741527515276152771527815279152801528115282152831528415285152861528715288152891529015291152921529315294152951529615297152981529915300153011530215303153041530515306153071530815309153101531115312153131531415315153161531715318153191532015321153221532315324153251532615327153281532915330153311533215333153341533515336153371533815339153401534115342153431534415345153461534715348153491535015351153521535315354153551535615357153581535915360153611536215363153641536515366153671536815369153701537115372153731537415375153761537715378153791538015381153821538315384153851538615387153881538915390153911539215393153941539515396153971539815399154001540115402154031540415405154061540715408154091541015411154121541315414154151541615417154181541915420154211542215423154241542515426154271542815429154301543115432154331543415435154361543715438154391544015441154421544315444154451544615447154481544915450154511545215453154541545515456154571545815459154601546115462154631546415465154661546715468154691547015471154721547315474154751547615477154781547915480154811548215483154841548515486154871548815489154901549115492154931549415495154961549715498154991550015501155021550315504155051550615507155081550915510155111551215513155141551515516155171551815519155201552115522155231552415525155261552715528155291553015531155321553315534155351553615537155381553915540155411554215543155441554515546155471554815549155501555115552155531555415555155561555715558155591556015561155621556315564155651556615567155681556915570155711557215573155741557515576155771557815579155801558115582155831558415585155861558715588155891559015591155921559315594155951559615597155981559915600156011560215603156041560515606156071560815609156101561115612156131561415615156161561715618156191562015621156221562315624156251562615627156281562915630156311563215633156341563515636156371563815639156401564115642156431564415645156461564715648156491565015651156521565315654156551565615657156581565915660156611566215663156641566515666156671566815669156701567115672156731567415675156761567715678156791568015681156821568315684156851568615687156881568915690156911569215693156941569515696156971569815699157001570115702157031570415705157061570715708157091571015711157121571315714157151571615717157181571915720157211572215723157241572515726157271572815729157301573115732157331573415735157361573715738157391574015741157421574315744157451574615747157481574915750157511575215753157541575515756157571575815759157601576115762157631576415765157661576715768157691577015771157721577315774157751577615777157781577915780157811578215783157841578515786157871578815789157901579115792157931579415795157961579715798157991580015801158021580315804158051580615807158081580915810158111581215813158141581515816158171581815819158201582115822158231582415825158261582715828158291583015831158321583315834158351583615837158381583915840158411584215843158441584515846158471584815849158501585115852158531585415855
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. Fingerprinter := FoxFingerprinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. BasePointerTypeSize = 5;
  59. BaseArrayTypeSize = BasePointerTypeSize + 3;
  60. LengthOffset = BasePointerTypeSize + 0;
  61. DataOffset = BasePointerTypeSize + 1;
  62. DescriptorOffset = BasePointerTypeSize + 2;
  63. BaseRecordTypeSize = BasePointerTypeSize + 2;
  64. ActionOffset = BasePointerTypeSize + 0;
  65. MonitorOffset = BasePointerTypeSize + 1;
  66. BaseObjectTypeSize = BaseRecordTypeSize;
  67. ActionTypeSize = 3;
  68. MonitorTypeSize = 7;
  69. ProcessorOffset = BaseObjectTypeSize + 1;
  70. StackLimitOffset* = BaseObjectTypeSize + 3;
  71. QuantumOffset = BaseObjectTypeSize + 4;
  72. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  73. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  74. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  75. Size2Flag = 4; (* size = 2 *)
  76. Size3Flag = 5; (* size = 3 *)
  77. Size4Flag = 6; (* size = 4 *)
  78. Size5Flag = 7; (* size = 5 *)
  79. Size6Flag = 8; (* size = 6 *)
  80. Size7Flag = 9; (* size = 7 *)
  81. Size8Flag = 10; (* size = 8 *)
  82. ReflectionSupport = TRUE;
  83. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  84. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  85. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  86. *)
  87. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  88. ProtectModulesPointers = FALSE;
  89. CreateProcedureDescInfo = TRUE;
  90. WarningDynamicLoading = FALSE;
  91. SysvABI = {SyntaxTree.CCallingConvention};
  92. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.WinAPICallingConvention};
  93. TYPE
  94. Position=SyntaxTree.Position;
  95. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  96. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  97. WriteBackCall = POINTER TO RECORD
  98. call: SyntaxTree.ProcedureCallDesignator;
  99. next: WriteBackCall;
  100. END;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. availability: WORD; (* index *)
  108. END;
  109. Fixup= POINTER TO RECORD
  110. pc: LONGINT;
  111. nextFixup: Fixup;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  164. END Error;
  165. (** types **)
  166. PROCEDURE Type(x: SyntaxTree.Type);
  167. BEGIN
  168. WITH x:
  169. SyntaxTree.QualifiedType DO QualifiedType(x)
  170. |SyntaxTree.MathArrayType DO meta.CheckTypeDeclaration(x)
  171. |SyntaxTree.PointerType DO meta.CheckTypeDeclaration(x) (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  172. |SyntaxTree.RecordType DO RecordType(x)
  173. |SyntaxTree.CellType DO CellType(x)
  174. ELSE
  175. END;
  176. END Type;
  177. PROCEDURE QualifiedType(x: SyntaxTree.QualifiedType);
  178. VAR type: SyntaxTree.Type;
  179. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  180. type := x.resolved;
  181. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  182. meta.CheckTypeDeclaration(type);
  183. END;
  184. END QualifiedType;
  185. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  186. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  187. BEGIN
  188. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  189. WHILE (this # NIL) & (this.identifier# id) DO
  190. this := this.nextModifier;
  191. END;
  192. RETURN this # NIL
  193. END HasFlag;
  194. PROCEDURE RecordType(x: SyntaxTree.RecordType);
  195. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  196. BEGIN (* no code emission *)
  197. meta.CheckTypeDeclaration(x);
  198. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  199. IF x.pointerType.typeDeclaration # NIL THEN
  200. td := x.pointerType.typeDeclaration
  201. ELSE
  202. td := x.typeDeclaration
  203. END;
  204. Global.GetSymbolName(td,name);
  205. (* code section for object *)
  206. END;
  207. Scope(x.recordScope);
  208. END RecordType;
  209. PROCEDURE CellType(x: SyntaxTree.CellType);
  210. VAR capabilities: SET;
  211. BEGIN
  212. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  213. capabilities := {};
  214. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  215. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  216. backend.SetCapabilities(capabilities);
  217. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  218. Scope(x.cellScope);
  219. END;
  220. END CellType;
  221. (* symbols *)
  222. PROCEDURE Variable(x: SyntaxTree.Variable);
  223. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  224. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  225. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  226. BEGIN
  227. type := type.resolved;
  228. IF type IS SyntaxTree.RecordType THEN
  229. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  230. ELSIF (type IS SyntaxTree.ArrayType) THEN
  231. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  232. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  233. END;
  234. ELSIF type IS SyntaxTree.MathArrayType THEN
  235. WITH type: SyntaxTree.MathArrayType DO
  236. IF type.form = SyntaxTree.Open THEN
  237. RETURN TRUE
  238. ELSIF type.form = SyntaxTree.Static THEN
  239. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  240. END;
  241. END;
  242. END;
  243. RETURN FALSE
  244. END TypeNeedsInitialization;
  245. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  246. VAR variable: SyntaxTree.Variable;
  247. BEGIN
  248. variable := scope.firstVariable;
  249. WHILE variable # NIL DO
  250. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  251. IF variable.initializer # NIL THEN RETURN TRUE END;
  252. variable := variable.nextVariable;
  253. END;
  254. RETURN FALSE
  255. END ScopeNeedsInitialization;
  256. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  257. VAR size: LONGINT;
  258. BEGIN
  259. size := offset - lastUpdated;
  260. IF size > 0 THEN
  261. irv.Emit(Reserve(x.position,size));
  262. END;
  263. irv.Emit(Data(x.position, op));
  264. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  265. END SingleInitialize;
  266. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  267. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  268. BEGIN
  269. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  270. WITH type:
  271. SyntaxTree.RecordType DO
  272. baseType := type.baseType;
  273. IF baseType # NIL THEN
  274. baseType := baseType.resolved;
  275. IF baseType IS SyntaxTree.PointerType THEN
  276. baseType := baseType(SyntaxTree.PointerType).pointerBase
  277. END;
  278. Initialize(baseType,NIL, offset);
  279. END;
  280. variable := type.recordScope.firstVariable;
  281. WHILE variable # NIL DO
  282. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  283. variable := variable.nextVariable
  284. END;
  285. | SyntaxTree.ArrayType DO
  286. IF type.form = SyntaxTree.Static THEN
  287. baseType := type.arrayBase;
  288. IF TypeNeedsInitialization(baseType) THEN
  289. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  290. FOR i := 0 TO type.staticLength-1 DO
  291. Initialize(baseType,NIL,offset+i*size);
  292. END;
  293. END;
  294. END;
  295. | SyntaxTree.MathArrayType DO
  296. IF type.form = SyntaxTree.Open THEN
  297. dim := DynamicDim(type);
  298. baseType := SemanticChecker.ArrayBase(type,dim);
  299. imm := IntermediateCode.Immediate(addressType,dim);
  300. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  301. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  302. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  303. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  304. (* flags remain empty (=0) for open array *)
  305. ELSIF type.form = SyntaxTree.Static THEN
  306. baseType := type.arrayBase;
  307. IF TypeNeedsInitialization(baseType) THEN
  308. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  309. ASSERT(type.staticLength < 1024*1024*1024);
  310. FOR i := 0 TO type.staticLength-1 DO
  311. Initialize(baseType,NIL,offset+i*size);
  312. END;
  313. END;
  314. END;
  315. ELSE
  316. IF initializer # NIL THEN
  317. implementationVisitor.Evaluate(initializer, op);
  318. SingleInitialize(op.op, offset);
  319. END;
  320. END;
  321. END Initialize;
  322. BEGIN
  323. IF x.externalName # NIL THEN RETURN END;
  324. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  325. (* code section for variable *)
  326. Global.GetSymbolSegmentedName(x,name);
  327. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  328. irv.SetExported(IsExported(x));
  329. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  330. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  331. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  332. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  333. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  334. FOR i := 0 TO DynamicDim(x.type)-1 DO
  335. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  336. END;
  337. ELSE
  338. lastUpdated:= 0;
  339. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  340. Initialize(x.type, x.initializer, 0);
  341. END;
  342. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  343. IF size > 0 THEN
  344. irv.Emit(Reserve(x.position,size));
  345. END;
  346. IF ~x.fixed THEN
  347. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  348. ELSE
  349. align := x.alignment;
  350. END;
  351. irv.SetPositionOrAlignment(x.fixed, align);
  352. meta.CheckTypeDeclaration(x.type);
  353. END;
  354. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  355. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  356. END;
  357. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  358. END Variable;
  359. PROCEDURE Parameter(x: SyntaxTree.Parameter);
  360. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  361. size: LONGINT; lastUpdated: LONGINT;
  362. BEGIN
  363. ASSERT(currentScope IS SyntaxTree.CellScope);
  364. Global.GetSymbolSegmentedName(x,name);
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  366. irv.SetExported(IsExported(x));
  367. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  368. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  369. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  370. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  371. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  372. FOR i := 0 TO DynamicDim(x.type)-1 DO
  373. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  374. END;
  375. ELSE
  376. lastUpdated:= 0;
  377. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  378. IF size > 0 THEN
  379. irv.Emit(Reserve(x.position,size));
  380. END;
  381. IF ~x.fixed THEN
  382. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  383. ELSE
  384. align := x.alignment;
  385. END;
  386. irv.SetPositionOrAlignment(x.fixed, align);
  387. meta.CheckTypeDeclaration(x.type);
  388. END;
  389. END Parameter;
  390. PROCEDURE TypeDeclaration(x: SyntaxTree.TypeDeclaration);
  391. BEGIN
  392. Type(x.declaredType); (* => code in objects *)
  393. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  394. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  395. END;
  396. END TypeDeclaration;
  397. PROCEDURE Constant(x: SyntaxTree.Constant);
  398. BEGIN
  399. IF (SyntaxTree.Public * x.access # {}) THEN
  400. implementationVisitor.VisitConstant(x);
  401. END;
  402. END Constant;
  403. PROCEDURE Scope(x: SyntaxTree.Scope);
  404. VAR procedure: SyntaxTree.Procedure;
  405. constant: SyntaxTree.Constant;
  406. variable: SyntaxTree.Variable;
  407. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  408. cell: SyntaxTree.CellType;
  409. parameter: SyntaxTree.Parameter;
  410. property: SyntaxTree.Property;
  411. BEGIN
  412. prevScope := currentScope;
  413. currentScope := x;
  414. (* constants treated in implementation visitor *)
  415. WITH x: SyntaxTree.CellScope DO
  416. cell := x.ownerCell;
  417. parameter := cell.firstParameter;
  418. WHILE parameter # NIL DO
  419. Parameter(parameter);
  420. parameter := parameter.nextParameter;
  421. END;
  422. property := cell.firstProperty;
  423. WHILE property # NIL DO
  424. Variable(property);
  425. property := property.nextProperty;
  426. END;
  427. ELSE
  428. END;
  429. typeDeclaration := x.firstTypeDeclaration;
  430. WHILE typeDeclaration # NIL DO
  431. TypeDeclaration(typeDeclaration);
  432. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  433. END;
  434. variable := x.firstVariable;
  435. WHILE variable # NIL DO
  436. Variable(variable);
  437. variable := variable.nextVariable;
  438. END;
  439. procedure := x.firstProcedure;
  440. WHILE procedure # NIL DO
  441. Procedure(procedure);
  442. procedure := procedure.nextProcedure;
  443. END;
  444. constant := x.firstConstant;
  445. WHILE constant # NIL DO
  446. Constant(constant);
  447. constant := constant.nextConstant;
  448. END;
  449. currentScope := prevScope;
  450. END Scope;
  451. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  452. VAR parameter: SyntaxTree.Parameter;
  453. BEGIN
  454. parameter := first;
  455. WHILE parameter # NIL DO
  456. Parameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. END Parameters;
  460. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  461. VAR scope: SyntaxTree.ProcedureScope;
  462. prevScope: SyntaxTree.Scope;
  463. inline, finalizer: BOOLEAN;
  464. procedureType: SyntaxTree.ProcedureType;
  465. pc: LONGINT;
  466. memorySize: Basic.Integer; stackSize: LONGINT;
  467. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  468. null,size,src,dest,fp,res: IntermediateCode.Operand;
  469. callingConvention: LONGINT;
  470. cellType: SyntaxTree.CellType;
  471. register: WORD;
  472. registerClass: IntermediateCode.RegisterClass;
  473. type: IntermediateCode.Type;
  474. formalParameter: SyntaxTree.Parameter;
  475. recordType: SyntaxTree.RecordType;
  476. isModuleBody: BOOLEAN;
  477. parametersSize: LONGINT;
  478. position: LONGINT;
  479. variable: SyntaxTree.Variable;
  480. nonParameterRegisters: WORD;
  481. PROCEDURE Signature;
  482. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  483. BEGIN
  484. procedureType := x.type(SyntaxTree.ProcedureType);
  485. returnType := procedureType.returnType;
  486. IF returnType # NIL THEN
  487. meta.CheckTypeDeclaration(returnType)
  488. END;
  489. parameter := procedureType.firstParameter;
  490. WHILE parameter # NIL DO
  491. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  492. parameter := parameter.nextParameter;
  493. END;
  494. END Signature;
  495. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  496. VAR result: BOOLEAN;
  497. BEGIN
  498. result := FALSE;
  499. IF x = SyntaxTree.invalidExpression THEN
  500. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  501. result := TRUE;
  502. value := x.resolved(SyntaxTree.IntegerValue).value;
  503. ELSE
  504. Error(x.position,"expression is not an integer constant");
  505. END;
  506. RETURN result;
  507. END CheckIntegerValue;
  508. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  509. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  510. BEGIN
  511. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  512. WHILE (this # NIL) & (this.identifier # id) DO
  513. this := this.nextModifier;
  514. END;
  515. IF this # NIL THEN
  516. IF this.expression = NIL THEN
  517. Error(this.position,"expected expression value");
  518. ELSIF CheckIntegerValue(this.expression,value) THEN
  519. END;
  520. RETURN TRUE
  521. ELSE RETURN FALSE
  522. END;
  523. END HasValue;
  524. CONST DefaultDataMemorySize=512;
  525. BEGIN
  526. IF x.externalName # NIL THEN RETURN END;
  527. (*
  528. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  529. *)
  530. (* code section for this procedure *)
  531. position := x.position.start;
  532. scope := x.procedureScope;
  533. prevScope := currentScope;
  534. currentScope := scope;
  535. procedureType := x.type(SyntaxTree.ProcedureType);
  536. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  537. implementationVisitor.temporaries.Clear;
  538. implementationVisitor.usedRegisters := NIL;
  539. implementationVisitor.registerUsageCount.Init;
  540. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  541. IF (scope.body # NIL) & (x.isInline) THEN
  542. inline := TRUE;
  543. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  544. ir.SetExported(IsExported(x));
  545. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  546. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  547. IF backend.cellsAreObjects THEN
  548. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  549. ir.SetExported(IsExported(x));
  550. ELSE
  551. RETURN; (* cellnet cannot be compiled for final static hardware *)
  552. END;
  553. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  554. inline := FALSE;
  555. AddBodyCallStub(x);
  556. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  557. ir.SetExported(IsExported(x));
  558. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  559. inline := FALSE;
  560. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  561. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  562. AddBodyCallStub(x);
  563. AddStackAllocation(x,memorySize);
  564. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  565. ir.SetExported(IsExported(x));
  566. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  567. inline := FALSE;
  568. Parameters(procedureType.firstParameter);
  569. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  570. ir.SetExported(IsExported(x));
  571. ELSE
  572. inline := FALSE;
  573. IF x.isEntry OR x.isExit THEN
  574. IF x.isEntry THEN
  575. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  576. ELSE
  577. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  578. END;
  579. ir.SetExported(TRUE);
  580. ELSE
  581. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  582. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  583. END;
  584. END;
  585. callingConvention := procedureType.callingConvention;
  586. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  587. parametersSize := ProcedureParametersSize(backend.system,x);
  588. ELSE
  589. parametersSize := 0;
  590. END;
  591. IF scope.body # NIL THEN
  592. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  593. IF ~inline THEN
  594. IF scope.lastVariable = NIL THEN
  595. stackSize := 0
  596. ELSE
  597. stackSize := scope.lastVariable.offsetInBits;
  598. IF stackSize <0 THEN stackSize := -stackSize END;
  599. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  600. END;
  601. (*
  602. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  603. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  604. *)
  605. (*
  606. ir.Emit(Nop(position)); (* placeholder for fill *)
  607. *)
  608. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  609. backend.ResetParameterRegisters();
  610. (* assumption: registers are passed left to right and left parameters are in registers *)
  611. formalParameter := procedureType.firstParameter;
  612. WHILE (formalParameter # NIL) DO
  613. IF PassInRegister(formalParameter, callingConvention) THEN
  614. IF formalParameter.type.IsRecordType() THEN
  615. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  616. type := addressType;
  617. ELSE
  618. type := GetType(system, formalParameter.type);
  619. END;
  620. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  621. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  622. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  623. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  624. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  625. implementationVisitor.ReleaseIntermediateOperand(src);
  626. END;
  627. END;
  628. formalParameter := formalParameter.nextParameter;
  629. END;
  630. END;
  631. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  632. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  633. END;
  634. pc := ir.pc-1;
  635. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  636. backend.ResetParameterRegisters();
  637. nonParameterRegisters := 0;
  638. (* assumption: registers are passed left to right and left parameters are in registers *)
  639. formalParameter := procedureType.firstParameter;
  640. WHILE (formalParameter # NIL) DO
  641. IF PassInRegister(formalParameter, callingConvention) THEN
  642. IF formalParameter.type.IsRecordType() THEN
  643. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  644. type := addressType;
  645. ELSE
  646. type := GetType(system, formalParameter.type);
  647. END;
  648. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  649. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  650. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  651. implementationVisitor.currentScope := currentScope;
  652. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  653. formalParameter.SetOffset(variable.offsetInBits);
  654. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  655. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  656. implementationVisitor.ReleaseIntermediateOperand(src);
  657. ELSE
  658. INC(nonParameterRegisters);
  659. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  660. END;
  661. END;
  662. formalParameter := formalParameter.nextParameter;
  663. END;
  664. END;
  665. END;
  666. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  667. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  668. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  669. IF scope.lastVariable # NIL THEN
  670. stackSize := scope.lastVariable.offsetInBits;
  671. IF stackSize <0 THEN stackSize := -stackSize END;
  672. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  673. END;
  674. END;
  675. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  676. (*
  677. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  678. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  679. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  680. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  681. ir.EmitAt(pc,Push(size));
  682. implementationVisitor.StaticCallOperand(result,procedure);
  683. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  684. END;
  685. *)
  686. END;
  687. *)
  688. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  689. IF stackSize > 0 THEN
  690. IF (stackSize MOD system.addressSize = 0) THEN
  691. null := IntermediateCode.Immediate(addressType,0);
  692. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  693. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  694. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  695. ELSE
  696. null := IntermediateCode.Immediate(int8,0);
  697. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  698. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  699. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  700. END;
  701. (*! should potentially be called by backend -- enter might initialize
  702. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  703. *)
  704. END;
  705. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  706. parametersSize := ProcedureParametersSize(backend.system,x);
  707. ELSE
  708. parametersSize := 0;
  709. END;
  710. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  711. finalizer := FALSE;
  712. IF backend.cooperative & x.isFinalizer THEN
  713. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  714. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  715. GetRecordTypeName(recordType,name);
  716. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  717. END;
  718. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  719. IF backend.cooperative THEN
  720. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  721. IF implementationVisitor.profile & ~isModuleBody THEN
  722. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  723. END;
  724. ELSE
  725. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  726. END;
  727. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  728. IF finalizer THEN
  729. IF backend.hasLinkRegister THEN
  730. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  731. END;
  732. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  733. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  734. ir.Emit(Br(x.position,dest));
  735. ELSE
  736. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  737. END;
  738. ELSE
  739. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  740. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  741. END;
  742. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  743. IF backend.cooperative THEN
  744. IF HasPointers (scope) THEN
  745. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  746. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  747. ir.Emit(Result(x.position, res));
  748. ir.Emit(Push(x.position, res));
  749. implementationVisitor.ResetVariables(scope);
  750. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  751. ir.Emit(Pop(x.position, res));
  752. ir.Emit(Return(x.position, res));
  753. ELSE
  754. implementationVisitor.ResetVariables(scope);
  755. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  756. END;
  757. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  758. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  759. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  760. ir.Emit(Result(x.position, res));
  761. ir.Emit(Push(x.position, res));
  762. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  763. ir.Emit(Pop(x.position, res));
  764. ir.Emit(Return(x.position, res));
  765. ELSE
  766. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  767. END;
  768. END;
  769. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  770. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  771. ELSE
  772. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  773. ir.Emit(Nop(x.position));
  774. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  775. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  776. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  777. END;
  778. END;
  779. END
  780. ELSIF ~inline THEN
  781. ir.Emit(Nop(x.position)); (* jump label *)
  782. END;
  783. ELSE (* force body for procedures *)
  784. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  785. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  786. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  787. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  788. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  789. END;
  790. Scope(scope);
  791. Signature;
  792. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  793. currentScope := prevScope;
  794. END Procedure;
  795. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  796. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  797. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  798. BEGIN
  799. ASSERT (bodyProcedure # NIL);
  800. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  801. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  802. procedure.SetScope(bodyProcedure.scope);
  803. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  804. procedure.SetAccess(SyntaxTree.Hidden);
  805. Global.GetSymbolSegmentedName (procedure,name);
  806. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  807. ir.SetExported(TRUE);
  808. Global.GetSymbolSegmentedName (bodyProcedure,name);
  809. IF ~meta.simple THEN
  810. implementationVisitor.currentScope := module.module.moduleScope;
  811. implementationVisitor.section := ir;
  812. implementationVisitor.PushSelfPointer();
  813. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  814. ELSIF backend.preregisterStatic THEN
  815. implementationVisitor.currentScope := module.module.moduleScope;
  816. implementationVisitor.section := ir;
  817. implementationVisitor.PushSelfPointer();
  818. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  819. ELSE
  820. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  821. ir.Emit(Call(bodyProcedure.position,op, 0));
  822. END;
  823. END AddBodyCallStub;
  824. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  825. VAR name: Basic.SegmentedName;
  826. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  827. BEGIN
  828. Global.GetSymbolSegmentedName (symbol,name);
  829. Basic.RemoveSuffix(name);
  830. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  831. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  832. ir.SetExported(TRUE);
  833. IntermediateCode.InitImmediate(op,addressType,initStack);
  834. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  835. END AddStackAllocation;
  836. (** entry function to visit a complete module *)
  837. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  838. VAR
  839. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  840. hasDynamicOperatorDeclarations: BOOLEAN;
  841. operator: SyntaxTree.Operator;
  842. import: SyntaxTree.Import;
  843. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  844. BEGIN
  845. type := type.resolved;
  846. IF type IS SyntaxTree.RecordType THEN
  847. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  848. ELSIF (type IS SyntaxTree.ArrayType) THEN
  849. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  850. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  851. END;
  852. ELSIF type IS SyntaxTree.MathArrayType THEN
  853. WITH type: SyntaxTree.MathArrayType DO
  854. IF type.form = SyntaxTree.Open THEN
  855. RETURN TRUE
  856. ELSIF type.form = SyntaxTree.Static THEN
  857. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  858. END;
  859. END;
  860. END;
  861. RETURN FALSE
  862. END TypeNeedsInitialization;
  863. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  864. VAR variable: SyntaxTree.Variable;
  865. BEGIN
  866. variable := scope.firstVariable;
  867. WHILE variable # NIL DO
  868. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  869. IF variable.initializer # NIL THEN RETURN TRUE END;
  870. variable := variable.nextVariable;
  871. END;
  872. RETURN FALSE
  873. END ScopeNeedsInitialization;
  874. BEGIN
  875. ASSERT(x # NIL); ASSERT(module # NIL);
  876. SELF.module := module;
  877. (* add import names to the generated Sections.Module *)
  878. import := x.moduleScope.firstImport;
  879. WHILE import # NIL DO
  880. import.module.GetName(idstr);
  881. module.imports.AddName(idstr);
  882. import := import.nextImport
  883. END;
  884. implementationVisitor.module := module;
  885. implementationVisitor.moduleScope := x.moduleScope;
  886. implementationVisitor.moduleSelf := moduleSelf;
  887. implementationVisitor.canBeLoaded := TRUE;
  888. meta.SetModule(module);
  889. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  890. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  891. END;
  892. IF backend.profile THEN
  893. EnsureBodyProcedure(x.moduleScope);
  894. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  895. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  896. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  897. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  898. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  899. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  900. Global.GetModuleName(module.module,idstr);
  901. implementationVisitor.ProfilerAddModule(idstr);
  902. implementationVisitor.numberProcedures := 0;
  903. END;
  904. implementationVisitor.profile := backend.profile;
  905. (* check if there is at least one dynamic operator locally defined *)
  906. hasDynamicOperatorDeclarations := FALSE;
  907. operator := x.moduleScope.firstOperator;
  908. WHILE operator # NIL DO
  909. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  910. operator := operator.nextOperator
  911. END;
  912. (* add operator initialization code section *)
  913. IF hasDynamicOperatorDeclarations THEN
  914. EnsureBodyProcedure(x.moduleScope);
  915. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  916. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  917. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  918. END;
  919. Scope(x.moduleScope);
  920. IF hasDynamicOperatorDeclarations THEN
  921. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  922. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  923. END;
  924. IF backend.profile THEN
  925. implementationVisitor.ProfilerPatchInit;
  926. END;
  927. END Module;
  928. END DeclarationVisitor;
  929. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  930. RegisterUsageCount*=OBJECT
  931. VAR used: UsedArray; count: LONGINT;
  932. PROCEDURE &Init;
  933. VAR i: LONGINT;
  934. BEGIN
  935. count := 0;
  936. IF used = NIL THEN NEW(used,64); END;
  937. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  938. END Init;
  939. PROCEDURE Grow;
  940. VAR new: UsedArray; size,i: LONGINT;
  941. BEGIN
  942. size := LEN(used)*2;
  943. NEW(new,size);
  944. FOR i := 0 TO LEN(used)-1 DO
  945. new[i].count := used[i].count;
  946. new[i].type := used[i].type;
  947. new[i].map := used[i].map
  948. END;
  949. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  950. used := new
  951. END Grow;
  952. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  953. BEGIN
  954. INC(count);
  955. IF count = LEN(used) THEN Grow END;
  956. used[count].type := type;
  957. used[count].class := class;
  958. used[count].map := count;
  959. RETURN count;
  960. END Next;
  961. PROCEDURE IncUse(register: LONGINT);
  962. BEGIN
  963. INC(used[register].count);
  964. (*
  965. IF (register = 1) & (count > 30) THEN
  966. D.TraceBack;
  967. END;
  968. *)
  969. END IncUse;
  970. PROCEDURE DecUse(register: LONGINT);
  971. BEGIN
  972. DEC(used[register].count);
  973. END DecUse;
  974. PROCEDURE Map(register: LONGINT): LONGINT;
  975. VAR map : LONGINT;
  976. BEGIN
  977. IF register > 0 THEN
  978. map := used[register].map;
  979. WHILE register # map DO register := map; map := used[register].map END;
  980. END;
  981. RETURN register
  982. END Map;
  983. PROCEDURE Use(register: LONGINT): LONGINT;
  984. BEGIN
  985. IF register< LEN(used) THEN
  986. RETURN used[register].count
  987. ELSE
  988. RETURN 0
  989. END
  990. END Use;
  991. END RegisterUsageCount;
  992. RegisterEntry = POINTER TO RECORD
  993. prev,next: RegisterEntry;
  994. register: LONGINT;
  995. registerClass: IntermediateCode.RegisterClass;
  996. type: IntermediateCode.Type;
  997. END;
  998. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  999. Variables = OBJECT (Basic.List)
  1000. VAR
  1001. inUse: VariableUse;
  1002. registerIndex: LONGINT;
  1003. nameIndex: LONGINT;
  1004. PROCEDURE & Init;
  1005. VAR i: LONGINT;
  1006. BEGIN
  1007. InitList(16);
  1008. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1009. registerIndex := 1024;
  1010. nameIndex := 0;
  1011. END Init;
  1012. PROCEDURE Clear*;
  1013. VAR i: LONGINT;
  1014. BEGIN
  1015. Clear^;
  1016. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1017. registerIndex := 1024;
  1018. nameIndex := 0;
  1019. END Clear;
  1020. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1021. VAR string: SyntaxTree.IdentifierString ;
  1022. BEGIN
  1023. COPY("@hiddenIRVar",string);
  1024. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1025. RETURN SyntaxTree.NewIdentifier(string);
  1026. END GetUID;
  1027. PROCEDURE GetUsage(VAR use: VariableUse);
  1028. BEGIN
  1029. use := inUse;
  1030. END GetUsage;
  1031. PROCEDURE SetUsage(CONST use: VariableUse);
  1032. BEGIN
  1033. inUse := use;
  1034. END SetUsage;
  1035. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1036. VAR any: ANY;
  1037. BEGIN
  1038. any := Get(i);
  1039. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1040. END GetVariable;
  1041. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1042. BEGIN
  1043. Set(pos, v);
  1044. END SetVariable;
  1045. PROCEDURE Occupy(pos: LONGINT);
  1046. BEGIN
  1047. INCL(inUse[pos DIV 32], pos MOD 32);
  1048. END Occupy;
  1049. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1050. BEGIN
  1051. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1052. END Occupied;
  1053. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1054. BEGIN
  1055. Occupy(Length());
  1056. Add(v);
  1057. END AddVariable;
  1058. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1059. BEGIN
  1060. t1 := t1.resolved;
  1061. t2 := t2.resolved;
  1062. (*RETURN t1.SameType(t2); *)
  1063. RETURN
  1064. (t1.SameType(t2))
  1065. OR
  1066. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1067. OR
  1068. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1069. OR
  1070. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1071. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1072. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1073. OR
  1074. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1075. (DynamicDim(t1) = DynamicDim(t2))
  1076. );
  1077. END CompatibleType;
  1078. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1079. VAR var : SyntaxTree.Variable; i: LONGINT;
  1080. BEGIN
  1081. pos := Length();
  1082. FOR i := 0 TO pos-1 DO
  1083. IF ~(Occupied(i)) THEN
  1084. var := GetVariable(i);
  1085. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1086. pos := i;
  1087. Occupy(i);
  1088. RETURN var;
  1089. END;
  1090. END;
  1091. END;
  1092. RETURN NIL
  1093. END GetFreeVariable;
  1094. END Variables;
  1095. SymbolMap = POINTER TO RECORD
  1096. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1097. isAddress: BOOLEAN;
  1098. END;
  1099. SymbolMapper = OBJECT
  1100. VAR
  1101. first: SymbolMap;
  1102. PROCEDURE & Init;
  1103. BEGIN
  1104. first := NIL;
  1105. END Init;
  1106. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1107. VAR new: SymbolMap;
  1108. BEGIN
  1109. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1110. new.next := first; first := new;
  1111. END Add;
  1112. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1113. VAR s: SymbolMap;
  1114. BEGIN
  1115. s := first;
  1116. WHILE (s # NIL) & (s.this # this) DO
  1117. s := s.next
  1118. END;
  1119. RETURN s
  1120. END Get;
  1121. END SymbolMapper;
  1122. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1123. VAR
  1124. system: Global.System;
  1125. section: IntermediateCode.Section;
  1126. module: Sections.Module;
  1127. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1128. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1129. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1130. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1131. checker: SemanticChecker.Checker;
  1132. backend: IntermediateBackend;
  1133. meta: MetaDataGenerator;
  1134. position: Position;
  1135. moduleSelf: SyntaxTree.Variable;
  1136. (* variables for hand over of variables / temporary state *)
  1137. currentScope: SyntaxTree.Scope;
  1138. constantDeclaration : SyntaxTree.Symbol;
  1139. result: Operand; (* result of the most recent expression / statement *)
  1140. destination: IntermediateCode.Operand;
  1141. arrayDestinationTag: IntermediateCode.Operand;
  1142. arrayDestinationDimension:LONGINT;
  1143. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1144. exitLabel: Label;
  1145. locked: BOOLEAN;
  1146. (*
  1147. usedRegisters: Registers;
  1148. *)
  1149. registerUsageCount: RegisterUsageCount;
  1150. usedRegisters: RegisterEntry;
  1151. (* useful operands and types *)
  1152. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1153. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1154. commentPrintout: Printout.Printer;
  1155. dump: Streams.Writer;
  1156. tagsAvailable : BOOLEAN;
  1157. supportedInstruction: SupportedInstructionProcedure;
  1158. supportedImmediate: SupportedImmediateProcedure;
  1159. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1160. emitLabels: BOOLEAN;
  1161. builtinsModuleName : SyntaxTree.IdentifierString;
  1162. indexCounter: LONGINT;
  1163. profile: BOOLEAN;
  1164. profileId, profileInit: IntermediateCode.Section;
  1165. profileInitPatchPosition: LONGINT;
  1166. numberProcedures: LONGINT;
  1167. procedureResultDesignator : SyntaxTree.Designator;
  1168. operatorInitializationCodeSection: IntermediateCode.Section;
  1169. fingerprinter: Fingerprinter.Fingerprinter;
  1170. temporaries: Variables;
  1171. canBeLoaded : BOOLEAN;
  1172. currentIsInline: BOOLEAN;
  1173. currentMapper: SymbolMapper;
  1174. currentInlineExit: Label;
  1175. moduleBodySection: IntermediateCode.Section;
  1176. NeedDescriptor : BOOLEAN;
  1177. cooperativeSwitches: BOOLEAN;
  1178. lastSwitchPC: LONGINT;
  1179. isUnchecked: BOOLEAN;
  1180. (* EXPERIMENTAL *)
  1181. availableSymbols: ARRAY 1024 OF
  1182. RECORD
  1183. symbol: SyntaxTree.Symbol;
  1184. inMemory, inRegister: BOOLEAN;
  1185. register: IntermediateCode.Operand;
  1186. memory: IntermediateCode.Operand;
  1187. END;
  1188. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1189. BEGIN
  1190. SELF.system := system;
  1191. SELF.builtinsModuleName := runtime;
  1192. currentScope := NIL;
  1193. hiddenPointerType := NIL;
  1194. delegatePointerType := NIL;
  1195. awaitProcCounter := 0;
  1196. labelId := 0; constId := 0; labelId := 0;
  1197. SELF.checker := checker;
  1198. SELF.backend := backend;
  1199. position := Basic.invalidPosition;
  1200. locked := FALSE;
  1201. InitOperand(result,ModeUndefined);
  1202. addressType := IntermediateCode.GetType(system,system.addressType);
  1203. setType := IntermediateCode.GetType(system,system.setType);
  1204. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1205. lenType := IntermediateCode.GetType(system, system.lenType);
  1206. byteType := IntermediateCode.GetType(system, system.byteType);
  1207. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1208. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1209. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1210. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1211. nil := IntermediateCode.Immediate(addressType,0);
  1212. one := IntermediateCode.Immediate(addressType,1);
  1213. IntermediateCode.InitOperand(destination);
  1214. tagsAvailable := TRUE;
  1215. supportedInstruction := supportedInstructionProcedure;
  1216. supportedImmediate := supportedImmediateProcedure;
  1217. inData := FALSE;
  1218. SELF.emitLabels := emitLabels;
  1219. IntermediateCode.InitOperand(arrayDestinationTag);
  1220. bool := IntermediateCode.GetType(system,system.booleanType);
  1221. IntermediateCode.InitImmediate(false,bool,0);
  1222. IntermediateCode.InitImmediate(true,bool,1);
  1223. indexCounter := 0;
  1224. NEW(registerUsageCount);
  1225. usedRegisters := NIL;
  1226. procedureResultDesignator := NIL;
  1227. NEW(fingerprinter);
  1228. NEW(temporaries);
  1229. currentIsInline := FALSE;
  1230. NeedDescriptor := FALSE;
  1231. isUnchecked := backend.noRuntimeChecks;
  1232. END Init;
  1233. TYPE Context = RECORD
  1234. section: IntermediateCode.Section;
  1235. registerUsageCount: RegisterUsageCount;
  1236. usedRegisters: RegisterEntry;
  1237. temporaries: Variables;
  1238. END;
  1239. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1240. VAR context: Context;
  1241. BEGIN
  1242. context.section := section;
  1243. context.registerUsageCount := registerUsageCount;
  1244. context.usedRegisters := usedRegisters;
  1245. context.temporaries := temporaries;
  1246. section := new;
  1247. NEW(registerUsageCount);
  1248. NEW(temporaries);
  1249. usedRegisters := NIL;
  1250. RETURN context;
  1251. END SwitchContext;
  1252. PROCEDURE ReturnToContext(context: Context);
  1253. BEGIN
  1254. section := context.section;
  1255. registerUsageCount := context.registerUsageCount;
  1256. usedRegisters := context.usedRegisters;
  1257. temporaries := context.temporaries;
  1258. END ReturnToContext;
  1259. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1260. VAR fp: SyntaxTree.Fingerprint; section: IntermediateCode.Section;
  1261. BEGIN
  1262. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1263. fp := fingerprinter.SymbolFP(syntaxTreeSymbol)
  1264. END;
  1265. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1266. section.SetExported(IsExported(syntaxTreeSymbol));
  1267. RETURN section
  1268. END NewSection;
  1269. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1270. VAR new: LONGINT;
  1271. BEGIN
  1272. new := registerUsageCount.Next(type,class);
  1273. UseRegister(new);
  1274. RETURN new
  1275. END AcquireRegister;
  1276. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1277. VAR
  1278. fingerprint: SyntaxTree.Fingerprint;
  1279. fingerprintString: ARRAY SIZE OF Basic.Fingerprint * 2 + 1 OF CHAR;
  1280. BEGIN
  1281. fingerprint := fingerprinter.SymbolFP(symbol);
  1282. string := "[";
  1283. Strings.IntToHexStr(fingerprint.public, SIZE OF Basic.Fingerprint * 2, fingerprintString);
  1284. Strings.Append(string, fingerprintString);
  1285. Strings.Append(string, "]");
  1286. END GetFingerprintString;
  1287. (** get the name for the code section that represens a certain symbol
  1288. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1289. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1290. VAR string: ARRAY 32 OF CHAR;
  1291. BEGIN
  1292. Global.GetSymbolSegmentedName(symbol, name);
  1293. (* if the symbol is an operator, then append the fingerprint to the name *)
  1294. IF symbol IS SyntaxTree.Operator THEN
  1295. GetFingerprintString(symbol, string);
  1296. Basic.AppendToSegmentedName(name,string);
  1297. END
  1298. END GetCodeSectionNameForSymbol;
  1299. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1300. BEGIN
  1301. IF dump # NIL THEN
  1302. dump.String("enter "); dump.String(s); dump.Ln;
  1303. END;
  1304. END TraceEnter;
  1305. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1306. BEGIN
  1307. IF dump # NIL THEN
  1308. dump.String("exit "); dump.String(s); dump.Ln;
  1309. END;
  1310. END TraceExit;
  1311. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1312. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1313. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1314. VAR i: LONGINT;
  1315. BEGIN
  1316. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1317. IF op.rule # NIL THEN
  1318. FOR i := 0 TO LEN(op.rule)-1 DO
  1319. CheckRegister(op.rule[i])
  1320. END;
  1321. END;
  1322. END CheckRegister;
  1323. BEGIN
  1324. CheckRegister(instruction.op1);
  1325. CheckRegister(instruction.op2);
  1326. CheckRegister(instruction.op3);
  1327. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1328. ELSE section.Emit(instruction);
  1329. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1330. END;
  1331. END Emit;
  1332. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1333. VAR saved: RegisterEntry;
  1334. BEGIN
  1335. IF backend.cooperative THEN
  1336. ReleaseUsedRegisters(saved);
  1337. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1338. CallThis(position,"Runtime","Trap",1);
  1339. RestoreRegisterUse(saved);
  1340. ELSE
  1341. Emit(Trap(position,trapNo));
  1342. END;
  1343. END EmitTrap;
  1344. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1345. VAR name: Basic.SegmentedName;
  1346. VAR op1, op2, reg: IntermediateCode.Operand;
  1347. VAR call, nocall: Label;
  1348. VAR parametersSize: LONGINT;
  1349. VAR prevSection: IntermediateCode.Section;
  1350. VAR prevDump: Streams.Writer;
  1351. VAR body: SyntaxTree.Body;
  1352. VAR procedureType: SyntaxTree.ProcedureType;
  1353. BEGIN
  1354. IF procedure # NIL THEN
  1355. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1356. ELSE procedureType := NIL;
  1357. END;
  1358. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1359. prevSection := SELF.section;
  1360. SELF.section := section;
  1361. prevDump := dump;
  1362. dump := section.comments;
  1363. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1364. IF backend.hasLinkRegister THEN
  1365. Emit(Push(Basic.invalidPosition, lr));
  1366. END;
  1367. Emit(Push(Basic.invalidPosition,fp));
  1368. IF procedure # NIL THEN
  1369. body := procedure.procedureScope.body;
  1370. ELSE
  1371. body := NIL;
  1372. END;
  1373. IF backend.cooperative THEN
  1374. IF callconv IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention} THEN
  1375. Emit(Push(Basic.invalidPosition, one)) ;
  1376. ELSE
  1377. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1378. GetCodeSectionNameForSymbol(procedure, name);
  1379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1380. ELSE
  1381. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1382. END;
  1383. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1384. IntermediateCode.AddOffset(op1, 1);
  1385. Emit(Push(Basic.invalidPosition,op1));
  1386. END;
  1387. Emit(Mov(Basic.invalidPosition,fp, sp));
  1388. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1389. NEW(call, section);
  1390. NEW(nocall, section);
  1391. reg := NewRegisterOperand(addressType);
  1392. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1393. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1394. BrltL(call, sp, reg);
  1395. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1396. BrgeL(nocall, sp, op2);
  1397. call.Resolve(section.pc);
  1398. Emit(Push(Basic.invalidPosition, reg));
  1399. ReleaseIntermediateOperand(reg);
  1400. parametersSize := ProcParametersSize(procedure);
  1401. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1402. Emit(Push(Basic.invalidPosition, op2));
  1403. CallThis(position, "Activities","ExpandStack",2);
  1404. Emit(Result(Basic.invalidPosition, sp));
  1405. nocall.Resolve(section.pc);
  1406. END;
  1407. ELSE
  1408. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1409. Emit(Push(Basic.invalidPosition, one)) ;
  1410. procedureType.SetParametersOffset(1);
  1411. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1412. END;
  1413. Emit(Mov(Basic.invalidPosition, fp, sp));
  1414. END;
  1415. END;
  1416. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1417. SELF.section := prevSection;
  1418. dump := prevDump;
  1419. END EmitEnter;
  1420. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1421. VAR op1,op2: IntermediateCode.Operand;
  1422. VAR instruction: IntermediateCode.Instruction;
  1423. BEGIN
  1424. IntermediateCode.InitNumber(op1,callconv);
  1425. IntermediateCode.InitNumber(op2,varSize);
  1426. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1427. RETURN instruction
  1428. END Enter;
  1429. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1430. VAR op1: IntermediateCode.Operand;
  1431. VAR instruction: IntermediateCode.Instruction;
  1432. BEGIN
  1433. IntermediateCode.InitNumber(op1,callconv);
  1434. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1435. RETURN instruction
  1436. END Leave;
  1437. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1438. VAR prevSection: IntermediateCode.Section;
  1439. VAR op2: IntermediateCode.Operand;
  1440. VAR body: SyntaxTree.Body;
  1441. BEGIN
  1442. prevSection := SELF.section;
  1443. SELF.section := section;
  1444. Emit(Leave(position, callconv));
  1445. IF procedure # NIL THEN
  1446. body := procedure.procedureScope.body;
  1447. ELSE
  1448. body := NIL;
  1449. END;
  1450. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1451. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1452. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1453. Emit(Add(position, sp, fp, op2));
  1454. ELSE
  1455. Emit(Mov(position, sp, fp));
  1456. END;
  1457. Emit(Pop(position, fp));
  1458. END;
  1459. SELF.section := prevSection;
  1460. END EmitLeave;
  1461. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1462. VAR m: SymbolMap;
  1463. BEGIN
  1464. position := x.position;
  1465. IF currentIsInline THEN
  1466. m := currentMapper.Get(x);
  1467. IF m # NIL THEN
  1468. (*
  1469. Printout.Info("mapping from", x);
  1470. Printout.Info("mapping to ", m.to);
  1471. *)
  1472. VExpression(m.to);
  1473. op := result;
  1474. IF m.tag # NIL THEN
  1475. ReleaseIntermediateOperand(result.tag);
  1476. VExpression(m.tag);
  1477. op.tag := result.op;
  1478. ReleaseIntermediateOperand(result.tag);
  1479. END;
  1480. RETURN
  1481. END;
  1482. END;
  1483. VSymbol(x);
  1484. op := result;
  1485. END Symbol;
  1486. PROCEDURE Expression(x: SyntaxTree.Expression);
  1487. BEGIN
  1488. position := x.position;
  1489. constantDeclaration := NIL;
  1490. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1491. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1492. END;
  1493. IF x.resolved # NIL THEN
  1494. VExpression(x.resolved);
  1495. ELSE
  1496. VExpression(x);
  1497. END;
  1498. (* check this, was commented out in ActiveCells3 *)
  1499. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1500. Error(x.position, "unsupported modifier");
  1501. END;
  1502. END Expression;
  1503. (*
  1504. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1505. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1506. BEGIN
  1507. temporaries.GetUsage(current);
  1508. FOR i := 0 TO LEN(current)-1 DO
  1509. set := current[i] - previous[i];
  1510. IF set # {} THEN
  1511. FOR j := 0 TO MAX(SET)-1 DO
  1512. IF j IN set THEN
  1513. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1514. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1515. Symbol(variable, op);
  1516. MakeMemory(tmp,op.op,addressType,0);
  1517. ReleaseOperand(op);
  1518. Emit(Mov(position,tmp, nil ) );
  1519. ReleaseIntermediateOperand(tmp);
  1520. END;
  1521. END;
  1522. END;
  1523. END;
  1524. END;
  1525. END ResetUsedTemporaries;
  1526. *)
  1527. PROCEDURE Statement(x: SyntaxTree.Statement);
  1528. VAR use: VariableUse;
  1529. BEGIN
  1530. temporaries.GetUsage(use);
  1531. position := x.position;
  1532. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1533. IF commentPrintout # NIL THEN
  1534. commentPrintout.Statement(x);
  1535. dump.Ln;
  1536. (*dump.Update;*)
  1537. END;
  1538. VStatement(x);
  1539. (*
  1540. CheckRegistersFree();
  1541. *)
  1542. (*ResetUsedTemporaries(use);*)
  1543. temporaries.SetUsage(use);
  1544. END Statement;
  1545. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1546. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1547. *)
  1548. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1549. BEGIN
  1550. ASSERT(op.mode # IntermediateCode.Undefined);
  1551. IF op.mode = IntermediateCode.ModeMemory THEN
  1552. ReuseCopy(res,op);
  1553. ELSE
  1554. res := op;
  1555. UseIntermediateOperand(res);
  1556. END;
  1557. IntermediateCode.AddOffset(res,offset);
  1558. IntermediateCode.MakeMemory(res,type);
  1559. END MakeMemory;
  1560. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1561. VAR mem: IntermediateCode.Operand;
  1562. BEGIN
  1563. MakeMemory(mem,res,type,offset);
  1564. ReleaseIntermediateOperand(res);
  1565. res := mem;
  1566. END ToMemory;
  1567. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1568. VAR mem: IntermediateCode.Operand;
  1569. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1570. componentType: SyntaxTree.Type;
  1571. BEGIN
  1572. type := type.resolved;
  1573. IF operand.mode = ModeReference THEN
  1574. IF type IS SyntaxTree.RangeType THEN
  1575. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1576. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1577. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1578. ReleaseOperand(operand);
  1579. operand.op := firstOp;
  1580. operand.tag := lastOp;
  1581. operand.extra := stepOp;
  1582. ELSIF type IS SyntaxTree.ComplexType THEN
  1583. componentType := type(SyntaxTree.ComplexType).componentType;
  1584. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1585. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1586. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1587. ReleaseOperand(operand);
  1588. operand.op := firstOp;
  1589. operand.tag := lastOp
  1590. ELSE
  1591. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1592. ReleaseIntermediateOperand(operand.op);
  1593. (* EXPERIMENTAL *)
  1594. IF operand.availability >= 0 THEN
  1595. IF availableSymbols[operand.availability].inRegister THEN
  1596. operand.op := availableSymbols[operand.availability].register;
  1597. UseIntermediateOperand(operand.op);
  1598. ELSE
  1599. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1600. availableSymbols[operand.availability].memory := mem;
  1601. operand.op := availableSymbols[operand.availability].register;
  1602. Emit(Mov(position, operand.op, mem));
  1603. availableSymbols[operand.availability].inRegister := TRUE;
  1604. END;
  1605. ReleaseIntermediateOperand(mem);
  1606. ELSE
  1607. operand.op := mem;
  1608. END;
  1609. END;
  1610. operand.mode := ModeValue;
  1611. END;
  1612. ASSERT(operand.mode = ModeValue);
  1613. END LoadValue;
  1614. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1615. BEGIN
  1616. InitOperand(result, ModeUndefined);
  1617. Expression(x);
  1618. op := result;
  1619. LoadValue(op,x.type.resolved);
  1620. END Evaluate;
  1621. PROCEDURE EvaluateX(CONST x: SyntaxTree.Expression; VAR result: Operand);
  1622. VAR operand: Operand; type: SyntaxTree.Type; symbol: SyntaxTree.Symbol;
  1623. BEGIN
  1624. Evaluate(x, result); RETURN;
  1625. IF (x.resolved # NIL) & (x.resolved # x) THEN EvaluateX(x.resolved, result); RETURN END;
  1626. WITH x:
  1627. SyntaxTree.UnaryExpression DO
  1628. EvaluateUnaryExpression(x, result);
  1629. RETURN;
  1630. |SyntaxTree.BinaryExpression DO
  1631. EvaluateBinaryExpression(x, result);
  1632. RETURN;
  1633. |SyntaxTree.Set DO
  1634. EvaluateSet(x, result);
  1635. RETURN;
  1636. |SyntaxTree.RangeExpression DO
  1637. InitOperand(result, ModeValue);
  1638. ASSERT(x.first # NIL);
  1639. EvaluateX(x.first, operand);
  1640. result.op := operand.op;
  1641. UseIntermediateOperand(result.op);
  1642. ReleaseOperand(operand);
  1643. ASSERT(x.last # NIL);
  1644. EvaluateX(x.last, operand);
  1645. result.tag := operand.op;
  1646. UseIntermediateOperand(result.tag);
  1647. ReleaseOperand(operand);
  1648. IF x.step # NIL THEN
  1649. EvaluateX(x.step, operand);
  1650. result.extra := operand.op;
  1651. UseIntermediateOperand(result.extra);
  1652. ReleaseOperand(operand);
  1653. END;
  1654. |SyntaxTree.SymbolDesignator DO
  1655. symbol := x.symbol;
  1656. WITH symbol: SyntaxTree.Constant DO
  1657. EvaluateX(symbol.value, result);
  1658. RETURN
  1659. ELSE (* designate and load --> below *)
  1660. END;
  1661. |SyntaxTree.BuiltinCallDesignator DO
  1662. EvaluateBuiltinCallDesignator(x,result);
  1663. (*
  1664. |SyntaxTree.Conversion DO
  1665. |SyntaxTree.ProcedureCallDesignator
  1666. |SyntaxTree.TypeGuardDesignator
  1667. |SyntaxTree.DereferenceDesignator
  1668. |SyntaxTree.SupercallDesignator
  1669. |SyntaxTree.SelfDesignator
  1670. *)
  1671. |SyntaxTree.BooleanValue DO
  1672. InitOperand(result,ModeValue);
  1673. IF x.value THEN result.op := true ELSE result.op := false END;
  1674. RETURN;
  1675. |SyntaxTree.IntegerValue DO
  1676. InitOperand(result,ModeValue);
  1677. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1678. IF ~supportedImmediate(result.op) &~inData THEN
  1679. GetImmediateMem(result.op)
  1680. END;
  1681. RETURN;
  1682. |SyntaxTree.CharacterValue DO
  1683. InitOperand(result,ModeValue);
  1684. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  1685. RETURN;
  1686. |SyntaxTree.RealValue DO
  1687. InitOperand(result,ModeValue);
  1688. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1689. RETURN;
  1690. |SyntaxTree.ComplexValue DO
  1691. ASSERT(x.type IS SyntaxTree.ComplexType);
  1692. type := x.type(SyntaxTree.ComplexType).componentType;
  1693. InitOperand(result,ModeValue);
  1694. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,type),x.realValue); (* real part *)
  1695. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,type),x.imagValue); (* imaginary part *)
  1696. RETURN;
  1697. |SyntaxTree.NilValue DO
  1698. InitOperand(result,ModeValue);
  1699. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1700. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1701. RETURN;
  1702. |SyntaxTree.EnumerationValue DO
  1703. InitOperand(result,ModeValue);
  1704. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  1705. RETURN;
  1706. ELSE (* other designators *)
  1707. END;
  1708. Designate(x, result);
  1709. LoadValue(result, x.type);
  1710. END EvaluateX;
  1711. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1712. BEGIN
  1713. InitOperand(result,ModeUndefined);
  1714. Expression(x);
  1715. (* ASSERT(x.mode = ModeReference *)
  1716. op := result;
  1717. END Designate;
  1718. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1719. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1720. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1721. leftExpression, rightExpression: SyntaxTree.Expression;
  1722. BEGIN
  1723. ASSERT(label # NIL);
  1724. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1725. WITH x:
  1726. SyntaxTree.UnaryExpression DO
  1727. CASE x.operator OF
  1728. Scanner.Not:
  1729. Condition(x.left,label,~reason);
  1730. RETURN;
  1731. ELSE
  1732. END;
  1733. | SyntaxTree.BinaryExpression DO
  1734. leftType := x.left.type.resolved;
  1735. rightType := x.right.type.resolved;
  1736. CASE x.operator OF
  1737. Scanner.Or:
  1738. (* shortcut evaluation of left OR right *)
  1739. IF reason THEN (*left or right*)
  1740. Condition(x.left,label,TRUE);
  1741. Condition(x.right,label,TRUE);
  1742. ELSE (* ~ (left or right) = ~left & ~right *)
  1743. skip := NewLabel();
  1744. Condition(x.left,skip,TRUE);
  1745. Condition(x.right,label,FALSE);
  1746. SetLabel(skip);
  1747. END;
  1748. RETURN;
  1749. |Scanner.And:
  1750. (* shortcut evaluation of left & right *)
  1751. IF reason THEN (* left and right *)
  1752. skip := NewLabel();
  1753. Condition(x.left,skip,FALSE);
  1754. Condition(x.right,label,TRUE);
  1755. SetLabel(skip);
  1756. ELSE (* ~(left and right) = ~left or ~right *)
  1757. Condition(x.left,label,FALSE);
  1758. Condition(x.right,label,FALSE);
  1759. END;
  1760. RETURN;
  1761. |Scanner.Is:
  1762. (* get type desc tag *)
  1763. IF IsPointerToRecord(x.left.type,recordType) THEN
  1764. EvaluateX(x.left, left);
  1765. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1766. ELSE
  1767. Designate(x.left,left);
  1768. END;
  1769. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1770. ReleaseOperand(left);
  1771. RETURN;
  1772. |Scanner.Equal:
  1773. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1774. IF reason THEN
  1775. CompareString(BreqL,label,x.left,x.right);
  1776. ELSE
  1777. CompareString(BrneL,label,x.left,x.right);
  1778. END;
  1779. ELSE
  1780. Evaluate(x.left,left);
  1781. Evaluate(x.right,right);
  1782. IF leftType IS SyntaxTree.RangeType THEN
  1783. ASSERT(rightType IS SyntaxTree.RangeType);
  1784. IF reason THEN
  1785. skip := NewLabel();
  1786. BrneL(skip, left.op, right.op); (* first *)
  1787. BrneL(skip, left.tag, right.tag); (* last *)
  1788. BreqL(label, left.extra, right.extra); (* step *)
  1789. SetLabel(skip);
  1790. ELSE
  1791. BrneL(label, left.op, right.op); (* first *)
  1792. BrneL(label, left.tag, right.tag); (* last *)
  1793. BrneL(label, left.extra, right.extra); (* step *)
  1794. END;
  1795. ReleaseOperand(left); ReleaseOperand(right);
  1796. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1797. IF reason THEN
  1798. skip := NewLabel();
  1799. BrneL(skip, left.op, right.op); (* first *)
  1800. BreqL(label, left.tag, right.tag); (* last *)
  1801. SetLabel(skip);
  1802. ELSE
  1803. BrneL(label, left.op, right.op); (* first *)
  1804. BrneL(label, left.tag, right.tag); (* last *)
  1805. END;
  1806. ReleaseOperand(left); ReleaseOperand(right);
  1807. ELSE
  1808. IF reason THEN
  1809. BreqL(label,left.op,right.op);
  1810. ELSE
  1811. BrneL(label,left.op,right.op);
  1812. END;
  1813. ReleaseOperand(left); ReleaseOperand(right);
  1814. END;
  1815. END;
  1816. RETURN;
  1817. |Scanner.LessEqual:
  1818. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1819. IF reason THEN
  1820. CompareString(BrgeL,label,x.right,x.left);
  1821. ELSE
  1822. CompareString(BrltL,label,x.right,x.left);
  1823. END;
  1824. ELSE
  1825. Evaluate(x.left,left);
  1826. Evaluate(x.right,right);
  1827. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1828. Reuse1(temp,right.op);
  1829. Emit(And(position,temp,left.op,right.op));
  1830. ReleaseOperand(right);
  1831. IF reason THEN
  1832. BreqL(label,temp,left.op);
  1833. ELSE
  1834. BrneL(label,temp,left.op);
  1835. END;
  1836. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1837. ELSE
  1838. IF reason THEN
  1839. BrgeL(label,right.op,left.op);
  1840. ELSE
  1841. BrltL(label,right.op,left.op);
  1842. END;
  1843. ReleaseOperand(left); ReleaseOperand(right);
  1844. END;
  1845. END;
  1846. RETURN;
  1847. |Scanner.Less:
  1848. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1849. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1850. leftExpression.SetType(system.booleanType);
  1851. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1852. rightExpression.SetType(system.booleanType);
  1853. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1854. leftExpression.SetType(system.booleanType);
  1855. Condition(leftExpression,label,reason);
  1856. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1857. IF reason THEN
  1858. CompareString(BrltL,label,x.left,x.right);
  1859. ELSE
  1860. CompareString(BrgeL,label,x.left,x.right);
  1861. END;
  1862. ELSE
  1863. Evaluate(x.left,left);
  1864. Evaluate(x.right,right);
  1865. IF reason THEN
  1866. BrltL(label,left.op,right.op);
  1867. ELSE
  1868. BrgeL(label,left.op,right.op);
  1869. END;
  1870. ReleaseOperand(left); ReleaseOperand(right);
  1871. END;
  1872. RETURN;
  1873. |Scanner.Greater:
  1874. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1875. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1876. leftExpression.SetType(system.booleanType);
  1877. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1878. rightExpression.SetType(system.booleanType);
  1879. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1880. leftExpression.SetType(system.booleanType);
  1881. Condition(leftExpression,label,reason);
  1882. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1883. IF reason THEN
  1884. CompareString(BrltL,label,x.right,x.left);
  1885. ELSE
  1886. CompareString(BrgeL,label,x.right,x.left);
  1887. END;
  1888. ELSE
  1889. Evaluate(x.left,left);
  1890. Evaluate(x.right,right);
  1891. IF reason THEN
  1892. BrltL(label, right.op,left.op);
  1893. ELSE
  1894. BrgeL(label, right.op,left.op);
  1895. END;
  1896. ReleaseOperand(left); ReleaseOperand(right);
  1897. END;
  1898. RETURN;
  1899. |Scanner.GreaterEqual:
  1900. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1901. IF reason THEN
  1902. CompareString(BrgeL,label,x.left,x.right);
  1903. ELSE
  1904. CompareString(BrltL,label,x.left,x.right);
  1905. END;
  1906. ELSE
  1907. Evaluate(x.left,left);
  1908. Evaluate(x.right,right);
  1909. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1910. Reuse1(temp,left.op);
  1911. Emit(And(position,temp,left.op,right.op));
  1912. ReleaseOperand(left);
  1913. IF reason THEN
  1914. BreqL(label, temp, right.op);
  1915. ELSE
  1916. BrneL(label, temp, right.op);
  1917. END;
  1918. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1919. ELSE
  1920. IF reason THEN
  1921. BrgeL(label,left.op,right.op);
  1922. ELSE
  1923. BrltL(label, left.op,right.op);
  1924. END;
  1925. ReleaseOperand(left); ReleaseOperand(right);
  1926. END;
  1927. END;
  1928. RETURN;
  1929. |Scanner.Unequal:
  1930. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1931. IF reason THEN
  1932. CompareString(BrneL,label,x.left,x.right);
  1933. ELSE
  1934. CompareString(BreqL,label,x.left,x.right);
  1935. END
  1936. ELSE
  1937. Evaluate(x.left,left);
  1938. Evaluate(x.right,right);
  1939. IF leftType IS SyntaxTree.RangeType THEN
  1940. ASSERT(rightType IS SyntaxTree.RangeType);
  1941. IF ~reason THEN
  1942. skip := NewLabel();
  1943. BrneL(skip, left.op, right.op); (* first *)
  1944. BrneL(skip, left.tag, right.tag); (* last *)
  1945. BreqL(label, left.extra, right.extra); (* step *)
  1946. SetLabel(skip);
  1947. ELSE
  1948. BrneL(label, left.op, right.op); (* first *)
  1949. BrneL(label, left.tag, right.tag); (* last *)
  1950. BrneL(label, left.extra, right.extra); (* step *)
  1951. END;
  1952. ReleaseOperand(left); ReleaseOperand(right);
  1953. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1954. IF reason THEN
  1955. BrneL(label, left.op, right.op);
  1956. BrneL(label, left.tag, right.tag);
  1957. ELSE
  1958. skip := NewLabel();
  1959. BrneL(skip, left.op, right.op);
  1960. BreqL(label, left.tag, right.tag);
  1961. SetLabel(skip);
  1962. END;
  1963. ReleaseOperand(left); ReleaseOperand(right);
  1964. ELSE
  1965. IF reason THEN
  1966. BrneL(label,left.op,right.op);
  1967. ELSE
  1968. BreqL(label,left.op,right.op);
  1969. END;
  1970. ReleaseOperand(left); ReleaseOperand(right);
  1971. END;
  1972. END;
  1973. RETURN;
  1974. ELSE (* case *)
  1975. END;
  1976. |SyntaxTree.BooleanValue DO
  1977. IF reason = x.value THEN BrL(label) END;
  1978. RETURN;
  1979. ELSE (* with *)
  1980. END;
  1981. (* default case: evaluate and compare result *)
  1982. EvaluateX(x,left);
  1983. IF reason THEN
  1984. BrneL(label,left.op, false);
  1985. ELSE
  1986. BreqL(label,left.op, false);
  1987. END;
  1988. ReleaseOperand(left);
  1989. END Condition;
  1990. PROCEDURE EvaluateUnaryExpression(x: SyntaxTree.UnaryExpression; VAR result: Operand);
  1991. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1992. BEGIN
  1993. IF Trace THEN TraceEnter("EvaluateUnaryExpression") END;
  1994. dest := destination; destination := emptyOperand;
  1995. CASE x.operator OF
  1996. Scanner.Not:
  1997. EvaluateX(x.left, operand);
  1998. InitOperand(result,ModeValue);
  1999. Reuse1a(result.op,operand.op,dest);
  2000. Emit(Xor(position,result.op,operand.op,true));
  2001. ReleaseOperand(operand);
  2002. |Scanner.Minus:
  2003. EvaluateX(x.left, operand);
  2004. InitOperand(result,ModeValue);
  2005. Reuse1a(result.op,operand.op,dest);
  2006. type := x.left.type.resolved;
  2007. IF type IS SyntaxTree.SetType THEN
  2008. Emit(Not(position,result.op,operand.op));
  2009. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2010. Reuse1(result.tag,operand.tag);
  2011. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2012. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2013. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2014. Emit(Neg(position,result.op,operand.op));
  2015. ELSE HALT(200)
  2016. END;
  2017. ReleaseOperand(operand);
  2018. |Scanner.Address:
  2019. Designate(x.left,result);
  2020. result.mode := ModeValue;
  2021. t0 := x.left.type.resolved;
  2022. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2023. ReleaseIntermediateOperand(result.op);
  2024. result.op := result.tag;
  2025. IntermediateCode.InitOperand(result.tag);
  2026. END;
  2027. Convert(result.op,IntermediateCode.GetType(system,x.type));
  2028. END;
  2029. destination := dest;
  2030. IF Trace THEN TraceExit("UnaryExpression") END;
  2031. END EvaluateUnaryExpression;
  2032. PROCEDURE EvaluateBinaryExpression(x: SyntaxTree.BinaryExpression; VAR result: Operand);
  2033. VAR left,right: Operand;zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2034. leftType,rightType: SyntaxTree.Type;
  2035. leftExpression,rightExpression : SyntaxTree.Expression;
  2036. componentType: IntermediateCode.Type;
  2037. exit: Label; dest: IntermediateCode.Operand;
  2038. size: LONGINT;
  2039. BEGIN
  2040. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2041. dest := destination; destination := emptyOperand;
  2042. leftType := x.left.type.resolved;
  2043. rightType := x.right.type.resolved;
  2044. CASE x.operator OF
  2045. Scanner.Or, Scanner.And, Scanner.Is:
  2046. result := ConditionValue(x);
  2047. |Scanner.Plus:
  2048. EvaluateX(x.left,left);
  2049. EvaluateX(x.right,right);
  2050. IF leftType IS SyntaxTree.SetType THEN
  2051. InitOperand(result,ModeValue);
  2052. Reuse2a(result.op,left.op,right.op,dest);
  2053. Emit(Or(position,result.op,left.op,right.op));
  2054. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2055. InitOperand(result,ModeValue);
  2056. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2057. Reuse2(result.tag,left.tag,right.tag);
  2058. Emit(Add(position,result.op,left.op,right.op));
  2059. Emit(Add(position,result.tag,left.tag,right.tag))
  2060. ELSE
  2061. InitOperand(result,ModeValue);
  2062. Reuse2a(result.op,left.op,right.op,dest);
  2063. Emit(Add(position,result.op,left.op,right.op));
  2064. END;
  2065. ReleaseOperand(left); ReleaseOperand(right);
  2066. |Scanner.Minus:
  2067. EvaluateX(x.left,left);
  2068. EvaluateX(x.right,right);
  2069. IF leftType IS SyntaxTree.SetType THEN
  2070. InitOperand(result,ModeValue);
  2071. Reuse1(result.op,right.op);
  2072. Emit(Not(position,result.op,right.op));
  2073. ReleaseOperand(right);
  2074. Emit(And(position,result.op,result.op,left.op));
  2075. ReleaseOperand(left);
  2076. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2077. InitOperand(result,ModeValue);
  2078. Reuse2a(result.op,left.op,right.op,dest);
  2079. Reuse2(result.tag,left.tag,right.tag);
  2080. Emit(Sub(position,result.op,left.op,right.op));
  2081. Emit(Sub(position,result.tag,left.tag,right.tag));
  2082. ReleaseOperand(left); ReleaseOperand(right)
  2083. ELSE
  2084. InitOperand(result,ModeValue);
  2085. Reuse2a(result.op,left.op,right.op,dest);
  2086. Emit(Sub(position,result.op,left.op,right.op));
  2087. ReleaseOperand(left); ReleaseOperand(right);
  2088. END;
  2089. |Scanner.Times:
  2090. EvaluateX(x.left, left);
  2091. EvaluateX(x.right, right);
  2092. IF leftType IS SyntaxTree.SetType THEN
  2093. InitOperand(result,ModeValue);
  2094. Reuse2a(result.op,left.op,right.op,dest);
  2095. Emit(And(position,result.op,left.op,right.op));
  2096. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2097. InitOperand(result, ModeValue);
  2098. componentType := left.op.type;
  2099. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2100. Emit(Mul(position,result.op, left.op, right.op));
  2101. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2102. Emit(Mul(position,tempReg, left.tag, right.tag));
  2103. Emit(Sub(position,result.op, result.op, tempReg));
  2104. Reuse2(result.tag, left.tag, right.op);
  2105. Emit(Mul(position,result.tag, left.tag, right.op));
  2106. Emit(Mul(position,tempReg, left.op, right.tag));
  2107. Emit(Add(position,result.tag, result.tag, tempReg));
  2108. ReleaseIntermediateOperand(tempReg)
  2109. ELSE
  2110. InitOperand(result,ModeValue);
  2111. Reuse2a(result.op,left.op,right.op,dest);
  2112. Emit(Mul(position,result.op,left.op,right.op));
  2113. END;
  2114. ReleaseOperand(left); ReleaseOperand(right);
  2115. |Scanner.Div:
  2116. EvaluateX(x.left, left);
  2117. EvaluateX(x.right, right);
  2118. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2119. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2120. IF ~isUnchecked THEN
  2121. exit := NewLabel();
  2122. BrltL(exit,zero,right.op);
  2123. EmitTrap(position,NegativeDivisorTrap);
  2124. SetLabel(exit);
  2125. END;
  2126. END;
  2127. InitOperand(result,ModeValue);
  2128. Reuse2a(result.op,left.op,right.op,dest);
  2129. Emit(Div(position,result.op,left.op,right.op));
  2130. ReleaseOperand(left); ReleaseOperand(right);
  2131. |Scanner.Mod:
  2132. EvaluateX(x.left, left);
  2133. EvaluateX(x.right, right);
  2134. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2135. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2136. IF ~isUnchecked THEN
  2137. exit := NewLabel();
  2138. BrltL(exit,zero,right.op);
  2139. EmitTrap(position,NegativeDivisorTrap);
  2140. SetLabel(exit);
  2141. END;
  2142. END;
  2143. InitOperand(result,ModeValue);
  2144. Reuse2a(result.op,left.op,right.op,dest);
  2145. Emit(Mod(position,result.op,left.op,right.op));
  2146. ReleaseOperand(left); ReleaseOperand(right);
  2147. |Scanner.Slash:
  2148. EvaluateX(x.left, left);
  2149. EvaluateX(x.right, right);
  2150. IF leftType IS SyntaxTree.SetType THEN
  2151. InitOperand(result,ModeValue);
  2152. Reuse2a(result.op,left.op,right.op,dest);
  2153. Emit(Xor(position,result.op,left.op,right.op));
  2154. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2155. InitOperand(result,ModeValue);
  2156. componentType := left.op.type;
  2157. (*
  2158. divisor = right.op * right.op + right.tag * right.tag
  2159. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2160. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2161. *)
  2162. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2163. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2164. Emit(Mul(position,tempReg, right.op, right.op));
  2165. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2166. Emit(Add(position,tempReg, tempReg, tempReg2));
  2167. result.op := tempReg2;
  2168. Emit(Mul(position,result.op, left.op, right.op));
  2169. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2170. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2171. Emit(Add(position,result.op, result.op, tempReg2));
  2172. Emit(Div(position,result.op, result.op, tempReg));
  2173. Reuse2(result.tag, left.tag, right.op);
  2174. Emit(Mul(position,result.tag, left.tag, right.op));
  2175. Emit(Mul(position,tempReg2, left.op, right.tag));
  2176. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2177. Emit(Div(position,result.tag, result.tag, tempReg));
  2178. ReleaseIntermediateOperand(tempReg);
  2179. ReleaseIntermediateOperand(tempReg2)
  2180. ELSE
  2181. InitOperand(result,ModeValue);
  2182. Reuse2a(result.op,left.op,right.op,dest);
  2183. Emit(Div(position,result.op,left.op,right.op));
  2184. END;
  2185. ReleaseOperand(left); ReleaseOperand(right);
  2186. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  2187. result := ConditionValue(x);
  2188. |Scanner.In:
  2189. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  2190. EvaluateX(x.left, left);
  2191. EvaluateX(x.right, right);
  2192. Convert(left.op,setType);
  2193. Convert(right.op,setType);
  2194. result.mode := ModeValue;
  2195. result.tag := nil; (* may be left over from calls to evaluate *)
  2196. ReuseCopy(result.op,right.op);
  2197. Emit(Shr(position,result.op,result.op,left.op));
  2198. ReleaseOperand(right); ReleaseOperand(left);
  2199. IntermediateCode.InitImmediate(one,setType,1);
  2200. Emit(And(position,result.op,result.op,one));
  2201. Convert(result.op,bool);
  2202. ELSE
  2203. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  2204. IF x.operator = Scanner.Questionmarks THEN
  2205. leftExpression := x.left;
  2206. rightExpression := x.right;
  2207. ELSE
  2208. leftExpression := x.right;
  2209. rightExpression := x.left;
  2210. END;
  2211. EvaluateX(leftExpression, left);
  2212. Emit(Push(position,left.op));
  2213. ReleaseOperand(left);
  2214. Designate(rightExpression, right);
  2215. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2216. IF ~backend.cellsAreObjects THEN
  2217. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  2218. END;
  2219. Emit(Push(position,right.op));
  2220. ReleaseOperand(right);
  2221. IF backend.cellsAreObjects THEN
  2222. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  2223. ELSE
  2224. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  2225. END;
  2226. InitOperand(result, ModeValue);
  2227. result.op := NewRegisterOperand(bool);
  2228. Emit(Result(position,result.op));
  2229. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  2230. leftExpression := x.left;
  2231. rightExpression := x.right;
  2232. EvaluateX(leftExpression, left);
  2233. Emit(Push(position,left.op));
  2234. ReleaseOperand(left);
  2235. EvaluateX(rightExpression, right);
  2236. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2237. IF ~backend.cellsAreObjects THEN
  2238. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  2239. END;
  2240. Emit(Push(position,right.op));
  2241. ReleaseOperand(right);
  2242. IF backend.cellsAreObjects THEN
  2243. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  2244. ELSE
  2245. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  2246. END;
  2247. InitOperand(result, ModeValue);
  2248. result.op := NewRegisterOperand(bool);
  2249. Emit(Result(position,result.op));
  2250. ELSE
  2251. HALT(100);
  2252. END;
  2253. END;
  2254. destination := dest;
  2255. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  2256. END EvaluateBinaryExpression;
  2257. PROCEDURE EvaluateSet(x: SyntaxTree.Set; VAR result: Operand);
  2258. VAR
  2259. operand: Operand;
  2260. temp, one, noBits, dest: IntermediateCode.Operand;
  2261. expression: SyntaxTree.Expression;
  2262. i: LONGINT;
  2263. BEGIN
  2264. IF Trace THEN TraceEnter("VisitSet") END;
  2265. dest := destination;
  2266. destination := emptyOperand;
  2267. noBits := IntermediateCode.Immediate(setType, 0);
  2268. one := IntermediateCode.Immediate(setType, 1);
  2269. (* start off with the empty set *)
  2270. InitOperand(result, ModeValue);
  2271. IntermediateCode.InitRegister(result.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2272. Emit(Mov(position,result.op, noBits));
  2273. FOR i := 0 TO x.elements.Length() - 1 DO
  2274. expression := x.elements.GetExpression(i);
  2275. IF expression IS SyntaxTree.RangeExpression THEN
  2276. (* range of set elements *)
  2277. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2278. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2279. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2280. ReleaseIntermediateOperand(temp)
  2281. ELSE
  2282. (* singelton element *)
  2283. Evaluate(expression, operand);
  2284. Convert(operand.op, setType);
  2285. CheckSetElement(operand.op);
  2286. (* create subset containing single element *)
  2287. Reuse1(temp, operand.op);
  2288. Emit(Shl(position,temp, one, operand.op));
  2289. ReleaseOperand(operand);
  2290. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2291. ReleaseIntermediateOperand(temp);
  2292. END
  2293. END;
  2294. destination := dest;
  2295. IF Trace THEN TraceExit("VisitSet") END;
  2296. END EvaluateSet;
  2297. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  2298. VAR op: IntermediateCode.Operand; reg: LONGINT;
  2299. BEGIN
  2300. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  2301. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  2302. RETURN op
  2303. END NewRegisterOperand;
  2304. PROCEDURE UnuseRegister(register: LONGINT);
  2305. BEGIN
  2306. IF (register > 0) THEN
  2307. register := registerUsageCount.Map(register);
  2308. registerUsageCount.DecUse(register);
  2309. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2310. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2311. END;
  2312. IF registerUsageCount.Use(register)=0 THEN
  2313. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  2314. Warning(position, "register cannot be removed");
  2315. END;
  2316. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2317. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  2318. END;
  2319. ELSIF registerUsageCount.Use(register)<0 THEN
  2320. Warning(position, "register removed too often");
  2321. IF dump # NIL THEN
  2322. dump.String("register removed too often"); dump.Ln; dump.Update;
  2323. END;
  2324. END;
  2325. END;
  2326. END UnuseRegister;
  2327. PROCEDURE UseRegister(register: LONGINT);
  2328. BEGIN
  2329. IF (register > 0) THEN
  2330. register := registerUsageCount.Map(register);
  2331. registerUsageCount.IncUse(register);
  2332. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2333. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2334. END;
  2335. IF registerUsageCount.Use(register)=1 THEN
  2336. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  2337. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2338. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  2339. END;
  2340. END;
  2341. END;
  2342. END UseRegister;
  2343. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2344. BEGIN
  2345. UnuseRegister(op.register)
  2346. END ReleaseIntermediateOperand;
  2347. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2348. BEGIN
  2349. UseRegister(op.register)
  2350. END UseIntermediateOperand;
  2351. PROCEDURE ReleaseOperand(CONST op: Operand);
  2352. BEGIN
  2353. UnuseRegister(op.op.register);
  2354. UnuseRegister(op.tag.register);
  2355. UnuseRegister(op.extra.register);
  2356. END ReleaseOperand;
  2357. (* save registers marked in array "markedRegisters" to the stack
  2358. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  2359. *)
  2360. PROCEDURE SaveRegisters();
  2361. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  2362. BEGIN
  2363. entry := usedRegisters;
  2364. WHILE entry # NIL DO
  2365. type := registerUsageCount.used[entry.register].type;
  2366. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  2367. Emit(Push(position,op));
  2368. entry := entry.next;
  2369. END;
  2370. END SaveRegisters;
  2371. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  2372. BEGIN
  2373. saved := usedRegisters;
  2374. usedRegisters := NIL;
  2375. END ReleaseUsedRegisters;
  2376. (** remove parameter registers from used queue *)
  2377. PROCEDURE ReleaseParameterRegisters;
  2378. VAR entry,prev,next: RegisterEntry;
  2379. BEGIN
  2380. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  2381. WHILE entry # NIL DO
  2382. next := entry.next;
  2383. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  2384. registerUsageCount.DecUse(entry.register);
  2385. ASSERT(registerUsageCount.Use(entry.register)=0);
  2386. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2387. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  2388. END;
  2389. ELSIF prev = NIL THEN
  2390. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  2391. ELSE
  2392. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  2393. END;
  2394. entry := next;
  2395. END;
  2396. END ReleaseParameterRegisters;
  2397. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  2398. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  2399. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2400. BEGIN
  2401. entry := saved;
  2402. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2403. entry := prev;
  2404. WHILE entry # NIL DO
  2405. prev := entry.prev;
  2406. type := entry.type;
  2407. class := entry.registerClass;
  2408. IntermediateCode.InitRegister(op,type,class,entry.register);
  2409. Emit(Pop(position,op));
  2410. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2411. entry := prev;
  2412. END;
  2413. END RestoreRegisters;
  2414. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2415. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2416. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2417. BEGIN
  2418. entry := saved;
  2419. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2420. entry := prev;
  2421. WHILE entry # NIL DO
  2422. prev := entry.prev;
  2423. type := entry.type;
  2424. class := entry.registerClass;
  2425. IntermediateCode.InitRegister(op,type,class,entry.register);
  2426. Emit(Mov(position,op,op));
  2427. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2428. entry := prev;
  2429. END;
  2430. END RestoreRegisterUse;
  2431. PROCEDURE CheckRegistersFree;
  2432. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2433. BEGIN
  2434. IF usedRegisters # NIL THEN
  2435. r := usedRegisters;
  2436. WHILE r # NIL DO
  2437. warning := "register ";
  2438. Strings.AppendInt(warning, r.register);
  2439. Strings.Append(warning, " not released.");
  2440. Warning(position,warning);
  2441. r := r .next;
  2442. END;
  2443. END;
  2444. FOR i := 0 TO registerUsageCount.count-1 DO
  2445. IF registerUsageCount.used[i].count < 0 THEN
  2446. warning := "register ";
  2447. Strings.AppendInt(warning, i);
  2448. Strings.Append(warning, " unused too often.");
  2449. Warning(position,warning);
  2450. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2451. warning := "register ";
  2452. Strings.AppendInt(warning, i);
  2453. Strings.Append(warning, " not unused often enough.");
  2454. Warning(position,warning);
  2455. END;
  2456. END;
  2457. END CheckRegistersFree;
  2458. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2459. Otherwise allocate a new register.
  2460. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2461. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2462. BEGIN
  2463. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2464. UseIntermediateOperand(result);
  2465. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2466. UseIntermediateOperand(result);
  2467. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2468. END;
  2469. END Reuse2;
  2470. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2471. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2472. If not then allocate a new register.
  2473. Does NOT necessarily keep the content of src1 or src2 in result!
  2474. *)
  2475. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2476. BEGIN
  2477. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2478. UseIntermediateOperand(result);
  2479. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2480. UseIntermediateOperand(result);
  2481. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2482. result := alternative; alternative := emptyOperand;
  2483. UseIntermediateOperand(result);
  2484. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2485. END;
  2486. END Reuse2a;
  2487. (* like reuse2 but only one source *)
  2488. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2489. BEGIN
  2490. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2491. UseIntermediateOperand(result);
  2492. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2493. END;
  2494. END Reuse1;
  2495. (* like reuse2a but only one source *)
  2496. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2497. BEGIN
  2498. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2499. UseIntermediateOperand(result);
  2500. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2501. UseIntermediateOperand(result);
  2502. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2503. END;
  2504. END Reuse1a;
  2505. (* like reuse1 but guarantees that content of src1 is in result *)
  2506. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2507. BEGIN
  2508. IF ReusableRegister(src1) THEN
  2509. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2510. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2511. UseIntermediateOperand(result);
  2512. ELSE
  2513. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2514. Emit(Mov(position,result,src1));
  2515. END
  2516. END ReuseCopy;
  2517. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2518. BEGIN
  2519. IF ReusableRegister(src) THEN
  2520. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2521. ELSE
  2522. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2523. Emit(Mov(position,result,src));
  2524. ReleaseIntermediateOperand(src);
  2525. END
  2526. END TransferToRegister;
  2527. (** labels and branches **)
  2528. PROCEDURE NewLabel(): Label;
  2529. VAR label: Label;
  2530. BEGIN
  2531. NEW(label,section); RETURN label;
  2532. END NewLabel;
  2533. (* EXPERIMENTAL *)
  2534. PROCEDURE EndBasicBlock;
  2535. VAR i: LONGINT;
  2536. BEGIN
  2537. i := 0;
  2538. WHILE (availableSymbols[i].symbol # NIL) DO
  2539. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2540. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2541. END;
  2542. availableSymbols[i].symbol := NIL;
  2543. INC(i);
  2544. END;
  2545. END EndBasicBlock;
  2546. (* EXPERIMENTAL *)
  2547. PROCEDURE BeginBasicBlock;
  2548. BEGIN
  2549. ASSERT(availableSymbols[0].symbol = NIL);
  2550. END BeginBasicBlock;
  2551. PROCEDURE SetLabel(label: Label);
  2552. BEGIN
  2553. (* EXPERIMENTAL *)
  2554. EndBasicBlock;
  2555. BeginBasicBlock;
  2556. label.Resolve(section.pc);
  2557. END SetLabel;
  2558. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2559. BEGIN
  2560. ASSERT(label # NIL);
  2561. IF label.pc < 0 THEN (* label not yet set *)
  2562. label.AddFixup(section.pc);
  2563. END;
  2564. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2565. END LabelOperand;
  2566. PROCEDURE BrL(label: Label);
  2567. BEGIN
  2568. (* EXPERIMENTAL *)
  2569. EndBasicBlock;
  2570. Emit(Br(position,LabelOperand(label)));
  2571. END BrL;
  2572. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2573. BEGIN
  2574. Emit(Brge(position,LabelOperand(label),left,right));
  2575. END BrgeL;
  2576. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2577. BEGIN
  2578. Emit(Brlt(position,LabelOperand(label),left,right));
  2579. END BrltL;
  2580. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2581. BEGIN
  2582. Emit(Breq(position,LabelOperand(label),left,right));
  2583. END BreqL;
  2584. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2585. BEGIN
  2586. Emit(Brne(position,LabelOperand(label),left,right));
  2587. END BrneL;
  2588. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2589. VAR new: IntermediateCode.Operand;
  2590. BEGIN
  2591. IF Trace THEN TraceEnter("Convert") END;
  2592. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2593. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2594. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2595. & (operand.offset = 0)
  2596. THEN
  2597. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2598. Emit(Conv(position,new,operand));
  2599. ELSE
  2600. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2601. Emit(Conv(position,new,operand));
  2602. ReleaseIntermediateOperand(operand);
  2603. END;
  2604. operand := new;
  2605. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  2606. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2607. ELSE
  2608. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2609. Emit(Conv(position,new,operand));
  2610. ReleaseIntermediateOperand(operand);
  2611. operand := new;
  2612. END;
  2613. IF Trace THEN TraceExit("Convert") END;
  2614. END Convert;
  2615. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2616. VAR exit: Label;
  2617. BEGIN
  2618. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2619. exit := NewLabel();
  2620. br(exit,left,right);
  2621. EmitTrap(position,trapNo);
  2622. SetLabel(exit);
  2623. END TrapC;
  2624. (** expressions *)
  2625. (** emit necessary runtime check for set elements **)
  2626. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2627. VAR max: IntermediateCode.Operand;
  2628. BEGIN
  2629. IF isUnchecked THEN RETURN END;
  2630. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2631. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2632. TrapC(BrgeL, max, o, SetElementTrap);
  2633. END;
  2634. END CheckSetElement;
  2635. (** the set that a range represents **)
  2636. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2637. VAR
  2638. operand: Operand;
  2639. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2640. BEGIN
  2641. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2642. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2643. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2644. one := IntermediateCode.Immediate(setType, 1);
  2645. Evaluate(x, operand);
  2646. Convert(operand.op, setType);
  2647. Convert(operand.tag, setType);
  2648. CheckSetElement(operand.op);
  2649. CheckSetElement(operand.tag);
  2650. (* create mask for lower bound
  2651. i.e. shift 11111111 to the left by the value of the lower bound
  2652. *)
  2653. Reuse1(temp, operand.op);
  2654. Emit(Shl(position,temp, allBits, operand.op));
  2655. ReleaseIntermediateOperand(operand.op);
  2656. operand.op := temp;
  2657. (* create mask for upper bound
  2658. i.e. shift 11111111 to the right by the difference between the
  2659. upper bound and the maximum number of set elements
  2660. *)
  2661. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2662. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2663. Reuse1(temp, operand.tag);
  2664. ELSE
  2665. Reuse1(temp, operand.tag);
  2666. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2667. Emit(Sub(position,temp, size, operand.tag));
  2668. END;
  2669. Emit(Shr(position,temp, allBits, operand.tag));
  2670. ReleaseIntermediateOperand(operand.tag);
  2671. operand.tag := temp;
  2672. Reuse2(resultingSet, operand.op, operand.tag);
  2673. (* intersect the two masks *)
  2674. Emit(And(position,resultingSet, operand.op, operand.tag));
  2675. ReleaseOperand(operand);
  2676. RETURN resultingSet
  2677. END SetFromRange;
  2678. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2679. VAR
  2680. res, operand: Operand;
  2681. temp, one, noBits, dest: IntermediateCode.Operand;
  2682. expression: SyntaxTree.Expression;
  2683. i: LONGINT;
  2684. BEGIN
  2685. IF Trace THEN TraceEnter("VisitSet") END;
  2686. dest := destination;
  2687. destination := emptyOperand;
  2688. noBits := IntermediateCode.Immediate(setType, 0);
  2689. one := IntermediateCode.Immediate(setType, 1);
  2690. (* start off with the empty set *)
  2691. InitOperand(res, ModeValue);
  2692. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2693. Emit(Mov(position,res.op, noBits));
  2694. FOR i := 0 TO x.elements.Length() - 1 DO
  2695. expression := x.elements.GetExpression(i);
  2696. IF expression IS SyntaxTree.RangeExpression THEN
  2697. (* range of set elements *)
  2698. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2699. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2700. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2701. ReleaseIntermediateOperand(temp)
  2702. ELSE
  2703. (* singelton element *)
  2704. Evaluate(expression, operand);
  2705. Convert(operand.op, setType);
  2706. CheckSetElement(operand.op);
  2707. (* create subset containing single element *)
  2708. Reuse1(temp, operand.op);
  2709. Emit(Shl(position,temp, one, operand.op));
  2710. ReleaseOperand(operand);
  2711. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2712. ReleaseIntermediateOperand(temp);
  2713. END
  2714. END;
  2715. result := res;
  2716. destination := dest;
  2717. IF Trace THEN TraceExit("VisitSet") END;
  2718. END VisitSet;
  2719. (* math arrays of the form [a,b,c]
  2720. x is a static array and thus does not provide any pointers
  2721. *)
  2722. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2723. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2724. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2725. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2726. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2727. element: SyntaxTree.IntegerValue;
  2728. BEGIN
  2729. numberElements := x.elements.Length();
  2730. expression := index.parameters.GetExpression(dim);
  2731. element := expression(SyntaxTree.IntegerValue);
  2732. FOR i := 0 TO numberElements-1 DO
  2733. expression := x.elements.GetExpression(i);
  2734. element.SetValue(i);
  2735. IF expression IS SyntaxTree.MathArrayExpression THEN
  2736. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2737. ELSE
  2738. Assign(index,expression);
  2739. END;
  2740. END;
  2741. END RecursiveAssignment;
  2742. PROCEDURE Dimension(): LONGINT;
  2743. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2744. BEGIN
  2745. dim := 0;
  2746. expression := x;
  2747. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2748. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2749. INC(dim);
  2750. END;
  2751. RETURN dim;
  2752. END Dimension;
  2753. BEGIN
  2754. (*static math array not providing pointers anyway *)
  2755. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2756. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2757. designator.SetType(variable.type);
  2758. dim := Dimension();
  2759. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2760. FOR i := 0 TO dim-1 DO
  2761. element := SyntaxTree.NewIntegerValue(x.position,0);
  2762. element.SetType(system.longintType);
  2763. index.parameters.AddExpression(element);
  2764. END;
  2765. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2766. RecursiveAssignment(x,0);
  2767. Expression(designator);
  2768. END VisitMathArrayExpression;
  2769. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2770. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2771. BEGIN
  2772. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2773. dest := destination; destination := emptyOperand;
  2774. IF x.operator = Scanner.Not THEN
  2775. Evaluate(x.left,operand);
  2776. InitOperand(result,ModeValue);
  2777. Reuse1a(result.op,operand.op,dest);
  2778. Emit(Xor(position,result.op,operand.op,true));
  2779. ReleaseOperand(operand);
  2780. ELSIF x.operator = Scanner.Minus THEN
  2781. Evaluate(x.left,operand);
  2782. InitOperand(result,ModeValue);
  2783. Reuse1a(result.op,operand.op,dest);
  2784. type := x.left.type.resolved;
  2785. IF type IS SyntaxTree.SetType THEN
  2786. Emit(Not(position,result.op,operand.op));
  2787. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2788. Reuse1(result.tag,operand.tag);
  2789. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2790. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2791. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2792. Emit(Neg(position,result.op,operand.op));
  2793. ELSE HALT(200)
  2794. END;
  2795. ReleaseOperand(operand);
  2796. ELSIF x.operator = Scanner.Address THEN
  2797. Designate(x.left,operand);
  2798. operand.mode := ModeValue;
  2799. t0 := x.left.type.resolved;
  2800. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2801. ReleaseIntermediateOperand(operand.op);
  2802. operand.op := operand.tag;
  2803. IntermediateCode.InitOperand(operand.tag);
  2804. END;
  2805. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2806. result := operand;
  2807. ELSE HALT(100)
  2808. END;
  2809. destination := dest;
  2810. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2811. END VisitUnaryExpression;
  2812. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2813. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2814. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2815. BEGIN
  2816. type := type.resolved;
  2817. originalType := type;
  2818. IF type IS SyntaxTree.PointerType THEN
  2819. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2820. END;
  2821. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2822. BrL(label);
  2823. ELSE
  2824. ASSERT(type IS SyntaxTree.RecordType);
  2825. (*
  2826. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2827. *)
  2828. IF withPart THEN
  2829. left := tag;
  2830. ELSE
  2831. ReuseCopy(left,tag);
  2832. END;
  2833. right := TypeDescriptorAdr(type);
  2834. IF backend.cooperative THEN
  2835. repeatL := NewLabel();
  2836. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2837. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2838. END;
  2839. SetLabel(repeatL);
  2840. IF reason THEN
  2841. BreqL(label,left,right);
  2842. ELSE
  2843. skip := NewLabel();
  2844. BreqL(skip,left,right);
  2845. END;
  2846. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2847. BrneL(repeatL,left,nil);
  2848. IF ~reason THEN
  2849. BrL(label);
  2850. SetLabel(skip);
  2851. END;
  2852. ELSIF meta.simple THEN
  2853. level := type(SyntaxTree.RecordType).Level();
  2854. (* get type desc tag of level relative to base tag *)
  2855. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2856. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2857. IntermediateCode.MakeMemory(left,addressType);
  2858. IF reason THEN
  2859. BreqL(label,left,right);
  2860. ELSE
  2861. BrneL(label,left,right);
  2862. END;
  2863. ELSE
  2864. level := type(SyntaxTree.RecordType).Level();
  2865. (* get type desc tag of level relative to base tag *)
  2866. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2867. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2868. IntermediateCode.MakeMemory(left,addressType);
  2869. IF reason THEN
  2870. BreqL(label,left,right);
  2871. ELSE
  2872. BrneL(label,left,right);
  2873. END;
  2874. END;
  2875. IF ~withPart THEN
  2876. ReleaseIntermediateOperand(left);
  2877. END;
  2878. ReleaseIntermediateOperand(right);
  2879. END;
  2880. END TypeTest;
  2881. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2882. BEGIN
  2883. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2884. IF dump # NIL THEN
  2885. dump.String(s); dump.Ln;
  2886. END;
  2887. END Error;
  2888. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2889. BEGIN
  2890. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2891. IF dump # NIL THEN
  2892. dump.String(s); dump.Ln; dump.Update;
  2893. END;
  2894. END Warning;
  2895. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2896. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; 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. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  2993. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2994. section.SetExported (TRUE);
  2995. IF dump # NIL THEN dump := section.comments END;
  2996. IF backend.hasLinkRegister THEN
  2997. Emit(Push(Basic.invalidPosition, lr));
  2998. END;
  2999. variable := recordType.recordScope.firstVariable;
  3000. WHILE variable # NIL DO
  3001. IF variable.NeedsTrace() THEN
  3002. dst := NewRegisterOperand (addressType);
  3003. src := NewRegisterOperand (addressType);
  3004. Emit (Mov(position, dst, parameter1));
  3005. Emit (Mov(position, src, parameter2));
  3006. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3007. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  3008. CallAssignMethod(dst, src, variable.type);
  3009. ReleaseIntermediateOperand(src);
  3010. ReleaseIntermediateOperand(dst);
  3011. END;
  3012. variable := variable.nextVariable;
  3013. END;
  3014. recordBase := recordType.GetBaseRecord();
  3015. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3016. IF backend.hasLinkRegister THEN
  3017. Emit(Pop(Basic.invalidPosition, lr));
  3018. END;
  3019. GetRecordTypeName (recordBase,name);
  3020. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3021. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3022. Emit(Br(position,op));
  3023. ELSE
  3024. Emit(Exit(position,0,0, 0));
  3025. END;
  3026. INC(statCoopAssignProcedure, section.pc);
  3027. ReturnToContext(context);
  3028. IF ~recordType.isObject THEN
  3029. GetRecordTypeName (recordType,name);
  3030. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3031. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3032. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3033. section.SetExported (TRUE);
  3034. dst := NewRegisterOperand (addressType);
  3035. src := NewRegisterOperand (addressType);
  3036. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3037. Emit(Mov(position, dst, parameter1));
  3038. Emit(Mov(position, src, parameter2));
  3039. label := NewLabel();
  3040. SetLabel(label);
  3041. Emit(Push(position, dst));
  3042. Emit(Push(position, src));
  3043. GetRecordTypeName (recordType,name);
  3044. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3045. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3046. Emit(Call(position, op, 0));
  3047. Emit(Pop(position, src));
  3048. Emit(Pop(position, dst));
  3049. Emit(Add(position, dst, dst, ofs));
  3050. Emit(Add(position, src, src, ofs));
  3051. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3052. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3053. Emit(Exit(position,0,0, 0));
  3054. ReturnToContext(context);
  3055. END;
  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. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  3115. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3116. section.SetExported (TRUE);
  3117. IF dump # NIL THEN dump := section.comments END;
  3118. IF backend.hasLinkRegister THEN
  3119. Emit(Push(Basic.invalidPosition, lr));
  3120. END;
  3121. variable := recordType.recordScope.firstVariable;
  3122. WHILE variable # NIL DO
  3123. IF variable.NeedsTrace() THEN
  3124. register := NewRegisterOperand (addressType);
  3125. Emit (Mov(position,register,parameter1));
  3126. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  3127. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3128. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3129. END;
  3130. CallTraceMethod(register, variable.type);
  3131. ReleaseIntermediateOperand(register);
  3132. END;
  3133. variable := variable.nextVariable;
  3134. END;
  3135. recordBase := recordType.GetBaseRecord();
  3136. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  3137. recordBase := recordBase.GetBaseRecord();
  3138. END;
  3139. IF recordBase # NIL THEN
  3140. IF backend.hasLinkRegister THEN
  3141. Emit(Pop(Basic.invalidPosition, lr));
  3142. END;
  3143. GetRecordTypeName (recordBase,name);
  3144. IF HasExplicitTraceMethod (recordBase) THEN
  3145. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  3146. ELSE
  3147. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3148. END;
  3149. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3150. Emit(Br(position,op));
  3151. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  3152. Emit(Exit(position,0,0,0));
  3153. ELSE
  3154. IF backend.hasLinkRegister THEN
  3155. Emit(Pop(Basic.invalidPosition, lr));
  3156. END;
  3157. IF recordType.isObject THEN
  3158. Basic.ToSegmentedName ("BaseTypes.Object",name);
  3159. ELSE
  3160. Basic.ToSegmentedName ("BaseTypes.Record",name);
  3161. END;
  3162. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3163. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3164. Emit(Br(position,op));
  3165. END;
  3166. INC(statCoopTraceMethod, section.pc);
  3167. ReturnToContext(context);
  3168. IF ~recordType.isObject THEN
  3169. GetRecordTypeName (recordType,name);
  3170. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  3171. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3172. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3173. section.SetExported (TRUE);
  3174. IF dump # NIL THEN dump := section.comments END;
  3175. register := NewRegisterOperand (addressType);
  3176. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  3177. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  3178. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3179. END;
  3180. Emit (Push(position,register));
  3181. GetRecordTypeName (recordType,name);
  3182. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3183. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3184. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3185. ReleaseIntermediateOperand(register);
  3186. Emit(Exit(position,0,0,0));
  3187. ReturnToContext(context);
  3188. GetRecordTypeName (recordType,name);
  3189. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3190. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3191. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3192. section.SetExported (TRUE);
  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. ReturnToContext(context);
  3209. END;
  3210. IF dump # NIL THEN dump := section.comments END;
  3211. END CreateTraceMethod;
  3212. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  3213. VAR name: Basic.SegmentedName;
  3214. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3215. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  3216. context: Context;
  3217. BEGIN
  3218. IF recordType.isObject THEN RETURN END;
  3219. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3220. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3221. GetRecordTypeName (recordType,name);
  3222. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3223. IF module.allSections.FindByName(name) # NIL THEN RETURN END;
  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. INC(statCoopResetProcedure, section.pc);
  3257. ReturnToContext(context);
  3258. GetRecordTypeName (recordType,name);
  3259. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3260. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3261. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3262. section.SetExported (TRUE);
  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. ReturnToContext(context);
  3279. IF dump # NIL THEN dump := section.comments END;
  3280. END CreateResetProcedure;
  3281. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  3282. VAR name: Basic.SegmentedName; context: Context;
  3283. BEGIN
  3284. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  3285. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3286. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3287. IF dump # NIL THEN dump := section.comments END;
  3288. IF backend.hasLinkRegister THEN
  3289. Emit(Push(Basic.invalidPosition, lr));
  3290. END;
  3291. Emit(Push(position,fp));
  3292. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  3293. ResetVariables(scope);
  3294. Emit(Pop(position,fp));
  3295. Emit(Exit(position,0,0, 0));
  3296. ReturnToContext(context);
  3297. IF dump # NIL THEN dump := section.comments END;
  3298. END CreateResetMethod;
  3299. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  3300. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  3301. BEGIN
  3302. IF SemanticChecker.IsPointerType (type) THEN
  3303. Emit (Push(position, dest));
  3304. CallThis(position,"GarbageCollector","Reset", 1);
  3305. ELSIF type.IsRecordType() THEN
  3306. Emit (Push(position, dest));
  3307. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3308. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3309. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3310. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3311. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  3312. size := GetArrayLength(type, tag);
  3313. base := ArrayBaseType(type);
  3314. IF base.IsRecordType() THEN
  3315. Emit (Push(position, size));
  3316. Emit (Push(position, dest));
  3317. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  3318. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3319. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3320. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3321. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  3322. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3323. Emit (Push(position, size));
  3324. Emit (Push(position, dest));
  3325. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  3326. ELSE
  3327. Emit (Push(position, size));
  3328. Emit (Push(position, dest));
  3329. CallThis(position,"GarbageCollector","ResetArray", 2);
  3330. ASSERT(ArrayBaseType(type).IsPointer());
  3331. END;
  3332. ReleaseIntermediateOperand(size);
  3333. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3334. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  3335. Emit (Push(position, dest));
  3336. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  3337. ELSE HALT(100); (* missing ? *)
  3338. END;
  3339. END CallResetProcedure;
  3340. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  3341. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  3342. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  3343. VAR operand: Operand;
  3344. BEGIN
  3345. Symbol (symbol, operand);
  3346. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  3347. ReleaseOperand(operand);
  3348. END Reset;
  3349. BEGIN
  3350. previousScope := currentScope;
  3351. currentScope := scope;
  3352. pc := section.pc;
  3353. prevOffset := MAX(SIZE);
  3354. variable := scope.firstVariable;
  3355. WHILE variable # NIL DO
  3356. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3357. Reset (variable);
  3358. prevOffset := variable.offsetInBits;
  3359. END;
  3360. variable := variable.nextVariable;
  3361. END;
  3362. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3363. WHILE parameter # NIL DO
  3364. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  3365. Reset (parameter);
  3366. END;
  3367. parameter := parameter.nextParameter;
  3368. END;
  3369. INC(statCoopResetVariables, section.pc - pc);
  3370. currentScope := previousScope;
  3371. END ResetVariables;
  3372. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  3373. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  3374. BEGIN
  3375. type := symbol.type.resolved;
  3376. SaveRegisters();ReleaseUsedRegisters(saved);
  3377. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  3378. Symbol(symbol, operand);
  3379. ToMemory(operand.op,addressType,0);
  3380. Emit(Push(position,operand.op));
  3381. IF refer THEN
  3382. CallThis(position,"Heaps","Refer",1);
  3383. ELSE
  3384. CallThis(position,"Heaps","Reset",1);
  3385. END;
  3386. ELSIF type.IsRecordType() THEN
  3387. Symbol(symbol, operand);
  3388. Emit(Push(position,operand.op));
  3389. Emit(Push(position,operand.tag)); (* type desc *)
  3390. IF refer THEN
  3391. CallThis(position,"Heaps","ReferRecord",2);
  3392. ELSE
  3393. CallThis(position,"Heaps","ResetRecord",2);
  3394. END;
  3395. ELSIF IsStaticArray(type) THEN
  3396. size := StaticArrayNumElements(type);
  3397. base := StaticArrayBaseType(type);
  3398. Symbol(symbol, operand);
  3399. arg := TypeDescriptorAdr(base);
  3400. Emit(Push(position,operand.op));
  3401. Emit(Push(position,arg));
  3402. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3403. ReleaseIntermediateOperand(arg);
  3404. IF refer THEN
  3405. CallThis(position,"Heaps","ReferArray",3);
  3406. ELSE
  3407. CallThis(position,"Heaps","ResetArray",3);
  3408. END;
  3409. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  3410. size := StaticMathArrayNumElements(type);
  3411. base := StaticMathArrayBaseType(type);
  3412. Symbol(symbol, operand);
  3413. arg := TypeDescriptorAdr(base);
  3414. Emit(Push(position,operand.op));
  3415. Emit(Push(position,arg));
  3416. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3417. ReleaseIntermediateOperand(arg);
  3418. IF refer THEN
  3419. CallThis(position,"Heaps","ReferArray",3);
  3420. ELSE
  3421. CallThis(position,"Heaps","ResetArray",3);
  3422. END;
  3423. ELSIF type IS SyntaxTree.MathArrayType THEN
  3424. Symbol(symbol, operand);
  3425. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3426. Emit (Push(position, operand.op));
  3427. ELSE
  3428. Emit (Push(position, operand.tag));
  3429. END;
  3430. IF refer THEN
  3431. CallThis(position,"Heaps","ReferMathArray", 1);
  3432. ELSE
  3433. CallThis(position,"Heaps","ResetMathArray", 1);
  3434. END;
  3435. ELSIF type IS SyntaxTree.ProcedureType THEN
  3436. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  3437. Symbol(symbol, operand);
  3438. Emit (Push(position, operand.tag));
  3439. IF refer THEN
  3440. CallThis(position,"Heaps","Refer", 1);
  3441. ELSE
  3442. CallThis(position,"Heaps","Reset", 1);
  3443. END;
  3444. ELSE HALT(100); (* missing ? *)
  3445. END;
  3446. ReleaseOperand(operand);
  3447. RestoreRegisters(saved);
  3448. END Reset;
  3449. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  3450. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  3451. BEGIN
  3452. previousScope := currentScope;
  3453. currentScope := scope;
  3454. pc := section.pc;
  3455. IF ~ refer THEN
  3456. variable := scope.firstVariable;
  3457. prevOffset := MAX(SIZE);
  3458. WHILE variable # NIL DO
  3459. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3460. Reset (variable,refer);
  3461. prevOffset := variable.offsetInBits;
  3462. END;
  3463. variable := variable.nextVariable;
  3464. END;
  3465. END;
  3466. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3467. WHILE parameter # NIL DO
  3468. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  3469. Reset (parameter,refer);
  3470. END;
  3471. parameter := parameter.nextParameter;
  3472. END;
  3473. INC(statCoopResetVariables, section.pc - pc);
  3474. currentScope := previousScope;
  3475. END ResetVariables2;
  3476. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  3477. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  3478. VAR op: IntermediateCode.Operand; context: Context;
  3479. BEGIN
  3480. previousSection := section;
  3481. GetCodeSectionNameForSymbol(procedure, name);
  3482. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3483. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3484. IF dump # NIL THEN dump := section.comments END;
  3485. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3486. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3487. Emit(Data(position,op));
  3488. Emit(Data(position,nil));
  3489. IF HasPointers (procedure.procedureScope) THEN
  3490. GetCodeSectionNameForSymbol(procedure, name);
  3491. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3492. ELSE
  3493. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3494. END;
  3495. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3496. Emit(Data(position,op));
  3497. ReturnToContext(context);
  3498. IF dump # NIL THEN dump := section.comments END;
  3499. END CreateProcedureDescriptor;
  3500. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3501. VAR import: SyntaxTree.Import;
  3502. s: Basic.MessageString;
  3503. selfName: SyntaxTree.IdentifierString;
  3504. BEGIN
  3505. moduleScope.ownerModule.GetName(selfName);
  3506. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3507. module := moduleScope.ownerModule
  3508. ELSE
  3509. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3510. IF import = NIL THEN
  3511. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3512. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3513. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3514. s := "Module ";
  3515. Strings.Append(s,moduleName);
  3516. Strings.Append(s," cannot be imported.");
  3517. IF force THEN
  3518. Error(position,s);
  3519. ELSIF canBeLoaded THEN
  3520. IF WarningDynamicLoading THEN
  3521. Strings.Append(s, "=> no dynamic linking.");
  3522. Warning(position, s);
  3523. END;
  3524. canBeLoaded := FALSE;
  3525. END;
  3526. RETURN FALSE
  3527. ELSE
  3528. SELF.module.imports.AddName(moduleName)
  3529. END;
  3530. ELSIF import.module = NIL THEN (* already tried *)
  3531. RETURN FALSE
  3532. END;
  3533. module := import.module;
  3534. END;
  3535. RETURN TRUE
  3536. END AddImport;
  3537. (* needed for old binary object file format*)
  3538. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3539. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: Basic.Fingerprint;
  3540. BEGIN
  3541. IF AddImport(moduleName,module,TRUE) THEN
  3542. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3543. IF procedure = NIL THEN
  3544. s := "Instruction not supported on target, emulation procedure ";
  3545. Strings.Append(s,moduleName);
  3546. Strings.Append(s,".");
  3547. Strings.Append(s,procedureName);
  3548. Strings.Append(s," not present");
  3549. Error(position,s);
  3550. ELSE
  3551. StaticCallOperand(r,procedure);
  3552. ReleaseOperand(r);
  3553. fp := GetFingerprint(procedure);
  3554. END;
  3555. END;
  3556. END EnsureSymbol;
  3557. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3558. VAR trueL, exitL: Label; op: Operand;
  3559. BEGIN
  3560. InitOperand(op,ModeValue);
  3561. trueL := NewLabel();
  3562. exitL := NewLabel();
  3563. Condition(x,trueL,TRUE);
  3564. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3565. Emit(Mov(position,op.op,false));
  3566. BrL(exitL);
  3567. SetLabel(trueL);
  3568. Emit(MovReplace(position,op.op,true));
  3569. SetLabel(exitL);
  3570. RETURN op;
  3571. END ConditionValue;
  3572. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3573. VAR size: LONGINT;
  3574. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3575. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3576. BEGIN
  3577. ASSERT(type.form = SyntaxTree.Open);
  3578. baseType := type.arrayBase.resolved;
  3579. IF IsOpenArray(baseType) THEN
  3580. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3581. ELSE
  3582. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3583. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3584. END;
  3585. len := tag;
  3586. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3587. IntermediateCode.MakeMemory(len,addressType);
  3588. UseIntermediateOperand(len);
  3589. Reuse2(res,sizeOperand,len);
  3590. Emit(Mul(position,res,sizeOperand,len));
  3591. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3592. RETURN res
  3593. END GetArraySize;
  3594. BEGIN
  3595. type := type.resolved;
  3596. IF IsOpenArray(type) THEN
  3597. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3598. RETURN tag
  3599. ELSE
  3600. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3601. END;
  3602. ELSE
  3603. size := ToMemoryUnits(system,system.SizeOf(type));
  3604. RETURN IntermediateCode.Immediate(addressType,size)
  3605. END;
  3606. END GetDynamicSize;
  3607. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3608. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3609. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3610. BEGIN
  3611. ASSERT(type.form = SyntaxTree.Open);
  3612. baseType := type.arrayBase.resolved;
  3613. IF IsOpenArray(baseType) THEN
  3614. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3615. ELSE
  3616. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3617. END;
  3618. len := tag;
  3619. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3620. IntermediateCode.MakeMemory(len,addressType);
  3621. UseIntermediateOperand(len);
  3622. Reuse2(res,sizeOperand,len);
  3623. Emit(Mul(position,res,sizeOperand,len));
  3624. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3625. RETURN res
  3626. END GetLength;
  3627. BEGIN
  3628. type := type.resolved;
  3629. IF IsOpenArray(type) THEN
  3630. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3631. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3632. ELSIF type IS SyntaxTree.StringType THEN
  3633. RETURN tag;
  3634. ELSE
  3635. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3636. END;
  3637. END GetArrayLength;
  3638. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3639. VAR result: IntermediateCode.Operand;
  3640. BEGIN
  3641. IF backend.cooperative THEN
  3642. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3643. ELSE
  3644. MakeMemory(result, tag, addressType, 0);
  3645. END;
  3646. RETURN result
  3647. END GetSizeFromTag;
  3648. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3649. VAR parameter: SyntaxTree.Parameter;
  3650. BEGIN
  3651. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3652. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3653. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3654. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3655. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3656. END;
  3657. RETURN GetDynamicSize(e.type, tag);
  3658. END GetArrayOfBytesSize;
  3659. (*
  3660. to find imported symbol. not needed ?
  3661. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3662. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3663. BEGIN
  3664. IF AddImport(moduleName,importedModule,FALSE) THEN
  3665. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3666. RETURN symbol
  3667. ELSE
  3668. RETURN NIL
  3669. END
  3670. END SymbolByName;
  3671. *)
  3672. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3673. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3674. BEGIN
  3675. IF AddImport(moduleName,runtimeModule,force) THEN
  3676. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3677. IF procedure = NIL THEN
  3678. s := "Procedure ";
  3679. Strings.Append(s,moduleName);
  3680. Strings.Append(s,".");
  3681. Strings.Append(s,procedureName);
  3682. Strings.Append(s," not present");
  3683. Error(position,s);
  3684. RETURN FALSE
  3685. ELSE
  3686. RETURN TRUE
  3687. END;
  3688. ELSE RETURN FALSE
  3689. END;
  3690. END GetRuntimeProcedure;
  3691. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3692. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3693. s: Basic.MessageString;
  3694. BEGIN
  3695. Basic.InitSegmentedName(name);
  3696. name[0] := Basic.MakeString(moduleName);
  3697. name[1] := Basic.MakeString(typeName);
  3698. name[2] := -1;
  3699. IF AddImport(moduleName,importedModule, FALSE) THEN
  3700. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3701. IF symbol = NIL THEN
  3702. s := "type ";
  3703. Strings.Append(s,moduleName);
  3704. Strings.Append(s,".");
  3705. Strings.Append(s,typeName);
  3706. Strings.Append(s," not present");
  3707. Error(position,s);
  3708. END;
  3709. ELSE symbol := NIL;
  3710. END;
  3711. IF importedModule = moduleScope.ownerModule THEN
  3712. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3713. ELSE
  3714. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3715. END;
  3716. RETURN symbol
  3717. END GetTypeDescriptor;
  3718. (* 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. *)
  3719. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3720. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3721. pooledName: Basic.SegmentedName; size: LONGINT;
  3722. BEGIN
  3723. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3724. StaticCallOperand(result,procedure);
  3725. IF numberParameters < 0 THEN
  3726. size := ProcParametersSize(procedure);
  3727. ELSE
  3728. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3729. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3730. Error(position,"runtime call parameter count mismatch");
  3731. END;
  3732. END;
  3733. Emit(Call(position, result.op, size));
  3734. ReleaseOperand(result);
  3735. ELSE (* only static linking possible *)
  3736. ASSERT(numberParameters >= 0);
  3737. Basic.InitSegmentedName(pooledName);
  3738. pooledName[0] := Basic.MakeString(moduleName);
  3739. pooledName[1] := Basic.MakeString(procedureName);
  3740. pooledName[2] := -1;
  3741. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3742. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3743. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3744. END;
  3745. END CallThisChecked;
  3746. (* 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. *)
  3747. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3748. BEGIN
  3749. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3750. END CallThis;
  3751. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3752. VAR
  3753. left,right: Operand;
  3754. leftSize, rightSize: IntermediateCode.Operand;
  3755. saved: RegisterEntry;
  3756. reg: IntermediateCode.Operand;
  3757. procedureName: SyntaxTree.IdentifierString;
  3758. BEGIN
  3759. procedureName := "CompareString";
  3760. SaveRegisters();ReleaseUsedRegisters(saved);
  3761. Designate(leftExpression,left);
  3762. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3763. Emit(Push(position,leftSize));
  3764. ReleaseIntermediateOperand(leftSize);
  3765. Emit(Push(position,left.op));
  3766. ReleaseOperand(left);
  3767. Designate(rightExpression,right);
  3768. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3769. Emit(Push(position,rightSize));
  3770. ReleaseIntermediateOperand(rightSize);
  3771. Emit(Push(position,right.op));
  3772. ReleaseOperand(right);
  3773. CallThis(position,builtinsModuleName,procedureName, 4);
  3774. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3775. Emit(Result(position,reg));
  3776. RestoreRegisters(saved);
  3777. br(label,reg,IntermediateCode.Immediate(int8,0));
  3778. ReleaseIntermediateOperand(reg);
  3779. END CompareString;
  3780. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3781. VAR
  3782. left,right: Operand;
  3783. leftSize, rightSize: IntermediateCode.Operand;
  3784. saved: RegisterEntry;
  3785. procedureName: SyntaxTree.IdentifierString;
  3786. BEGIN
  3787. procedureName := "CopyString";
  3788. SaveRegisters();ReleaseUsedRegisters(saved);
  3789. Designate(leftExpression,left);
  3790. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3791. Emit(Push(position,leftSize));
  3792. ReleaseIntermediateOperand(leftSize);
  3793. Emit(Push(position,left.op));
  3794. ReleaseOperand(left);
  3795. Designate(rightExpression,right);
  3796. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3797. Emit(Push(position,rightSize));
  3798. ReleaseIntermediateOperand(rightSize);
  3799. Emit(Push(position,right.op));
  3800. ReleaseOperand(right);
  3801. CallThis(position,builtinsModuleName,procedureName,4);
  3802. RestoreRegisters(saved);
  3803. END CopyString;
  3804. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3805. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3806. leftType,rightType: SyntaxTree.Type;
  3807. leftExpression,rightExpression : SyntaxTree.Expression;
  3808. componentType: IntermediateCode.Type;
  3809. exit: Label; dest: IntermediateCode.Operand;
  3810. size: LONGINT;
  3811. BEGIN
  3812. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3813. dest := destination; destination := emptyOperand;
  3814. leftType := x.left.type.resolved;
  3815. rightType := x.right.type.resolved;
  3816. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3817. CASE x.operator OF
  3818. Scanner.Or, Scanner.And, Scanner.Is:
  3819. result := ConditionValue(x);
  3820. |Scanner.Plus:
  3821. Evaluate(x.left,left);
  3822. Evaluate(x.right,right);
  3823. IF leftType IS SyntaxTree.SetType THEN
  3824. InitOperand(result,ModeValue);
  3825. Reuse2a(result.op,left.op,right.op,dest);
  3826. Emit(Or(position,result.op,left.op,right.op));
  3827. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3828. InitOperand(result,ModeValue);
  3829. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3830. Reuse2(result.tag,left.tag,right.tag);
  3831. Emit(Add(position,result.op,left.op,right.op));
  3832. Emit(Add(position,result.tag,left.tag,right.tag))
  3833. ELSE
  3834. InitOperand(result,ModeValue);
  3835. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3836. AddInt(result.op, left.op, right.op) ;
  3837. ELSE
  3838. *)
  3839. Reuse2a(result.op,left.op,right.op,dest);
  3840. Emit(Add(position,result.op,left.op,right.op));
  3841. (*
  3842. END;
  3843. *)
  3844. END;
  3845. ReleaseOperand(left); ReleaseOperand(right);
  3846. |Scanner.Minus:
  3847. Evaluate(x.left,left);
  3848. Evaluate(x.right,right);
  3849. IF leftType IS SyntaxTree.SetType THEN
  3850. InitOperand(result,ModeValue);
  3851. Reuse1(result.op,right.op);
  3852. Emit(Not(position,result.op,right.op));
  3853. ReleaseOperand(right);
  3854. Emit(And(position,result.op,result.op,left.op));
  3855. ReleaseOperand(left);
  3856. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3857. InitOperand(result,ModeValue);
  3858. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3859. Reuse2(result.tag,left.tag,right.tag);
  3860. Emit(Sub(position,result.op,left.op,right.op));
  3861. Emit(Sub(position,result.tag,left.tag,right.tag));
  3862. ReleaseOperand(left); ReleaseOperand(right)
  3863. ELSE
  3864. InitOperand(result,ModeValue);
  3865. Reuse2a(result.op,left.op,right.op,dest);
  3866. Emit(Sub(position,result.op,left.op,right.op));
  3867. ReleaseOperand(left); ReleaseOperand(right);
  3868. END;
  3869. |Scanner.Times:
  3870. Evaluate(x.left,left);
  3871. Evaluate(x.right,right);
  3872. IF leftType IS SyntaxTree.SetType THEN
  3873. InitOperand(result,ModeValue);
  3874. Reuse2a(result.op,left.op,right.op,dest);
  3875. Emit(And(position,result.op,left.op,right.op));
  3876. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3877. InitOperand(result, ModeValue);
  3878. componentType := left.op.type;
  3879. (* TODO: review this *)
  3880. (*
  3881. result.op = left.op * right.op - left.tag * right.tag
  3882. result.tag = left.tag * right.op + left.op * right.tag
  3883. *)
  3884. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3885. Emit(Mul(position,result.op, left.op, right.op));
  3886. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3887. Emit(Mul(position,tempReg, left.tag, right.tag));
  3888. Emit(Sub(position,result.op, result.op, tempReg));
  3889. Reuse2(result.tag, left.tag, right.op);
  3890. Emit(Mul(position,result.tag, left.tag, right.op));
  3891. Emit(Mul(position,tempReg, left.op, right.tag));
  3892. Emit(Add(position,result.tag, result.tag, tempReg));
  3893. ReleaseIntermediateOperand(tempReg)
  3894. ELSE
  3895. InitOperand(result,ModeValue);
  3896. Reuse2a(result.op,left.op,right.op,dest);
  3897. Emit(Mul(position,result.op,left.op,right.op));
  3898. END;
  3899. ReleaseOperand(left); ReleaseOperand(right);
  3900. |Scanner.Div:
  3901. Evaluate(x.left,left);
  3902. Evaluate(x.right,right);
  3903. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3904. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3905. IF ~isUnchecked THEN
  3906. exit := NewLabel();
  3907. BrltL(exit,zero,right.op);
  3908. EmitTrap(position,NegativeDivisorTrap);
  3909. SetLabel(exit);
  3910. END;
  3911. END;
  3912. InitOperand(result,ModeValue);
  3913. Reuse2a(result.op,left.op,right.op,dest);
  3914. Emit(Div(position,result.op,left.op,right.op));
  3915. ReleaseOperand(left); ReleaseOperand(right);
  3916. |Scanner.Mod:
  3917. Evaluate(x.left,left);
  3918. Evaluate(x.right,right);
  3919. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3920. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3921. IF ~isUnchecked THEN
  3922. exit := NewLabel();
  3923. BrltL(exit,zero,right.op);
  3924. EmitTrap(position,NegativeDivisorTrap);
  3925. SetLabel(exit);
  3926. END;
  3927. END;
  3928. InitOperand(result,ModeValue);
  3929. Reuse2a(result.op,left.op,right.op,dest);
  3930. Emit(Mod(position,result.op,left.op,right.op));
  3931. ReleaseOperand(left); ReleaseOperand(right);
  3932. |Scanner.Slash:
  3933. Evaluate(x.left,left);
  3934. Evaluate(x.right,right);
  3935. IF leftType IS SyntaxTree.SetType THEN
  3936. InitOperand(result,ModeValue);
  3937. Reuse2a(result.op,left.op,right.op,dest);
  3938. Emit(Xor(position,result.op,left.op,right.op));
  3939. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3940. InitOperand(result,ModeValue);
  3941. componentType := left.op.type;
  3942. (* review this *)
  3943. (*
  3944. divisor = right.op * right.op + right.tag * right.tag
  3945. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3946. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3947. *)
  3948. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3949. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3950. Emit(Mul(position,tempReg, right.op, right.op));
  3951. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3952. Emit(Add(position,tempReg, tempReg, tempReg2));
  3953. result.op := tempReg2;
  3954. Emit(Mul(position,result.op, left.op, right.op));
  3955. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3956. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3957. Emit(Add(position,result.op, result.op, tempReg2));
  3958. Emit(Div(position,result.op, result.op, tempReg));
  3959. Reuse2(result.tag, left.tag, right.op);
  3960. Emit(Mul(position,result.tag, left.tag, right.op));
  3961. Emit(Mul(position,tempReg2, left.op, right.tag));
  3962. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3963. Emit(Div(position,result.tag, result.tag, tempReg));
  3964. ReleaseIntermediateOperand(tempReg);
  3965. ReleaseIntermediateOperand(tempReg2)
  3966. ELSE
  3967. InitOperand(result,ModeValue);
  3968. Reuse2a(result.op,left.op,right.op,dest);
  3969. Emit(Div(position,result.op,left.op,right.op));
  3970. END;
  3971. ReleaseOperand(left); ReleaseOperand(right);
  3972. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3973. result := ConditionValue(x);
  3974. |Scanner.In:
  3975. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3976. Evaluate(x.left,left);
  3977. Evaluate(x.right,right);
  3978. Convert(left.op,setType);
  3979. Convert(right.op,setType);
  3980. ReuseCopy(temp.op,right.op);
  3981. Emit(Shr(position,temp.op,temp.op,left.op));
  3982. ReleaseOperand(right); ReleaseOperand(left);
  3983. IntermediateCode.InitImmediate(one,setType,1);
  3984. Emit(And(position,temp.op,temp.op,one));
  3985. Convert(temp.op,bool);
  3986. result.mode := ModeValue;
  3987. result.op := temp.op;
  3988. result.tag := nil; (* may be left over from calls to evaluate *)
  3989. ELSE
  3990. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3991. IF x.operator = Scanner.Questionmarks THEN
  3992. leftExpression := x.left;
  3993. rightExpression := x.right;
  3994. ELSE
  3995. leftExpression := x.right;
  3996. rightExpression := x.left;
  3997. END;
  3998. Evaluate(leftExpression, left);
  3999. Emit(Push(position,left.op));
  4000. ReleaseOperand(left);
  4001. Designate(rightExpression, right);
  4002. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4003. IF ~backend.cellsAreObjects THEN
  4004. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  4005. END;
  4006. Emit(Push(position,right.op));
  4007. ReleaseOperand(right);
  4008. IF backend.cellsAreObjects THEN
  4009. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  4010. ELSE
  4011. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  4012. END;
  4013. InitOperand(result, ModeValue);
  4014. result.op := NewRegisterOperand(bool);
  4015. Emit(Result(position,result.op));
  4016. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  4017. leftExpression := x.left;
  4018. rightExpression := x.right;
  4019. Evaluate(leftExpression, left);
  4020. Emit(Push(position,left.op));
  4021. ReleaseOperand(left);
  4022. Evaluate(rightExpression, right);
  4023. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4024. IF ~backend.cellsAreObjects THEN
  4025. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  4026. END;
  4027. Emit(Push(position,right.op));
  4028. ReleaseOperand(right);
  4029. IF backend.cellsAreObjects THEN
  4030. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  4031. ELSE
  4032. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  4033. END;
  4034. InitOperand(result, ModeValue);
  4035. result.op := NewRegisterOperand(bool);
  4036. Emit(Result(position,result.op));
  4037. ELSE
  4038. HALT(100);
  4039. END;
  4040. END;
  4041. destination := dest;
  4042. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  4043. END VisitBinaryExpression;
  4044. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  4045. VAR localResult, operand: Operand;
  4046. BEGIN
  4047. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  4048. InitOperand(localResult, ModeValue);
  4049. ASSERT(x.first # NIL);
  4050. Evaluate(x.first, operand);
  4051. localResult.op := operand.op;
  4052. ReleaseOperand(operand);
  4053. UseIntermediateOperand(localResult.op);
  4054. ASSERT(x.last # NIL);
  4055. Evaluate(x.last, operand);
  4056. localResult.tag := operand.op;
  4057. ReleaseOperand(operand);
  4058. UseIntermediateOperand(localResult.tag);
  4059. IF x.step # NIL THEN
  4060. Evaluate(x.step, operand);
  4061. localResult.extra := operand.op;
  4062. ReleaseOperand(operand);
  4063. UseIntermediateOperand(localResult.extra);
  4064. END;
  4065. result := localResult;
  4066. IF Trace THEN TraceExit("VisitRangeExpression") END
  4067. END VisitRangeExpression;
  4068. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  4069. BEGIN
  4070. HALT(100); (* should never be evaluated *)
  4071. END VisitTensorRangeExpression;
  4072. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  4073. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  4074. BEGIN
  4075. IF Trace THEN TraceEnter("VisitConversion") END;
  4076. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  4077. dest := destination; destination := emptyOperand;
  4078. Evaluate(x.expression,old);
  4079. InitOperand(result,ModeValue);
  4080. result.op := old.op;
  4081. ASSERT(result.op.mode # 0);
  4082. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  4083. (* convert TO a complex number *)
  4084. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  4085. Convert(result.op,IntermediateCode.GetType(system, componentType));
  4086. ASSERT(result.op.mode # 0);
  4087. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  4088. (* convert FROM a complex number TO a complex number*)
  4089. result.tag := old.tag;
  4090. ASSERT(result.tag.mode # 0);
  4091. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  4092. ASSERT(result.tag.mode # 0)
  4093. ELSE
  4094. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  4095. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  4096. END
  4097. ELSE
  4098. Convert(result.op,IntermediateCode.GetType(system,x.type));
  4099. ASSERT(result.op.mode # 0);
  4100. result.tag := old.tag; (*! probably never used *)
  4101. END;
  4102. destination := dest;
  4103. IF Trace THEN TraceExit("VisitConversion") END;
  4104. END VisitConversion;
  4105. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  4106. BEGIN
  4107. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  4108. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  4109. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  4110. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  4111. END VisitTypeDeclaration;
  4112. (** designators (expressions) *)
  4113. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  4114. VAR ownerType, designatorType: SyntaxTree.RecordType;
  4115. BEGIN
  4116. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  4117. IF x.left # NIL THEN Expression(x.left) END;
  4118. Symbol(x.symbol,result);
  4119. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  4120. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  4121. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  4122. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  4123. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  4124. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  4125. END;
  4126. END;
  4127. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  4128. END VisitSymbolDesignator;
  4129. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  4130. BEGIN
  4131. IF isUnchecked THEN RETURN END;
  4132. IF tagsAvailable THEN
  4133. TrapC(BrltL,index,length,IndexCheckTrap);
  4134. END;
  4135. END BoundCheck;
  4136. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  4137. VAR d: IntermediateCode.Operand;
  4138. BEGIN
  4139. IF isUnchecked THEN RETURN END;
  4140. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  4141. TrapC(op,dim,d,ArraySizeTrap);
  4142. ReleaseIntermediateOperand(d);
  4143. END DimensionCheck;
  4144. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  4145. VAR
  4146. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  4147. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  4148. expression: SyntaxTree.Expression;
  4149. resultingType, leftType, baseType: SyntaxTree.Type;
  4150. skipLabel1: Label;
  4151. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  4152. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  4153. variableOp: Operand;
  4154. variable: SyntaxTree.Variable;
  4155. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  4156. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  4157. VAR e: SyntaxTree.Expression; i: LONGINT;
  4158. BEGIN
  4159. tensorFound := FALSE;
  4160. FOR i := 0 TO parameters.Length()-1 DO
  4161. e := parameters.GetExpression(i);
  4162. IF e IS SyntaxTree.TensorRangeExpression THEN
  4163. ASSERT(~tensorFound);
  4164. tensorFound := TRUE;
  4165. ELSIF e IS SyntaxTree.RangeExpression THEN
  4166. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4167. ELSE
  4168. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4169. END;
  4170. END;
  4171. END CountIndices;
  4172. BEGIN
  4173. ASSERT(tagsAvailable);
  4174. resultingType := x.type.resolved; (* resulting type *)
  4175. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  4176. InitOperand(localResult, ModeReference);
  4177. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4178. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  4179. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  4180. (* a globally defined array destination tag is available -> use and invalidate it*)
  4181. localResult.tag := arrayDestinationTag;
  4182. IntermediateCode.InitOperand(arrayDestinationTag)
  4183. ELSE
  4184. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  4185. (* the result is of array range type and thus does not provide any collectable pointers *)
  4186. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  4187. Symbol(variable, variableOp);
  4188. ReuseCopy(localResult.tag, variableOp.op);
  4189. ReleaseOperand(variableOp);
  4190. END
  4191. END;
  4192. indexListSize := x.parameters.Length();
  4193. CountIndices(x.parameters);
  4194. (*ASSERT(tensorRangeCount <= 1);*)
  4195. (* designate the array to be indexed over, perform tensor range check if known *)
  4196. Designate(x.left, array);
  4197. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4198. Dereference(array, leftType,FALSE);
  4199. IF ~tensorFound THEN
  4200. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  4201. END
  4202. END;
  4203. (* default base offset *)
  4204. srcDimOffset := 0;
  4205. destDimOffset := 0;
  4206. indexDim := 0;
  4207. (* use address of source array as basis *)
  4208. localResult.op := array.op;
  4209. UseIntermediateOperand(localResult.op);
  4210. (* go through the index list *)
  4211. FOR i := 0 TO indexListSize - 1 DO
  4212. expression := x.parameters.GetExpression(i);
  4213. IF expression IS SyntaxTree.TensorRangeExpression THEN
  4214. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  4215. srcDimOffset := -indexListSize;
  4216. destDimOffset := -suffixRanges;
  4217. ELSE
  4218. (* determine which dimension of source array is currently looked at *)
  4219. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  4220. (* get the memory operand pointing to array descriptor dimension *)
  4221. GetMathArrayField(tmp, array.tag, MathDimOffset);
  4222. (* make a reusable register from it *)
  4223. ReuseCopy(srcDim, tmp);
  4224. ReleaseIntermediateOperand(tmp);
  4225. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  4226. ELSE
  4227. srcDim := IntermediateCode.Immediate(sizeType, i);
  4228. END;
  4229. (* get length and increment of source array for current dimension *)
  4230. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  4231. Convert(sourceLength.op, sizeType);
  4232. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  4233. Convert(sourceIncrement.op, sizeType);
  4234. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  4235. ReleaseIntermediateOperand(srcDim);
  4236. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  4237. (* SINGLE INDEX *)
  4238. Evaluate(expression, index);
  4239. ReleaseIntermediateOperand(index.tag);
  4240. index.tag := emptyOperand;
  4241. Convert(index.op, sizeType);
  4242. (* lower bound check *)
  4243. IF IsIntegerImmediate(index.op, staticIndex) THEN
  4244. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  4245. ELSIF isUnchecked THEN (* do nothing *)
  4246. ELSE
  4247. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4248. END;
  4249. (* upper bound check *)
  4250. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4251. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  4252. ELSIF isUnchecked THEN (* do nothing *)
  4253. ELSE
  4254. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  4255. END;
  4256. ReleaseOperand(sourceLength);
  4257. Convert(index.op, addressType);
  4258. summand := index.op;
  4259. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  4260. (* RANGE OF INDICES *)
  4261. Evaluate(expression, range);
  4262. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  4263. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  4264. stepSize := range.extra; UseIntermediateOperand(stepSize);
  4265. ReleaseOperand(range);
  4266. Convert(firstIndex, sizeType);
  4267. Convert(lastIndex, sizeType);
  4268. Convert(stepSize, sizeType);
  4269. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  4270. if it is 'MAX(LONGINT)' *)
  4271. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4272. TransferToRegister(lastIndex, lastIndex);
  4273. skipLabel1 := NewLabel();
  4274. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  4275. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  4276. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  4277. SetLabel(skipLabel1)
  4278. END;
  4279. (* check if step size is valid *)
  4280. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  4281. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  4282. ELSIF isUnchecked THEN (* do nothing *)
  4283. ELSE
  4284. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  4285. END;
  4286. (* check lower bound check *)
  4287. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  4288. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  4289. ELSIF isUnchecked THEN (* do nothing *)
  4290. ELSE
  4291. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4292. END;
  4293. (* check upper bound check *)
  4294. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4295. (* statically open range: nothing to do *)
  4296. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4297. ASSERT(staticLastIndex < staticSourceLength)
  4298. ELSIF isUnchecked THEN (* do nothing *)
  4299. ELSE
  4300. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  4301. END;
  4302. (* determine length of target array for current dimension *)
  4303. (* 1. incorporate last index: *)
  4304. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4305. (* last index is static *)
  4306. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4307. targetLength := sourceLength.op
  4308. ELSE
  4309. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  4310. END;
  4311. UseIntermediateOperand(targetLength);
  4312. ELSE
  4313. (* targetLength := lastIndex + 1
  4314. Reuse1(targetLength, lastIndex);
  4315. *)
  4316. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  4317. END;
  4318. ReleaseOperand(sourceLength);
  4319. ReleaseIntermediateOperand(lastIndex);
  4320. (* 2. incorporate first index: *)
  4321. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4322. (* first index and current target length are static *)
  4323. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  4324. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  4325. (* first index = 0: nothing to do *)
  4326. ELSE
  4327. (* targetLength := targetLength - firstIndex *)
  4328. TransferToRegister(targetLength, targetLength);
  4329. Emit(Sub(position,targetLength, targetLength, firstIndex))
  4330. END;
  4331. (* clip negative lengths to 0 *)
  4332. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4333. IF staticTargetLength < 0 THEN
  4334. targetLength := IntermediateCode.Immediate(sizeType, 0)
  4335. END
  4336. ELSE
  4337. skipLabel1 := NewLabel();
  4338. TransferToRegister(targetLength, targetLength);
  4339. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  4340. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  4341. SetLabel(skipLabel1)
  4342. END;
  4343. (* 3. incorporate index step size: *)
  4344. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4345. (*step size and current target length are static *)
  4346. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  4347. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  4348. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4349. (* step size = 1: nothing to do *)
  4350. ELSE
  4351. (* emit code for this:
  4352. targetLength := (targetLength-1) DIV stepSize +1;
  4353. *)
  4354. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  4355. DivInt(targetLength, targetLength, stepSize);
  4356. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  4357. END;
  4358. (* determine increment of target array for current dimension *)
  4359. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  4360. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  4361. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4362. (* step size = 1 *)
  4363. targetIncrement := sourceIncrement.op;
  4364. UseIntermediateOperand(targetIncrement)
  4365. ELSE
  4366. (* targetIncrement := sourceIncrement * stepSize *)
  4367. Reuse1(targetIncrement, stepSize);
  4368. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  4369. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  4370. END;
  4371. ReleaseIntermediateOperand(stepSize);
  4372. (* write length and increment of target array to descriptor *)
  4373. IF destDimOffset < 0 THEN
  4374. (* determine which dimension of target array is currently looked at *)
  4375. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  4376. TransferToRegister(destDim, tmp);
  4377. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  4378. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  4379. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  4380. ReleaseIntermediateOperand(destDim);
  4381. INC(destDimOffset);
  4382. ELSE
  4383. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  4384. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  4385. END;
  4386. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  4387. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  4388. INC(indexDim);
  4389. Convert(firstIndex, addressType);
  4390. TransferToRegister(summand, firstIndex);
  4391. ELSE HALT(100);
  4392. END;
  4393. (*
  4394. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  4395. *)
  4396. Convert(sourceIncrement.op, addressType);
  4397. Convert(summand, addressType);
  4398. MulInt(summand, summand, sourceIncrement.op);
  4399. ReleaseIntermediateOperand(sourceIncrement.op);
  4400. AddInt(localResult.op, localResult.op, summand);
  4401. ReleaseIntermediateOperand(summand);
  4402. END
  4403. END;
  4404. result := localResult;
  4405. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4406. ReleaseIntermediateOperand(result.tag);
  4407. result.tag := TypeDescriptorAdr(resultingType);
  4408. ELSIF IsDelegate(resultingType) THEN
  4409. ReleaseIntermediateOperand(result.tag);
  4410. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4411. UseIntermediateOperand(result.tag);
  4412. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4413. ReleaseIntermediateOperand(result.tag);
  4414. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4415. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4416. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4417. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4418. (* finalize target array descriptor *)
  4419. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4420. (* write lengths and increments of target array for remaining dimensions *)
  4421. i := indexListSize;
  4422. WHILE indexDim < targetArrayDimensionality DO
  4423. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4424. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4425. ReleaseOperand(sourceLength);
  4426. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4427. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4428. ReleaseOperand(sourceIncrement);
  4429. INC(i); INC(indexDim);
  4430. END;
  4431. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4432. tmp := nil;
  4433. ELSE
  4434. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4435. END;
  4436. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4437. ReleaseIntermediateOperand(tmp);
  4438. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4439. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4440. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4441. ELSE
  4442. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4443. END;
  4444. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4445. ReleaseIntermediateOperand(tmp);
  4446. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4447. (* write dimensionality *)
  4448. IF targetArrayDimensionality # 0 THEN
  4449. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4450. END;
  4451. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4452. END;
  4453. ReleaseOperand(array);
  4454. END MathIndexDesignator;
  4455. (* get the length of an array , trying to make use of static information *)
  4456. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4457. VAR res: IntermediateCode.Operand; size: LONGINT;
  4458. BEGIN
  4459. type := type.resolved;
  4460. IF type IS SyntaxTree.ArrayType THEN
  4461. WITH type: SyntaxTree.ArrayType DO
  4462. IF type.form = SyntaxTree.Static THEN
  4463. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4464. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4465. Evaluate(type.length, op);
  4466. ReleaseIntermediateOperand(op.tag);
  4467. RETURN op.op;*)
  4468. ELSE
  4469. res := tag;
  4470. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4471. IntermediateCode.MakeMemory(res,addressType);
  4472. UseIntermediateOperand(res);
  4473. RETURN res
  4474. END
  4475. END;
  4476. ELSE
  4477. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4478. RETURN IntermediateCode.Immediate(addressType,size);
  4479. END;
  4480. END ArrayLength;
  4481. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4482. BEGIN
  4483. IF IsImmediate(x) THEN
  4484. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4485. ELSE
  4486. IF ~ReusableRegister(res) THEN
  4487. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4488. ELSE
  4489. UseIntermediateOperand(res);
  4490. END;
  4491. Emit(Mov(position,res,x))
  4492. END;
  4493. END CopyInt;
  4494. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4495. BEGIN
  4496. ReleaseIntermediateOperand(res);
  4497. IF IsImmediate(x) & IsImmediate(y) THEN
  4498. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4499. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4500. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4501. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4502. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4503. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4504. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4505. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4506. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4507. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4508. UseIntermediateOperand(res);
  4509. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4510. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4511. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4512. UseIntermediateOperand(res);
  4513. ELSE
  4514. IF ~ReusableRegister(res) THEN
  4515. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4516. ELSE
  4517. UseIntermediateOperand(res);
  4518. END;
  4519. IF IsImmediate(x) & (x.intValue = 0) THEN
  4520. Emit(Mov(position,res,y))
  4521. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4522. Emit(Mov(position,res,x))
  4523. ELSE
  4524. Emit(Add(position,res, x, y));
  4525. END;
  4526. END;
  4527. END AddInt;
  4528. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4529. BEGIN
  4530. ReleaseIntermediateOperand(res);
  4531. IF IsImmediate(x) & IsImmediate(y) THEN
  4532. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4533. ELSE
  4534. IF ~ReusableRegister(res) THEN
  4535. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4536. ELSE UseIntermediateOperand(res);
  4537. END;
  4538. IF IsImmediate(x) & (x.intValue = 1) THEN
  4539. Emit(Mov(position,res,y))
  4540. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4541. Emit(Mov(position,res,x))
  4542. ELSE
  4543. Emit(Mul(position,res, x, y));
  4544. END;
  4545. END;
  4546. END MulInt;
  4547. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4548. BEGIN
  4549. ReleaseIntermediateOperand(res);
  4550. IF IsImmediate(x) & IsImmediate(y) THEN
  4551. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4552. ELSE
  4553. IF ~ReusableRegister(res) THEN
  4554. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4555. ELSE UseIntermediateOperand(res);
  4556. END;
  4557. IF IsImmediate(x) & (x.intValue = 1) THEN
  4558. Emit(Mov(position,res,y))
  4559. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4560. Emit(Mov(position,res,x))
  4561. ELSE
  4562. Emit(Div(position,res, x, y));
  4563. END;
  4564. END;
  4565. END DivInt;
  4566. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4567. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4568. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4569. BEGIN
  4570. type := x.left.type.resolved;
  4571. IF type IS SyntaxTree.StringType THEN
  4572. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4573. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4574. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4575. type := atype;
  4576. x.left.SetType(type);
  4577. END;
  4578. IntermediateCode.InitImmediate(res,addressType,0);
  4579. maxDim := x.parameters.Length()-1;
  4580. (*
  4581. computation rule:
  4582. a: ARRAY X,Y,Z OF Element with size S
  4583. a[i,j,k] -->
  4584. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4585. *)
  4586. FOR i := 0 TO maxDim DO
  4587. e := x.parameters.GetExpression(i);
  4588. Evaluate(e,index);
  4589. Convert(index.op,addressType);
  4590. AddInt(res, res, index.op);
  4591. IF i = 0 THEN
  4592. (*
  4593. ReuseCopy(res, index.op);
  4594. *)
  4595. Designate(x.left,array);
  4596. type := x.left.type.resolved;
  4597. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4598. Dereference(array, type, FALSE);
  4599. END;
  4600. (*
  4601. ELSE AddInt(res, res, index.op);
  4602. *)
  4603. END;
  4604. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4605. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4606. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4607. BoundCheck(index.op, length);
  4608. END;
  4609. ReleaseIntermediateOperand(length);
  4610. END;
  4611. ReleaseOperand(index);
  4612. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4613. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4614. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4615. MulInt(res,res,length);
  4616. END;
  4617. ReleaseIntermediateOperand(length);
  4618. END;
  4619. (* remaining open dimensions -- compute address *)
  4620. i := maxDim+1;
  4621. IF type IS SyntaxTree.ArrayType THEN
  4622. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4623. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4624. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4625. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4626. MulInt(res,res,length);
  4627. END;
  4628. ReleaseIntermediateOperand(length);
  4629. INC(i);
  4630. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4631. END;
  4632. END;
  4633. IF (type IS SyntaxTree.ArrayType) THEN
  4634. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4635. size := StaticSize(system, type);
  4636. IF size # 1 THEN
  4637. length := IntermediateCode.Immediate(addressType,size);
  4638. MulInt(res,res,length);
  4639. END;
  4640. ELSE
  4641. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4642. IF size # 1 THEN
  4643. length := IntermediateCode.Immediate(addressType,size);
  4644. MulInt(res,res,length);
  4645. END;
  4646. END;
  4647. END;
  4648. AddInt(res,res,array.op);
  4649. InitOperand(result,ModeReference);
  4650. result.op := res;
  4651. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4652. ReleaseIntermediateOperand(result.tag);
  4653. result.tag := TypeDescriptorAdr(type);
  4654. ELSIF IsDelegate(type) THEN
  4655. ReleaseIntermediateOperand(result.tag);
  4656. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4657. UseIntermediateOperand(result.tag);
  4658. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4659. ReleaseIntermediateOperand(result.tag);
  4660. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4661. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4662. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4663. END;
  4664. ReleaseOperand(array);
  4665. END IndexDesignator;
  4666. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4667. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4668. BEGIN
  4669. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4670. dest := destination; destination := emptyOperand;
  4671. type := x.left.type.resolved;
  4672. IF type IS SyntaxTree.MathArrayType THEN
  4673. MathIndexDesignator(x);
  4674. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4675. IndexDesignator(x);
  4676. END;
  4677. destination := dest;
  4678. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4679. END VisitIndexDesignator;
  4680. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4681. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4682. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4683. procedure: SyntaxTree.Procedure;
  4684. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4685. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4686. BEGIN
  4687. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4688. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4689. parameters := expression.parameters;
  4690. moduleName := "FoxArrayBase";
  4691. procedureName := "CopyDescriptor";
  4692. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4693. SaveRegisters();ReleaseUsedRegisters(saved);
  4694. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4695. IF procedure = NIL THEN
  4696. s := "procedure ";
  4697. Strings.Append(s,moduleName);
  4698. Strings.Append(s,".");
  4699. Strings.Append(s,procedureName);
  4700. Strings.Append(s," not present");
  4701. Error(position,s);
  4702. ELSE
  4703. (* push address of temporary variable *)
  4704. Symbol(variable,destOperand);
  4705. Emit(Push(position,destOperand.op));
  4706. ReleaseOperand(destOperand);
  4707. (* push src *)
  4708. Evaluate(expression.left,srcOperand);
  4709. (*
  4710. Dereference(srcOperand,expression.type.resolved);
  4711. Emit(Push(position,srcOperand.tag));
  4712. *)
  4713. Emit(Push(position,srcOperand.op));
  4714. ReleaseOperand(srcOperand);
  4715. tensorFound := FALSE;
  4716. FOR i := 0 TO parameters.Length()-1 DO
  4717. e := parameters.GetExpression(i);
  4718. IF e IS SyntaxTree.TensorRangeExpression THEN
  4719. tensorFound := TRUE;
  4720. ELSIF e IS SyntaxTree.RangeExpression THEN
  4721. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4722. ELSE
  4723. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4724. END;
  4725. END;
  4726. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4727. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4728. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4729. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4730. StaticCallOperand(procOp,procedure);
  4731. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4732. ReleaseOperand(procOp);
  4733. END;
  4734. RestoreRegisters(saved);
  4735. END;
  4736. RETURN variable
  4737. END PrepareTensorDescriptor;
  4738. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4739. VAR
  4740. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4741. operand, tmpOperand, variableOp, variable2Op: Operand;
  4742. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4743. variable, variable2: SyntaxTree.Variable;
  4744. dim, i, size: LONGINT;
  4745. (* TODO: needed? *)
  4746. oldArrayDestinationTag: IntermediateCode.Operand;
  4747. oldArrayDestinationDimension: LONGINT;
  4748. position: Position;
  4749. saved: RegisterEntry;
  4750. arrayFlags: SET;
  4751. m, n: LONGINT;
  4752. PROCEDURE Pass(op: IntermediateCode.Operand);
  4753. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4754. BEGIN
  4755. IF register >= 0 THEN
  4756. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4757. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4758. Emit(Mov(position,parameterRegister, op));
  4759. ELSE
  4760. Emit(Push(position,op))
  4761. END
  4762. END Pass;
  4763. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4764. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4765. BEGIN
  4766. formalType := formalType.resolved; actualType := actualType.resolved;
  4767. IF IsOpenArray(formalType)THEN
  4768. IF actualType IS SyntaxTree.StringType THEN
  4769. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4770. RETURN;
  4771. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4772. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4773. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4774. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4775. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4776. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4777. ELSE
  4778. tmp := baseReg;
  4779. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4780. IntermediateCode.MakeMemory(tmp,addressType);
  4781. Pass((tmp));
  4782. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4783. END;
  4784. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4785. END;
  4786. END PushArrayLens;
  4787. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4788. BEGIN
  4789. CASE size OF
  4790. |2: INCL(flags,Size2Flag);
  4791. |3: INCL(flags,Size3Flag);
  4792. |4: INCL(flags,Size4Flag);
  4793. |5: INCL(flags,Size5Flag);
  4794. |6: INCL(flags,Size6Flag);
  4795. |7: INCL(flags,Size7Flag);
  4796. |8: INCL(flags,Size8Flag);
  4797. END;
  4798. END SetSmallArraySizeFlag;
  4799. BEGIN
  4800. IF Trace THEN TraceEnter("PushParameter") END;
  4801. position := expression.position;
  4802. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4803. type := expression.type.resolved;
  4804. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4805. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4806. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4807. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4808. );
  4809. (* TODO: needed? *)
  4810. oldArrayDestinationTag := arrayDestinationTag;
  4811. oldArrayDestinationDimension := arrayDestinationDimension;
  4812. IF IsArrayOfSystemByte(parameter.type) THEN
  4813. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4814. Designate(expression,operand);
  4815. ELSE
  4816. Evaluate(expression, tmpOperand);
  4817. (* array of system byte does not provide any pointers *)
  4818. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4819. Symbol(variable, operand);
  4820. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4821. Emit(Mov(position,tmp, tmpOperand.op));
  4822. ReleaseOperand(tmpOperand);
  4823. END;
  4824. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4825. ReleaseIntermediateOperand(operand.tag);
  4826. operand.tag := tmp;
  4827. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4828. Pass((operand.tag));
  4829. END;
  4830. Pass((operand.op));
  4831. ELSIF IsOpenArray(parameter.type) THEN
  4832. Designate(expression,operand);
  4833. baseReg := operand.tag;
  4834. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4835. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4836. END;
  4837. Pass((operand.op)); (* address of the array *)
  4838. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4839. (* case 1
  4840. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4841. *)
  4842. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4843. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4844. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4845. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4846. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4847. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4848. arrayDestinationTag := sp;
  4849. (* case 1b
  4850. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4851. *)
  4852. IF expression IS SyntaxTree.IndexDesignator THEN
  4853. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4854. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4855. arrayDestinationDimension := dim;
  4856. Designate(expression,operand);
  4857. (* case 1a
  4858. P(...,A,...) push: push array descriptor to stack
  4859. *)
  4860. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4861. Designate(expression,operand);
  4862. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4863. i := 0;
  4864. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4865. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4866. INC(i);
  4867. END;
  4868. type := expression.type.resolved;
  4869. WHILE (i<dim) DO (* remaining static dimensions *)
  4870. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4871. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4872. ReleaseOperand(tmpOperand);
  4873. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4874. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4875. ReleaseOperand(tmpOperand);
  4876. INC(i);
  4877. END;
  4878. dimOp := IntermediateCode.Immediate(addressType,dim);
  4879. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4880. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4881. (* case 1d
  4882. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4883. + case 1e
  4884. P(.. PT() ... );
  4885. *)
  4886. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4887. Designate(expression,operand);
  4888. Dereference(operand,type.resolved,FALSE);
  4889. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4890. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4891. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4892. (* case 1f
  4893. P(...,S,...) push: create array descriptor to S on stack
  4894. case 1g
  4895. P(... PS()...)
  4896. *)
  4897. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4898. Designate(expression,operand);
  4899. FOR i := 0 TO dim-1 DO
  4900. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4901. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4902. ReleaseOperand(tmpOperand);
  4903. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4904. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4905. ReleaseOperand(tmpOperand);
  4906. END;
  4907. (*******
  4908. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4909. *)
  4910. arrayFlags := {StaticFlag};
  4911. IF dim = 1 THEN
  4912. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4913. ReleaseOperand(tmpOperand);
  4914. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4915. m := LONGINT(tmpOperand.op.intValue);
  4916. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4917. ELSIF dim = 2 THEN
  4918. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4919. ReleaseOperand(tmpOperand);
  4920. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4921. m := LONGINT(tmpOperand.op.intValue);
  4922. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4923. ReleaseOperand(tmpOperand);
  4924. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4925. n := LONGINT(tmpOperand.op.intValue);
  4926. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4927. INCL(arrayFlags,SmallMatrixFlag);
  4928. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4929. END;
  4930. END;
  4931. (*******)
  4932. dimOp := IntermediateCode.Immediate(addressType,dim);
  4933. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4934. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4935. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4936. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4937. baseType := SemanticChecker.ArrayBase(type,dim);
  4938. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4939. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4940. ELSE HALT(100);
  4941. END;
  4942. (* case 2
  4943. procedure P([left args], var A: array [*,*] of Type, [right args])
  4944. *)
  4945. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4946. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4947. (* case 2b
  4948. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4949. push: push reference to pushed array descriptor
  4950. post: remove array descriptor.
  4951. *)
  4952. IF expression IS SyntaxTree.IndexDesignator THEN
  4953. descriptorType := GetMathArrayDescriptorType(dim);
  4954. (* range type : no allocation possible, should be untraced *)
  4955. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4956. Symbol(variable,variableOp);
  4957. arrayDestinationTag := variableOp.op;
  4958. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4959. arrayDestinationDimension := dim;
  4960. NeedDescriptor := TRUE;
  4961. Designate(expression,operand);
  4962. Pass((operand.tag));
  4963. NeedDescriptor := FALSE;
  4964. (* case 2a
  4965. P(...,A,...)
  4966. push: push reference to array descriptor on stack
  4967. *)
  4968. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4969. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4970. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4971. INC(i);
  4972. END;
  4973. IF i = dim THEN
  4974. Designate(expression,operand);
  4975. Pass((operand.tag));
  4976. ELSE (* open-static *)
  4977. type := expression.type.resolved;
  4978. descriptorType := GetMathArrayDescriptorType(dim);
  4979. (* static array , cannot be reallocated, untraced !*)
  4980. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4981. Symbol(variable,variableOp);
  4982. arrayDestinationTag := variableOp.op;
  4983. Designate(expression,operand);
  4984. FOR i := 0 TO dim-1 DO
  4985. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4986. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4987. ReleaseOperand(tmpOperand);
  4988. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4989. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4990. ReleaseOperand(tmpOperand);
  4991. END;
  4992. dimOp := IntermediateCode.Immediate(addressType,dim);
  4993. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4994. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4995. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4996. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4997. baseType := SemanticChecker.ArrayBase(type,dim);
  4998. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4999. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5000. Pass((arrayDestinationTag));
  5001. END;
  5002. (* case 2d
  5003. P(...,T,...) push: emit dimension check, push T
  5004. *)
  5005. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5006. Designate(expression,operand);
  5007. Dereference(operand,type.resolved,FALSE);
  5008. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  5009. Pass((operand.tag));
  5010. (* case 2f
  5011. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  5012. push: push reference to pushed array descriptor
  5013. post: remove array descriptor
  5014. *)
  5015. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5016. descriptorType := GetMathArrayDescriptorType(dim);
  5017. (* static array -- cannot be reallocatated, untraced *)
  5018. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5019. Symbol(variable,variableOp);
  5020. arrayDestinationTag := variableOp.op;
  5021. Designate(expression,operand);
  5022. FOR i := 0 TO dim-1 DO
  5023. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5024. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5025. ReleaseOperand(tmpOperand);
  5026. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5027. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5028. ReleaseOperand(tmpOperand);
  5029. END;
  5030. (*
  5031. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  5032. *)
  5033. arrayFlags := {StaticFlag};
  5034. IF dim = 1 THEN
  5035. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5036. ReleaseOperand(tmpOperand);
  5037. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5038. m := LONGINT(tmpOperand.op.intValue);
  5039. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  5040. ELSIF dim = 2 THEN
  5041. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5042. ReleaseOperand(tmpOperand);
  5043. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5044. m := LONGINT(tmpOperand.op.intValue);
  5045. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  5046. ReleaseOperand(tmpOperand);
  5047. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5048. n := LONGINT(tmpOperand.op.intValue);
  5049. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  5050. INCL(arrayFlags,SmallMatrixFlag);
  5051. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  5052. END;
  5053. END;
  5054. (*******)
  5055. dimOp := IntermediateCode.Immediate(addressType,dim);
  5056. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5057. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5058. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5059. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  5060. baseType := SemanticChecker.ArrayBase(type,dim);
  5061. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5062. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5063. Pass((arrayDestinationTag));
  5064. ELSE HALT(100);
  5065. END;
  5066. (* case 3
  5067. procedure P([left args], [const] A: array [?] of Type, [right args])
  5068. *)
  5069. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  5070. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5071. (* case 3b
  5072. P(...,A[a..b,c..d],...)
  5073. *)
  5074. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5075. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5076. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5077. Symbol(variable,variableOp);
  5078. LoadValue(variableOp,system.addressType);
  5079. ELSE
  5080. descriptorType := GetMathArrayDescriptorType(dim);
  5081. (* range -- cannot be reallocated *)
  5082. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5083. Symbol(variable,variableOp);
  5084. END;
  5085. arrayDestinationTag := variableOp.op;
  5086. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5087. arrayDestinationDimension := 0;
  5088. Designate(expression,operand);
  5089. Pass((operand.tag));
  5090. (* case 3a
  5091. P(...,A,...)
  5092. *)
  5093. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5094. i := 0;
  5095. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5096. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5097. INC(i);
  5098. END;
  5099. IF i = dim THEN
  5100. Designate(expression,operand);
  5101. Pass((operand.tag));
  5102. ELSE (* open-static *)
  5103. type := expression.type.resolved;
  5104. descriptorType := GetMathArrayDescriptorType(dim);
  5105. (* static array -- cannot be reallocated -- no pointer to be traced *)
  5106. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5107. Symbol(variable,variableOp);
  5108. arrayDestinationTag := variableOp.op;
  5109. Designate(expression,operand);
  5110. FOR i := 0 TO dim-1 DO
  5111. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5112. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5113. ReleaseOperand(tmpOperand);
  5114. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5115. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5116. ReleaseOperand(tmpOperand);
  5117. END;
  5118. dimOp := IntermediateCode.Immediate(addressType,dim);
  5119. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5120. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5121. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5122. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  5123. baseType := SemanticChecker.ArrayBase(type,dim);
  5124. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5125. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5126. Pass((arrayDestinationTag));
  5127. END;
  5128. (* case 3d
  5129. P(...,T,...)
  5130. case 3e
  5131. P(...,PT(...),...)
  5132. *)
  5133. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5134. Designate(expression,operand);
  5135. Dereference(operand,type.resolved,FALSE);
  5136. Pass((operand.tag));
  5137. (* case 3f
  5138. P(...,S,...)
  5139. case 3g
  5140. P(...,PS(...),...)
  5141. *)
  5142. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5143. descriptorType := GetMathArrayDescriptorType(dim);
  5144. (* static array does not need to be traced *)
  5145. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5146. Symbol(variable,variableOp);
  5147. arrayDestinationTag := variableOp.op;
  5148. Designate(expression,operand);
  5149. IF operand.op.type.length >1 THEN (* vector register *)
  5150. (* static array does not need to be traced *)
  5151. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  5152. Symbol(variable2, variable2Op);
  5153. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  5154. Emit(Mov(position,tmp, operand.op));
  5155. ReleaseOperand(operand);
  5156. Symbol(variable2, operand);
  5157. END;
  5158. FOR i := 0 TO dim-1 DO
  5159. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5160. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5161. ReleaseOperand(tmpOperand);
  5162. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5163. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5164. ReleaseOperand(tmpOperand);
  5165. END;
  5166. dimOp := IntermediateCode.Immediate(addressType,dim);
  5167. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5168. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5169. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5170. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5171. baseType := SemanticChecker.ArrayBase(type,dim);
  5172. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5173. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5174. Pass((arrayDestinationTag));
  5175. ELSE HALT(100);
  5176. END;
  5177. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  5178. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5179. (* case 4b
  5180. P(...,A[a..b,c..d],...)
  5181. *)
  5182. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5183. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5184. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5185. Symbol(variable,variableOp);
  5186. LoadValue(variableOp,system.addressType);
  5187. ELSE
  5188. descriptorType := GetMathArrayDescriptorType(dim);
  5189. (* range array -- cannot be allocated *)
  5190. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5191. Symbol(variable,variableOp);
  5192. END;
  5193. arrayDestinationTag := variableOp.op;
  5194. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5195. arrayDestinationDimension := 0;
  5196. Designate(expression,operand);
  5197. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5198. Symbol(variable,variableOp);
  5199. ELSE
  5200. (* alias to range -- untraced *)
  5201. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5202. Symbol(variable,variableOp);
  5203. MakeMemory(tmp,variableOp.op,addressType,0);
  5204. Emit(Mov(position,tmp,operand.tag));
  5205. ReleaseIntermediateOperand(tmp);
  5206. END;
  5207. Pass((variableOp.op));
  5208. ReleaseOperand(variableOp);
  5209. (* case 4a
  5210. P(...,A,...)
  5211. *)
  5212. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5213. i := 0;
  5214. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5215. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5216. INC(i);
  5217. END;
  5218. IF i = dim THEN
  5219. Designate(expression,operand);
  5220. arrayDestinationTag := operand.tag;
  5221. ELSE (* open-static *)
  5222. type := expression.type.resolved;
  5223. descriptorType := GetMathArrayDescriptorType(dim);
  5224. (* static array -- untraced *)
  5225. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5226. Symbol(variable,variableOp);
  5227. arrayDestinationTag := variableOp.op;
  5228. Designate(expression,operand);
  5229. FOR i := 0 TO dim-1 DO
  5230. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5231. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5232. ReleaseOperand(tmpOperand);
  5233. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5234. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5235. ReleaseOperand(tmpOperand);
  5236. END;
  5237. dimOp := IntermediateCode.Immediate(addressType,dim);
  5238. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5239. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5240. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5241. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  5242. baseType := SemanticChecker.ArrayBase(type,dim);
  5243. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5244. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5245. END;
  5246. (* tensor alias to open array -- untraced *)
  5247. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5248. Symbol(variable,variableOp);
  5249. MakeMemory(tmp,variableOp.op,addressType,0);
  5250. Emit(Mov(position,tmp,arrayDestinationTag));
  5251. ReleaseIntermediateOperand(tmp);
  5252. Pass((variableOp.op));
  5253. ReleaseOperand(variableOp);
  5254. (* case 4d
  5255. P(...,T,...)
  5256. *)
  5257. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5258. Designate(expression,operand);
  5259. Pass((operand.op));
  5260. (* case 4f
  5261. P(...,S,...)
  5262. *)
  5263. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5264. descriptorType := GetMathArrayDescriptorType(dim);
  5265. (* static array -- cannot be reallocated, untraced *)
  5266. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5267. Symbol(variable,variableOp);
  5268. arrayDestinationTag := variableOp.op;
  5269. Designate(expression,operand);
  5270. FOR i := 0 TO dim-1 DO
  5271. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5272. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5273. ReleaseOperand(tmpOperand);
  5274. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5275. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5276. ReleaseOperand(tmpOperand);
  5277. END;
  5278. dimOp := IntermediateCode.Immediate(addressType,dim);
  5279. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5280. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5281. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5282. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5283. baseType := SemanticChecker.ArrayBase(type,dim);
  5284. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5285. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5286. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5287. Symbol(variable,variableOp);
  5288. MakeMemory(tmp,variableOp.op,addressType,0);
  5289. Emit(Mov(position,tmp,arrayDestinationTag));
  5290. ReleaseIntermediateOperand(tmp);
  5291. Pass((variableOp.op));
  5292. ReleaseOperand(variableOp);
  5293. ELSE HALT(100);
  5294. END;
  5295. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  5296. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  5297. Designate(expression,operand);
  5298. IF operand.op.type.length > 1 THEN
  5299. Emit(Push(position, operand.op));
  5300. ELSE
  5301. size := system.SizeOf(type);
  5302. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  5303. size := ToMemoryUnits(system,size);
  5304. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5305. arrayDestinationTag := sp;
  5306. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  5307. END;
  5308. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  5309. Designate(expression,operand);
  5310. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  5311. (* static array no pointer *)
  5312. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5313. Symbol(variable,variableOp);
  5314. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  5315. Emit(Mov(position,tmp,operand.op));
  5316. Emit(Push(position,variableOp.op));
  5317. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5318. Pass((operand.op));
  5319. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  5320. END;
  5321. ELSE HALT(200)
  5322. END;
  5323. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  5324. IF parameter.kind = SyntaxTree.VarParameter THEN
  5325. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  5326. Designate(expression, operand);
  5327. Pass((operand.op));
  5328. ELSE
  5329. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5330. Evaluate(expression, operand);
  5331. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  5332. Pass((operand.extra)); (* step *)
  5333. Pass((operand.tag)); (* last *)
  5334. Pass((operand.op)); (* first *)
  5335. ELSE
  5336. (* pass range as structure in order to comply with the variable alignment of its components *)
  5337. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5338. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  5339. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5340. tmp := sp;
  5341. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5342. Emit(Mov(position,tmp,operand.op)); (* first *)
  5343. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  5344. IntermediateCode.AddOffset(tmp,size);
  5345. Emit(Mov(position,tmp,operand.tag)); (* last *)
  5346. IntermediateCode.AddOffset(tmp,size);
  5347. Emit(Mov(position,tmp,operand.extra)); (* step *)
  5348. END;
  5349. END
  5350. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  5351. IF parameter.kind = SyntaxTree.VarParameter THEN
  5352. Designate(expression, operand);
  5353. Pass((operand.op));
  5354. ELSE
  5355. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5356. Evaluate(expression, operand);
  5357. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  5358. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  5359. Pass((operand.tag)); (* imaginary part *)
  5360. Pass((operand.op)) (* real part *)
  5361. ELSE
  5362. (* pass complex as structure in order to comply with the variable alignment of its components *)
  5363. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5364. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  5365. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5366. tmp := sp;
  5367. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5368. Emit(Mov(position,tmp,operand.op)); (* real part *)
  5369. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  5370. IntermediateCode.AddOffset(tmp,size);
  5371. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  5372. END
  5373. END
  5374. ELSE
  5375. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5376. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  5377. Designate(expression,operand);
  5378. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  5379. (* stack allocation *)
  5380. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  5381. (*! parameter alignment to be discussed ... *)
  5382. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  5383. size := type(SyntaxTree.StringType).length;
  5384. END;
  5385. IF backend.cooperative & parameter.NeedsTrace() THEN
  5386. dst := NewRegisterOperand (addressType);
  5387. Emit(Mov(position,dst, sp));
  5388. IntermediateCode.InitImmediate(null, byteType, 0);
  5389. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  5390. ReleaseIntermediateOperand(dst);
  5391. SaveRegisters();ReleaseUsedRegisters(saved);
  5392. (* register dst has been freed before SaveRegisters already *)
  5393. CallAssignMethod(dst, operand.op, parameter.type);
  5394. RestoreRegisters(saved);
  5395. END;
  5396. IF operand.op.type.length > 1 THEN (* vector *)
  5397. MakeMemory(tmp,sp,operand.op.type,0);
  5398. Emit(Mov(position, tmp, operand.op));
  5399. ELSE
  5400. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5401. END;
  5402. ELSIF IsOpenArray(parameter.type) THEN
  5403. Designate(expression,operand);
  5404. baseReg := operand.tag;
  5405. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5406. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5407. END;
  5408. Pass((operand.op)); (* address of the array *)
  5409. ELSIF IsDelegate(parameter.type) THEN
  5410. Evaluate(expression,operand);
  5411. IF backend.cooperative & parameter.NeedsTrace() THEN
  5412. Emit(Push(position, nil));
  5413. dst := NewRegisterOperand (addressType);
  5414. Emit(Mov(position,dst, sp));
  5415. ReleaseIntermediateOperand(dst);
  5416. SaveRegisters();ReleaseUsedRegisters(saved);
  5417. Emit(Push(position, dst));
  5418. (* register dst has been freed before SaveRegisters already *)
  5419. Emit(Push(position, operand.tag));
  5420. CallThis(position,"GarbageCollector","Assign",2);
  5421. RestoreRegisters(saved);
  5422. ELSE
  5423. Pass((operand.tag));
  5424. END;
  5425. Pass((operand.op));
  5426. ELSE
  5427. Evaluate(expression,operand);
  5428. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5429. Emit(Push(position, nil));
  5430. dst := NewRegisterOperand (addressType);
  5431. Emit(Mov(position,dst, sp));
  5432. ReleaseIntermediateOperand(dst);
  5433. SaveRegisters();ReleaseUsedRegisters(saved);
  5434. Emit(Push(position, dst));
  5435. (* register dst has been freed before SaveRegisters already *)
  5436. Emit(Push(position, operand.op));
  5437. CallThis(position,"GarbageCollector","Assign",2);
  5438. RestoreRegisters(saved);
  5439. ELSE
  5440. Pass((operand.op));
  5441. END;
  5442. END;
  5443. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5444. Evaluate(expression,operand);
  5445. Pass((operand.op));
  5446. ELSE (* var parameter *)
  5447. Designate(expression,operand);
  5448. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5449. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5450. Pass((operand.tag));
  5451. END;
  5452. END;
  5453. Pass((operand.op));
  5454. END;
  5455. END;
  5456. (* TODO: needed? *)
  5457. arrayDestinationTag := oldArrayDestinationTag;
  5458. arrayDestinationDimension := oldArrayDestinationDimension;
  5459. IF needsParameterBackup THEN
  5460. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5461. ReuseCopy(parameterBackup, operand.op)
  5462. END;
  5463. ReleaseOperand(operand);
  5464. IF Trace THEN TraceExit("PushParameter") END;
  5465. END PushParameter;
  5466. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5467. BEGIN
  5468. IF (x.result # NIL) & ( x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  5469. Expression(x.result); (* use register *)
  5470. END;
  5471. Statement(x.statement);
  5472. IF x.result # NIL THEN Expression(x.result) END;
  5473. 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
  5474. ReleaseIntermediateOperand(result.op);
  5475. END;
  5476. END VisitStatementDesignator;
  5477. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5478. VAR
  5479. procedure: SyntaxTree.Procedure;
  5480. procedureType: SyntaxTree.ProcedureType;
  5481. wasInline: BOOLEAN;
  5482. actualParameters: SyntaxTree.ExpressionList;
  5483. formalParameter: SyntaxTree.Parameter;
  5484. actualParameter: SyntaxTree.Expression;
  5485. i: LONGINT;
  5486. localVariable: SyntaxTree.Variable;
  5487. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5488. src, dest: Operand;
  5489. prevInlineExit : Label;
  5490. prevMapper: SymbolMapper;
  5491. tooComplex: BOOLEAN;
  5492. resultDesignator: SyntaxTree.Expression;
  5493. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5494. BEGIN
  5495. IF e = NIL THEN RETURN TRUE
  5496. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5497. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5498. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5499. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5500. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5501. ELSE RETURN FALSE
  5502. END;
  5503. END SimpleExpression;
  5504. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5505. BEGIN
  5506. RETURN checker.CanPassInRegister(type)
  5507. END FitsInRegister;
  5508. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5509. VAR
  5510. variable: SyntaxTree.Variable;
  5511. variableDesignator: SyntaxTree.Designator;
  5512. BEGIN
  5513. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5514. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5515. variableDesignator.SetType(type);
  5516. RETURN variableDesignator
  5517. END GetTemp;
  5518. BEGIN
  5519. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5520. wasInline := currentIsInline;
  5521. prevInlineExit := currentInlineExit;
  5522. prevMapper := currentMapper;
  5523. currentInlineExit := NewLabel();
  5524. tooComplex := FALSE;
  5525. NEW(currentMapper);
  5526. currentIsInline := TRUE;
  5527. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5528. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5529. formalParameter := procedureType.firstParameter;
  5530. actualParameters := x.parameters;
  5531. i := 0;
  5532. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5533. actualParameter := actualParameters.GetExpression(i);
  5534. IF actualParameter.resolved # NIL THEN
  5535. actualParameter := actualParameter.resolved
  5536. END;
  5537. (*
  5538. if expression is simple and can be passed immediately
  5539. or if type fits in register then we can proceed
  5540. otherwise we escape to ordinary procedure call.
  5541. *)
  5542. (* cases where the expression can be mapped identically *)
  5543. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5544. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5545. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5546. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5547. (*
  5548. Assign(variableDesignator, actualParameter);
  5549. *)
  5550. Evaluate(actualParameter, src);
  5551. Designate(variableDesignator, dest);
  5552. Emit(Mov(x.position, dest.op, src.op));
  5553. ReleaseOperand(dest);
  5554. ReleaseOperand(src);
  5555. (* the src operand should now have been completely released ! *)
  5556. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5557. ELSE tooComplex := TRUE
  5558. END;
  5559. (*
  5560. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5561. currentMapper.Add(formalParameter, actualParameter, NIL);
  5562. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5563. variableDesignator := GetTemp(system.addressType, FALSE);
  5564. Designate(actualParameter, src);
  5565. Designate(variableDesignator, dest);
  5566. IntermediateCode.MakeMemory(dest.op,addressType);
  5567. Emit(Mov(x.position, dest.op, src.op));
  5568. ReleaseOperand(dest);
  5569. IF src.tag.mode # IntermediateCode.Undefined THEN
  5570. tagDesignator := GetTemp(system.addressType, FALSE);
  5571. Designate(tagDesignator, dest);
  5572. IntermediateCode.MakeMemory(dest.op,addressType);
  5573. Emit(Mov(x.position, dest.op, src.op));
  5574. END;
  5575. ReleaseOperand(dest); ReleaseOperand(src);
  5576. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5577. END;
  5578. *)
  5579. formalParameter := formalParameter.nextParameter;
  5580. INC(i);
  5581. END;
  5582. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5583. IF resultDesignator # NIL THEN
  5584. returnDesignator := resultDesignator
  5585. ELSE
  5586. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5587. END;
  5588. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5589. END;
  5590. localVariable := procedure.procedureScope.firstVariable;
  5591. WHILE ~tooComplex & (localVariable # NIL) DO
  5592. variableDesignator := GetTemp(localVariable.type, FALSE);
  5593. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5594. localVariable := localVariable.nextVariable;
  5595. END;
  5596. IF ~tooComplex THEN
  5597. VisitStatementBlock(procedure.procedureScope.body);
  5598. SetLabel(currentInlineExit);
  5599. IF procedureType.returnType # NIL THEN
  5600. Designate(returnDesignator, result);
  5601. END;
  5602. END;
  5603. currentMapper := prevMapper;
  5604. currentInlineExit := prevInlineExit;
  5605. currentIsInline := wasInline;
  5606. RETURN ~tooComplex
  5607. END InlineProcedureCall;
  5608. PROCEDURE VisitInlineCallDesignator*(x: SyntaxTree.InlineCallDesignator);
  5609. BEGIN
  5610. VisitStatementBlock(x.block);
  5611. END VisitInlineCallDesignator;
  5612. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5613. VAR
  5614. parameters: SyntaxTree.ExpressionList;
  5615. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5616. procedureType: SyntaxTree.ProcedureType;
  5617. formalParameter: SyntaxTree.Parameter;
  5618. operand: Operand;
  5619. reg, size, mask, dest: IntermediateCode.Operand;
  5620. saved,saved2: RegisterEntry;
  5621. symbol: SyntaxTree.Symbol;
  5622. variable: SyntaxTree.Variable;
  5623. i, parametersSize : LONGINT;
  5624. structuredReturnType: BOOLEAN;
  5625. gap, alignment: LONGINT; (*fld*)
  5626. return: IntermediateCode.Operand;
  5627. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5628. arg: IntermediateCode.Operand;
  5629. dummy: IntermediateCode.Operand;
  5630. recordType: SyntaxTree.RecordType;
  5631. operatorSelectionProcedureOperand: Operand;
  5632. operatorSelectionProcedure: SyntaxTree.Procedure;
  5633. fingerprint: SyntaxTree.Fingerprint;
  5634. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5635. identifierNumber: LONGINT;
  5636. parameterRegisters: SIZE;
  5637. registers: ARRAY 64 OF WORD;
  5638. procedure: SyntaxTree.Procedure;
  5639. callingConvention: SyntaxTree.CallingConvention;
  5640. type: IntermediateCode.Type;
  5641. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5642. (** do preparations before parameter push for array-structured object types (ASOTs):
  5643. if ASOT is passed as VAR parameter:
  5644. - allocate temporary variable of math array type
  5645. - copy contents of ASOT to be passed to temporary variable
  5646. - use temporary variable as the actual parameter instead
  5647. - 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)
  5648. **)
  5649. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5650. VAR
  5651. expression, left: SyntaxTree.Expression; tempVariableDesignator : SyntaxTree.Designator;
  5652. BEGIN
  5653. IF (formalParameter.kind = SyntaxTree.VarParameter) & SemanticChecker.IsIndexOperator(actualParameter) THEN
  5654. WITH actualParameter: SyntaxTree.ProcedureCallDesignator DO
  5655. (* prepare writeback for any other "normal" indexer *)
  5656. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5657. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5658. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5659. Assign(tempVariableDesignator, actualParameter);
  5660. IF firstWriteBackCall = NIL THEN
  5661. NEW(firstWriteBackCall);
  5662. currentWriteBackCall := firstWriteBackCall
  5663. ELSE
  5664. ASSERT(currentWriteBackCall # NIL);
  5665. NEW(currentWriteBackCall.next);
  5666. currentWriteBackCall := currentWriteBackCall.next
  5667. END;
  5668. (* a [^] . P[] ()*)
  5669. left := actualParameter.left; (* procedure call designator --> procedure call *)
  5670. left := left(SyntaxTree.Designator).left; (* procedure call --> caller object *)
  5671. IF left IS SyntaxTree.DereferenceDesignator THEN (* dereference, if required *)
  5672. left := left(SyntaxTree.Designator).left;
  5673. END;
  5674. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, left, 0, actualParameter.parameters, tempVariableDesignator);
  5675. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5676. END;
  5677. actualParameter := tempVariableDesignator;
  5678. END
  5679. END PrepareParameter;
  5680. BEGIN
  5681. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5682. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5683. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5684. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5685. IF InlineProcedureCall(x) THEN
  5686. RETURN
  5687. ELSE
  5688. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5689. END
  5690. END;
  5691. END;
  5692. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5693. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5694. callingConvention := procedureType.callingConvention;
  5695. dest := destination; destination := emptyOperand;
  5696. SaveRegisters();ReleaseUsedRegisters(saved);
  5697. parameters := x.parameters;
  5698. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5699. (* an operator is called *)
  5700. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5701. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5702. (* check if a dynamic operator call should be performed *)
  5703. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5704. ELSE
  5705. isCallOfDynamicOperator := FALSE
  5706. END;
  5707. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5708. Emit(Push(position, ap));
  5709. END;
  5710. alignment := procedureType.stackAlignment;
  5711. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5712. alignment := 16 (* bytes *);
  5713. END;
  5714. IF alignment > 1 THEN
  5715. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5716. Emit(Mov(position,reg, sp));
  5717. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5718. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5719. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5720. gap := 4*ToMemoryUnits(system,system.addressSize);
  5721. END;
  5722. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5723. backend.ResetParameterRegisters();
  5724. formalParameter := procedureType.firstParameter;
  5725. FOR i := 0 TO parameters.Length()-1 DO
  5726. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5727. type := addressType;
  5728. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5729. type := addressType;
  5730. ELSE
  5731. type := GetType(system, formalParameter.type);
  5732. END;
  5733. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5734. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5735. END;
  5736. formalParameter := formalParameter.nextParameter;
  5737. END;
  5738. IF gap < 0 THEN
  5739. gap := 0
  5740. END;
  5741. ELSE
  5742. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5743. END;
  5744. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5745. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5746. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5747. Emit(And(position,sp, sp, mask));
  5748. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5749. Emit(Push(position,reg));
  5750. ReleaseIntermediateOperand(reg);
  5751. END;
  5752. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5753. (* align stack to 16-byte boundary *)
  5754. IntermediateCode.InitImmediate(mask,addressType,-16);
  5755. Emit(And(position,sp, sp, mask));
  5756. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5757. IF gap # 0 THEN
  5758. IntermediateCode.InitImmediate(size,addressType,gap);
  5759. Emit(Sub(position,sp,sp,size))
  5760. END;
  5761. END;
  5762. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5763. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5764. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5765. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5766. ELSE
  5767. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5768. END;
  5769. IF procedureType.selfParameter # NIL THEN (* type bound procedure in a record *)
  5770. Designate(x.left(SyntaxTree.Designator).left, operand);
  5771. Emit(Push(position, operand.tag));
  5772. Emit(Push(position, operand.op));
  5773. Symbol(symbol, operand);
  5774. LoadValue(operand, symbol.type);
  5775. (*
  5776. PushParameter(x.left(SyntaxTree.Designator).left, procedureType.selfParameter, callingConvention, FALSE, dummy,-1);
  5777. Evaluate(x.left, operand);
  5778. *)
  5779. ELSE
  5780. Evaluate(x.left, operand);
  5781. IF symbol IS SyntaxTree.Procedure THEN
  5782. IF (procedureType.selfParameter # NIL) THEN
  5783. Emit(Push(position,operand.tag));
  5784. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5785. Emit(Push(position,operand.tag));
  5786. ELSIF (procedureType.isDelegate) THEN
  5787. Emit(Push(position,operand.tag));
  5788. END;
  5789. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5790. IF (procedureType.selfParameter # NIL) THEN
  5791. Emit(Push(position,operand.tag));
  5792. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5793. Emit(Push(position,operand.tag));
  5794. END;
  5795. ELSE HALT(200);
  5796. END;
  5797. END;
  5798. ReleaseIntermediateOperand(operand.tag);
  5799. operand.tag := emptyOperand;
  5800. (* determine if a structured return type is needed *)
  5801. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5802. IF structuredReturnType THEN
  5803. IF resultDesignator # NIL THEN
  5804. d := resultDesignator;
  5805. ELSE
  5806. (* temporary result that might be allocated, must potentially be traced *)
  5807. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5808. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5809. d.SetType(variable.type);
  5810. END;
  5811. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5812. Designate(d,returnValue);
  5813. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5814. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5815. Emit(Push(position,size));
  5816. Emit(Push(position,returnValue.op));
  5817. ReleaseOperand(returnValue);
  5818. ELSE*)
  5819. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5820. (*
  5821. END;
  5822. *)
  5823. END;
  5824. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5825. parameterRegisters := 0;
  5826. backend.ResetParameterRegisters();
  5827. formalParameter := procedureType.firstParameter;
  5828. FOR i := 0 TO parameters.Length()-1 DO
  5829. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5830. type := addressType;
  5831. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5832. type := addressType;
  5833. ELSE
  5834. type := GetType(system, formalParameter.type);
  5835. END;
  5836. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5837. INC(parameterRegisters);
  5838. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5839. Error(actualParameter.position,"cannot be passed by register")
  5840. END;
  5841. ELSE
  5842. registers[i] := -1;
  5843. END;
  5844. formalParameter := formalParameter.nextParameter;
  5845. END;
  5846. formalParameter := procedureType.lastParameter;
  5847. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5848. actualParameter := parameters.GetExpression(i);
  5849. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5850. formalParameter := formalParameter.prevParameter;
  5851. END;
  5852. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5853. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5854. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5855. END;
  5856. ELSE
  5857. hasDynamicOperands := FALSE;
  5858. formalParameter := procedureType.firstParameter;
  5859. FOR i := 0 TO parameters.Length() - 1 DO
  5860. actualParameter := parameters.GetExpression(i);
  5861. PrepareParameter(actualParameter, formalParameter);
  5862. IF formalParameter # NIL THEN (* TENTATIVE *)
  5863. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5864. ASSERT(i < 2);
  5865. hasDynamicOperands := TRUE;
  5866. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5867. ELSE
  5868. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5869. END;
  5870. formalParameter := formalParameter.nextParameter;
  5871. END;
  5872. END;
  5873. END;
  5874. IF symbol IS SyntaxTree.Procedure THEN
  5875. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5876. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5877. Emit(Push(position,reg));
  5878. ReleaseIntermediateOperand(reg);
  5879. END;
  5880. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5881. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5882. parametersSize := ParametersSize(system,procedureType, FALSE);
  5883. END;
  5884. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5885. (*
  5886. dynamic operator overloading:
  5887. first push parameters, regularly:
  5888. [self]
  5889. par1
  5890. par2
  5891. then push parameters for GetOperator
  5892. identifier
  5893. ptr1
  5894. tag
  5895. ptr2
  5896. tag
  5897. call GetOperatorRuntimeProc
  5898. call Operator
  5899. *)
  5900. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5901. (* push ID *)
  5902. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5903. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5904. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5905. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5906. formalParameter := procedureType.firstParameter;
  5907. FOR i := 0 TO parameters.Length() - 1 DO
  5908. IF formalParameter.access # SyntaxTree.Hidden THEN
  5909. ASSERT(i < 2);
  5910. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5911. (* push pointer *)
  5912. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5913. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5914. (* add dereference *)
  5915. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5916. (*! better: do refer to stack above than using parameter backups !!*)
  5917. ReleaseIntermediateOperand(parameterBackups[i]);
  5918. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5919. END;
  5920. Emit(Push(position,parameterBackups[i]));
  5921. ReleaseIntermediateOperand(parameterBackups[i]);
  5922. (* push typetag *)
  5923. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5924. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5925. arg := TypeDescriptorAdr(recordType);
  5926. Emit(Push(position,arg));
  5927. ELSE
  5928. (* push 'NonPointer' *)
  5929. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5930. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5931. (* push fingerprint *)
  5932. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5933. fingerprint := fingerprinter.TypeFP(formalParameter.type.resolved);
  5934. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.hugeintType), fingerprint.public))) (* TODO: push the type's fingerprint *)
  5935. END
  5936. END;
  5937. formalParameter := formalParameter.nextParameter
  5938. END;
  5939. (* for unary operators: complete the information for the second parameter *)
  5940. IF procedureType.numberParameters < 2 THEN
  5941. (* push 'NonPointer' *)
  5942. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5943. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5944. (* push 'NoType' *)
  5945. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5946. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5947. END;
  5948. (* call operator selection procedure *)
  5949. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5950. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5951. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5952. ReleaseOperand(operatorSelectionProcedureOperand);
  5953. (* use the address that the operator selection procedure returned as the target address of the call *)
  5954. InitOperand(operand, ModeValue);
  5955. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5956. Emit(Result(position,operand.op))
  5957. END
  5958. END;
  5959. ReleaseParameterRegisters();
  5960. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5961. SaveRegisters();ReleaseUsedRegisters(saved2);
  5962. CallThis(position,"Objects","LeaveA2",0);
  5963. RestoreRegisters(saved2);
  5964. END;
  5965. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5966. Emit(Call(position,operand.op,0));
  5967. ELSE
  5968. Emit(Call(position,operand.op,parametersSize));
  5969. END;
  5970. ReleaseOperand(operand);
  5971. IF procedureType.noReturn THEN
  5972. EmitTrap(position,NoReturnTrap);
  5973. END;
  5974. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5975. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5976. Emit(Result(position,return));
  5977. END;
  5978. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5979. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5980. Emit(Push(position, return));
  5981. CallThis(position,"Objects","ReenterA2",0);
  5982. Emit(Pop(position, return));
  5983. ELSE
  5984. CallThis(position,"Objects","ReenterA2",0);
  5985. END;
  5986. END;
  5987. (* === return parameter space === *)
  5988. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5989. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5990. (* cleanup all space for all parameters *)
  5991. IF parametersSize < 32 THEN
  5992. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5993. parametersSize := 32
  5994. END;
  5995. size := IntermediateCode.Immediate(addressType,parametersSize);
  5996. Emit(Add(position,sp,sp,size))
  5997. END;
  5998. IF (callingConvention IN SysvABI) THEN
  5999. IF parameterRegisters > 0 THEN
  6000. IF parameters.Length() > parameterRegisters THEN
  6001. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  6002. ELSE
  6003. parametersSize := 0
  6004. END;
  6005. ELSE
  6006. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  6007. INC( parametersSize, (-parametersSize) MOD 16 )
  6008. END;
  6009. IF parametersSize > 0 THEN
  6010. size := IntermediateCode.Immediate(addressType,parametersSize);
  6011. Emit(Add(position,sp,sp,size))
  6012. END;
  6013. END;
  6014. IF alignment > 1 THEN
  6015. Emit(Pop(position,sp));
  6016. END;
  6017. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  6018. Emit(Pop(position, ap));
  6019. END;
  6020. IF firstWriteBackCall # NIL THEN
  6021. SaveRegisters(); ReleaseUsedRegisters(saved2);
  6022. (* perform all write-back calls in the list *)
  6023. currentWriteBackCall := firstWriteBackCall;
  6024. WHILE currentWriteBackCall # NIL DO
  6025. VisitProcedureCallDesignator(currentWriteBackCall.call);
  6026. currentWriteBackCall := currentWriteBackCall.next
  6027. END;
  6028. RestoreRegisters(saved2);
  6029. END;
  6030. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  6031. IF structuredReturnType THEN
  6032. RestoreRegisters(saved);
  6033. InitOperand(result,ModeReference);
  6034. Symbol(variable,result);
  6035. ELSE
  6036. RestoreRegisters(saved);
  6037. InitOperand(result,ModeValue);
  6038. result.op := return;
  6039. END;
  6040. END;
  6041. destination := dest;
  6042. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  6043. END VisitProcedureCallDesignator;
  6044. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  6045. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  6046. td: SyntaxTree.Symbol;
  6047. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  6048. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6049. BEGIN
  6050. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6051. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6052. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6053. variable.SetType(system.anyType);
  6054. scope.AddVariable(variable);
  6055. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6056. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  6057. typeDeclaration.SetDeclaredType(hiddenPointerType);
  6058. typeDeclaration.SetScope(module.module.moduleScope);
  6059. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  6060. hiddenPointerType.SetState(SyntaxTree.Resolved);
  6061. END;
  6062. RETURN hiddenPointerType;
  6063. END GetHiddenPointerType;
  6064. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  6065. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6066. BEGIN
  6067. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6068. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6069. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  6070. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  6071. scope.AddVariable(variable);
  6072. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6073. variable.SetType(system.anyType);
  6074. scope.AddVariable(variable);
  6075. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6076. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  6077. typeDeclaration.SetDeclaredType(delegatePointerType);
  6078. typeDeclaration.SetScope(module.module.moduleScope);
  6079. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  6080. delegatePointerType.SetState(SyntaxTree.Resolved);
  6081. END;
  6082. RETURN delegatePointerType
  6083. END GetDelegateType;
  6084. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  6085. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  6086. such as in VAR a: RECORD ... END;
  6087. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  6088. and variables, constants and procedures the same mechanism can be used for fixups etc.
  6089. *)
  6090. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  6091. baseRecord: SyntaxTree.RecordType;
  6092. BEGIN (* no code emission *)
  6093. source := NIL;
  6094. x := x.resolved;
  6095. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  6096. x := GetHiddenPointerType();
  6097. ELSIF IsDelegate(x) THEN
  6098. x := GetDelegateType();
  6099. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  6100. ELSE HALT(200);
  6101. END;
  6102. td := x.typeDeclaration;
  6103. IF td = NIL THEN
  6104. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  6105. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  6106. ASSERT(td # NIL);
  6107. END;
  6108. GetCodeSectionNameForSymbol(td,name);
  6109. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  6110. meta.CheckTypeDeclaration(x);
  6111. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  6112. ELSE
  6113. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  6114. END;
  6115. IF backend.cooperative OR meta.simple THEN
  6116. offset := 0;
  6117. ELSE
  6118. IF x IS SyntaxTree.CellType THEN
  6119. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  6120. IF baseRecord = NIL THEN
  6121. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  6122. ELSE
  6123. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  6124. END;
  6125. ELSE
  6126. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  6127. END;
  6128. END;
  6129. RETURN td
  6130. END GetBackendType;
  6131. BEGIN
  6132. (*td := t.typeDeclaration;*)
  6133. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  6134. (*
  6135. IF t IS SyntaxTree.PointerType THEN
  6136. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  6137. ELSE
  6138. source := GetBackendType(t);
  6139. END;
  6140. *)
  6141. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  6142. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  6143. IntermediateCode.SetOffset(res,offset);
  6144. (*
  6145. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  6146. make memory should be used when tag is used, not earlier
  6147. *)
  6148. RETURN res
  6149. END TypeDescriptorAdr;
  6150. (*
  6151. PROCEDURE MakeTypeTag(VAR operand: Operand);
  6152. VAR result: IntermediateCode.Operand;
  6153. BEGIN
  6154. IF operand.tag.mode = IntermediateCode.Undefined THEN
  6155. operand.tag := TypeDescriptorAdr(operand.type);
  6156. IntermediateCode.MakeMemory(operand.tag,addressType);
  6157. UseIntermediateOperand(operand.tag);
  6158. END;
  6159. END MakeTypeTag;
  6160. *)
  6161. PROCEDURE ProfilerInit;
  6162. VAR reg: IntermediateCode.Operand;
  6163. BEGIN
  6164. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  6165. Emit(Call(position,reg,0));
  6166. END ProfilerInit;
  6167. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  6168. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  6169. BEGIN
  6170. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  6171. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  6172. THEN
  6173. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6174. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6175. Emit(Push(position,reg));
  6176. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6177. Emit(Push(position,reg));
  6178. StaticCallOperand(result,procedure);
  6179. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6180. ReleaseOperand(result);
  6181. END;
  6182. END ProfilerEnterExit;
  6183. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  6184. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  6185. BEGIN
  6186. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  6187. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6188. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6189. profileInit.Emit(Push(position,reg));
  6190. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6191. profileInit.Emit(Push(position,reg));
  6192. NEW(string, LEN(name)); COPY(name, string^);
  6193. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6194. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6195. sv.SetType(type);
  6196. Designate(sv,result);
  6197. profileInit.Emit(Push(position,result.tag));
  6198. profileInit.Emit(Push(position,result.op));
  6199. StaticCallOperand(result,procedure);
  6200. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6201. ReleaseOperand(result);
  6202. END;
  6203. END ProfilerAddProcedure;
  6204. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  6205. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  6206. BEGIN
  6207. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  6208. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6209. profileInit.Emit(Push(position,reg));
  6210. profileInitPatchPosition := profileInit.pc;
  6211. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  6212. NEW(string, LEN(name)); COPY(name, string^);
  6213. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  6214. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6215. sv.SetType(type);
  6216. Designate(sv,result);
  6217. profileInit.Emit(Push(position,result.tag));
  6218. profileInit.Emit(Push(position,result.op));
  6219. StaticCallOperand(result,procedure);
  6220. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6221. ReleaseOperand(result);
  6222. END;
  6223. END ProfilerAddModule;
  6224. PROCEDURE ProfilerPatchInit;
  6225. VAR reg: IntermediateCode.Operand;
  6226. BEGIN
  6227. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  6228. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  6229. EmitLeave(profileInit,position,NIL,0);
  6230. profileInit.Emit(Exit(position,0,0,0));
  6231. END ProfilerPatchInit;
  6232. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  6233. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  6234. VAR
  6235. id: LONGINT;
  6236. leftType, rightType: SyntaxTree.Type;
  6237. procedureType: SyntaxTree.ProcedureType;
  6238. runtimeProcedure: SyntaxTree.Procedure;
  6239. runtimeProcedureOperand, operatorOperand: Operand;
  6240. kind: SET;
  6241. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  6242. VAR
  6243. arg: IntermediateCode.Operand;
  6244. recordType: SyntaxTree.RecordType;
  6245. fingerprint: SyntaxTree.Fingerprint;
  6246. BEGIN
  6247. IF type = NIL THEN
  6248. (* no type: push 'NoType' *)
  6249. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6250. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  6251. ELSIF IsStrictlyPointerToRecord(type) THEN
  6252. (* pointer to record type: push typetag *)
  6253. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6254. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6255. arg := TypeDescriptorAdr(recordType);
  6256. ELSE
  6257. (* non-pointer to record type: push fingerprint *)
  6258. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6259. fingerprint := fingerprinter.TypeFP(type.resolved);
  6260. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.hugeintType), fingerprint.public)
  6261. END;
  6262. operatorInitializationCodeSection.Emit(Push(position,arg))
  6263. END PushTypeInfo;
  6264. BEGIN
  6265. ASSERT(operatorInitializationCodeSection # NIL);
  6266. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  6267. procedureType := operator.type(SyntaxTree.ProcedureType);
  6268. (* determine types *)
  6269. leftType := procedureType.firstParameter.type;
  6270. IF procedureType.numberParameters = 2 THEN
  6271. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  6272. rightType := procedureType.firstParameter.nextParameter.type;
  6273. ELSE
  6274. rightType := NIL
  6275. END;
  6276. (* determine operator kind *)
  6277. IF IsStrictlyPointerToRecord(leftType) THEN
  6278. kind := {LhsIsPointer}
  6279. ELSE
  6280. kind := {}
  6281. END;
  6282. IF IsStrictlyPointerToRecord(rightType) THEN
  6283. kind := kind + {RhsIsPointer}
  6284. END;
  6285. IF kind # {} THEN (* TODO: to be removed later on *)
  6286. (* at least one of the types is a pointer to record *)
  6287. (* emit a code that registers this specific operator in the runtime *)
  6288. dump := operatorInitializationCodeSection.comments;
  6289. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6290. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  6291. (* push ID *)
  6292. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6293. id := Global.GetSymbol(module.module.case, operator.name);
  6294. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  6295. (* push kind *)
  6296. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6297. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  6298. (* push type infos *)
  6299. PushTypeInfo(leftType);
  6300. PushTypeInfo(rightType);
  6301. (* push operator address *)
  6302. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6303. StaticCallOperand(operatorOperand, operator);
  6304. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  6305. ReleaseOperand(operatorOperand);
  6306. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  6307. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  6308. ReleaseOperand(runtimeProcedureOperand)
  6309. END
  6310. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  6311. END
  6312. END RegisterDynamicOperator;
  6313. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  6314. VAR
  6315. traceModule: SyntaxTree.Module;
  6316. procedure: SyntaxTree.Procedure;
  6317. procedureVariable: SyntaxTree.Variable;
  6318. s,msg: Basic.MessageString;
  6319. res: Operand;
  6320. i: LONGINT;
  6321. sv: SyntaxTree.StringValue;
  6322. type: SyntaxTree.Type;
  6323. recordType: SyntaxTree.RecordType;
  6324. printout: Printout.Printer;
  6325. stringWriter: Streams.StringWriter;
  6326. expression: SyntaxTree.Expression;
  6327. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  6328. BEGIN
  6329. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  6330. IF procedure = NIL THEN
  6331. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  6332. END;
  6333. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  6334. s := "procedure ";
  6335. Strings.Append(s,backend.traceModuleName);
  6336. Strings.Append(s,".");
  6337. Strings.Append(s,procedureName);
  6338. Strings.Append(s," not present");
  6339. Error(position,s);
  6340. RETURN FALSE
  6341. ELSE
  6342. RETURN TRUE
  6343. END;
  6344. END GetProcedure;
  6345. PROCEDURE CallProcedure;
  6346. VAR size: LONGINT;
  6347. BEGIN
  6348. IF procedure # NIL THEN
  6349. StaticCallOperand(result,procedure);
  6350. size := ProcParametersSize(procedure);
  6351. ELSE
  6352. Symbol(procedureVariable, result);
  6353. LoadValue(result, procedureVariable.type.resolved);
  6354. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6355. END;
  6356. Emit(Call(position,result.op,size));
  6357. END CallProcedure;
  6358. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6359. VAR res: Operand; string: SyntaxTree.String;
  6360. BEGIN
  6361. IF GetProcedure("String") THEN
  6362. NEW(string, LEN(s)); COPY(s, string^);
  6363. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6364. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6365. sv.SetType(type);
  6366. Designate(sv,res);
  6367. Emit(Push(position,res.tag));
  6368. Emit(Push(position,res.op));
  6369. ReleaseOperand(res);
  6370. CallProcedure;
  6371. END;
  6372. END String;
  6373. PROCEDURE Integer(op: IntermediateCode.Operand);
  6374. BEGIN
  6375. IF GetProcedure("Int") THEN
  6376. Emit(Push(position,op));
  6377. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6378. CallProcedure;
  6379. END;
  6380. END Integer;
  6381. PROCEDURE Float(op: IntermediateCode.Operand);
  6382. BEGIN
  6383. IF GetProcedure("HIntHex") THEN
  6384. Emit(Push(position,op));
  6385. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6386. CallProcedure;
  6387. END;
  6388. END Float;
  6389. PROCEDURE Set(op: IntermediateCode.Operand);
  6390. BEGIN
  6391. IF GetProcedure("Set") THEN
  6392. Emit(Push(position,op));
  6393. (*
  6394. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6395. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6396. *)
  6397. CallProcedure;
  6398. END;
  6399. END Set;
  6400. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6401. BEGIN
  6402. IF GetProcedure("Boolean") THEN
  6403. Emit(Push(position,op));
  6404. CallProcedure;
  6405. END;
  6406. END Boolean;
  6407. PROCEDURE Char(op: IntermediateCode.Operand);
  6408. BEGIN
  6409. IF GetProcedure("Char") THEN
  6410. Emit(Push(position,op));
  6411. CallProcedure;
  6412. END;
  6413. END Char;
  6414. PROCEDURE Address(op: IntermediateCode.Operand);
  6415. BEGIN
  6416. IF GetProcedure("Address") THEN
  6417. Emit(Push(position,op));
  6418. CallProcedure;
  6419. END;
  6420. END Address;
  6421. PROCEDURE Size(op: IntermediateCode.Operand);
  6422. BEGIN
  6423. IF GetProcedure("Size") THEN
  6424. Emit(Push(position,op));
  6425. CallProcedure;
  6426. END;
  6427. END Size;
  6428. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6429. VAR len: IntermediateCode.Operand;
  6430. BEGIN
  6431. IF GetProcedure("String") THEN
  6432. len := GetArrayLength(type, op.tag);
  6433. Emit(Push(position,len));
  6434. ReleaseIntermediateOperand(len);
  6435. Emit(Push(position,op.op));
  6436. CallProcedure;
  6437. END;
  6438. END StringOperand;
  6439. PROCEDURE Ln;
  6440. BEGIN
  6441. IF GetProcedure("Ln") THEN
  6442. CallProcedure;
  6443. END;
  6444. END Ln;
  6445. BEGIN
  6446. IF backend.traceModuleName = "" THEN RETURN END;
  6447. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6448. IF GetProcedure("Enter") THEN
  6449. CallProcedure
  6450. END;
  6451. NEW(stringWriter,LEN(s));
  6452. FOR i := 0 TO x.Length()-1 DO
  6453. msg := "";
  6454. expression := x.GetExpression(i);
  6455. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6456. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6457. ELSE
  6458. Global.GetModuleName(module.module, s);
  6459. END;
  6460. IF i = 0 THEN
  6461. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6462. stringWriter.String(":");
  6463. END;
  6464. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6465. IF ~(expression IS SyntaxTree.StringValue) THEN
  6466. printout.Expression(expression);
  6467. stringWriter.Get(s);
  6468. Strings.Append(msg,s);
  6469. Strings.Append(msg,"= ");
  6470. ELSE stringWriter.Get(s); (* remove from string writer *)
  6471. Strings.Append(msg, s);
  6472. END;
  6473. String(msg);
  6474. IF SemanticChecker.IsStringType(expression.type) THEN
  6475. Designate(expression,res);
  6476. StringOperand(res, expression.type);
  6477. ELSE
  6478. Evaluate(expression,res);
  6479. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6480. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6481. Convert(res.op,int64);
  6482. END;
  6483. Integer(res.op);
  6484. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6485. Boolean(res.op);
  6486. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6487. Set(res.op);
  6488. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6489. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6490. Convert(res.op,float64);
  6491. END;
  6492. Float(res.op);
  6493. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6494. Char(res.op);
  6495. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6496. Address(res.op);String("H");
  6497. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6498. Size(res.op);
  6499. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6500. Address(res.op);String("H");
  6501. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6502. Address(res.op);String("H");
  6503. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6504. String("NIL");
  6505. ELSE HALT(200);
  6506. END;
  6507. END;
  6508. ReleaseOperand(res);
  6509. String("; ");
  6510. END;
  6511. IF GetProcedure("Exit") THEN
  6512. CallProcedure
  6513. ELSE
  6514. Ln;
  6515. END;
  6516. END;
  6517. END SystemTrace;
  6518. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6519. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6520. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6521. BEGIN
  6522. type := type.resolved;
  6523. IF type IS SyntaxTree.RecordType THEN
  6524. WITH type: SyntaxTree.RecordType DO
  6525. baseType := type.baseType;
  6526. IF baseType # NIL THEN
  6527. baseType := baseType.resolved;
  6528. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6529. InitFields(baseType,adr,offset);
  6530. END;
  6531. variable := type.recordScope.firstVariable;
  6532. WHILE variable # NIL DO
  6533. IF variable.initializer # NIL THEN
  6534. Evaluate(variable.initializer,initializerOp);
  6535. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6536. Emit(Mov(position,mem,initializerOp.op));
  6537. ReleaseOperand(initializerOp);
  6538. ReleaseIntermediateOperand(mem);
  6539. END;
  6540. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6541. variable := variable.nextVariable
  6542. END;
  6543. END;
  6544. ELSIF type IS SyntaxTree.CellType THEN
  6545. WITH type: SyntaxTree.CellType DO
  6546. baseType := type.baseType;
  6547. IF baseType # NIL THEN
  6548. baseType := baseType.resolved;
  6549. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6550. InitFields(baseType,adr,offset);
  6551. END;
  6552. variable := type.cellScope.firstVariable;
  6553. WHILE variable # NIL DO
  6554. IF variable.initializer # NIL THEN
  6555. Evaluate(variable.initializer,initializerOp);
  6556. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6557. Emit(Mov(position,mem,initializerOp.op));
  6558. ReleaseOperand(initializerOp);
  6559. ReleaseIntermediateOperand(mem);
  6560. END;
  6561. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6562. variable := variable.nextVariable
  6563. END;
  6564. END;
  6565. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6566. WITH type: SyntaxTree.ArrayType DO
  6567. IF type.form = SyntaxTree.Static THEN
  6568. baseType := type.arrayBase;
  6569. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6570. FOR i := 0 TO type.staticLength-1 DO
  6571. InitFields(baseType,adr,offset+i*size);
  6572. END;
  6573. END;
  6574. END;
  6575. ELSIF type IS SyntaxTree.MathArrayType THEN
  6576. WITH type: SyntaxTree.MathArrayType DO
  6577. IF type.form = SyntaxTree.Open THEN
  6578. dim := DynamicDim(type);
  6579. imm := IntermediateCode.Immediate(addressType,dim);
  6580. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6581. baseType := SemanticChecker.ArrayBase(type,dim);
  6582. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6583. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6584. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6585. ReleaseIntermediateOperand(imm);
  6586. (* flags remain empty (=0) for open array *)
  6587. ELSIF type.form = SyntaxTree.Static THEN
  6588. baseType := type.arrayBase;
  6589. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6590. ASSERT(type.staticLength < 1024*1024*1024);
  6591. FOR i := 0 TO type.staticLength-1 DO
  6592. InitFields(baseType,adr,offset+i*size);
  6593. END;
  6594. END;
  6595. END;
  6596. END;
  6597. END InitFields;
  6598. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6599. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6600. saved: RegisterEntry;
  6601. BEGIN
  6602. type := variable.type.resolved;
  6603. IF (type IS SyntaxTree.MathArrayType) THEN
  6604. WITH type: SyntaxTree.MathArrayType DO
  6605. IF type.form = SyntaxTree.Open THEN
  6606. Symbol(variable,operand);
  6607. InitFields(type, operand.tag,0);
  6608. IF temporary THEN
  6609. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6610. END;
  6611. ELSIF type.form = SyntaxTree.Tensor THEN
  6612. IF temporary & backend.writeBarriers THEN
  6613. SaveRegisters();ReleaseUsedRegisters(saved);
  6614. Symbol(variable, operand);
  6615. Emit(Push(position,operand.op));
  6616. ReleaseOperand(operand);
  6617. Emit(Push(position,nil));
  6618. CallThis(position,"FoxArrayBase","Assign",2);
  6619. RestoreRegisters(saved);
  6620. ELSE
  6621. Symbol(variable, operand);
  6622. MakeMemory(tmp,operand.op,addressType,0);
  6623. ReleaseOperand(operand);
  6624. IF FALSE & temporary THEN
  6625. (* trick -- temporary object from array base *)
  6626. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6627. Symbol(symbol,operand);
  6628. MakeMemory(mem,operand.op,addressType,0);
  6629. ReleaseOperand(operand);
  6630. Emit(Mov(position,tmp, mem) );
  6631. ReleaseOperand(operand);
  6632. ELSE
  6633. Emit(Mov(position,tmp, nil ) );
  6634. END;
  6635. ReleaseIntermediateOperand(tmp)
  6636. END;
  6637. END;
  6638. END;
  6639. ELSE
  6640. Symbol(variable,operand);
  6641. IF variable.initializer # NIL THEN
  6642. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6643. reference.SetType(variable.type.resolved);
  6644. reference.SetAssignable(TRUE);
  6645. Assign(reference,variable.initializer);
  6646. ELSIF temporary THEN
  6647. IF SemanticChecker.IsPointerType(variable.type) THEN
  6648. IF backend.cooperative THEN
  6649. SaveRegisters();ReleaseUsedRegisters(saved);
  6650. Symbol(variable, operand);
  6651. CallAssignPointer(operand.op, nil);
  6652. ReleaseOperand(operand);
  6653. RestoreRegisters(saved);
  6654. ELSIF backend.writeBarriers THEN
  6655. SaveRegisters();ReleaseUsedRegisters(saved);
  6656. Symbol(variable, operand);
  6657. Emit(Push(position,operand.op));
  6658. ReleaseOperand(operand);
  6659. Emit(Push(position,nil));
  6660. CallThis(position,"Heaps","Assign",2);
  6661. RestoreRegisters(saved);
  6662. ELSE
  6663. Symbol(variable, operand);
  6664. MakeMemory(tmp,operand.op,addressType,0);
  6665. ReleaseOperand(operand);
  6666. Emit(Mov(position,tmp, nil ) );
  6667. ReleaseIntermediateOperand(tmp);
  6668. END;
  6669. END;
  6670. END;
  6671. InitFields(type, operand.op,0);
  6672. ReleaseOperand(operand);
  6673. END;
  6674. END InitVariable;
  6675. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6676. VAR end: Label;
  6677. BEGIN
  6678. IF type.form = SyntaxTree.Tensor THEN
  6679. InitOperand(result,ModeValue);
  6680. ReuseCopy(result.op,base);
  6681. end := NewLabel();
  6682. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6683. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6684. SetLabel(end);
  6685. Convert(result.op,lenType);
  6686. ELSE
  6687. InitOperand(result,ModeValue);
  6688. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6689. END
  6690. END MathArrayDim;
  6691. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6692. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6693. BEGIN
  6694. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6695. MakeMemory(mem,base,addressType,offset);
  6696. Emit(Mov(position,mem,value));
  6697. ReleaseIntermediateOperand(mem);
  6698. END PutMathArrayField;
  6699. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6700. VAR mem: IntermediateCode.Operand;
  6701. BEGIN
  6702. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6703. MakeMemory(mem,base,addressType,offset);
  6704. Emit(Mov(position,mem,value));
  6705. ReleaseIntermediateOperand(mem);
  6706. END PutMathArrayFieldOffset;
  6707. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6708. BEGIN
  6709. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6710. MakeMemory(value,base,addressType,offset);
  6711. END GetMathArrayField;
  6712. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6713. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6714. BEGIN
  6715. IF incr THEN
  6716. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6717. ELSE
  6718. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6719. END;
  6720. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6721. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6722. ELSE
  6723. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6724. Emit(Mov(position,reg,dim));
  6725. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6726. Emit(Add(position,reg,reg,base));
  6727. MakeMemory(mem, reg, addressType, offset);
  6728. ReleaseIntermediateOperand(reg);
  6729. Emit(Mov(position,mem,value));
  6730. ReleaseIntermediateOperand(mem);
  6731. END;
  6732. END PutMathArrayLenOrIncr;
  6733. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6734. BEGIN
  6735. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6736. END PutMathArrayLength;
  6737. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6738. BEGIN
  6739. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6740. END PutMathArrayIncrement;
  6741. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6742. BEGIN
  6743. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6744. END GetMathArrayIncrement;
  6745. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6746. BEGIN
  6747. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6748. END GetMathArrayLength;
  6749. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6750. VAR dimOp: IntermediateCode.Operand;
  6751. BEGIN
  6752. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6753. GetMathArrayLength(type, operand, dimOp, check, result);
  6754. END GetMathArrayLengthAt;
  6755. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6756. VAR dimOp: IntermediateCode.Operand;
  6757. BEGIN
  6758. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6759. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6760. END GetMathArrayIncrementAt;
  6761. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6762. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6763. offset: LONGINT;
  6764. BEGIN
  6765. IF increment THEN
  6766. offset := MathIncrOffset;
  6767. ELSE
  6768. offset := MathLenOffset;
  6769. END;
  6770. INC(offset,operand.dimOffset*2);
  6771. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6772. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6773. END;
  6774. (* static dimension *)
  6775. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6776. IF check & (type.form = SyntaxTree.Tensor) THEN
  6777. DimensionCheck(operand.tag,dim,BrltL);
  6778. END;
  6779. val := SHORT(dim.intValue);
  6780. IF type.form # SyntaxTree.Tensor THEN
  6781. t := SemanticChecker.ArrayBase(type,val);
  6782. type := t.resolved(SyntaxTree.MathArrayType);
  6783. IF type.form = SyntaxTree.Static THEN
  6784. IF increment THEN
  6785. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6786. ELSE
  6787. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6788. END;
  6789. InitOperand(result,ModeValue);
  6790. result.op := res;
  6791. RETURN;
  6792. END;
  6793. END;
  6794. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6795. MakeMemory(res,operand.tag,addressType,offset);
  6796. (*
  6797. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6798. *)
  6799. InitOperand(result,ModeValue);
  6800. result.op := res;
  6801. ELSE
  6802. Convert(dim,addressType);
  6803. IF check THEN
  6804. IF type.form = SyntaxTree.Tensor THEN
  6805. DimensionCheck(operand.tag,dim,BrltL);
  6806. ELSIF isUnchecked THEN (* do nothing *)
  6807. ELSE
  6808. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6809. END;
  6810. END;
  6811. end := NewLabel(); next := NIL;
  6812. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6813. Emit(Mov(position,res,dim));
  6814. Convert(res,sizeType);
  6815. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6816. WHILE t IS SyntaxTree.MathArrayType DO
  6817. type := t(SyntaxTree.MathArrayType);
  6818. IF type.form = SyntaxTree.Static THEN
  6819. imm := IntermediateCode.Immediate(sizeType,val);
  6820. next := NewLabel();
  6821. BrneL(next,imm,res);
  6822. IF increment THEN
  6823. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6824. ELSE
  6825. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6826. END;
  6827. Emit(MovReplace(position,res,imm));
  6828. BrL(end);
  6829. ELSE hasDynamicPart := TRUE;
  6830. END;
  6831. t := type.arrayBase.resolved;
  6832. val := val + 1;
  6833. IF next # NIL THEN SetLabel(next) END;
  6834. END;
  6835. IF hasDynamicPart THEN
  6836. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6837. Emit(Mov(position,res2,dim));
  6838. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6839. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6840. Emit(Add(position,res2,res2,imm));
  6841. Emit(Add(position,res2,res2,operand.tag));
  6842. IntermediateCode.MakeMemory(res2,sizeType);
  6843. Emit(MovReplace(position,res,res2));
  6844. ReleaseIntermediateOperand(res2);
  6845. END;
  6846. SetLabel(end);
  6847. Convert(res,sizeType);
  6848. InitOperand(result,ModeValue);
  6849. result.op := res;
  6850. END;
  6851. END MathArrayLenOrIncr;
  6852. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6853. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6854. offset: LONGINT;
  6855. BEGIN
  6856. offset := operand.dimOffset+DynamicDim(type)-1;
  6857. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6858. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6859. val := SHORT(dim.intValue);
  6860. t := SemanticChecker.ArrayBase(type,val);
  6861. type := t.resolved(SyntaxTree.ArrayType);
  6862. IF type.form = SyntaxTree.Static THEN
  6863. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6864. ELSE
  6865. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6866. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6867. END;
  6868. UseIntermediateOperand(res);
  6869. InitOperand(result,ModeValue);
  6870. result.op := res;
  6871. ELSE
  6872. Convert(dim,addressType);
  6873. IF ~isUnchecked THEN
  6874. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6875. END;
  6876. end := NewLabel(); next := NIL;
  6877. (* ReuseCopy(dim,res); *)
  6878. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6879. Emit(Mov(position,res,dim));
  6880. Convert(res,sizeType);
  6881. Convert(res,sizeType);
  6882. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6883. WHILE t IS SyntaxTree.ArrayType DO
  6884. type := t(SyntaxTree.ArrayType);
  6885. IF type.form = SyntaxTree.Static THEN
  6886. imm := IntermediateCode.Immediate(sizeType,val);
  6887. next := NewLabel();
  6888. BrneL(next,imm,res);
  6889. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6890. Emit(MovReplace(position,res,imm));
  6891. BrL(end);
  6892. ELSE hasDynamicPart := TRUE;
  6893. END;
  6894. t := type.arrayBase.resolved;
  6895. val := val + 1;
  6896. IF next # NIL THEN SetLabel(next) END;
  6897. END;
  6898. IF hasDynamicPart THEN
  6899. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6900. Convert(res2,addressType);
  6901. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6902. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6903. Emit(Sub(position,res2,imm,res2));
  6904. Emit(Add(position,res2,res2,operand.tag));
  6905. IntermediateCode.MakeMemory(res2,sizeType);
  6906. Emit(MovReplace(position,res,res2));
  6907. ReleaseIntermediateOperand(res2);
  6908. END;
  6909. SetLabel(end);
  6910. Convert(res,sizeType);
  6911. InitOperand(result,ModeValue);
  6912. result.op := res;
  6913. END;
  6914. END ArrayLen;
  6915. (**
  6916. create a temporary variable in current scope
  6917. **)
  6918. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6919. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6920. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6921. BEGIN
  6922. IF ~register THEN
  6923. v := temporaries.GetFreeVariable(type, untraced, index);
  6924. ELSE
  6925. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6926. END;
  6927. scope := currentScope;
  6928. IF (scope IS SyntaxTree.ProcedureScope) & (scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).noPAF) THEN
  6929. Error(scope(SyntaxTree.ProcedureScope).ownerProcedure.position,"implementation restriction: cannot allocate temporary variable in procedure without activation frame");
  6930. END;
  6931. (*
  6932. v := NIL; (* disable free variable managemenet for the time being *)
  6933. *)
  6934. name := temporaries.GetUID();
  6935. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6936. variable.SetType(type);
  6937. variable.SetAccess(SyntaxTree.Hidden);
  6938. variable.SetUntraced(untraced);
  6939. IF v = NIL THEN
  6940. temporaries.AddVariable(variable);
  6941. IF ~register THEN
  6942. IF scope.lastVariable # NIL THEN
  6943. offset := scope.lastVariable.offsetInBits;
  6944. ELSE
  6945. offset := 0;
  6946. END;
  6947. DEC(offset,system.SizeOf(variable.type));
  6948. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6949. variable(SyntaxTree.Variable).SetOffset(offset);
  6950. scope.AddVariable(variable(SyntaxTree.Variable));
  6951. scope.EnterSymbol(variable, duplicate);
  6952. ASSERT(~duplicate);
  6953. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6954. ELSE
  6955. variable.SetUseRegister(TRUE);
  6956. variable(SyntaxTree.Variable).SetOffset(0);
  6957. END;
  6958. ELSE (* v # NIL *)
  6959. (* reuse slot for new variable, do not create new slot ! *)
  6960. temporaries.SetVariable(index, variable);
  6961. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6962. ASSERT(~register);
  6963. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6964. ASSERT(v.offsetInBits # 0);
  6965. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6966. scope.EnterSymbol(variable, duplicate);
  6967. ASSERT(~duplicate);
  6968. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6969. END;
  6970. RETURN variable(SyntaxTree.Variable)
  6971. END GetTemporaryVariable;
  6972. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6973. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6974. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6975. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6976. i: LONGINT; duplicate: BOOLEAN;
  6977. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6978. VAR variable: SyntaxTree.Variable;
  6979. BEGIN
  6980. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6981. variable.SetType(type);
  6982. recordScope.AddVariable(variable);
  6983. END AddVariable;
  6984. BEGIN
  6985. name := "@ArrayDescriptor";
  6986. Basic.AppendNumber(name,dimensions);
  6987. identifier := SyntaxTree.NewIdentifier(name);
  6988. parentScope := module.module.moduleScope;
  6989. symbol := parentScope.FindSymbol(identifier);
  6990. IF symbol # NIL THEN
  6991. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6992. type := typeDeclaration.declaredType;
  6993. ELSE
  6994. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6995. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6996. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6997. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6998. recordType.SetTypeDeclaration(typeDeclaration);
  6999. recordType.SetState(SyntaxTree.Resolved);
  7000. typeDeclaration.SetDeclaredType(recordType);
  7001. AddVariable("@ptr",system.anyType);
  7002. AddVariable("@adr",system.addressType);
  7003. AddVariable("@flags",system.addressType);
  7004. AddVariable("@dim",system.addressType);
  7005. AddVariable("@elementSize",system.addressType);
  7006. FOR i := 0 TO dimensions-1 DO
  7007. name := "@len";
  7008. Basic.AppendNumber(name,i);
  7009. AddVariable(name,system.addressType);
  7010. name := "@incr";
  7011. Basic.AppendNumber(name,i);
  7012. AddVariable(name,system.addressType);
  7013. END;
  7014. parentScope.AddTypeDeclaration(typeDeclaration);
  7015. parentScope.EnterSymbol(typeDeclaration,duplicate);
  7016. ASSERT(~duplicate);
  7017. type := recordType;
  7018. END;
  7019. RETURN type
  7020. END GetMathArrayDescriptorType;
  7021. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  7022. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  7023. BEGIN
  7024. NEW(string, LEN(s)); COPY(s, string^);
  7025. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  7026. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  7027. sv.SetType(type);
  7028. Designate(sv,res);
  7029. Emit(Push(position,res.tag));
  7030. Emit(Push(position,res.op));
  7031. ReleaseOperand(res);
  7032. END PushConstString;
  7033. PROCEDURE PushConstBoolean(b: BOOLEAN);
  7034. BEGIN
  7035. IF b THEN
  7036. Emit(Push(Basic.invalidPosition, true));
  7037. ELSE
  7038. Emit(Push(Basic.invalidPosition, false));
  7039. END;
  7040. END PushConstBoolean;
  7041. PROCEDURE PushConstSet(v: SET);
  7042. VAR value: SyntaxTree.Value; op: Operand;
  7043. BEGIN
  7044. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  7045. value.SetType(system.setType);
  7046. Evaluate(value, op);
  7047. Emit(Push(Basic.invalidPosition, op.op));
  7048. ReleaseOperand(op);
  7049. END PushConstSet;
  7050. PROCEDURE PushConstInteger(v: LONGINT);
  7051. VAR value: SyntaxTree.Value; op: Operand;
  7052. BEGIN
  7053. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  7054. value.SetType(system.longintType);
  7055. Evaluate(value, op);
  7056. Emit(Push(Basic.invalidPosition, op.op));
  7057. ReleaseOperand(op);
  7058. END PushConstInteger;
  7059. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  7060. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  7061. section: IntermediateCode.Section;
  7062. BEGIN
  7063. procedureScope := SyntaxTree.NewProcedureScope(scope);
  7064. Global.GetSymbolSegmentedName(symbol, name);
  7065. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  7066. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  7067. procedure.SetScope(moduleScope);
  7068. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  7069. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  7070. procedure.SetAccess(SyntaxTree.Hidden);
  7071. currentScope := procedureScope;
  7072. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  7073. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  7074. RETURN section;
  7075. END OpenInitializer;
  7076. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  7077. BEGIN
  7078. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  7079. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  7080. section := prev;
  7081. END CloseInitializer;
  7082. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  7083. VAR name: SyntaxTree.IdentifierString;
  7084. parameter: SyntaxTree.Parameter;
  7085. type: SyntaxTree.Type;
  7086. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  7087. BEGIN
  7088. InitOperand(op,ModeReference);
  7089. op.op := fp;
  7090. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  7091. Dereference(op, x, FALSE);
  7092. result := op;
  7093. Symbol(symbol, op);
  7094. END Field;
  7095. PROCEDURE Direction(direction: LONGINT): SET;
  7096. BEGIN
  7097. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  7098. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  7099. ELSE HALT(100);
  7100. END;
  7101. END Direction;
  7102. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7103. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7104. BEGIN
  7105. Field(port, op);
  7106. ToMemory(op.op,addressType,0);
  7107. Emit(Push(Basic.invalidPosition, op.op));
  7108. ReleaseOperand(op);
  7109. Basic.GetString(modifier.identifier, name);
  7110. PushConstString(name);
  7111. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7112. ASSERT(SemanticChecker.IsStringType(value.type));
  7113. Designate(value, op);
  7114. Emit(Push(modifier.position, op.tag));
  7115. Emit(Push(modifier.position, op.op));
  7116. ReleaseOperand(op);
  7117. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  7118. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7119. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7120. Evaluate(value, op);
  7121. Emit(Push(modifier.position, op.op));
  7122. ReleaseOperand(op);
  7123. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  7124. ELSE
  7125. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  7126. END;
  7127. END AddPortProperty;
  7128. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  7129. VAR modifier: SyntaxTree.Modifier;
  7130. BEGIN
  7131. modifier := parameter.modifiers;
  7132. WHILE modifier # NIL DO
  7133. AddPortProperty(parameter,modifier, modifier.expression);
  7134. modifier := modifier.nextModifier;
  7135. END;
  7136. END AddPortProperties;
  7137. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  7138. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  7139. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  7140. PROCEDURE PushLens(type: SyntaxTree.Type);
  7141. BEGIN
  7142. IF IsSemiDynamicArray(type) THEN
  7143. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7144. Evaluate(type(SyntaxTree.ArrayType).length, op);
  7145. Emit(Push(Basic.invalidPosition, op.op));
  7146. ReleaseOperand(op);
  7147. INC(dim);
  7148. ELSIF IsStaticArray(type) THEN
  7149. len := len * type(SyntaxTree.ArrayType).staticLength;
  7150. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7151. INC(dim);
  7152. ELSE
  7153. baseType := type;
  7154. END;
  7155. END PushLens;
  7156. BEGIN
  7157. (* cell *)
  7158. IF parameter.type IS SyntaxTree.ArrayType THEN
  7159. type := parameter.type;
  7160. dim := 0;
  7161. len := 1;
  7162. PushLens(type);
  7163. portType := baseType.resolved(SyntaxTree.PortType);
  7164. ELSE
  7165. portType := parameter.type(SyntaxTree.PortType);
  7166. END;
  7167. PushSelfPointer();
  7168. (* port / array of ports *)
  7169. IF IsStaticArray(type) THEN
  7170. PushConstInteger(len);
  7171. END;
  7172. Field(parameter, op);
  7173. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7174. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  7175. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  7176. Designate(d, op);*)
  7177. Emit(Push(Basic.invalidPosition, op.op));
  7178. ReleaseOperand(op);
  7179. (* name *)
  7180. PushConstString(name);
  7181. (* inout *)
  7182. PushConstSet(Direction(portType.direction));
  7183. (* width *)
  7184. PushConstInteger(portType.sizeInBits);
  7185. IF parameter.type IS SyntaxTree.PortType THEN
  7186. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  7187. AddPortProperties(parameter);
  7188. ELSIF IsStaticArray(type)THEN
  7189. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  7190. ELSIF IsSemiDynamicArray(type) THEN
  7191. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7192. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  7193. Emit(Add(position,reg, sp, size));
  7194. (* dim *)
  7195. PushConstInteger(dim);
  7196. (* len array *)
  7197. Emit(Push(position, reg));
  7198. ReleaseIntermediateOperand(reg);
  7199. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  7200. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  7201. Emit(Add(position, sp,sp, size));
  7202. ELSE
  7203. HALT(100);
  7204. END;
  7205. END Parameter;
  7206. BEGIN
  7207. IF backend.cellsAreObjects THEN
  7208. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  7209. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  7210. END;
  7211. parameter := x.firstParameter;
  7212. WHILE (parameter # NIL) DO
  7213. type := parameter.type.resolved;
  7214. WHILE (type IS SyntaxTree.ArrayType) DO
  7215. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7216. END;
  7217. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  7218. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  7219. Parameter(name,parameter);
  7220. END;
  7221. parameter := parameter.nextParameter;
  7222. END;
  7223. ELSE HALT(200)
  7224. END;
  7225. END AddPorts;
  7226. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  7227. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  7228. BEGIN
  7229. Symbol(cell,op);
  7230. ToMemory(op.op,addressType,0);
  7231. Emit(Push(position,op.op));
  7232. ReleaseOperand(op);
  7233. property.GetName(name);
  7234. (* does not work when inheritance is used:
  7235. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  7236. *)
  7237. PushConstString(name);
  7238. IF (value # NIL) THEN
  7239. ASSERT(
  7240. SemanticChecker.IsStringType(property.type)
  7241. OR (property.type.resolved IS SyntaxTree.IntegerType)
  7242. OR (property.type.resolved IS SyntaxTree.FloatType)
  7243. OR (property.type.resolved IS SyntaxTree.BooleanType)
  7244. OR (property.type.resolved IS SyntaxTree.SetType)
  7245. );
  7246. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7247. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  7248. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  7249. Designate(d, op);
  7250. IF SemanticChecker.IsStringType(property.type) THEN
  7251. Emit(Push(Basic.invalidPosition, op.tag))
  7252. END;
  7253. Emit(Push(Basic.invalidPosition, op.op));
  7254. ReleaseOperand(op);
  7255. END;
  7256. IF value = NIL THEN
  7257. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  7258. ELSIF SemanticChecker.IsStringType(property.type) THEN
  7259. ASSERT(SemanticChecker.IsStringType(value.type));
  7260. Designate(value, op);
  7261. PushString(op, value.type);
  7262. ReleaseOperand(op);
  7263. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  7264. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  7265. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7266. Evaluate(value, op);
  7267. Emit(Push(property.position, op.op));
  7268. ReleaseOperand(op);
  7269. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  7270. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  7271. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  7272. Evaluate(value, op);
  7273. Emit(Push(property.position, op.op));
  7274. ReleaseOperand(op);
  7275. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  7276. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  7277. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  7278. Evaluate(value, op);
  7279. Emit(Push(property.position, op.op));
  7280. ReleaseOperand(op);
  7281. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  7282. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  7283. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  7284. Evaluate(value, op);
  7285. Emit(Push(property.position, op.op));
  7286. ReleaseOperand(op);
  7287. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  7288. ELSE
  7289. HALT(200);
  7290. END;
  7291. END AddProperty;
  7292. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  7293. VAR symbol: SyntaxTree.Symbol;
  7294. BEGIN
  7295. WHILE modifier # NIL DO
  7296. symbol := cellType.FindProperty(modifier.identifier);
  7297. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  7298. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  7299. modifier := modifier.nextModifier;
  7300. END;
  7301. END AddModifiers;
  7302. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7303. VAR last: SyntaxTree.Modifier;
  7304. BEGIN
  7305. IF to = NIL THEN
  7306. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  7307. ELSE
  7308. last := to;
  7309. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  7310. last := last.nextModifier;
  7311. END;
  7312. IF last.identifier # this.identifier THEN
  7313. ASSERT(last.nextModifier = NIL);
  7314. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  7315. END;
  7316. END;
  7317. END AppendModifier;
  7318. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7319. BEGIN
  7320. WHILE this # NIL DO
  7321. AppendModifier(to, this);
  7322. this := this.nextModifier;
  7323. END;
  7324. END AppendModifiers;
  7325. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  7326. VAR base: SyntaxTree.Type;
  7327. BEGIN
  7328. AppendModifiers(to, c.modifiers);
  7329. base := c.GetBaseValueType();
  7330. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  7331. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  7332. END;
  7333. END AppendCellTypeModifiers;
  7334. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7335. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7336. BEGIN
  7337. Basic.GetString(modifier.identifier, name);
  7338. PushConstString(name);
  7339. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7340. ASSERT(SemanticChecker.IsStringType(value.type));
  7341. Designate(value, op);
  7342. PushString(op, value.type);
  7343. ReleaseOperand(op);
  7344. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7345. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7346. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7347. Evaluate(value, op);
  7348. Emit(Push(modifier.position, op.op));
  7349. ReleaseOperand(op);
  7350. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7351. ELSE
  7352. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7353. END;
  7354. END AddPortProperty;
  7355. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7356. BEGIN
  7357. WHILE modifier # NIL DO
  7358. AddPortProperty(modifier, modifier.expression);
  7359. modifier := modifier.nextModifier;
  7360. END;
  7361. END AddPortProperties;
  7362. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7363. VAR op: Operand;
  7364. BEGIN
  7365. Evaluate(p, op);
  7366. Emit(Push(p.position, op.op));
  7367. ReleaseOperand(op);
  7368. IF p IS SyntaxTree.Designator THEN
  7369. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7370. END;
  7371. END PushPort;
  7372. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7373. VAR tmp: IntermediateCode.Operand;
  7374. BEGIN
  7375. actualType := actualType.resolved;
  7376. IF actualType IS SyntaxTree.StringType THEN
  7377. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7378. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7379. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7380. ELSE
  7381. tmp := op.tag;
  7382. IntermediateCode.MakeMemory(tmp,addressType);
  7383. Emit(Push(position,tmp));
  7384. END;
  7385. Emit(Push(position,op.op))
  7386. END PushString;
  7387. (* conservative check if x is potentially on the heap, excluding the module heap
  7388. required for generational garbage collector
  7389. *)
  7390. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7391. BEGIN
  7392. RETURN TRUE;
  7393. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7394. passed by reference.
  7395. pos := x.position.start;
  7396. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7397. x := x(SyntaxTree.Designator).left;
  7398. END;
  7399. RETURN x # NIL;
  7400. *)
  7401. END OnHeap;
  7402. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7403. VAR
  7404. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7405. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7406. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7407. tmp:IntermediateCode.Operand;
  7408. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,ignore: Label;
  7409. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7410. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7411. dest: IntermediateCode.Operand;
  7412. staticLength: LONGINT; itype: IntermediateCode.Type;
  7413. convert,isTensor: BOOLEAN;
  7414. recordType: SyntaxTree.RecordType;
  7415. baseType: SyntaxTree.Type;
  7416. left: SyntaxTree.Expression;
  7417. call: SyntaxTree.Designator;
  7418. procedure: SyntaxTree.Procedure;
  7419. temporaryVariable: SyntaxTree.Variable;
  7420. dummy: IntermediateCode.Operand;
  7421. customBuiltin: SyntaxTree.CustomBuiltin;
  7422. isVarPar: ARRAY 3 OF BOOLEAN;
  7423. callsection: Sections.Section;
  7424. segmentedName: Basic.SegmentedName;
  7425. needsTrace: BOOLEAN;
  7426. n: ARRAY 256 OF CHAR;
  7427. modifier: SyntaxTree.Modifier;
  7428. previous, init: IntermediateCode.Section;
  7429. prevScope: SyntaxTree.Scope;
  7430. firstPar: LONGINT;
  7431. saved: RegisterEntry;
  7432. callingConvention: SyntaxTree.CallingConvention;
  7433. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7434. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7435. priority: IntermediateCode.Operand;
  7436. op,callop: Operand;
  7437. BEGIN
  7438. IF type = NIL THEN RETURN END;
  7439. type := type.resolved;
  7440. IF type IS SyntaxTree.PointerType THEN
  7441. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7442. END;
  7443. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7444. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7445. recordScope := type(SyntaxTree.RecordType).recordScope;
  7446. IF recordScope.bodyProcedure # NIL THEN
  7447. procedure := recordScope.bodyProcedure;
  7448. body := procedure.procedureScope.body;
  7449. Emit(Push(position,self));
  7450. IF body.isActive THEN
  7451. StaticCallOperand(callop,procedure);
  7452. Emit(Push(position,callop.op));
  7453. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7454. Convert(priority,sizeType);
  7455. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7456. END;
  7457. Emit(Push(position,priority));
  7458. ReleaseIntermediateOperand(priority);
  7459. IF backend.cooperative THEN
  7460. Emit(Push(position,self));
  7461. CallThis(position,"Activities","Create",3)
  7462. ELSE
  7463. flags := 0;
  7464. IF body.isSafe THEN
  7465. flags := 1;
  7466. END;
  7467. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7468. Emit(Push(position,self));
  7469. CallThis(position,"Objects","CreateProcess",4)
  7470. END;
  7471. ELSE
  7472. Emit(Push(position,self));
  7473. StaticCallOperand(callop,procedure);
  7474. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7475. END;
  7476. Emit(Pop(position,self));
  7477. END;
  7478. END CallBodies;
  7479. PROCEDURE PushTD(type: SyntaxTree.Type);
  7480. VAR op: IntermediateCode.Operand;
  7481. BEGIN
  7482. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7483. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7484. ELSE
  7485. IF type.resolved IS SyntaxTree.PointerType THEN
  7486. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7487. END;
  7488. op := TypeDescriptorAdr(type.resolved);
  7489. Emit(Push(position,op));
  7490. END
  7491. END PushTD;
  7492. BEGIN
  7493. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7494. dest := destination; destination := emptyOperand;
  7495. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7496. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7497. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7498. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7499. CASE x.id OF
  7500. (* ---- COPY ----- *)
  7501. |Global.Copy:
  7502. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7503. (* ---- EXCL, INCL----- *)
  7504. |Global.Excl,Global.Incl:
  7505. Evaluate(p0,s0);
  7506. Evaluate(p1,s1);
  7507. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7508. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7509. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7510. END;
  7511. ReuseCopy(res,s0.op);
  7512. ReleaseOperand(s0);
  7513. Reuse1(tmp,s1.op);
  7514. ReleaseOperand(s1);
  7515. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7516. IF x.id = Global.Excl THEN
  7517. Emit(Not(position,tmp,tmp));
  7518. Emit(And(position,res,res,tmp));
  7519. ELSE
  7520. Emit(Or(position,res,res,tmp));
  7521. END;
  7522. ReleaseIntermediateOperand(tmp);
  7523. Designate(p0,s0);
  7524. ToMemory(s0.op,s1.op.type,0);
  7525. Emit(Mov(position,s0.op,res));
  7526. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7527. (* ---- DISPOSE ----- *)
  7528. |Global.Dispose:
  7529. Designate(p0,s0);
  7530. Emit(Push(position,s0.op));
  7531. ReleaseOperand(s0);
  7532. CallThis(position,"Runtime","Dispose", 1);
  7533. (* ---- GETPROCEDURE ----- *)
  7534. |Global.GetProcedure:
  7535. Designate(p0,s0);
  7536. PushString(s0,p0.type);
  7537. Designate(p1,s1);
  7538. PushString(s1,p1.type);
  7539. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7540. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7541. ELSE PushTD(procedureType.firstParameter.type)
  7542. END;
  7543. PushTD(procedureType.returnType);
  7544. Designate(p2,s2);
  7545. Emit(Push(position,s2.op));
  7546. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7547. CallThis(position,"Modules","GetProcedure", 7);
  7548. (* ---- ASH, LSH, ROT ----- *)
  7549. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7550. Evaluate(p0,s0);
  7551. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7552. (* make unsigned arguments in order to produced a logical shift *)
  7553. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7554. convert:= TRUE;
  7555. itype := s0.op.type;
  7556. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7557. Convert(s0.op,itype);
  7558. ELSE
  7559. convert := FALSE;
  7560. END;
  7561. END;
  7562. Evaluate(p1,s1);
  7563. IF IsIntegerConstant(p1,hint) THEN
  7564. ReuseCopy(reg,s0.op);
  7565. IF hint > 0 THEN
  7566. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7567. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7568. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7569. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7570. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7571. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7572. END;
  7573. ELSIF hint < 0 THEN
  7574. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7575. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7576. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7577. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7578. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7579. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7580. END;
  7581. END;
  7582. ReleaseOperand(s0); ReleaseOperand(s1);
  7583. ELSE
  7584. exit := NewLabel();
  7585. end := NewLabel();
  7586. ReuseCopy(reg,s0.op);
  7587. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7588. Reuse1(tmp,s1.op);
  7589. Emit(Neg(position,tmp,s1.op));
  7590. Convert(tmp,s1.op.type);
  7591. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7592. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7593. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7594. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7595. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7596. END;
  7597. ReleaseIntermediateOperand(tmp);
  7598. BrL(end);
  7599. SetLabel(exit);
  7600. ReuseCopy(tmp,s1.op);
  7601. Convert(tmp,s1.op.type);
  7602. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7603. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7604. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7605. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7606. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7607. END;
  7608. ReleaseIntermediateOperand(tmp);
  7609. SetLabel(end);
  7610. ReleaseOperand(s0); ReleaseOperand(s1);
  7611. END;
  7612. InitOperand(result,ModeValue);
  7613. IF convert THEN
  7614. itype := reg.type;
  7615. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7616. Convert(reg,itype);
  7617. END;
  7618. result.op := reg;
  7619. (* ---- CAP ----- *)
  7620. |Global.Cap:
  7621. Evaluate(p0,result);
  7622. ReuseCopy(reg,result.op);
  7623. ReleaseIntermediateOperand(result.op);
  7624. ignore := NewLabel();
  7625. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7626. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7627. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7628. SetLabel(ignore);
  7629. result.op := reg;
  7630. (* ---- CHR ----- *)
  7631. |Global.Chr, Global.Chr32:
  7632. Evaluate(p0,result);
  7633. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7634. |Global.Entier, Global.EntierH:
  7635. Evaluate(p0,result);
  7636. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7637. (* ---- MIN and MAX ----- *)
  7638. |Global.Max,Global.Min:
  7639. Evaluate(p0,s0);
  7640. Evaluate(p1,s1);
  7641. Reuse2(res,s0.op,s1.op);
  7642. else := NewLabel();
  7643. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7644. ELSE BrltL(else,s1.op,s0.op) END;
  7645. Emit(Mov(position,res,s0.op));
  7646. ReleaseOperand(s0);
  7647. end := NewLabel();
  7648. BrL(end);
  7649. SetLabel(else);
  7650. Emit(MovReplace(position,res,s1.op));
  7651. SetLabel(end);
  7652. ReleaseOperand(s1);
  7653. InitOperand(result,ModeValue);
  7654. result.op := res;
  7655. (* ---- ODD ----- *)
  7656. |Global.Odd:
  7657. Evaluate(p0,result);
  7658. Reuse1(res,result.op);
  7659. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7660. ReleaseIntermediateOperand(result.op);
  7661. result.op := res;
  7662. Convert(result.op,bool);
  7663. (* ---- ORD ----- *)
  7664. |Global.Ord, Global.Ord32:
  7665. Evaluate(p0,result);
  7666. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7667. (* ---- SHORT, LONG ----- *)
  7668. |Global.Short, Global.Long:
  7669. Evaluate(p0,result);
  7670. IF x.type IS SyntaxTree.ComplexType THEN
  7671. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7672. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7673. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7674. ELSE
  7675. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7676. END
  7677. (* ---- HALT, SYSTEM.HALT----- *)
  7678. |Global.Halt, Global.systemHalt:
  7679. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7680. EmitTrap (position, val);
  7681. (* ---- ASSERT ----- *)
  7682. |Global.Assert:
  7683. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7684. trueL := NewLabel();
  7685. Condition(p0,trueL,TRUE);
  7686. IF p1 = NIL THEN val := AssertTrap
  7687. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7688. END;
  7689. EmitTrap(position,val);
  7690. SetLabel(trueL);
  7691. END;
  7692. (*
  7693. Emit(TrapC(result.op,val);
  7694. *)
  7695. (* ---- INC, DEC----- *)
  7696. |Global.Inc,Global.Dec:
  7697. Expression(p0); adr := result.op;
  7698. s0 := result;
  7699. LoadValue(result,p0.type);
  7700. (* EXPERIMENTAL *)
  7701. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7702. availableSymbols[s0.availability].inMemory := FALSE;
  7703. END;
  7704. l := result;
  7705. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7706. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7707. END;
  7708. IF x.id = Global.Inc THEN
  7709. Emit(Add(position,l.op,l.op,r.op));
  7710. ELSE
  7711. Emit(Sub(position,l.op,l.op,r.op));
  7712. END;
  7713. ReleaseOperand(l); ReleaseOperand(r);
  7714. (* ---- LEN ----- *)
  7715. |Global.Len: (* dynamic length, static length done by checker *)
  7716. Designate(p0,operand);
  7717. IF p1 = NIL THEN
  7718. InitOperand(l,ModeValue);
  7719. l.op := IntermediateCode.Immediate(sizeType,0);
  7720. ELSE
  7721. Evaluate(p1,l);
  7722. END;
  7723. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7724. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7725. Dereference(operand, p0.type.resolved, FALSE);
  7726. END;
  7727. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7728. ReleaseOperand(operand); ReleaseOperand(l);
  7729. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7730. ASSERT(p1 # NIL);
  7731. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7732. Dereference(operand,p0.type.resolved,FALSE);
  7733. END;
  7734. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7735. ReleaseOperand(operand); ReleaseOperand(l);
  7736. ELSE HALT(100);
  7737. END;
  7738. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7739. (* ---- FIRST ---- *)
  7740. |Global.First:
  7741. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7742. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7743. ELSE
  7744. Designate(p0, result)
  7745. END
  7746. (* ---- LAST ---- *)
  7747. |Global.Last:
  7748. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7749. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7750. ELSE
  7751. Designate(p0, result);
  7752. (* make sure result.op is a register *)
  7753. tmp := result.op;
  7754. ReuseCopy(result.op, result.op);
  7755. ReleaseIntermediateOperand(tmp);
  7756. (* add offset to result.op *)
  7757. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7758. END
  7759. (* ---- STEP ---- *)
  7760. |Global.Step:
  7761. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7762. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7763. ELSE
  7764. Designate(p0, result);
  7765. (* make sure result.op is a register *)
  7766. tmp := result.op;
  7767. ReuseCopy(result.op, result.op);
  7768. ReleaseIntermediateOperand(tmp);
  7769. (* add offset to result.op *)
  7770. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7771. END
  7772. (* ---- RE ---- *)
  7773. |Global.Re:
  7774. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7775. Designate(p0, result)
  7776. ELSE
  7777. Evaluate(p0, result)
  7778. END
  7779. (* ---- IM ---- *)
  7780. |Global.Im:
  7781. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7782. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7783. Designate(p0, result);
  7784. (* make sure result.op is a register *)
  7785. tmp := result.op;
  7786. ReuseCopy(result.op, result.op);
  7787. ReleaseIntermediateOperand(tmp);
  7788. (* add offset to result.op *)
  7789. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7790. (* ---- ABS ----- *)
  7791. |Global.Abs:
  7792. Evaluate(p0,operand);
  7793. type := p0.type.resolved;
  7794. InitOperand(result,ModeValue);
  7795. Reuse1a(result.op,operand.op,dest);
  7796. Emit(Abs(position,result.op,operand.op));
  7797. ReleaseOperand(operand);
  7798. (* ---- WAIT ----- *)
  7799. |Global.Wait:
  7800. Evaluate(p0,operand);
  7801. Emit(Push(position,operand.op));
  7802. ReleaseOperand(operand);
  7803. CallThis(position,"Activities","Wait", 1);
  7804. (* ---- NEW ----- *)
  7805. |Global.New:
  7806. (*! the following code is only correct for "standard" Oberon calling convention *)
  7807. IF x.type # NIL THEN
  7808. type := x.type.resolved;
  7809. firstPar := 0;
  7810. ELSE
  7811. type := p0.type.resolved;
  7812. firstPar := 1;
  7813. END;
  7814. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7815. THEN
  7816. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7817. IF backend.cooperative THEN
  7818. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7819. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7820. IF recordType.isObject THEN
  7821. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7822. IF recordType.IsActive() THEN
  7823. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7824. END;
  7825. IF recordType.IsProtected() THEN
  7826. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7827. END;
  7828. ELSE
  7829. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7830. END;
  7831. END;
  7832. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7833. CallThis(position,"Runtime","New", 1);
  7834. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7835. Emit(Result(position, pointer));
  7836. exit := NewLabel();
  7837. BreqL(exit,pointer,nil);
  7838. GetRecordTypeName (recordType,name);
  7839. IF ~recordType.isObject THEN
  7840. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7841. END;
  7842. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7843. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7844. IF recordType.isObject THEN
  7845. IF recordType.IsProtected() THEN
  7846. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7847. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7848. END;
  7849. IF recordType.IsActive() THEN
  7850. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7851. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7852. END;
  7853. END;
  7854. (* initialize fields *)
  7855. IF type(SyntaxTree.PointerType).isPlain THEN
  7856. size := 0;
  7857. ELSIF recordType.isObject THEN
  7858. size := BaseObjectTypeSize;
  7859. ELSE
  7860. size := BaseRecordTypeSize;
  7861. END;
  7862. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7863. (* call initializer *)
  7864. constructor := GetConstructor(recordType);
  7865. IF constructor # NIL THEN
  7866. (*! should be unified with ProcedureCallDesignator *)
  7867. Emit(Push(position,pointer));
  7868. ReleaseIntermediateOperand(pointer);
  7869. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7870. FOR i := firstPar TO x.parameters.Length()-1 DO
  7871. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7872. formalParameter := formalParameter.nextParameter;
  7873. END;
  7874. (* static call of the constructor *)
  7875. GetCodeSectionNameForSymbol(constructor,name);
  7876. ASSERT(~constructor.isInline);
  7877. IF constructor.scope.ownerModule # module.module THEN
  7878. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7879. ELSE
  7880. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7881. END;
  7882. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7883. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7884. Emit(Pop(position,pointer));
  7885. END;
  7886. (* call bodies *)
  7887. CallBodies(pointer,type);
  7888. SetLabel(exit);
  7889. needsTrace := p0.NeedsTrace();
  7890. IF needsTrace THEN ModifyAssignments(true) END;
  7891. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7892. Emit(Push(position, pointer));
  7893. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7894. Emit(Pop(position, pointer));
  7895. END;
  7896. Designate(p0,l);
  7897. IF needsTrace THEN
  7898. CallAssignPointer(l.op, pointer);
  7899. ELSE
  7900. ToMemory(l.op,addressType,0);
  7901. Emit(Mov(position,l.op,pointer));
  7902. END;
  7903. ReleaseIntermediateOperand(pointer);
  7904. ReleaseOperand(l);
  7905. IF needsTrace THEN ModifyAssignments(false) END;
  7906. ELSE (* not cooperative backend *)
  7907. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7908. IF temporaryVariable # NIL THEN
  7909. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7910. ELSE
  7911. Designate(p0,l);
  7912. END;
  7913. (* l.op contains address of pointer to record *)
  7914. Emit(Push(position,l.op)); (* address for use after syscall *)
  7915. Emit(Push(position,l.op));
  7916. ReleaseOperand(l);
  7917. (* push type descriptor *)
  7918. reg := TypeDescriptorAdr(recordType);
  7919. Emit(Push(position,reg));
  7920. ReleaseIntermediateOperand(reg);
  7921. (* push realtime flag *)
  7922. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7923. ELSE Emit(Push(position,false));
  7924. END;
  7925. CallThis(position,"Heaps","NewRec", 3);
  7926. (* check allocation success, if not successful then do not call initializers and bodies *)
  7927. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7928. Emit(Pop(position,pointer));
  7929. MakeMemory(reg,pointer,addressType,0);
  7930. ReleaseIntermediateOperand(pointer);
  7931. pointer := reg;
  7932. exit := NewLabel();
  7933. BreqL(exit,pointer,nil);
  7934. Emit(Push(position,pointer));
  7935. (* initialize fields *)
  7936. InitFields(recordType, pointer,0);
  7937. (* call initializer *)
  7938. constructor := GetConstructor(recordType);
  7939. IF constructor # NIL THEN
  7940. (*! should be unified with ProcedureCallDesignator *)
  7941. Emit(Push(position,pointer));
  7942. ReleaseIntermediateOperand(pointer);
  7943. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7944. FOR i := firstPar TO x.parameters.Length()-1 DO
  7945. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7946. formalParameter := formalParameter.nextParameter;
  7947. END;
  7948. (* static call of the constructor *)
  7949. GetCodeSectionNameForSymbol(constructor,name);
  7950. ASSERT(~constructor.isInline);
  7951. IF constructor.scope.ownerModule # module.module THEN
  7952. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7953. ELSE
  7954. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7955. END;
  7956. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7957. ELSE
  7958. ReleaseIntermediateOperand(pointer);
  7959. END;
  7960. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7961. Emit(Pop(position,pointer));
  7962. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7963. Designate(p0,l);
  7964. IF backend.writeBarriers & OnHeap(p0) THEN
  7965. SaveRegisters();ReleaseUsedRegisters(saved);
  7966. Emit(Push(position,l.op));
  7967. Emit(Push(position,pointer));
  7968. CallThis(position,"Heaps","Assign",2);
  7969. RestoreRegisters(saved);
  7970. ELSE
  7971. ToMemory(l.op,addressType,0);
  7972. Emit(Mov(position,l.op,pointer));
  7973. END;
  7974. ReleaseOperand(l);
  7975. result.tag := emptyOperand;
  7976. ELSIF (x.type # NIL) THEN
  7977. result := l; (* temporary variable is the result of NEW Type() *)
  7978. END;
  7979. (* call bodies *)
  7980. CallBodies(pointer,type);
  7981. ReleaseIntermediateOperand(pointer);
  7982. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7983. end := NewLabel();
  7984. BrL(end);
  7985. SetLabel(exit);
  7986. Designate(p0,l);
  7987. ToMemory(l.op,addressType,0);
  7988. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7989. ReleaseOperand(l);
  7990. SetLabel(end);
  7991. ELSE
  7992. SetLabel(exit);
  7993. END;
  7994. END;
  7995. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7996. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7997. IF ~backend.cooperative THEN (* simpler version *)
  7998. (*
  7999. push len0
  8000. push len1
  8001. push len2
  8002. push len_size
  8003. push len_adr
  8004. push tag
  8005. push static elements
  8006. push element size
  8007. push adr
  8008. *)
  8009. dim := 0;
  8010. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8011. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8012. parameter := x.parameters.GetExpression(i);
  8013. Evaluate(parameter,r);
  8014. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8015. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8016. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8017. END;
  8018. Emit(Push(position,r.op));
  8019. ReleaseOperand(r);
  8020. INC(dim);
  8021. END;
  8022. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8023. Emit(Mov(position, adr, sp));
  8024. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8025. Emit(Push(position, adr));
  8026. ReleaseIntermediateOperand(adr);
  8027. openDim := dim;
  8028. staticLength := 1;
  8029. IF type IS SyntaxTree.ArrayType THEN
  8030. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8031. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8032. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8033. END;
  8034. END;
  8035. IF SemanticChecker.ContainsPointer(type) THEN
  8036. tmp := TypeDescriptorAdr(type);
  8037. ELSE
  8038. tmp := nil;
  8039. END;
  8040. Emit(Push(position,tmp)); (* type descriptor *)
  8041. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  8042. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  8043. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  8044. Designate(p0,l);
  8045. Emit(Push(position,l.op)); (* address *)
  8046. ReleaseOperand(l);
  8047. CallThis(position,"Heaps","NewArray", 6);
  8048. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8049. Emit(Add(position,sp,sp,tmp));
  8050. ELSE
  8051. dim := 0;
  8052. IntermediateCode.InitOperand(reg);
  8053. IF p1 # NIL THEN
  8054. FOR i := firstPar TO x.parameters.Length()-1 DO
  8055. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8056. parameter := x.parameters.GetExpression(i);
  8057. Evaluate(parameter,r);
  8058. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8059. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8060. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8061. END;
  8062. Emit(Push(position,r.op));
  8063. IF i=1 THEN
  8064. CopyInt(reg,r.op);
  8065. ELSE
  8066. MulInt(reg, reg, r.op);
  8067. END;
  8068. ReleaseOperand(r);
  8069. INC(dim);
  8070. END;
  8071. Convert(reg,addressType);
  8072. ELSE
  8073. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8074. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  8075. END;
  8076. openDim := dim;
  8077. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  8078. IF backend.cooperative THEN
  8079. size := ToMemoryUnits(system,system.SizeOf(type));
  8080. WHILE type IS SyntaxTree.ArrayType DO
  8081. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8082. END;
  8083. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  8084. IF (size # 1) THEN
  8085. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8086. END;
  8087. Emit(Push(position,reg));
  8088. size := ToMemoryUnits(system,system.SizeOf(type));
  8089. IF (size # 1) THEN
  8090. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8091. END;
  8092. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  8093. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  8094. Emit(Push(position,reg));
  8095. ReleaseIntermediateOperand(reg);
  8096. CallThis(position,"Runtime","New", 1);
  8097. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8098. Emit(Result(position, pointer));
  8099. exit := NewLabel();
  8100. else := NewLabel();
  8101. BreqL(else,pointer,nil);
  8102. IF ~type.hasPointers THEN
  8103. Basic.ToSegmentedName ("BaseTypes.Array",name);
  8104. ELSIF type IS SyntaxTree.RecordType THEN
  8105. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  8106. ELSIF type IS SyntaxTree.ProcedureType THEN
  8107. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  8108. ELSE
  8109. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  8110. END;
  8111. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  8112. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  8113. 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))));
  8114. IF type IS SyntaxTree.RecordType THEN
  8115. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  8116. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  8117. ELSE
  8118. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  8119. END;
  8120. i := openDim;
  8121. WHILE i > 0 DO
  8122. DEC (i);
  8123. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  8124. END;
  8125. needsTrace := p0.NeedsTrace();
  8126. IF needsTrace THEN ModifyAssignments(true) END;
  8127. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  8128. Emit(Push(position, pointer));
  8129. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  8130. Emit(Pop(position, pointer));
  8131. END;
  8132. Designate(p0,l);
  8133. IF needsTrace THEN
  8134. CallAssignPointer(l.op, pointer);
  8135. ModifyAssignments(false);
  8136. ELSE
  8137. ToMemory(l.op,addressType,0);
  8138. Emit(Mov(position,l.op,pointer));
  8139. END;
  8140. ReleaseIntermediateOperand(pointer);
  8141. ReleaseOperand(l);
  8142. BrL(exit);
  8143. SetLabel(else);
  8144. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  8145. Designate(p0,l);
  8146. IF needsTrace THEN
  8147. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  8148. ELSE
  8149. ToMemory(l.op,addressType,0);
  8150. Emit(Mov(position,l.op,pointer));
  8151. END;
  8152. ReleaseOperand(l);
  8153. SetLabel(exit);
  8154. ELSE
  8155. (*! the following code is only correct for "standard" Oberon calling convention *)
  8156. IF SemanticChecker.ContainsPointer(type) THEN
  8157. IF type IS SyntaxTree.ArrayType THEN
  8158. staticLength := 1;
  8159. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8160. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8161. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8162. END;
  8163. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  8164. MulInt(reg,reg,tmp);
  8165. END;
  8166. Designate(p0,l);
  8167. IF openDim > 0 THEN
  8168. Emit(Push(position,l.op)); (* address for use after syscall *)
  8169. END;
  8170. Emit(Push(position,l.op)); (* address *)
  8171. ReleaseOperand(l);
  8172. tmp := TypeDescriptorAdr(type);
  8173. Emit(Push(position,tmp)); (* type descriptor *)
  8174. ReleaseIntermediateOperand(tmp);
  8175. Emit(Push(position,reg)); (* number Elements *)
  8176. ReleaseIntermediateOperand(reg);
  8177. tmp := IntermediateCode.Immediate(addressType,dim);
  8178. Emit(Push(position,tmp)); (* dimensions *)
  8179. (* push realtime flag *)
  8180. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8181. ELSE Emit(Push(position,false));
  8182. END;
  8183. CallThis(position,"Heaps","NewArr",5)
  8184. ELSE
  8185. size := ToMemoryUnits(system,system.SizeOf(type));
  8186. IF (size # 1) THEN
  8187. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  8188. (*
  8189. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  8190. *)
  8191. END;
  8192. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  8193. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  8194. AddInt(reg, reg, tmp);
  8195. (*
  8196. Emit(Add(position,reg,reg,tmp));
  8197. *)
  8198. Designate(p0,l);
  8199. IF openDim >0 THEN
  8200. Emit(Push(position,l.op)); (* address for use after syscall *)
  8201. END;
  8202. Emit(Push(position,l.op)); (* address for syscall *)
  8203. ReleaseOperand(l); (* pointer address *)
  8204. Emit(Push(position,reg)); (* size *)
  8205. ReleaseIntermediateOperand(reg);
  8206. (* push realtime flag *)
  8207. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8208. ELSE Emit(Push(position,false));
  8209. END;
  8210. CallThis(position,"Heaps","NewSys", 3)
  8211. END;
  8212. IF openDim > 0 THEN
  8213. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8214. Emit(Pop(position,adr));
  8215. ToMemory(adr,addressType,0);
  8216. ReuseCopy(tmp,adr);
  8217. ReleaseIntermediateOperand(adr);
  8218. adr := tmp;
  8219. else := NewLabel();
  8220. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  8221. i := openDim-1;
  8222. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8223. WHILE (i >= 0) DO
  8224. Emit(Pop(position,reg));
  8225. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  8226. Emit(Mov(position,res,reg));
  8227. DEC(i);
  8228. END;
  8229. ReleaseIntermediateOperand(adr);
  8230. ReleaseIntermediateOperand(reg);
  8231. exit := NewLabel();
  8232. BrL(exit);
  8233. SetLabel(else);
  8234. (* else part: array could not be allocated *)
  8235. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  8236. Emit(Add(position,sp,sp,tmp));
  8237. SetLabel(exit);
  8238. END;
  8239. END;
  8240. END;
  8241. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8242. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  8243. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  8244. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8245. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8246. callingConvention := procedureType.callingConvention;
  8247. left.SetType(procedure.type);
  8248. formalParameter := procedureType.firstParameter;
  8249. (* push array to allocate *)
  8250. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  8251. formalParameter :=formalParameter.nextParameter;
  8252. (* push length array *)
  8253. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  8254. (* push size *)
  8255. type := t0;
  8256. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  8257. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8258. END;
  8259. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  8260. Emit(Push(position,tmp));
  8261. (* *)
  8262. IF SemanticChecker.ContainsPointer(type) THEN
  8263. tmp := TypeDescriptorAdr(type);
  8264. ELSE
  8265. tmp := IntermediateCode.Immediate(addressType, 0);
  8266. END;
  8267. Emit(Push(position,tmp)); (* type descriptor *)
  8268. StaticCallOperand(result,procedure);
  8269. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8270. ReleaseOperand(result);
  8271. END;
  8272. (*
  8273. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  8274. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  8275. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  8276. *)
  8277. ELSE
  8278. (*
  8279. push len0
  8280. push len1
  8281. push len2
  8282. push size
  8283. push len_adr
  8284. push element_size
  8285. push tag
  8286. push adr
  8287. *)
  8288. dim := 0;
  8289. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8290. isTensor := TRUE;
  8291. ELSE
  8292. isTensor := FALSE;
  8293. END;
  8294. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8295. IF ~isTensor THEN
  8296. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8297. END;
  8298. parameter := x.parameters.GetExpression(i);
  8299. Evaluate(parameter,r);
  8300. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8301. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8302. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8303. END;
  8304. Emit(Push(position,r.op));
  8305. ReleaseOperand(r);
  8306. INC(dim);
  8307. END;
  8308. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8309. Emit(Mov(position, adr, sp));
  8310. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8311. Emit(Push(position, adr));
  8312. ReleaseIntermediateOperand(adr);
  8313. openDim := dim;
  8314. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  8315. IF isTensor THEN
  8316. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  8317. ELSE
  8318. baseType := SemanticChecker.ArrayBase(type,openDim);
  8319. END;
  8320. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  8321. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  8322. IF SemanticChecker.ContainsPointer(baseType) THEN
  8323. tmp := TypeDescriptorAdr(baseType);
  8324. ELSE
  8325. tmp := nil;
  8326. END;
  8327. Emit(Push(position,tmp)); (* type descriptor *)
  8328. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  8329. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  8330. ELSE (* error message has already been emited *)
  8331. RETURN;
  8332. END;
  8333. Designate(p0,l);
  8334. IF isTensor THEN
  8335. Emit(Push(position,l.op)); (* address *)
  8336. ELSE
  8337. Emit(Push(position,l.tag)); (* address *)
  8338. END;
  8339. ReleaseOperand(l);
  8340. StaticCallOperand(result,procedure);
  8341. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8342. ReleaseOperand(result);
  8343. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8344. Emit(Add(position,sp,sp,tmp));
  8345. END;
  8346. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8347. THEN
  8348. IF ~backend.cellsAreObjects THEN RETURN END;
  8349. IF InCellScope(currentScope) THEN
  8350. PushSelfPointer()
  8351. ELSE
  8352. Emit(Push(position, nil));
  8353. END;
  8354. (* push temp address *)
  8355. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8356. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8357. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8358. (* l.op contains address of pointer to record *)
  8359. Emit(Push(position,l.op)); (* address for use after syscall *)
  8360. ReleaseOperand(l);
  8361. (* push type descriptor *)
  8362. reg := TypeDescriptorAdr(baseType);
  8363. Emit(Push(position,reg));
  8364. ReleaseIntermediateOperand(reg);
  8365. (* push name *)
  8366. (*Global.GetSymbolName(p0, n);*)
  8367. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8368. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8369. ELSE
  8370. Global.GetModuleName(module.module, n);
  8371. END;
  8372. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8373. (*type.typeDeclaration.GetName(n);*)
  8374. PushConstString(n);
  8375. (* push cellnet boolean *)
  8376. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8377. (* push engine boolean *)
  8378. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8379. (* allocate *)
  8380. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8381. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8382. (* l.op contains address of pointer to record *)
  8383. ToMemory(l.op,addressType,0);
  8384. (* l.op contains value of pointer to record *)
  8385. InitFields(baseType, l.op,0);
  8386. (* add capabilities *)
  8387. modifier := p0(SyntaxTree.Designator).modifiers;
  8388. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8389. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8390. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8391. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8392. END;
  8393. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8394. (*
  8395. modifier := baseType(SyntaxTree.CellType).modifiers;
  8396. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8397. modifier := p0(SyntaxTree.Designator).modifiers;
  8398. *)
  8399. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8400. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8401. (* l.op contains address of pointer to record *)
  8402. ToMemory(l.op,addressType,0);
  8403. (* l.op contains value of pointer to record *)
  8404. Emit(Push(position,l.op)); (* address for use after syscall *)
  8405. ReleaseOperand(l);
  8406. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8407. prevScope := currentScope;
  8408. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8409. previous := section;
  8410. section := init;
  8411. (* add ports *)
  8412. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8413. CloseInitializer(previous);
  8414. currentScope := prevScope;
  8415. Symbol(temporaryVariable,l);
  8416. ToMemory(l.op,addressType,0);
  8417. Emit(Push(position,l.op));
  8418. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8419. (*
  8420. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8421. IF constructor # NIL THEN
  8422. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8423. FOR i := 1 TO x.parameters.Length()-1 DO
  8424. p := x.parameters.GetExpression(i);
  8425. Global.GetSymbolName(parameter,name);
  8426. Evaluate(p, value);
  8427. ASSERT(value.type # NIL);
  8428. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8429. par := instance.AddParameter(name);
  8430. par.SetInteger(value.integer);
  8431. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8432. par := instance.AddParameter(name);
  8433. par.SetBoolean(value.boolean);
  8434. ELSE Error(x.position,NotYetImplemented)
  8435. END;
  8436. parameter := parameter.nextParameter
  8437. END;
  8438. END;
  8439. *)
  8440. (* call initializer *)
  8441. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8442. IF constructor # NIL THEN
  8443. (*! should be unified with ProcedureCallDesignator *)
  8444. IF backend.cellsAreObjects THEN
  8445. Symbol(temporaryVariable,l);
  8446. ToMemory(l.op,addressType,0);
  8447. Emit(Push(position,l.op));
  8448. ReleaseOperand(l);
  8449. END;
  8450. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8451. FOR i := firstPar TO x.parameters.Length()-1 DO
  8452. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8453. formalParameter := formalParameter.nextParameter;
  8454. END;
  8455. (* static call of the constructor *)
  8456. Global.GetSymbolSegmentedName(constructor,name);
  8457. ASSERT(~constructor.isInline);
  8458. IF constructor.scope.ownerModule # module.module THEN
  8459. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8460. ELSE
  8461. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8462. END;
  8463. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8464. (*ELSE
  8465. ReleaseIntermediateOperand(pointer);*)
  8466. END;
  8467. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8468. ToMemory(l.op, addressType, 0);
  8469. Designate(p0,s0);
  8470. ToMemory(s0.op,addressType,0);
  8471. Emit(Mov(position,s0.op,l.op));
  8472. ReleaseOperand(l);
  8473. ReleaseOperand(s0);
  8474. result.tag := emptyOperand;
  8475. (* start *)
  8476. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8477. (* push cell *)
  8478. Symbol(temporaryVariable, l);
  8479. ToMemory(l.op,addressType,0);
  8480. Emit(Push(Basic.invalidPosition,l.op));
  8481. (* push delegate *)
  8482. Emit(Push(Basic.invalidPosition,l.op));
  8483. ReleaseOperand(l);
  8484. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8485. Emit(Push(position, s1.op));
  8486. ReleaseOperand(s1);
  8487. CallThis(position,"ActiveCellsRuntime","Start",3);
  8488. END;
  8489. (*IF temporaryVariable # NIL THEN
  8490. end := NewLabel();
  8491. BrL(end);
  8492. SetLabel(exit);
  8493. Designate(p0,l);
  8494. ToMemory(l.op,addressType,0);
  8495. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8496. ReleaseOperand(l);
  8497. SetLabel(end);
  8498. ELSE
  8499. SetLabel(exit);
  8500. END;
  8501. *)
  8502. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8503. ELSE (* no pointer to record, no pointer to array *)
  8504. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8505. (* ignore new statement *)
  8506. Warning(p0.position, "cannot run on final hardware");
  8507. ELSE
  8508. HALT(200);
  8509. END;
  8510. END;
  8511. (* ---- ADDRESSOF----- *)
  8512. |Global.systemAdr:
  8513. Designate(p0,s0);
  8514. s0.mode := ModeValue;
  8515. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8516. ReleaseIntermediateOperand(s0.op);
  8517. s0.op := s0.tag;
  8518. IntermediateCode.InitOperand(s0.tag);
  8519. END;
  8520. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8521. result := s0;
  8522. (* ---- BIT ----- *)
  8523. |Global.systemBit:
  8524. Evaluate(p0,s0);
  8525. ToMemory(s0.op,addressType,0);
  8526. ReuseCopy(res,s0.op);
  8527. ReleaseOperand(s0);
  8528. Evaluate(p1,s1);
  8529. Emit(Ror(position,res,res,s1.op));
  8530. ReleaseOperand(s1);
  8531. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8532. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8533. InitOperand(result,ModeValue);
  8534. result.op := res;
  8535. (* --- MSK ----*)
  8536. |Global.systemMsk:
  8537. Evaluate(p0,s0);
  8538. Evaluate(p1,s1);
  8539. ReuseCopy(res,s0.op);
  8540. ReleaseOperand(s0);
  8541. Emit(And(position,res,res,s1.op));
  8542. ReleaseOperand(s1);
  8543. InitOperand(result,ModeValue);
  8544. result.op := res;
  8545. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8546. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8547. Evaluate(p0,s0);
  8548. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8549. ReleaseOperand(s0);
  8550. InitOperand(result,ModeValue);
  8551. result.op := res;
  8552. (* ---- SYSTEM.GetStackPointer ----- *)
  8553. |Global.systemGetStackPointer:
  8554. InitOperand(result,ModeValue);
  8555. result.op := sp;
  8556. (* ---- SYSTEM.GetFramePointer ----- *)
  8557. |Global.systemGetFramePointer:
  8558. InitOperand(result,ModeValue);
  8559. result.op := fp;
  8560. (* ---- SYSTEM.GetActivity ----- *)
  8561. |Global.systemGetActivity:
  8562. ASSERT(backend.cooperative);
  8563. InitOperand(result,ModeValue);
  8564. result.op := ap;
  8565. (* ---- SYSTEM.SetStackPointer ----- *)
  8566. |Global.systemSetStackPointer:
  8567. Evaluate(p0,s0); (* *)
  8568. Emit(Mov(position,sp,s0.op));
  8569. ReleaseOperand(s0);
  8570. (* ---- SYSTEM.SetFramePointer ----- *)
  8571. |Global.systemSetFramePointer:
  8572. Evaluate(p0,s0); (* *)
  8573. Emit(Mov(position,fp,s0.op));
  8574. ReleaseOperand(s0);
  8575. (* ---- SYSTEM.Activity ----- *)
  8576. |Global.systemSetActivity:
  8577. ASSERT(backend.cooperative);
  8578. Evaluate(p0,s0); (* *)
  8579. Emit(Mov(position,ap,s0.op));
  8580. ReleaseOperand(s0);
  8581. (* ---- SYSTEM.VAL ----- *)
  8582. |Global.systemVal:
  8583. Expression(p1);
  8584. s1 := result;
  8585. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8586. IF s1.mode = ModeReference THEN
  8587. (* nothing to be done if not record type, just take over new type *)
  8588. IF (type IS SyntaxTree.RecordType) THEN
  8589. ReleaseIntermediateOperand(s1.tag);
  8590. s1.tag := TypeDescriptorAdr(type);
  8591. UseIntermediateOperand(s1.tag);
  8592. END;
  8593. result := s1;
  8594. ELSE (* copy over result to different type, may not use convert *)
  8595. itype := IntermediateCode.GetType(system,type);
  8596. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8597. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8598. Emit(Mov(position,s0.op,s1.op));
  8599. ReleaseOperand(s1);
  8600. InitOperand(result,ModeValue);
  8601. result.op := s0.op;
  8602. ELSE (* different size, must convert *)
  8603. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8604. Convert(s1.op, IntermediateCode.GetType(system,type));
  8605. result := s1;
  8606. END;
  8607. END;
  8608. (* ---- SYSTEM.GET ----- *)
  8609. |Global.systemGet:
  8610. Evaluate(p0,s0); (* adr *)
  8611. Designate(p1,s1); (* variable *)
  8612. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8613. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8614. Emit(Mov(position,s1.op,s0.op));
  8615. ReleaseOperand(s1);
  8616. ReleaseOperand(s0);
  8617. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8618. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8619. Evaluate(p0,s0); (* *)
  8620. Evaluate(p1,s1); (* variable *)
  8621. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8622. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8623. (* real part *)
  8624. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8625. Emit(Mov(position,res, s1.op));
  8626. ReleaseIntermediateOperand(res);
  8627. (* imaginary part *)
  8628. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8629. Emit(Mov(position,res, s1.tag));
  8630. ReleaseIntermediateOperand(res);
  8631. ReleaseOperand(s1);
  8632. ReleaseOperand(s0);
  8633. ELSE
  8634. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8635. ReleaseOperand(s0);
  8636. Emit(Mov(position,res,s1.op));
  8637. ReleaseIntermediateOperand(res);
  8638. ReleaseOperand(s1);
  8639. END;
  8640. (* ---- SYSTEM.MOVE ----- *)
  8641. |Global.systemMove:
  8642. Evaluate(p0,s0);
  8643. Evaluate(p1,s1);
  8644. Evaluate(p2,s2);
  8645. Emit(Copy(position,s1.op,s0.op,s2.op));
  8646. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8647. (* ---- SYSTEM.NEW ----- *)
  8648. |Global.systemNew:
  8649. Designate(p0,s0);
  8650. Emit(Push(position,s0.op));
  8651. ReleaseOperand(s0);
  8652. Evaluate(p1,s1);
  8653. Emit(Push(position,s1.op));
  8654. ReleaseOperand(s1);
  8655. (* push realtime flag: false by default *)
  8656. Emit(Push(position,false));
  8657. CallThis(position,"Heaps","NewSys",3);
  8658. (* ---- SYSTEM.CALL ----- *)
  8659. |Global.systemRef:
  8660. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8661. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8662. s0.mode := ModeValue;
  8663. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8664. result := s0
  8665. (* ---- INCR ----- *)
  8666. |Global.Incr:
  8667. Designate(p0,operand);
  8668. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8669. Dereference(operand,p0.type.resolved,FALSE);
  8670. END;
  8671. ASSERT(p1 # NIL);
  8672. Evaluate(p1,l);
  8673. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8674. ReleaseOperand(operand); ReleaseOperand(l);
  8675. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8676. (* ---- SUM ----- *)
  8677. |Global.Sum: HALT(200);
  8678. (* ---- ALL ----- *)
  8679. |Global.All: HALT(200);
  8680. (* ---- CAS ----- *)
  8681. |Global.Cas:
  8682. needsTrace := p0.NeedsTrace();
  8683. IF needsTrace THEN ModifyAssignments(true) END;
  8684. Designate(p0,s0);
  8685. Evaluate(p1,s1);
  8686. Evaluate(p2,s2);
  8687. IF needsTrace THEN
  8688. Emit(Push(position, s0.op));
  8689. Emit(Push(position, s1.op));
  8690. Emit(Push(position, s2.op));
  8691. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8692. ELSE
  8693. Emit(Cas(position,s0.op,s1.op,s2.op));
  8694. END;
  8695. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8696. IF needsTrace THEN ModifyAssignments(false) END;
  8697. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8698. Emit(Result(position, res));
  8699. result.op := res;
  8700. result.mode := ModeValue;
  8701. (*
  8702. IF conditional THEN
  8703. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8704. BrL(falseLabel);
  8705. ReleaseIntermediateOperand(res);
  8706. END;
  8707. *)
  8708. (* ---- DIM ----- *)
  8709. |Global.Dim:
  8710. Designate(p0,s0);
  8711. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8712. Dereference(s0,p0.type.resolved,FALSE);
  8713. END;
  8714. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8715. ReleaseOperand(s0);
  8716. (* ---- RESHAPE ----- *)
  8717. |Global.Reshape:
  8718. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8719. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8720. left.SetType(procedure.type);
  8721. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8722. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8723. END;
  8724. (* ---- SYSTEM.TYPECODE ----- *)
  8725. |Global.systemTypeCode:
  8726. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8727. IF type.resolved IS SyntaxTree.PointerType THEN
  8728. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8729. END;
  8730. result.op := TypeDescriptorAdr(type);
  8731. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8732. result.mode := ModeValue;
  8733. (* ---- SYSTEM.TRACE ----- *)
  8734. |Global.systemTrace:
  8735. SystemTrace(x.parameters, x.position);
  8736. (* ----- CONNECT ------*)
  8737. |Global.Connect:
  8738. IF backend.cellsAreObjects THEN
  8739. PushPort(p0);
  8740. PushPort(p1);
  8741. IF p2 # NIL THEN
  8742. Evaluate(p2, s2);
  8743. Emit(Push(p2.position, s2.op));
  8744. ReleaseOperand(s2);
  8745. ELSE
  8746. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8747. END;
  8748. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8749. ELSE
  8750. Warning(x.position, "cannot run on final hardware");
  8751. END;
  8752. (* ----- DELEGATE ------*)
  8753. |Global.Delegate:
  8754. IF backend.cellsAreObjects THEN
  8755. PushPort(p0);
  8756. PushPort(p1);
  8757. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8758. ELSE
  8759. Warning(x.position, "cannot run on final hardware");
  8760. END;
  8761. (* ----- SEND ------*)
  8762. |Global.Send:
  8763. Evaluate(p0,s0);
  8764. Evaluate(p1,s1);
  8765. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8766. Emit(Push(position,s0.op));
  8767. Emit(Push(position,s1.op));
  8768. (*
  8769. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8770. *)
  8771. IF ~backend.cellsAreObjects THEN
  8772. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8773. END;
  8774. ReleaseOperand(s0);
  8775. ReleaseOperand(s1);
  8776. IF backend.cellsAreObjects THEN
  8777. CallThis(position,"ActiveCellsRuntime","Send",2);
  8778. ELSE
  8779. CallThis(position,ChannelModuleName,"Send",2);
  8780. END;
  8781. (* ----- RECEIVE ------*)
  8782. |Global.Receive:
  8783. Evaluate(p0,s0);
  8784. Emit(Push(position,s0.op));
  8785. Designate(p1,s1);
  8786. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8787. Emit(Push(position,s1.op));
  8788. IF p2 # NIL THEN
  8789. Designate(p2,s2);
  8790. Emit(Push(position,s2.op));
  8791. END;
  8792. (*
  8793. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8794. *)
  8795. IF ~backend.cellsAreObjects THEN
  8796. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8797. END;
  8798. ReleaseOperand(s0);
  8799. ReleaseOperand(s1);
  8800. ReleaseOperand(s2);
  8801. IF backend.cellsAreObjects THEN
  8802. IF p2 = NIL THEN
  8803. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8804. ELSE
  8805. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8806. END;
  8807. ELSE
  8808. IF p2 = NIL THEN
  8809. CallThis(position,ChannelModuleName,"Receive",2)
  8810. ELSE
  8811. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8812. END;
  8813. END;
  8814. | Global.systemSpecial:
  8815. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8816. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8817. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8818. (* determine if parameters are of the VAR kind *)
  8819. ASSERT(x.parameters.Length() <= 3);
  8820. formalParameter := procedureType.firstParameter;
  8821. FOR i := 0 TO x.parameters.Length() - 1 DO
  8822. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8823. formalParameter := formalParameter.nextParameter
  8824. END;
  8825. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8826. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8827. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8828. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8829. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8830. IF procedureType.returnType # NIL THEN
  8831. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8832. Emit(Result(position, res));
  8833. (*InitOperand(result,ModeValue);
  8834. result.op := res;
  8835. *)
  8836. InitOperand(result,ModeValue); result.op := res;
  8837. END
  8838. ELSE (* function not yet implemented *)
  8839. Error(position,"not yet implemented");
  8840. END;
  8841. destination := dest;
  8842. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8843. END VisitBuiltinCallDesignator;
  8844. PROCEDURE EvaluateBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator; VAR result: Operand);
  8845. VAR
  8846. p0,p1,p2: SyntaxTree.Expression; len: LONGINT; l: Operand; res,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8847. s0,s1,s2: Operand; hint: HUGEINT;
  8848. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  8849. tmp:IntermediateCode.Operand;
  8850. t0,t1,t2: SyntaxTree.Type; ignore: Label;
  8851. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  8852. operand: Operand;
  8853. dest: IntermediateCode.Operand;
  8854. itype: IntermediateCode.Type;
  8855. convert: BOOLEAN;
  8856. customBuiltin: SyntaxTree.CustomBuiltin;
  8857. isVarPar: ARRAY 3 OF BOOLEAN;
  8858. callsection: Sections.Section;
  8859. segmentedName: Basic.SegmentedName;
  8860. needsTrace: BOOLEAN;
  8861. BEGIN
  8862. IF Trace THEN TraceEnter("EvaluateBuiltinCallDesignator") END;
  8863. dest := destination; destination := emptyOperand;
  8864. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  8865. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  8866. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  8867. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  8868. CASE x.id OF
  8869. (* ---- ASH, LSH, ROT ----- *)
  8870. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  8871. EvaluateX(p0, s0);
  8872. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  8873. (* make unsigned arguments in order to produced a logical shift *)
  8874. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  8875. convert:= TRUE;
  8876. itype := s0.op.type;
  8877. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  8878. Convert(s0.op,itype);
  8879. ELSE
  8880. convert := FALSE;
  8881. END;
  8882. END;
  8883. EvaluateX(p1,s1);
  8884. IF IsIntegerConstant(p1,hint) THEN
  8885. ReuseCopy(reg,s0.op);
  8886. IF hint > 0 THEN
  8887. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  8888. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  8889. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  8890. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  8891. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  8892. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  8893. END;
  8894. ELSIF hint < 0 THEN
  8895. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  8896. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  8897. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  8898. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  8899. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  8900. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  8901. END;
  8902. END;
  8903. ReleaseOperand(s0); ReleaseOperand(s1);
  8904. ELSE
  8905. exit := NewLabel();
  8906. end := NewLabel();
  8907. ReuseCopy(reg,s0.op);
  8908. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  8909. Reuse1(tmp,s1.op);
  8910. Emit(Neg(position,tmp,s1.op));
  8911. Convert(tmp,s1.op.type);
  8912. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  8913. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  8914. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  8915. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  8916. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  8917. END;
  8918. ReleaseIntermediateOperand(tmp);
  8919. BrL(end);
  8920. SetLabel(exit);
  8921. ReuseCopy(tmp,s1.op);
  8922. Convert(tmp,s1.op.type);
  8923. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  8924. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  8925. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  8926. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  8927. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  8928. END;
  8929. ReleaseIntermediateOperand(tmp);
  8930. SetLabel(end);
  8931. ReleaseOperand(s0); ReleaseOperand(s1);
  8932. END;
  8933. InitOperand(result,ModeValue);
  8934. IF convert THEN
  8935. itype := reg.type;
  8936. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  8937. Convert(reg,itype);
  8938. END;
  8939. result.op := reg;
  8940. (* ---- CAP ----- *)
  8941. |Global.Cap:
  8942. EvaluateX(p0,result);
  8943. ReuseCopy(reg,result.op);
  8944. ReleaseIntermediateOperand(result.op);
  8945. ignore := NewLabel();
  8946. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  8947. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  8948. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  8949. SetLabel(ignore);
  8950. result.op := reg;
  8951. (* ---- CHR ----- *)
  8952. |Global.Chr, Global.Chr32:
  8953. EvaluateX(p0, result);
  8954. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8955. |Global.Entier, Global.EntierH:
  8956. EvaluateX(p0, result);
  8957. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8958. (* ---- MIN and MAX ----- *)
  8959. |Global.Max,Global.Min:
  8960. EvaluateX(p0, s0);
  8961. EvaluateX(p1, s1);
  8962. Reuse2(res,s0.op,s1.op);
  8963. else := NewLabel();
  8964. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  8965. ELSE BrltL(else,s1.op,s0.op) END;
  8966. Emit(Mov(position,res,s0.op));
  8967. ReleaseOperand(s0);
  8968. end := NewLabel();
  8969. BrL(end);
  8970. SetLabel(else);
  8971. Emit(MovReplace(position,res,s1.op));
  8972. SetLabel(end);
  8973. ReleaseOperand(s1);
  8974. InitOperand(result,ModeValue);
  8975. result.op := res;
  8976. (* ---- ODD ----- *)
  8977. |Global.Odd:
  8978. EvaluateX(p0, result);
  8979. Reuse1(res,result.op);
  8980. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8981. ReleaseIntermediateOperand(result.op);
  8982. result.op := res;
  8983. Convert(result.op,bool);
  8984. (* ---- ORD ----- *)
  8985. |Global.Ord, Global.Ord32:
  8986. EvaluateX(p0, result);
  8987. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8988. (* ---- SHORT, LONG ----- *)
  8989. |Global.Short, Global.Long:
  8990. EvaluateX(p0, result);
  8991. IF x.type IS SyntaxTree.ComplexType THEN
  8992. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8993. Convert(result.op, IntermediateCode.GetType(system, componentType));
  8994. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  8995. ELSE
  8996. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8997. END
  8998. (* ---- LEN ----- *)
  8999. |Global.Len: (* dynamic length, static length done by checker *)
  9000. Designate(p0,operand);
  9001. IF p1 = NIL THEN
  9002. InitOperand(l,ModeValue);
  9003. l.op := IntermediateCode.Immediate(sizeType,0);
  9004. ELSE
  9005. Evaluate(p1,l);
  9006. END;
  9007. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  9008. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  9009. Dereference(operand, p0.type.resolved, FALSE);
  9010. END;
  9011. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  9012. ReleaseOperand(operand); ReleaseOperand(l);
  9013. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  9014. ASSERT(p1 # NIL);
  9015. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9016. Dereference(operand,p0.type.resolved,FALSE);
  9017. END;
  9018. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  9019. ReleaseOperand(operand); ReleaseOperand(l);
  9020. ELSE HALT(100);
  9021. END;
  9022. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9023. (* ---- FIRST ---- *)
  9024. |Global.First:
  9025. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9026. EvaluateX(p0(SyntaxTree.RangeExpression).first, result)
  9027. ELSE
  9028. Designate(p0, result)
  9029. END
  9030. (* ---- LAST ---- *)
  9031. |Global.Last:
  9032. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9033. EvaluateX(p0(SyntaxTree.RangeExpression).last, result)
  9034. ELSE
  9035. Designate(p0, result);
  9036. (* make sure result.op is a register *)
  9037. tmp := result.op;
  9038. ReuseCopy(result.op, result.op);
  9039. ReleaseIntermediateOperand(tmp);
  9040. (* add offset to result.op *)
  9041. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9042. END
  9043. (* ---- STEP ---- *)
  9044. |Global.Step:
  9045. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9046. EvaluateX(p0(SyntaxTree.RangeExpression).step, result)
  9047. ELSE
  9048. Designate(p0, result);
  9049. (* make sure result.op is a register *)
  9050. tmp := result.op;
  9051. ReuseCopy(result.op, result.op);
  9052. ReleaseIntermediateOperand(tmp);
  9053. (* add offset to result.op *)
  9054. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9055. END
  9056. (* ---- RE ---- *)
  9057. |Global.Re:
  9058. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  9059. Designate(p0, result)
  9060. ELSE
  9061. EvaluateX(p0, result)
  9062. END
  9063. (* ---- IM ---- *)
  9064. |Global.Im:
  9065. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  9066. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  9067. Designate(p0, result);
  9068. (* make sure result.op is a register *)
  9069. tmp := result.op;
  9070. ReuseCopy(result.op, result.op);
  9071. ReleaseIntermediateOperand(tmp);
  9072. (* add offset to result.op *)
  9073. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  9074. (* ---- ABS ----- *)
  9075. |Global.Abs:
  9076. EvaluateX(p0,operand);
  9077. type := p0.type.resolved;
  9078. InitOperand(result,ModeValue);
  9079. Reuse1a(result.op,operand.op,dest);
  9080. Emit(Abs(position,result.op,operand.op));
  9081. ReleaseOperand(operand);
  9082. (* ---- ADDRESSOF----- *)
  9083. |Global.systemAdr:
  9084. Designate(p0,s0);
  9085. s0.mode := ModeValue;
  9086. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  9087. ReleaseIntermediateOperand(s0.op);
  9088. s0.op := s0.tag;
  9089. IntermediateCode.InitOperand(s0.tag);
  9090. END;
  9091. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  9092. result := s0;
  9093. (* ---- BIT ----- *)
  9094. |Global.systemBit:
  9095. EvaluateX(p0,s0);
  9096. ToMemory(s0.op,addressType,0);
  9097. ReuseCopy(res,s0.op);
  9098. ReleaseOperand(s0);
  9099. EvaluateX(p1, s1);
  9100. Emit(Ror(position,res,res,s1.op));
  9101. ReleaseOperand(s1);
  9102. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  9103. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  9104. InitOperand(result,ModeValue);
  9105. result.op := res;
  9106. (* --- MSK ----*)
  9107. |Global.systemMsk:
  9108. EvaluateX(p0, s0);
  9109. EvaluateX(p1, s1);
  9110. ReuseCopy(res,s0.op);
  9111. ReleaseOperand(s0);
  9112. Emit(And(position,res,res,s1.op));
  9113. ReleaseOperand(s1);
  9114. InitOperand(result,ModeValue);
  9115. result.op := res;
  9116. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  9117. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  9118. EvaluateX(p0, s0);
  9119. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  9120. ReleaseOperand(s0);
  9121. InitOperand(result,ModeValue);
  9122. result.op := res;
  9123. (* ---- SYSTEM.GetStackPointer ----- *)
  9124. |Global.systemGetStackPointer:
  9125. InitOperand(result,ModeValue);
  9126. result.op := sp;
  9127. (* ---- SYSTEM.GetFramePointer ----- *)
  9128. |Global.systemGetFramePointer:
  9129. InitOperand(result,ModeValue);
  9130. result.op := fp;
  9131. (* ---- SYSTEM.GetActivity ----- *)
  9132. |Global.systemGetActivity:
  9133. ASSERT(backend.cooperative);
  9134. InitOperand(result,ModeValue);
  9135. result.op := ap;
  9136. (* ---- SYSTEM.SetStackPointer ----- *)
  9137. |Global.systemSetStackPointer:
  9138. Evaluate(p0,s0); (* *)
  9139. Emit(Mov(position,sp,s0.op));
  9140. ReleaseOperand(s0);
  9141. (* ---- SYSTEM.SetFramePointer ----- *)
  9142. |Global.systemSetFramePointer:
  9143. Evaluate(p0,s0); (* *)
  9144. Emit(Mov(position,fp,s0.op));
  9145. ReleaseOperand(s0);
  9146. (* ---- SYSTEM.Activity ----- *)
  9147. |Global.systemSetActivity:
  9148. ASSERT(backend.cooperative);
  9149. Evaluate(p0,s0); (* *)
  9150. Emit(Mov(position,ap,s0.op));
  9151. ReleaseOperand(s0);
  9152. (* ---- SYSTEM.VAL ----- *)
  9153. |Global.systemVal:
  9154. Expression(p1);
  9155. s1 := result;
  9156. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9157. IF s1.mode = ModeReference THEN
  9158. (* nothing to be done if not record type, just take over new type *)
  9159. IF (type IS SyntaxTree.RecordType) THEN
  9160. ReleaseIntermediateOperand(s1.tag);
  9161. s1.tag := TypeDescriptorAdr(type);
  9162. UseIntermediateOperand(s1.tag);
  9163. END;
  9164. result := s1;
  9165. ELSE (* copy over result to different type, may not use convert *)
  9166. itype := IntermediateCode.GetType(system,type);
  9167. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  9168. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  9169. Emit(Mov(position,s0.op,s1.op));
  9170. ReleaseOperand(s1);
  9171. InitOperand(result,ModeValue);
  9172. result.op := s0.op;
  9173. ELSE (* different size, must convert *)
  9174. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  9175. Convert(s1.op, IntermediateCode.GetType(system,type));
  9176. result := s1;
  9177. END;
  9178. END;
  9179. (* ---- SYSTEM.GET ----- *)
  9180. |Global.systemGet:
  9181. Evaluate(p0,s0); (* adr *)
  9182. Designate(p1,s1); (* variable *)
  9183. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  9184. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  9185. Emit(Mov(position,s1.op,s0.op));
  9186. ReleaseOperand(s1);
  9187. ReleaseOperand(s0);
  9188. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  9189. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  9190. Evaluate(p0,s0); (* *)
  9191. Evaluate(p1,s1); (* variable *)
  9192. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  9193. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  9194. (* real part *)
  9195. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  9196. Emit(Mov(position,res, s1.op));
  9197. ReleaseIntermediateOperand(res);
  9198. (* imaginary part *)
  9199. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9200. Emit(Mov(position,res, s1.tag));
  9201. ReleaseIntermediateOperand(res);
  9202. ReleaseOperand(s1);
  9203. ReleaseOperand(s0);
  9204. ELSE
  9205. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  9206. ReleaseOperand(s0);
  9207. Emit(Mov(position,res,s1.op));
  9208. ReleaseIntermediateOperand(res);
  9209. ReleaseOperand(s1);
  9210. END;
  9211. (* ---- SYSTEM.MOVE ----- *)
  9212. |Global.systemMove:
  9213. Evaluate(p0,s0);
  9214. Evaluate(p1,s1);
  9215. Evaluate(p2,s2);
  9216. Emit(Copy(position,s1.op,s0.op,s2.op));
  9217. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9218. (* ---- SYSTEM.NEW ----- *)
  9219. |Global.systemNew:
  9220. Designate(p0,s0);
  9221. Emit(Push(position,s0.op));
  9222. ReleaseOperand(s0);
  9223. Evaluate(p1,s1);
  9224. Emit(Push(position,s1.op));
  9225. ReleaseOperand(s1);
  9226. (* push realtime flag: false by default *)
  9227. Emit(Push(position,false));
  9228. CallThis(position,"Heaps","NewSys",3);
  9229. (* ---- SYSTEM.CALL ----- *)
  9230. |Global.systemRef:
  9231. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  9232. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  9233. s0.mode := ModeValue;
  9234. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  9235. result := s0
  9236. (* ---- INCR ----- *)
  9237. |Global.Incr:
  9238. Designate(p0,operand);
  9239. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9240. Dereference(operand,p0.type.resolved,FALSE);
  9241. END;
  9242. ASSERT(p1 # NIL);
  9243. Evaluate(p1,l);
  9244. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  9245. ReleaseOperand(operand); ReleaseOperand(l);
  9246. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9247. (* ---- SUM ----- *)
  9248. |Global.Sum: HALT(200);
  9249. (* ---- ALL ----- *)
  9250. |Global.All: HALT(200);
  9251. (* ---- CAS ----- *)
  9252. |Global.Cas:
  9253. needsTrace := p0.NeedsTrace();
  9254. IF needsTrace THEN ModifyAssignments(true) END;
  9255. Designate(p0,s0);
  9256. Evaluate(p1,s1);
  9257. Evaluate(p2,s2);
  9258. IF needsTrace THEN
  9259. Emit(Push(position, s0.op));
  9260. Emit(Push(position, s1.op));
  9261. Emit(Push(position, s2.op));
  9262. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  9263. ELSE
  9264. Emit(Cas(position,s0.op,s1.op,s2.op));
  9265. END;
  9266. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9267. IF needsTrace THEN ModifyAssignments(false) END;
  9268. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  9269. Emit(Result(position, res));
  9270. result.op := res;
  9271. result.mode := ModeValue;
  9272. (*
  9273. IF conditional THEN
  9274. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  9275. BrL(falseLabel);
  9276. ReleaseIntermediateOperand(res);
  9277. END;
  9278. *)
  9279. (* ---- DIM ----- *)
  9280. |Global.Dim:
  9281. Designate(p0,s0);
  9282. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9283. Dereference(s0,p0.type.resolved,FALSE);
  9284. END;
  9285. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  9286. ReleaseOperand(s0);
  9287. (* ---- SYSTEM.TYPECODE ----- *)
  9288. |Global.systemTypeCode:
  9289. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9290. IF type.resolved IS SyntaxTree.PointerType THEN
  9291. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  9292. END;
  9293. result.op := TypeDescriptorAdr(type);
  9294. Convert(result.op, IntermediateCode.GetType(system,x.type));
  9295. result.mode := ModeValue;
  9296. (* ---- SYSTEM.TRACE ----- *)
  9297. |Global.systemTrace:
  9298. SystemTrace(x.parameters, x.position);
  9299. (* ----- CONNECT ------*)
  9300. |Global.Connect:
  9301. IF backend.cellsAreObjects THEN
  9302. PushPort(p0);
  9303. PushPort(p1);
  9304. IF p2 # NIL THEN
  9305. Evaluate(p2, s2);
  9306. Emit(Push(p2.position, s2.op));
  9307. ReleaseOperand(s2);
  9308. ELSE
  9309. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  9310. END;
  9311. CallThis(position,"ActiveCellsRuntime","Connect",3);
  9312. ELSE
  9313. Warning(x.position, "cannot run on final hardware");
  9314. END;
  9315. | Global.systemSpecial:
  9316. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  9317. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  9318. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  9319. (* determine if parameters are of the VAR kind *)
  9320. ASSERT(x.parameters.Length() <= 3);
  9321. formalParameter := procedureType.firstParameter;
  9322. FOR i := 0 TO x.parameters.Length() - 1 DO
  9323. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  9324. formalParameter := formalParameter.nextParameter
  9325. END;
  9326. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  9327. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  9328. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  9329. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  9330. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9331. IF procedureType.returnType # NIL THEN
  9332. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9333. Emit(Result(position, res));
  9334. (*InitOperand(result,ModeValue);
  9335. result.op := res;
  9336. *)
  9337. InitOperand(result,ModeValue); result.op := res;
  9338. END
  9339. ELSE (* function not yet implemented *)
  9340. Error(position,"not yet implemented");
  9341. END;
  9342. destination := dest;
  9343. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  9344. END EvaluateBuiltinCallDesignator;
  9345. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  9346. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  9347. BEGIN
  9348. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  9349. dest := destination; destination := emptyOperand;
  9350. Expression(x.left);
  9351. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  9352. ELSIF isUnchecked THEN (* no check *)
  9353. ELSE
  9354. trueL := NewLabel();
  9355. IF IsPointerToRecord(x.left.type,recordType) THEN
  9356. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  9357. Emit(Mov(position,tag, result.op));
  9358. IF result.mode # ModeValue THEN
  9359. ptr := tag;
  9360. IntermediateCode.MakeMemory(ptr,addressType);
  9361. Emit(Mov(position,tag, ptr));
  9362. END;
  9363. IF ~backend.cooperative THEN
  9364. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9365. END;
  9366. IntermediateCode.MakeMemory(tag,addressType);
  9367. ELSE
  9368. tag := result.tag;
  9369. UseIntermediateOperand(tag);
  9370. END;
  9371. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  9372. ReleaseIntermediateOperand(tag);
  9373. EmitTrap(position,TypeCheckTrap);
  9374. SetLabel(trueL);
  9375. END;
  9376. destination := dest;
  9377. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  9378. END VisitTypeGuardDesignator;
  9379. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  9380. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  9381. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  9382. VAR label: Label; pc: LONGINT;
  9383. BEGIN
  9384. IF backend.cooperative & ~isUnchecked THEN
  9385. pc := section.pc;
  9386. label := NewLabel();
  9387. BrneL(label, operand.op, nil);
  9388. EmitTrap(position, NilPointerTrap);
  9389. SetLabel(label);
  9390. INC(statCoopNilCheck, section.pc - pc);
  9391. END;
  9392. END NilCheck;
  9393. BEGIN
  9394. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  9395. ReuseCopy(dereferenced,operand.op);
  9396. ReleaseOperand(operand);
  9397. operand.mode := ModeReference;
  9398. operand.op := dereferenced;
  9399. operand.tag := dereferenced;
  9400. UseIntermediateOperand(operand.tag);
  9401. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  9402. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  9403. ReleaseIntermediateOperand(operand.tag);
  9404. operand.tag := TypeDescriptorAdr(type);
  9405. ELSE
  9406. IF ~backend.cooperative THEN
  9407. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9408. END;
  9409. IntermediateCode.MakeMemory(operand.tag,addressType);
  9410. END;
  9411. NilCheck(operand.op);
  9412. ELSIF type IS SyntaxTree.ArrayType THEN
  9413. IF isUnsafe THEN
  9414. NilCheck(operand.op);
  9415. ReleaseIntermediateOperand(operand.tag);
  9416. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  9417. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9418. ELSE
  9419. operand.tag := emptyOperand;
  9420. END;
  9421. ELSE
  9422. NilCheck(operand.op);
  9423. IF backend.cooperative THEN
  9424. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  9425. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9426. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  9427. ELSE
  9428. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  9429. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  9430. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9431. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  9432. END;
  9433. END;
  9434. ELSIF type IS SyntaxTree.MathArrayType THEN
  9435. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9436. IntermediateCode.MakeMemory(operand.op,addressType);
  9437. ELSE HALT(100);
  9438. END;
  9439. END Dereference;
  9440. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  9441. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  9442. BEGIN
  9443. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  9444. dest := destination; destination := emptyOperand;
  9445. Evaluate(x.left,d);
  9446. type := x.type.resolved;
  9447. prevIsUnchecked := isUnchecked;
  9448. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  9449. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  9450. END;
  9451. Dereference(d,type,IsUnsafePointer(x.left.type));
  9452. isUnchecked := prevIsUnchecked;
  9453. result := d;
  9454. 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
  9455. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  9456. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9457. END;
  9458. END;
  9459. destination := dest;
  9460. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  9461. END VisitDereferenceDesignator;
  9462. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  9463. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  9464. BEGIN
  9465. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  9466. dest := destination; destination := emptyOperand;
  9467. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  9468. tag := result.op;
  9469. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  9470. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  9471. StaticCallOperand(result,procedure.super);
  9472. ReleaseIntermediateOperand(result.tag);
  9473. UseIntermediateOperand(tag); (* necessary ? *)
  9474. result.tag := tag;
  9475. destination := dest;
  9476. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  9477. END VisitSupercallDesignator;
  9478. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  9479. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  9480. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9481. name: Basic.SegmentedName;
  9482. procedure: SyntaxTree.Procedure;
  9483. procedureType: SyntaxTree.ProcedureType;
  9484. BEGIN
  9485. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  9486. dest := destination; destination := emptyOperand;
  9487. scope := currentScope;
  9488. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9489. scope := scope.outerScope;
  9490. END;
  9491. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9492. moduleSection := meta.ModuleSection();
  9493. IF backend.cooperative THEN
  9494. moduleOffset := 0;
  9495. ELSE
  9496. moduleOffset := moduleSection.pc;
  9497. END;
  9498. result.mode := ModeValue;
  9499. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9500. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9501. result.mode := ModeValue;
  9502. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  9503. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  9504. ELSE
  9505. GetBaseRegister(basereg,currentScope,scope);
  9506. InitOperand(result,ModeReference);
  9507. result.op := basereg;
  9508. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9509. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9510. parametersSize := ProcParametersSize(procedure);
  9511. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9512. IF backend.cooperative THEN
  9513. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  9514. END;
  9515. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  9516. MakeMemory(result.op, result.op, addressType, 0);
  9517. END;
  9518. (* tag must be loaded when dereferencing SELF pointer *)
  9519. END;
  9520. destination := dest;
  9521. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  9522. END VisitSelfDesignator;
  9523. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  9524. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  9525. BEGIN
  9526. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  9527. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9528. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9529. parameter := procedureType.returnParameter;
  9530. IF currentIsInline THEN
  9531. map := currentMapper.Get(NIL);
  9532. IF map # NIL THEN
  9533. Designate(map.to, result);
  9534. ELSE
  9535. HALT(200);
  9536. END;
  9537. RETURN;
  9538. END;
  9539. VisitParameter(parameter);
  9540. IF Trace THEN TraceExit("VisitResultDesignator") END;
  9541. END VisitResultDesignator;
  9542. (** values *)
  9543. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  9544. BEGIN
  9545. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  9546. InitOperand(result,ModeValue);
  9547. IF x.value THEN result.op := true ELSE result.op := false END;
  9548. END VisitBooleanValue;
  9549. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  9550. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  9551. BEGIN
  9552. Global.GetModuleSegmentedName(module.module, name);
  9553. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  9554. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  9555. RETURN section
  9556. END GetDataSection;
  9557. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  9558. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  9559. BEGIN
  9560. type := vop.type;
  9561. data := GetDataSection();
  9562. pc := EnterImmediate(data,vop);
  9563. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  9564. IntermediateCode.MakeMemory(vop, type);
  9565. END GetImmediateMem;
  9566. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  9567. BEGIN
  9568. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  9569. InitOperand(result,ModeValue);
  9570. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9571. IF ~supportedImmediate(result.op) &~inData THEN
  9572. GetImmediateMem(result.op)
  9573. END;
  9574. END VisitIntegerValue;
  9575. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  9576. BEGIN
  9577. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  9578. InitOperand(result,ModeValue);
  9579. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  9580. END VisitCharacterValue;
  9581. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  9582. BEGIN
  9583. IF Trace THEN TraceEnter("VisitSetValue") END;
  9584. InitOperand(result,ModeValue);
  9585. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  9586. END VisitSetValue;
  9587. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  9588. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  9589. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  9590. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  9591. BEGIN
  9592. numberElements := x.elements.Length();
  9593. FOR i := 0 TO numberElements-1 DO
  9594. expression := x.elements.GetExpression(i);
  9595. IF expression IS SyntaxTree.MathArrayExpression THEN
  9596. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  9597. ELSE
  9598. inData := TRUE;
  9599. Evaluate(expression,op);
  9600. irv.Emit(Data(position,op.op));
  9601. inData := FALSE;
  9602. ReleaseOperand(op);
  9603. END;
  9604. END;
  9605. END RecursiveData;
  9606. BEGIN
  9607. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  9608. IF ~TryConstantDeclaration() THEN
  9609. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9610. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9611. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9612. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  9613. ELSE
  9614. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9615. END;
  9616. RecursiveData(x.array);
  9617. InitOperand(result,ModeReference);
  9618. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9619. END
  9620. END VisitMathArrayValue;
  9621. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  9622. VAR constant: Sections.Section;
  9623. BEGIN
  9624. IF constantDeclaration = NIL THEN
  9625. RETURN FALSE
  9626. ELSE
  9627. (* Is a constant in this module: did we generate it already? *)
  9628. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  9629. IF constant # NIL THEN
  9630. InitOperand(result,ModeReference);
  9631. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  9632. RETURN TRUE;
  9633. END;
  9634. END;
  9635. RETURN FALSE
  9636. END TryConstantDeclaration;
  9637. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  9638. BEGIN
  9639. constantDeclaration := x;
  9640. VExpression(x.value.resolved);
  9641. END VisitConstant;
  9642. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  9643. BEGIN
  9644. IF Trace THEN TraceEnter("VisitRealValue") END;
  9645. InitOperand(result,ModeValue);
  9646. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9647. END VisitRealValue;
  9648. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  9649. VAR
  9650. componentType: SyntaxTree.Type;
  9651. BEGIN
  9652. IF Trace THEN TraceEnter("VisitComplexValue") END;
  9653. ASSERT(x.type IS SyntaxTree.ComplexType);
  9654. componentType := x.type(SyntaxTree.ComplexType).componentType;
  9655. InitOperand(result,ModeValue);
  9656. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  9657. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  9658. END VisitComplexValue;
  9659. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  9660. VAR i: LONGINT; name: Basic.SegmentedName;
  9661. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  9662. BEGIN
  9663. IF Trace THEN TraceEnter("VisitStringValue") END;
  9664. IF ~TryConstantDeclaration() THEN
  9665. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9666. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9667. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9668. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9669. ELSE
  9670. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9671. END;
  9672. FOR i := 0 TO x.length-1 DO
  9673. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  9674. irv.Emit(Data(position,op));
  9675. END;
  9676. InitOperand(result,ModeReference);
  9677. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9678. result.tag := IntermediateCode.Immediate(addressType,x.length);
  9679. END
  9680. END VisitStringValue;
  9681. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  9682. BEGIN
  9683. IF Trace THEN TraceEnter("VisitNilValue") END;
  9684. InitOperand(result,ModeValue);
  9685. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9686. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9687. END VisitNilValue;
  9688. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  9689. BEGIN
  9690. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  9691. InitOperand(result,ModeValue);
  9692. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  9693. END VisitEnumerationValue;
  9694. (** symbols *)
  9695. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  9696. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  9697. END VisitImport;
  9698. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  9699. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  9700. BEGIN
  9701. WHILE (scope # NIL) & (scope IS SyntaxTree.BlockScope) DO
  9702. scope := scope.outerScope;
  9703. END;
  9704. IF scope # baseScope THEN
  9705. (* left := [fp+8] *)
  9706. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  9707. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9708. ReuseCopy(left,right);
  9709. ReleaseIntermediateOperand(right);
  9710. scope := scope.outerScope; DEC(level);
  9711. (* { left := [left+8] } *)
  9712. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  9713. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9714. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  9715. Emit(Mov(position,left,right));
  9716. scope := scope.outerScope; DEC(level);
  9717. END;
  9718. ASSERT((scope = baseScope) OR (baseScope = NIL));
  9719. result := left;
  9720. ELSE
  9721. result := fp;
  9722. END;
  9723. END GetBaseRegister;
  9724. (* EXPERIMENTAL *)
  9725. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  9726. VAR i: WORD;
  9727. BEGIN
  9728. IF ~backend.experiment THEN RETURN -1 END;
  9729. i := 0;
  9730. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  9731. INC(i);
  9732. END;
  9733. IF availableSymbols[i].symbol = NIL THEN
  9734. availableSymbols[i].inRegister := FALSE;
  9735. availableSymbols[i].inMemory := TRUE;
  9736. availableSymbols[i].symbol := x;
  9737. END;
  9738. RETURN i;
  9739. END GetAvailability;
  9740. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  9741. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  9742. BEGIN
  9743. IF Trace THEN TraceEnter("VisitVariable"); END;
  9744. type := x.type.resolved;
  9745. IF (x.useRegister) THEN
  9746. InitOperand(result, ModeValue);
  9747. IF x.registerNumber < 0 THEN
  9748. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  9749. reg := x.registerNumber;
  9750. ELSE
  9751. reg := registerUsageCount.Map(x.registerNumber);
  9752. UseRegister(reg);
  9753. END;
  9754. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  9755. ELSIF x.externalName # NIL THEN
  9756. InitOperand(result,ModeReference);
  9757. Basic.ToSegmentedName(x.externalName^, name);
  9758. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  9759. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  9760. InitOperand(result,ModeReference);
  9761. GetBaseRegister(result.op,currentScope,x.scope);
  9762. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9763. (* EXPERIMENTAL *)
  9764. result.availability := GetAvailability(x);
  9765. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  9766. InitOperand(result,ModeReference);
  9767. GetCodeSectionNameForSymbol(x,name);
  9768. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9769. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9770. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  9771. InitOperand(result,ModeReference);
  9772. GetCodeSectionNameForSymbol(x,name);
  9773. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9774. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  9775. ELSE (* field, left designator must have been emitted *)
  9776. ASSERT(result.mode = ModeReference);
  9777. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9778. ReuseCopy(temp,result.op);
  9779. ReleaseIntermediateOperand(result.op);
  9780. result.op := temp;
  9781. END;
  9782. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9783. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  9784. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9785. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  9786. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9787. END;
  9788. END;
  9789. END;
  9790. IF type IS SyntaxTree.ProcedureType THEN
  9791. ReleaseIntermediateOperand(result.tag);
  9792. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9793. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9794. UseIntermediateOperand(result.tag);
  9795. ELSE
  9796. result.tag := nil; (* nil *)
  9797. END;
  9798. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9799. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  9800. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9801. ReleaseIntermediateOperand(result.tag);
  9802. Global.GetSymbolSegmentedName(x,name);
  9803. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  9804. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  9805. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  9806. ELSE
  9807. END;
  9808. ELSE
  9809. ReleaseIntermediateOperand(result.tag);
  9810. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9811. END;
  9812. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9813. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  9814. ReleaseIntermediateOperand(result.tag);
  9815. result.tag := result.op;
  9816. UseIntermediateOperand(result.tag);
  9817. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9818. IntermediateCode.MakeMemory(result.op,addressType);
  9819. END;
  9820. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  9821. ReleaseIntermediateOperand(result.tag);
  9822. result.tag := TypeDescriptorAdr(type);
  9823. UseIntermediateOperand(result.tag);
  9824. (* tag for pointer type computed not here but during dereferencing *)
  9825. END;
  9826. IF Trace THEN TraceExit("VisitVariable") END;
  9827. END VisitVariable;
  9828. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  9829. BEGIN
  9830. VisitVariable(property);
  9831. END VisitProperty;
  9832. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  9833. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  9834. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  9835. BEGIN
  9836. type := x.type.resolved;
  9837. IF Trace THEN TraceEnter("VisitParameter") END;
  9838. IF x.ownerType IS SyntaxTree.CellType THEN
  9839. ptype := x.type.resolved;
  9840. IF backend.cellsAreObjects THEN
  9841. ASSERT(result.mode = ModeReference);
  9842. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9843. ReuseCopy(temp,result.op);
  9844. ReleaseIntermediateOperand(result.op);
  9845. result.op := temp;
  9846. END;
  9847. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9848. RETURN;
  9849. ELSE
  9850. InitOperand(result,ModeReference);
  9851. GetCodeSectionNameForSymbol(x,name);
  9852. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9853. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9854. RETURN;
  9855. END;
  9856. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9857. InitOperand(result,ModeReference);
  9858. GetCodeSectionNameForSymbol(x,name);
  9859. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9860. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9861. RETURN
  9862. ELSE
  9863. GetBaseRegister(basereg,currentScope,x.scope);
  9864. InitOperand(result,ModeReference);
  9865. result.op := basereg;
  9866. END;
  9867. IF IsOpenArray(type) THEN
  9868. result.tag := basereg;
  9869. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9870. IntermediateCode.MakeMemory(result.op,addressType);
  9871. IF Global.IsOberonProcedure(x.ownerType) THEN
  9872. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9873. UseIntermediateOperand(result.tag);
  9874. ELSE
  9875. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9876. END;
  9877. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9878. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9879. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9880. ELSIF IsStaticArray(type) THEN
  9881. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9882. IntermediateCode.MakeMemory(result.op,addressType);
  9883. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9884. ELSIF type IS SyntaxTree.MathArrayType THEN
  9885. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9886. WITH type: SyntaxTree.MathArrayType DO
  9887. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9888. IF type.form = SyntaxTree.Tensor THEN
  9889. ELSIF type.form = SyntaxTree.Open THEN
  9890. result.tag := result.op;
  9891. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9892. IntermediateCode.MakeMemory(result.op,addressType);
  9893. UseIntermediateOperand(result.tag);
  9894. ELSIF type.form = SyntaxTree.Static THEN
  9895. IF x.kind = SyntaxTree.ConstParameter THEN
  9896. IntermediateCode.MakeMemory(result.op,addressType);
  9897. END;
  9898. ELSE HALT(100)
  9899. END;
  9900. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9901. IF type.form = SyntaxTree.Tensor THEN
  9902. ToMemory(result.op,addressType,0);
  9903. ELSIF type.form = SyntaxTree.Open THEN
  9904. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9905. ReuseCopy(result.tag, mem);
  9906. ReleaseIntermediateOperand(mem);
  9907. ReleaseIntermediateOperand(result.op);
  9908. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9909. ELSIF type.form = SyntaxTree.Static THEN
  9910. IntermediateCode.MakeMemory(result.op,addressType);
  9911. ELSE HALT(100)
  9912. END;
  9913. ELSE HALT(100)
  9914. END;
  9915. END;
  9916. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9917. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9918. IntermediateCode.MakeMemory(result.op,addressType);
  9919. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9920. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9921. END;
  9922. IF type IS SyntaxTree.ProcedureType THEN
  9923. ReleaseIntermediateOperand(result.tag);
  9924. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9925. IF x.kind = SyntaxTree.VarParameter THEN
  9926. ReuseCopy(result.tag,result.op);
  9927. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9928. IntermediateCode.MakeMemory(result.tag,addressType);
  9929. ELSE
  9930. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9931. UseIntermediateOperand(result.tag);
  9932. END;
  9933. ELSE
  9934. result.tag := nil;
  9935. END;
  9936. (* tag for pointer type computed not here but during dereferencing *)
  9937. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) (* & ~(x.selfParameter) *) THEN
  9938. ReleaseIntermediateOperand(result.tag);
  9939. result.tag := basereg;
  9940. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9941. IntermediateCode.MakeMemory(result.tag,addressType);
  9942. UseIntermediateOperand(result.tag);
  9943. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9944. ReleaseIntermediateOperand(result.tag);
  9945. result.tag := TypeDescriptorAdr(type);
  9946. UseIntermediateOperand(result.tag);
  9947. END;
  9948. IF Trace THEN TraceExit("VisitParameter") END;
  9949. END VisitParameter;
  9950. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9951. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9952. BEGIN
  9953. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9954. (* left.p: left already emitted *)
  9955. tag := result.op; (* value of pointer to left *)
  9956. (* get type desc *)
  9957. tmp := result.tag;
  9958. IntermediateCode.MakeMemory(tmp,addressType);
  9959. (* get method adr *)
  9960. Reuse1(reg,tmp);
  9961. ReleaseIntermediateOperand(tmp);
  9962. IF backend.cooperative THEN
  9963. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9964. WHILE recordType.baseType # NIL DO
  9965. recordType := recordType.GetBaseRecord ();
  9966. END;
  9967. GetRecordTypeName (recordType,name);
  9968. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9969. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9970. offset := 0;
  9971. ELSE
  9972. offset := 2;
  9973. END;
  9974. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9975. ELSIF meta.simple THEN
  9976. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9977. ELSE
  9978. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9979. END;
  9980. InitOperand(operand,ModeReference);
  9981. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9982. operand.op := reg;
  9983. operand.tag := tag;
  9984. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9985. END DynamicCallOperand;
  9986. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9987. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9988. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9989. BEGIN
  9990. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9991. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9992. tag := operand.op;
  9993. ReleaseIntermediateOperand(operand.tag);
  9994. ELSE tag := nil
  9995. END;
  9996. IF x.isInline THEN
  9997. sectionType := Sections.InlineCodeSection;
  9998. ELSE
  9999. sectionType := Sections.CodeSection;
  10000. END;
  10001. IF x.externalName # NIL THEN
  10002. Basic.ToSegmentedName(x.externalName^, name);
  10003. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  10004. ELSE
  10005. GetCodeSectionNameForSymbol(x, name);
  10006. IF (x.scope.ownerModule = module.module) THEN
  10007. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10008. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  10009. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10010. IF source.pc = 0 THEN (* no code yet *)
  10011. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  10012. END;
  10013. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  10014. bits := x.procedureScope.body.code.inlineCode;
  10015. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  10016. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  10017. binary.CopyBits(bits, 0, bits.GetSize());
  10018. source.SetResolved(binary);
  10019. ELSE
  10020. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  10021. END;
  10022. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  10023. END;
  10024. InitOperand(operand,ModeValue);
  10025. operand.op := reg;
  10026. operand.tag := tag;
  10027. IF Trace THEN TraceExit("StaticCallOperand") END;
  10028. END StaticCallOperand;
  10029. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  10030. (* handle expressions of the form designator.procedure or procedure *)
  10031. BEGIN
  10032. IF Trace THEN TraceEnter("VisitProcedure") END;
  10033. EndBasicBlock;
  10034. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  10035. DynamicCallOperand(result,x);
  10036. ELSIF x.isInline THEN
  10037. StaticCallOperand(result,x);
  10038. ELSE
  10039. StaticCallOperand(result,x);
  10040. END;
  10041. IF Trace THEN TraceExit("VisitProcedure") END;
  10042. END VisitProcedure;
  10043. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  10044. BEGIN
  10045. VisitProcedure(x);
  10046. END VisitOperator;
  10047. PROCEDURE VisitAlias(x: SyntaxTree.Alias);
  10048. BEGIN
  10049. VExpression(x.expression);
  10050. END VisitAlias;
  10051. (** statements *)
  10052. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  10053. BEGIN
  10054. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  10055. Expression(x.call);
  10056. IF (x.call.type # NIL) THEN (* procedure returning ignored value *)
  10057. ReleaseOperand(result)
  10058. END;
  10059. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  10060. END VisitProcedureCallStatement;
  10061. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  10062. VAR leftType, rightType: SyntaxTree.MathArrayType;
  10063. leftBase, rightBase: SyntaxTree.Type;
  10064. procedureName,s: SyntaxTree.IdentifierString;
  10065. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  10066. size: LONGINT; rightKind: LONGINT;
  10067. dummy: IntermediateCode.Operand;
  10068. CONST moduleName = "FoxArrayBase";
  10069. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  10070. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  10071. BEGIN
  10072. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  10073. IF base IS SyntaxTree.MathArrayType THEN
  10074. base := OpenArray(base(SyntaxTree.MathArrayType));
  10075. END;
  10076. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  10077. result.SetArrayBase(base);
  10078. RETURN result
  10079. END OpenArray;
  10080. BEGIN
  10081. IF AddImport(moduleName,arrayBase,TRUE) THEN
  10082. SaveRegisters();ReleaseUsedRegisters(saved);
  10083. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  10084. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  10085. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  10086. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  10087. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  10088. IF leftType.form = SyntaxTree.Tensor THEN
  10089. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  10090. ELSIF leftType.form = SyntaxTree.Open THEN
  10091. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  10092. ELSIF leftType.form = SyntaxTree.Static THEN
  10093. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  10094. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  10095. END;
  10096. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  10097. IF procedure = NIL THEN
  10098. s := "Instruction not supported on target, emulation procedure ";
  10099. Strings.Append(s,moduleName);
  10100. Strings.Append(s,".");
  10101. Strings.Append(s,procedureName);
  10102. Strings.Append(s," not present");
  10103. Error(position,s);
  10104. ELSE
  10105. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  10106. parameter.SetType(leftType);
  10107. parameter.SetAccess(SyntaxTree.Internal);
  10108. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10109. parameter.SetKind(rightKind);
  10110. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10111. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  10112. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  10113. StaticCallOperand(result,procedure);
  10114. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  10115. ReleaseOperand(result);
  10116. END;
  10117. RestoreRegisters(saved);
  10118. END;
  10119. END AssignMathArray;
  10120. VAR modifyAssignmentCounter := 0: LONGINT;
  10121. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  10122. VAR processor,mem,dst: IntermediateCode.Operand;
  10123. BEGIN
  10124. IF value.intValue = true.intValue THEN
  10125. INC(modifyAssignmentCounter);
  10126. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  10127. modifyAssignmentsPC := section.pc;
  10128. ELSE
  10129. DEC(modifyAssignmentCounter);
  10130. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  10131. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  10132. END;
  10133. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  10134. dst := NewRegisterOperand (addressType);
  10135. Emit(Mov(position,dst, processor));
  10136. IntermediateCode.InitMemory(mem,bool, dst, 0);
  10137. Emit(Mov(position,mem, value));
  10138. ReleaseIntermediateOperand(dst);
  10139. END ModifyAssignments;
  10140. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  10141. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  10142. BEGIN
  10143. type := left.type.resolved;
  10144. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  10145. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  10146. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  10147. IF procedureType.returnParameter = parameter THEN
  10148. (* this is the only case where the destination can be dynamically smaller than the source
  10149. in all other cases the dynamic size has to be taken
  10150. *)
  10151. IF backend.cooperative THEN
  10152. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  10153. ELSE
  10154. MakeMemory(mem, tag, addressType, 0);
  10155. END;
  10156. RETURN mem;
  10157. END;
  10158. END;
  10159. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  10160. END CopySize;
  10161. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  10162. VAR
  10163. leftO, rightO: Operand;
  10164. arg,mem, sizeOp: IntermediateCode.Operand;
  10165. leftType, rightType, componentType, base: SyntaxTree.Type;
  10166. size: LONGINT;
  10167. parameters: SyntaxTree.ExpressionList;
  10168. procedure: SyntaxTree.Procedure;
  10169. call: SyntaxTree.ProcedureCallDesignator;
  10170. designator: SyntaxTree.Designator;
  10171. saved: RegisterEntry;
  10172. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  10173. VAR procedureType: SyntaxTree.ProcedureType;
  10174. BEGIN
  10175. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  10176. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  10177. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  10178. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  10179. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  10180. WITH right: SyntaxTree.BuiltinCallDesignator DO
  10181. IF right.id = Global.Reshape THEN RETURN TRUE
  10182. END;
  10183. END;
  10184. END;
  10185. END;
  10186. RETURN FALSE
  10187. END CanPassAsResultParameter;
  10188. BEGIN
  10189. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  10190. leftType := left.type.resolved; rightType:= right.type.resolved;
  10191. IF backend.cooperative & left.NeedsTrace() THEN
  10192. ModifyAssignments(true);
  10193. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  10194. Designate(right, rightO);
  10195. Designate(left, leftO);
  10196. ASSERT(leftO.mode = ModeReference);
  10197. TransferToRegister(leftO.op, leftO.op);
  10198. TransferToRegister(rightO.op, rightO.op);
  10199. Emit(Push(position, leftO.op));
  10200. Emit(Push(position, rightO.op));
  10201. CallAssignMethod(leftO.op, rightO.op, left.type);
  10202. Emit(Pop(position, rightO.op));
  10203. Emit(Pop(position, leftO.op));
  10204. sizeOp := CopySize(left, leftO.tag);
  10205. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10206. ReleaseIntermediateOperand(sizeOp);
  10207. ReleaseOperand(leftO);
  10208. ReleaseOperand(rightO);
  10209. ELSE
  10210. Evaluate(right,rightO);
  10211. Designate(left,leftO);
  10212. ASSERT(leftO.mode = ModeReference);
  10213. IF (leftType IS SyntaxTree.ProcedureType) THEN
  10214. (* copy procedure address first *)
  10215. MakeMemory(mem,leftO.op,addressType,0);
  10216. Emit(Mov(position,mem,rightO.op));
  10217. ReleaseIntermediateOperand(mem);
  10218. (* copy pointer address *)
  10219. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10220. CallAssignPointer(leftO.tag, rightO.tag);
  10221. ELSE
  10222. ASSERT(system.SizeOf(left.type) = system.addressSize);
  10223. CallAssignPointer(leftO.op, rightO.op);
  10224. END;
  10225. ReleaseOperand(leftO);
  10226. ReleaseOperand(rightO);
  10227. END;
  10228. ModifyAssignments(false);
  10229. RETURN;
  10230. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  10231. SaveRegisters();ReleaseUsedRegisters(saved);
  10232. IF SemanticChecker.IsPointerType(leftType) THEN
  10233. Evaluate(right,rightO);
  10234. Designate(left,leftO);
  10235. Emit(Push(position,leftO.op));
  10236. ReleaseOperand(leftO);
  10237. Emit(Push(position,rightO.op));
  10238. ReleaseOperand(rightO);
  10239. CallThis(position,"Heaps","Assign",2);
  10240. ELSIF leftType.IsRecordType() THEN
  10241. Designate(right,rightO);
  10242. Designate(left,leftO);
  10243. Emit(Push(position,leftO.op));
  10244. Emit(Push(position,leftO.tag)); (* type desc *)
  10245. ReleaseOperand(leftO);
  10246. Emit(Push(position,rightO.op));
  10247. ReleaseOperand(rightO);
  10248. CallThis(position,"Heaps","AssignRecord",3);
  10249. ELSIF IsStaticArray(leftType) THEN
  10250. size := StaticArrayNumElements(leftType);
  10251. base := StaticArrayBaseType(leftType);
  10252. Designate(right,rightO);
  10253. Designate(left,leftO);
  10254. Emit(Push(position,leftO.op));
  10255. ReleaseOperand(leftO);
  10256. arg := TypeDescriptorAdr(base);
  10257. Emit(Push(position,arg));
  10258. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10259. Emit(Push(position,rightO.op));
  10260. ReleaseOperand(rightO);
  10261. CallThis(position,"Heaps","AssignArray",4);
  10262. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  10263. size := StaticMathArrayNumElements(leftType);
  10264. base := StaticMathArrayBaseType(leftType);
  10265. Designate(right,rightO);
  10266. Designate(left,leftO);
  10267. Emit(Push(position,leftO.op));
  10268. ReleaseOperand(leftO);
  10269. arg := TypeDescriptorAdr(base);
  10270. Emit(Push(position,arg));
  10271. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10272. Emit(Push(position,rightO.op));
  10273. ReleaseOperand(rightO);
  10274. CallThis(position,"Heaps","AssignArray",4);
  10275. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  10276. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  10277. Evaluate(right,rightO);
  10278. Designate(left,leftO);
  10279. MakeMemory(mem,leftO.op,addressType,0);
  10280. Emit(Mov(position,mem,rightO.op));
  10281. ReleaseIntermediateOperand(mem);
  10282. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10283. Emit (Push(position, leftO.tag));
  10284. ReleaseOperand(leftO);
  10285. Emit (Push(position, rightO.tag));
  10286. ReleaseOperand(rightO);
  10287. CallThis(position,"Heaps","Assign", 2);
  10288. ELSE HALT(100); (* missing ? *)
  10289. END;
  10290. RestoreRegisters(saved);
  10291. RETURN;
  10292. END;
  10293. IF CanPassAsResultParameter(right) THEN
  10294. procedureResultDesignator := left(SyntaxTree.Designator);
  10295. Expression(right);
  10296. procedureResultDesignator := NIL;
  10297. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  10298. (* left <-- ALIAS OF right: zerocopy *)
  10299. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  10300. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  10301. designator.SetType(procedure.type);
  10302. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  10303. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  10304. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  10305. END;
  10306. ELSIF leftType IS SyntaxTree.RangeType THEN
  10307. (* LHS is of array range type *)
  10308. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  10309. Evaluate(right, rightO);
  10310. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  10311. (* first *)
  10312. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  10313. Emit(Mov(position,mem, rightO.op));
  10314. ReleaseIntermediateOperand(mem);
  10315. (* last *)
  10316. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10317. Emit(Mov(position,mem, rightO.tag));
  10318. ReleaseIntermediateOperand(mem);
  10319. (* step *)
  10320. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10321. Emit(Mov(position,mem, rightO.extra));
  10322. ReleaseIntermediateOperand(mem);
  10323. ReleaseOperand(rightO);
  10324. ReleaseOperand(leftO)
  10325. ELSIF leftType IS SyntaxTree.ComplexType THEN
  10326. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  10327. Evaluate(right, rightO);
  10328. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  10329. componentType := leftType(SyntaxTree.ComplexType).componentType;
  10330. (* real part *)
  10331. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  10332. Emit(Mov(position,mem, rightO.op));
  10333. ReleaseIntermediateOperand(mem);
  10334. (* imaginary part *)
  10335. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10336. Emit(Mov(position,mem, rightO.tag));
  10337. ReleaseIntermediateOperand(mem);
  10338. ReleaseOperand(rightO);
  10339. ReleaseOperand(leftO)
  10340. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  10341. OR (leftType IS SyntaxTree.PortType) THEN
  10342. (* rightO := leftO;*)
  10343. Evaluate(right,rightO);
  10344. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  10345. Designate(left,leftO);
  10346. IF leftO.mode = ModeReference THEN
  10347. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  10348. destination := mem;
  10349. ELSE
  10350. destination := leftO.op;
  10351. END;
  10352. ReleaseOperand(leftO);
  10353. (* EXPERIMENTAL *)
  10354. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  10355. ReleaseIntermediateOperand(destination);
  10356. destination := availableSymbols[leftO.availability].register;
  10357. UseIntermediateOperand(destination);
  10358. availableSymbols[leftO.availability].inMemory := FALSE;
  10359. END;
  10360. IF destination.mode # IntermediateCode.Undefined THEN
  10361. Emit(Mov(position,destination,rightO.op));
  10362. END;
  10363. ReleaseOperand(rightO);
  10364. ReleaseIntermediateOperand(mem);
  10365. IntermediateCode.InitOperand(destination);
  10366. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  10367. Evaluate(right,rightO);
  10368. Designate(left,leftO);
  10369. MakeMemory(mem,leftO.op,addressType,0);
  10370. Emit(Mov(position,mem,rightO.op));
  10371. ReleaseIntermediateOperand(mem);
  10372. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  10373. (* delegate *)
  10374. (*
  10375. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  10376. *)
  10377. Emit(Mov(position,leftO.tag,rightO.tag));
  10378. END;
  10379. ReleaseOperand(leftO);
  10380. ReleaseOperand(rightO);
  10381. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  10382. Designate(right,rightO);
  10383. Designate(left,leftO);
  10384. sizeOp := CopySize(left, leftO.tag);
  10385. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10386. ReleaseIntermediateOperand(sizeOp);
  10387. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10388. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  10389. IF (rightType IS SyntaxTree.StringType) THEN
  10390. CopyString(left,right);
  10391. 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
  10392. Designate(right,rightO);
  10393. Designate(left,leftO);
  10394. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10395. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10396. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10397. ELSE
  10398. HALT(201)
  10399. END;
  10400. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  10401. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  10402. Designate(right,rightO);
  10403. Designate(left,leftO);
  10404. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10405. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  10406. MakeMemory(mem, rightO.op, leftO.op.type,0);
  10407. Emit(Mov(position, leftO.op, mem));
  10408. ReleaseIntermediateOperand(mem);
  10409. ELSE
  10410. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10411. END;
  10412. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10413. ELSE
  10414. AssignMathArray(left,right);
  10415. END;
  10416. ELSE
  10417. HALT(200);
  10418. END;
  10419. END Assign;
  10420. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  10421. BEGIN
  10422. IF Trace THEN TraceEnter("VisitAssignment") END;
  10423. Assign(x.left,x.right);
  10424. IF Trace THEN TraceExit("VisitAssignment") END;
  10425. END VisitAssignment;
  10426. PROCEDURE EmitCooperativeSwitch;
  10427. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  10428. BEGIN
  10429. ASSERT (cooperativeSwitches);
  10430. pc := section.pc;
  10431. IF lastSwitchPC = section.pc THEN RETURN END;
  10432. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  10433. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  10434. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  10435. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  10436. INC(statCoopSwitch, section.pc - pc);
  10437. END EmitCooperativeSwitch;
  10438. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  10439. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  10440. BEGIN
  10441. p0 := communication.left; p1 := communication.right;
  10442. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  10443. Evaluate(p0,s0);
  10444. Evaluate(p1,s1);
  10445. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10446. Emit(Push(position,s0.op));
  10447. Emit(Push(position,s1.op));
  10448. (*
  10449. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10450. *)
  10451. IF ~backend.cellsAreObjects THEN
  10452. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  10453. END;
  10454. ReleaseOperand(s0);
  10455. ReleaseOperand(s1);
  10456. IF backend.cellsAreObjects THEN
  10457. CallThis(position,"ActiveCellsRuntime","Send",2);
  10458. ELSE
  10459. CallThis(position,ChannelModuleName,"Send",2);
  10460. END;
  10461. (* ----- RECEIVE ------*)
  10462. ELSE
  10463. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  10464. tmp := p0; p0 := p1; p1 := tmp;
  10465. END;
  10466. Evaluate(p0,s0);
  10467. Emit(Push(position,s0.op));
  10468. Designate(p1,s1);
  10469. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10470. Emit(Push(position,s1.op));
  10471. (*
  10472. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10473. *)
  10474. IF ~backend.cellsAreObjects THEN
  10475. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  10476. END;
  10477. ReleaseOperand(s0);
  10478. ReleaseOperand(s1);
  10479. IF backend.cellsAreObjects THEN
  10480. CallThis(position,"ActiveCellsRuntime","Receive",2);
  10481. ELSE
  10482. CallThis(position,ChannelModuleName,"Receive",2)
  10483. END;
  10484. END;
  10485. END VisitCommunicationStatement;
  10486. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  10487. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  10488. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  10489. VAR false: Label; condition, value: BOOLEAN;
  10490. BEGIN
  10491. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  10492. IF condition THEN
  10493. false := NewLabel();
  10494. Condition(if.condition,false,FALSE);
  10495. StatementSequence(if.statements);
  10496. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  10497. SetLabel(false);
  10498. ELSE
  10499. IF value THEN (* always true *)
  10500. escape := TRUE;
  10501. StatementSequence(if.statements);
  10502. (* no branch necessary -- rest skipped *)
  10503. END;
  10504. END;
  10505. END IfPart;
  10506. BEGIN
  10507. IF Trace THEN TraceEnter("VisitIfStatement") END;
  10508. end := NewLabel();
  10509. elsifs := x.ElsifParts();
  10510. IfPart(x.ifPart,elsifs=0);
  10511. FOR i := 0 TO elsifs-1 DO
  10512. IF ~escape THEN
  10513. elsif := x.GetElsifPart(i);
  10514. IfPart(elsif, i=elsifs-1);
  10515. END;
  10516. END;
  10517. IF (x.elsePart # NIL) & ~escape THEN
  10518. StatementSequence(x.elsePart);
  10519. END;
  10520. SetLabel(end);
  10521. IF Trace THEN TraceExit("VisitIfStatement") END;
  10522. END VisitIfStatement;
  10523. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  10524. VAR reg: IntermediateCode.Operand;
  10525. BEGIN
  10526. trueL := NewLabel();
  10527. IF backend.cooperative THEN
  10528. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  10529. Emit(Mov(position,reg,tag));
  10530. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  10531. ReleaseIntermediateOperand(reg);
  10532. ELSE
  10533. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  10534. END;
  10535. END BrWithPart;
  10536. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  10537. BEGIN
  10538. StatementSequence(x.statements);
  10539. END EmitWithPart;
  10540. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  10541. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  10542. tag: IntermediateCode.Operand;
  10543. BEGIN
  10544. IF Trace THEN TraceEnter("VisitWithStatement") END;
  10545. endL := NewLabel();
  10546. elseL := NewLabel();
  10547. Designate(x.variable,res);
  10548. IF IsPointerToRecord(x.variable.type,recordType) THEN
  10549. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  10550. END;
  10551. ReuseCopy(tag, res.tag);
  10552. ReleaseOperand(res);
  10553. NEW(trueL, x.WithParts());
  10554. FOR i := 0 TO x.WithParts()-1 DO
  10555. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  10556. END;
  10557. ReleaseIntermediateOperand(tag);
  10558. BrL(elseL);
  10559. FOR i := 0 TO x.WithParts()-1 DO
  10560. SetLabel(trueL[i]);
  10561. EmitWithPart(x.GetWithPart(i));
  10562. BrL(endL);
  10563. END;
  10564. SetLabel(elseL);
  10565. IF x.elsePart = NIL THEN
  10566. IF ~isUnchecked THEN
  10567. EmitTrap(position,WithTrap);
  10568. END;
  10569. ELSE
  10570. StatementSequence(x.elsePart)
  10571. END;
  10572. SetLabel(endL);
  10573. IF Trace THEN TraceExit("VisitWithStatement") END;
  10574. END VisitWithStatement;
  10575. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  10576. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  10577. out,else: Label; label: Label;
  10578. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  10579. symbol: SyntaxTree.Symbol;
  10580. table: BOOLEAN;
  10581. BEGIN
  10582. (*! split case statement into if-elsif statements for large case label lists *)
  10583. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  10584. range := x.max-x.min+1;
  10585. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  10586. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  10587. table := FALSE;
  10588. size := x.caseParts.Length();
  10589. ELSE
  10590. table := TRUE;
  10591. size := LONGINT(range);
  10592. END;
  10593. Evaluate(x.variable,var);
  10594. ReuseCopy(tmp,var.op);
  10595. ReleaseIntermediateOperand(var.op);
  10596. var.op := tmp;
  10597. (*
  10598. UniqueId(name,module.module,"case",caseId);
  10599. *)
  10600. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  10601. else := NewLabel();
  10602. IF table THEN
  10603. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  10604. Convert(var.op,addressType);
  10605. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  10606. ReuseCopy(res,var.op);
  10607. ReleaseOperand(var);
  10608. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  10609. Global.GetModuleSegmentedName(module.module, name);
  10610. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  10611. symbol := SyntaxTree.NewSymbol(name[1]);
  10612. symbol.SetScope(moduleScope);
  10613. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  10614. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  10615. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  10616. Emit(Add(position,res,res,jmp));
  10617. IntermediateCode.MakeMemory(res,addressType);
  10618. Emit(Br(position,res));
  10619. ReleaseIntermediateOperand(res);
  10620. ELSE
  10621. ReuseCopy(res,var.op); (* make sure it is in a register *)
  10622. ReleaseOperand(var);
  10623. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  10624. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  10625. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10626. part := x.GetCasePart(i);
  10627. constant := part.firstConstant;
  10628. fixups[i] := NewLabel();
  10629. WHILE(constant # NIL) DO (* case labels for this case part *)
  10630. IF constant.min = constant.max THEN
  10631. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  10632. ELSE
  10633. label := NewLabel();
  10634. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  10635. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  10636. BrL(fixups[i]);
  10637. SetLabel(label);
  10638. END;
  10639. constant := constant.next;
  10640. END;
  10641. END;
  10642. BrL(else);
  10643. ReleaseIntermediateOperand(res);
  10644. END;
  10645. out := NewLabel();
  10646. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10647. part := x.GetCasePart(i);
  10648. constant := part.firstConstant;
  10649. IF table THEN
  10650. label := NewLabel();
  10651. SetLabel(label);
  10652. WHILE(constant # NIL) DO (* case labels for this case part *)
  10653. FOR j := constant.min TO constant.max DO
  10654. fixups[j-x.min] := label;
  10655. END;
  10656. constant := constant.next;
  10657. END;
  10658. ELSE
  10659. SetLabel(fixups[i]);
  10660. END;
  10661. StatementSequence(part.statements);
  10662. BrL(out);
  10663. END;
  10664. SetLabel(else);
  10665. FOR i := 0 TO size-1 DO
  10666. IF fixups[i] = NIL THEN
  10667. fixups[i] := else;
  10668. END;
  10669. END;
  10670. IF x.elsePart # NIL THEN
  10671. StatementSequence(x.elsePart);
  10672. ELSIF ~isUnchecked THEN
  10673. EmitTrap(position,CaseTrap);
  10674. END;
  10675. SetLabel(out);
  10676. IF table THEN
  10677. FOR i := 0 TO size-1 DO
  10678. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  10679. section.Emit(Data(position,op));
  10680. END;
  10681. END;
  10682. IF Trace THEN TraceExit("VisitCaseStatement") END;
  10683. END VisitCaseStatement;
  10684. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  10685. VAR startL,falseL: Label;
  10686. BEGIN
  10687. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  10688. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10689. startL := NewLabel();
  10690. falseL := NewLabel();
  10691. SetLabel(startL);
  10692. Condition(x.condition,falseL,FALSE);
  10693. StatementSequence(x.statements);
  10694. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10695. BrL(startL);
  10696. SetLabel(falseL);
  10697. IF Trace THEN TraceExit("VisitWhileStatement") END;
  10698. END VisitWhileStatement;
  10699. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  10700. VAR falseL: Label;
  10701. BEGIN
  10702. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  10703. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10704. falseL := NewLabel();
  10705. SetLabel(falseL);
  10706. StatementSequence(x.statements);
  10707. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10708. Condition(x.condition,falseL,FALSE);
  10709. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  10710. END VisitRepeatStatement;
  10711. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  10712. VAR
  10713. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  10714. temporaryVariable: SyntaxTree.Variable;
  10715. temporaryVariableDesignator : SyntaxTree.Designator;
  10716. BEGIN
  10717. IF Trace THEN TraceEnter("VisitForStatement") END;
  10718. falseL := NewLabel();
  10719. startL := NewLabel();
  10720. Assign(x.variable,x.from);
  10721. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  10722. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  10723. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  10724. Assign(temporaryVariableDesignator,x.to);
  10725. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  10726. IF by > 0 THEN
  10727. cmp := Scanner.LessEqual
  10728. ELSE
  10729. cmp := Scanner.GreaterEqual
  10730. END;
  10731. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  10732. binary.SetType(system.booleanType);
  10733. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10734. SetLabel(startL);
  10735. Condition(binary,falseL, FALSE);
  10736. StatementSequence(x.statements);
  10737. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  10738. binary.SetType(x.variable.type);
  10739. Assign(x.variable,binary);
  10740. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10741. BrL(startL);
  10742. SetLabel(falseL);
  10743. IF Trace THEN TraceExit("VisitForStatement") END;
  10744. END VisitForStatement;
  10745. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  10746. VAR prevLoop: Label;
  10747. BEGIN
  10748. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  10749. prevLoop := currentLoop;
  10750. currentLoop := NewLabel();
  10751. StatementSequence(x.statements);
  10752. SetLabel(currentLoop);
  10753. currentLoop := prevLoop;
  10754. IF Trace THEN TraceExit("VisitExitableBlock") END;
  10755. END VisitExitableBlock;
  10756. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  10757. VAR prevLoop,start: Label;
  10758. BEGIN
  10759. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  10760. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10761. start := NewLabel();
  10762. prevLoop := currentLoop;
  10763. SetLabel(start);
  10764. currentLoop := NewLabel();
  10765. StatementSequence(x.statements);
  10766. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10767. BrL(start);
  10768. SetLabel(currentLoop);
  10769. currentLoop := prevLoop;
  10770. IF Trace THEN TraceExit("VisitLoopStatement") END;
  10771. END VisitLoopStatement;
  10772. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  10773. VAR outer: SyntaxTree.Statement;
  10774. BEGIN
  10775. IF Trace THEN TraceEnter("VisitExitStatement") END;
  10776. IF locked THEN (* r if we jump out of an exclusive block *)
  10777. outer := x.outer;
  10778. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  10779. outer := outer.outer;
  10780. END;
  10781. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  10782. Lock(FALSE);
  10783. END;
  10784. END;
  10785. BrL(currentLoop);
  10786. IF Trace THEN TraceExit("VisitExitStatement") END;
  10787. END VisitExitStatement;
  10788. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  10789. VAR
  10790. expression, parameterDesignator: SyntaxTree.Expression;
  10791. type, componentType: SyntaxTree.Type;
  10792. res, right: Operand;
  10793. left, mem, reg: IntermediateCode.Operand;
  10794. parameter: SyntaxTree.Parameter;
  10795. procedure: SyntaxTree.Procedure;
  10796. procedureType: SyntaxTree.ProcedureType;
  10797. returnTypeOffset: LONGINT;
  10798. delegate: BOOLEAN;
  10799. map: SymbolMap;
  10800. callingConvention, parametersSize: LONGINT;
  10801. BEGIN
  10802. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  10803. expression := x.returnValue;
  10804. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  10805. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10806. IF currentIsInline THEN
  10807. IF expression # NIL THEN
  10808. map := currentMapper.Get(NIL);
  10809. IF map # NIL THEN
  10810. Assign(map.to, expression);
  10811. ELSE
  10812. Evaluate(expression,res);
  10813. Emit(Return(position,res.op));
  10814. ReleaseOperand(res);
  10815. END;
  10816. END;
  10817. BrL(currentInlineExit);
  10818. RETURN;
  10819. END;
  10820. IF expression # NIL THEN
  10821. type := expression.type.resolved;
  10822. IF (expression IS SyntaxTree.ResultDesignator) THEN
  10823. IF locked THEN Lock(FALSE) END;
  10824. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10825. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10826. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  10827. 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
  10828. (* return without structured return parameter *)
  10829. Evaluate(expression,res);
  10830. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  10831. IF locked OR profile THEN
  10832. Emit(Push(position,res.op));
  10833. IF delegate THEN HALT(200) END;
  10834. ReleaseOperand(res);
  10835. IF locked THEN Lock(FALSE) END;
  10836. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10837. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10838. reg := NewRegisterOperand(res.op.type);
  10839. Emit(Pop(position,reg));
  10840. Emit(Return(position,reg));
  10841. ReleaseIntermediateOperand(reg);
  10842. ELSE
  10843. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10844. Emit(Return(position,res.op));
  10845. ReleaseOperand(res);
  10846. END;
  10847. 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()
  10848. THEN
  10849. (* return using structured return parameter *)
  10850. 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)
  10851. OR (type IS SyntaxTree.StringType)
  10852. OR SemanticChecker.IsPointerType(type));
  10853. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10854. parameter :=procedureType.returnParameter;
  10855. ASSERT(parameter # NIL);
  10856. returnTypeOffset := parameter.offsetInBits;
  10857. (*
  10858. IF parameter# NIL THEN
  10859. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10860. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10861. ELSE
  10862. returnTypeOffset := system.offsetFirstParameter
  10863. END;
  10864. *)
  10865. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10866. IF type IS SyntaxTree.RangeType THEN
  10867. (* array range type *)
  10868. Evaluate(expression, right);
  10869. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10870. Emit(Mov(position,mem, right.op)); (* first *)
  10871. ReleaseIntermediateOperand(mem);
  10872. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10873. Emit(Mov(position,mem, right.tag)); (* last *)
  10874. ReleaseIntermediateOperand(mem);
  10875. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10876. Emit(Mov(position,mem, right.extra)); (* step *)
  10877. ReleaseIntermediateOperand(mem);
  10878. ReleaseOperand(right);
  10879. ELSIF type IS SyntaxTree.ComplexType THEN
  10880. Evaluate(expression, right);
  10881. componentType := type(SyntaxTree.ComplexType).componentType;
  10882. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10883. Emit(Mov(position,mem, right.op)); (* real part *)
  10884. ReleaseIntermediateOperand(mem);
  10885. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10886. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10887. ReleaseIntermediateOperand(mem);
  10888. ReleaseOperand(right);
  10889. ELSE (* covers cases: pointer / record / array *)
  10890. parameter := procedureType.returnParameter;
  10891. checker.SetCurrentScope(currentScope);
  10892. ASSERT(parameter # NIL);
  10893. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10894. Assign(parameterDesignator,expression);
  10895. END;
  10896. ReleaseIntermediateOperand(left);
  10897. IF locked THEN Lock(FALSE) END;
  10898. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10899. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10900. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10901. parameter := procedureType.returnParameter;
  10902. checker.SetCurrentScope(currentScope);
  10903. IF parameter = NIL THEN
  10904. Error(procedure.position, "structured return of parameter of procedure not found");
  10905. ELSE
  10906. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10907. Assign(parameterDesignator,expression);
  10908. END;
  10909. IF locked THEN Lock(FALSE) END;
  10910. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10911. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10912. ELSE
  10913. HALT(200);
  10914. END;
  10915. ELSE
  10916. IF locked THEN Lock(FALSE) END;
  10917. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10918. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10919. END;
  10920. IF backend.cooperative THEN
  10921. BrL(exitLabel);
  10922. ELSE
  10923. callingConvention := procedureType.callingConvention;
  10924. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10925. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10926. ELSE
  10927. parametersSize := 0;
  10928. END;
  10929. EmitLeave(section, position,procedure, callingConvention);
  10930. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10931. END;
  10932. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10933. END VisitReturnStatement;
  10934. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10935. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10936. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10937. statements: SyntaxTree.StatementSequence;
  10938. name, suffix: SyntaxTree.IdentifierString;
  10939. BEGIN
  10940. Strings.IntToStr(awaitProcCounter,suffix);
  10941. Strings.Concat("@AwaitProcedure",suffix,name);
  10942. identifier := SyntaxTree.NewIdentifier(name);
  10943. INC(awaitProcCounter);
  10944. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10945. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10946. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10947. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10948. procedure.SetAccess(SyntaxTree.Hidden);
  10949. procedure.SetScope(currentScope);
  10950. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10951. procedureType.SetReturnType(system.booleanType);
  10952. procedure.SetType(procedureType);
  10953. body := SyntaxTree.NewBody(x.position,procedureScope);
  10954. procedureScope.SetBody(body);
  10955. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10956. returnStatement.SetReturnValue(x.condition);
  10957. statements := SyntaxTree.NewStatementSequence();
  10958. statements.AddStatement(returnStatement);
  10959. body.SetStatementSequence(statements);
  10960. currentScope.AddProcedure(procedure);
  10961. RETURN procedure
  10962. END MakeAwaitProcedure;
  10963. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10964. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10965. call: IntermediateCode.Operand; label, startL, trueL: Label; name: Basic.SegmentedName;
  10966. BEGIN
  10967. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10968. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10969. IF backend.cooperative THEN
  10970. startL := NewLabel();
  10971. trueL := NewLabel();
  10972. SetLabel(startL);
  10973. Condition(x.condition,trueL,TRUE);
  10974. PushSelfPointer();
  10975. CallThis(position,"ExclusiveBlocks","Await",1);
  10976. BrL(startL);
  10977. SetLabel(trueL);
  10978. PushSelfPointer();
  10979. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10980. ELSE
  10981. proc := MakeAwaitProcedure(x);
  10982. Emit(Push(position,fp));
  10983. GetCodeSectionNameForSymbol(proc,name);
  10984. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10985. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10986. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10987. Emit(Call(position,call,ProcParametersSize(proc)));
  10988. Emit(Result(position,res));
  10989. (*
  10990. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10991. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10992. *)
  10993. InitOperand(result,ModeValue);
  10994. result.op := res;
  10995. label := NewLabel();
  10996. BreqL(label, result.op, SELF.true);
  10997. ReleaseOperand(result);
  10998. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10999. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  11000. Emit(Push(position,res));
  11001. Emit(Push(position,fp));
  11002. PushSelfPointer();
  11003. Emit(Push(position,nil));
  11004. CallThis(position,"Objects","Await",4);
  11005. SetLabel(label);
  11006. END;
  11007. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11008. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  11009. END VisitAwaitStatement;
  11010. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  11011. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  11012. BEGIN
  11013. FOR i := 0 TO x.Length() - 1 DO
  11014. statement := x.GetStatement( i );
  11015. Statement(statement);
  11016. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  11017. END;
  11018. END StatementSequence;
  11019. PROCEDURE PushSelfPointer;
  11020. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  11021. procedureType: SyntaxTree.ProcedureType;
  11022. BEGIN
  11023. scope := currentScope;
  11024. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  11025. scope := scope.outerScope;
  11026. END;
  11027. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  11028. moduleSection := meta.ModuleSection();
  11029. IF backend.cooperative THEN
  11030. moduleOffset := 0;
  11031. ELSE
  11032. moduleOffset := moduleSection.pc;
  11033. END;
  11034. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  11035. ELSE
  11036. GetBaseRegister(op.op,currentScope,scope);
  11037. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11038. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11039. parametersSize := ProcParametersSize(procedure);
  11040. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  11041. IF backend.cooperative THEN
  11042. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  11043. END;
  11044. IntermediateCode.MakeMemory(op.op,addressType);
  11045. END;
  11046. Emit(Push(position,op.op));
  11047. ReleaseOperand(op);
  11048. END PushSelfPointer;
  11049. PROCEDURE Lock(lock: BOOLEAN);
  11050. BEGIN
  11051. IF Trace THEN TraceEnter("Lock") END;
  11052. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  11053. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  11054. ASSERT(modifyAssignmentCounter = 0);
  11055. IF dump # NIL THEN
  11056. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  11057. dump.Ln;dump.Update;
  11058. END;
  11059. PushSelfPointer;
  11060. IF backend.cooperative THEN
  11061. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  11062. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  11063. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  11064. END;
  11065. ELSE
  11066. Emit(Push(position,true));
  11067. IF lock THEN CallThis(position,"Objects","Lock",2)
  11068. ELSE CallThis(position,"Objects","Unlock",2);
  11069. END;
  11070. END;
  11071. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11072. IF Trace THEN TraceExit("Lock") END;
  11073. END Lock;
  11074. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  11075. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  11076. prevScope: SyntaxTree.Scope;
  11077. BEGIN
  11078. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  11079. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11080. previouslyUnchecked := isUnchecked;
  11081. isUnchecked := isUnchecked OR x.isUnchecked;
  11082. previouslyCooperativeSwitches := cooperativeSwitches;
  11083. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  11084. prevScope := currentScope;
  11085. IF x.scope # NIL THEN currentScope := x.scope END;
  11086. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  11087. IF x.statements # NIL THEN
  11088. StatementSequence(x.statements);
  11089. END;
  11090. IF (x IS SyntaxTree.Body) THEN
  11091. IF (x(SyntaxTree.Body).finally # NIL) THEN
  11092. section.SetFinally(section.pc);
  11093. StatementSequence(x(SyntaxTree.Body).finally)
  11094. ELSIF x.isExclusive THEN
  11095. end := NewLabel();
  11096. BrL(end);
  11097. section.SetFinally(section.pc);
  11098. Lock(FALSE);
  11099. EmitTrap(position,RethrowTrap);
  11100. SetLabel(end);
  11101. END;
  11102. END;
  11103. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  11104. isUnchecked := previouslyUnchecked;
  11105. cooperativeSwitches := previouslyCooperativeSwitches;
  11106. currentScope := prevScope;
  11107. IF Trace THEN TraceExit("VisitStatementBlock") END;
  11108. END VisitStatementBlock;
  11109. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  11110. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  11111. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  11112. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  11113. procedure: SyntaxTree.Procedure;
  11114. map: SymbolMap;
  11115. callingConvention, parametersSize: LONGINT;
  11116. BEGIN
  11117. scope := currentScope;
  11118. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  11119. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11120. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11121. return := emptyOperand;
  11122. IF Trace THEN TraceEnter("VisitCode") END;
  11123. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  11124. NEW(in, x.inRules.Length());
  11125. FOR i := 0 TO LEN(in)-1 DO
  11126. statement := x.inRules.GetStatement(i);
  11127. WITH statement: SyntaxTree.Assignment DO
  11128. Evaluate(statement.right, operand);
  11129. result := operand.op;
  11130. NEW(str, 64);
  11131. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  11132. in[i] := result; IntermediateCode.SetString(in[i], str);
  11133. ReleaseIntermediateOperand(operand.tag);
  11134. END;
  11135. END;
  11136. ELSE in := NIL
  11137. END;
  11138. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  11139. NEW(out, x.outRules.Length());
  11140. FOR i := 0 TO LEN(out)-1 DO
  11141. statement := x.outRules.GetStatement(i);
  11142. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  11143. WITH statement:
  11144. SyntaxTree.Assignment DO
  11145. Designate(statement.left, operand);
  11146. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  11147. NEW(str, 64);
  11148. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  11149. out[i] := result; IntermediateCode.SetString(out[i], str);
  11150. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  11151. | SyntaxTree.ReturnStatement DO
  11152. NEW(str, 64);
  11153. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  11154. IF currentIsInline THEN
  11155. map := currentMapper.Get(NIL);
  11156. Designate(map.to, operand);
  11157. IF map.isAddress THEN
  11158. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11159. ELSE
  11160. result := operand.op;
  11161. END;
  11162. (*! only if it does not fit into register
  11163. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11164. *)
  11165. (*Evaluate(map.to, operand);*)
  11166. out[i] := result;
  11167. ELSE
  11168. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  11169. END;
  11170. IntermediateCode.SetString(out[i], str);
  11171. ReleaseIntermediateOperand(operand.tag);
  11172. return := out[i];
  11173. ELSE
  11174. END;
  11175. END;
  11176. ELSE out := NIL
  11177. END;
  11178. Emit(Asm(x.position,x.sourceCode, in, out));
  11179. IF in # NIL THEN
  11180. FOR i := 0 TO LEN(in)-1 DO
  11181. ReleaseIntermediateOperand(in[i]);
  11182. END;
  11183. END;
  11184. IF out # NIL THEN
  11185. FOR i := 0 TO LEN(out)-1 DO
  11186. WITH statement:
  11187. SyntaxTree.Assignment DO
  11188. ReleaseIntermediateOperand(out[i]);
  11189. |SyntaxTree.ReturnStatement DO
  11190. (* release happens below *)
  11191. ELSE
  11192. END;
  11193. statement := x.outRules.GetStatement(i);
  11194. END;
  11195. END;
  11196. IF return.mode # IntermediateCode.Undefined THEN
  11197. IF currentIsInline THEN
  11198. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  11199. Symbol(procedureType.returnParameter, par);
  11200. MakeMemory(mem, par.op, return.type, 0);
  11201. ReleaseOperand(par);
  11202. Emit(Mov(position, mem, return));
  11203. ReleaseIntermediateOperand(mem);
  11204. ELSE
  11205. Emit(Return(position,return));
  11206. END;
  11207. ReleaseIntermediateOperand(return);
  11208. IF currentIsInline THEN RETURN END;
  11209. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  11210. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  11211. parametersSize := ProcedureParametersSize(backend.system,procedure);
  11212. ELSE
  11213. parametersSize := 0;
  11214. END;
  11215. EmitLeave(section, position,procedure, callingConvention);
  11216. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  11217. END;
  11218. IF Trace THEN TraceExit("VisitCode") END;
  11219. END VisitCode;
  11220. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  11221. BEGIN
  11222. RETURN ProcedureParametersSize(system, procedure);
  11223. END ProcParametersSize;
  11224. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  11225. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  11226. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  11227. const, call: IntermediateCode.Operand;
  11228. parameterDesignator: SyntaxTree.Expression;
  11229. saved: RegisterEntry;
  11230. name: Basic.SegmentedName;
  11231. BEGIN
  11232. IF Trace THEN TraceEnter("ParameterCopies") END;
  11233. parameter := x.firstParameter;
  11234. WHILE parameter # NIL DO
  11235. IF parameter.kind = SyntaxTree.ValueParameter THEN
  11236. type := parameter.type.resolved;
  11237. IF IsOpenArray(type) THEN
  11238. VisitParameter(parameter);
  11239. op := result;
  11240. IF backend.cooperative & parameter.NeedsTrace() THEN
  11241. length := GetArrayLength(type, op.tag);
  11242. size := NewRegisterOperand(addressType);
  11243. base := ArrayBaseType(type);
  11244. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  11245. Emit(Mul(position, size, length, const));
  11246. dst := NewRegisterOperand (addressType);
  11247. Emit(Mov(position, dst, size));
  11248. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11249. Emit(Sub(position,dst,sp,dst));
  11250. Emit(And(position,dst,dst,const));
  11251. Emit(Mov(position,sp,dst));
  11252. par := fp;
  11253. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11254. IntermediateCode.InitImmediate(null, byteType, 0);
  11255. Emit(Fill(position, dst, size, null));
  11256. ReleaseIntermediateOperand(dst);
  11257. ReleaseIntermediateOperand(length);
  11258. SaveRegisters();ReleaseUsedRegisters(saved);
  11259. (* register dst has been freed before SaveRegisters already *)
  11260. base := ArrayBaseType(type);
  11261. (* assign method of open array *)
  11262. IF base.IsRecordType() THEN
  11263. Emit (Push(position, length));
  11264. Emit (Push(position, dst));
  11265. Emit (Push(position, op.op));
  11266. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  11267. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  11268. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  11269. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  11270. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  11271. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  11272. Emit (Push(position,length));
  11273. Emit (Push(position, dst));
  11274. Emit (Push(position, length));
  11275. Emit (Push(position, op.op));
  11276. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  11277. ELSE
  11278. Emit (Push(position, length));
  11279. Emit (Push(position, dst));
  11280. Emit (Push(position, length));
  11281. Emit (Push(position, op.op));
  11282. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  11283. ASSERT(ArrayBaseType(type).IsPointer());
  11284. END;
  11285. RestoreRegisters(saved);
  11286. ELSE
  11287. temp := GetDynamicSize(type,op.tag);
  11288. ReuseCopy(size,temp);
  11289. ReleaseIntermediateOperand(temp);
  11290. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11291. Emit(Sub(position,size,sp,size));
  11292. Emit(And(position,size,size,const));
  11293. Emit(Mov(position,sp,size));
  11294. par := fp;
  11295. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11296. ReleaseIntermediateOperand(size);
  11297. size := GetDynamicSize(type,op.tag);
  11298. END;
  11299. Emit(Copy(position,sp,op.op,size));
  11300. ReleaseIntermediateOperand(size);
  11301. ReleaseOperand(op);
  11302. IntermediateCode.MakeMemory(par,addressType);
  11303. Emit(Mov(position,par,sp));
  11304. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  11305. checker.SetCurrentScope(currentScope);
  11306. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  11307. Assign(parameterDesignator,parameterDesignator);
  11308. END;
  11309. END;
  11310. parameter := parameter.nextParameter;
  11311. END;
  11312. IF Trace THEN TraceExit("ParameterCopies") END;
  11313. END ParameterCopies;
  11314. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  11315. VAR x: SyntaxTree.Variable;
  11316. BEGIN
  11317. x := scope.firstVariable;
  11318. WHILE x # NIL DO
  11319. InitVariable(x,FALSE);
  11320. x := x.nextVariable;
  11321. END;
  11322. END InitVariables;
  11323. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): Basic.Fingerprint;
  11324. BEGIN
  11325. IF (symbol # NIL) THEN
  11326. RETURN fingerprinter.SymbolFP(symbol).public
  11327. ELSE
  11328. RETURN 0
  11329. END;
  11330. END GetFingerprint;
  11331. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  11332. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  11333. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  11334. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  11335. name: Basic.SegmentedName;
  11336. offset: LONGINT;
  11337. BEGIN
  11338. IF Trace THEN TraceEnter("Body") END;
  11339. ReleaseUsedRegisters(saved); (* just in case ... *)
  11340. section := ir;
  11341. exitLabel := NewLabel ();
  11342. IF moduleBody THEN moduleBodySection := section END;
  11343. IF ir.comments # NIL THEN
  11344. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  11345. commentPrintout.SingleStatement(TRUE);
  11346. dump := ir.comments;
  11347. ELSE
  11348. commentPrintout := NIL;
  11349. dump := NIL;
  11350. END;
  11351. prevScope := currentScope;
  11352. currentScope := scope;
  11353. lastSwitchPC := 0;
  11354. cooperativeSwitches := backend.cooperative;
  11355. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11356. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11357. IF x # NIL THEN
  11358. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11359. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  11360. IF moduleBody THEN
  11361. ProfilerInit();
  11362. ELSE
  11363. Basic.SegmentedNameToString(ir.name, string);
  11364. ProfilerAddProcedure(numberProcedures,string);
  11365. ProfilerEnterExit(numberProcedures,TRUE);
  11366. END;
  11367. END;
  11368. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  11369. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  11370. END;
  11371. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  11372. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  11373. cellScope := scope.outerScope(SyntaxTree.CellScope);
  11374. IF procedure = cellScope.bodyProcedure THEN
  11375. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  11376. StaticCallOperand(op, cellScope.constructor);
  11377. Emit(Call(position,op.op,0));
  11378. END;
  11379. END;
  11380. END;
  11381. InitVariables(scope);
  11382. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  11383. GetCodeSectionNameForSymbol(procedure, name);
  11384. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  11385. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  11386. IF ProtectModulesPointers THEN
  11387. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  11388. ELSE
  11389. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  11390. END;
  11391. IntermediateCode.SetOffset(right,offset); (* tag *)
  11392. IntermediateCode.InitMemory(left,addressType,fp,0);
  11393. Emit(Mov(position, left, right));
  11394. END;
  11395. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  11396. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  11397. ParameterCopies(procedureType);
  11398. IF x.code = NIL THEN
  11399. VisitStatementBlock(x);
  11400. ELSE
  11401. VisitCode(x.code)
  11402. END;
  11403. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  11404. IF ~backend.cooperative THEN
  11405. ProfilerEnterExit(numberProcedures,FALSE);
  11406. END;
  11407. INC(numberProcedures);
  11408. END;
  11409. END;
  11410. IF backend.cooperative THEN
  11411. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  11412. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  11413. END;
  11414. IF x # NIL THEN
  11415. SELF.position := x.position;
  11416. END;
  11417. EndBasicBlock;
  11418. CheckRegistersFree();
  11419. ASSERT(modifyAssignmentCounter = 0);
  11420. currentScope := prevScope;
  11421. IF Trace THEN TraceExit("Body") END;
  11422. END Body;
  11423. END ImplementationVisitor;
  11424. MetaDataGenerator=OBJECT
  11425. VAR
  11426. implementationVisitor: ImplementationVisitor;
  11427. declarationVisitor: DeclarationVisitor;
  11428. module: Sections.Module;
  11429. moduleName: ARRAY 128 OF CHAR;
  11430. moduleNamePool: Basic.HashTableInt;
  11431. moduleNamePoolSection: IntermediateCode.Section;
  11432. modulePointerSection: IntermediateCode.Section;
  11433. modulePointerSizePC: LONGINT;
  11434. modulePointerSectionOffset: LONGINT;
  11435. modulePointers: LONGINT;
  11436. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  11437. RecordBaseOffset: LONGINT;
  11438. MethodTableOffset: LONGINT; (* method table offset from zero *)
  11439. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  11440. TypeTags: LONGINT; (* type extension level support *)
  11441. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  11442. patchInfoPC: LONGINT;
  11443. patchCRC: LONGINT;
  11444. CONST
  11445. EmptyBlockOffset = 2;
  11446. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  11447. BEGIN
  11448. IF implementationVisitor.backend.cooperative THEN
  11449. TypeTags := MAX(LONGINT);
  11450. BaseTypesTableOffset := 0;
  11451. MethodTableOffset := 2;
  11452. TypeRecordBaseOffset := 0;
  11453. RecordBaseOffset := 0;
  11454. ELSIF simple THEN
  11455. TypeTags := 3; (* only 3 extensions allowed *)
  11456. BaseTypesTableOffset := 1;
  11457. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  11458. TypeRecordBaseOffset := 0;
  11459. RecordBaseOffset := 1;
  11460. ELSE
  11461. TypeTags := 16;
  11462. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  11463. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  11464. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  11465. (* change this when Heaps.HeapBlock is modified *)
  11466. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  11467. RecordBaseOffset := 8; (* addresses *)
  11468. ELSE
  11469. RecordBaseOffset := 9; (* addresses *)
  11470. END;
  11471. END;
  11472. SELF.simple := simple;
  11473. SELF.implementationVisitor := implementationVisitor;
  11474. SELF.declarationVisitor := declarationVisitor;
  11475. implementationVisitor.meta := SELF;
  11476. declarationVisitor.meta := SELF;
  11477. END InitMetaDataGenerator;
  11478. PROCEDURE SetModule(module: Sections.Module);
  11479. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  11480. BEGIN
  11481. SELF.module := module;
  11482. Global.GetModuleName(module.module,moduleName);
  11483. Global.GetSymbolSegmentedName(module.module, name);
  11484. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  11485. NEW(moduleNamePool, 32);
  11486. (*! require GC protection *)
  11487. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  11488. IF ProtectModulesPointers THEN
  11489. name := "Heaps.AnyPtr";
  11490. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11491. (* set base pointer *)
  11492. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  11493. END;
  11494. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  11495. modulePointers := 0;
  11496. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  11497. AddPointer(moduleNamePoolSection, namePoolOffset);
  11498. END;
  11499. END SetModule;
  11500. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  11501. BEGIN
  11502. IF ~implementationVisitor.backend.cooperative THEN
  11503. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  11504. INC(modulePointers);
  11505. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  11506. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  11507. END;
  11508. END AddPointer;
  11509. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  11510. BEGIN
  11511. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  11512. END GetTypeRecordBaseOffset;
  11513. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11514. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  11515. BEGIN
  11516. (* change this when Heaps.HeapBlock is modified *)
  11517. INC(dataAdrOffset,7);
  11518. Info(section,"headerAdr");
  11519. Address(section,0);
  11520. Info(section,"typeDesc");
  11521. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  11522. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11523. NamedSymbol(section, name, symbol, 0, offset);
  11524. Info(section,"mark: LONGINT;");
  11525. Longint(section,-1);
  11526. Info(section,"refCount: LONGINT;");
  11527. Longint(section,0);
  11528. (*
  11529. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  11530. *)
  11531. Info(section,"dataAdr-: ADDRESS");
  11532. Symbol(section,section, dataAdrOffset,0);
  11533. Info(section,"size-: SIZE");
  11534. Address(section,0);
  11535. Info(section,"nextMark: HeapBlock;");
  11536. Address(section,0);
  11537. END HeapBlock;
  11538. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11539. VAR i: LONGINT;
  11540. BEGIN
  11541. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  11542. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  11543. Info(section,"count*: LONGINT");
  11544. Longint(section,0);
  11545. Info(section,"locked*: BOOLEAN");
  11546. Longint(section,0);
  11547. Info(section,"awaitingLock*: ProcessQueue");
  11548. Address(section,0);
  11549. Address(section,0);
  11550. Info(section,"awaitingCond*: ProcessQueue");
  11551. Address(section,0);
  11552. Address(section,0);
  11553. Info(section,"lockedBy*: ANY");
  11554. Address(section,0);
  11555. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  11556. Longint(section,1);
  11557. FOR i := 2 TO 6 DO
  11558. Longint(section,0);
  11559. END;
  11560. Info(section,"lock*: ANY");
  11561. Address(section,0);
  11562. END ProtectedHeapBlock;
  11563. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  11564. BEGIN
  11565. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  11566. END Info;
  11567. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  11568. VAR op: IntermediateCode.Operand;
  11569. BEGIN
  11570. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  11571. section.Emit(Data(Basic.invalidPosition,op));
  11572. END Address;
  11573. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  11574. VAR op: IntermediateCode.Operand;
  11575. BEGIN
  11576. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11577. section.Emit(Data(Basic.invalidPosition,op));
  11578. END Size;
  11579. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  11580. VAR op: IntermediateCode.Operand;
  11581. BEGIN
  11582. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  11583. section.Emit(Data(Basic.invalidPosition,op));
  11584. END Set;
  11585. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  11586. VAR op: IntermediateCode.Operand;
  11587. BEGIN
  11588. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11589. section.Emit(Data(Basic.invalidPosition,op));
  11590. END Longint;
  11591. PROCEDURE Hugeint(section: IntermediateCode.Section; value: HUGEINT);
  11592. VAR op: IntermediateCode.Operand;
  11593. BEGIN
  11594. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.hugeintType),value);
  11595. section.Emit(Data(Basic.invalidPosition,op));
  11596. END Hugeint;
  11597. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11598. VAR op,noOperand: IntermediateCode.Operand;
  11599. BEGIN
  11600. IntermediateCode.InitOperand(noOperand);
  11601. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11602. section.PatchOperands(pc,op,noOperand,noOperand);
  11603. END PatchSize;
  11604. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11605. VAR op,noOperand: IntermediateCode.Operand;
  11606. BEGIN
  11607. IntermediateCode.InitOperand(noOperand);
  11608. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11609. section.PatchOperands(pc,op,noOperand,noOperand);
  11610. END PatchLongint;
  11611. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11612. VAR op, noOperand: IntermediateCode.Operand;
  11613. BEGIN
  11614. IntermediateCode.InitOperand(noOperand);
  11615. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11616. section.PatchOperands(pc,op,noOperand,noOperand);
  11617. END PatchSymbol;
  11618. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  11619. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  11620. BEGIN
  11621. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  11622. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  11623. section.Emit(Data(Basic.invalidPosition,op));
  11624. END Boolean;
  11625. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  11626. VAR op: IntermediateCode.Operand;
  11627. BEGIN
  11628. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  11629. section.Emit(Data(Basic.invalidPosition,op));
  11630. END Char;
  11631. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  11632. VAR i: LONGINT;
  11633. BEGIN
  11634. Info(section,str);
  11635. i := 0;
  11636. WHILE(str[i] # 0X) DO
  11637. Char(section,str[i]);
  11638. INC(i);
  11639. END;
  11640. Char(section,0X);
  11641. END String;
  11642. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  11643. VAR s: Basic.SectionName;
  11644. BEGIN
  11645. StringPool.GetString(str, s);
  11646. String(section, s);
  11647. END String0;
  11648. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11649. VAR op: IntermediateCode.Operand;
  11650. BEGIN
  11651. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11652. IntermediateCode.SetOffset(op,realOffset);
  11653. section.Emit(Data(Basic.invalidPosition,op));
  11654. END NamedSymbol;
  11655. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11656. VAR op: IntermediateCode.Operand;
  11657. BEGIN
  11658. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11659. IntermediateCode.SetOffset(op,realOffset);
  11660. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  11661. END NamedSymbolAt;
  11662. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  11663. BEGIN
  11664. IF symbol= NIL THEN
  11665. Address( section, realOffset);
  11666. ASSERT(virtualOffset = 0);
  11667. ELSE
  11668. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  11669. END;
  11670. END Symbol;
  11671. (* OutPointers delivers
  11672. {pointerOffset}
  11673. *)
  11674. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  11675. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  11676. BEGIN
  11677. type := type.resolved;
  11678. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) 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.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  11682. Symbol(section, symbol, 0, offset); INC(numberPointers);
  11683. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  11684. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11685. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  11686. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  11687. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  11688. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  11689. ELSIF (type IS SyntaxTree.RecordType) THEN
  11690. (* never treat a record like a pointer, even if the pointer field is set! *)
  11691. WITH type: SyntaxTree.RecordType DO
  11692. base := type.GetBaseRecord();
  11693. IF base # NIL THEN
  11694. Pointers(offset,symbol,section, base,numberPointers);
  11695. END;
  11696. variable := type.recordScope.firstVariable;
  11697. WHILE(variable # NIL) DO
  11698. IF ~(variable.untraced) THEN
  11699. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11700. END;
  11701. variable := variable.nextVariable;
  11702. END;
  11703. END;
  11704. ELSIF (type IS SyntaxTree.CellType) THEN
  11705. WITH type: SyntaxTree.CellType DO
  11706. base := type.GetBaseRecord();
  11707. IF base # NIL THEN
  11708. Pointers(offset,symbol,section, base,numberPointers);
  11709. END;
  11710. variable := type.cellScope.firstVariable;
  11711. WHILE(variable # NIL) DO
  11712. IF ~(variable.untraced) THEN
  11713. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11714. END;
  11715. variable := variable.nextVariable;
  11716. END;
  11717. property := type.firstProperty;
  11718. WHILE(property # NIL) DO
  11719. IF ~(property.untraced) THEN
  11720. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  11721. END;
  11722. property := property.nextProperty;
  11723. END;
  11724. parameter := type.firstParameter;
  11725. WHILE(parameter # NIL) DO
  11726. IF ~(parameter.untraced) THEN
  11727. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  11728. END;
  11729. parameter := parameter.nextParameter;
  11730. END;
  11731. END;
  11732. ELSIF (type IS SyntaxTree.ArrayType) THEN
  11733. WITH type: SyntaxTree.ArrayType DO
  11734. IF type.form= SyntaxTree.Static THEN
  11735. n := type.staticLength;
  11736. base := type.arrayBase.resolved;
  11737. WHILE(base IS SyntaxTree.ArrayType) DO
  11738. type := base(SyntaxTree.ArrayType);
  11739. n := n* type.staticLength;
  11740. base := type.arrayBase.resolved;
  11741. END;
  11742. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11743. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  11744. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11745. FOR i := 0 TO n-1 DO
  11746. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11747. END;
  11748. END;
  11749. ELSE
  11750. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  11751. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11752. END;
  11753. END;
  11754. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  11755. WITH type: SyntaxTree.MathArrayType DO
  11756. IF type.form = SyntaxTree.Static THEN
  11757. n := type.staticLength;
  11758. base := type.arrayBase.resolved;
  11759. WHILE(base IS SyntaxTree.MathArrayType) DO
  11760. type := base(SyntaxTree.MathArrayType);
  11761. n := n* type.staticLength;
  11762. base := type.arrayBase.resolved;
  11763. END;
  11764. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11765. IF SemanticChecker.ContainsPointer(base) THEN
  11766. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11767. FOR i := 0 TO n-1 DO
  11768. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11769. END;
  11770. END;
  11771. ELSE
  11772. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  11773. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11774. END
  11775. END;
  11776. (* ELSE no pointers in type *)
  11777. END;
  11778. END Pointers;
  11779. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  11780. VAR position,i: LONGINT; ch: CHAR;
  11781. BEGIN
  11782. IF pool.Has(index) THEN
  11783. RETURN pool.GetInt(index)
  11784. ELSE
  11785. position := source.pc;
  11786. pool.PutInt(index, position);
  11787. Info(source, name);
  11788. i := 0;
  11789. REPEAT
  11790. ch := name[i]; INC(i);
  11791. Char( source, ch);
  11792. UNTIL ch = 0X;
  11793. END;
  11794. RETURN position;
  11795. END EnterDynamicName;
  11796. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  11797. VAR name: Basic.SectionName; position: LONGINT;
  11798. BEGIN
  11799. IF pool.Has(index) THEN
  11800. RETURN pool.GetInt(index)
  11801. ELSE
  11802. StringPool.GetString(index, name);
  11803. position := EnterDynamicName(source,name,index, pool);
  11804. END;
  11805. RETURN position;
  11806. END DynamicName;
  11807. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  11808. VAR section: IntermediateCode.Section;
  11809. BEGIN
  11810. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11811. IF implementationVisitor.backend.cooperative THEN
  11812. Info(section, "TypeDescriptor");
  11813. Basic.ToSegmentedName("BaseTypes.Array", name);
  11814. NamedSymbol(section, name,NIL, 0, 0);
  11815. BasePointer(section);
  11816. offset := 0;
  11817. ELSE
  11818. IF ProtectModulesPointers THEN
  11819. HeapBlock(mName,typeName,section,2);
  11820. END;
  11821. Info(section, "HeapBlock");
  11822. IF ProtectModulesPointers THEN
  11823. Symbol(section,section,2,0);
  11824. ELSE
  11825. Address(section,0);
  11826. END;
  11827. Info(section, "TypeDescriptor");
  11828. Address(section,0);
  11829. offset := section.pc;
  11830. END;
  11831. RETURN section
  11832. END NamedBlock;
  11833. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  11834. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  11835. BEGIN
  11836. COPY(moduleName,name);
  11837. Strings.Append(name,suffix);
  11838. Basic.ToSegmentedName(name, pooledName);
  11839. RETURN NamedBlock(mName, typeName, pooledName, offset);
  11840. END Block;
  11841. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  11842. VAR name: Basic.SegmentedName;
  11843. BEGIN
  11844. Info(source,"ArrayHeader");
  11845. IF implementationVisitor.backend.cooperative THEN
  11846. sizePC := source.pc;
  11847. Address(source,0);
  11848. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  11849. IF baseType # "" THEN
  11850. Basic.ToSegmentedName(baseType, name);
  11851. NamedSymbol(source, name,NIL, 0, 0);
  11852. ELSE
  11853. Address(source,0);
  11854. END;
  11855. Address(source,0);
  11856. ELSE
  11857. Address(source,0);
  11858. Address(source,0);
  11859. (* first pointer for GC *)
  11860. IF hasPointer THEN
  11861. (* points to first element in the array, this is NOT the base type descriptor *)
  11862. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11863. ELSE
  11864. Address(source,0);
  11865. END;
  11866. sizePC := source.pc;
  11867. Address(source,0);
  11868. Info(source,"array data");
  11869. END;
  11870. END ArrayBlock;
  11871. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11872. BEGIN
  11873. IF implementationVisitor.backend.cooperative THEN
  11874. PatchSize(section, pc, size);
  11875. PatchSize(section, pc + 3, size);
  11876. ELSE
  11877. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11878. PatchSize(section, pc, size);
  11879. END;
  11880. END PatchArray;
  11881. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11882. VAR
  11883. i: LONGINT; section: Sections.Section; fingerprinter : Fingerprinter.Fingerprinter;
  11884. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11885. poolMap: Basic.HashTableInt;
  11886. namePool: IntermediateCode.Section;
  11887. namePoolOffset: LONGINT;
  11888. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11889. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11890. BEGIN
  11891. Basic.SegmentedNameToString(s1.name,n1);
  11892. Basic.SegmentedNameToString(s2.name,n2);
  11893. index := 0;
  11894. ch1 := n1[index];
  11895. ch2 := n2[index];
  11896. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11897. INC(index);
  11898. ch1 := n1[index];
  11899. ch2 := n2[index];
  11900. END;
  11901. RETURN ch1 < ch2;
  11902. END Compare;
  11903. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11904. VAR
  11905. i, j: LONGINT;
  11906. x, t: Sections.Section;
  11907. BEGIN
  11908. IF lo < hi THEN
  11909. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11910. WHILE i <= j DO
  11911. WHILE Compare(list[i], x) DO INC(i) END;
  11912. WHILE Compare(x, list[j]) DO DEC(j) END;
  11913. IF i <= j THEN
  11914. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11915. INC(i); DEC(j)
  11916. END
  11917. END;
  11918. IF lo < j THEN QuickSort(list, lo, j) END;
  11919. IF i < hi THEN QuickSort(list, i, hi) END
  11920. END;
  11921. END QuickSort;
  11922. (*
  11923. ExportDesc* = RECORD
  11924. fp*: HUGEINT;
  11925. name* {UNTRACED}: DynamicName;
  11926. adr*: ADDRESS;
  11927. exports*: LONGINT;
  11928. dsc* {UNTRACED}: ExportArray
  11929. END;
  11930. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11931. *)
  11932. PROCEDURE ExportDesc2(
  11933. source: IntermediateCode.Section;
  11934. namePool: IntermediateCode.Section;
  11935. fingerprinter: Fingerprinter.Fingerprinter;
  11936. symbol: Sections.Section;
  11937. name: StringPool.Index;
  11938. VAR patchAdr: LONGINT
  11939. ): BOOLEAN;
  11940. VAR fingerprint: SyntaxTree.Fingerprint;
  11941. BEGIN
  11942. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11943. & (symbol.type # Sections.InlineCodeSection)
  11944. THEN
  11945. *)
  11946. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11947. & (symbol.type # Sections.ExitCodeSection)
  11948. & (symbol.type # Sections.InlineCodeSection))
  11949. THEN
  11950. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11951. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11952. fingerprint := fingerprinter.SymbolFP(symbol.symbol);
  11953. Hugeint(source,fingerprint.public);
  11954. ELSE
  11955. Hugeint(source, 0);
  11956. END;
  11957. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11958. Symbol(source, symbol,0,0);
  11959. patchAdr := source.pc;
  11960. Longint(source, 0);
  11961. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11962. Address(source,0);
  11963. END;
  11964. RETURN TRUE
  11965. ELSE
  11966. RETURN FALSE
  11967. END;
  11968. END ExportDesc2;
  11969. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11970. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11971. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11972. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11973. nextPatch: LONGINT;
  11974. TYPE
  11975. Scope = RECORD
  11976. elements: LONGINT;
  11977. gelements: LONGINT;
  11978. section: IntermediateCode.Section;
  11979. patchAdr: LONGINT;
  11980. arraySizePC: LONGINT;
  11981. beginPC: LONGINT; (* current scope start pc *)
  11982. END;
  11983. BEGIN
  11984. Basic.InitSegmentedName(prev);
  11985. olevel := -1;
  11986. scopes[0].section := source;
  11987. scopes[0].arraySizePC := MIN(LONGINT);
  11988. FOR s := 0 TO LEN(sections)-1 DO
  11989. symbol := sections[s];
  11990. 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
  11991. this := sections[s].name;
  11992. level := 0;
  11993. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11994. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11995. INC(level);
  11996. END;
  11997. WHILE level < olevel DO
  11998. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11999. IF olevel > 0 THEN
  12000. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12001. nextPatch := scopes[olevel-1].patchAdr+1;
  12002. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12003. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12004. END;
  12005. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12006. DEC(olevel);
  12007. END;
  12008. IF (level < LEN(this)) & (this[level] > 0) THEN
  12009. IF level > olevel THEN
  12010. (*TRACE("opening",level); *)
  12011. IF scopes[level].section = NIL THEN
  12012. arrayName := ".@ExportArray";
  12013. Strings.AppendInt(arrayName, level);
  12014. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  12015. AddPointer(scopes[level].section,offset);
  12016. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  12017. END;
  12018. scopes[level].beginPC := scopes[level].section.pc;
  12019. olevel := level;
  12020. scopes[olevel].elements := 0;
  12021. END;
  12022. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  12023. sym := sections[s];
  12024. ELSE
  12025. sym := NIL;
  12026. END;
  12027. IF ExportDesc2(scopes[level].section, namePool, fingerprinter, sym, this[level], scopes[level].patchAdr)
  12028. THEN
  12029. INC(scopes[olevel].elements);
  12030. END;
  12031. (* enter string in scope *)
  12032. INC(level);
  12033. END;
  12034. END;
  12035. Basic.SegmentedNameToString(this, name);
  12036. prev := this;
  12037. END;
  12038. END;
  12039. WHILE 0 <= olevel DO
  12040. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  12041. IF olevel > 0 THEN
  12042. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12043. nextPatch := scopes[olevel-1].patchAdr+1;
  12044. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12045. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12046. END;
  12047. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12048. DEC(olevel);
  12049. END;
  12050. level := 0;
  12051. WHILE (level < LEN(scopes)) DO
  12052. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  12053. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  12054. END;
  12055. INC(level);
  12056. END;
  12057. END Export;
  12058. BEGIN
  12059. NEW(fingerprinter);
  12060. NEW(poolMap, 64);
  12061. (* 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 *)
  12062. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  12063. NEW(sectionArray, module.allSections.Length());
  12064. FOR i := 0 TO module.allSections.Length() - 1 DO
  12065. section := module.allSections.GetSection(i);
  12066. sectionArray[i] := section;
  12067. END;
  12068. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  12069. Export(sectionArray^);
  12070. END ExportDesc;
  12071. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  12072. VAR
  12073. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  12074. BEGIN
  12075. Info(source, "exception table offsets array descriptor");
  12076. size := 0;
  12077. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  12078. Info(source, "exception table content");
  12079. FOR i := 0 TO module.allSections.Length() - 1 DO
  12080. p := module.allSections.GetSection(i);
  12081. IF p.type = Sections.CodeSection THEN
  12082. finallyPC := p(IntermediateCode.Section).finally;
  12083. IF finallyPC>=0 THEN
  12084. Symbol( source, p, 0,0);
  12085. Symbol( source, p, finallyPC, 0);
  12086. Symbol( source, p, finallyPC,0);
  12087. INC(size);
  12088. END;
  12089. END
  12090. END;
  12091. PatchArray(source,sizePC,size);
  12092. END ExceptionArray;
  12093. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  12094. VAR i: LONGINT; ch: CHAR;
  12095. BEGIN
  12096. i := 0;
  12097. REPEAT
  12098. ch := name[i]; INC(i);
  12099. Char( section, ch);
  12100. UNTIL ch = 0X;
  12101. WHILE i < 32 DO
  12102. Char( section, 0X); INC(i);
  12103. END;
  12104. END Name;
  12105. PROCEDURE References(section: IntermediateCode.Section);
  12106. CONST
  12107. sfTypeNone = 0X;
  12108. sfTypeCHAR = 01X;
  12109. sfTypeCHAR8 = 02X;
  12110. sfTypeCHAR16 = 03X;
  12111. sfTypeCHAR32 = 04X;
  12112. sfTypeRANGE = 05X;
  12113. sfTypeSHORTINT = 06X;
  12114. sfTypeINTEGER = 07X;
  12115. sfTypeLONGINT = 08X;
  12116. sfTypeHUGEINT = 09X;
  12117. sfTypeWORD = 0AX;
  12118. sfTypeLONGWORD = 0BX;
  12119. sfTypeSIGNED8 = 0CX;
  12120. sfTypeSIGNED16 = 0DX;
  12121. sfTypeSIGNED32 = 0EX;
  12122. sfTypeSIGNED64 = 0FX;
  12123. sfTypeUNSIGNED8 = 10X;
  12124. sfTypeUNSIGNED16 = 11X;
  12125. sfTypeUNSIGNED32 = 12X;
  12126. sfTypeUNSIGNED64 = 13X;
  12127. sfTypeREAL = 14X;
  12128. sfTypeLONGREAL = 15X;
  12129. sfTypeCOMPLEX = 16X;
  12130. sfTypeLONGCOMPLEX = 17X;
  12131. sfTypeBOOLEAN = 18X;
  12132. sfTypeSET = 19X;
  12133. sfTypeANY = 1AX;
  12134. sfTypeOBJECT = 1BX;
  12135. sfTypeBYTE = 1CX;
  12136. sfTypeADDRESS = 1DX;
  12137. sfTypeSIZE = 1EX;
  12138. sfTypeIndirect = 1FX;
  12139. sfTypeRecord = 20X;
  12140. sfTypePointerToRecord = 21X;
  12141. sfTypePointerToArray = 22X;
  12142. sfTypeOpenArray = 23X;
  12143. sfTypeStaticArray = 24X;
  12144. sfTypeDynamicArray = 25X;
  12145. sfTypeMathStaticArray = 26X;
  12146. sfTypeMathOpenArray = 27X;
  12147. sfTypeMathTensor = 28X;
  12148. sfTypeProcedure = 29X;
  12149. sfTypeDelegate = 2AX;
  12150. sfTypeENUM = 2BX;
  12151. (* sfTypeCELL = 2CX; *)
  12152. sfTypePORT = 2DX;
  12153. sfIN = 0X;
  12154. sfOUT = 1X;
  12155. flagDelegate = 0;
  12156. flagConstructor = 1;
  12157. (* variable / parameter addressing modes *)
  12158. sfAbsolute = 0X; (* global vars *)
  12159. sfRelative = 1X; (* variables, value parameters *)
  12160. sfIndirect = 2X; (* var parameters *)
  12161. sfScopeBegin = 0F0X;
  12162. sfScopeEnd = 0F1X;
  12163. sfProcedure = 0F2X;
  12164. sfVariable = 0F3X;
  12165. sfTypeDeclaration = 0F4X;
  12166. sfModule = 0FFX;
  12167. RefInfo = TRUE;
  12168. VAR
  12169. sizePC, startPC, lastOffset: LONGINT;
  12170. indirectTypes: Basic.HashTable;
  12171. PROCEDURE CurrentIndex(): LONGINT;
  12172. VAR i: LONGINT;
  12173. BEGIN
  12174. FOR i := startPC TO section.pc -1 DO
  12175. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  12176. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  12177. END;
  12178. startPC := section.pc;
  12179. RETURN lastOffset;
  12180. END CurrentIndex;
  12181. (*
  12182. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12183. Module = sfModule prevSymbol:SIZE name:String Scope.
  12184. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12185. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  12186. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12187. Type =
  12188. sfTypePointerToRecord
  12189. | sfTypePointerToArray Type
  12190. | sfTypeOpenArray Type
  12191. | sfTypeDynamicArray Type
  12192. | sfTypeStaticArray length:SIZE Type
  12193. | sfTypeMathOpenArray Type
  12194. | sfTypeMathStaticArray length:SIZE Type
  12195. | sfTypeMathTensor Type
  12196. | sfTypeRecord tdAdr:ADDRESS
  12197. | sfTypeProcedure {Parameter} return:Type
  12198. | sfTypeDelegate {Parameter} return:Type
  12199. | sfTypePort (sfIN | sfOUT)
  12200. | sfTypeBOOLEAN
  12201. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  12202. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  12203. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  12204. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  12205. | sfTypeWORD | sfTypeLONGWORD
  12206. | sfTypeREAL | sfTypeLONGREAL
  12207. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  12208. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  12209. | sfTypeIndirect offset:SIZE.
  12210. *)
  12211. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  12212. VAR offset: SIZE;
  12213. BEGIN
  12214. IF indirectTypes.Has(type) THEN
  12215. offset := indirectTypes.GetInt(type);
  12216. Char(section, sfTypeIndirect);
  12217. Size(section, offset);
  12218. RETURN TRUE;
  12219. ELSE
  12220. indirectTypes.PutInt(type, CurrentIndex());
  12221. RETURN FALSE;
  12222. END;
  12223. END Indirect;
  12224. PROCEDURE NType(type: SyntaxTree.Type);
  12225. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  12226. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  12227. BEGIN
  12228. IF type = NIL THEN
  12229. Char(section, sfTypeNone)
  12230. ELSE
  12231. type := type.resolved;
  12232. size := type.sizeInBits;
  12233. WITH type:
  12234. SyntaxTree.PointerType DO
  12235. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  12236. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12237. Char(section, sfTypePointerToRecord);
  12238. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  12239. ELSE
  12240. IF RefInfo THEN Info(section,"PointerToArray") END;
  12241. Char(section, sfTypePointerToArray);
  12242. NType(type.pointerBase);
  12243. END;
  12244. | SyntaxTree.ArrayType DO
  12245. IF ~Indirect(type) THEN
  12246. IF type.form = SyntaxTree.Open THEN
  12247. IF RefInfo THEN Info(section,"OpenArray") END;
  12248. Char(section, sfTypeOpenArray);
  12249. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  12250. IF RefInfo THEN Info(section,"DynamicArray") END;
  12251. Char(section, sfTypeDynamicArray);
  12252. ELSIF type.form = SyntaxTree.Static THEN
  12253. IF RefInfo THEN Info(section,"StaticArray") END;
  12254. Char(section, sfTypeStaticArray);
  12255. Size(section, type.staticLength);
  12256. ELSE
  12257. HALT(100);
  12258. END;
  12259. NType(type.arrayBase);
  12260. END;
  12261. | SyntaxTree.MathArrayType DO
  12262. IF ~Indirect(type) THEN
  12263. IF type.form = SyntaxTree.Open THEN
  12264. IF RefInfo THEN Info(section,"MathOpenArray") END;
  12265. Char(section, sfTypeMathOpenArray);
  12266. ELSIF type.form = SyntaxTree.Static THEN
  12267. IF RefInfo THEN Info(section,"MathStaticArray") END;
  12268. Char(section, sfTypeMathStaticArray);
  12269. Size(section, type.staticLength);
  12270. ELSIF type.form = SyntaxTree.Tensor THEN
  12271. IF RefInfo THEN Info(section,"MathTensor") END;
  12272. Char(section, sfTypeMathTensor);
  12273. ELSE
  12274. HALT(100);
  12275. END;
  12276. NType(type.arrayBase);
  12277. END;
  12278. | SyntaxTree.RecordType DO
  12279. IF ~Indirect(type) THEN
  12280. IF type.pointerType # NIL (* OBJECT *) THEN
  12281. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12282. Char(section, sfTypePointerToRecord)
  12283. ELSE
  12284. IF RefInfo THEN Info(section,"Record") END;
  12285. Char(section, sfTypeRecord);
  12286. td := type.typeDeclaration;
  12287. IF RefInfo THEN Info(section,"TD") END;
  12288. IF (td # NIL) THEN
  12289. Global.GetSymbolSegmentedName(td,segmentedName);
  12290. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12291. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12292. ELSE
  12293. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12294. END;
  12295. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  12296. Symbol(section, tir, 0, offset);
  12297. ELSE
  12298. Address(section, 0);
  12299. END;
  12300. END;
  12301. END;
  12302. | SyntaxTree.CellType DO
  12303. IF ~Indirect(type) THEN
  12304. IF RefInfo THEN Info(section,"Record") END;
  12305. Char(section, sfTypeRecord);
  12306. td := type.typeDeclaration;
  12307. IF RefInfo THEN Info(section,"TD") END;
  12308. IF (td # NIL) THEN
  12309. Global.GetSymbolSegmentedName(td,segmentedName);
  12310. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12311. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12312. ELSE
  12313. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12314. END;
  12315. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12316. Symbol(section, tir, 0, offset);
  12317. ELSE
  12318. Address(section, 0);
  12319. END;
  12320. END;
  12321. | SyntaxTree.PortType DO
  12322. Char(section, sfTypePORT);
  12323. IF type.direction = SyntaxTree.OutPort THEN
  12324. Char(section, sfOUT)
  12325. ELSE
  12326. Char(section, sfIN)
  12327. END;
  12328. | SyntaxTree.ProcedureType DO
  12329. IF ~Indirect(type) THEN
  12330. IF type.isDelegate THEN
  12331. Char(section, sfTypeDelegate);
  12332. ELSE
  12333. Char(section, sfTypeProcedure);
  12334. END;
  12335. parameter := type.firstParameter;
  12336. WHILE(parameter # NIL) DO
  12337. NParameter(parameter, -1);
  12338. parameter := parameter.nextParameter;
  12339. END;
  12340. NType(type.returnType);
  12341. END;
  12342. | SyntaxTree.EnumerationType DO
  12343. Char(section, sfTypeENUM);
  12344. | SyntaxTree.BasicType DO
  12345. WITH type:
  12346. SyntaxTree.BooleanType DO
  12347. IF RefInfo THEN Info(section,"Boolean") END;
  12348. Char(section, sfTypeBOOLEAN);
  12349. | SyntaxTree.CharacterType DO
  12350. IF type = module.system.characterType THEN
  12351. IF RefInfo THEN Info(section,"CHAR") END;
  12352. Char(section, sfTypeCHAR);
  12353. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  12354. IF RefInfo THEN Info(section,"CHAR8") END;
  12355. Char(section, sfTypeCHAR8)
  12356. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  12357. IF RefInfo THEN Info(section,"CHAR16") END;
  12358. Char(section, sfTypeCHAR16);
  12359. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  12360. IF RefInfo THEN Info(section,"CHAR32") END;
  12361. Char(section, sfTypeCHAR32);
  12362. ELSE
  12363. HALT(100);
  12364. END;
  12365. |SyntaxTree.IntegerType DO
  12366. IF type(SyntaxTree.IntegerType).signed THEN
  12367. IF (type = module.system.shortintType) THEN
  12368. IF RefInfo THEN Info(section,"SHORTINT") END;
  12369. Char(section, sfTypeSHORTINT)
  12370. ELSIF (type = module.system.integerType) THEN
  12371. IF RefInfo THEN Info(section,"INTEGER") END;
  12372. Char(section, sfTypeINTEGER)
  12373. ELSIF (type = module.system.longintType) THEN
  12374. IF RefInfo THEN Info(section,"LONGINT") END;
  12375. Char(section, sfTypeLONGINT)
  12376. ELSIF (type = module.system.hugeintType) THEN
  12377. IF RefInfo THEN Info(section,"HUGEINT") END;
  12378. Char(section, sfTypeHUGEINT)
  12379. ELSIF (type = module.system.wordType) THEN
  12380. IF RefInfo THEN Info(section,"WORD") END;
  12381. Char(section, sfTypeWORD)
  12382. ELSIF (type = module.system.longWordType) THEN
  12383. IF RefInfo THEN Info(section,"LONGWORD") END;
  12384. Char(section, sfTypeLONGWORD);
  12385. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  12386. IF RefInfo THEN Info(section,"SIGNED8") END;
  12387. Char(section, sfTypeSIGNED8)
  12388. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  12389. IF RefInfo THEN Info(section,"SIGNED16") END;
  12390. Char(section, sfTypeSIGNED16)
  12391. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  12392. IF RefInfo THEN Info(section,"SIGNED32") END;
  12393. Char(section, sfTypeSIGNED32)
  12394. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  12395. IF RefInfo THEN Info(section,"SIGNED64") END;
  12396. Char(section, sfTypeSIGNED64)
  12397. ELSE
  12398. HALT(100);
  12399. END
  12400. ELSE (* unsigned *)
  12401. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  12402. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  12403. Char(section, sfTypeUNSIGNED8)
  12404. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  12405. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  12406. Char(section, sfTypeUNSIGNED16)
  12407. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  12408. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  12409. Char(section, sfTypeUNSIGNED32)
  12410. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  12411. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  12412. Char(section, sfTypeUNSIGNED64)
  12413. ELSE
  12414. HALT(100)
  12415. END
  12416. END;
  12417. | SyntaxTree.FloatType DO
  12418. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  12419. IF RefInfo THEN Info(section,"REAL") END;
  12420. Char(section, sfTypeREAL);
  12421. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  12422. IF RefInfo THEN Info(section,"LONGREAL") END;
  12423. Char(section, sfTypeLONGREAL);
  12424. ELSE
  12425. HALT(100);
  12426. END;
  12427. | SyntaxTree.ComplexType DO
  12428. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  12429. IF RefInfo THEN Info(section,"COMPLEX") END;
  12430. Char(section, sfTypeCOMPLEX);
  12431. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  12432. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  12433. Char(section, sfTypeLONGCOMPLEX);
  12434. ELSE
  12435. HALT(100);
  12436. END;
  12437. |SyntaxTree.SetType DO
  12438. IF RefInfo THEN Info(section,"SET") END;
  12439. Char(section, sfTypeSET);
  12440. |SyntaxTree.AnyType DO
  12441. IF RefInfo THEN Info(section,"ANY") END;
  12442. Char(section, sfTypeANY);
  12443. |SyntaxTree.ObjectType DO
  12444. IF RefInfo THEN Info(section,"OBJECT") END;
  12445. Char(section, sfTypeOBJECT);
  12446. |SyntaxTree.ByteType DO
  12447. IF RefInfo THEN Info(section,"BYTE") END;
  12448. Char(section, sfTypeBYTE);
  12449. |SyntaxTree.RangeType DO
  12450. IF RefInfo THEN Info(section,"RANGE") END;
  12451. Char(section, sfTypeRANGE)
  12452. |SyntaxTree.AddressType DO
  12453. IF RefInfo THEN Info(section,"ADDRESS") END;
  12454. Char(section, sfTypeADDRESS)
  12455. |SyntaxTree.SizeType DO
  12456. IF RefInfo THEN Info(section,"SIZE") END;
  12457. Char(section, sfTypeSIZE)
  12458. ELSE
  12459. HALT(100)
  12460. END;
  12461. ELSE HALT(101);
  12462. END;
  12463. END;
  12464. END NType;
  12465. (*
  12466. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  12467. *)
  12468. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  12469. VAR type: SyntaxTree.Type;
  12470. BEGIN
  12471. IF RefInfo THEN Info(section, "Parameter") END;
  12472. Char(section, sfVariable);
  12473. Size(section, procOffset);
  12474. String0(section, parameter.name);
  12475. type := parameter.type.resolved;
  12476. IF parameter.kind = SyntaxTree.VarParameter THEN
  12477. IF IsOpenArray(type) THEN Char(section, sfRelative)
  12478. ELSE Char(section, sfIndirect)
  12479. END;
  12480. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12481. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  12482. Char(section, sfIndirect);
  12483. ELSE
  12484. Char(section, sfRelative);
  12485. END;
  12486. ELSE
  12487. Char(section, sfRelative);
  12488. END;
  12489. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  12490. NType(parameter.type);
  12491. END NParameter;
  12492. (*
  12493. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12494. *)
  12495. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  12496. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  12497. flags: SET;
  12498. BEGIN
  12499. IF procedure.externalName # NIL THEN RETURN END;
  12500. IF RefInfo THEN Info(section, "Procedure") END;
  12501. pos := CurrentIndex();
  12502. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  12503. Char(section, sfProcedure);
  12504. Size(section, scopeOffset);
  12505. String0(section,procedure.name);
  12506. s := module.allSections.FindBySymbol(procedure);
  12507. Symbol(section,s,0,0); (* start *)
  12508. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  12509. flags := {};
  12510. IF procedureType.isDelegate THEN
  12511. INCL(flags, flagDelegate);
  12512. END;
  12513. IF procedure.isConstructor THEN
  12514. INCL(flags, flagConstructor);
  12515. END;
  12516. Set(section, flags);
  12517. IF RefInfo THEN Info(section, "Parameters") END;
  12518. parameter := procedureType.firstParameter;
  12519. WHILE(parameter # NIL) DO
  12520. NParameter(parameter, pos);
  12521. parameter := parameter.nextParameter;
  12522. END;
  12523. IF procedureType.returnParameter # NIL THEN
  12524. NParameter(procedureType.returnParameter, pos);
  12525. END;
  12526. IF procedureType.selfParameter # NIL THEN
  12527. NParameter(procedureType.selfParameter, pos);
  12528. END;
  12529. IF RefInfo THEN Info(section, "ReturnType") END;
  12530. NType(procedureType.returnType);
  12531. NScope(procedure.procedureScope, pos);
  12532. END NProcedure;
  12533. (*
  12534. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  12535. *)
  12536. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  12537. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  12538. BEGIN
  12539. IF RefInfo THEN Info(section, "Variable") END;
  12540. pos := CurrentIndex();
  12541. Char(section, sfVariable);
  12542. Size(section, scopeOffset);
  12543. String0(section, variable.name);
  12544. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  12545. Char(section, sfAbsolute);
  12546. IF variable.externalName # NIL THEN
  12547. sn := variable.externalName^;
  12548. NamedSymbol(section, sn,NIL, 0,0);
  12549. ELSE
  12550. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  12551. NamedSymbol(section, sn,variable, 0,0);
  12552. END;
  12553. ELSE
  12554. Char(section, sfRelative);
  12555. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  12556. END;
  12557. NType(variable.type);
  12558. s := module.allSections.FindBySymbol(variable);
  12559. END NVariable;
  12560. (*
  12561. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12562. *)
  12563. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  12564. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  12565. BEGIN
  12566. IF typeDeclaration = NIL THEN RETURN END;
  12567. pos := CurrentIndex();
  12568. s := module.allSections.FindBySymbol(typeDeclaration);
  12569. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  12570. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  12571. Char(section, sfTypeDeclaration);
  12572. Size(section, scopeOffset);
  12573. String0(section, typeDeclaration.name);
  12574. declared := typeDeclaration.declaredType.resolved;
  12575. IF (declared IS SyntaxTree.PointerType) THEN
  12576. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  12577. END;
  12578. WITH declared:
  12579. SyntaxTree.RecordType DO
  12580. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  12581. Symbol(section, s, 0, offset);
  12582. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12583. Basic.AppendToSegmentedName(name,".@Info");
  12584. s := module.allSections.FindByName(name);
  12585. IF s # NIL THEN (* does not work for coop *)
  12586. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12587. END;
  12588. NScope(declared.recordScope, pos);
  12589. |SyntaxTree.CellType DO
  12590. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12591. Symbol(section, s, 0, offset);
  12592. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12593. Basic.AppendToSegmentedName(name,".@Info");
  12594. s := module.allSections.FindByName(name);
  12595. IF s # NIL THEN
  12596. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12597. END;
  12598. NScope(declared.cellScope, pos);
  12599. ELSE
  12600. Address(section, 0);
  12601. END;
  12602. END NTypeDeclaration;
  12603. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  12604. VAR pos: LONGINT;
  12605. BEGIN
  12606. pos := CurrentIndex();
  12607. Char(section,sfModule);
  12608. Size(section, prevSymbol);
  12609. String0(section, module.name);
  12610. NScope(module.moduleScope, pos);
  12611. END NModule;
  12612. (*
  12613. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12614. *)
  12615. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  12616. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  12617. BEGIN
  12618. IF scope = NIL THEN RETURN END;
  12619. IF RefInfo THEN Info(section, "Scope") END;
  12620. Char(section, sfScopeBegin);
  12621. variable := scope.firstVariable;
  12622. WHILE (variable # NIL) DO
  12623. NVariable(variable, prevSymbol);
  12624. variable := variable.nextVariable;
  12625. END;
  12626. WITH scope:
  12627. SyntaxTree.ModuleScope DO
  12628. bodyProcedure := scope.bodyProcedure;
  12629. |SyntaxTree.RecordScope DO
  12630. bodyProcedure := scope.bodyProcedure;
  12631. ELSE
  12632. bodyProcedure := NIL;
  12633. END;
  12634. IF bodyProcedure # NIL THEN
  12635. NProcedure(bodyProcedure, prevSymbol)
  12636. END;
  12637. procedure := scope.firstProcedure;
  12638. WHILE procedure # NIL DO
  12639. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  12640. procedure := procedure.nextProcedure;
  12641. END;
  12642. typeDeclaration := scope.firstTypeDeclaration;
  12643. WHILE typeDeclaration # NIL DO
  12644. NTypeDeclaration(typeDeclaration, prevSymbol);
  12645. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  12646. END;
  12647. Char(section, sfScopeEnd); (* scope ends *)
  12648. END NScope;
  12649. BEGIN
  12650. NEW(indirectTypes, 32);
  12651. ArrayBlock(section,sizePC,"", FALSE);
  12652. startPC := section.pc;
  12653. NModule(module.module, -1);
  12654. PatchArray(section,sizePC,CurrentIndex());
  12655. END References;
  12656. (*
  12657. Command* = RECORD
  12658. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  12659. name*: Name; (* name of the procedure *)
  12660. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  12661. entryAdr* : ADDRESS; (* entry address of procedure *)
  12662. END;
  12663. *)
  12664. PROCEDURE CommandArray(source: IntermediateCode.Section);
  12665. VAR
  12666. p: Sections.Section; sizePC, numberCommands: LONGINT;
  12667. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  12668. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  12669. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  12670. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  12671. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  12672. BEGIN
  12673. RETURN
  12674. (type = NIL) OR
  12675. (type.resolved IS SyntaxTree.RecordType) OR
  12676. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  12677. (type.resolved IS SyntaxTree.AnyType);
  12678. END TypeAllowed;
  12679. BEGIN
  12680. numberParameters := procedureType.numberParameters;
  12681. RETURN
  12682. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  12683. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  12684. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  12685. END GetProcedureAllowed;
  12686. PROCEDURE WriteType(type : SyntaxTree.Type);
  12687. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  12688. name: Basic.SegmentedName; offset: LONGINT;
  12689. BEGIN
  12690. IF type = NIL THEN
  12691. Address(source,0);
  12692. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  12693. Address(source,1);
  12694. ELSE
  12695. type := type.resolved;
  12696. IF type IS SyntaxTree.PointerType THEN
  12697. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  12698. END;
  12699. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  12700. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  12701. name[0] := typeDeclaration.name; name[1] := -1;
  12702. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  12703. ASSERT(section # NIL);
  12704. ELSE
  12705. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12706. (* TODO *)
  12707. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  12708. END;
  12709. IF implementationVisitor.backend.cooperative THEN
  12710. offset := 0;
  12711. ELSE
  12712. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  12713. END;
  12714. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  12715. END;
  12716. END WriteType;
  12717. BEGIN
  12718. Info(source, "command array descriptor");
  12719. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  12720. numberCommands := 0;
  12721. Info(source, "command array content");
  12722. FOR i := 0 TO module.allSections.Length() - 1 DO
  12723. p := module.allSections.GetSection(i);
  12724. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  12725. procedure := p.symbol(SyntaxTree.Procedure);
  12726. procedureType := procedure.type(SyntaxTree.ProcedureType);
  12727. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  12728. procedure.GetName(name);
  12729. Name(source,name);
  12730. numberParameters := procedureType.numberParameters;
  12731. (* offset of type of first parameter *)
  12732. IF (numberParameters = 0 ) THEN WriteType(NIL)
  12733. ELSE WriteType(procedureType.firstParameter.type)
  12734. END;
  12735. (* offset of type of return parameter *)
  12736. WriteType(procedureType.returnType);
  12737. (* command name *)
  12738. (* command code offset *)
  12739. Symbol(source,p,0,0);
  12740. INC(numberCommands);
  12741. IF Trace THEN
  12742. D.Ln;
  12743. END;
  12744. END;
  12745. END
  12746. END;
  12747. PatchArray(source,sizePC,numberCommands);
  12748. END CommandArray;
  12749. (* to prevent from double import of different module aliases *)
  12750. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  12751. VAR i: SyntaxTree.Import;
  12752. BEGIN
  12753. i := module.module.moduleScope.firstImport;
  12754. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  12755. i := i.nextImport;
  12756. END;
  12757. RETURN i = import
  12758. END IsFirstDirectOccurence;
  12759. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  12760. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  12761. BEGIN
  12762. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  12763. ArrayBlock(source,pc,"", FALSE);
  12764. Info(source, "import module array data");
  12765. IF implementationVisitor.backend.cooperative THEN
  12766. offset := 0;
  12767. ELSE
  12768. IF module.system.addressType.sizeInBits = 64 THEN
  12769. (* change this when Heaps.HeapBlock is modified *)
  12770. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12771. ELSE
  12772. (* change this when Heaps.HeapBlock is modified *)
  12773. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12774. END;
  12775. END;
  12776. import := module.module.moduleScope.firstImport;
  12777. numberImports := 0;
  12778. WHILE import # NIL DO
  12779. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  12780. Global.GetModuleSegmentedName(import.module,name);
  12781. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  12782. NamedSymbol(source, name, NIL, 0, offset);
  12783. INC(numberImports);
  12784. END;
  12785. import := import.nextImport
  12786. END;
  12787. PatchArray(source,pc,numberImports);
  12788. END ImportsArray;
  12789. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  12790. VAR
  12791. p: Sections.Section; sizePC, size, i: LONGINT;
  12792. BEGIN
  12793. Info(source, "Type info section");
  12794. size := 0;
  12795. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  12796. FOR i := 0 TO module.allSections.Length() - 1 DO
  12797. p := module.allSections.GetSection(i);
  12798. WITH p: IntermediateCode.Section DO
  12799. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  12800. Symbol(source,p,EmptyBlockOffset,0);
  12801. INC(size);
  12802. END;
  12803. END
  12804. END;
  12805. PatchArray(source,sizePC,size);
  12806. END TypeInfoSection;
  12807. (*
  12808. ProcTableEntry* = RECORD
  12809. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  12810. noPtr*: LONGINT;
  12811. END;
  12812. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  12813. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  12814. *)
  12815. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12816. VAR
  12817. numberPointers: LONGINT;
  12818. procedure: SyntaxTree.Procedure;
  12819. BEGIN
  12820. Info(section,"pcFrom");
  12821. Symbol(section,procedureSection,0,0);
  12822. Info(section,"pcTo");
  12823. Symbol(section, procedureSection, procedureSection.pc, 0);
  12824. Info(section,"pointer to offsets array");
  12825. Symbol(section, section,section.pc+1,0);
  12826. Info(section,"offsets array");
  12827. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  12828. PointerArray(section, procedure.procedureScope, numberPointers);
  12829. END ProcedureDescriptor;
  12830. (* only for tracing, the descriptor is otherwise not complete ! *)
  12831. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  12832. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  12833. BEGIN
  12834. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  12835. name := procedureSection.name;
  12836. Basic.AppendToSegmentedName(name,".@Info");
  12837. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12838. Address(section,0);
  12839. Symbol(section,section,2,0);
  12840. (*
  12841. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  12842. descSize: SIZE;
  12843. sentinel: ADDRESS; (* = MPO-4 *)
  12844. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12845. flags*: SET;
  12846. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12847. name*: Name;
  12848. END;
  12849. *)
  12850. Size(section, 0);
  12851. Address(section,0);
  12852. Address(section,0);
  12853. Set(section,{});
  12854. moduleSection := ModuleSection();
  12855. Symbol( section, moduleSection, moduleSection.pc,0);
  12856. IF procedureSection.symbol = NIL THEN
  12857. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12858. ELSE
  12859. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12860. END;
  12861. Name(section, infoName);
  12862. Size(section, 0);
  12863. RETURN section;
  12864. END MakeProcedureDescriptorTag;
  12865. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12866. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12867. BEGIN
  12868. name := procedureSection.name;
  12869. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12870. IF implementationVisitor.backend.cooperative THEN
  12871. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12872. Info(section, "TypeDescriptor");
  12873. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12874. NamedSymbol(dest, name,NIL, 0, 0);
  12875. BaseRecord(dest);
  12876. offset := 0;
  12877. ELSIF CreateProcedureDescInfo THEN
  12878. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12879. Address(dest,0);
  12880. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12881. offset := dest.pc;
  12882. ELSE
  12883. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12884. END;
  12885. ProcedureDescriptor(dest, procedureSection);
  12886. Symbol(section, dest, offset, 0);
  12887. END ProcedureDescriptorPointer;
  12888. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12889. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12890. BEGIN
  12891. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12892. numberProcs := 0;
  12893. FOR i := 0 TO module.allSections.Length() - 1 DO
  12894. destination := module.allSections.GetSection(i);
  12895. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12896. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12897. INC(numberProcs);
  12898. END
  12899. END;
  12900. PatchArray(section, sizePC, numberProcs);
  12901. END ProcedureDescriptorArray;
  12902. (*
  12903. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12904. VAR
  12905. next*: Module; (** once a module is published, all fields are read-only *)
  12906. name*: Name;
  12907. init, published: BOOLEAN;
  12908. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12909. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12910. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12911. command*: POINTER TO ARRAY OF Command;
  12912. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12913. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12914. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12915. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12916. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12917. data*, code*: Bytes;
  12918. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12919. export*: ExportDesc;
  12920. term*: TerminationHandler;
  12921. exTable*: ExceptionTable;
  12922. noProcs*: LONGINT;
  12923. firstProc*: ADDRESS; <- done by loader
  12924. maxPtrs*: LONGINT;
  12925. crc*: LONGINT;
  12926. *)
  12927. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12928. BEGIN
  12929. Info(section, "cycle");
  12930. Size(section,0);
  12931. Info(section, "references");
  12932. Size(section,0);
  12933. Info(section, "nextMarked");
  12934. Address(section,0);
  12935. Info(section, "nextWatched");
  12936. Address(section,0);
  12937. END BasePointer;
  12938. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12939. BEGIN
  12940. BasePointer(section);
  12941. Info(section, "action");
  12942. Address(section,0);
  12943. Info(section, "monitor");
  12944. Address(section,0);
  12945. END BaseObject;
  12946. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12947. BEGIN
  12948. BasePointer(section);
  12949. Info(section, "action");
  12950. Address(section,0);
  12951. Info(section, "monitor");
  12952. Address(section,0);
  12953. END BaseRecord;
  12954. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12955. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12956. pooledName: Basic.SegmentedName;
  12957. symbol: SyntaxTree.Symbol;
  12958. BEGIN
  12959. Global.GetModuleName(module.module,name);
  12960. Strings.Append(name,".@Module.@Descriptor");
  12961. Basic.ToSegmentedName(name, pooledName);
  12962. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12963. Symbol(section,descriptorSection,0,0);
  12964. Info(descriptorSection, "descriptor");
  12965. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12966. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12967. Address(descriptorSection,0);
  12968. Global.GetModuleName(module.module,name);
  12969. Strings.Append(name,".@Trace");
  12970. Basic.ToSegmentedName(name, pooledName);
  12971. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12972. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12973. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12974. END ModuleDescriptor;
  12975. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12976. VAR name: ARRAY 128 OF CHAR;
  12977. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12978. symbol: SyntaxTree.Symbol;
  12979. BEGIN
  12980. Global.GetModuleName(module.module,name);
  12981. Strings.Append(name,".@Module");
  12982. Basic.ToSegmentedName(name, pooledName);
  12983. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12984. moduleSection.SetExported(TRUE);
  12985. IF moduleSection.pc = 0 THEN
  12986. IF implementationVisitor.backend.cooperative THEN
  12987. Info(moduleSection, "descriptor");
  12988. ModuleDescriptor(moduleSection);
  12989. BaseObject(moduleSection);
  12990. implementationVisitor.CreateTraceModuleMethod(module.module);
  12991. ELSE
  12992. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12993. Info(moduleSection, "HeapBlock");
  12994. Symbol(moduleSection,moduleSection,2,0);
  12995. Info(moduleSection, "TypeDescriptor");
  12996. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12997. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12998. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12999. END;
  13000. END;
  13001. RETURN moduleSection;
  13002. END ModuleSection;
  13003. PROCEDURE NewModuleInfo();
  13004. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13005. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13006. sectionName: Basic.SectionName;
  13007. CONST MPO=-40000000H;
  13008. BEGIN
  13009. (*
  13010. TypeDesc* = POINTER TO RECORD
  13011. descSize: SIZE;
  13012. sentinel: LONGINT; (* = MPO-4 *)
  13013. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13014. flags*: SET;
  13015. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13016. name*: Name;
  13017. refsOffset: SIZE;
  13018. END;
  13019. *)
  13020. (*name is missing prefixes sometimes*)
  13021. Global.GetModuleSegmentedName(module.module,name);
  13022. Basic.AppendToSegmentedName(name,".@Info");
  13023. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13024. IF ~implementationVisitor.backend.cooperative THEN
  13025. Info(source, "HeapBlock");
  13026. Address(source,0); (* an empty heap block prevents GC marking *)
  13027. Info(source, "TypeDescriptor");
  13028. Address(source,0);
  13029. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13030. END;
  13031. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13032. Address(source,MPO-4);
  13033. Info(source, "type tag pointer");
  13034. Address( source,0);
  13035. Info(source, "type flags");
  13036. flags := {};
  13037. Set( source, flags);
  13038. Info(source, "pointer to module");
  13039. moduleSection := ModuleSection();
  13040. Symbol( source, moduleSection, moduleSection.pc,0);
  13041. Info(source, "type name");
  13042. i := 0;
  13043. sectionName := "@Self";
  13044. (*
  13045. Global.GetSymbolSegmentedName(td,name);
  13046. Basic.SegmentedNameToString(name, sectionName);
  13047. *)
  13048. Name(source,sectionName);
  13049. patchInfoPC := source.pc;
  13050. Size(source, 0);
  13051. END NewModuleInfo;
  13052. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  13053. VAR
  13054. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  13055. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  13056. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  13057. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  13058. referenceSectionOffset : LONGINT;
  13059. name: Basic.SegmentedName; offset: LONGINT;
  13060. flags: SET;
  13061. BEGIN
  13062. NewModuleInfo();
  13063. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  13064. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  13065. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  13066. ImportsArray(importSection);
  13067. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  13068. CommandArray(commandsSection);
  13069. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  13070. ExceptionArray(exceptionSection);
  13071. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  13072. AddPointer(typeInfoSection, typeInfoSectionOffset);
  13073. TypeInfoSection(typeInfoSection);
  13074. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  13075. referenceSection.SetExported(TRUE);
  13076. References(referenceSection);
  13077. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  13078. ProcedureDescriptorArray(procTableSection, numberProcs);
  13079. IF ProtectModulesPointers THEN
  13080. name := "Heaps.AnyPtr";
  13081. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  13082. (* set base pointer *)
  13083. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  13084. END;
  13085. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  13086. ArrayBlock(emptyArraySection,temp,"", FALSE);
  13087. moduleSection := ModuleSection();
  13088. Info(moduleSection, "nextRoot*: RootObject");
  13089. Address(moduleSection,0);
  13090. Info(moduleSection, "next*: Module");
  13091. Address(moduleSection,0);
  13092. Info(moduleSection, "name*: Name");
  13093. Name(moduleSection,moduleName);
  13094. Info(moduleSection, "init, published: BOOLEAN");
  13095. Boolean(moduleSection,FALSE);
  13096. Boolean(moduleSection,FALSE);
  13097. Info(moduleSection,"filler"); (*! introduce alignment! *)
  13098. Boolean(moduleSection,FALSE);
  13099. Boolean(moduleSection,FALSE);
  13100. Info(moduleSection, "refcnt*: LONGINT");
  13101. Longint(moduleSection,0);
  13102. Info(moduleSection, "sb*: ADDRESS");
  13103. Address(moduleSection,0);
  13104. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  13105. Address(moduleSection,0);
  13106. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  13107. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  13108. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  13109. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  13110. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  13111. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  13112. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  13113. Symbol(moduleSection,importSection,importSectionOffset,0);
  13114. Info(moduleSection, "procTable*: ProcTable");
  13115. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  13116. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  13117. Address(moduleSection,0);
  13118. Address(moduleSection,0);
  13119. Address(moduleSection,0);
  13120. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  13121. Info(moduleSection, "export*: ExportDesc");
  13122. ExportDesc(moduleSection);
  13123. Info(moduleSection, "term*: TerminationHandler");
  13124. Address(moduleSection,0);
  13125. Info(moduleSection, "exTable*: ExceptionTable");
  13126. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  13127. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  13128. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  13129. Info(moduleSection, "crc*: LONGINT");
  13130. patchCRC:= moduleSection.pc;
  13131. Longint(moduleSection, 0); (*! must be implemented *)
  13132. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  13133. Info(moduleSection, "body*: ADDRESS");
  13134. Symbol(moduleSection, bodyProc, 0,0);
  13135. Info(moduleSection, "module flags");
  13136. flags := {};
  13137. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  13138. Set( moduleSection, flags);
  13139. IF implementationVisitor.backend.cooperative THEN
  13140. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  13141. Info(moduleSection, "monitor.owner");
  13142. Address(moduleSection,0);
  13143. Info(moduleSection, "monitor.nestingLevel");
  13144. Address(moduleSection,0);
  13145. Info(moduleSection, "monitor.blockedQueue");
  13146. Address(moduleSection,0); Address(moduleSection,0);
  13147. Info(moduleSection, "monitor.waitingQueue");
  13148. Address(moduleSection,0); Address(moduleSection,0);
  13149. Info(moduleSection, "monitor.waitingSentinel");
  13150. Address(moduleSection,0);
  13151. END;
  13152. END Module;
  13153. PROCEDURE PatchCRC(crc: LONGINT);
  13154. BEGIN
  13155. IF ~simple THEN
  13156. PatchLongint(ModuleSection(), patchCRC, crc);
  13157. END;
  13158. END PatchCRC;
  13159. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  13160. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  13161. BEGIN
  13162. ArrayBlock(source,pc,"",FALSE);
  13163. Info(source, "pointer offsets array data");
  13164. IF scope IS SyntaxTree.RecordScope THEN
  13165. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  13166. ELSIF scope IS SyntaxTree.CellScope THEN
  13167. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  13168. ELSIF scope IS SyntaxTree.ModuleScope THEN
  13169. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  13170. WHILE variable # NIL DO
  13171. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13172. symbol := module.allSections.FindBySymbol(variable);
  13173. ASSERT(symbol # NIL);
  13174. Pointers(0,symbol, source,variable.type,numberPointers);
  13175. END;
  13176. variable := variable.nextVariable;
  13177. END;
  13178. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  13179. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13180. WHILE parameter # NIL DO
  13181. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  13182. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  13183. END;
  13184. parameter := parameter.nextParameter;
  13185. END;
  13186. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  13187. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  13188. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13189. IF implementationVisitor.backend.preciseGC THEN
  13190. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13191. END;
  13192. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  13193. END;
  13194. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  13195. WHILE(variable # NIL) DO
  13196. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13197. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  13198. END;
  13199. variable := variable.nextVariable
  13200. END;
  13201. END;
  13202. PatchArray(source,pc,numberPointers);
  13203. END PointerArray;
  13204. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  13205. VAR recordType: SyntaxTree.RecordType;
  13206. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  13207. section: Sections.Section; cellType: SyntaxTree.CellType;
  13208. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  13209. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13210. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13211. sectionName: Basic.SectionName;
  13212. CONST MPO=-40000000H;
  13213. BEGIN
  13214. (*
  13215. TypeDesc* = POINTER TO RECORD
  13216. descSize: SIZE;
  13217. sentinel: LONGINT; (* = MPO-4 *)
  13218. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13219. flags*: SET;
  13220. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13221. name*: Name;
  13222. refsOffset: SIZE;
  13223. END;
  13224. *)
  13225. (* source := module.sections.FindByName(...) *)
  13226. Global.GetSymbolSegmentedName(td,name);
  13227. Basic.AppendToSegmentedName(name,".@Info");
  13228. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13229. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  13230. Address(source,0);
  13231. Info(source, "TypeDescriptor");
  13232. Address(source,0);
  13233. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13234. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13235. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  13236. Info(source, "type tag pointer");
  13237. Symbol( source, tag, offset, 0);
  13238. Info(source, "type flags");
  13239. flags := {};
  13240. IF isProtected THEN INCL(flags,31) END;
  13241. Set( source, flags);
  13242. Info(source, "pointer to module");
  13243. moduleSection := ModuleSection();
  13244. Symbol( source, moduleSection, moduleSection.pc,0);
  13245. Info(source, "type name");
  13246. i := 0;
  13247. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  13248. (*
  13249. Global.GetSymbolSegmentedName(td,name);
  13250. Basic.SegmentedNameToString(name, sectionName);
  13251. *)
  13252. Name(source,sectionName);
  13253. Size(source, 0);
  13254. RETURN source;
  13255. END NewTypeDescriptorInfo;
  13256. PROCEDURE NewTypeDescriptor;
  13257. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  13258. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  13259. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  13260. numberPointers: LONGINT; padding, i: LONGINT;
  13261. CONST MPO=-40000000H;
  13262. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  13263. VAR i: LONGINT;
  13264. PROCEDURE Td(record: SyntaxTree.RecordType);
  13265. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  13266. BEGIN
  13267. IF record # NIL THEN
  13268. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  13269. baseTD := record.typeDeclaration;
  13270. Global.GetSymbolSegmentedName(baseTD,name);
  13271. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13272. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13273. ELSE
  13274. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13275. END;
  13276. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  13277. Symbol(source, tir, 0, offset);
  13278. IF reverse THEN Td(record.GetBaseRecord()) END;
  13279. END;
  13280. END Td;
  13281. BEGIN
  13282. Info(source, "tag table");
  13283. baseRecord := recordType;
  13284. i := 0;
  13285. WHILE baseRecord # NIL DO
  13286. INC(i);
  13287. baseRecord := baseRecord.GetBaseRecord();
  13288. END;
  13289. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  13290. IF ~reverse THEN Td(recordType) END;
  13291. WHILE i < size DO
  13292. Address(source,0);
  13293. INC(i);
  13294. END;
  13295. IF reverse THEN Td(recordType) END;
  13296. END TdTable;
  13297. PROCEDURE MethodTable(reverse: BOOLEAN);
  13298. VAR i,methods: LONGINT;
  13299. BEGIN
  13300. Info(source, "method table");
  13301. IF recordType # NIL THEN
  13302. methods := recordType.recordScope.numberMethods;
  13303. IF reverse THEN
  13304. FOR i := methods-1 TO 0 BY -1 DO
  13305. procedure := recordType.recordScope.FindMethod(i);
  13306. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13307. NamedSymbol(source, name,procedure, 0,0);
  13308. END;
  13309. ELSE
  13310. FOR i := 0 TO methods-1 DO
  13311. procedure := recordType.recordScope.FindMethod(i);
  13312. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13313. NamedSymbol(source, name,procedure, 0,0);
  13314. END;
  13315. END;
  13316. END;
  13317. END MethodTable;
  13318. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  13319. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  13320. BEGIN
  13321. Info(source, "method table");
  13322. baseRecord := recordType;
  13323. WHILE baseRecord.baseType # NIL DO
  13324. baseRecord := baseRecord.GetBaseRecord ();
  13325. END;
  13326. GetRecordTypeName (baseRecord, name);
  13327. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  13328. IF name = stackFrame THEN
  13329. start := 0;
  13330. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  13331. baseRecord := recordType;
  13332. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  13333. baseRecord := baseRecord.GetBaseRecord ();
  13334. END;
  13335. IF baseRecord # NIL THEN
  13336. GetRecordTypeName (baseRecord, name);
  13337. IF pointer & ~baseRecord.isObject THEN
  13338. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13339. END;
  13340. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  13341. ELSIF recordType.isObject THEN
  13342. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  13343. ELSIF pointer THEN
  13344. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  13345. ELSE
  13346. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  13347. END;
  13348. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13349. Symbol(source, tir, 0, 0);
  13350. start := 0;
  13351. baseRecord := recordType;
  13352. WHILE (baseRecord # NIL) DO
  13353. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  13354. baseRecord := baseRecord.GetBaseRecord ();
  13355. END;
  13356. ELSE
  13357. (* explicit trace method: *)
  13358. procedure := recordType.recordScope.FindMethod(0);
  13359. IF ~procedure.isFinalizer THEN
  13360. Global.GetSymbolSegmentedName(procedure, name);
  13361. NamedSymbol(source, name,procedure, 0,0);
  13362. END;
  13363. start := 1;
  13364. END;
  13365. IF (name # stackFrame) & recordType.isObject THEN
  13366. baseRecord := recordType;
  13367. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  13368. baseRecord := baseRecord.GetBaseRecord ();
  13369. END;
  13370. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  13371. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  13372. ELSE
  13373. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  13374. END;
  13375. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13376. Symbol(source, tir, 0, 0);
  13377. END;
  13378. methods := recordType.recordScope.numberMethods;
  13379. FOR i := start TO methods-1 DO
  13380. procedure := recordType.recordScope.FindMethod(i);
  13381. IF ~procedure.isFinalizer THEN
  13382. Global.GetSymbolSegmentedName(procedure, name);
  13383. NamedSymbol(source, name,procedure, 0,0);
  13384. END;
  13385. END;
  13386. END CooperativeMethodTable;
  13387. BEGIN
  13388. Global.GetSymbolSegmentedName(td,name);
  13389. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  13390. source.SetExported(IsExported(td));
  13391. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  13392. IF implementationVisitor.backend.cooperative THEN
  13393. base := NIL;
  13394. baseRecord := recordType.GetBaseRecord();
  13395. IF baseRecord # NIL THEN
  13396. baseTD := baseRecord.typeDeclaration;
  13397. END;
  13398. IF ~recordType.isObject THEN
  13399. Info(source, "parent");
  13400. IF baseRecord # NIL THEN
  13401. Global.GetSymbolSegmentedName(baseTD,name);
  13402. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13403. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13404. ELSE
  13405. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13406. END;
  13407. Symbol(source, tir, 0, 0);
  13408. ELSE
  13409. Address(source,0);
  13410. END;
  13411. Info(source, "record size");
  13412. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13413. CooperativeMethodTable(FALSE);
  13414. base := source;
  13415. Global.GetSymbolSegmentedName(td,name);
  13416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13417. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13418. source.SetExported(IsExported(td));
  13419. END;
  13420. Info(source, "parent");
  13421. IF baseRecord # NIL THEN
  13422. Global.GetSymbolSegmentedName(baseTD,name);
  13423. sym := baseTD;
  13424. IF ~recordType.isObject THEN
  13425. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13426. sym := NIL;
  13427. END;
  13428. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13429. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13430. tir.SetExported(IsExported(td));
  13431. ELSE
  13432. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13433. END;
  13434. Symbol(source, tir, 0, 0);
  13435. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  13436. Address(source,0);
  13437. ELSE
  13438. IF recordType.isObject THEN
  13439. Basic.ToSegmentedName ("BaseTypes.Object",name);
  13440. ELSE
  13441. Basic.ToSegmentedName ("BaseTypes.Record",name);
  13442. END;
  13443. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13444. Symbol(source, tir, 0, 0);
  13445. END;
  13446. Info(source, "base record descriptor");
  13447. Symbol(source, base, 0, 0);
  13448. CooperativeMethodTable(TRUE);
  13449. IF recordType.hasPointers THEN
  13450. IF ~HasExplicitTraceMethod (recordType) THEN
  13451. implementationVisitor.CreateTraceMethod(recordType);
  13452. END;
  13453. implementationVisitor.CreateResetProcedure(recordType);
  13454. implementationVisitor.CreateAssignProcedure(recordType);
  13455. END;
  13456. ELSIF ~simple THEN
  13457. (*
  13458. MethodEnd = MPO
  13459. ---
  13460. methods (# methods)
  13461. ---
  13462. tags (16)
  13463. ---
  13464. TypeDesc = TypeInfoAdr
  13465. ---
  13466. td adr ---> rec size
  13467. ----
  13468. pointer offsets
  13469. ----
  13470. (padding)
  13471. -----
  13472. empty [2 addresses aligned]
  13473. empty
  13474. empty
  13475. numPtrs
  13476. ---
  13477. pointer offsets
  13478. ---
  13479. *)
  13480. Info(source, "MethodEnd = MPO");
  13481. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  13482. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  13483. MethodTable(TRUE);
  13484. TdTable(TypeTags, TRUE);
  13485. Info(source, "type descriptor info pointer");
  13486. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  13487. Symbol(source, tdInfo,EmptyBlockOffset,0);
  13488. IF (cellType # NIL) THEN
  13489. IF cellType.sizeInBits < 0 THEN
  13490. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  13491. END;
  13492. Info(source, "cell size");
  13493. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  13494. ELSE
  13495. Info(source, "record size");
  13496. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13497. END;
  13498. Info(source, "pointer offsets pointer");
  13499. padding := 1- source.pc MOD 2;
  13500. Symbol(source, source, source.pc+1+padding,0);
  13501. IF padding >0 THEN
  13502. Info(source, "padding");
  13503. FOR i := 1 TO padding DO Address(source,0) END;
  13504. END;
  13505. IF cellType # NIL THEN
  13506. PointerArray(source, cellType.cellScope, numberPointers);
  13507. ELSE
  13508. PointerArray(source, recordType.recordScope, numberPointers);
  13509. END;
  13510. ELSE
  13511. (*
  13512. simple:
  13513. td adr --> size
  13514. tag(1)
  13515. tag(2)
  13516. tag(3)
  13517. methods ->
  13518. *)
  13519. Info(source, "record size");
  13520. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13521. TdTable(TypeTags, FALSE);
  13522. MethodTable(FALSE);
  13523. END;
  13524. END NewTypeDescriptor;
  13525. BEGIN
  13526. x := x.resolved;
  13527. IF (x IS SyntaxTree.PointerType) THEN
  13528. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  13529. END;
  13530. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  13531. recordType := x(SyntaxTree.RecordType);
  13532. td := x.typeDeclaration;
  13533. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13534. ASSERT(td # NIL);
  13535. section := module.allSections.FindBySymbol(td); (* TODO *)
  13536. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13537. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13538. NewTypeDescriptor
  13539. END;
  13540. END;
  13541. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  13542. cellType := x(SyntaxTree.CellType);
  13543. td := x.typeDeclaration;
  13544. section := module.allSections.FindBySymbol(td); (* TODO *)
  13545. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13546. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13547. NewTypeDescriptor
  13548. END;
  13549. END;
  13550. END
  13551. END CheckTypeDeclaration
  13552. END MetaDataGenerator;
  13553. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  13554. VAR
  13555. trace-: BOOLEAN;
  13556. traceString-: SyntaxTree.IdentifierString;
  13557. traceModuleName-: SyntaxTree.IdentifierString;
  13558. profile-: BOOLEAN;
  13559. noRuntimeChecks: BOOLEAN;
  13560. simpleMetaData-: BOOLEAN;
  13561. noAsserts: BOOLEAN;
  13562. optimize-: BOOLEAN;
  13563. cooperative-: BOOLEAN;
  13564. preregisterStatic-: BOOLEAN;
  13565. dump-: Basic.Writer;
  13566. cellsAreObjects: BOOLEAN;
  13567. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  13568. experiment: BOOLEAN;
  13569. PROCEDURE &InitIntermediateBackend*;
  13570. BEGIN
  13571. simpleMetaData := FALSE;
  13572. InitBackend;
  13573. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  13574. SetTraceModuleName(DefaultTraceModuleName);
  13575. END InitIntermediateBackend;
  13576. (* must be overwritten by actual backend, if parameter registers should be used *)
  13577. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  13578. BEGIN
  13579. register := -1;
  13580. RETURN FALSE;
  13581. END GetParameterRegister;
  13582. PROCEDURE ResetParameterRegisters*;
  13583. BEGIN
  13584. END ResetParameterRegisters;
  13585. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  13586. VAR
  13587. declarationVisitor: DeclarationVisitor;
  13588. implementationVisitor: ImplementationVisitor;
  13589. module: Sections.Module;
  13590. name, platformName: SyntaxTree.IdentifierString;
  13591. meta: MetaDataGenerator;
  13592. crc: CRC.CRC32Stream;
  13593. BEGIN
  13594. ResetError;
  13595. Global.GetSymbolName(x,name);
  13596. NEW(module,x,system); (* backend structures *)
  13597. Global.GetModuleName(x, name);
  13598. module.SetModuleName(name);
  13599. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  13600. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  13601. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  13602. declarationVisitor.Module(x,module);
  13603. IF ~meta.simple THEN
  13604. meta.Module(implementationVisitor.moduleBodySection);
  13605. END;
  13606. GetDescription(platformName);
  13607. module.SetPlatformName(platformName);
  13608. NEW(crc);
  13609. module.allSections.WriteRaw(crc);
  13610. crc.Update;
  13611. meta.PatchCRC(crc.GetCRC());
  13612. RETURN module
  13613. END GenerateIntermediate;
  13614. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  13615. BEGIN RETURN TRUE
  13616. END SupportedImmediate;
  13617. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  13618. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  13619. END ProcessSyntaxTreeModule;
  13620. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  13621. VAR
  13622. result: Sections.Module;
  13623. traceName: Basic.MessageString;
  13624. BEGIN
  13625. ASSERT(intermediateCodeModule IS Sections.Module);
  13626. result := intermediateCodeModule(Sections.Module);
  13627. IF trace THEN
  13628. traceName := "intermediate code trace: ";
  13629. Strings.Append(traceName,traceString);
  13630. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  13631. IF (traceString="") OR (traceString="*") THEN
  13632. result.Dump(dump);
  13633. dump.Update
  13634. ELSE
  13635. Sections.DumpFiltered(dump, result, traceString);
  13636. END
  13637. END;
  13638. RETURN result
  13639. END ProcessIntermediateCodeModule;
  13640. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  13641. BEGIN instructionSet := "Intermediate";
  13642. END GetDescription;
  13643. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  13644. BEGIN
  13645. SELF.simpleMetaData := simpleMetaData;
  13646. END SetSimpleMetaData;
  13647. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  13648. BEGIN COPY(name, traceModuleName)
  13649. END SetTraceModuleName;
  13650. PROCEDURE DefineOptions*(options: Options.Options);
  13651. BEGIN
  13652. DefineOptions^(options);
  13653. options.Add(0X,"trace",Options.String);
  13654. options.Add(0X,"builtinsModule",Options.String);
  13655. options.Add(0X,"traceModule",Options.String);
  13656. options.Add(0X,"profile",Options.Flag);
  13657. options.Add(0X,"noRuntimeChecks",Options.Flag);
  13658. options.Add(0X,"noAsserts",Options.Flag);
  13659. options.Add(0X,"metaData",Options.String);
  13660. options.Add('o',"optimize", Options.Flag);
  13661. options.Add(0X,"preregisterStatic", Options.Flag);
  13662. options.Add(0X,"cellsAreObjects", Options.Flag);
  13663. options.Add(0X,"preciseGC", Options.Flag);
  13664. options.Add(0X,"trackLeave", Options.Flag);
  13665. options.Add(0X,"writeBarriers", Options.Flag);
  13666. options.Add(0X,"experiment", Options.Flag);
  13667. END DefineOptions;
  13668. PROCEDURE GetOptions*(options: Options.Options);
  13669. VAR name,string: SyntaxTree.IdentifierString;
  13670. BEGIN
  13671. GetOptions^(options);
  13672. trace := options.GetString("trace",traceString);
  13673. profile := options.GetFlag("profile");
  13674. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  13675. noAsserts := options.GetFlag("noAsserts");
  13676. cooperative := options.GetFlag("cooperative");
  13677. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  13678. simpleMetaData := TRUE
  13679. END;
  13680. IF options.GetString("metaData",string) THEN
  13681. IF string = "simple" THEN simpleMetaData := TRUE
  13682. ELSIF string ="full" THEN simpleMetaData := FALSE
  13683. END;
  13684. END;
  13685. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  13686. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  13687. optimize := options.GetFlag("optimize");
  13688. preregisterStatic := options.GetFlag("preregisterStatic");
  13689. cellsAreObjects := options.GetFlag("cellsAreObjects");
  13690. preciseGC := options.GetFlag("preciseGC");
  13691. trackLeave := options.GetFlag("trackLeave");
  13692. writeBarriers := options.GetFlag("writeBarriers");
  13693. experiment := options.GetFlag("experiment");
  13694. IF simpleMetaData THEN preciseGC := FALSE END;
  13695. END GetOptions;
  13696. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  13697. BEGIN RETURN SymbolFileFormat.Get()
  13698. END DefaultSymbolFileFormat;
  13699. END IntermediateBackend;
  13700. (* ----------------------------------- register allocation ------------------------------------- *)
  13701. (* register mapping scheme
  13702. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  13703. spill offset
  13704. part(n) --> ticket <--> physical register
  13705. spill offset
  13706. *)
  13707. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  13708. emptyOperand: IntermediateCode.Operand;
  13709. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  13710. statCoopResetVariables: LONGINT;
  13711. statCoopModifyAssignments: LONGINT;
  13712. modifyAssignmentsPC : LONGINT;
  13713. statCoopNilCheck: LONGINT;
  13714. statCoopSwitch: LONGINT;
  13715. statCoopAssignProcedure: LONGINT;
  13716. statCoopTraceMethod: LONGINT;
  13717. statCoopResetProcedure: LONGINT;
  13718. statCoopTraceModule: LONGINT;
  13719. PROCEDURE ResetStatistics*;
  13720. BEGIN
  13721. statCoopResetVariables := 0;
  13722. statCoopModifyAssignments := 0;
  13723. statCoopNilCheck:= 0;
  13724. statCoopSwitch:= 0;
  13725. statCoopAssignProcedure:= 0;
  13726. statCoopTraceMethod:= 0;
  13727. statCoopResetProcedure:= 0;
  13728. statCoopTraceModule:= 0;
  13729. END ResetStatistics;
  13730. PROCEDURE Statistics*;
  13731. BEGIN
  13732. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  13733. TRACE(statCoopNilCheck, statCoopSwitch);
  13734. TRACE(statCoopAssignProcedure,
  13735. statCoopTraceMethod,
  13736. statCoopResetProcedure,
  13737. statCoopTraceModule)
  13738. END Statistics;
  13739. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  13740. VAR h: LONGINT;
  13741. BEGIN
  13742. WHILE b # 0 DO
  13743. h := a MOD b;
  13744. a := b;
  13745. b := h;
  13746. END;
  13747. RETURN a
  13748. END GCD;
  13749. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  13750. BEGIN
  13751. RETURN a*b DIV GCD(a,b)
  13752. END SCM;
  13753. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  13754. BEGIN
  13755. (*TRACE(a,b);*)
  13756. IF a = 0 THEN RETURN b
  13757. ELSIF b = 0 THEN RETURN a
  13758. ELSE RETURN SCM(a,b)
  13759. END;
  13760. END CommonAlignment;
  13761. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13762. BEGIN
  13763. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  13764. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  13765. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13766. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  13767. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13768. END
  13769. END PassBySingleReference;
  13770. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13771. BEGIN
  13772. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  13773. END PassInRegister;
  13774. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  13775. VAR new: RegisterEntry;
  13776. BEGIN
  13777. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  13778. IF queue = NIL THEN
  13779. queue := new
  13780. ELSE
  13781. new.next := queue;
  13782. IF queue#NIL THEN queue.prev := new END;
  13783. queue := new
  13784. END;
  13785. END AddRegisterEntry;
  13786. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  13787. VAR this: RegisterEntry;
  13788. BEGIN
  13789. this := queue;
  13790. WHILE (this # NIL) & (this.register # register) DO
  13791. this := this.next;
  13792. END;
  13793. IF this = NIL THEN
  13794. RETURN FALSE
  13795. END;
  13796. ASSERT(this # NIL);
  13797. IF this = queue THEN queue := queue.next END;
  13798. IF this.prev # NIL THEN this.prev.next := this.next END;
  13799. IF this.next # NIL THEN this.next.prev := this.prev END;
  13800. RETURN TRUE
  13801. END RemoveRegisterEntry;
  13802. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  13803. BEGIN ASSERT(cond);
  13804. END Assert;
  13805. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  13806. BEGIN
  13807. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  13808. END ReusableRegister;
  13809. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  13810. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  13811. BEGIN
  13812. procedure := moduleScope.bodyProcedure;
  13813. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  13814. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  13815. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  13816. procedure.SetScope(moduleScope);
  13817. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  13818. procedure.SetAccess(SyntaxTree.Hidden);
  13819. moduleScope.SetBodyProcedure(procedure);
  13820. moduleScope.AddProcedure(procedure);
  13821. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  13822. END;
  13823. END EnsureBodyProcedure;
  13824. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  13825. VAR import: SyntaxTree.Import;
  13826. selfName: SyntaxTree.IdentifierString;
  13827. module: SyntaxTree.Module;
  13828. BEGIN
  13829. scope.ownerModule.GetName(selfName);
  13830. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  13831. module := scope.ownerModule
  13832. ELSE
  13833. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  13834. IF import = NIL THEN
  13835. RETURN NIL
  13836. ELSIF import.module = NIL THEN
  13837. RETURN NIL
  13838. ELSE module := import.module
  13839. END;
  13840. END;
  13841. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  13842. END GetSymbol;
  13843. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  13844. BEGIN
  13845. op.mode := mode;
  13846. IntermediateCode.InitOperand(op.op);
  13847. IntermediateCode.InitOperand(op.tag);
  13848. IntermediateCode.InitOperand(op.extra);
  13849. op.dimOffset := 0;
  13850. op.availability := -1;
  13851. END InitOperand;
  13852. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  13853. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  13854. BEGIN RETURN IntermediateCode.GetType(system, type)
  13855. END GetType;
  13856. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  13857. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  13858. BEGIN
  13859. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13860. (*
  13861. UniqueId(name,module,name,adr);
  13862. *)
  13863. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13864. constant.SetValue(value);
  13865. constant.SetAccess(SyntaxTree.Hidden);
  13866. module.moduleScope.AddConstant(constant);
  13867. constant.SetScope(module.moduleScope);
  13868. RETURN constant
  13869. END BuildConstant;
  13870. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13871. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13872. BEGIN
  13873. variable := scope.firstVariable;
  13874. WHILE variable # NIL DO
  13875. IF variable.NeedsTrace() THEN
  13876. RETURN TRUE;
  13877. END;
  13878. variable := variable.nextVariable;
  13879. END;
  13880. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13881. WHILE parameter # NIL DO
  13882. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13883. RETURN TRUE;
  13884. END;
  13885. parameter := parameter.nextParameter;
  13886. END;
  13887. RETURN FALSE;
  13888. END HasPointers;
  13889. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13890. 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));
  13891. END IsVariableParameter;
  13892. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13893. VAR parameter: SyntaxTree.Parameter;
  13894. BEGIN
  13895. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13896. WHILE parameter # NIL DO
  13897. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13898. IF parameter.movable THEN RETURN TRUE END;
  13899. parameter := parameter.nextParameter;
  13900. END;
  13901. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13902. END HasVariableParameters;
  13903. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13904. BEGIN
  13905. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13906. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13907. END HasExplicitTraceMethod;
  13908. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13909. BEGIN
  13910. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13911. IF (expression IS SyntaxTree.IntegerValue) THEN
  13912. val := expression(SyntaxTree.IntegerValue).value;
  13913. RETURN TRUE
  13914. ELSE
  13915. RETURN FALSE
  13916. END;
  13917. END IsIntegerConstant;
  13918. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13919. BEGIN
  13920. IF val <= 0 THEN RETURN FALSE END;
  13921. exp := 0;
  13922. WHILE ~ODD(val) DO
  13923. val := val DIV 2;
  13924. INC(exp)
  13925. END;
  13926. RETURN val = 1
  13927. END PowerOf2;
  13928. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13929. VAR procedure: SyntaxTree.Procedure;
  13930. BEGIN
  13931. procedure := record.recordScope.constructor;
  13932. IF procedure = NIL THEN
  13933. record := record.GetBaseRecord();
  13934. IF record # NIL THEN
  13935. procedure := GetConstructor(record)
  13936. END;
  13937. END;
  13938. RETURN procedure;
  13939. END GetConstructor;
  13940. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13941. BEGIN
  13942. value := SHORT(op.intValue);
  13943. RETURN op.mode = IntermediateCode.ModeImmediate;
  13944. END IsIntegerImmediate;
  13945. (** whether a type strictily is a pointer to record or object type
  13946. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13947. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13948. BEGIN
  13949. IF type = NIL THEN
  13950. RETURN FALSE
  13951. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13952. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13953. ELSE
  13954. RETURN FALSE
  13955. END
  13956. END IsStrictlyPointerToRecord;
  13957. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13958. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13959. END IsUnsafePointer;
  13960. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13961. BEGIN type := type.resolved;
  13962. IF type IS SyntaxTree.PointerType THEN
  13963. type := type(SyntaxTree.PointerType).pointerBase;
  13964. type := type.resolved;
  13965. IF type IS SyntaxTree.RecordType THEN
  13966. recordType := type(SyntaxTree.RecordType);
  13967. RETURN TRUE
  13968. ELSE
  13969. RETURN FALSE
  13970. END
  13971. ELSIF type IS SyntaxTree.RecordType THEN
  13972. recordType := type(SyntaxTree.RecordType);
  13973. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13974. ELSIF type IS SyntaxTree.ObjectType THEN
  13975. RETURN TRUE
  13976. ELSIF type IS SyntaxTree.AnyType THEN
  13977. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13978. ELSE
  13979. RETURN FALSE
  13980. END;
  13981. END IsPointerToRecord;
  13982. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13983. BEGIN
  13984. type := type.resolved;
  13985. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13986. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13987. END IsArrayOfSystemByte;
  13988. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13989. BEGIN
  13990. IF type = NIL THEN RETURN FALSE END;
  13991. type := type.resolved;
  13992. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13993. END IsOpenArray;
  13994. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13995. BEGIN
  13996. IF type = NIL THEN RETURN FALSE END;
  13997. type := type.resolved;
  13998. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13999. END IsSemiDynamicArray;
  14000. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  14001. BEGIN
  14002. IF type = NIL THEN RETURN FALSE END;
  14003. type := type.resolved;
  14004. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  14005. END IsStaticArray;
  14006. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  14007. BEGIN
  14008. IF type = NIL THEN RETURN FALSE END;
  14009. type := type.resolved;
  14010. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  14011. END IsStaticMathArray;
  14012. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14013. BEGIN
  14014. WHILE (IsStaticMathArray(type)) DO
  14015. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14016. END;
  14017. RETURN type;
  14018. END StaticMathArrayBaseType;
  14019. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14020. VAR size: LONGINT;
  14021. BEGIN
  14022. size := 1;
  14023. WHILE (IsStaticArray(type)) DO
  14024. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  14025. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14026. END;
  14027. RETURN size;
  14028. END StaticArrayNumElements;
  14029. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14030. VAR size: LONGINT;
  14031. BEGIN
  14032. size := 1;
  14033. WHILE (IsStaticMathArray(type)) DO
  14034. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  14035. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14036. END;
  14037. RETURN size;
  14038. END StaticMathArrayNumElements;
  14039. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14040. BEGIN
  14041. WHILE (IsStaticArray(type)) DO
  14042. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14043. END;
  14044. RETURN type;
  14045. END StaticArrayBaseType;
  14046. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14047. BEGIN
  14048. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  14049. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14050. END;
  14051. RETURN type;
  14052. END ArrayBaseType;
  14053. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  14054. BEGIN
  14055. IF type = NIL THEN RETURN FALSE END;
  14056. type := type.resolved;
  14057. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  14058. END IsDelegate;
  14059. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  14060. VAR i: LONGINT;
  14061. BEGIN
  14062. i := 0; type := type.resolved;
  14063. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14064. INC(i);
  14065. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  14066. END;
  14067. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14068. INC(i);
  14069. type := type(SyntaxTree.MathArrayType).arrayBase;
  14070. IF type # NIL THEN type := type.resolved END;
  14071. END;
  14072. RETURN i
  14073. END DynamicDim;
  14074. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  14075. BEGIN
  14076. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14077. type := type(SyntaxTree.ArrayType).arrayBase;
  14078. END;
  14079. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14080. type := type(SyntaxTree.MathArrayType).arrayBase;
  14081. END;
  14082. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  14083. END StaticSize;
  14084. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  14085. BEGIN
  14086. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  14087. END IsImmediate;
  14088. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  14089. BEGIN
  14090. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  14091. END IsAddress;
  14092. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  14093. BEGIN
  14094. RETURN (x.mode = IntermediateCode.ModeRegister);
  14095. END IsRegister;
  14096. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  14097. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  14098. BEGIN
  14099. typeDeclaration := recordType.typeDeclaration;
  14100. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  14101. Global.GetSymbolSegmentedName(typeDeclaration,name);
  14102. END GetRecordTypeName;
  14103. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  14104. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  14105. BEGIN
  14106. parSize := 0;
  14107. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  14108. parameter := procedureType.returnParameter;
  14109. INC(parSize,system.SizeOfParameter(parameter));
  14110. parSize := parSize + (-parSize) MOD system.addressSize;
  14111. END;
  14112. parameter :=procedureType.lastParameter;
  14113. WHILE (parameter # NIL) DO
  14114. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  14115. INC(parSize, system.addressSize);
  14116. ELSE
  14117. INC(parSize,system.SizeOfParameter(parameter));
  14118. parSize := parSize + (-parSize) MOD system.addressSize;
  14119. END;
  14120. parameter := parameter.prevParameter;
  14121. END;
  14122. IF procedureType.selfParameter # NIL THEN
  14123. parameter := procedureType.selfParameter;
  14124. INC(parSize,system.SizeOfParameter(parameter));
  14125. parSize := parSize + (-parSize) MOD system.addressSize;
  14126. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  14127. END; (* method => self pointer *)
  14128. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  14129. RETURN ToMemoryUnits(system,parSize)
  14130. END ParametersSize;
  14131. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  14132. BEGIN
  14133. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  14134. END IsNested;
  14135. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  14136. BEGIN
  14137. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  14138. scope := scope.outerScope;
  14139. END;
  14140. RETURN scope # NIL;
  14141. END InCellScope;
  14142. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  14143. BEGIN
  14144. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  14145. END ProcedureParametersSize;
  14146. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  14147. VAR dataUnit: LONGINT;
  14148. BEGIN dataUnit := system.dataUnit;
  14149. ASSERT(size MOD system.dataUnit = 0);
  14150. RETURN LONGINT(size DIV system.dataUnit)
  14151. END ToMemoryUnits;
  14152. PROCEDURE Get*(): Backend.Backend;
  14153. VAR backend: IntermediateBackend;
  14154. BEGIN NEW(backend); RETURN backend
  14155. END Get;
  14156. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  14157. VAR instruction: IntermediateCode.Instruction;
  14158. BEGIN
  14159. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  14160. RETURN instruction
  14161. END Nop;
  14162. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14163. VAR instruction: IntermediateCode.Instruction;
  14164. BEGIN
  14165. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  14166. RETURN instruction
  14167. END Mov;
  14168. (* like Mov but ensures that no new register will be allocated for dest *)
  14169. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14170. VAR instruction: IntermediateCode.Instruction;
  14171. BEGIN
  14172. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  14173. RETURN instruction
  14174. END MovReplace;
  14175. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14176. VAR instruction: IntermediateCode.Instruction;
  14177. BEGIN
  14178. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  14179. RETURN instruction
  14180. END Conv;
  14181. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  14182. VAR instruction: IntermediateCode.Instruction;
  14183. BEGIN
  14184. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  14185. RETURN instruction
  14186. END Call;
  14187. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  14188. VAR op1, op2, op3: IntermediateCode.Operand;
  14189. VAR instruction: IntermediateCode.Instruction;
  14190. BEGIN
  14191. IntermediateCode.InitNumber(op1,pcOffset);
  14192. IntermediateCode.InitNumber(op2,callingConvention);
  14193. IntermediateCode.InitNumber(op3,unwind);
  14194. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  14195. RETURN instruction
  14196. END Exit;
  14197. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14198. VAR instruction: IntermediateCode.Instruction;
  14199. BEGIN
  14200. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  14201. RETURN instruction
  14202. END Return;
  14203. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14204. VAR instruction: IntermediateCode.Instruction;
  14205. BEGIN
  14206. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  14207. RETURN instruction
  14208. END Result;
  14209. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  14210. VAR op1: IntermediateCode.Operand;
  14211. VAR instruction: IntermediateCode.Instruction;
  14212. BEGIN
  14213. IntermediateCode.InitNumber(op1,nr);
  14214. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  14215. RETURN instruction
  14216. END Trap;
  14217. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  14218. VAR instruction: IntermediateCode.Instruction;
  14219. BEGIN
  14220. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  14221. RETURN instruction
  14222. END Br;
  14223. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14224. VAR instruction: IntermediateCode.Instruction;
  14225. BEGIN
  14226. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  14227. RETURN instruction
  14228. END Breq;
  14229. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14230. VAR instruction: IntermediateCode.Instruction;
  14231. BEGIN
  14232. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  14233. RETURN instruction
  14234. END Brne;
  14235. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14236. VAR instruction: IntermediateCode.Instruction;
  14237. BEGIN
  14238. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  14239. RETURN instruction
  14240. END Brge;
  14241. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14242. VAR instruction: IntermediateCode.Instruction;
  14243. BEGIN
  14244. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  14245. RETURN instruction
  14246. END Brlt;
  14247. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  14248. VAR instruction: IntermediateCode.Instruction;
  14249. BEGIN
  14250. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  14251. RETURN instruction
  14252. END Pop;
  14253. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14254. VAR instruction: IntermediateCode.Instruction;
  14255. BEGIN
  14256. ASSERT(op.mode # IntermediateCode.Undefined);
  14257. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  14258. RETURN instruction
  14259. END Push;
  14260. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14261. VAR instruction: IntermediateCode.Instruction;
  14262. BEGIN
  14263. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  14264. RETURN instruction
  14265. END Neg;
  14266. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14267. VAR instruction: IntermediateCode.Instruction;
  14268. BEGIN
  14269. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  14270. RETURN instruction
  14271. END Not;
  14272. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14273. VAR instruction: IntermediateCode.Instruction;
  14274. BEGIN
  14275. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  14276. RETURN instruction
  14277. END Abs;
  14278. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14279. VAR instruction: IntermediateCode.Instruction;
  14280. BEGIN
  14281. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  14282. ASSERT(~IsImmediate(instruction.op1));
  14283. RETURN instruction
  14284. END Mul;
  14285. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14286. VAR instruction: IntermediateCode.Instruction;
  14287. BEGIN
  14288. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  14289. RETURN instruction
  14290. END Div;
  14291. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14292. VAR instruction: IntermediateCode.Instruction;
  14293. BEGIN
  14294. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  14295. RETURN instruction
  14296. END Mod;
  14297. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14298. VAR instruction: IntermediateCode.Instruction;
  14299. BEGIN
  14300. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  14301. RETURN instruction
  14302. END Sub;
  14303. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14304. VAR instruction: IntermediateCode.Instruction;
  14305. BEGIN
  14306. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  14307. RETURN instruction
  14308. END Add;
  14309. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14310. VAR instruction: IntermediateCode.Instruction;
  14311. BEGIN
  14312. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  14313. RETURN instruction
  14314. END And;
  14315. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14316. VAR instruction: IntermediateCode.Instruction;
  14317. BEGIN
  14318. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  14319. RETURN instruction
  14320. END Or;
  14321. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14322. VAR instruction: IntermediateCode.Instruction;
  14323. BEGIN
  14324. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  14325. RETURN instruction
  14326. END Xor;
  14327. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14328. VAR instruction: IntermediateCode.Instruction;
  14329. BEGIN
  14330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  14331. RETURN instruction
  14332. END Shl;
  14333. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14334. VAR instruction: IntermediateCode.Instruction;
  14335. BEGIN
  14336. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  14337. RETURN instruction
  14338. END Shr;
  14339. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14340. VAR instruction: IntermediateCode.Instruction;
  14341. BEGIN
  14342. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  14343. RETURN instruction
  14344. END Rol;
  14345. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14346. VAR instruction: IntermediateCode.Instruction;
  14347. BEGIN
  14348. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  14349. RETURN instruction
  14350. END Ror;
  14351. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14352. VAR instruction: IntermediateCode.Instruction;
  14353. BEGIN
  14354. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  14355. RETURN instruction
  14356. END Cas;
  14357. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14358. VAR instruction: IntermediateCode.Instruction;
  14359. BEGIN
  14360. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  14361. ASSERT(~IntermediateCode.IsVectorRegister(src));
  14362. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  14363. RETURN instruction
  14364. END Copy;
  14365. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  14366. VAR instruction: IntermediateCode.Instruction;
  14367. BEGIN
  14368. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  14369. RETURN instruction
  14370. END Fill;
  14371. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  14372. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  14373. BEGIN
  14374. string := IntermediateCode.String(s);
  14375. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  14376. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  14377. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  14378. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  14379. RETURN instruction
  14380. END Asm;
  14381. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14382. VAR instruction: IntermediateCode.Instruction;
  14383. BEGIN
  14384. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  14385. RETURN instruction
  14386. END Data;
  14387. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  14388. VAR instruction: IntermediateCode.Instruction;
  14389. BEGIN
  14390. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  14391. IntermediateCode.SetSubType(instruction, subtype);
  14392. RETURN instruction
  14393. END SpecialInstruction;
  14394. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  14395. VAR op1: IntermediateCode.Operand;
  14396. VAR instruction: IntermediateCode.Instruction;
  14397. BEGIN
  14398. (*! generate a warning if size exceeds a certain limit *)
  14399. (*
  14400. ASSERT(bytes < 1000000); (* sanity check *)
  14401. *)
  14402. ASSERT(0 <= units); (* sanity check *)
  14403. IntermediateCode.InitNumber(op1,units);
  14404. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  14405. RETURN instruction
  14406. END Reserve;
  14407. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  14408. VAR op1: IntermediateCode.Operand;
  14409. VAR instruction: IntermediateCode.Instruction;
  14410. BEGIN
  14411. IntermediateCode.InitNumber(op1,position.start);
  14412. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  14413. RETURN instruction
  14414. END LabelInstruction;
  14415. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  14416. VAR pc: LONGINT;
  14417. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  14418. BEGIN
  14419. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  14420. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  14421. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  14422. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  14423. IF instr.op1.type.form = IntermediateCode.Float THEN
  14424. RETURN instr.op1.floatValue = op.floatValue
  14425. ELSE
  14426. RETURN instr.op1.intValue = op.intValue
  14427. END;
  14428. END ProvidesValue;
  14429. BEGIN
  14430. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  14431. pc := 0;
  14432. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  14433. INC(pc);
  14434. END;
  14435. IF pc = data.pc THEN
  14436. data.Emit(Data(Basic.invalidPosition,vop));
  14437. END;
  14438. RETURN pc
  14439. END EnterImmediate;
  14440. PROCEDURE Init;
  14441. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  14442. BEGIN
  14443. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  14444. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  14445. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  14446. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  14447. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  14448. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  14449. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  14450. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  14451. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  14452. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  14453. IntermediateCode.InitOperand(emptyOperand);
  14454. FOR i := 0 TO NumberSystemCalls-1 DO
  14455. name := "@SystemCall";
  14456. Basic.AppendNumber(name,i);
  14457. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  14458. END;
  14459. END Init;
  14460. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  14461. BEGIN
  14462. RETURN (symbol # NIL) & symbol.NeedsSection();
  14463. END IsExported;
  14464. BEGIN
  14465. Init;
  14466. END FoxIntermediateBackend.
  14467. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  14468. # Release.Build --path="/temp/obg/" Win32 ~
  14469. # 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 ~
  14470. FStols.CloseFiles A2Z.exe ~
  14471. System.FreeDownTo FoxIntermediateBackend ~
  14472. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  14473. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  14474. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  14475. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  14476. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  14477. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  14478. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  14479. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  14480. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  14481. GenericLinker.Mod Loader.Mod BootConsole.Mod