FoxIntermediateBackend.Mod 580 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686146871468814689146901469114692146931469414695146961469714698146991470014701147021470314704147051470614707147081470914710147111471214713147141471514716147171471814719147201472114722147231472414725147261472714728147291473014731147321473314734147351473614737147381473914740147411474214743147441474514746147471474814749147501475114752147531475414755147561475714758147591476014761147621476314764147651476614767147681476914770147711477214773147741477514776147771477814779147801478114782147831478414785147861478714788147891479014791147921479314794147951479614797147981479914800148011480214803148041480514806148071480814809148101481114812148131481414815148161481714818148191482014821148221482314824148251482614827148281482914830148311483214833148341483514836148371483814839148401484114842148431484414845148461484714848148491485014851148521485314854148551485614857148581485914860148611486214863148641486514866148671486814869148701487114872
  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. Operand = RECORD
  98. mode: SHORTINT;
  99. op: IntermediateCode.Operand;
  100. tag: IntermediateCode.Operand;
  101. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  102. dimOffset: LONGINT;
  103. END;
  104. Fixup= POINTER TO RECORD
  105. pc: LONGINT;
  106. nextFixup: Fixup;
  107. END;
  108. WriteBackCall = POINTER TO RECORD
  109. call: SyntaxTree.ProcedureCallDesignator;
  110. next: WriteBackCall;
  111. END;
  112. Label= OBJECT
  113. VAR
  114. fixups: Fixup;
  115. section: IntermediateCode.Section;
  116. pc: LONGINT;
  117. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  118. BEGIN
  119. SELF.section := section; pc := -1;
  120. END InitLabel;
  121. PROCEDURE Resolve(pc: LONGINT);
  122. VAR at: LONGINT;
  123. BEGIN
  124. SELF.pc := pc;
  125. WHILE(fixups # NIL) DO
  126. at := fixups.pc;
  127. section.PatchAddress(at,pc);
  128. fixups := fixups.nextFixup;
  129. END;
  130. END Resolve;
  131. PROCEDURE AddFixup(at: LONGINT);
  132. VAR fixup: Fixup;
  133. BEGIN
  134. ASSERT(pc=-1);
  135. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  136. END AddFixup;
  137. END Label;
  138. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  139. DeclarationVisitor =OBJECT
  140. VAR
  141. backend: IntermediateBackend;
  142. implementationVisitor: ImplementationVisitor;
  143. meta: MetaDataGenerator;
  144. system: Global.System;
  145. currentScope: SyntaxTree.Scope;
  146. module: Sections.Module;
  147. moduleSelf: SyntaxTree.Variable;
  148. dump: BOOLEAN;
  149. forceModuleBody: BOOLEAN;
  150. addressType: IntermediateCode.Type;
  151. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  152. BEGIN
  153. currentScope := NIL; module := NIL; moduleSelf := NIL;
  154. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  155. SELF.dump := dump;
  156. SELF.backend := backend;
  157. SELF.forceModuleBody := forceModuleBody;
  158. addressType := IntermediateCode.GetType(system,system.addressType)
  159. END Init;
  160. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  161. BEGIN
  162. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  163. END Error;
  164. (** types **)
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. WITH x:
  168. SyntaxTree.QualifiedType DO QualifiedType(x)
  169. |SyntaxTree.MathArrayType DO meta.CheckTypeDeclaration(x)
  170. |SyntaxTree.PointerType DO meta.CheckTypeDeclaration(x) (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  171. |SyntaxTree.RecordType DO RecordType(x)
  172. |SyntaxTree.CellType DO CellType(x)
  173. ELSE
  174. END;
  175. END Type;
  176. PROCEDURE QualifiedType(x: SyntaxTree.QualifiedType);
  177. VAR type: SyntaxTree.Type;
  178. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  179. type := x.resolved;
  180. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  181. meta.CheckTypeDeclaration(type);
  182. END;
  183. END QualifiedType;
  184. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  185. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  186. BEGIN
  187. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  188. WHILE (this # NIL) & (this.identifier# id) DO
  189. this := this.nextModifier;
  190. END;
  191. RETURN this # NIL
  192. END HasFlag;
  193. PROCEDURE RecordType(x: SyntaxTree.RecordType);
  194. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  195. BEGIN (* no code emission *)
  196. meta.CheckTypeDeclaration(x);
  197. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  198. IF x.pointerType.typeDeclaration # NIL THEN
  199. td := x.pointerType.typeDeclaration
  200. ELSE
  201. td := x.typeDeclaration
  202. END;
  203. Global.GetSymbolName(td,name);
  204. (* code section for object *)
  205. END;
  206. Scope(x.recordScope);
  207. END RecordType;
  208. PROCEDURE CellType(x: SyntaxTree.CellType);
  209. VAR capabilities: SET;
  210. BEGIN
  211. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  212. capabilities := {};
  213. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  214. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  215. backend.SetCapabilities(capabilities);
  216. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  217. Scope(x.cellScope);
  218. END;
  219. END CellType;
  220. (* symbols *)
  221. PROCEDURE Variable(x: SyntaxTree.Variable);
  222. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  223. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  224. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  225. BEGIN
  226. type := type.resolved;
  227. IF type IS SyntaxTree.RecordType THEN
  228. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  229. ELSIF (type IS SyntaxTree.ArrayType) THEN
  230. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  231. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  232. END;
  233. ELSIF type IS SyntaxTree.MathArrayType THEN
  234. WITH type: SyntaxTree.MathArrayType DO
  235. IF type.form = SyntaxTree.Open THEN
  236. RETURN TRUE
  237. ELSIF type.form = SyntaxTree.Static THEN
  238. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  239. END;
  240. END;
  241. END;
  242. RETURN FALSE
  243. END TypeNeedsInitialization;
  244. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  245. VAR variable: SyntaxTree.Variable;
  246. BEGIN
  247. variable := scope.firstVariable;
  248. WHILE variable # NIL DO
  249. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  250. IF variable.initializer # NIL THEN RETURN TRUE END;
  251. variable := variable.nextVariable;
  252. END;
  253. RETURN FALSE
  254. END ScopeNeedsInitialization;
  255. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  256. VAR size: LONGINT;
  257. BEGIN
  258. size := offset - lastUpdated;
  259. IF size > 0 THEN
  260. irv.Emit(Reserve(x.position,size));
  261. END;
  262. irv.Emit(Data(x.position, op));
  263. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  264. END SingleInitialize;
  265. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  266. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  267. BEGIN
  268. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  269. WITH type:
  270. SyntaxTree.RecordType DO
  271. baseType := type.baseType;
  272. IF baseType # NIL THEN
  273. baseType := baseType.resolved;
  274. IF baseType IS SyntaxTree.PointerType THEN
  275. baseType := baseType(SyntaxTree.PointerType).pointerBase
  276. END;
  277. Initialize(baseType,NIL, offset);
  278. END;
  279. variable := type.recordScope.firstVariable;
  280. WHILE variable # NIL DO
  281. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  282. variable := variable.nextVariable
  283. END;
  284. | SyntaxTree.ArrayType DO
  285. IF type.form = SyntaxTree.Static THEN
  286. baseType := type.arrayBase;
  287. IF TypeNeedsInitialization(baseType) THEN
  288. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  289. FOR i := 0 TO type.staticLength-1 DO
  290. Initialize(baseType,NIL,offset+i*size);
  291. END;
  292. END;
  293. END;
  294. | SyntaxTree.MathArrayType DO
  295. IF type.form = SyntaxTree.Open THEN
  296. dim := DynamicDim(type);
  297. baseType := SemanticChecker.ArrayBase(type,dim);
  298. imm := IntermediateCode.Immediate(addressType,dim);
  299. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  300. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  301. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  302. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  303. (* flags remain empty (=0) for open array *)
  304. ELSIF type.form = SyntaxTree.Static THEN
  305. baseType := type.arrayBase;
  306. IF TypeNeedsInitialization(baseType) THEN
  307. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  308. ASSERT(type.staticLength < 1024*1024*1024);
  309. FOR i := 0 TO type.staticLength-1 DO
  310. Initialize(baseType,NIL,offset+i*size);
  311. END;
  312. END;
  313. END;
  314. ELSE
  315. IF initializer # NIL THEN
  316. implementationVisitor.Evaluate(initializer, op);
  317. SingleInitialize(op.op, offset);
  318. END;
  319. END;
  320. END Initialize;
  321. BEGIN
  322. IF x.externalName # NIL THEN RETURN END;
  323. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  324. (* code section for variable *)
  325. Global.GetSymbolSegmentedName(x,name);
  326. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  327. irv.SetExported(IsExported(x));
  328. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  329. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  330. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  331. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  332. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  333. FOR i := 0 TO DynamicDim(x.type)-1 DO
  334. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  335. END;
  336. ELSE
  337. lastUpdated:= 0;
  338. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  339. Initialize(x.type, x.initializer, 0);
  340. END;
  341. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  342. IF size > 0 THEN
  343. irv.Emit(Reserve(x.position,size));
  344. END;
  345. IF ~x.fixed THEN
  346. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  347. ELSE
  348. align := x.alignment;
  349. END;
  350. irv.SetPositionOrAlignment(x.fixed, align);
  351. meta.CheckTypeDeclaration(x.type);
  352. END;
  353. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  354. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  355. END;
  356. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  357. END Variable;
  358. PROCEDURE Parameter(x: SyntaxTree.Parameter);
  359. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  360. size: LONGINT; lastUpdated: LONGINT;
  361. BEGIN
  362. ASSERT(currentScope IS SyntaxTree.CellScope);
  363. Global.GetSymbolSegmentedName(x,name);
  364. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  365. irv.SetExported(IsExported(x));
  366. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  367. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  368. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  369. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  370. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  371. FOR i := 0 TO DynamicDim(x.type)-1 DO
  372. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  373. END;
  374. ELSE
  375. lastUpdated:= 0;
  376. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  377. IF size > 0 THEN
  378. irv.Emit(Reserve(x.position,size));
  379. END;
  380. IF ~x.fixed THEN
  381. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  382. ELSE
  383. align := x.alignment;
  384. END;
  385. irv.SetPositionOrAlignment(x.fixed, align);
  386. meta.CheckTypeDeclaration(x.type);
  387. END;
  388. END Parameter;
  389. PROCEDURE TypeDeclaration(x: SyntaxTree.TypeDeclaration);
  390. BEGIN
  391. Type(x.declaredType); (* => code in objects *)
  392. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  393. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  394. END;
  395. END TypeDeclaration;
  396. PROCEDURE Constant(x: SyntaxTree.Constant);
  397. BEGIN
  398. IF (SyntaxTree.Public * x.access # {}) THEN
  399. implementationVisitor.VisitConstant(x);
  400. END;
  401. END Constant;
  402. PROCEDURE Scope(x: SyntaxTree.Scope);
  403. VAR procedure: SyntaxTree.Procedure;
  404. constant: SyntaxTree.Constant;
  405. variable: SyntaxTree.Variable;
  406. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  407. cell: SyntaxTree.CellType;
  408. parameter: SyntaxTree.Parameter;
  409. property: SyntaxTree.Property;
  410. BEGIN
  411. prevScope := currentScope;
  412. currentScope := x;
  413. (* constants treated in implementation visitor *)
  414. WITH x: SyntaxTree.CellScope DO
  415. cell := x.ownerCell;
  416. parameter := cell.firstParameter;
  417. WHILE parameter # NIL DO
  418. Parameter(parameter);
  419. parameter := parameter.nextParameter;
  420. END;
  421. property := cell.firstProperty;
  422. WHILE property # NIL DO
  423. Variable(property);
  424. property := property.nextProperty;
  425. END;
  426. ELSE
  427. END;
  428. typeDeclaration := x.firstTypeDeclaration;
  429. WHILE typeDeclaration # NIL DO
  430. TypeDeclaration(typeDeclaration);
  431. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  432. END;
  433. variable := x.firstVariable;
  434. WHILE variable # NIL DO
  435. Variable(variable);
  436. variable := variable.nextVariable;
  437. END;
  438. procedure := x.firstProcedure;
  439. WHILE procedure # NIL DO
  440. Procedure(procedure);
  441. procedure := procedure.nextProcedure;
  442. END;
  443. constant := x.firstConstant;
  444. WHILE constant # NIL DO
  445. Constant(constant);
  446. constant := constant.nextConstant;
  447. END;
  448. currentScope := prevScope;
  449. END Scope;
  450. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  451. VAR parameter: SyntaxTree.Parameter;
  452. BEGIN
  453. parameter := first;
  454. WHILE parameter # NIL DO
  455. Parameter(parameter);
  456. parameter := parameter.nextParameter;
  457. END;
  458. END Parameters;
  459. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  460. VAR scope: SyntaxTree.ProcedureScope;
  461. prevScope: SyntaxTree.Scope;
  462. inline, finalizer: BOOLEAN;
  463. procedureType: SyntaxTree.ProcedureType;
  464. pc: LONGINT;
  465. memorySize: Basic.Integer; stackSize: LONGINT;
  466. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  467. null,size,src,dest,fp,res: IntermediateCode.Operand;
  468. callingConvention: LONGINT;
  469. cellType: SyntaxTree.CellType;
  470. register: WORD;
  471. registerClass: IntermediateCode.RegisterClass;
  472. type: IntermediateCode.Type;
  473. formalParameter: SyntaxTree.Parameter;
  474. recordType: SyntaxTree.RecordType;
  475. isModuleBody: BOOLEAN;
  476. parametersSize: LONGINT;
  477. position: LONGINT;
  478. variable, lastVariable: SyntaxTree.Variable;
  479. nonParameterRegisters: WORD;
  480. PROCEDURE Signature;
  481. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  482. BEGIN
  483. procedureType := x.type(SyntaxTree.ProcedureType);
  484. returnType := procedureType.returnType;
  485. IF returnType # NIL THEN
  486. meta.CheckTypeDeclaration(returnType)
  487. END;
  488. parameter := procedureType.firstParameter;
  489. WHILE parameter # NIL DO
  490. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  491. parameter := parameter.nextParameter;
  492. END;
  493. END Signature;
  494. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  495. VAR result: BOOLEAN;
  496. BEGIN
  497. result := FALSE;
  498. IF x = SyntaxTree.invalidExpression THEN
  499. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  500. result := TRUE;
  501. value := x.resolved(SyntaxTree.IntegerValue).value;
  502. ELSE
  503. Error(x.position,"expression is not an integer constant");
  504. END;
  505. RETURN result;
  506. END CheckIntegerValue;
  507. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  508. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  509. BEGIN
  510. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  511. WHILE (this # NIL) & (this.identifier # id) DO
  512. this := this.nextModifier;
  513. END;
  514. IF this # NIL THEN
  515. IF this.expression = NIL THEN
  516. Error(this.position,"expected expression value");
  517. ELSIF CheckIntegerValue(this.expression,value) THEN
  518. END;
  519. RETURN TRUE
  520. ELSE RETURN FALSE
  521. END;
  522. END HasValue;
  523. CONST DefaultDataMemorySize=512;
  524. BEGIN
  525. IF x.externalName # NIL THEN RETURN END;
  526. (*
  527. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  528. *)
  529. (* code section for this procedure *)
  530. position := x.position.start;
  531. scope := x.procedureScope;
  532. prevScope := currentScope;
  533. currentScope := scope;
  534. procedureType := x.type(SyntaxTree.ProcedureType);
  535. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  536. implementationVisitor.temporaries.Clear;
  537. implementationVisitor.usedRegisters := NIL;
  538. implementationVisitor.registerUsageCount.Init;
  539. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  540. IF (scope.body # NIL) & (x.isInline) THEN
  541. inline := TRUE;
  542. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  543. ir.SetExported(IsExported(x));
  544. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  545. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  546. IF backend.cellsAreObjects THEN
  547. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  548. ir.SetExported(IsExported(x));
  549. ELSE
  550. RETURN; (* cellnet cannot be compiled for final static hardware *)
  551. END;
  552. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  553. inline := FALSE;
  554. AddBodyCallStub(x);
  555. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  556. ir.SetExported(IsExported(x));
  557. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  558. inline := FALSE;
  559. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  560. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  561. AddBodyCallStub(x);
  562. AddStackAllocation(x,memorySize);
  563. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  564. ir.SetExported(IsExported(x));
  565. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  566. inline := FALSE;
  567. Parameters(procedureType.firstParameter);
  568. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  569. ir.SetExported(IsExported(x));
  570. ELSE
  571. inline := FALSE;
  572. IF x.isEntry OR x.isExit THEN
  573. IF x.isEntry THEN
  574. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  575. ELSE
  576. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  577. END;
  578. ir.SetExported(TRUE);
  579. ELSE
  580. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  581. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  582. END;
  583. END;
  584. callingConvention := procedureType.callingConvention;
  585. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  586. parametersSize := ProcedureParametersSize(backend.system,x);
  587. ELSE
  588. parametersSize := 0;
  589. END;
  590. IF scope.body # NIL THEN
  591. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  592. IF ~inline THEN
  593. variable := scope.firstVariable;
  594. lastVariable := NIL;
  595. WHILE (variable # NIL) DO
  596. IF (variable.externalName = NIL) & ~variable.fictive THEN lastVariable := variable END;
  597. variable := variable.nextVariable;
  598. END;
  599. IF lastVariable = NIL THEN
  600. stackSize := 0
  601. ELSE
  602. stackSize := lastVariable.offsetInBits;
  603. IF stackSize <0 THEN stackSize := -stackSize END;
  604. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  605. END;
  606. (*
  607. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  608. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  609. *)
  610. (*
  611. ir.Emit(Nop(position)); (* placeholder for fill *)
  612. *)
  613. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  614. backend.ResetParameterRegisters();
  615. (* assumption: registers are passed left to right and left parameters are in registers *)
  616. formalParameter := procedureType.firstParameter;
  617. WHILE (formalParameter # NIL) DO
  618. IF PassInRegister(formalParameter, callingConvention) THEN
  619. IF formalParameter.type.IsRecordType() THEN
  620. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  621. type := addressType;
  622. ELSE
  623. type := GetType(system, formalParameter.type);
  624. END;
  625. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  626. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  627. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  628. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  629. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  630. implementationVisitor.ReleaseIntermediateOperand(src);
  631. END;
  632. END;
  633. formalParameter := formalParameter.nextParameter;
  634. END;
  635. END;
  636. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  637. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  638. END;
  639. pc := ir.pc-1;
  640. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  641. backend.ResetParameterRegisters();
  642. nonParameterRegisters := 0;
  643. (* assumption: registers are passed left to right and left parameters are in registers *)
  644. formalParameter := procedureType.firstParameter;
  645. WHILE (formalParameter # NIL) DO
  646. IF PassInRegister(formalParameter, callingConvention) THEN
  647. IF formalParameter.type.IsRecordType() THEN
  648. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  649. type := addressType;
  650. ELSE
  651. type := GetType(system, formalParameter.type);
  652. END;
  653. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  654. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  655. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  656. implementationVisitor.currentScope := currentScope;
  657. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  658. formalParameter.SetOffset(variable.offsetInBits);
  659. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  660. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  661. implementationVisitor.ReleaseIntermediateOperand(src);
  662. ELSE
  663. INC(nonParameterRegisters);
  664. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  665. END;
  666. END;
  667. formalParameter := formalParameter.nextParameter;
  668. END;
  669. END;
  670. END;
  671. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  672. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  673. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  674. IF lastVariable # NIL THEN
  675. stackSize := lastVariable.offsetInBits;
  676. IF stackSize <0 THEN stackSize := -stackSize END;
  677. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  678. END;
  679. END;
  680. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  681. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  682. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  683. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  684. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  685. ir.EmitAt(pc,Push(size));
  686. implementationVisitor.StaticCallOperand(result,procedure);
  687. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  688. END;
  689. *)
  690. END;
  691. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  692. IF stackSize > 0 THEN
  693. IF (stackSize MOD system.addressSize = 0) THEN
  694. null := IntermediateCode.Immediate(addressType,0);
  695. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  696. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  697. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  698. ELSE
  699. null := IntermediateCode.Immediate(int8,0);
  700. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  701. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  702. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  703. END;
  704. (*! should potentially be called by backend -- enter might initialize
  705. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  706. *)
  707. END;
  708. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  709. parametersSize := ProcedureParametersSize(backend.system,x);
  710. ELSE
  711. parametersSize := 0;
  712. END;
  713. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  714. finalizer := FALSE;
  715. IF backend.cooperative & x.isFinalizer THEN
  716. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  717. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  718. GetRecordTypeName(recordType,name);
  719. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  720. END;
  721. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  722. IF backend.cooperative THEN
  723. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  724. IF implementationVisitor.profile & ~isModuleBody THEN
  725. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  726. END;
  727. ELSE
  728. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  729. END;
  730. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  731. IF finalizer THEN
  732. IF backend.hasLinkRegister THEN
  733. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  734. END;
  735. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  736. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  737. ir.Emit(Br(x.position,dest));
  738. ELSE
  739. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  740. END;
  741. ELSE
  742. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  743. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  744. END;
  745. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  746. IF backend.cooperative THEN
  747. IF HasPointers (scope) THEN
  748. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  749. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  750. ir.Emit(Result(x.position, res));
  751. ir.Emit(Push(x.position, res));
  752. implementationVisitor.ResetVariables(scope);
  753. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  754. ir.Emit(Pop(x.position, res));
  755. ir.Emit(Return(x.position, res));
  756. ELSE
  757. implementationVisitor.ResetVariables(scope);
  758. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  759. END;
  760. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  761. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  762. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  763. ir.Emit(Result(x.position, res));
  764. ir.Emit(Push(x.position, res));
  765. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  766. ir.Emit(Pop(x.position, res));
  767. ir.Emit(Return(x.position, res));
  768. ELSE
  769. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  770. END;
  771. END;
  772. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  774. ELSE
  775. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  776. ir.Emit(Nop(x.position));
  777. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  778. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  779. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  780. END;
  781. END;
  782. END
  783. END;
  784. ELSE (* force body for procedures *)
  785. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  786. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  787. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  788. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  789. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  790. END;
  791. Scope(scope);
  792. Signature;
  793. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  794. currentScope := prevScope;
  795. END Procedure;
  796. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  797. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  798. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  799. BEGIN
  800. ASSERT (bodyProcedure # NIL);
  801. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  802. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  803. procedure.SetScope(bodyProcedure.scope);
  804. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  805. procedure.SetAccess(SyntaxTree.Hidden);
  806. Global.GetSymbolSegmentedName (procedure,name);
  807. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  808. ir.SetExported(TRUE);
  809. Global.GetSymbolSegmentedName (bodyProcedure,name);
  810. IF ~meta.simple THEN
  811. implementationVisitor.currentScope := module.module.moduleScope;
  812. implementationVisitor.section := ir;
  813. implementationVisitor.PushSelfPointer();
  814. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  815. ELSIF backend.preregisterStatic THEN
  816. implementationVisitor.currentScope := module.module.moduleScope;
  817. implementationVisitor.section := ir;
  818. implementationVisitor.PushSelfPointer();
  819. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  820. ELSE
  821. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  822. ir.Emit(Call(bodyProcedure.position,op, 0));
  823. END;
  824. END AddBodyCallStub;
  825. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  826. VAR name: Basic.SegmentedName;
  827. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  828. BEGIN
  829. Global.GetSymbolSegmentedName (symbol,name);
  830. Basic.RemoveSuffix(name);
  831. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  832. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  833. ir.SetExported(TRUE);
  834. IntermediateCode.InitImmediate(op,addressType,initStack);
  835. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  836. END AddStackAllocation;
  837. (** entry function to visit a complete module *)
  838. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  839. VAR
  840. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  841. hasDynamicOperatorDeclarations: BOOLEAN;
  842. operator: SyntaxTree.Operator;
  843. import: SyntaxTree.Import;
  844. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  845. BEGIN
  846. type := type.resolved;
  847. IF type IS SyntaxTree.RecordType THEN
  848. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  849. ELSIF (type IS SyntaxTree.ArrayType) THEN
  850. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  851. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  852. END;
  853. ELSIF type IS SyntaxTree.MathArrayType THEN
  854. WITH type: SyntaxTree.MathArrayType DO
  855. IF type.form = SyntaxTree.Open THEN
  856. RETURN TRUE
  857. ELSIF type.form = SyntaxTree.Static THEN
  858. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  859. END;
  860. END;
  861. END;
  862. RETURN FALSE
  863. END TypeNeedsInitialization;
  864. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  865. VAR variable: SyntaxTree.Variable;
  866. BEGIN
  867. variable := scope.firstVariable;
  868. WHILE variable # NIL DO
  869. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  870. IF variable.initializer # NIL THEN RETURN TRUE END;
  871. variable := variable.nextVariable;
  872. END;
  873. RETURN FALSE
  874. END ScopeNeedsInitialization;
  875. BEGIN
  876. ASSERT(x # NIL); ASSERT(module # NIL);
  877. SELF.module := module;
  878. (* add import names to the generated Sections.Module *)
  879. import := x.moduleScope.firstImport;
  880. WHILE import # NIL DO
  881. import.module.GetName(idstr);
  882. module.imports.AddName(idstr);
  883. import := import.nextImport
  884. END;
  885. implementationVisitor.module := module;
  886. implementationVisitor.moduleScope := x.moduleScope;
  887. implementationVisitor.moduleSelf := moduleSelf;
  888. implementationVisitor.canBeLoaded := TRUE;
  889. meta.SetModule(module);
  890. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  891. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  892. END;
  893. IF backend.profile THEN
  894. EnsureBodyProcedure(x.moduleScope);
  895. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  896. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  897. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  898. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  899. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  900. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  901. Global.GetModuleName(module.module,idstr);
  902. implementationVisitor.ProfilerAddModule(idstr);
  903. implementationVisitor.numberProcedures := 0;
  904. END;
  905. implementationVisitor.profile := backend.profile;
  906. (* check if there is at least one dynamic operator locally defined *)
  907. hasDynamicOperatorDeclarations := FALSE;
  908. operator := x.moduleScope.firstOperator;
  909. WHILE operator # NIL DO
  910. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  911. operator := operator.nextOperator
  912. END;
  913. (* add operator initialization code section *)
  914. IF hasDynamicOperatorDeclarations THEN
  915. EnsureBodyProcedure(x.moduleScope);
  916. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  917. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  918. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  919. END;
  920. Scope(x.moduleScope);
  921. IF hasDynamicOperatorDeclarations THEN
  922. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  923. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  924. END;
  925. IF backend.profile THEN
  926. implementationVisitor.ProfilerPatchInit;
  927. END;
  928. END Module;
  929. END DeclarationVisitor;
  930. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  931. RegisterUsageCount*=OBJECT
  932. VAR used: UsedArray; count: LONGINT;
  933. PROCEDURE &Init;
  934. VAR i: LONGINT;
  935. BEGIN
  936. count := 0;
  937. IF used = NIL THEN NEW(used,64); END;
  938. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  939. END Init;
  940. PROCEDURE Grow;
  941. VAR new: UsedArray; size,i: LONGINT;
  942. BEGIN
  943. size := LEN(used)*2;
  944. NEW(new,size);
  945. FOR i := 0 TO LEN(used)-1 DO
  946. new[i].count := used[i].count;
  947. new[i].type := used[i].type;
  948. new[i].map := used[i].map
  949. END;
  950. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  951. used := new
  952. END Grow;
  953. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  954. BEGIN
  955. INC(count);
  956. IF count = LEN(used) THEN Grow END;
  957. used[count].type := type;
  958. used[count].class := class;
  959. used[count].map := count;
  960. RETURN count;
  961. END Next;
  962. PROCEDURE IncUse(register: LONGINT);
  963. BEGIN
  964. INC(used[register].count);
  965. (*
  966. IF (register = 1) & (count > 30) THEN
  967. D.TraceBack;
  968. END;
  969. *)
  970. END IncUse;
  971. PROCEDURE DecUse(register: LONGINT);
  972. BEGIN
  973. DEC(used[register].count);
  974. END DecUse;
  975. PROCEDURE Map(register: LONGINT): LONGINT;
  976. VAR map : LONGINT;
  977. BEGIN
  978. IF register > 0 THEN
  979. map := used[register].map;
  980. WHILE register # map DO register := map; map := used[register].map END;
  981. END;
  982. RETURN register
  983. END Map;
  984. PROCEDURE Use(register: LONGINT): LONGINT;
  985. BEGIN
  986. IF register< LEN(used) THEN
  987. RETURN used[register].count
  988. ELSE
  989. RETURN 0
  990. END
  991. END Use;
  992. END RegisterUsageCount;
  993. RegisterEntry = POINTER TO RECORD
  994. prev,next: RegisterEntry;
  995. register: LONGINT;
  996. registerClass: IntermediateCode.RegisterClass;
  997. type: IntermediateCode.Type;
  998. END;
  999. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1000. Variables = OBJECT (Basic.List)
  1001. VAR
  1002. inUse: VariableUse;
  1003. registerIndex: LONGINT;
  1004. nameIndex: LONGINT;
  1005. PROCEDURE & Init;
  1006. VAR i: LONGINT;
  1007. BEGIN
  1008. InitList(16);
  1009. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1010. registerIndex := 1024;
  1011. nameIndex := 0;
  1012. END Init;
  1013. PROCEDURE Clear*;
  1014. VAR i: LONGINT;
  1015. BEGIN
  1016. Clear^;
  1017. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1018. registerIndex := 1024;
  1019. nameIndex := 0;
  1020. END Clear;
  1021. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1022. VAR string: SyntaxTree.IdentifierString ;
  1023. BEGIN
  1024. COPY("@hiddenIRVar",string);
  1025. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1026. RETURN SyntaxTree.NewIdentifier(string);
  1027. END GetUID;
  1028. PROCEDURE GetUsage(VAR use: VariableUse);
  1029. BEGIN
  1030. use := inUse;
  1031. END GetUsage;
  1032. PROCEDURE SetUsage(CONST use: VariableUse);
  1033. BEGIN
  1034. inUse := use;
  1035. END SetUsage;
  1036. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1037. VAR any: ANY;
  1038. BEGIN
  1039. any := Get(i);
  1040. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1041. END GetVariable;
  1042. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1043. BEGIN
  1044. Set(pos, v);
  1045. END SetVariable;
  1046. PROCEDURE Occupy(pos: LONGINT);
  1047. BEGIN
  1048. INCL(inUse[pos DIV 32], pos MOD 32);
  1049. END Occupy;
  1050. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1051. BEGIN
  1052. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1053. END Occupied;
  1054. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1055. BEGIN
  1056. Occupy(Length());
  1057. Add(v);
  1058. END AddVariable;
  1059. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1060. BEGIN
  1061. t1 := t1.resolved;
  1062. t2 := t2.resolved;
  1063. (*RETURN t1.SameType(t2); *)
  1064. RETURN
  1065. (t1.SameType(t2))
  1066. OR
  1067. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1068. OR
  1069. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1070. OR
  1071. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1072. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1073. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1074. OR
  1075. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1076. (DynamicDim(t1) = DynamicDim(t2))
  1077. );
  1078. END CompatibleType;
  1079. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1080. VAR var : SyntaxTree.Variable; i: LONGINT;
  1081. BEGIN
  1082. pos := Length();
  1083. FOR i := 0 TO pos-1 DO
  1084. IF ~(Occupied(i)) THEN
  1085. var := GetVariable(i);
  1086. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1087. pos := i;
  1088. Occupy(i);
  1089. RETURN var;
  1090. END;
  1091. END;
  1092. END;
  1093. RETURN NIL
  1094. END GetFreeVariable;
  1095. END Variables;
  1096. SymbolMap = POINTER TO RECORD
  1097. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1098. isAddress: BOOLEAN;
  1099. END;
  1100. SymbolMapper = OBJECT
  1101. VAR
  1102. first: SymbolMap;
  1103. PROCEDURE & Init;
  1104. BEGIN
  1105. first := NIL;
  1106. END Init;
  1107. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1108. VAR new: SymbolMap;
  1109. BEGIN
  1110. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1111. new.next := first; first := new;
  1112. END Add;
  1113. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1114. VAR s: SymbolMap;
  1115. BEGIN
  1116. s := first;
  1117. WHILE (s # NIL) & (s.this # this) DO
  1118. s := s.next
  1119. END;
  1120. RETURN s
  1121. END Get;
  1122. END SymbolMapper;
  1123. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1124. VAR
  1125. system: Global.System;
  1126. section: IntermediateCode.Section;
  1127. module: Sections.Module;
  1128. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1129. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1130. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1131. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1132. checker: SemanticChecker.Checker;
  1133. backend: IntermediateBackend;
  1134. meta: MetaDataGenerator;
  1135. position: Position;
  1136. moduleSelf: SyntaxTree.Variable;
  1137. (* variables for hand over of variables / temporary state *)
  1138. currentScope: SyntaxTree.Scope;
  1139. constantDeclaration : SyntaxTree.Symbol;
  1140. result: Operand; (* result of the most recent expression / statement *)
  1141. destination: IntermediateCode.Operand;
  1142. arrayDestinationTag: IntermediateCode.Operand;
  1143. arrayDestinationDimension:LONGINT;
  1144. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1145. conditional: BOOLEAN;
  1146. trueLabel, falseLabel, exitLabel: Label;
  1147. locked: BOOLEAN;
  1148. (*
  1149. usedRegisters: Registers;
  1150. *)
  1151. registerUsageCount: RegisterUsageCount;
  1152. usedRegisters: RegisterEntry;
  1153. (* useful operands and types *)
  1154. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1155. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1156. commentPrintout: Printout.Printer;
  1157. dump: Streams.Writer;
  1158. tagsAvailable : BOOLEAN;
  1159. supportedInstruction: SupportedInstructionProcedure;
  1160. supportedImmediate: SupportedImmediateProcedure;
  1161. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1162. emitLabels: BOOLEAN;
  1163. builtinsModuleName : SyntaxTree.IdentifierString;
  1164. indexCounter: LONGINT;
  1165. profile: BOOLEAN;
  1166. profileId, profileInit: IntermediateCode.Section;
  1167. profileInitPatchPosition: LONGINT;
  1168. numberProcedures: LONGINT;
  1169. procedureResultDesignator : SyntaxTree.Designator;
  1170. operatorInitializationCodeSection: IntermediateCode.Section;
  1171. fingerPrinter: FingerPrinter.FingerPrinter;
  1172. temporaries: Variables;
  1173. canBeLoaded : BOOLEAN;
  1174. currentIsInline: BOOLEAN;
  1175. currentMapper: SymbolMapper;
  1176. currentInlineExit: Label;
  1177. moduleBodySection: IntermediateCode.Section;
  1178. NeedDescriptor : BOOLEAN;
  1179. cooperativeSwitches: BOOLEAN;
  1180. lastSwitchPC: LONGINT;
  1181. isUnchecked: BOOLEAN;
  1182. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1183. BEGIN
  1184. SELF.system := system;
  1185. SELF.builtinsModuleName := runtime;
  1186. currentScope := NIL;
  1187. hiddenPointerType := NIL;
  1188. delegatePointerType := NIL;
  1189. awaitProcCounter := 0;
  1190. labelId := 0; constId := 0; labelId := 0;
  1191. SELF.checker := checker;
  1192. SELF.backend := backend;
  1193. position := Basic.invalidPosition;
  1194. conditional := FALSE;
  1195. locked := FALSE;
  1196. InitOperand(result,ModeUndefined);
  1197. addressType := IntermediateCode.GetType(system,system.addressType);
  1198. setType := IntermediateCode.GetType(system,system.setType);
  1199. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1200. lenType := IntermediateCode.GetType(system, system.lenType);
  1201. byteType := IntermediateCode.GetType(system, system.byteType);
  1202. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1203. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1204. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1205. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1206. nil := IntermediateCode.Immediate(addressType,0);
  1207. one := IntermediateCode.Immediate(addressType,1);
  1208. IntermediateCode.InitOperand(destination);
  1209. tagsAvailable := TRUE;
  1210. supportedInstruction := supportedInstructionProcedure;
  1211. supportedImmediate := supportedImmediateProcedure;
  1212. inData := FALSE;
  1213. SELF.emitLabels := emitLabels;
  1214. IntermediateCode.InitOperand(arrayDestinationTag);
  1215. bool := IntermediateCode.GetType(system,system.booleanType);
  1216. IntermediateCode.InitImmediate(false,bool,0);
  1217. IntermediateCode.InitImmediate(true,bool,1);
  1218. indexCounter := 0;
  1219. NEW(registerUsageCount);
  1220. usedRegisters := NIL;
  1221. procedureResultDesignator := NIL;
  1222. NEW(fingerPrinter);
  1223. NEW(temporaries);
  1224. currentIsInline := FALSE;
  1225. NeedDescriptor := FALSE;
  1226. isUnchecked := backend.noRuntimeChecks;
  1227. END Init;
  1228. TYPE Context = RECORD
  1229. section: IntermediateCode.Section;
  1230. registerUsageCount: RegisterUsageCount;
  1231. usedRegisters: RegisterEntry;
  1232. temporaries: Variables;
  1233. END;
  1234. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1235. VAR context: Context;
  1236. BEGIN
  1237. context.section := section;
  1238. context.registerUsageCount := registerUsageCount;
  1239. context.usedRegisters := usedRegisters;
  1240. context.temporaries := temporaries;
  1241. section := new;
  1242. NEW(registerUsageCount);
  1243. NEW(temporaries);
  1244. usedRegisters := NIL;
  1245. RETURN context;
  1246. END SwitchContext;
  1247. PROCEDURE ReturnToContext(context: Context);
  1248. BEGIN
  1249. section := context.section;
  1250. registerUsageCount := context.registerUsageCount;
  1251. usedRegisters := context.usedRegisters;
  1252. temporaries := context.temporaries;
  1253. END ReturnToContext;
  1254. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1255. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1256. BEGIN
  1257. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1258. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1259. END;
  1260. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1261. section.SetExported(IsExported(syntaxTreeSymbol));
  1262. RETURN section
  1263. END NewSection;
  1264. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1265. VAR new: LONGINT;
  1266. BEGIN
  1267. new := registerUsageCount.Next(type,class);
  1268. UseRegister(new);
  1269. RETURN new
  1270. END AcquireRegister;
  1271. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1272. VAR
  1273. fingerPrint: SyntaxTree.FingerPrint;
  1274. fingerPrintString: ARRAY 32 OF CHAR;
  1275. BEGIN
  1276. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1277. string := "[";
  1278. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1279. Strings.Append(string, fingerPrintString);
  1280. Strings.Append(string, "]");
  1281. END GetFingerprintString;
  1282. (** get the name for the code section that represens a certain symbol
  1283. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1284. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1285. VAR string: ARRAY 32 OF CHAR;
  1286. BEGIN
  1287. Global.GetSymbolSegmentedName(symbol, name);
  1288. (* if the symbol is an operator, then append the fingerprint to the name *)
  1289. IF symbol IS SyntaxTree.Operator THEN
  1290. GetFingerprintString(symbol, string);
  1291. Basic.AppendToSegmentedName(name,string);
  1292. END
  1293. END GetCodeSectionNameForSymbol;
  1294. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1295. BEGIN
  1296. IF dump # NIL THEN
  1297. dump.String("enter "); dump.String(s); dump.Ln;
  1298. END;
  1299. END TraceEnter;
  1300. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1301. BEGIN
  1302. IF dump # NIL THEN
  1303. dump.String("exit "); dump.String(s); dump.Ln;
  1304. END;
  1305. END TraceExit;
  1306. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1307. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1308. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1309. VAR i: LONGINT;
  1310. BEGIN
  1311. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1312. IF op.rule # NIL THEN
  1313. FOR i := 0 TO LEN(op.rule)-1 DO
  1314. CheckRegister(op.rule[i])
  1315. END;
  1316. END;
  1317. END CheckRegister;
  1318. BEGIN
  1319. CheckRegister(instruction.op1);
  1320. CheckRegister(instruction.op2);
  1321. CheckRegister(instruction.op3);
  1322. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1323. ELSE section.Emit(instruction);
  1324. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1325. END;
  1326. END Emit;
  1327. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1328. VAR saved: RegisterEntry;
  1329. BEGIN
  1330. IF backend.cooperative THEN
  1331. ReleaseUsedRegisters(saved);
  1332. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1333. CallThis(position,"Runtime","Trap",1);
  1334. RestoreRegisterUse(saved);
  1335. ELSE
  1336. Emit(Trap(position,trapNo));
  1337. END;
  1338. END EmitTrap;
  1339. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1340. VAR name: Basic.SegmentedName;
  1341. VAR op1, op2, reg: IntermediateCode.Operand;
  1342. VAR call, nocall: Label;
  1343. VAR parametersSize: LONGINT;
  1344. VAR prevSection: IntermediateCode.Section;
  1345. VAR prevDump: Streams.Writer;
  1346. VAR body: SyntaxTree.Body;
  1347. VAR procedureType: SyntaxTree.ProcedureType;
  1348. BEGIN
  1349. IF procedure # NIL THEN
  1350. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1351. ELSE procedureType := NIL;
  1352. END;
  1353. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1354. prevSection := SELF.section;
  1355. SELF.section := section;
  1356. prevDump := dump;
  1357. dump := section.comments;
  1358. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1359. IF backend.hasLinkRegister THEN
  1360. Emit(Push(Basic.invalidPosition, lr));
  1361. END;
  1362. Emit(Push(Basic.invalidPosition,fp));
  1363. IF procedure # NIL THEN
  1364. body := procedure.procedureScope.body;
  1365. ELSE
  1366. body := NIL;
  1367. END;
  1368. IF backend.cooperative THEN
  1369. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1370. GetCodeSectionNameForSymbol(procedure, name);
  1371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1372. ELSE
  1373. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1374. END;
  1375. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1376. IntermediateCode.AddOffset(op1, 1);
  1377. Emit(Push(Basic.invalidPosition,op1));
  1378. Emit(Mov(Basic.invalidPosition,fp, sp));
  1379. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1380. NEW(call, section);
  1381. NEW(nocall, section);
  1382. reg := NewRegisterOperand(addressType);
  1383. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1384. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1385. BrltL(call, sp, reg);
  1386. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1387. BrgeL(nocall, sp, op2);
  1388. call.Resolve(section.pc);
  1389. Emit(Push(Basic.invalidPosition, reg));
  1390. ReleaseIntermediateOperand(reg);
  1391. parametersSize := ProcParametersSize(procedure);
  1392. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1393. Emit(Push(Basic.invalidPosition, op2));
  1394. CallThis(position, "Activities","ExpandStack",2);
  1395. Emit(Result(Basic.invalidPosition, sp));
  1396. nocall.Resolve(section.pc);
  1397. END;
  1398. ELSE
  1399. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1400. Emit(Push(Basic.invalidPosition, one)) ;
  1401. procedureType.SetParametersOffset(1);
  1402. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1403. END;
  1404. Emit(Mov(Basic.invalidPosition, fp, sp));
  1405. END;
  1406. END;
  1407. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1408. SELF.section := prevSection;
  1409. dump := prevDump;
  1410. END EmitEnter;
  1411. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1412. VAR op1,op2: IntermediateCode.Operand;
  1413. VAR instruction: IntermediateCode.Instruction;
  1414. BEGIN
  1415. IntermediateCode.InitNumber(op1,callconv);
  1416. IntermediateCode.InitNumber(op2,varSize);
  1417. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1418. RETURN instruction
  1419. END Enter;
  1420. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1421. VAR op1: IntermediateCode.Operand;
  1422. VAR instruction: IntermediateCode.Instruction;
  1423. BEGIN
  1424. IntermediateCode.InitNumber(op1,callconv);
  1425. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1426. RETURN instruction
  1427. END Leave;
  1428. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1429. VAR prevSection: IntermediateCode.Section;
  1430. VAR op2: IntermediateCode.Operand;
  1431. VAR body: SyntaxTree.Body;
  1432. BEGIN
  1433. prevSection := SELF.section;
  1434. SELF.section := section;
  1435. Emit(Leave(position, callconv));
  1436. IF procedure # NIL THEN
  1437. body := procedure.procedureScope.body;
  1438. ELSE
  1439. body := NIL;
  1440. END;
  1441. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1442. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1443. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1444. Emit(Add(position, sp, fp, op2));
  1445. ELSE
  1446. Emit(Mov(position, sp, fp));
  1447. END;
  1448. Emit(Pop(position, fp));
  1449. END;
  1450. SELF.section := prevSection;
  1451. END EmitLeave;
  1452. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1453. VAR m: SymbolMap;
  1454. BEGIN
  1455. position := x.position;
  1456. IF currentIsInline THEN
  1457. m := currentMapper.Get(x);
  1458. IF m # NIL THEN
  1459. (*
  1460. Printout.Info("mapping from", x);
  1461. Printout.Info("mapping to ", m.to);
  1462. *)
  1463. VExpression(m.to);
  1464. op := result;
  1465. IF m.tag # NIL THEN
  1466. ReleaseIntermediateOperand(result.tag);
  1467. VExpression(m.tag);
  1468. op.tag := result.op;
  1469. ReleaseIntermediateOperand(result.tag);
  1470. END;
  1471. RETURN
  1472. END;
  1473. END;
  1474. VSymbol(x);
  1475. op := result;
  1476. END Symbol;
  1477. PROCEDURE Expression(x: SyntaxTree.Expression);
  1478. BEGIN
  1479. position := x.position;
  1480. constantDeclaration := NIL;
  1481. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1482. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1483. END;
  1484. IF x.resolved # NIL THEN
  1485. VExpression(x.resolved);
  1486. ELSE
  1487. VExpression(x);
  1488. END;
  1489. (* check this, was commented out in ActiveCells3 *)
  1490. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1491. Error(x.position, "unsupported modifier");
  1492. END;
  1493. END Expression;
  1494. (*
  1495. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1496. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1497. BEGIN
  1498. temporaries.GetUsage(current);
  1499. FOR i := 0 TO LEN(current)-1 DO
  1500. set := current[i] - previous[i];
  1501. IF set # {} THEN
  1502. FOR j := 0 TO MAX(SET)-1 DO
  1503. IF j IN set THEN
  1504. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1505. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1506. Symbol(variable, op);
  1507. MakeMemory(tmp,op.op,addressType,0);
  1508. ReleaseOperand(op);
  1509. Emit(Mov(position,tmp, nil ) );
  1510. ReleaseIntermediateOperand(tmp);
  1511. END;
  1512. END;
  1513. END;
  1514. END;
  1515. END;
  1516. END ResetUsedTemporaries;
  1517. *)
  1518. PROCEDURE Statement(x: SyntaxTree.Statement);
  1519. VAR use: VariableUse;
  1520. BEGIN
  1521. temporaries.GetUsage(use);
  1522. position := x.position;
  1523. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1524. IF commentPrintout # NIL THEN
  1525. commentPrintout.Statement(x);
  1526. dump.Ln;
  1527. (*dump.Update;*)
  1528. END;
  1529. VStatement(x);
  1530. (*
  1531. CheckRegistersFree();
  1532. *)
  1533. (*ResetUsedTemporaries(use);*)
  1534. temporaries.SetUsage(use);
  1535. END Statement;
  1536. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1537. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1538. *)
  1539. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1540. BEGIN
  1541. ASSERT(op.mode # IntermediateCode.Undefined);
  1542. IF op.mode = IntermediateCode.ModeMemory THEN
  1543. ReuseCopy(res,op);
  1544. ELSE
  1545. res := op;
  1546. UseIntermediateOperand(res);
  1547. END;
  1548. IntermediateCode.AddOffset(res,offset);
  1549. IntermediateCode.MakeMemory(res,type);
  1550. END MakeMemory;
  1551. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1552. VAR mem: IntermediateCode.Operand;
  1553. BEGIN
  1554. MakeMemory(mem,res,type,offset);
  1555. ReleaseIntermediateOperand(res);
  1556. res := mem;
  1557. END ToMemory;
  1558. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1559. VAR mem: IntermediateCode.Operand;
  1560. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1561. componentType: SyntaxTree.Type;
  1562. BEGIN
  1563. type := type.resolved;
  1564. IF operand.mode = ModeReference THEN
  1565. IF type IS SyntaxTree.RangeType THEN
  1566. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1567. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1568. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1569. ReleaseOperand(operand);
  1570. operand.op := firstOp;
  1571. operand.tag := lastOp;
  1572. operand.extra := stepOp;
  1573. ELSIF type IS SyntaxTree.ComplexType THEN
  1574. componentType := type(SyntaxTree.ComplexType).componentType;
  1575. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1576. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1577. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1578. ReleaseOperand(operand);
  1579. operand.op := firstOp;
  1580. operand.tag := lastOp
  1581. ELSE
  1582. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1583. ReleaseIntermediateOperand(operand.op);
  1584. operand.op := mem;
  1585. END;
  1586. operand.mode := ModeValue;
  1587. END;
  1588. ASSERT(operand.mode = ModeValue);
  1589. END LoadValue;
  1590. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1591. VAR prevConditional: BOOLEAN;
  1592. BEGIN
  1593. prevConditional := conditional;
  1594. conditional := FALSE;
  1595. InitOperand(result, ModeUndefined);
  1596. Expression(x);
  1597. op := result;
  1598. LoadValue(op,x.type.resolved);
  1599. conditional := prevConditional;
  1600. END Evaluate;
  1601. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1602. VAR prevConditional: BOOLEAN;
  1603. BEGIN
  1604. prevConditional := conditional;
  1605. conditional := FALSE;
  1606. InitOperand(result,ModeUndefined);
  1607. Expression(x);
  1608. op := result;
  1609. (*
  1610. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1611. *)
  1612. conditional := prevConditional;
  1613. END Designate;
  1614. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1615. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1616. BEGIN
  1617. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1618. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1619. conditional := TRUE;
  1620. trueLabel := trueL; falseLabel := falseL;
  1621. Expression(x);
  1622. trueL := trueLabel; falseL := falseLabel;
  1623. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1624. END Condition;
  1625. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1626. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1627. BEGIN
  1628. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1629. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1630. RETURN op
  1631. END NewRegisterOperand;
  1632. PROCEDURE UnuseRegister(register: LONGINT);
  1633. BEGIN
  1634. IF (register > 0) THEN
  1635. register := registerUsageCount.Map(register);
  1636. registerUsageCount.DecUse(register);
  1637. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1638. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1639. END;
  1640. IF registerUsageCount.Use(register)=0 THEN
  1641. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1642. Warning(position, "register cannot be removed");
  1643. END;
  1644. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1645. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1646. END;
  1647. ELSIF registerUsageCount.Use(register)<0 THEN
  1648. Warning(position, "register removed too often");
  1649. IF dump # NIL THEN
  1650. dump.String("register removed too often"); dump.Ln; dump.Update;
  1651. END;
  1652. END;
  1653. END;
  1654. END UnuseRegister;
  1655. PROCEDURE UseRegister(register: LONGINT);
  1656. BEGIN
  1657. IF (register > 0) THEN
  1658. register := registerUsageCount.Map(register);
  1659. registerUsageCount.IncUse(register);
  1660. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1661. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1662. END;
  1663. IF registerUsageCount.Use(register)=1 THEN
  1664. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1665. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1666. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1667. END;
  1668. END;
  1669. END;
  1670. END UseRegister;
  1671. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1672. BEGIN
  1673. UnuseRegister(op.register)
  1674. END ReleaseIntermediateOperand;
  1675. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1676. BEGIN
  1677. UseRegister(op.register)
  1678. END UseIntermediateOperand;
  1679. PROCEDURE ReleaseOperand(CONST op: Operand);
  1680. BEGIN
  1681. UnuseRegister(op.op.register);
  1682. UnuseRegister(op.tag.register);
  1683. UnuseRegister(op.extra.register);
  1684. END ReleaseOperand;
  1685. (* save registers marked in array "markedRegisters" to the stack
  1686. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1687. *)
  1688. PROCEDURE SaveRegisters();
  1689. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1690. BEGIN
  1691. entry := usedRegisters;
  1692. WHILE entry # NIL DO
  1693. type := registerUsageCount.used[entry.register].type;
  1694. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1695. Emit(Push(position,op));
  1696. entry := entry.next;
  1697. END;
  1698. END SaveRegisters;
  1699. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1700. BEGIN
  1701. saved := usedRegisters;
  1702. usedRegisters := NIL;
  1703. END ReleaseUsedRegisters;
  1704. (** remove parameter registers from used queue *)
  1705. PROCEDURE ReleaseParameterRegisters;
  1706. VAR entry,prev,next: RegisterEntry;
  1707. BEGIN
  1708. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1709. WHILE entry # NIL DO
  1710. next := entry.next;
  1711. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1712. registerUsageCount.DecUse(entry.register);
  1713. ASSERT(registerUsageCount.Use(entry.register)=0);
  1714. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1715. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1716. END;
  1717. ELSIF prev = NIL THEN
  1718. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1719. ELSE
  1720. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1721. END;
  1722. entry := next;
  1723. END;
  1724. END ReleaseParameterRegisters;
  1725. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1726. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1727. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1728. BEGIN
  1729. entry := saved;
  1730. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1731. entry := prev;
  1732. WHILE entry # NIL DO
  1733. prev := entry.prev;
  1734. type := entry.type;
  1735. class := entry.registerClass;
  1736. IntermediateCode.InitRegister(op,type,class,entry.register);
  1737. Emit(Pop(position,op));
  1738. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1739. entry := prev;
  1740. END;
  1741. END RestoreRegisters;
  1742. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  1743. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  1744. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1745. BEGIN
  1746. entry := saved;
  1747. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1748. entry := prev;
  1749. WHILE entry # NIL DO
  1750. prev := entry.prev;
  1751. type := entry.type;
  1752. class := entry.registerClass;
  1753. IntermediateCode.InitRegister(op,type,class,entry.register);
  1754. Emit(Mov(position,op,op));
  1755. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1756. entry := prev;
  1757. END;
  1758. END RestoreRegisterUse;
  1759. PROCEDURE CheckRegistersFree;
  1760. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1761. BEGIN
  1762. IF usedRegisters # NIL THEN
  1763. r := usedRegisters;
  1764. WHILE r # NIL DO
  1765. warning := "register ";
  1766. Strings.AppendInt(warning, r.register);
  1767. Strings.Append(warning, " not released.");
  1768. Warning(position,warning);
  1769. r := r .next;
  1770. END;
  1771. END;
  1772. FOR i := 0 TO registerUsageCount.count-1 DO
  1773. IF registerUsageCount.used[i].count < 0 THEN
  1774. warning := "register ";
  1775. Strings.AppendInt(warning, i);
  1776. Strings.Append(warning, " unused too often.");
  1777. Warning(position,warning);
  1778. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1779. warning := "register ";
  1780. Strings.AppendInt(warning, i);
  1781. Strings.Append(warning, " not unused often enough.");
  1782. Warning(position,warning);
  1783. END;
  1784. END;
  1785. END CheckRegistersFree;
  1786. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1787. Otherwise allocate a new register.
  1788. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1789. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1790. BEGIN
  1791. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1792. UseIntermediateOperand(result);
  1793. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1794. UseIntermediateOperand(result);
  1795. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1796. END;
  1797. END Reuse2;
  1798. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1799. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1800. If not then allocate a new register.
  1801. Does NOT necessarily keep the content of src1 or src2 in result!
  1802. *)
  1803. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1804. BEGIN
  1805. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1806. UseIntermediateOperand(result);
  1807. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1808. UseIntermediateOperand(result);
  1809. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1810. result := alternative; alternative := emptyOperand;
  1811. UseIntermediateOperand(result);
  1812. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1813. END;
  1814. END Reuse2a;
  1815. (* like reuse2 but only one source *)
  1816. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1817. BEGIN
  1818. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1819. UseIntermediateOperand(result);
  1820. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1821. END;
  1822. END Reuse1;
  1823. (* like reuse2a but only one source *)
  1824. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1825. BEGIN
  1826. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1827. UseIntermediateOperand(result);
  1828. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1829. UseIntermediateOperand(result);
  1830. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1831. END;
  1832. END Reuse1a;
  1833. (* like reuse1 but guarantees that content of src1 is in result *)
  1834. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1835. BEGIN
  1836. IF ReusableRegister(src1) THEN
  1837. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1838. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1839. UseIntermediateOperand(result);
  1840. ELSE
  1841. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1842. Emit(Mov(position,result,src1));
  1843. END
  1844. END ReuseCopy;
  1845. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1846. BEGIN
  1847. IF ReusableRegister(src) THEN
  1848. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1849. ELSE
  1850. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1851. Emit(Mov(position,result,src));
  1852. ReleaseIntermediateOperand(src);
  1853. END
  1854. END TransferToRegister;
  1855. (** labels and branches **)
  1856. PROCEDURE NewLabel(): Label;
  1857. VAR label: Label;
  1858. BEGIN
  1859. NEW(label,section); RETURN label;
  1860. END NewLabel;
  1861. PROCEDURE SetLabel(label: Label);
  1862. BEGIN
  1863. (* basic block start / end *)
  1864. label.Resolve(section.pc);
  1865. END SetLabel;
  1866. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1867. BEGIN
  1868. ASSERT(label # NIL);
  1869. IF label.pc < 0 THEN (* label not yet set *)
  1870. label.AddFixup(section.pc);
  1871. END;
  1872. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1873. END LabelOperand;
  1874. PROCEDURE BrL(label: Label);
  1875. BEGIN
  1876. (* basic block start / end *)
  1877. Emit(Br(position,LabelOperand(label)));
  1878. END BrL;
  1879. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1880. BEGIN
  1881. Emit(Brge(position,LabelOperand(label),left,right));
  1882. END BrgeL;
  1883. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1884. BEGIN
  1885. Emit(Brlt(position,LabelOperand(label),left,right));
  1886. END BrltL;
  1887. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1888. BEGIN
  1889. Emit(Breq(position,LabelOperand(label),left,right));
  1890. END BreqL;
  1891. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1892. BEGIN
  1893. Emit(Brne(position,LabelOperand(label),left,right));
  1894. END BrneL;
  1895. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1896. VAR new: IntermediateCode.Operand;
  1897. BEGIN
  1898. IF Trace THEN TraceEnter("Convert") END;
  1899. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1900. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1901. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1902. & (operand.offset = 0)
  1903. THEN
  1904. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1905. Emit(Conv(position,new,operand));
  1906. ELSE
  1907. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1908. Emit(Conv(position,new,operand));
  1909. ReleaseIntermediateOperand(operand);
  1910. END;
  1911. operand := new;
  1912. 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
  1913. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1914. ELSE
  1915. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1916. Emit(Conv(position,new,operand));
  1917. ReleaseIntermediateOperand(operand);
  1918. operand := new;
  1919. END;
  1920. IF Trace THEN TraceExit("Convert") END;
  1921. END Convert;
  1922. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1923. VAR exit: Label;
  1924. BEGIN
  1925. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1926. exit := NewLabel();
  1927. br(exit,left,right);
  1928. EmitTrap(position,trapNo);
  1929. SetLabel(exit);
  1930. END TrapC;
  1931. (** expressions *)
  1932. (** emit necessary runtime check for set elements **)
  1933. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1934. VAR max: IntermediateCode.Operand;
  1935. BEGIN
  1936. IF isUnchecked THEN RETURN END;
  1937. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1938. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1939. TrapC(BrgeL, max, o, SetElementTrap);
  1940. END;
  1941. END CheckSetElement;
  1942. (** the set that a range represents **)
  1943. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1944. VAR
  1945. operand: Operand;
  1946. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1947. BEGIN
  1948. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1949. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1950. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1951. one := IntermediateCode.Immediate(setType, 1);
  1952. Evaluate(x, operand);
  1953. Convert(operand.op, setType);
  1954. Convert(operand.tag, setType);
  1955. CheckSetElement(operand.op);
  1956. CheckSetElement(operand.tag);
  1957. (* create mask for lower bound
  1958. i.e. shift 11111111 to the left by the value of the lower bound
  1959. *)
  1960. Reuse1(temp, operand.op);
  1961. Emit(Shl(position,temp, allBits, operand.op));
  1962. ReleaseIntermediateOperand(operand.op);
  1963. operand.op := temp;
  1964. (* create mask for upper bound
  1965. i.e. shift 11111111 to the right by the difference between the
  1966. upper bound and the maximum number of set elements
  1967. *)
  1968. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1969. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1970. Reuse1(temp, operand.tag);
  1971. ELSE
  1972. Reuse1(temp, operand.tag);
  1973. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1974. Emit(Sub(position,temp, size, operand.tag));
  1975. END;
  1976. Emit(Shr(position,temp, allBits, operand.tag));
  1977. ReleaseIntermediateOperand(operand.tag);
  1978. operand.tag := temp;
  1979. Reuse2(resultingSet, operand.op, operand.tag);
  1980. (* intersect the two masks *)
  1981. Emit(And(position,resultingSet, operand.op, operand.tag));
  1982. ReleaseOperand(operand);
  1983. RETURN resultingSet
  1984. END SetFromRange;
  1985. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  1986. VAR
  1987. res, operand: Operand;
  1988. temp, one, noBits, dest: IntermediateCode.Operand;
  1989. expression: SyntaxTree.Expression;
  1990. i: LONGINT;
  1991. BEGIN
  1992. IF Trace THEN TraceEnter("VisitSet") END;
  1993. dest := destination;
  1994. destination := emptyOperand;
  1995. noBits := IntermediateCode.Immediate(setType, 0);
  1996. one := IntermediateCode.Immediate(setType, 1);
  1997. (* start off with the empty set *)
  1998. InitOperand(res, ModeValue);
  1999. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2000. Emit(Mov(position,res.op, noBits));
  2001. FOR i := 0 TO x.elements.Length() - 1 DO
  2002. expression := x.elements.GetExpression(i);
  2003. IF expression IS SyntaxTree.RangeExpression THEN
  2004. (* range of set elements *)
  2005. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2006. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2007. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2008. ReleaseIntermediateOperand(temp)
  2009. ELSE
  2010. (* singelton element *)
  2011. Evaluate(expression, operand);
  2012. Convert(operand.op, setType);
  2013. CheckSetElement(operand.op);
  2014. (* create subset containing single element *)
  2015. Reuse1(temp, operand.op);
  2016. Emit(Shl(position,temp, one, operand.op));
  2017. ReleaseOperand(operand);
  2018. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2019. ReleaseIntermediateOperand(temp);
  2020. END
  2021. END;
  2022. result := res;
  2023. destination := dest;
  2024. IF Trace THEN TraceExit("VisitSet") END;
  2025. END VisitSet;
  2026. (* math arrays of the form [a,b,c]
  2027. x is a static array and thus does not provide any pointers
  2028. *)
  2029. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2030. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2031. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2032. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2033. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2034. element: SyntaxTree.IntegerValue;
  2035. BEGIN
  2036. numberElements := x.elements.Length();
  2037. expression := index.parameters.GetExpression(dim);
  2038. element := expression(SyntaxTree.IntegerValue);
  2039. FOR i := 0 TO numberElements-1 DO
  2040. expression := x.elements.GetExpression(i);
  2041. element.SetValue(i);
  2042. IF expression IS SyntaxTree.MathArrayExpression THEN
  2043. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2044. ELSE
  2045. Assign(index,expression);
  2046. END;
  2047. END;
  2048. END RecursiveAssignment;
  2049. PROCEDURE Dimension(): LONGINT;
  2050. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2051. BEGIN
  2052. dim := 0;
  2053. expression := x;
  2054. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2055. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2056. INC(dim);
  2057. END;
  2058. RETURN dim;
  2059. END Dimension;
  2060. BEGIN
  2061. (*static math array not providing pointers anyway *)
  2062. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2063. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2064. designator.SetType(variable.type);
  2065. dim := Dimension();
  2066. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2067. FOR i := 0 TO dim-1 DO
  2068. element := SyntaxTree.NewIntegerValue(x.position,0);
  2069. element.SetType(system.longintType);
  2070. index.parameters.AddExpression(element);
  2071. END;
  2072. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2073. RecursiveAssignment(x,0);
  2074. Expression(designator);
  2075. END VisitMathArrayExpression;
  2076. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2077. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2078. BEGIN
  2079. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2080. dest := destination; destination := emptyOperand;
  2081. IF x.operator = Scanner.Not THEN
  2082. IF conditional THEN
  2083. Condition(x.left,falseLabel,trueLabel)
  2084. ELSE
  2085. Evaluate(x.left,operand);
  2086. InitOperand(result,ModeValue);
  2087. Reuse1a(result.op,operand.op,dest);
  2088. Emit(Xor(position,result.op,operand.op,true));
  2089. ReleaseOperand(operand);
  2090. END;
  2091. ELSIF x.operator = Scanner.Minus THEN
  2092. Evaluate(x.left,operand);
  2093. InitOperand(result,ModeValue);
  2094. Reuse1a(result.op,operand.op,dest);
  2095. type := x.left.type.resolved;
  2096. IF type IS SyntaxTree.SetType THEN
  2097. Emit(Not(position,result.op,operand.op));
  2098. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2099. Reuse1(result.tag,operand.tag);
  2100. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2101. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2102. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2103. Emit(Neg(position,result.op,operand.op));
  2104. ELSE HALT(200)
  2105. END;
  2106. ReleaseOperand(operand);
  2107. ELSIF x.operator = Scanner.Address THEN
  2108. Designate(x.left,operand);
  2109. operand.mode := ModeValue;
  2110. t0 := x.left.type.resolved;
  2111. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2112. ReleaseIntermediateOperand(operand.op);
  2113. operand.op := operand.tag;
  2114. IntermediateCode.InitOperand(operand.tag);
  2115. END;
  2116. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2117. result := operand;
  2118. ELSE HALT(100)
  2119. END;
  2120. destination := dest;
  2121. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2122. END VisitUnaryExpression;
  2123. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2124. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label; withPart: BOOLEAN);
  2125. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2126. BEGIN
  2127. type := type.resolved;
  2128. originalType := type;
  2129. IF type IS SyntaxTree.PointerType THEN
  2130. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2131. END;
  2132. IF type IS SyntaxTree.ObjectType THEN
  2133. BrL(trueL);
  2134. ELSE
  2135. ASSERT(type IS SyntaxTree.RecordType);
  2136. (*
  2137. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2138. *)
  2139. IF withPart THEN
  2140. left := tag;
  2141. ELSE
  2142. ReuseCopy(left,tag);
  2143. END;
  2144. right := TypeDescriptorAdr(type);
  2145. IF backend.cooperative THEN
  2146. repeatL := NewLabel();
  2147. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2148. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2149. END;
  2150. SetLabel(repeatL);
  2151. BreqL(trueL,left,right);
  2152. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2153. BrneL(repeatL,left,nil);
  2154. ELSIF meta.simple THEN
  2155. level := type(SyntaxTree.RecordType).Level();
  2156. (* get type desc tag of level relative to base tag *)
  2157. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2158. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2159. IntermediateCode.MakeMemory(left,addressType);
  2160. BreqL(trueL,left,right);
  2161. ELSE
  2162. level := type(SyntaxTree.RecordType).Level();
  2163. (* get type desc tag of level relative to base tag *)
  2164. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2165. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2166. IntermediateCode.MakeMemory(left,addressType);
  2167. BreqL(trueL,left,right);
  2168. END;
  2169. IF ~withPart THEN
  2170. ReleaseIntermediateOperand(left);
  2171. END;
  2172. ReleaseIntermediateOperand(right);
  2173. IF falseL # NIL THEN BrL(falseL) END;
  2174. END;
  2175. END TypeTest;
  2176. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2177. BEGIN
  2178. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2179. IF dump # NIL THEN
  2180. dump.String(s); dump.Ln;
  2181. END;
  2182. END Error;
  2183. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2184. BEGIN
  2185. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2186. IF dump # NIL THEN
  2187. dump.String(s); dump.Ln; dump.Update;
  2188. END;
  2189. END Warning;
  2190. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2191. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2192. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2193. operand:Operand;
  2194. BEGIN
  2195. previousSection := section;
  2196. Global.GetModuleName(mod,name);
  2197. Strings.Append(name,".@Trace");
  2198. Basic.ToSegmentedName(name, pooledName);
  2199. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2200. IF dump # NIL THEN dump := section.comments END;
  2201. IF backend.hasLinkRegister THEN
  2202. Emit(Push(Basic.invalidPosition, lr));
  2203. END;
  2204. variable := mod.moduleScope.firstVariable;
  2205. WHILE variable # NIL DO
  2206. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2207. Symbol(variable, operand);
  2208. register := operand.op;
  2209. CallTraceMethod(register, variable.type);
  2210. ReleaseIntermediateOperand(register);
  2211. END;
  2212. variable := variable.nextVariable;
  2213. END;
  2214. IF backend.hasLinkRegister THEN
  2215. Emit(Pop(Basic.invalidPosition, lr));
  2216. END;
  2217. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2218. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2219. Emit(Br(position,op));
  2220. INC(statCoopTraceModule, section.pc);
  2221. section := previousSection;
  2222. IF dump # NIL THEN dump := section.comments END;
  2223. END CreateTraceModuleMethod;
  2224. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2225. BEGIN
  2226. Emit (Push(position, dst));
  2227. Emit (Push(position, src));
  2228. CallThis(position,"GarbageCollector","Assign", 2);
  2229. END CallAssignPointer;
  2230. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2231. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2232. BEGIN
  2233. IF SemanticChecker.IsPointerType (type) THEN
  2234. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2235. ELSIF type.IsRecordType() THEN
  2236. Emit (Push(position,dst));
  2237. Emit (Push(position,src));
  2238. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2239. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2240. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2241. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2242. ELSIF IsStaticArray(type) THEN
  2243. size := StaticArrayNumElements(type);
  2244. base := StaticArrayBaseType(type);
  2245. IF base.IsRecordType() THEN
  2246. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2247. Emit (Push(position, dst));
  2248. Emit (Push(position, src));
  2249. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2250. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2251. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2252. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2253. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2254. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2255. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2256. Emit (Push(position, dst));
  2257. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2258. Emit (Push(position, src));
  2259. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2260. ELSE
  2261. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2262. Emit (Push(position, dst));
  2263. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2264. Emit (Push(position, src));
  2265. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2266. ASSERT(StaticArrayBaseType(type).IsPointer());
  2267. END;
  2268. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2269. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2270. Emit (Push(position, dst));
  2271. Emit (Push(position, src));
  2272. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2273. ELSE HALT(100); (* missing ? *)
  2274. END;
  2275. END CallAssignMethod;
  2276. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2277. VAR name: Basic.SegmentedName;
  2278. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2279. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2280. context: Context;
  2281. BEGIN
  2282. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2283. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2284. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2285. GetRecordTypeName (recordType,name);
  2286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2287. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2288. section.SetExported (TRUE);
  2289. IF dump # NIL THEN dump := section.comments END;
  2290. IF backend.hasLinkRegister THEN
  2291. Emit(Push(Basic.invalidPosition, lr));
  2292. END;
  2293. variable := recordType.recordScope.firstVariable;
  2294. WHILE variable # NIL DO
  2295. IF variable.NeedsTrace() THEN
  2296. dst := NewRegisterOperand (addressType);
  2297. src := NewRegisterOperand (addressType);
  2298. Emit (Mov(position, dst, parameter1));
  2299. Emit (Mov(position, src, parameter2));
  2300. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2301. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2302. CallAssignMethod(dst, src, variable.type);
  2303. ReleaseIntermediateOperand(src);
  2304. ReleaseIntermediateOperand(dst);
  2305. END;
  2306. variable := variable.nextVariable;
  2307. END;
  2308. recordBase := recordType.GetBaseRecord();
  2309. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2310. IF backend.hasLinkRegister THEN
  2311. Emit(Pop(Basic.invalidPosition, lr));
  2312. END;
  2313. GetRecordTypeName (recordBase,name);
  2314. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2315. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2316. Emit(Br(position,op));
  2317. ELSE
  2318. Emit(Exit(position,0,0, 0));
  2319. END;
  2320. IF ~recordType.isObject THEN
  2321. GetRecordTypeName (recordType,name);
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2323. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2324. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2325. section.SetExported (TRUE);
  2326. NEW(registerUsageCount);
  2327. usedRegisters := NIL;
  2328. dst := NewRegisterOperand (addressType);
  2329. src := NewRegisterOperand (addressType);
  2330. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2331. Emit(Mov(position, dst, parameter1));
  2332. Emit(Mov(position, src, parameter2));
  2333. label := NewLabel();
  2334. SetLabel(label);
  2335. Emit(Push(position, dst));
  2336. Emit(Push(position, src));
  2337. GetRecordTypeName (recordType,name);
  2338. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2339. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2340. Emit(Call(position, op, 0));
  2341. Emit(Pop(position, src));
  2342. Emit(Pop(position, dst));
  2343. Emit(Add(position, dst, dst, ofs));
  2344. Emit(Add(position, src, src, ofs));
  2345. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2346. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2347. Emit(Exit(position,0,0, 0));
  2348. END;
  2349. INC(statCoopAssignProcedure, section.pc);
  2350. ReturnToContext(context);
  2351. IF dump # NIL THEN dump := section.comments END;
  2352. END CreateAssignProcedure;
  2353. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2354. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2355. BEGIN
  2356. IF IsUnsafePointer (type) THEN
  2357. skip := NewLabel();
  2358. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2359. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2360. BreqL (skip, op, nil);
  2361. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2362. SetLabel (skip);
  2363. ELSIF SemanticChecker.IsPointerType (type) THEN
  2364. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2365. CallThis(position,"GarbageCollector","Mark", 1);
  2366. ELSIF type.IsRecordType() THEN
  2367. Emit (Push(position,register));
  2368. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2369. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2370. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2371. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2372. ELSIF IsStaticArray(type) THEN
  2373. size := StaticArrayNumElements(type);
  2374. base := StaticArrayBaseType(type);
  2375. IF base.IsRecordType() THEN
  2376. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2377. Emit (Push(position, register));
  2378. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2380. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2381. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2382. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2383. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2384. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2385. Emit (Push(position, register));
  2386. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2387. ELSE
  2388. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2389. Emit (Push(position, register));
  2390. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2391. ASSERT(base.IsPointer());
  2392. END;
  2393. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2394. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2395. CallThis(position,"GarbageCollector","Mark", 1);
  2396. ELSE HALT(100); (* missing ? *)
  2397. END;
  2398. END CallTraceMethod;
  2399. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2400. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2401. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2402. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2403. BEGIN
  2404. previousSection := section;
  2405. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2406. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2407. GetRecordTypeName (recordType,name);
  2408. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2409. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2410. section.SetExported (TRUE);
  2411. IF dump # NIL THEN dump := section.comments END;
  2412. IF backend.hasLinkRegister THEN
  2413. Emit(Push(Basic.invalidPosition, lr));
  2414. END;
  2415. variable := recordType.recordScope.firstVariable;
  2416. WHILE variable # NIL DO
  2417. IF variable.NeedsTrace() THEN
  2418. register := NewRegisterOperand (addressType);
  2419. Emit (Mov(position,register,parameter1));
  2420. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2421. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2422. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2423. END;
  2424. CallTraceMethod(register, variable.type);
  2425. ReleaseIntermediateOperand(register);
  2426. END;
  2427. variable := variable.nextVariable;
  2428. END;
  2429. recordBase := recordType.GetBaseRecord();
  2430. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2431. recordBase := recordBase.GetBaseRecord();
  2432. END;
  2433. IF recordBase # NIL THEN
  2434. IF backend.hasLinkRegister THEN
  2435. Emit(Pop(Basic.invalidPosition, lr));
  2436. END;
  2437. GetRecordTypeName (recordBase,name);
  2438. IF HasExplicitTraceMethod (recordBase) THEN
  2439. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2440. ELSE
  2441. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2442. END;
  2443. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2444. Emit(Br(position,op));
  2445. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2446. Emit(Exit(position,0,0,0));
  2447. ELSE
  2448. IF backend.hasLinkRegister THEN
  2449. Emit(Pop(Basic.invalidPosition, lr));
  2450. END;
  2451. IF recordType.isObject THEN
  2452. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2453. ELSE
  2454. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2455. END;
  2456. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2457. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2458. Emit(Br(position,op));
  2459. END;
  2460. IF ~recordType.isObject THEN
  2461. GetRecordTypeName (recordType,name);
  2462. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2463. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2464. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2465. section.SetExported (TRUE);
  2466. NEW(registerUsageCount);
  2467. usedRegisters := NIL;
  2468. IF dump # NIL THEN dump := section.comments END;
  2469. register := NewRegisterOperand (addressType);
  2470. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2471. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2472. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2473. END;
  2474. Emit (Push(position,register));
  2475. GetRecordTypeName (recordType,name);
  2476. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2477. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2478. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2479. ReleaseIntermediateOperand(register);
  2480. Emit(Exit(position,0,0,0));
  2481. GetRecordTypeName (recordType,name);
  2482. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2483. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2484. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2485. section.SetExported (TRUE);
  2486. NEW(registerUsageCount);
  2487. usedRegisters := NIL;
  2488. register := NewRegisterOperand (addressType);
  2489. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2490. Emit(Mov(position, register, parameter1));
  2491. label := NewLabel();
  2492. SetLabel(label);
  2493. Emit(Push(position, register));
  2494. GetRecordTypeName (recordType,name);
  2495. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2496. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2497. Emit(Call(position, op, 0));
  2498. Emit(Pop(position, register));
  2499. Emit(Add(position, register, register, ofs));
  2500. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2501. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2502. Emit(Exit(position,0,0,0));
  2503. END;
  2504. INC(statCoopTraceMethod, section.pc);
  2505. ReturnToContext(context);
  2506. IF dump # NIL THEN dump := section.comments END;
  2507. END CreateTraceMethod;
  2508. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2509. VAR name: Basic.SegmentedName;
  2510. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2511. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2512. context: Context;
  2513. BEGIN
  2514. IF recordType.isObject THEN RETURN END;
  2515. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2516. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2517. GetRecordTypeName (recordType,name);
  2518. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2519. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2520. section.SetExported (TRUE);
  2521. IF dump # NIL THEN dump := section.comments END;
  2522. IF backend.hasLinkRegister THEN
  2523. Emit(Push(Basic.invalidPosition, lr));
  2524. END;
  2525. variable := recordType.recordScope.firstVariable;
  2526. WHILE variable # NIL DO
  2527. IF variable.NeedsTrace() THEN
  2528. dst := NewRegisterOperand (addressType);
  2529. Emit (Mov(position, dst, parameter1));
  2530. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2531. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2532. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2533. END;
  2534. CallResetProcedure(dst, nil, variable.type);
  2535. ReleaseIntermediateOperand(dst);
  2536. END;
  2537. variable := variable.nextVariable;
  2538. END;
  2539. recordBase := recordType.GetBaseRecord();
  2540. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2541. IF backend.hasLinkRegister THEN
  2542. Emit(Pop(Basic.invalidPosition, lr));
  2543. END;
  2544. GetRecordTypeName (recordBase,name);
  2545. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2546. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2547. Emit(Br(position,op));
  2548. ELSE
  2549. Emit(Exit(position,0,0, 0));
  2550. END;
  2551. GetRecordTypeName (recordType,name);
  2552. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2553. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2554. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2555. section.SetExported (TRUE);
  2556. NEW(registerUsageCount);
  2557. usedRegisters := NIL;
  2558. dst := NewRegisterOperand (addressType);
  2559. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2560. Emit(Mov(position, dst, parameter1));
  2561. label := NewLabel();
  2562. SetLabel(label);
  2563. Emit(Push(position, dst));
  2564. GetRecordTypeName (recordType,name);
  2565. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2566. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2567. Emit(Call(position, op, 0));
  2568. Emit(Pop(position, dst));
  2569. Emit(Add(position, dst, dst, ofs));
  2570. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2571. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2572. Emit(Exit(position,0,0, 0));
  2573. INC(statCoopResetProcedure, section.pc);
  2574. ReturnToContext(context);
  2575. IF dump # NIL THEN dump := section.comments END;
  2576. END CreateResetProcedure;
  2577. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2578. VAR name: Basic.SegmentedName; context: Context;
  2579. BEGIN
  2580. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2581. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2582. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2583. IF dump # NIL THEN dump := section.comments END;
  2584. IF backend.hasLinkRegister THEN
  2585. Emit(Push(Basic.invalidPosition, lr));
  2586. END;
  2587. Emit(Push(position,fp));
  2588. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2589. ResetVariables(scope);
  2590. Emit(Pop(position,fp));
  2591. Emit(Exit(position,0,0, 0));
  2592. ReturnToContext(context);
  2593. IF dump # NIL THEN dump := section.comments END;
  2594. END CreateResetMethod;
  2595. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2596. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2597. BEGIN
  2598. IF SemanticChecker.IsPointerType (type) THEN
  2599. Emit (Push(position, dest));
  2600. CallThis(position,"GarbageCollector","Reset", 1);
  2601. ELSIF type.IsRecordType() THEN
  2602. Emit (Push(position, dest));
  2603. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2604. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2605. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2606. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2607. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2608. size := GetArrayLength(type, tag);
  2609. base := ArrayBaseType(type);
  2610. IF base.IsRecordType() THEN
  2611. Emit (Push(position, size));
  2612. Emit (Push(position, dest));
  2613. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2614. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2615. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2616. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2617. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2618. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2619. Emit (Push(position, size));
  2620. Emit (Push(position, dest));
  2621. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2622. ELSE
  2623. Emit (Push(position, size));
  2624. Emit (Push(position, dest));
  2625. CallThis(position,"GarbageCollector","ResetArray", 2);
  2626. ASSERT(ArrayBaseType(type).IsPointer());
  2627. END;
  2628. ReleaseIntermediateOperand(size);
  2629. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2630. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2631. Emit (Push(position, dest));
  2632. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2633. ELSE HALT(100); (* missing ? *)
  2634. END;
  2635. END CallResetProcedure;
  2636. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2637. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2638. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2639. VAR operand: Operand;
  2640. BEGIN
  2641. Symbol (symbol, operand);
  2642. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2643. ReleaseOperand(operand);
  2644. END Reset;
  2645. BEGIN
  2646. previousScope := currentScope;
  2647. currentScope := scope;
  2648. pc := section.pc;
  2649. prevOffset := MAX(SIZE);
  2650. variable := scope.firstVariable;
  2651. WHILE variable # NIL DO
  2652. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2653. Reset (variable);
  2654. prevOffset := variable.offsetInBits;
  2655. END;
  2656. variable := variable.nextVariable;
  2657. END;
  2658. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2659. WHILE parameter # NIL DO
  2660. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2661. Reset (parameter);
  2662. END;
  2663. parameter := parameter.nextParameter;
  2664. END;
  2665. INC(statCoopResetVariables, section.pc - pc);
  2666. currentScope := previousScope;
  2667. END ResetVariables;
  2668. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2669. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2670. BEGIN
  2671. type := symbol.type.resolved;
  2672. SaveRegisters();ReleaseUsedRegisters(saved);
  2673. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2674. Symbol(symbol, operand);
  2675. ToMemory(operand.op,addressType,0);
  2676. Emit(Push(position,operand.op));
  2677. IF refer THEN
  2678. CallThis(position,"Heaps","Refer",1);
  2679. ELSE
  2680. CallThis(position,"Heaps","Reset",1);
  2681. END;
  2682. ELSIF type.IsRecordType() THEN
  2683. Symbol(symbol, operand);
  2684. Emit(Push(position,operand.op));
  2685. Emit(Push(position,operand.tag)); (* type desc *)
  2686. IF refer THEN
  2687. CallThis(position,"Heaps","ReferRecord",2);
  2688. ELSE
  2689. CallThis(position,"Heaps","ResetRecord",2);
  2690. END;
  2691. ELSIF IsStaticArray(type) THEN
  2692. size := StaticArrayNumElements(type);
  2693. base := StaticArrayBaseType(type);
  2694. Symbol(symbol, operand);
  2695. arg := TypeDescriptorAdr(base);
  2696. Emit(Push(position,operand.op));
  2697. Emit(Push(position,arg));
  2698. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2699. ReleaseIntermediateOperand(arg);
  2700. IF refer THEN
  2701. CallThis(position,"Heaps","ReferArray",3);
  2702. ELSE
  2703. CallThis(position,"Heaps","ResetArray",3);
  2704. END;
  2705. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2706. size := StaticMathArrayNumElements(type);
  2707. base := StaticMathArrayBaseType(type);
  2708. Symbol(symbol, operand);
  2709. arg := TypeDescriptorAdr(base);
  2710. Emit(Push(position,operand.op));
  2711. Emit(Push(position,arg));
  2712. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2713. ReleaseIntermediateOperand(arg);
  2714. IF refer THEN
  2715. CallThis(position,"Heaps","ReferArray",3);
  2716. ELSE
  2717. CallThis(position,"Heaps","ResetArray",3);
  2718. END;
  2719. ELSIF type IS SyntaxTree.MathArrayType THEN
  2720. Symbol(symbol, operand);
  2721. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2722. Emit (Push(position, operand.op));
  2723. ELSE
  2724. Emit (Push(position, operand.tag));
  2725. END;
  2726. IF refer THEN
  2727. CallThis(position,"Heaps","ReferMathArray", 1);
  2728. ELSE
  2729. CallThis(position,"Heaps","ResetMathArray", 1);
  2730. END;
  2731. ELSIF type IS SyntaxTree.ProcedureType THEN
  2732. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2733. Symbol(symbol, operand);
  2734. Emit (Push(position, operand.tag));
  2735. IF refer THEN
  2736. CallThis(position,"Heaps","Refer", 1);
  2737. ELSE
  2738. CallThis(position,"Heaps","Reset", 1);
  2739. END;
  2740. ELSE HALT(100); (* missing ? *)
  2741. END;
  2742. ReleaseOperand(operand);
  2743. RestoreRegisters(saved);
  2744. END Reset;
  2745. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2746. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2747. BEGIN
  2748. previousScope := currentScope;
  2749. currentScope := scope;
  2750. pc := section.pc;
  2751. IF ~ refer THEN
  2752. variable := scope.firstVariable;
  2753. prevOffset := MAX(SIZE);
  2754. WHILE variable # NIL DO
  2755. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2756. Reset (variable,refer);
  2757. prevOffset := variable.offsetInBits;
  2758. END;
  2759. variable := variable.nextVariable;
  2760. END;
  2761. END;
  2762. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2763. WHILE parameter # NIL DO
  2764. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2765. Reset (parameter,refer);
  2766. END;
  2767. parameter := parameter.nextParameter;
  2768. END;
  2769. INC(statCoopResetVariables, section.pc - pc);
  2770. currentScope := previousScope;
  2771. END ResetVariables2;
  2772. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2773. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2774. VAR op: IntermediateCode.Operand; context: Context;
  2775. BEGIN
  2776. previousSection := section;
  2777. GetCodeSectionNameForSymbol(procedure, name);
  2778. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2779. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2780. IF dump # NIL THEN dump := section.comments END;
  2781. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2782. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2783. Emit(Data(position,op));
  2784. Emit(Data(position,nil));
  2785. IF HasPointers (procedure.procedureScope) THEN
  2786. GetCodeSectionNameForSymbol(procedure, name);
  2787. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2788. ELSE
  2789. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2790. END;
  2791. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2792. Emit(Data(position,op));
  2793. ReturnToContext(context);
  2794. IF dump # NIL THEN dump := section.comments END;
  2795. END CreateProcedureDescriptor;
  2796. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2797. VAR import: SyntaxTree.Import;
  2798. s: Basic.MessageString;
  2799. selfName: SyntaxTree.IdentifierString;
  2800. BEGIN
  2801. moduleScope.ownerModule.GetName(selfName);
  2802. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2803. module := moduleScope.ownerModule
  2804. ELSE
  2805. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2806. IF import = NIL THEN
  2807. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2808. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2809. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2810. s := "Module ";
  2811. Strings.Append(s,moduleName);
  2812. Strings.Append(s," cannot be imported.");
  2813. IF force THEN
  2814. Error(position,s);
  2815. ELSIF canBeLoaded THEN
  2816. IF WarningDynamicLoading THEN
  2817. Strings.Append(s, "=> no dynamic linking.");
  2818. Warning(position, s);
  2819. END;
  2820. canBeLoaded := FALSE;
  2821. END;
  2822. RETURN FALSE
  2823. ELSE
  2824. SELF.module.imports.AddName(moduleName)
  2825. END;
  2826. ELSIF import.module = NIL THEN (* already tried *)
  2827. RETURN FALSE
  2828. END;
  2829. module := import.module;
  2830. END;
  2831. RETURN TRUE
  2832. END AddImport;
  2833. (* needed for old binary object file format*)
  2834. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2835. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2836. BEGIN
  2837. IF AddImport(moduleName,module,TRUE) THEN
  2838. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2839. IF procedure = NIL THEN
  2840. s := "Instruction not supported on target, emulation procedure ";
  2841. Strings.Append(s,moduleName);
  2842. Strings.Append(s,".");
  2843. Strings.Append(s,procedureName);
  2844. Strings.Append(s," not present");
  2845. Error(position,s);
  2846. ELSE
  2847. StaticCallOperand(r,procedure);
  2848. ReleaseOperand(r);
  2849. fp := GetFingerprint(procedure);
  2850. END;
  2851. END;
  2852. END EnsureSymbol;
  2853. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2854. VAR exit: Label; trueL,falseL: Label;
  2855. BEGIN
  2856. trueL := NewLabel();
  2857. falseL := NewLabel();
  2858. exit := NewLabel();
  2859. Condition(x,trueL,falseL);
  2860. InitOperand(result,ModeValue);
  2861. SetLabel(trueL);
  2862. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2863. Emit(Mov(position,result.op,true));
  2864. BrL(exit);
  2865. SetLabel(falseL);
  2866. Emit(MovReplace(position,result.op,false));
  2867. SetLabel(exit);
  2868. END ConditionToValue;
  2869. PROCEDURE ValueToCondition(VAR op: Operand);
  2870. BEGIN
  2871. LoadValue(op,system.booleanType);
  2872. BrneL(trueLabel,op.op, false);
  2873. ReleaseOperand(op);
  2874. BrL(falseLabel);
  2875. END ValueToCondition;
  2876. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2877. VAR size: LONGINT;
  2878. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2879. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2880. BEGIN
  2881. ASSERT(type.form = SyntaxTree.Open);
  2882. baseType := type.arrayBase.resolved;
  2883. IF IsOpenArray(baseType) THEN
  2884. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2885. ELSE
  2886. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2887. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2888. END;
  2889. len := tag;
  2890. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2891. IntermediateCode.MakeMemory(len,addressType);
  2892. UseIntermediateOperand(len);
  2893. Reuse2(res,sizeOperand,len);
  2894. Emit(Mul(position,res,sizeOperand,len));
  2895. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2896. RETURN res
  2897. END GetArraySize;
  2898. BEGIN
  2899. type := type.resolved;
  2900. IF IsOpenArray(type) THEN
  2901. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2902. RETURN tag
  2903. ELSE
  2904. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2905. END;
  2906. ELSE
  2907. size := ToMemoryUnits(system,system.SizeOf(type));
  2908. RETURN IntermediateCode.Immediate(addressType,size)
  2909. END;
  2910. END GetDynamicSize;
  2911. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2912. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2913. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2914. BEGIN
  2915. ASSERT(type.form = SyntaxTree.Open);
  2916. baseType := type.arrayBase.resolved;
  2917. IF IsOpenArray(baseType) THEN
  2918. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2919. ELSE
  2920. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2921. END;
  2922. len := tag;
  2923. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2924. IntermediateCode.MakeMemory(len,addressType);
  2925. UseIntermediateOperand(len);
  2926. Reuse2(res,sizeOperand,len);
  2927. Emit(Mul(position,res,sizeOperand,len));
  2928. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2929. RETURN res
  2930. END GetLength;
  2931. BEGIN
  2932. type := type.resolved;
  2933. IF IsOpenArray(type) THEN
  2934. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2935. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2936. ELSIF type IS SyntaxTree.StringType THEN
  2937. RETURN tag;
  2938. ELSE
  2939. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2940. END;
  2941. END GetArrayLength;
  2942. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2943. VAR result: IntermediateCode.Operand;
  2944. BEGIN
  2945. IF backend.cooperative THEN
  2946. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2947. ELSE
  2948. MakeMemory(result, tag, addressType, 0);
  2949. END;
  2950. RETURN result
  2951. END GetSizeFromTag;
  2952. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2953. VAR parameter: SyntaxTree.Parameter;
  2954. BEGIN
  2955. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2956. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2957. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2958. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2959. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2960. END;
  2961. RETURN GetDynamicSize(e.type, tag);
  2962. END GetArrayOfBytesSize;
  2963. (*
  2964. to find imported symbol. not needed ?
  2965. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2966. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2967. BEGIN
  2968. IF AddImport(moduleName,importedModule,FALSE) THEN
  2969. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2970. RETURN symbol
  2971. ELSE
  2972. RETURN NIL
  2973. END
  2974. END SymbolByName;
  2975. *)
  2976. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2977. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2978. BEGIN
  2979. IF AddImport(moduleName,runtimeModule,force) THEN
  2980. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2981. IF procedure = NIL THEN
  2982. s := "Procedure ";
  2983. Strings.Append(s,moduleName);
  2984. Strings.Append(s,".");
  2985. Strings.Append(s,procedureName);
  2986. Strings.Append(s," not present");
  2987. Error(position,s);
  2988. RETURN FALSE
  2989. ELSE
  2990. RETURN TRUE
  2991. END;
  2992. ELSE RETURN FALSE
  2993. END;
  2994. END GetRuntimeProcedure;
  2995. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2996. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2997. s: Basic.MessageString;
  2998. BEGIN
  2999. Basic.InitSegmentedName(name);
  3000. name[0] := Basic.MakeString(moduleName);
  3001. name[1] := Basic.MakeString(typeName);
  3002. name[2] := -1;
  3003. IF AddImport(moduleName,importedModule, FALSE) THEN
  3004. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3005. IF symbol = NIL THEN
  3006. s := "type ";
  3007. Strings.Append(s,moduleName);
  3008. Strings.Append(s,".");
  3009. Strings.Append(s,typeName);
  3010. Strings.Append(s," not present");
  3011. Error(position,s);
  3012. END;
  3013. ELSE symbol := NIL;
  3014. END;
  3015. IF importedModule = moduleScope.ownerModule THEN
  3016. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3017. ELSE
  3018. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3019. END;
  3020. RETURN symbol
  3021. END GetTypeDescriptor;
  3022. (* 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. *)
  3023. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3024. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3025. pooledName: Basic.SegmentedName; size: LONGINT;
  3026. BEGIN
  3027. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3028. StaticCallOperand(result,procedure);
  3029. IF numberParameters < 0 THEN
  3030. size := ProcParametersSize(procedure);
  3031. ELSE
  3032. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3033. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3034. Error(position,"runtime call parameter count mismatch");
  3035. END;
  3036. END;
  3037. Emit(Call(position, result.op, size));
  3038. ReleaseOperand(result);
  3039. ELSE (* only static linking possible *)
  3040. ASSERT(numberParameters >= 0);
  3041. Basic.InitSegmentedName(pooledName);
  3042. pooledName[0] := Basic.MakeString(moduleName);
  3043. pooledName[1] := Basic.MakeString(procedureName);
  3044. pooledName[2] := -1;
  3045. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3046. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3047. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3048. END;
  3049. END CallThisChecked;
  3050. (* 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. *)
  3051. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3052. BEGIN
  3053. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3054. END CallThis;
  3055. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3056. VAR
  3057. left,right: Operand;
  3058. leftSize, rightSize: IntermediateCode.Operand;
  3059. saved: RegisterEntry;
  3060. reg: IntermediateCode.Operand;
  3061. procedureName: SyntaxTree.IdentifierString;
  3062. BEGIN
  3063. procedureName := "CompareString";
  3064. SaveRegisters();ReleaseUsedRegisters(saved);
  3065. Designate(leftExpression,left);
  3066. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3067. Emit(Push(position,leftSize));
  3068. ReleaseIntermediateOperand(leftSize);
  3069. Emit(Push(position,left.op));
  3070. ReleaseOperand(left);
  3071. Designate(rightExpression,right);
  3072. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3073. Emit(Push(position,rightSize));
  3074. ReleaseIntermediateOperand(rightSize);
  3075. Emit(Push(position,right.op));
  3076. ReleaseOperand(right);
  3077. CallThis(position,builtinsModuleName,procedureName, 4);
  3078. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3079. Emit(Result(position,reg));
  3080. (*
  3081. AcquireThisRegister(int8,IntermediateCode.Result);
  3082. *)
  3083. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3084. (*
  3085. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3086. *)
  3087. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3088. ReleaseIntermediateOperand(reg);
  3089. BrL(falseLabel);
  3090. END CompareString;
  3091. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3092. VAR
  3093. left,right: Operand;
  3094. leftSize, rightSize: IntermediateCode.Operand;
  3095. saved: RegisterEntry;
  3096. procedureName: SyntaxTree.IdentifierString;
  3097. BEGIN
  3098. procedureName := "CopyString";
  3099. SaveRegisters();ReleaseUsedRegisters(saved);
  3100. Designate(leftExpression,left);
  3101. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3102. Emit(Push(position,leftSize));
  3103. ReleaseIntermediateOperand(leftSize);
  3104. Emit(Push(position,left.op));
  3105. ReleaseOperand(left);
  3106. Designate(rightExpression,right);
  3107. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3108. Emit(Push(position,rightSize));
  3109. ReleaseIntermediateOperand(rightSize);
  3110. Emit(Push(position,right.op));
  3111. ReleaseOperand(right);
  3112. CallThis(position,builtinsModuleName,procedureName,4);
  3113. RestoreRegisters(saved);
  3114. END CopyString;
  3115. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3116. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3117. leftType,rightType: SyntaxTree.Type;
  3118. leftExpression,rightExpression : SyntaxTree.Expression;
  3119. componentType: IntermediateCode.Type;
  3120. next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3121. size: LONGINT;
  3122. BEGIN
  3123. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3124. dest := destination; destination := emptyOperand;
  3125. leftType := x.left.type.resolved;
  3126. rightType := x.right.type.resolved;
  3127. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3128. CASE x.operator OF
  3129. Scanner.Or:
  3130. (* shortcut evaluation of left OR right *)
  3131. IF ~conditional THEN ConditionToValue(x);
  3132. ELSE
  3133. next := NewLabel();
  3134. Condition(x.left,trueLabel,next);
  3135. SetLabel(next);
  3136. Condition(x.right,trueLabel,falseLabel);
  3137. END;
  3138. |Scanner.And:
  3139. (* shortcut evaluation of left & right *)
  3140. IF ~conditional THEN ConditionToValue(x);
  3141. ELSE
  3142. next := NewLabel();
  3143. Condition(x.left,next,falseLabel);
  3144. SetLabel(next);
  3145. Condition(x.right,trueLabel,falseLabel);
  3146. END;
  3147. |Scanner.Is:
  3148. IF ~conditional THEN ConditionToValue(x);
  3149. ELSE
  3150. (* get type desc tag *)
  3151. IF IsPointerToRecord(leftType,recordType) THEN
  3152. Evaluate(x.left,left);
  3153. Dereference(left,recordType,IsUnsafePointer(leftType))
  3154. ELSE
  3155. Designate(x.left,left);
  3156. END;
  3157. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel,FALSE);
  3158. ReleaseOperand(left);
  3159. END;
  3160. |Scanner.Plus:
  3161. Evaluate(x.left,left);
  3162. Evaluate(x.right,right);
  3163. IF leftType IS SyntaxTree.SetType THEN
  3164. InitOperand(result,ModeValue);
  3165. Reuse2a(result.op,left.op,right.op,dest);
  3166. Emit(Or(position,result.op,left.op,right.op));
  3167. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3168. InitOperand(result,ModeValue);
  3169. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3170. Reuse2(result.tag,left.tag,right.tag);
  3171. Emit(Add(position,result.op,left.op,right.op));
  3172. Emit(Add(position,result.tag,left.tag,right.tag))
  3173. ELSE
  3174. InitOperand(result,ModeValue);
  3175. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3176. AddInt(result.op, left.op, right.op) ;
  3177. ELSE
  3178. *)
  3179. Reuse2a(result.op,left.op,right.op,dest);
  3180. Emit(Add(position,result.op,left.op,right.op));
  3181. (*
  3182. END;
  3183. *)
  3184. END;
  3185. ReleaseOperand(left); ReleaseOperand(right);
  3186. |Scanner.Minus:
  3187. Evaluate(x.left,left);
  3188. Evaluate(x.right,right);
  3189. IF leftType IS SyntaxTree.SetType THEN
  3190. InitOperand(result,ModeValue);
  3191. Reuse1(result.op,right.op);
  3192. Emit(Not(position,result.op,right.op));
  3193. ReleaseOperand(right);
  3194. Emit(And(position,result.op,result.op,left.op));
  3195. ReleaseOperand(left);
  3196. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3197. InitOperand(result,ModeValue);
  3198. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3199. Reuse2(result.tag,left.tag,right.tag);
  3200. Emit(Sub(position,result.op,left.op,right.op));
  3201. Emit(Sub(position,result.tag,left.tag,right.tag));
  3202. ReleaseOperand(left); ReleaseOperand(right)
  3203. ELSE
  3204. InitOperand(result,ModeValue);
  3205. Reuse2a(result.op,left.op,right.op,dest);
  3206. Emit(Sub(position,result.op,left.op,right.op));
  3207. ReleaseOperand(left); ReleaseOperand(right);
  3208. END;
  3209. |Scanner.Times:
  3210. Evaluate(x.left,left);
  3211. Evaluate(x.right,right);
  3212. IF leftType IS SyntaxTree.SetType THEN
  3213. InitOperand(result,ModeValue);
  3214. Reuse2a(result.op,left.op,right.op,dest);
  3215. Emit(And(position,result.op,left.op,right.op));
  3216. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3217. InitOperand(result, ModeValue);
  3218. componentType := left.op.type;
  3219. (* TODO: review this *)
  3220. (*
  3221. result.op = left.op * right.op - left.tag * right.tag
  3222. result.tag = left.tag * right.op + left.op * right.tag
  3223. *)
  3224. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3225. Emit(Mul(position,result.op, left.op, right.op));
  3226. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3227. Emit(Mul(position,tempReg, left.tag, right.tag));
  3228. Emit(Sub(position,result.op, result.op, tempReg));
  3229. Reuse2(result.tag, left.tag, right.op);
  3230. Emit(Mul(position,result.tag, left.tag, right.op));
  3231. Emit(Mul(position,tempReg, left.op, right.tag));
  3232. Emit(Add(position,result.tag, result.tag, tempReg));
  3233. ReleaseIntermediateOperand(tempReg)
  3234. ELSE
  3235. InitOperand(result,ModeValue);
  3236. Reuse2a(result.op,left.op,right.op,dest);
  3237. Emit(Mul(position,result.op,left.op,right.op));
  3238. END;
  3239. ReleaseOperand(left); ReleaseOperand(right);
  3240. |Scanner.Div:
  3241. Evaluate(x.left,left);
  3242. Evaluate(x.right,right);
  3243. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3244. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3245. IF ~isUnchecked THEN
  3246. exit := NewLabel();
  3247. BrltL(exit,zero,right.op);
  3248. EmitTrap(position,NegativeDivisorTrap);
  3249. SetLabel(exit);
  3250. END;
  3251. END;
  3252. InitOperand(result,ModeValue);
  3253. Reuse2a(result.op,left.op,right.op,dest);
  3254. Emit(Div(position,result.op,left.op,right.op));
  3255. ReleaseOperand(left); ReleaseOperand(right);
  3256. |Scanner.Mod:
  3257. Evaluate(x.left,left);
  3258. Evaluate(x.right,right);
  3259. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3260. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3261. IF ~isUnchecked THEN
  3262. exit := NewLabel();
  3263. BrltL(exit,zero,right.op);
  3264. EmitTrap(position,NegativeDivisorTrap);
  3265. SetLabel(exit);
  3266. END;
  3267. END;
  3268. InitOperand(result,ModeValue);
  3269. Reuse2a(result.op,left.op,right.op,dest);
  3270. Emit(Mod(position,result.op,left.op,right.op));
  3271. ReleaseOperand(left); ReleaseOperand(right);
  3272. |Scanner.Slash:
  3273. Evaluate(x.left,left);
  3274. Evaluate(x.right,right);
  3275. IF leftType IS SyntaxTree.SetType THEN
  3276. InitOperand(result,ModeValue);
  3277. Reuse2a(result.op,left.op,right.op,dest);
  3278. Emit(Xor(position,result.op,left.op,right.op));
  3279. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3280. InitOperand(result,ModeValue);
  3281. componentType := left.op.type;
  3282. (* review this *)
  3283. (*
  3284. divisor = right.op * right.op + right.tag * right.tag
  3285. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3286. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3287. *)
  3288. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3289. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3290. Emit(Mul(position,tempReg, right.op, right.op));
  3291. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3292. Emit(Add(position,tempReg, tempReg, tempReg2));
  3293. result.op := tempReg2;
  3294. Emit(Mul(position,result.op, left.op, right.op));
  3295. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3296. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3297. Emit(Add(position,result.op, result.op, tempReg2));
  3298. Emit(Div(position,result.op, result.op, tempReg));
  3299. Reuse2(result.tag, left.tag, right.op);
  3300. Emit(Mul(position,result.tag, left.tag, right.op));
  3301. Emit(Mul(position,tempReg2, left.op, right.tag));
  3302. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3303. Emit(Div(position,result.tag, result.tag, tempReg));
  3304. ReleaseIntermediateOperand(tempReg);
  3305. ReleaseIntermediateOperand(tempReg2)
  3306. ELSE
  3307. InitOperand(result,ModeValue);
  3308. Reuse2a(result.op,left.op,right.op,dest);
  3309. Emit(Div(position,result.op,left.op,right.op));
  3310. END;
  3311. ReleaseOperand(left); ReleaseOperand(right);
  3312. |Scanner.Equal:
  3313. IF ~conditional THEN ConditionToValue(x);
  3314. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3315. CompareString(BreqL,x.left,x.right);
  3316. ELSE
  3317. Evaluate(x.left,left);
  3318. Evaluate(x.right,right);
  3319. IF leftType IS SyntaxTree.RangeType THEN
  3320. ASSERT(rightType IS SyntaxTree.RangeType);
  3321. BrneL(falseLabel, left.op, right.op); (* first *)
  3322. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3323. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3324. ReleaseOperand(left); ReleaseOperand(right);
  3325. BrL(trueLabel)
  3326. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3327. BrneL(falseLabel, left.op, right.op); (* first *)
  3328. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3329. ReleaseOperand(left); ReleaseOperand(right);
  3330. BrL(trueLabel)
  3331. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3332. (* TODO: review this *)
  3333. BrneL(falseLabel, left.op, right.op); (* real part *)
  3334. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3335. ReleaseOperand(left); ReleaseOperand(right);
  3336. BrL(trueLabel)
  3337. ELSE
  3338. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3339. ReleaseOperand(left); ReleaseOperand(right);
  3340. BrL(trueLabel);
  3341. END;
  3342. END;
  3343. |Scanner.LessEqual:
  3344. IF ~conditional THEN ConditionToValue(x);
  3345. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3346. CompareString(BrgeL,x.right,x.left);
  3347. ELSE
  3348. Evaluate(x.left,left);
  3349. Evaluate(x.right,right);
  3350. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3351. Reuse1(temp.op,right.op);
  3352. Emit(And(position,temp.op,left.op,right.op));
  3353. ReleaseOperand(right);
  3354. BreqL(trueLabel,temp.op,left.op);
  3355. BrL(falseLabel);
  3356. ReleaseOperand(temp);ReleaseOperand(left);
  3357. ELSE
  3358. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3359. ReleaseOperand(left); ReleaseOperand(right);
  3360. BrL(trueLabel);
  3361. END;
  3362. END;
  3363. |Scanner.Less:
  3364. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3365. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3366. leftExpression.SetType(system.booleanType);
  3367. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3368. rightExpression.SetType(system.booleanType);
  3369. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3370. leftExpression.SetType(system.booleanType);
  3371. Expression(leftExpression);
  3372. ELSIF ~conditional THEN ConditionToValue(x);
  3373. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3374. CompareString(BrltL,x.left,x.right);
  3375. ELSE
  3376. Evaluate(x.left,left);
  3377. Evaluate(x.right,right);
  3378. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3379. ReleaseOperand(left); ReleaseOperand(right);
  3380. BrL(trueLabel);
  3381. END;
  3382. |Scanner.Greater:
  3383. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3384. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3385. leftExpression.SetType(system.booleanType);
  3386. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3387. rightExpression.SetType(system.booleanType);
  3388. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3389. leftExpression.SetType(system.booleanType);
  3390. Expression(leftExpression);
  3391. ELSIF ~conditional THEN ConditionToValue(x);
  3392. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3393. CompareString(BrltL,x.right,x.left);
  3394. ELSE
  3395. Evaluate(x.left,left);
  3396. Evaluate(x.right,right);
  3397. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3398. ReleaseOperand(left); ReleaseOperand(right);
  3399. BrL(trueLabel);
  3400. END;
  3401. |Scanner.GreaterEqual:
  3402. IF ~conditional THEN ConditionToValue(x);
  3403. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3404. CompareString(BrgeL,x.left,x.right);
  3405. ELSE
  3406. Evaluate(x.left,left);
  3407. Evaluate(x.right,right);
  3408. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3409. Reuse1(temp.op,left.op);
  3410. Emit(And(position,temp.op,left.op,right.op));
  3411. ReleaseOperand(left);
  3412. BreqL(trueLabel, temp.op,right.op);
  3413. ReleaseOperand(temp); ReleaseOperand(right);
  3414. BrL(falseLabel);
  3415. ELSE
  3416. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3417. ReleaseOperand(left); ReleaseOperand(right);
  3418. BrL(trueLabel);
  3419. END;
  3420. END;
  3421. |Scanner.Unequal:
  3422. IF ~conditional THEN ConditionToValue(x);
  3423. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3424. CompareString(BrneL,x.left,x.right);
  3425. ELSE
  3426. Evaluate(x.left,left);
  3427. Evaluate(x.right,right);
  3428. IF leftType IS SyntaxTree.RangeType THEN
  3429. ASSERT(rightType IS SyntaxTree.RangeType);
  3430. BrneL(trueLabel, left.op, right.op); (* first *)
  3431. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3432. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3433. ReleaseOperand(left); ReleaseOperand(right);
  3434. BrL(falseLabel)
  3435. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3436. BrneL(trueLabel, left.op, right.op); (* first *)
  3437. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3438. ReleaseOperand(left); ReleaseOperand(right);
  3439. BrL(falseLabel)
  3440. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3441. (* TODO: review this *)
  3442. BrneL(trueLabel, left.op, right.op); (* real part *)
  3443. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3444. ReleaseOperand(left); ReleaseOperand(right);
  3445. BrL(falseLabel)
  3446. ELSE
  3447. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3448. ReleaseOperand(left); ReleaseOperand(right);
  3449. BrL(trueLabel);
  3450. END;
  3451. END;
  3452. |Scanner.In:
  3453. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3454. Evaluate(x.left,left);
  3455. Evaluate(x.right,right);
  3456. Convert(left.op,setType);
  3457. Convert(right.op,setType);
  3458. ReuseCopy(temp.op,right.op);
  3459. Emit(Shr(position,temp.op,temp.op,left.op));
  3460. ReleaseOperand(right); ReleaseOperand(left);
  3461. IntermediateCode.InitImmediate(one,setType,1);
  3462. Emit(And(position,temp.op,temp.op,one));
  3463. IF conditional THEN
  3464. IntermediateCode.InitImmediate(zero,setType,0);
  3465. BrneL(trueLabel,temp.op,zero);
  3466. ReleaseOperand(temp);
  3467. BrL(falseLabel);
  3468. ELSE
  3469. Convert(temp.op,bool);
  3470. result.mode := ModeValue;
  3471. result.op := temp.op;
  3472. result.tag := nil; (* may be left over from calls to evaluate *)
  3473. END;
  3474. ELSE
  3475. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3476. IF x.operator = Scanner.Questionmarks THEN
  3477. leftExpression := x.left;
  3478. rightExpression := x.right;
  3479. ELSE
  3480. leftExpression := x.right;
  3481. rightExpression := x.left;
  3482. END;
  3483. Evaluate(leftExpression, left);
  3484. Emit(Push(position,left.op));
  3485. ReleaseOperand(left);
  3486. Designate(rightExpression, right);
  3487. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3488. IF ~backend.cellsAreObjects THEN
  3489. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3490. END;
  3491. Emit(Push(position,right.op));
  3492. ReleaseOperand(right);
  3493. IF backend.cellsAreObjects THEN
  3494. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3495. ELSE
  3496. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3497. END;
  3498. InitOperand(result, ModeValue);
  3499. result.op := NewRegisterOperand(bool);
  3500. Emit(Result(position,result.op));
  3501. IF conditional THEN
  3502. IntermediateCode.InitImmediate(zero,setType,0);
  3503. BrneL(trueLabel,result.op,zero);
  3504. ReleaseOperand(result);
  3505. BrL(falseLabel);
  3506. END;
  3507. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3508. leftExpression := x.left;
  3509. rightExpression := x.right;
  3510. Evaluate(leftExpression, left);
  3511. Emit(Push(position,left.op));
  3512. ReleaseOperand(left);
  3513. Evaluate(rightExpression, right);
  3514. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3515. IF ~backend.cellsAreObjects THEN
  3516. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3517. END;
  3518. Emit(Push(position,right.op));
  3519. ReleaseOperand(right);
  3520. IF backend.cellsAreObjects THEN
  3521. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3522. ELSE
  3523. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3524. END;
  3525. InitOperand(result, ModeValue);
  3526. result.op := NewRegisterOperand(bool);
  3527. Emit(Result(position,result.op));
  3528. IF conditional THEN
  3529. IntermediateCode.InitImmediate(zero,setType,0);
  3530. BrneL(trueLabel,result.op,zero);
  3531. ReleaseOperand(result);
  3532. BrL(falseLabel);
  3533. END;
  3534. ELSE
  3535. HALT(100);
  3536. END;
  3537. END;
  3538. destination := dest;
  3539. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3540. END VisitBinaryExpression;
  3541. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3542. VAR localResult, operand: Operand;
  3543. BEGIN
  3544. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3545. InitOperand(localResult, ModeValue);
  3546. ASSERT(x.first # NIL);
  3547. Evaluate(x.first, operand);
  3548. localResult.op := operand.op;
  3549. ReleaseOperand(operand);
  3550. UseIntermediateOperand(localResult.op);
  3551. ASSERT(x.last # NIL);
  3552. Evaluate(x.last, operand);
  3553. localResult.tag := operand.op;
  3554. ReleaseOperand(operand);
  3555. UseIntermediateOperand(localResult.tag);
  3556. IF x.step # NIL THEN
  3557. Evaluate(x.step, operand);
  3558. localResult.extra := operand.op;
  3559. ReleaseOperand(operand);
  3560. UseIntermediateOperand(localResult.extra);
  3561. END;
  3562. result := localResult;
  3563. IF Trace THEN TraceExit("VisitRangeExpression") END
  3564. END VisitRangeExpression;
  3565. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3566. BEGIN
  3567. HALT(100); (* should never be evaluated *)
  3568. END VisitTensorRangeExpression;
  3569. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3570. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3571. BEGIN
  3572. IF Trace THEN TraceEnter("VisitConversion") END;
  3573. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3574. dest := destination; destination := emptyOperand;
  3575. Evaluate(x.expression,old);
  3576. InitOperand(result,ModeValue);
  3577. result.op := old.op;
  3578. ASSERT(result.op.mode # 0);
  3579. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3580. (* convert TO a complex number *)
  3581. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3582. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3583. ASSERT(result.op.mode # 0);
  3584. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3585. (* convert FROM a complex number TO a complex number*)
  3586. result.tag := old.tag;
  3587. ASSERT(result.tag.mode # 0);
  3588. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3589. ASSERT(result.tag.mode # 0)
  3590. ELSE
  3591. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3592. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3593. END
  3594. ELSE
  3595. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3596. ASSERT(result.op.mode # 0);
  3597. result.tag := old.tag; (*! probably never used *)
  3598. END;
  3599. destination := dest;
  3600. IF Trace THEN TraceExit("VisitConversion") END;
  3601. END VisitConversion;
  3602. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3603. BEGIN
  3604. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3605. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3606. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3607. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3608. END VisitTypeDeclaration;
  3609. (** designators (expressions) *)
  3610. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3611. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3612. BEGIN
  3613. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3614. IF x.left # NIL THEN Expression(x.left) END;
  3615. Symbol(x.symbol,result);
  3616. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3617. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3618. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3619. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3620. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3621. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3622. END;
  3623. END;
  3624. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3625. END VisitSymbolDesignator;
  3626. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3627. BEGIN
  3628. IF isUnchecked THEN RETURN END;
  3629. IF tagsAvailable THEN
  3630. TrapC(BrltL,index,length,IndexCheckTrap);
  3631. END;
  3632. END BoundCheck;
  3633. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3634. VAR d: IntermediateCode.Operand;
  3635. BEGIN
  3636. IF isUnchecked THEN RETURN END;
  3637. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3638. TrapC(op,dim,d,ArraySizeTrap);
  3639. ReleaseIntermediateOperand(d);
  3640. END DimensionCheck;
  3641. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3642. VAR
  3643. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3644. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3645. expression: SyntaxTree.Expression;
  3646. resultingType, leftType, baseType: SyntaxTree.Type;
  3647. skipLabel1: Label;
  3648. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3649. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3650. variableOp: Operand;
  3651. variable: SyntaxTree.Variable;
  3652. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3653. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3654. VAR e: SyntaxTree.Expression; i: LONGINT;
  3655. BEGIN
  3656. tensorFound := FALSE;
  3657. FOR i := 0 TO parameters.Length()-1 DO
  3658. e := parameters.GetExpression(i);
  3659. IF e IS SyntaxTree.TensorRangeExpression THEN
  3660. ASSERT(~tensorFound);
  3661. tensorFound := TRUE;
  3662. ELSIF e IS SyntaxTree.RangeExpression THEN
  3663. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3664. ELSE
  3665. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3666. END;
  3667. END;
  3668. END CountIndices;
  3669. BEGIN
  3670. ASSERT(tagsAvailable);
  3671. resultingType := x.type.resolved; (* resulting type *)
  3672. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3673. InitOperand(localResult, ModeReference);
  3674. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3675. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3676. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3677. (* a globally defined array destination tag is available -> use and invalidate it*)
  3678. localResult.tag := arrayDestinationTag;
  3679. IntermediateCode.InitOperand(arrayDestinationTag)
  3680. ELSE
  3681. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3682. (* the result is of array range type and thus does not provide any collectable pointers *)
  3683. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3684. Symbol(variable, variableOp);
  3685. ReuseCopy(localResult.tag, variableOp.op);
  3686. ReleaseOperand(variableOp);
  3687. END
  3688. END;
  3689. indexListSize := x.parameters.Length();
  3690. CountIndices(x.parameters);
  3691. (*ASSERT(tensorRangeCount <= 1);*)
  3692. (* designate the array to be indexed over, perform tensor range check if known *)
  3693. Designate(x.left, array);
  3694. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3695. Dereference(array, leftType,FALSE);
  3696. IF ~tensorFound THEN
  3697. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3698. END
  3699. END;
  3700. (* default base offset *)
  3701. srcDimOffset := 0;
  3702. destDimOffset := 0;
  3703. indexDim := 0;
  3704. (* use address of source array as basis *)
  3705. localResult.op := array.op;
  3706. UseIntermediateOperand(localResult.op);
  3707. (* go through the index list *)
  3708. FOR i := 0 TO indexListSize - 1 DO
  3709. expression := x.parameters.GetExpression(i);
  3710. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3711. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3712. srcDimOffset := -indexListSize;
  3713. destDimOffset := -suffixRanges;
  3714. ELSE
  3715. (* determine which dimension of source array is currently looked at *)
  3716. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3717. (* get the memory operand pointing to array descriptor dimension *)
  3718. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3719. (* make a reusable register from it *)
  3720. ReuseCopy(srcDim, tmp);
  3721. ReleaseIntermediateOperand(tmp);
  3722. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3723. ELSE
  3724. srcDim := IntermediateCode.Immediate(sizeType, i);
  3725. END;
  3726. (* get length and increment of source array for current dimension *)
  3727. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3728. Convert(sourceLength.op, sizeType);
  3729. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3730. Convert(sourceIncrement.op, sizeType);
  3731. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3732. ReleaseIntermediateOperand(srcDim);
  3733. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3734. (* SINGLE INDEX *)
  3735. Evaluate(expression, index);
  3736. ReleaseIntermediateOperand(index.tag);
  3737. index.tag := emptyOperand;
  3738. Convert(index.op, sizeType);
  3739. (* lower bound check *)
  3740. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3741. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3742. ELSIF isUnchecked THEN (* do nothing *)
  3743. ELSE
  3744. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3745. END;
  3746. (* upper bound check *)
  3747. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3748. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3749. ELSIF isUnchecked THEN (* do nothing *)
  3750. ELSE
  3751. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3752. END;
  3753. ReleaseOperand(sourceLength);
  3754. Convert(index.op, addressType);
  3755. summand := index.op;
  3756. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3757. (* RANGE OF INDICES *)
  3758. Evaluate(expression, range);
  3759. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3760. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3761. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3762. ReleaseOperand(range);
  3763. Convert(firstIndex, sizeType);
  3764. Convert(lastIndex, sizeType);
  3765. Convert(stepSize, sizeType);
  3766. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3767. if it is 'MAX(LONGINT)' *)
  3768. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3769. TransferToRegister(lastIndex, lastIndex);
  3770. skipLabel1 := NewLabel();
  3771. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3772. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3773. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3774. SetLabel(skipLabel1)
  3775. END;
  3776. (* check if step size is valid *)
  3777. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3778. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3779. ELSIF isUnchecked THEN (* do nothing *)
  3780. ELSE
  3781. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3782. END;
  3783. (* check lower bound check *)
  3784. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3785. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3786. ELSIF isUnchecked THEN (* do nothing *)
  3787. ELSE
  3788. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3789. END;
  3790. (* check upper bound check *)
  3791. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3792. (* statically open range: nothing to do *)
  3793. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3794. ASSERT(staticLastIndex < staticSourceLength)
  3795. ELSIF isUnchecked THEN (* do nothing *)
  3796. ELSE
  3797. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3798. END;
  3799. (* determine length of target array for current dimension *)
  3800. (* 1. incorporate last index: *)
  3801. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3802. (* last index is static *)
  3803. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3804. targetLength := sourceLength.op
  3805. ELSE
  3806. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3807. END;
  3808. UseIntermediateOperand(targetLength);
  3809. ELSE
  3810. (* targetLength := lastIndex + 1
  3811. Reuse1(targetLength, lastIndex);
  3812. *)
  3813. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3814. END;
  3815. ReleaseOperand(sourceLength);
  3816. ReleaseIntermediateOperand(lastIndex);
  3817. (* 2. incorporate first index: *)
  3818. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3819. (* first index and current target length are static *)
  3820. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3821. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3822. (* first index = 0: nothing to do *)
  3823. ELSE
  3824. (* targetLength := targetLength - firstIndex *)
  3825. TransferToRegister(targetLength, targetLength);
  3826. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3827. END;
  3828. (* clip negative lengths to 0 *)
  3829. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3830. IF staticTargetLength < 0 THEN
  3831. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3832. END
  3833. ELSE
  3834. skipLabel1 := NewLabel();
  3835. TransferToRegister(targetLength, targetLength);
  3836. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3837. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3838. SetLabel(skipLabel1)
  3839. END;
  3840. (* 3. incorporate index step size: *)
  3841. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3842. (*step size and current target length are static *)
  3843. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3844. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3845. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3846. (* step size = 1: nothing to do *)
  3847. ELSE
  3848. (* emit code for this:
  3849. targetLength := (targetLength-1) DIV stepSize +1;
  3850. *)
  3851. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3852. DivInt(targetLength, targetLength, stepSize);
  3853. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3854. END;
  3855. (* determine increment of target array for current dimension *)
  3856. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3857. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3858. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3859. (* step size = 1 *)
  3860. targetIncrement := sourceIncrement.op;
  3861. UseIntermediateOperand(targetIncrement)
  3862. ELSE
  3863. (* targetIncrement := sourceIncrement * stepSize *)
  3864. Reuse1(targetIncrement, stepSize);
  3865. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3866. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3867. END;
  3868. ReleaseIntermediateOperand(stepSize);
  3869. (* write length and increment of target array to descriptor *)
  3870. IF destDimOffset < 0 THEN
  3871. (* determine which dimension of target array is currently looked at *)
  3872. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3873. TransferToRegister(destDim, tmp);
  3874. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3875. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3876. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3877. ReleaseIntermediateOperand(destDim);
  3878. INC(destDimOffset);
  3879. ELSE
  3880. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3881. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3882. END;
  3883. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3884. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3885. INC(indexDim);
  3886. Convert(firstIndex, addressType);
  3887. TransferToRegister(summand, firstIndex);
  3888. ELSE HALT(100);
  3889. END;
  3890. (*
  3891. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3892. *)
  3893. Convert(sourceIncrement.op, addressType);
  3894. Convert(summand, addressType);
  3895. MulInt(summand, summand, sourceIncrement.op);
  3896. ReleaseIntermediateOperand(sourceIncrement.op);
  3897. AddInt(localResult.op, localResult.op, summand);
  3898. ReleaseIntermediateOperand(summand);
  3899. END
  3900. END;
  3901. result := localResult;
  3902. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3903. ReleaseIntermediateOperand(result.tag);
  3904. result.tag := TypeDescriptorAdr(resultingType);
  3905. ELSIF IsDelegate(resultingType) THEN
  3906. ReleaseIntermediateOperand(result.tag);
  3907. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3908. UseIntermediateOperand(result.tag);
  3909. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3910. ReleaseIntermediateOperand(result.tag);
  3911. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3912. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3913. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3914. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3915. (* finalize target array descriptor *)
  3916. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3917. (* write lengths and increments of target array for remaining dimensions *)
  3918. i := indexListSize;
  3919. WHILE indexDim < targetArrayDimensionality DO
  3920. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3921. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3922. ReleaseOperand(sourceLength);
  3923. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3924. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3925. ReleaseOperand(sourceIncrement);
  3926. INC(i); INC(indexDim);
  3927. END;
  3928. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3929. tmp := nil;
  3930. ELSE
  3931. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3932. END;
  3933. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3934. ReleaseIntermediateOperand(tmp);
  3935. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3936. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3937. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3938. ELSE
  3939. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3940. END;
  3941. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3942. ReleaseIntermediateOperand(tmp);
  3943. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3944. (* write dimensionality *)
  3945. IF targetArrayDimensionality # 0 THEN
  3946. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3947. END;
  3948. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3949. END;
  3950. ReleaseOperand(array);
  3951. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3952. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3953. END;
  3954. END MathIndexDesignator;
  3955. (* get the length of an array , trying to make use of static information *)
  3956. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3957. VAR res: IntermediateCode.Operand; size: LONGINT;
  3958. BEGIN
  3959. type := type.resolved;
  3960. IF type IS SyntaxTree.ArrayType THEN
  3961. WITH type: SyntaxTree.ArrayType DO
  3962. IF type.form = SyntaxTree.Static THEN
  3963. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3964. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3965. Evaluate(type.length, op);
  3966. ReleaseIntermediateOperand(op.tag);
  3967. RETURN op.op;*)
  3968. ELSE
  3969. res := tag;
  3970. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3971. IntermediateCode.MakeMemory(res,addressType);
  3972. UseIntermediateOperand(res);
  3973. RETURN res
  3974. END
  3975. END;
  3976. ELSE
  3977. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3978. RETURN IntermediateCode.Immediate(addressType,size);
  3979. END;
  3980. END ArrayLength;
  3981. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3982. BEGIN
  3983. IF IsImmediate(x) THEN
  3984. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3985. ELSE
  3986. IF ~ReusableRegister(res) THEN
  3987. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3988. ELSE
  3989. UseIntermediateOperand(res);
  3990. END;
  3991. Emit(Mov(position,res,x))
  3992. END;
  3993. END CopyInt;
  3994. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3995. BEGIN
  3996. ReleaseIntermediateOperand(res);
  3997. IF IsImmediate(x) & IsImmediate(y) THEN
  3998. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3999. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4000. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4001. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4002. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4003. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4004. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4005. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4006. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4007. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4008. UseIntermediateOperand(res);
  4009. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4010. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4011. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4012. UseIntermediateOperand(res);
  4013. ELSE
  4014. IF ~ReusableRegister(res) THEN
  4015. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4016. ELSE
  4017. UseIntermediateOperand(res);
  4018. END;
  4019. IF IsImmediate(x) & (x.intValue = 0) THEN
  4020. Emit(Mov(position,res,y))
  4021. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4022. Emit(Mov(position,res,x))
  4023. ELSE
  4024. Emit(Add(position,res, x, y));
  4025. END;
  4026. END;
  4027. END AddInt;
  4028. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4029. BEGIN
  4030. ReleaseIntermediateOperand(res);
  4031. IF IsImmediate(x) & IsImmediate(y) THEN
  4032. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4033. ELSE
  4034. IF ~ReusableRegister(res) THEN
  4035. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4036. ELSE UseIntermediateOperand(res);
  4037. END;
  4038. IF IsImmediate(x) & (x.intValue = 1) THEN
  4039. Emit(Mov(position,res,y))
  4040. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4041. Emit(Mov(position,res,x))
  4042. ELSE
  4043. Emit(Mul(position,res, x, y));
  4044. END;
  4045. END;
  4046. END MulInt;
  4047. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4048. BEGIN
  4049. ReleaseIntermediateOperand(res);
  4050. IF IsImmediate(x) & IsImmediate(y) THEN
  4051. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4052. ELSE
  4053. IF ~ReusableRegister(res) THEN
  4054. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4055. ELSE UseIntermediateOperand(res);
  4056. END;
  4057. IF IsImmediate(x) & (x.intValue = 1) THEN
  4058. Emit(Mov(position,res,y))
  4059. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4060. Emit(Mov(position,res,x))
  4061. ELSE
  4062. Emit(Div(position,res, x, y));
  4063. END;
  4064. END;
  4065. END DivInt;
  4066. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4067. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4068. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4069. BEGIN
  4070. type := x.left.type.resolved;
  4071. IF type IS SyntaxTree.StringType THEN
  4072. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4073. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4074. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4075. type := atype;
  4076. x.left.SetType(type);
  4077. END;
  4078. IntermediateCode.InitImmediate(res,addressType,0);
  4079. maxDim := x.parameters.Length()-1;
  4080. (*
  4081. computation rule:
  4082. a: ARRAY X,Y,Z OF Element with size S
  4083. a[i,j,k] -->
  4084. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4085. *)
  4086. FOR i := 0 TO maxDim DO
  4087. e := x.parameters.GetExpression(i);
  4088. Evaluate(e,index);
  4089. Convert(index.op,addressType);
  4090. AddInt(res, res, index.op);
  4091. IF i = 0 THEN
  4092. (*
  4093. ReuseCopy(res, index.op);
  4094. *)
  4095. Designate(x.left,array);
  4096. type := x.left.type.resolved;
  4097. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4098. Dereference(array, type, FALSE);
  4099. END;
  4100. (*
  4101. ELSE AddInt(res, res, index.op);
  4102. *)
  4103. END;
  4104. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4105. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4106. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4107. BoundCheck(index.op, length);
  4108. END;
  4109. ReleaseIntermediateOperand(length);
  4110. END;
  4111. ReleaseOperand(index);
  4112. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4113. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4114. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4115. MulInt(res,res,length);
  4116. END;
  4117. ReleaseIntermediateOperand(length);
  4118. END;
  4119. (* remaining open dimensions -- compute address *)
  4120. i := maxDim+1;
  4121. IF type IS SyntaxTree.ArrayType THEN
  4122. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4123. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4124. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4125. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4126. MulInt(res,res,length);
  4127. END;
  4128. ReleaseIntermediateOperand(length);
  4129. INC(i);
  4130. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4131. END;
  4132. END;
  4133. IF (type IS SyntaxTree.ArrayType) THEN
  4134. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4135. size := StaticSize(system, type);
  4136. IF size # 1 THEN
  4137. length := IntermediateCode.Immediate(addressType,size);
  4138. MulInt(res,res,length);
  4139. END;
  4140. ELSE
  4141. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4142. IF size # 1 THEN
  4143. length := IntermediateCode.Immediate(addressType,size);
  4144. MulInt(res,res,length);
  4145. END;
  4146. END;
  4147. END;
  4148. AddInt(res,res,array.op);
  4149. InitOperand(result,ModeReference);
  4150. result.op := res;
  4151. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4152. ReleaseIntermediateOperand(result.tag);
  4153. result.tag := TypeDescriptorAdr(type);
  4154. ELSIF IsDelegate(type) THEN
  4155. ReleaseIntermediateOperand(result.tag);
  4156. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4157. UseIntermediateOperand(result.tag);
  4158. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4159. ReleaseIntermediateOperand(result.tag);
  4160. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4161. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4162. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4163. END;
  4164. ReleaseOperand(array);
  4165. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4166. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4167. END;
  4168. END IndexDesignator;
  4169. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4170. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4171. BEGIN
  4172. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4173. dest := destination; destination := emptyOperand;
  4174. type := x.left.type.resolved;
  4175. IF type IS SyntaxTree.MathArrayType THEN
  4176. MathIndexDesignator(x);
  4177. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4178. IndexDesignator(x);
  4179. END;
  4180. destination := dest;
  4181. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4182. END VisitIndexDesignator;
  4183. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4184. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4185. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4186. procedure: SyntaxTree.Procedure;
  4187. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4188. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4189. BEGIN
  4190. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4191. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4192. parameters := expression.parameters;
  4193. moduleName := "FoxArrayBase";
  4194. procedureName := "CopyDescriptor";
  4195. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4196. SaveRegisters();ReleaseUsedRegisters(saved);
  4197. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4198. IF procedure = NIL THEN
  4199. s := "procedure ";
  4200. Strings.Append(s,moduleName);
  4201. Strings.Append(s,".");
  4202. Strings.Append(s,procedureName);
  4203. Strings.Append(s," not present");
  4204. Error(position,s);
  4205. ELSE
  4206. (* push address of temporary variable *)
  4207. Symbol(variable,destOperand);
  4208. Emit(Push(position,destOperand.op));
  4209. ReleaseOperand(destOperand);
  4210. (* push src *)
  4211. Evaluate(expression.left,srcOperand);
  4212. (*
  4213. Dereference(srcOperand,expression.type.resolved);
  4214. Emit(Push(position,srcOperand.tag));
  4215. *)
  4216. Emit(Push(position,srcOperand.op));
  4217. ReleaseOperand(srcOperand);
  4218. tensorFound := FALSE;
  4219. FOR i := 0 TO parameters.Length()-1 DO
  4220. e := parameters.GetExpression(i);
  4221. IF e IS SyntaxTree.TensorRangeExpression THEN
  4222. tensorFound := TRUE;
  4223. ELSIF e IS SyntaxTree.RangeExpression THEN
  4224. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4225. ELSE
  4226. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4227. END;
  4228. END;
  4229. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4230. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4231. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4232. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4233. StaticCallOperand(procOp,procedure);
  4234. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4235. ReleaseOperand(procOp);
  4236. END;
  4237. RestoreRegisters(saved);
  4238. END;
  4239. RETURN variable
  4240. END PrepareTensorDescriptor;
  4241. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4242. VAR
  4243. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4244. operand, tmpOperand, variableOp, variable2Op: Operand;
  4245. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4246. variable, variable2: SyntaxTree.Variable;
  4247. dim, i, size: LONGINT;
  4248. (* TODO: needed? *)
  4249. oldArrayDestinationTag: IntermediateCode.Operand;
  4250. oldArrayDestinationDimension: LONGINT;
  4251. position: Position;
  4252. saved: RegisterEntry;
  4253. arrayFlags: SET;
  4254. m, n: LONGINT;
  4255. PROCEDURE Pass(op: IntermediateCode.Operand);
  4256. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4257. BEGIN
  4258. IF register >= 0 THEN
  4259. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4260. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4261. Emit(Mov(position,parameterRegister, op));
  4262. ELSE
  4263. Emit(Push(position,op))
  4264. END
  4265. END Pass;
  4266. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4267. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4268. BEGIN
  4269. formalType := formalType.resolved; actualType := actualType.resolved;
  4270. IF IsOpenArray(formalType)THEN
  4271. IF actualType IS SyntaxTree.StringType THEN
  4272. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4273. RETURN;
  4274. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4275. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4276. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4277. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4278. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4279. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4280. ELSE
  4281. tmp := baseReg;
  4282. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4283. IntermediateCode.MakeMemory(tmp,addressType);
  4284. Pass((tmp));
  4285. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4286. END;
  4287. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4288. END;
  4289. END PushArrayLens;
  4290. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4291. BEGIN
  4292. CASE size OF
  4293. |2: INCL(flags,Size2Flag);
  4294. |3: INCL(flags,Size3Flag);
  4295. |4: INCL(flags,Size4Flag);
  4296. |5: INCL(flags,Size5Flag);
  4297. |6: INCL(flags,Size6Flag);
  4298. |7: INCL(flags,Size7Flag);
  4299. |8: INCL(flags,Size8Flag);
  4300. END;
  4301. END SetSmallArraySizeFlag;
  4302. BEGIN
  4303. IF Trace THEN TraceEnter("PushParameter") END;
  4304. position := expression.position;
  4305. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4306. type := expression.type.resolved;
  4307. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4308. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4309. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4310. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4311. );
  4312. (* TODO: needed? *)
  4313. oldArrayDestinationTag := arrayDestinationTag;
  4314. oldArrayDestinationDimension := arrayDestinationDimension;
  4315. IF IsArrayOfSystemByte(parameter.type) THEN
  4316. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4317. Designate(expression,operand);
  4318. ELSE
  4319. Evaluate(expression, tmpOperand);
  4320. (* array of system byte does not provide any pointers *)
  4321. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4322. Symbol(variable, operand);
  4323. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4324. Emit(Mov(position,tmp, tmpOperand.op));
  4325. ReleaseOperand(tmpOperand);
  4326. END;
  4327. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4328. ReleaseIntermediateOperand(operand.tag);
  4329. operand.tag := tmp;
  4330. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4331. Pass((operand.tag));
  4332. END;
  4333. Pass((operand.op));
  4334. ELSIF IsOpenArray(parameter.type) THEN
  4335. Designate(expression,operand);
  4336. baseReg := operand.tag;
  4337. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4338. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4339. END;
  4340. Pass((operand.op)); (* address of the array *)
  4341. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4342. (* case 1
  4343. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4344. *)
  4345. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4346. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4347. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4348. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4349. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4350. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4351. arrayDestinationTag := sp;
  4352. (* case 1b
  4353. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4354. *)
  4355. IF expression IS SyntaxTree.IndexDesignator THEN
  4356. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4357. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4358. arrayDestinationDimension := dim;
  4359. Designate(expression,operand);
  4360. (* case 1a
  4361. P(...,A,...) push: push array descriptor to stack
  4362. *)
  4363. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4364. Designate(expression,operand);
  4365. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4366. i := 0;
  4367. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4368. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4369. INC(i);
  4370. END;
  4371. type := expression.type.resolved;
  4372. WHILE (i<dim) DO (* remaining static dimensions *)
  4373. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4374. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4375. ReleaseOperand(tmpOperand);
  4376. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4377. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4378. ReleaseOperand(tmpOperand);
  4379. INC(i);
  4380. END;
  4381. dimOp := IntermediateCode.Immediate(addressType,dim);
  4382. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4383. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4384. (* case 1d
  4385. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4386. + case 1e
  4387. P(.. PT() ... );
  4388. *)
  4389. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4390. Designate(expression,operand);
  4391. Dereference(operand,type.resolved,FALSE);
  4392. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4393. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4394. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4395. (* case 1f
  4396. P(...,S,...) push: create array descriptor to S on stack
  4397. case 1g
  4398. P(... PS()...)
  4399. *)
  4400. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4401. Designate(expression,operand);
  4402. FOR i := 0 TO dim-1 DO
  4403. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4404. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4405. ReleaseOperand(tmpOperand);
  4406. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4407. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4408. ReleaseOperand(tmpOperand);
  4409. END;
  4410. (*******
  4411. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4412. *)
  4413. arrayFlags := {StaticFlag};
  4414. IF dim = 1 THEN
  4415. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4416. ReleaseOperand(tmpOperand);
  4417. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4418. m := LONGINT(tmpOperand.op.intValue);
  4419. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4420. ELSIF dim = 2 THEN
  4421. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4422. ReleaseOperand(tmpOperand);
  4423. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4424. m := LONGINT(tmpOperand.op.intValue);
  4425. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4426. ReleaseOperand(tmpOperand);
  4427. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4428. n := LONGINT(tmpOperand.op.intValue);
  4429. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4430. INCL(arrayFlags,SmallMatrixFlag);
  4431. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4432. END;
  4433. END;
  4434. (*******)
  4435. dimOp := IntermediateCode.Immediate(addressType,dim);
  4436. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4437. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4438. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4439. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4440. baseType := SemanticChecker.ArrayBase(type,dim);
  4441. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4442. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4443. ELSE HALT(100);
  4444. END;
  4445. (* case 2
  4446. procedure P([left args], var A: array [*,*] of Type, [right args])
  4447. *)
  4448. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4449. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4450. (* case 2b
  4451. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4452. push: push reference to pushed array descriptor
  4453. post: remove array descriptor.
  4454. *)
  4455. IF expression IS SyntaxTree.IndexDesignator THEN
  4456. descriptorType := GetMathArrayDescriptorType(dim);
  4457. (* range type : no allocation possible, should be untraced *)
  4458. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4459. Symbol(variable,variableOp);
  4460. arrayDestinationTag := variableOp.op;
  4461. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4462. arrayDestinationDimension := dim;
  4463. NeedDescriptor := TRUE;
  4464. Designate(expression,operand);
  4465. Pass((operand.tag));
  4466. NeedDescriptor := FALSE;
  4467. (* case 2a
  4468. P(...,A,...)
  4469. push: push reference to array descriptor on stack
  4470. *)
  4471. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4472. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4473. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4474. INC(i);
  4475. END;
  4476. IF i = dim THEN
  4477. Designate(expression,operand);
  4478. Pass((operand.tag));
  4479. ELSE (* open-static *)
  4480. type := expression.type.resolved;
  4481. descriptorType := GetMathArrayDescriptorType(dim);
  4482. (* static array , cannot be reallocated, untraced !*)
  4483. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4484. Symbol(variable,variableOp);
  4485. arrayDestinationTag := variableOp.op;
  4486. Designate(expression,operand);
  4487. FOR i := 0 TO dim-1 DO
  4488. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4489. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4490. ReleaseOperand(tmpOperand);
  4491. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4492. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4493. ReleaseOperand(tmpOperand);
  4494. END;
  4495. dimOp := IntermediateCode.Immediate(addressType,dim);
  4496. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4497. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4498. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4499. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4500. baseType := SemanticChecker.ArrayBase(type,dim);
  4501. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4502. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4503. Pass((arrayDestinationTag));
  4504. END;
  4505. (* case 2d
  4506. P(...,T,...) push: emit dimension check, push T
  4507. *)
  4508. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4509. Designate(expression,operand);
  4510. Dereference(operand,type.resolved,FALSE);
  4511. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4512. Pass((operand.tag));
  4513. (* case 2f
  4514. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4515. push: push reference to pushed array descriptor
  4516. post: remove array descriptor
  4517. *)
  4518. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4519. descriptorType := GetMathArrayDescriptorType(dim);
  4520. (* static array -- cannot be reallocatated, untraced *)
  4521. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4522. Symbol(variable,variableOp);
  4523. arrayDestinationTag := variableOp.op;
  4524. Designate(expression,operand);
  4525. FOR i := 0 TO dim-1 DO
  4526. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4527. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4528. ReleaseOperand(tmpOperand);
  4529. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4530. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4531. ReleaseOperand(tmpOperand);
  4532. END;
  4533. (*
  4534. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4535. *)
  4536. arrayFlags := {StaticFlag};
  4537. IF dim = 1 THEN
  4538. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4539. ReleaseOperand(tmpOperand);
  4540. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4541. m := LONGINT(tmpOperand.op.intValue);
  4542. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4543. ELSIF dim = 2 THEN
  4544. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4545. ReleaseOperand(tmpOperand);
  4546. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4547. m := LONGINT(tmpOperand.op.intValue);
  4548. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4549. ReleaseOperand(tmpOperand);
  4550. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4551. n := LONGINT(tmpOperand.op.intValue);
  4552. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4553. INCL(arrayFlags,SmallMatrixFlag);
  4554. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4555. END;
  4556. END;
  4557. (*******)
  4558. dimOp := IntermediateCode.Immediate(addressType,dim);
  4559. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4560. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4561. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4562. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4563. baseType := SemanticChecker.ArrayBase(type,dim);
  4564. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4565. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4566. Pass((arrayDestinationTag));
  4567. ELSE HALT(100);
  4568. END;
  4569. (* case 3
  4570. procedure P([left args], [const] A: array [?] of Type, [right args])
  4571. *)
  4572. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4573. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4574. (* case 3b
  4575. P(...,A[a..b,c..d],...)
  4576. *)
  4577. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4578. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4579. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4580. Symbol(variable,variableOp);
  4581. LoadValue(variableOp,system.addressType);
  4582. ELSE
  4583. descriptorType := GetMathArrayDescriptorType(dim);
  4584. (* range -- cannot be reallocated *)
  4585. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4586. Symbol(variable,variableOp);
  4587. END;
  4588. arrayDestinationTag := variableOp.op;
  4589. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4590. arrayDestinationDimension := 0;
  4591. Designate(expression,operand);
  4592. Pass((operand.tag));
  4593. (* case 3a
  4594. P(...,A,...)
  4595. *)
  4596. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4597. i := 0;
  4598. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4599. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4600. INC(i);
  4601. END;
  4602. IF i = dim THEN
  4603. Designate(expression,operand);
  4604. Pass((operand.tag));
  4605. ELSE (* open-static *)
  4606. type := expression.type.resolved;
  4607. descriptorType := GetMathArrayDescriptorType(dim);
  4608. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4609. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4610. Symbol(variable,variableOp);
  4611. arrayDestinationTag := variableOp.op;
  4612. Designate(expression,operand);
  4613. FOR i := 0 TO dim-1 DO
  4614. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4615. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4616. ReleaseOperand(tmpOperand);
  4617. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4618. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4619. ReleaseOperand(tmpOperand);
  4620. END;
  4621. dimOp := IntermediateCode.Immediate(addressType,dim);
  4622. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4623. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4624. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4625. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4626. baseType := SemanticChecker.ArrayBase(type,dim);
  4627. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4628. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4629. Pass((arrayDestinationTag));
  4630. END;
  4631. (* case 3d
  4632. P(...,T,...)
  4633. case 3e
  4634. P(...,PT(...),...)
  4635. *)
  4636. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4637. Designate(expression,operand);
  4638. Dereference(operand,type.resolved,FALSE);
  4639. Pass((operand.tag));
  4640. (* case 3f
  4641. P(...,S,...)
  4642. case 3g
  4643. P(...,PS(...),...)
  4644. *)
  4645. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4646. descriptorType := GetMathArrayDescriptorType(dim);
  4647. (* static array does not need to be traced *)
  4648. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4649. Symbol(variable,variableOp);
  4650. arrayDestinationTag := variableOp.op;
  4651. Designate(expression,operand);
  4652. IF operand.op.type.length >1 THEN (* vector register *)
  4653. (* static array does not need to be traced *)
  4654. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4655. Symbol(variable2, variable2Op);
  4656. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4657. Emit(Mov(position,tmp, operand.op));
  4658. ReleaseOperand(operand);
  4659. Symbol(variable2, operand);
  4660. END;
  4661. FOR i := 0 TO dim-1 DO
  4662. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4663. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4664. ReleaseOperand(tmpOperand);
  4665. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4666. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4667. ReleaseOperand(tmpOperand);
  4668. END;
  4669. dimOp := IntermediateCode.Immediate(addressType,dim);
  4670. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4671. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4672. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4673. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4674. baseType := SemanticChecker.ArrayBase(type,dim);
  4675. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4676. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4677. Pass((arrayDestinationTag));
  4678. ELSE HALT(100);
  4679. END;
  4680. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4681. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4682. (* case 4b
  4683. P(...,A[a..b,c..d],...)
  4684. *)
  4685. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4686. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4687. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4688. Symbol(variable,variableOp);
  4689. LoadValue(variableOp,system.addressType);
  4690. ELSE
  4691. descriptorType := GetMathArrayDescriptorType(dim);
  4692. (* range array -- cannot be allocated *)
  4693. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4694. Symbol(variable,variableOp);
  4695. END;
  4696. arrayDestinationTag := variableOp.op;
  4697. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4698. arrayDestinationDimension := 0;
  4699. Designate(expression,operand);
  4700. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4701. Symbol(variable,variableOp);
  4702. ELSE
  4703. (* alias to range -- untraced *)
  4704. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4705. Symbol(variable,variableOp);
  4706. MakeMemory(tmp,variableOp.op,addressType,0);
  4707. Emit(Mov(position,tmp,operand.tag));
  4708. ReleaseIntermediateOperand(tmp);
  4709. END;
  4710. Pass((variableOp.op));
  4711. ReleaseOperand(variableOp);
  4712. (* case 4a
  4713. P(...,A,...)
  4714. *)
  4715. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4716. i := 0;
  4717. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4718. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4719. INC(i);
  4720. END;
  4721. IF i = dim THEN
  4722. Designate(expression,operand);
  4723. arrayDestinationTag := operand.tag;
  4724. ELSE (* open-static *)
  4725. type := expression.type.resolved;
  4726. descriptorType := GetMathArrayDescriptorType(dim);
  4727. (* static array -- untraced *)
  4728. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4729. Symbol(variable,variableOp);
  4730. arrayDestinationTag := variableOp.op;
  4731. Designate(expression,operand);
  4732. FOR i := 0 TO dim-1 DO
  4733. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4734. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4735. ReleaseOperand(tmpOperand);
  4736. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4737. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4738. ReleaseOperand(tmpOperand);
  4739. END;
  4740. dimOp := IntermediateCode.Immediate(addressType,dim);
  4741. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4742. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4743. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4744. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4745. baseType := SemanticChecker.ArrayBase(type,dim);
  4746. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4747. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4748. END;
  4749. (* tensor alias to open array -- untraced *)
  4750. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4751. Symbol(variable,variableOp);
  4752. MakeMemory(tmp,variableOp.op,addressType,0);
  4753. Emit(Mov(position,tmp,arrayDestinationTag));
  4754. ReleaseIntermediateOperand(tmp);
  4755. Pass((variableOp.op));
  4756. ReleaseOperand(variableOp);
  4757. (* case 4d
  4758. P(...,T,...)
  4759. *)
  4760. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4761. Designate(expression,operand);
  4762. Pass((operand.op));
  4763. (* case 4f
  4764. P(...,S,...)
  4765. *)
  4766. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4767. descriptorType := GetMathArrayDescriptorType(dim);
  4768. (* static array -- cannot be reallocated, untraced *)
  4769. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4770. Symbol(variable,variableOp);
  4771. arrayDestinationTag := variableOp.op;
  4772. Designate(expression,operand);
  4773. FOR i := 0 TO dim-1 DO
  4774. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4775. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4776. ReleaseOperand(tmpOperand);
  4777. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4778. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4779. ReleaseOperand(tmpOperand);
  4780. END;
  4781. dimOp := IntermediateCode.Immediate(addressType,dim);
  4782. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4783. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4784. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4785. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4786. baseType := SemanticChecker.ArrayBase(type,dim);
  4787. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4788. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4789. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4790. Symbol(variable,variableOp);
  4791. MakeMemory(tmp,variableOp.op,addressType,0);
  4792. Emit(Mov(position,tmp,arrayDestinationTag));
  4793. ReleaseIntermediateOperand(tmp);
  4794. Pass((variableOp.op));
  4795. ReleaseOperand(variableOp);
  4796. ELSE HALT(100);
  4797. END;
  4798. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4799. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4800. Designate(expression,operand);
  4801. IF operand.op.type.length > 1 THEN
  4802. Emit(Push(position, operand.op));
  4803. ELSE
  4804. size := system.SizeOf(type);
  4805. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4806. size := ToMemoryUnits(system,size);
  4807. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4808. arrayDestinationTag := sp;
  4809. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4810. END;
  4811. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4812. Designate(expression,operand);
  4813. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4814. (* static array no pointer *)
  4815. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4816. Symbol(variable,variableOp);
  4817. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4818. Emit(Mov(position,tmp,operand.op));
  4819. Emit(Push(position,variableOp.op));
  4820. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4821. Pass((operand.op));
  4822. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4823. END;
  4824. ELSE HALT(200)
  4825. END;
  4826. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4827. IF parameter.kind = SyntaxTree.VarParameter THEN
  4828. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4829. Designate(expression, operand);
  4830. Pass((operand.op));
  4831. ELSE
  4832. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4833. Evaluate(expression, operand);
  4834. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  4835. Pass((operand.extra)); (* step *)
  4836. Pass((operand.tag)); (* last *)
  4837. Pass((operand.op)); (* first *)
  4838. ELSE
  4839. (* pass range as structure in order to comply with the variable alignment of its components *)
  4840. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4841. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  4842. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4843. tmp := sp;
  4844. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4845. Emit(Mov(position,tmp,operand.op)); (* first *)
  4846. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  4847. IntermediateCode.AddOffset(tmp,size);
  4848. Emit(Mov(position,tmp,operand.tag)); (* last *)
  4849. IntermediateCode.AddOffset(tmp,size);
  4850. Emit(Mov(position,tmp,operand.extra)); (* step *)
  4851. END;
  4852. END
  4853. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4854. IF parameter.kind = SyntaxTree.VarParameter THEN
  4855. Designate(expression, operand);
  4856. Pass((operand.op));
  4857. ELSE
  4858. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4859. Evaluate(expression, operand);
  4860. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4861. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4862. Pass((operand.tag)); (* imaginary part *)
  4863. Pass((operand.op)) (* real part *)
  4864. ELSE
  4865. (* pass complex as structure in order to comply with the variable alignment of its components *)
  4866. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4867. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  4868. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4869. tmp := sp;
  4870. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4871. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4872. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  4873. IntermediateCode.AddOffset(tmp,size);
  4874. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4875. END
  4876. END
  4877. ELSE
  4878. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4879. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4880. Designate(expression,operand);
  4881. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4882. (* stack allocation *)
  4883. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4884. (*! parameter alignment to be discussed ... *)
  4885. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4886. size := type(SyntaxTree.StringType).length;
  4887. END;
  4888. IF backend.cooperative & parameter.NeedsTrace() THEN
  4889. dst := NewRegisterOperand (addressType);
  4890. Emit(Mov(position,dst, sp));
  4891. IntermediateCode.InitImmediate(null, byteType, 0);
  4892. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4893. ReleaseIntermediateOperand(dst);
  4894. SaveRegisters();ReleaseUsedRegisters(saved);
  4895. (* register dst has been freed before SaveRegisters already *)
  4896. CallAssignMethod(dst, operand.op, parameter.type);
  4897. RestoreRegisters(saved);
  4898. END;
  4899. IF operand.op.type.length > 1 THEN (* vector *)
  4900. MakeMemory(tmp,sp,operand.op.type,0);
  4901. Emit(Mov(position, tmp, operand.op));
  4902. ELSE
  4903. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4904. END;
  4905. ELSIF IsOpenArray(parameter.type) THEN
  4906. Designate(expression,operand);
  4907. baseReg := operand.tag;
  4908. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4909. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4910. END;
  4911. Pass((operand.op)); (* address of the array *)
  4912. ELSIF IsDelegate(parameter.type) THEN
  4913. Evaluate(expression,operand);
  4914. IF backend.cooperative & parameter.NeedsTrace() THEN
  4915. Emit(Push(position, nil));
  4916. dst := NewRegisterOperand (addressType);
  4917. Emit(Mov(position,dst, sp));
  4918. ReleaseIntermediateOperand(dst);
  4919. SaveRegisters();ReleaseUsedRegisters(saved);
  4920. Emit(Push(position, dst));
  4921. (* register dst has been freed before SaveRegisters already *)
  4922. Emit(Push(position, operand.tag));
  4923. CallThis(position,"GarbageCollector","Assign",2);
  4924. RestoreRegisters(saved);
  4925. ELSE
  4926. Pass((operand.tag));
  4927. END;
  4928. Pass((operand.op));
  4929. ELSE
  4930. Evaluate(expression,operand);
  4931. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4932. Emit(Push(position, nil));
  4933. dst := NewRegisterOperand (addressType);
  4934. Emit(Mov(position,dst, sp));
  4935. ReleaseIntermediateOperand(dst);
  4936. SaveRegisters();ReleaseUsedRegisters(saved);
  4937. Emit(Push(position, dst));
  4938. (* register dst has been freed before SaveRegisters already *)
  4939. Emit(Push(position, operand.op));
  4940. CallThis(position,"GarbageCollector","Assign",2);
  4941. RestoreRegisters(saved);
  4942. ELSE
  4943. Pass((operand.op));
  4944. END;
  4945. END;
  4946. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4947. Evaluate(expression,operand);
  4948. Pass((operand.op));
  4949. ELSE (* var parameter *)
  4950. Designate(expression,operand);
  4951. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4952. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4953. Pass((operand.tag));
  4954. END;
  4955. END;
  4956. Pass((operand.op));
  4957. END;
  4958. END;
  4959. (* TODO: needed? *)
  4960. arrayDestinationTag := oldArrayDestinationTag;
  4961. arrayDestinationDimension := oldArrayDestinationDimension;
  4962. IF needsParameterBackup THEN
  4963. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4964. ReuseCopy(parameterBackup, operand.op)
  4965. END;
  4966. ReleaseOperand(operand);
  4967. IF Trace THEN TraceExit("PushParameter") END;
  4968. END PushParameter;
  4969. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4970. VAR prevConditional: BOOLEAN;
  4971. BEGIN
  4972. prevConditional := conditional;
  4973. conditional := FALSE;
  4974. 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
  4975. Expression(x.result); (* use register *)
  4976. END;
  4977. Statement(x.statement);
  4978. conditional := prevConditional;
  4979. IF x.result # NIL THEN Expression(x.result) END;
  4980. 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
  4981. ReleaseIntermediateOperand(result.op);
  4982. END;
  4983. END VisitStatementDesignator;
  4984. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4985. VAR
  4986. procedure: SyntaxTree.Procedure;
  4987. procedureType: SyntaxTree.ProcedureType;
  4988. wasInline: BOOLEAN;
  4989. actualParameters: SyntaxTree.ExpressionList;
  4990. formalParameter: SyntaxTree.Parameter;
  4991. actualParameter: SyntaxTree.Expression;
  4992. i: LONGINT;
  4993. localVariable: SyntaxTree.Variable;
  4994. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4995. src, dest: Operand;
  4996. prevInlineExit : Label;
  4997. prevMapper: SymbolMapper;
  4998. tooComplex: BOOLEAN;
  4999. resultDesignator: SyntaxTree.Expression;
  5000. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5001. BEGIN
  5002. IF e = NIL THEN RETURN TRUE
  5003. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5004. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5005. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5006. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5007. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5008. ELSE RETURN FALSE
  5009. END;
  5010. END SimpleExpression;
  5011. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5012. BEGIN
  5013. RETURN checker.CanPassInRegister(type)
  5014. END FitsInRegister;
  5015. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5016. VAR
  5017. variable: SyntaxTree.Variable;
  5018. variableDesignator: SyntaxTree.Designator;
  5019. BEGIN
  5020. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5021. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5022. variableDesignator.SetType(type);
  5023. RETURN variableDesignator
  5024. END GetTemp;
  5025. BEGIN
  5026. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5027. wasInline := currentIsInline;
  5028. prevInlineExit := currentInlineExit;
  5029. prevMapper := currentMapper;
  5030. currentInlineExit := NewLabel();
  5031. tooComplex := FALSE;
  5032. NEW(currentMapper);
  5033. currentIsInline := TRUE;
  5034. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5035. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5036. formalParameter := procedureType.firstParameter;
  5037. actualParameters := x.parameters;
  5038. i := 0;
  5039. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5040. actualParameter := actualParameters.GetExpression(i);
  5041. IF actualParameter.resolved # NIL THEN
  5042. actualParameter := actualParameter.resolved
  5043. END;
  5044. (*
  5045. if expression is simple and can be passed immediately
  5046. or if type fits in register then we can proceed
  5047. otherwise we escape to ordinary procedure call.
  5048. *)
  5049. (* cases where the expression can be mapped identically *)
  5050. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5051. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5052. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5053. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5054. (*
  5055. Assign(variableDesignator, actualParameter);
  5056. *)
  5057. Evaluate(actualParameter, src);
  5058. Designate(variableDesignator, dest);
  5059. Emit(Mov(x.position, dest.op, src.op));
  5060. ReleaseOperand(dest);
  5061. ReleaseOperand(src);
  5062. (* the src operand should now have been completely released ! *)
  5063. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5064. ELSE tooComplex := TRUE
  5065. END;
  5066. (*
  5067. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5068. currentMapper.Add(formalParameter, actualParameter, NIL);
  5069. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5070. variableDesignator := GetTemp(system.addressType, FALSE);
  5071. Designate(actualParameter, src);
  5072. Designate(variableDesignator, dest);
  5073. IntermediateCode.MakeMemory(dest.op,addressType);
  5074. Emit(Mov(x.position, dest.op, src.op));
  5075. ReleaseOperand(dest);
  5076. IF src.tag.mode # IntermediateCode.Undefined THEN
  5077. tagDesignator := GetTemp(system.addressType, FALSE);
  5078. Designate(tagDesignator, dest);
  5079. IntermediateCode.MakeMemory(dest.op,addressType);
  5080. Emit(Mov(x.position, dest.op, src.op));
  5081. END;
  5082. ReleaseOperand(dest); ReleaseOperand(src);
  5083. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5084. END;
  5085. *)
  5086. formalParameter := formalParameter.nextParameter;
  5087. INC(i);
  5088. END;
  5089. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5090. IF resultDesignator # NIL THEN
  5091. returnDesignator := resultDesignator
  5092. ELSE
  5093. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5094. END;
  5095. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5096. END;
  5097. localVariable := procedure.procedureScope.firstVariable;
  5098. WHILE ~tooComplex & (localVariable # NIL) DO
  5099. variableDesignator := GetTemp(localVariable.type, FALSE);
  5100. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5101. localVariable := localVariable.nextVariable;
  5102. END;
  5103. IF ~tooComplex THEN
  5104. VisitStatementBlock(procedure.procedureScope.body);
  5105. SetLabel(currentInlineExit);
  5106. IF procedureType.returnType # NIL THEN
  5107. Designate(returnDesignator, result);
  5108. IF conditional THEN
  5109. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5110. ValueToCondition(result)
  5111. END;
  5112. END;
  5113. END;
  5114. currentMapper := prevMapper;
  5115. currentInlineExit := prevInlineExit;
  5116. currentIsInline := wasInline;
  5117. RETURN ~tooComplex
  5118. END InlineProcedureCall;
  5119. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5120. VAR
  5121. parameters: SyntaxTree.ExpressionList;
  5122. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5123. designator: SyntaxTree.Designator;
  5124. procedureType: SyntaxTree.ProcedureType;
  5125. formalParameter: SyntaxTree.Parameter;
  5126. operand: Operand;
  5127. reg, size, mask, dest: IntermediateCode.Operand;
  5128. saved,saved2: RegisterEntry;
  5129. symbol: SyntaxTree.Symbol;
  5130. variable: SyntaxTree.Variable;
  5131. i, parametersSize : LONGINT;
  5132. structuredReturnType: BOOLEAN;
  5133. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5134. tempVariableDesignator: SyntaxTree.Designator;
  5135. gap, alignment: LONGINT; (*fld*)
  5136. (* TODO: remove unnecessary backup variables *)
  5137. oldResult: Operand;
  5138. oldCurrentScope: SyntaxTree.Scope;
  5139. oldArrayDestinationTag: IntermediateCode.Operand;
  5140. oldArrayDestinationDimension: LONGINT;
  5141. oldConstantDeclaration: SyntaxTree.Symbol;
  5142. oldDestination: IntermediateCode.Operand;
  5143. oldCurrentLoop: Label;
  5144. oldConditional: BOOLEAN;
  5145. oldTrueLabel, oldFalseLabel: Label;
  5146. oldLocked: BOOLEAN;
  5147. usedRegisters,oldUsedRegisters: RegisterEntry;
  5148. return: IntermediateCode.Operand;
  5149. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5150. arg: IntermediateCode.Operand;
  5151. dummy: IntermediateCode.Operand;
  5152. recordType: SyntaxTree.RecordType;
  5153. operatorSelectionProcedureOperand: Operand;
  5154. operatorSelectionProcedure: SyntaxTree.Procedure;
  5155. fingerPrint: SyntaxTree.FingerPrint;
  5156. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5157. identifierNumber: LONGINT;
  5158. parameterRegisters: SIZE;
  5159. registers: ARRAY 64 OF WORD;
  5160. procedure: SyntaxTree.Procedure;
  5161. callingConvention: SyntaxTree.CallingConvention;
  5162. type: IntermediateCode.Type;
  5163. PROCEDURE BackupGlobalState;
  5164. BEGIN
  5165. oldResult := result;
  5166. oldCurrentScope := currentScope;
  5167. oldArrayDestinationTag := arrayDestinationTag;
  5168. oldArrayDestinationDimension := arrayDestinationDimension;
  5169. oldConstantDeclaration := constantDeclaration;
  5170. oldDestination := destination;
  5171. oldCurrentLoop := currentLoop;
  5172. oldConditional := conditional;
  5173. oldTrueLabel := trueLabel;
  5174. oldFalseLabel := falseLabel;
  5175. oldLocked := locked;
  5176. oldUsedRegisters := usedRegisters
  5177. END BackupGlobalState;
  5178. PROCEDURE RestoreGlobalState;
  5179. BEGIN
  5180. result := oldResult;
  5181. currentScope := oldCurrentScope;
  5182. arrayDestinationTag := oldArrayDestinationTag;
  5183. arrayDestinationDimension := oldArrayDestinationDimension;
  5184. constantDeclaration := oldConstantDeclaration;
  5185. destination := oldDestination;
  5186. currentLoop := oldCurrentLoop;
  5187. conditional := oldConditional;
  5188. trueLabel := oldTrueLabel;
  5189. falseLabel := oldFalseLabel;
  5190. locked := oldLocked;
  5191. usedRegisters := oldUsedRegisters
  5192. END RestoreGlobalState;
  5193. (** do preparations before parameter push for array-structured object types (ASOTs):
  5194. if ASOT is passed as VAR parameter:
  5195. - allocate temporary variable of math array type
  5196. - copy contents of ASOT to be passed to temporary variable
  5197. - use temporary variable as the actual parameter instead
  5198. - 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)
  5199. **)
  5200. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5201. VAR
  5202. expression: SyntaxTree.Expression;
  5203. BEGIN
  5204. IF actualParameter IS SyntaxTree.Designator THEN
  5205. designator := actualParameter(SyntaxTree.Designator);
  5206. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5207. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5208. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5209. ASSERT(checker # NIL);
  5210. checker.SetCurrentScope(currentScope);
  5211. (* allocate temporary variable *)
  5212. ASSERT(actualParameter.type # NIL);
  5213. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5214. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5215. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5216. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5217. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5218. ASSERT(tempVariableDesignator.type # NIL);
  5219. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5220. (* copy math array stored in actual parameter to temporary variable *)
  5221. BackupGlobalState;
  5222. AssignMathArray(tempVariableDesignator, actualParameter);
  5223. RestoreGlobalState;
  5224. (* use temporary variable as actual parameter instead of the original one *)
  5225. actualParameter := tempVariableDesignator;
  5226. (* create write-back call and store it in linked list *)
  5227. (* create new list entry *)
  5228. IF firstWriteBackCall = NIL THEN
  5229. NEW(firstWriteBackCall);
  5230. currentWriteBackCall := firstWriteBackCall
  5231. ELSE
  5232. ASSERT(currentWriteBackCall # NIL);
  5233. NEW(currentWriteBackCall.next);
  5234. currentWriteBackCall := currentWriteBackCall.next
  5235. END;
  5236. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5237. ASSERT(expression.type = NIL);
  5238. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5239. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5240. (* prepare writeback for any other "normal" indexer *)
  5241. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5242. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5243. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5244. Assign(tempVariableDesignator, actualParameter);
  5245. actualParameter := tempVariableDesignator;
  5246. IF firstWriteBackCall = NIL THEN
  5247. NEW(firstWriteBackCall);
  5248. currentWriteBackCall := firstWriteBackCall
  5249. ELSE
  5250. ASSERT(currentWriteBackCall # NIL);
  5251. NEW(currentWriteBackCall.next);
  5252. currentWriteBackCall := currentWriteBackCall.next
  5253. END;
  5254. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5255. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5256. END
  5257. END
  5258. END PrepareParameter;
  5259. BEGIN
  5260. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5261. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5262. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5263. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5264. IF InlineProcedureCall(x) THEN
  5265. RETURN
  5266. ELSE
  5267. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5268. END
  5269. END;
  5270. END;
  5271. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5272. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5273. callingConvention := procedureType.callingConvention;
  5274. dest := destination; destination := emptyOperand;
  5275. SaveRegisters();ReleaseUsedRegisters(saved);
  5276. parameters := x.parameters;
  5277. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5278. (* an operator is called *)
  5279. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5280. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5281. (* check if a dynamic operator call should be performed *)
  5282. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5283. ELSE
  5284. isCallOfDynamicOperator := FALSE
  5285. END;
  5286. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5287. Emit(Push(position, ap));
  5288. END;
  5289. alignment := procedureType.stackAlignment;
  5290. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5291. alignment := 16 (* bytes *);
  5292. END;
  5293. IF alignment > 1 THEN
  5294. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5295. Emit(Mov(position,reg, sp));
  5296. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5297. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5298. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5299. gap := 4*ToMemoryUnits(system,system.addressSize);
  5300. END;
  5301. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5302. backend.ResetParameterRegisters();
  5303. formalParameter := procedureType.firstParameter;
  5304. FOR i := 0 TO parameters.Length()-1 DO
  5305. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5306. type := addressType;
  5307. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5308. type := addressType;
  5309. ELSE
  5310. type := GetType(system, formalParameter.type);
  5311. END;
  5312. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5313. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5314. END;
  5315. formalParameter := formalParameter.nextParameter;
  5316. END;
  5317. IF gap < 0 THEN
  5318. gap := 0
  5319. END;
  5320. ELSE
  5321. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5322. END;
  5323. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5324. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5325. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5326. Emit(And(position,sp, sp, mask));
  5327. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5328. Emit(Push(position,reg));
  5329. ReleaseIntermediateOperand(reg);
  5330. END;
  5331. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5332. (* align stack to 16-byte boundary *)
  5333. IntermediateCode.InitImmediate(mask,addressType,-16);
  5334. Emit(And(position,sp, sp, mask));
  5335. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5336. IF gap # 0 THEN
  5337. IntermediateCode.InitImmediate(size,addressType,gap);
  5338. Emit(Sub(position,sp,sp,size))
  5339. END;
  5340. END;
  5341. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5342. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5343. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5344. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5345. ELSE
  5346. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5347. END;
  5348. Evaluate(x.left, operand);
  5349. IF symbol IS SyntaxTree.Procedure THEN
  5350. IF (procedureType.selfParameter # NIL) THEN
  5351. Emit(Push(position,operand.tag));
  5352. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5353. Emit(Push(position,operand.tag));
  5354. ELSIF (procedureType.isDelegate) THEN
  5355. Emit(Push(position,operand.tag));
  5356. END;
  5357. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5358. IF (procedureType.selfParameter # NIL) THEN
  5359. Emit(Push(position,operand.tag));
  5360. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5361. Emit(Push(position,operand.tag));
  5362. END;
  5363. ELSE HALT(200);
  5364. END;
  5365. ReleaseIntermediateOperand(operand.tag);
  5366. operand.tag := emptyOperand;
  5367. (* determine if a structured return type is needed *)
  5368. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5369. IF structuredReturnType THEN
  5370. IF resultDesignator # NIL THEN
  5371. d := resultDesignator;
  5372. ELSE
  5373. (* temporary result that might be allocated, must potentially be traced *)
  5374. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5375. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5376. d.SetType(variable.type);
  5377. END;
  5378. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5379. Designate(d,returnValue);
  5380. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5381. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5382. Emit(Push(position,size));
  5383. Emit(Push(position,returnValue.op));
  5384. ReleaseOperand(returnValue);
  5385. ELSE*)
  5386. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5387. (*
  5388. END;
  5389. *)
  5390. END;
  5391. firstWriteBackCall := NIL; (* reset write-back call list *)
  5392. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5393. parameterRegisters := 0;
  5394. backend.ResetParameterRegisters();
  5395. formalParameter := procedureType.firstParameter;
  5396. FOR i := 0 TO parameters.Length()-1 DO
  5397. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5398. type := addressType;
  5399. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5400. type := addressType;
  5401. ELSE
  5402. type := GetType(system, formalParameter.type);
  5403. END;
  5404. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5405. INC(parameterRegisters);
  5406. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5407. Error(actualParameter.position,"cannot be passed by register")
  5408. END;
  5409. ELSE
  5410. registers[i] := -1;
  5411. END;
  5412. formalParameter := formalParameter.nextParameter;
  5413. END;
  5414. formalParameter := procedureType.lastParameter;
  5415. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5416. actualParameter := parameters.GetExpression(i);
  5417. PrepareParameter(actualParameter, formalParameter);
  5418. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5419. formalParameter := formalParameter.prevParameter;
  5420. END;
  5421. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5422. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5423. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5424. END;
  5425. ELSE
  5426. hasDynamicOperands := FALSE;
  5427. formalParameter := procedureType.firstParameter;
  5428. FOR i := 0 TO parameters.Length() - 1 DO
  5429. actualParameter := parameters.GetExpression(i);
  5430. IF formalParameter # NIL THEN (* TENTATIVE *)
  5431. PrepareParameter(actualParameter, formalParameter);
  5432. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5433. ASSERT(i < 2);
  5434. hasDynamicOperands := TRUE;
  5435. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5436. ELSE
  5437. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5438. END;
  5439. formalParameter := formalParameter.nextParameter;
  5440. END;
  5441. END;
  5442. END;
  5443. IF symbol IS SyntaxTree.Procedure THEN
  5444. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5445. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5446. Emit(Push(position,reg));
  5447. ReleaseIntermediateOperand(reg);
  5448. END;
  5449. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5450. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5451. parametersSize := ParametersSize(system,procedureType, FALSE);
  5452. END;
  5453. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5454. (*
  5455. dynamic operator overloading:
  5456. first push parameters, regularly:
  5457. [self]
  5458. par1
  5459. par2
  5460. then push parameters for GetOperator
  5461. identifier
  5462. ptr1
  5463. tag
  5464. ptr2
  5465. tag
  5466. call GetOperatorRuntimeProc
  5467. call Operator
  5468. *)
  5469. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5470. (* push ID *)
  5471. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5472. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5473. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5474. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5475. formalParameter := procedureType.firstParameter;
  5476. FOR i := 0 TO parameters.Length() - 1 DO
  5477. IF formalParameter.access # SyntaxTree.Hidden THEN
  5478. ASSERT(i < 2);
  5479. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5480. (* push pointer *)
  5481. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5482. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5483. (* add dereference *)
  5484. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5485. (*! better: do refer to stack above than using parameter backups !!*)
  5486. ReleaseIntermediateOperand(parameterBackups[i]);
  5487. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5488. END;
  5489. Emit(Push(position,parameterBackups[i]));
  5490. ReleaseIntermediateOperand(parameterBackups[i]);
  5491. (* push typetag *)
  5492. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5493. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5494. arg := TypeDescriptorAdr(recordType);
  5495. Emit(Push(position,arg));
  5496. ELSE
  5497. (* push 'NonPointer' *)
  5498. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5499. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5500. (* push fingerprint *)
  5501. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5502. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5503. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5504. END
  5505. END;
  5506. formalParameter := formalParameter.nextParameter
  5507. END;
  5508. (* for unary operators: complete the information for the second parameter *)
  5509. IF procedureType.numberParameters < 2 THEN
  5510. (* push 'NonPointer' *)
  5511. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5512. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5513. (* push 'NoType' *)
  5514. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5515. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5516. END;
  5517. (* call operator selection procedure *)
  5518. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5519. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5520. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5521. ReleaseOperand(operatorSelectionProcedureOperand);
  5522. (* use the address that the operator selection procedure returned as the target address of the call *)
  5523. InitOperand(operand, ModeValue);
  5524. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5525. Emit(Result(position,operand.op))
  5526. END
  5527. END;
  5528. ReleaseParameterRegisters();
  5529. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5530. SaveRegisters();ReleaseUsedRegisters(saved2);
  5531. CallThis(position,"Objects","LeaveA2",0);
  5532. RestoreRegisters(saved2);
  5533. END;
  5534. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5535. Emit(Call(position,operand.op,0));
  5536. ELSE
  5537. Emit(Call(position,operand.op,parametersSize));
  5538. END;
  5539. ReleaseOperand(operand);
  5540. IF procedureType.noReturn THEN
  5541. EmitTrap(position,NoReturnTrap);
  5542. END;
  5543. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5544. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5545. Emit(Result(position,return));
  5546. END;
  5547. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5548. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5549. Emit(Push(position, return));
  5550. CallThis(position,"Objects","ReenterA2",0);
  5551. Emit(Pop(position, return));
  5552. ELSE
  5553. CallThis(position,"Objects","ReenterA2",0);
  5554. END;
  5555. END;
  5556. (* === return parameter space === *)
  5557. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5558. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5559. (* cleanup all space for all parameters *)
  5560. IF parametersSize < 32 THEN
  5561. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5562. parametersSize := 32
  5563. END;
  5564. size := IntermediateCode.Immediate(addressType,parametersSize);
  5565. Emit(Add(position,sp,sp,size))
  5566. END;
  5567. IF (callingConvention IN SysvABI) THEN
  5568. IF parameterRegisters > 0 THEN
  5569. IF parameters.Length() > parameterRegisters THEN
  5570. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5571. ELSE
  5572. parametersSize := 0
  5573. END;
  5574. ELSE
  5575. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5576. INC( parametersSize, (-parametersSize) MOD 16 )
  5577. END;
  5578. IF parametersSize > 0 THEN
  5579. size := IntermediateCode.Immediate(addressType,parametersSize);
  5580. Emit(Add(position,sp,sp,size))
  5581. END;
  5582. END;
  5583. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5584. IF structuredReturnType THEN
  5585. (* stack pointer rewinding done by callee
  5586. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5587. Emit(Add(position,sp,sp,size));
  5588. *)
  5589. RestoreRegisters(saved);
  5590. InitOperand(result,ModeReference);
  5591. Symbol(variable,result);
  5592. ELSE
  5593. RestoreRegisters(saved);
  5594. InitOperand(result,ModeValue);
  5595. result.op := return;
  5596. END;
  5597. END;
  5598. IF alignment > 1 THEN
  5599. Emit(Pop(position,sp));
  5600. END;
  5601. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5602. Emit(Pop(position, ap));
  5603. END;
  5604. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5605. ValueToCondition(result);
  5606. END;
  5607. destination := dest;
  5608. (* perform all write-back calls in the list *)
  5609. BackupGlobalState;
  5610. currentWriteBackCall := firstWriteBackCall;
  5611. WHILE currentWriteBackCall # NIL DO
  5612. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5613. currentWriteBackCall := currentWriteBackCall.next
  5614. END;
  5615. RestoreGlobalState;
  5616. (* TENATIVE *)
  5617. (*
  5618. IF isOperatorCall THEN
  5619. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5620. END;
  5621. *)
  5622. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5623. END VisitProcedureCallDesignator;
  5624. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5625. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5626. td: SyntaxTree.Symbol;
  5627. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5628. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5629. BEGIN
  5630. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5631. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5632. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5633. variable.SetType(system.anyType);
  5634. scope.AddVariable(variable);
  5635. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5636. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5637. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5638. typeDeclaration.SetScope(module.module.moduleScope);
  5639. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5640. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5641. END;
  5642. RETURN hiddenPointerType;
  5643. END GetHiddenPointerType;
  5644. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5645. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5646. BEGIN
  5647. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5648. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5649. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5650. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5651. scope.AddVariable(variable);
  5652. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5653. variable.SetType(system.anyType);
  5654. scope.AddVariable(variable);
  5655. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5656. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5657. typeDeclaration.SetDeclaredType(delegatePointerType);
  5658. typeDeclaration.SetScope(module.module.moduleScope);
  5659. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5660. delegatePointerType.SetState(SyntaxTree.Resolved);
  5661. END;
  5662. RETURN delegatePointerType
  5663. END GetDelegateType;
  5664. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5665. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5666. such as in VAR a: RECORD ... END;
  5667. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5668. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5669. *)
  5670. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  5671. baseRecord: SyntaxTree.RecordType;
  5672. BEGIN (* no code emission *)
  5673. source := NIL;
  5674. x := x.resolved;
  5675. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5676. x := GetHiddenPointerType();
  5677. ELSIF IsDelegate(x) THEN
  5678. x := GetDelegateType();
  5679. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5680. ELSE HALT(200);
  5681. END;
  5682. td := x.typeDeclaration;
  5683. IF td = NIL THEN
  5684. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5685. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5686. ASSERT(td # NIL);
  5687. END;
  5688. GetCodeSectionNameForSymbol(td,name);
  5689. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5690. meta.CheckTypeDeclaration(x);
  5691. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5692. ELSE
  5693. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5694. END;
  5695. IF backend.cooperative OR meta.simple THEN
  5696. offset := 0;
  5697. ELSE
  5698. IF x IS SyntaxTree.CellType THEN
  5699. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5700. IF baseRecord = NIL THEN
  5701. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5702. ELSE
  5703. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5704. END;
  5705. ELSE
  5706. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5707. END;
  5708. END;
  5709. RETURN td
  5710. END GetBackendType;
  5711. BEGIN
  5712. (*td := t.typeDeclaration;*)
  5713. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5714. (*
  5715. IF t IS SyntaxTree.PointerType THEN
  5716. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5717. ELSE
  5718. source := GetBackendType(t);
  5719. END;
  5720. *)
  5721. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5722. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5723. IntermediateCode.SetOffset(res,offset);
  5724. (*
  5725. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5726. make memory should be used when tag is used, not earlier
  5727. *)
  5728. RETURN res
  5729. END TypeDescriptorAdr;
  5730. (*
  5731. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5732. VAR result: IntermediateCode.Operand;
  5733. BEGIN
  5734. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5735. operand.tag := TypeDescriptorAdr(operand.type);
  5736. IntermediateCode.MakeMemory(operand.tag,addressType);
  5737. UseIntermediateOperand(operand.tag);
  5738. END;
  5739. END MakeTypeTag;
  5740. *)
  5741. PROCEDURE ProfilerInit;
  5742. VAR reg: IntermediateCode.Operand;
  5743. BEGIN
  5744. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5745. Emit(Call(position,reg,0));
  5746. END ProfilerInit;
  5747. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5748. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5749. BEGIN
  5750. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5751. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5752. THEN
  5753. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5754. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5755. Emit(Push(position,reg));
  5756. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5757. Emit(Push(position,reg));
  5758. StaticCallOperand(result,procedure);
  5759. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5760. ReleaseOperand(result);
  5761. END;
  5762. END ProfilerEnterExit;
  5763. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5764. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5765. BEGIN
  5766. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5767. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5768. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5769. profileInit.Emit(Push(position,reg));
  5770. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5771. profileInit.Emit(Push(position,reg));
  5772. NEW(string, LEN(name)); COPY(name, string^);
  5773. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5774. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5775. sv.SetType(type);
  5776. Designate(sv,result);
  5777. profileInit.Emit(Push(position,result.tag));
  5778. profileInit.Emit(Push(position,result.op));
  5779. StaticCallOperand(result,procedure);
  5780. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5781. ReleaseOperand(result);
  5782. END;
  5783. END ProfilerAddProcedure;
  5784. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5785. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5786. BEGIN
  5787. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5788. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5789. profileInit.Emit(Push(position,reg));
  5790. profileInitPatchPosition := profileInit.pc;
  5791. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5792. NEW(string, LEN(name)); COPY(name, string^);
  5793. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5794. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5795. sv.SetType(type);
  5796. Designate(sv,result);
  5797. profileInit.Emit(Push(position,result.tag));
  5798. profileInit.Emit(Push(position,result.op));
  5799. StaticCallOperand(result,procedure);
  5800. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5801. ReleaseOperand(result);
  5802. END;
  5803. END ProfilerAddModule;
  5804. PROCEDURE ProfilerPatchInit;
  5805. VAR reg: IntermediateCode.Operand;
  5806. BEGIN
  5807. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5808. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5809. EmitLeave(profileInit,position,NIL,0);
  5810. profileInit.Emit(Exit(position,0,0,0));
  5811. END ProfilerPatchInit;
  5812. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5813. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5814. VAR
  5815. id: LONGINT;
  5816. leftType, rightType: SyntaxTree.Type;
  5817. procedureType: SyntaxTree.ProcedureType;
  5818. runtimeProcedure: SyntaxTree.Procedure;
  5819. runtimeProcedureOperand, operatorOperand: Operand;
  5820. kind: SET;
  5821. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5822. VAR
  5823. arg: IntermediateCode.Operand;
  5824. recordType: SyntaxTree.RecordType;
  5825. fingerPrint: SyntaxTree.FingerPrint;
  5826. BEGIN
  5827. IF type = NIL THEN
  5828. (* no type: push 'NoType' *)
  5829. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5830. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5831. ELSIF IsStrictlyPointerToRecord(type) THEN
  5832. (* pointer to record type: push typetag *)
  5833. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5834. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5835. arg := TypeDescriptorAdr(recordType);
  5836. ELSE
  5837. (* non-pointer to record type: push fingerprint *)
  5838. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5839. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5840. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5841. END;
  5842. operatorInitializationCodeSection.Emit(Push(position,arg))
  5843. END PushTypeInfo;
  5844. BEGIN
  5845. ASSERT(operatorInitializationCodeSection # NIL);
  5846. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5847. procedureType := operator.type(SyntaxTree.ProcedureType);
  5848. (* determine types *)
  5849. leftType := procedureType.firstParameter.type;
  5850. IF procedureType.numberParameters = 2 THEN
  5851. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5852. rightType := procedureType.firstParameter.nextParameter.type;
  5853. ELSE
  5854. rightType := NIL
  5855. END;
  5856. (* determine operator kind *)
  5857. IF IsStrictlyPointerToRecord(leftType) THEN
  5858. kind := {LhsIsPointer}
  5859. ELSE
  5860. kind := {}
  5861. END;
  5862. IF IsStrictlyPointerToRecord(rightType) THEN
  5863. kind := kind + {RhsIsPointer}
  5864. END;
  5865. IF kind # {} THEN (* TODO: to be removed later on *)
  5866. (* at least one of the types is a pointer to record *)
  5867. (* emit a code that registers this specific operator in the runtime *)
  5868. dump := operatorInitializationCodeSection.comments;
  5869. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5870. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5871. (* push ID *)
  5872. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5873. id := Global.GetSymbol(module.module.case, operator.name);
  5874. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5875. (* push kind *)
  5876. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5877. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5878. (* push type infos *)
  5879. PushTypeInfo(leftType);
  5880. PushTypeInfo(rightType);
  5881. (* push operator address *)
  5882. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5883. StaticCallOperand(operatorOperand, operator);
  5884. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5885. ReleaseOperand(operatorOperand);
  5886. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5887. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5888. ReleaseOperand(runtimeProcedureOperand)
  5889. END
  5890. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5891. END
  5892. END RegisterDynamicOperator;
  5893. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5894. VAR
  5895. traceModule: SyntaxTree.Module;
  5896. procedure: SyntaxTree.Procedure;
  5897. procedureVariable: SyntaxTree.Variable;
  5898. s,msg: Basic.MessageString;
  5899. res: Operand;
  5900. i: LONGINT;
  5901. sv: SyntaxTree.StringValue;
  5902. type: SyntaxTree.Type;
  5903. recordType: SyntaxTree.RecordType;
  5904. printout: Printout.Printer;
  5905. stringWriter: Streams.StringWriter;
  5906. expression: SyntaxTree.Expression;
  5907. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5908. BEGIN
  5909. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5910. IF procedure = NIL THEN
  5911. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5912. END;
  5913. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5914. s := "procedure ";
  5915. Strings.Append(s,backend.traceModuleName);
  5916. Strings.Append(s,".");
  5917. Strings.Append(s,procedureName);
  5918. Strings.Append(s," not present");
  5919. Error(position,s);
  5920. RETURN FALSE
  5921. ELSE
  5922. RETURN TRUE
  5923. END;
  5924. END GetProcedure;
  5925. PROCEDURE CallProcedure;
  5926. VAR size: LONGINT;
  5927. BEGIN
  5928. IF procedure # NIL THEN
  5929. StaticCallOperand(result,procedure);
  5930. size := ProcParametersSize(procedure);
  5931. ELSE
  5932. Symbol(procedureVariable, result);
  5933. LoadValue(result, procedureVariable.type.resolved);
  5934. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5935. END;
  5936. Emit(Call(position,result.op,size));
  5937. END CallProcedure;
  5938. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5939. VAR res: Operand; string: SyntaxTree.String;
  5940. BEGIN
  5941. IF GetProcedure("String") THEN
  5942. NEW(string, LEN(s)); COPY(s, string^);
  5943. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5944. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5945. sv.SetType(type);
  5946. Designate(sv,res);
  5947. Emit(Push(position,res.tag));
  5948. Emit(Push(position,res.op));
  5949. ReleaseOperand(res);
  5950. CallProcedure;
  5951. END;
  5952. END String;
  5953. PROCEDURE Integer(op: IntermediateCode.Operand);
  5954. BEGIN
  5955. IF GetProcedure("Int") THEN
  5956. Emit(Push(position,op));
  5957. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5958. CallProcedure;
  5959. END;
  5960. END Integer;
  5961. PROCEDURE Float(op: IntermediateCode.Operand);
  5962. BEGIN
  5963. IF GetProcedure("HIntHex") THEN
  5964. Emit(Push(position,op));
  5965. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5966. CallProcedure;
  5967. END;
  5968. END Float;
  5969. PROCEDURE Set(op: IntermediateCode.Operand);
  5970. BEGIN
  5971. IF GetProcedure("Set") THEN
  5972. Emit(Push(position,op));
  5973. (*
  5974. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5975. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5976. *)
  5977. CallProcedure;
  5978. END;
  5979. END Set;
  5980. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5981. BEGIN
  5982. IF GetProcedure("Boolean") THEN
  5983. Emit(Push(position,op));
  5984. CallProcedure;
  5985. END;
  5986. END Boolean;
  5987. PROCEDURE Char(op: IntermediateCode.Operand);
  5988. BEGIN
  5989. IF GetProcedure("Char") THEN
  5990. Emit(Push(position,op));
  5991. CallProcedure;
  5992. END;
  5993. END Char;
  5994. PROCEDURE Address(op: IntermediateCode.Operand);
  5995. BEGIN
  5996. IF GetProcedure("Address") THEN
  5997. Emit(Push(position,op));
  5998. CallProcedure;
  5999. END;
  6000. END Address;
  6001. PROCEDURE Size(op: IntermediateCode.Operand);
  6002. BEGIN
  6003. IF GetProcedure("Size") THEN
  6004. Emit(Push(position,op));
  6005. CallProcedure;
  6006. END;
  6007. END Size;
  6008. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6009. VAR len: IntermediateCode.Operand;
  6010. BEGIN
  6011. IF GetProcedure("String") THEN
  6012. len := GetArrayLength(type, op.tag);
  6013. Emit(Push(position,len));
  6014. ReleaseIntermediateOperand(len);
  6015. Emit(Push(position,op.op));
  6016. CallProcedure;
  6017. END;
  6018. END StringOperand;
  6019. PROCEDURE Ln;
  6020. BEGIN
  6021. IF GetProcedure("Ln") THEN
  6022. CallProcedure;
  6023. END;
  6024. END Ln;
  6025. BEGIN
  6026. IF backend.traceModuleName = "" THEN RETURN END;
  6027. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6028. IF GetProcedure("Enter") THEN
  6029. CallProcedure
  6030. END;
  6031. NEW(stringWriter,LEN(s));
  6032. FOR i := 0 TO x.Length()-1 DO
  6033. msg := "";
  6034. expression := x.GetExpression(i);
  6035. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6036. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6037. ELSE
  6038. Global.GetModuleName(module.module, s);
  6039. END;
  6040. IF i = 0 THEN
  6041. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6042. stringWriter.String(":");
  6043. END;
  6044. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6045. IF ~(expression IS SyntaxTree.StringValue) THEN
  6046. printout.Expression(expression);
  6047. stringWriter.Get(s);
  6048. Strings.Append(msg,s);
  6049. Strings.Append(msg,"= ");
  6050. ELSE stringWriter.Get(s); (* remove from string writer *)
  6051. Strings.Append(msg, s);
  6052. END;
  6053. String(msg);
  6054. IF SemanticChecker.IsStringType(expression.type) THEN
  6055. Designate(expression,res);
  6056. StringOperand(res, expression.type);
  6057. ELSE
  6058. Evaluate(expression,res);
  6059. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6060. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6061. Convert(res.op,int64);
  6062. END;
  6063. Integer(res.op);
  6064. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6065. Boolean(res.op);
  6066. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6067. Set(res.op);
  6068. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6069. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6070. Convert(res.op,float64);
  6071. END;
  6072. Float(res.op);
  6073. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6074. Char(res.op);
  6075. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6076. Address(res.op);String("H");
  6077. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6078. Size(res.op);
  6079. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6080. Address(res.op);String("H");
  6081. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6082. Address(res.op);String("H");
  6083. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6084. String("NIL");
  6085. ELSE HALT(200);
  6086. END;
  6087. END;
  6088. ReleaseOperand(res);
  6089. String("; ");
  6090. END;
  6091. IF GetProcedure("Exit") THEN
  6092. CallProcedure
  6093. ELSE
  6094. Ln;
  6095. END;
  6096. END;
  6097. END SystemTrace;
  6098. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6099. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6100. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6101. BEGIN
  6102. type := type.resolved;
  6103. IF type IS SyntaxTree.RecordType THEN
  6104. WITH type: SyntaxTree.RecordType DO
  6105. baseType := type.baseType;
  6106. IF baseType # NIL THEN
  6107. baseType := baseType.resolved;
  6108. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6109. InitFields(baseType,adr,offset);
  6110. END;
  6111. variable := type.recordScope.firstVariable;
  6112. WHILE variable # NIL DO
  6113. IF variable.initializer # NIL THEN
  6114. Evaluate(variable.initializer,initializerOp);
  6115. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6116. Emit(Mov(position,mem,initializerOp.op));
  6117. ReleaseOperand(initializerOp);
  6118. ReleaseIntermediateOperand(mem);
  6119. END;
  6120. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6121. variable := variable.nextVariable
  6122. END;
  6123. END;
  6124. ELSIF type IS SyntaxTree.CellType THEN
  6125. WITH type: SyntaxTree.CellType DO
  6126. baseType := type.baseType;
  6127. IF baseType # NIL THEN
  6128. baseType := baseType.resolved;
  6129. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6130. InitFields(baseType,adr,offset);
  6131. END;
  6132. variable := type.cellScope.firstVariable;
  6133. WHILE variable # NIL DO
  6134. IF variable.initializer # NIL THEN
  6135. Evaluate(variable.initializer,initializerOp);
  6136. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6137. Emit(Mov(position,mem,initializerOp.op));
  6138. ReleaseOperand(initializerOp);
  6139. ReleaseIntermediateOperand(mem);
  6140. END;
  6141. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6142. variable := variable.nextVariable
  6143. END;
  6144. END;
  6145. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6146. WITH type: SyntaxTree.ArrayType DO
  6147. IF type.form = SyntaxTree.Static THEN
  6148. baseType := type.arrayBase;
  6149. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6150. FOR i := 0 TO type.staticLength-1 DO
  6151. InitFields(baseType,adr,offset+i*size);
  6152. END;
  6153. END;
  6154. END;
  6155. ELSIF type IS SyntaxTree.MathArrayType THEN
  6156. WITH type: SyntaxTree.MathArrayType DO
  6157. IF type.form = SyntaxTree.Open THEN
  6158. dim := DynamicDim(type);
  6159. imm := IntermediateCode.Immediate(addressType,dim);
  6160. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6161. baseType := SemanticChecker.ArrayBase(type,dim);
  6162. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6163. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6164. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6165. ReleaseIntermediateOperand(imm);
  6166. (* flags remain empty (=0) for open array *)
  6167. ELSIF type.form = SyntaxTree.Static THEN
  6168. baseType := type.arrayBase;
  6169. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6170. ASSERT(type.staticLength < 1024*1024*1024);
  6171. FOR i := 0 TO type.staticLength-1 DO
  6172. InitFields(baseType,adr,offset+i*size);
  6173. END;
  6174. END;
  6175. END;
  6176. END;
  6177. END InitFields;
  6178. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6179. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6180. saved: RegisterEntry;
  6181. BEGIN
  6182. type := variable.type.resolved;
  6183. IF (type IS SyntaxTree.MathArrayType) THEN
  6184. WITH type: SyntaxTree.MathArrayType DO
  6185. IF type.form = SyntaxTree.Open THEN
  6186. Symbol(variable,operand);
  6187. InitFields(type, operand.tag,0);
  6188. IF temporary THEN
  6189. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6190. END;
  6191. ELSIF type.form = SyntaxTree.Tensor THEN
  6192. IF temporary & backend.writeBarriers THEN
  6193. SaveRegisters();ReleaseUsedRegisters(saved);
  6194. Symbol(variable, operand);
  6195. Emit(Push(position,operand.op));
  6196. ReleaseOperand(operand);
  6197. Emit(Push(position,nil));
  6198. CallThis(position,"FoxArrayBase","Assign",2);
  6199. RestoreRegisters(saved);
  6200. ELSE
  6201. Symbol(variable, operand);
  6202. MakeMemory(tmp,operand.op,addressType,0);
  6203. ReleaseOperand(operand);
  6204. IF FALSE & temporary THEN
  6205. (* trick -- temporary object from array base *)
  6206. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6207. Symbol(symbol,operand);
  6208. MakeMemory(mem,operand.op,addressType,0);
  6209. ReleaseOperand(operand);
  6210. Emit(Mov(position,tmp, mem) );
  6211. ReleaseOperand(operand);
  6212. ELSE
  6213. Emit(Mov(position,tmp, nil ) );
  6214. END;
  6215. ReleaseIntermediateOperand(tmp)
  6216. END;
  6217. END;
  6218. END;
  6219. ELSE
  6220. Symbol(variable,operand);
  6221. IF variable.initializer # NIL THEN
  6222. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6223. reference.SetType(variable.type.resolved);
  6224. reference.SetAssignable(TRUE);
  6225. Assign(reference,variable.initializer);
  6226. ELSIF temporary THEN
  6227. IF SemanticChecker.IsPointerType(variable.type) THEN
  6228. IF backend.cooperative THEN
  6229. SaveRegisters();ReleaseUsedRegisters(saved);
  6230. Symbol(variable, operand);
  6231. CallAssignPointer(operand.op, nil);
  6232. ReleaseOperand(operand);
  6233. RestoreRegisters(saved);
  6234. ELSIF backend.writeBarriers THEN
  6235. SaveRegisters();ReleaseUsedRegisters(saved);
  6236. Symbol(variable, operand);
  6237. Emit(Push(position,operand.op));
  6238. ReleaseOperand(operand);
  6239. Emit(Push(position,nil));
  6240. CallThis(position,"Heaps","Assign",2);
  6241. RestoreRegisters(saved);
  6242. ELSE
  6243. Symbol(variable, operand);
  6244. MakeMemory(tmp,operand.op,addressType,0);
  6245. ReleaseOperand(operand);
  6246. Emit(Mov(position,tmp, nil ) );
  6247. ReleaseIntermediateOperand(tmp);
  6248. END;
  6249. END;
  6250. END;
  6251. InitFields(type, operand.op,0);
  6252. ReleaseOperand(operand);
  6253. END;
  6254. END InitVariable;
  6255. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6256. VAR end: Label;
  6257. BEGIN
  6258. IF type.form = SyntaxTree.Tensor THEN
  6259. InitOperand(result,ModeValue);
  6260. ReuseCopy(result.op,base);
  6261. end := NewLabel();
  6262. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6263. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6264. SetLabel(end);
  6265. Convert(result.op,lenType);
  6266. ELSE
  6267. InitOperand(result,ModeValue);
  6268. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6269. END
  6270. END MathArrayDim;
  6271. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6272. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6273. BEGIN
  6274. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6275. MakeMemory(mem,base,addressType,offset);
  6276. Emit(Mov(position,mem,value));
  6277. ReleaseIntermediateOperand(mem);
  6278. END PutMathArrayField;
  6279. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6280. VAR mem: IntermediateCode.Operand;
  6281. BEGIN
  6282. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6283. MakeMemory(mem,base,addressType,offset);
  6284. Emit(Mov(position,mem,value));
  6285. ReleaseIntermediateOperand(mem);
  6286. END PutMathArrayFieldOffset;
  6287. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6288. BEGIN
  6289. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6290. MakeMemory(value,base,addressType,offset);
  6291. END GetMathArrayField;
  6292. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6293. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6294. BEGIN
  6295. IF incr THEN
  6296. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6297. ELSE
  6298. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6299. END;
  6300. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6301. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6302. ELSE
  6303. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6304. Emit(Mov(position,reg,dim));
  6305. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6306. Emit(Add(position,reg,reg,base));
  6307. MakeMemory(mem, reg, addressType, offset);
  6308. ReleaseIntermediateOperand(reg);
  6309. Emit(Mov(position,mem,value));
  6310. ReleaseIntermediateOperand(mem);
  6311. END;
  6312. END PutMathArrayLenOrIncr;
  6313. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6314. BEGIN
  6315. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6316. END PutMathArrayLength;
  6317. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6318. BEGIN
  6319. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6320. END PutMathArrayIncrement;
  6321. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6322. BEGIN
  6323. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6324. END GetMathArrayIncrement;
  6325. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6326. BEGIN
  6327. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6328. END GetMathArrayLength;
  6329. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6330. VAR dimOp: IntermediateCode.Operand;
  6331. BEGIN
  6332. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6333. GetMathArrayLength(type, operand, dimOp, check, result);
  6334. END GetMathArrayLengthAt;
  6335. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6336. VAR dimOp: IntermediateCode.Operand;
  6337. BEGIN
  6338. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6339. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6340. END GetMathArrayIncrementAt;
  6341. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6342. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6343. offset: LONGINT;
  6344. BEGIN
  6345. IF increment THEN
  6346. offset := MathIncrOffset;
  6347. ELSE
  6348. offset := MathLenOffset;
  6349. END;
  6350. INC(offset,operand.dimOffset*2);
  6351. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6352. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6353. END;
  6354. (* static dimension *)
  6355. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6356. IF check & (type.form = SyntaxTree.Tensor) THEN
  6357. DimensionCheck(operand.tag,dim,BrltL);
  6358. END;
  6359. val := SHORT(dim.intValue);
  6360. IF type.form # SyntaxTree.Tensor THEN
  6361. t := SemanticChecker.ArrayBase(type,val);
  6362. type := t.resolved(SyntaxTree.MathArrayType);
  6363. IF type.form = SyntaxTree.Static THEN
  6364. IF increment THEN
  6365. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6366. ELSE
  6367. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6368. END;
  6369. InitOperand(result,ModeValue);
  6370. result.op := res;
  6371. RETURN;
  6372. END;
  6373. END;
  6374. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6375. MakeMemory(res,operand.tag,addressType,offset);
  6376. (*
  6377. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6378. *)
  6379. InitOperand(result,ModeValue);
  6380. result.op := res;
  6381. ELSE
  6382. Convert(dim,addressType);
  6383. IF check THEN
  6384. IF type.form = SyntaxTree.Tensor THEN
  6385. DimensionCheck(operand.tag,dim,BrltL);
  6386. ELSIF isUnchecked THEN (* do nothing *)
  6387. ELSE
  6388. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6389. END;
  6390. END;
  6391. end := NewLabel(); next := NIL;
  6392. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6393. Emit(Mov(position,res,dim));
  6394. Convert(res,sizeType);
  6395. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6396. WHILE t IS SyntaxTree.MathArrayType DO
  6397. type := t(SyntaxTree.MathArrayType);
  6398. IF type.form = SyntaxTree.Static THEN
  6399. imm := IntermediateCode.Immediate(sizeType,val);
  6400. next := NewLabel();
  6401. BrneL(next,imm,res);
  6402. IF increment THEN
  6403. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6404. ELSE
  6405. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6406. END;
  6407. Emit(MovReplace(position,res,imm));
  6408. BrL(end);
  6409. ELSE hasDynamicPart := TRUE;
  6410. END;
  6411. t := type.arrayBase.resolved;
  6412. val := val + 1;
  6413. IF next # NIL THEN SetLabel(next) END;
  6414. END;
  6415. IF hasDynamicPart THEN
  6416. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6417. Emit(Mov(position,res2,dim));
  6418. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6419. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6420. Emit(Add(position,res2,res2,imm));
  6421. Emit(Add(position,res2,res2,operand.tag));
  6422. IntermediateCode.MakeMemory(res2,sizeType);
  6423. Emit(MovReplace(position,res,res2));
  6424. ReleaseIntermediateOperand(res2);
  6425. END;
  6426. SetLabel(end);
  6427. Convert(res,sizeType);
  6428. InitOperand(result,ModeValue);
  6429. result.op := res;
  6430. END;
  6431. END MathArrayLenOrIncr;
  6432. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6433. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6434. offset: LONGINT;
  6435. BEGIN
  6436. offset := operand.dimOffset+DynamicDim(type)-1;
  6437. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6438. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6439. val := SHORT(dim.intValue);
  6440. t := SemanticChecker.ArrayBase(type,val);
  6441. type := t.resolved(SyntaxTree.ArrayType);
  6442. IF type.form = SyntaxTree.Static THEN
  6443. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6444. ELSE
  6445. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6446. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6447. END;
  6448. UseIntermediateOperand(res);
  6449. InitOperand(result,ModeValue);
  6450. result.op := res;
  6451. ELSE
  6452. Convert(dim,addressType);
  6453. IF ~isUnchecked THEN
  6454. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6455. END;
  6456. end := NewLabel(); next := NIL;
  6457. (* ReuseCopy(dim,res); *)
  6458. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6459. Emit(Mov(position,res,dim));
  6460. Convert(res,sizeType);
  6461. Convert(res,sizeType);
  6462. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6463. WHILE t IS SyntaxTree.ArrayType DO
  6464. type := t(SyntaxTree.ArrayType);
  6465. IF type.form = SyntaxTree.Static THEN
  6466. imm := IntermediateCode.Immediate(sizeType,val);
  6467. next := NewLabel();
  6468. BrneL(next,imm,res);
  6469. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6470. Emit(MovReplace(position,res,imm));
  6471. BrL(end);
  6472. ELSE hasDynamicPart := TRUE;
  6473. END;
  6474. t := type.arrayBase.resolved;
  6475. val := val + 1;
  6476. IF next # NIL THEN SetLabel(next) END;
  6477. END;
  6478. IF hasDynamicPart THEN
  6479. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6480. Convert(res2,addressType);
  6481. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6482. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6483. Emit(Sub(position,res2,imm,res2));
  6484. Emit(Add(position,res2,res2,operand.tag));
  6485. IntermediateCode.MakeMemory(res2,sizeType);
  6486. Emit(MovReplace(position,res,res2));
  6487. ReleaseIntermediateOperand(res2);
  6488. END;
  6489. SetLabel(end);
  6490. Convert(res,sizeType);
  6491. InitOperand(result,ModeValue);
  6492. result.op := res;
  6493. END;
  6494. END ArrayLen;
  6495. (**
  6496. create a temporary variable in current scope
  6497. **)
  6498. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6499. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6500. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6501. BEGIN
  6502. IF ~register THEN
  6503. v := temporaries.GetFreeVariable(type, untraced, index);
  6504. ELSE
  6505. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6506. END;
  6507. scope := currentScope;
  6508. (*
  6509. v := NIL; (* disable free variable managemenet for the time being *)
  6510. *)
  6511. name := temporaries.GetUID();
  6512. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6513. variable.SetType(type);
  6514. variable.SetAccess(SyntaxTree.Hidden);
  6515. variable.SetUntraced(untraced);
  6516. IF v = NIL THEN
  6517. temporaries.AddVariable(variable);
  6518. IF ~register THEN
  6519. IF scope.lastVariable # NIL THEN
  6520. offset := scope.lastVariable.offsetInBits;
  6521. ELSE
  6522. offset := 0;
  6523. END;
  6524. DEC(offset,system.SizeOf(variable.type));
  6525. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6526. variable(SyntaxTree.Variable).SetOffset(offset);
  6527. scope.AddVariable(variable(SyntaxTree.Variable));
  6528. scope.EnterSymbol(variable, duplicate);
  6529. ASSERT(~duplicate);
  6530. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6531. ELSE
  6532. variable.SetUseRegister(TRUE);
  6533. variable(SyntaxTree.Variable).SetOffset(0);
  6534. END;
  6535. ELSE (* v # NIL *)
  6536. (* reuse slot for new variable, do not create new slot ! *)
  6537. temporaries.SetVariable(index, variable);
  6538. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6539. ASSERT(~register);
  6540. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6541. ASSERT(v.offsetInBits # 0);
  6542. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6543. scope.EnterSymbol(variable, duplicate);
  6544. ASSERT(~duplicate);
  6545. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6546. END;
  6547. RETURN variable(SyntaxTree.Variable)
  6548. END GetTemporaryVariable;
  6549. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6550. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6551. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6552. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6553. i: LONGINT; duplicate: BOOLEAN;
  6554. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6555. VAR variable: SyntaxTree.Variable;
  6556. BEGIN
  6557. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6558. variable.SetType(type);
  6559. recordScope.AddVariable(variable);
  6560. END AddVariable;
  6561. BEGIN
  6562. name := "@ArrayDescriptor";
  6563. Basic.AppendNumber(name,dimensions);
  6564. identifier := SyntaxTree.NewIdentifier(name);
  6565. parentScope := module.module.moduleScope;
  6566. symbol := parentScope.FindSymbol(identifier);
  6567. IF symbol # NIL THEN
  6568. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6569. type := typeDeclaration.declaredType;
  6570. ELSE
  6571. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6572. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6573. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6574. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6575. recordType.SetTypeDeclaration(typeDeclaration);
  6576. recordType.SetState(SyntaxTree.Resolved);
  6577. typeDeclaration.SetDeclaredType(recordType);
  6578. AddVariable("@ptr",system.anyType);
  6579. AddVariable("@adr",system.addressType);
  6580. AddVariable("@flags",system.addressType);
  6581. AddVariable("@dim",system.addressType);
  6582. AddVariable("@elementSize",system.addressType);
  6583. FOR i := 0 TO dimensions-1 DO
  6584. name := "@len";
  6585. Basic.AppendNumber(name,i);
  6586. AddVariable(name,system.addressType);
  6587. name := "@incr";
  6588. Basic.AppendNumber(name,i);
  6589. AddVariable(name,system.addressType);
  6590. END;
  6591. parentScope.AddTypeDeclaration(typeDeclaration);
  6592. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6593. ASSERT(~duplicate);
  6594. type := recordType;
  6595. END;
  6596. RETURN type
  6597. END GetMathArrayDescriptorType;
  6598. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6599. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6600. BEGIN
  6601. NEW(string, LEN(s)); COPY(s, string^);
  6602. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6603. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6604. sv.SetType(type);
  6605. Designate(sv,res);
  6606. Emit(Push(position,res.tag));
  6607. Emit(Push(position,res.op));
  6608. ReleaseOperand(res);
  6609. END PushConstString;
  6610. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6611. BEGIN
  6612. IF b THEN
  6613. Emit(Push(Basic.invalidPosition, true));
  6614. ELSE
  6615. Emit(Push(Basic.invalidPosition, false));
  6616. END;
  6617. END PushConstBoolean;
  6618. PROCEDURE PushConstSet(v: SET);
  6619. VAR value: SyntaxTree.Value; op: Operand;
  6620. BEGIN
  6621. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6622. value.SetType(system.setType);
  6623. Evaluate(value, op);
  6624. Emit(Push(Basic.invalidPosition, op.op));
  6625. ReleaseOperand(op);
  6626. END PushConstSet;
  6627. PROCEDURE PushConstInteger(v: LONGINT);
  6628. VAR value: SyntaxTree.Value; op: Operand;
  6629. BEGIN
  6630. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6631. value.SetType(system.longintType);
  6632. Evaluate(value, op);
  6633. Emit(Push(Basic.invalidPosition, op.op));
  6634. ReleaseOperand(op);
  6635. END PushConstInteger;
  6636. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6637. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6638. section: IntermediateCode.Section;
  6639. BEGIN
  6640. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6641. Global.GetSymbolSegmentedName(symbol, name);
  6642. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6643. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6644. procedure.SetScope(moduleScope);
  6645. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6646. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6647. procedure.SetAccess(SyntaxTree.Hidden);
  6648. currentScope := procedureScope;
  6649. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6650. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  6651. RETURN section;
  6652. END OpenInitializer;
  6653. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6654. BEGIN
  6655. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6656. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6657. section := prev;
  6658. END CloseInitializer;
  6659. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6660. VAR name: SyntaxTree.IdentifierString;
  6661. parameter: SyntaxTree.Parameter;
  6662. type: SyntaxTree.Type;
  6663. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6664. BEGIN
  6665. InitOperand(op,ModeReference);
  6666. op.op := fp;
  6667. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6668. Dereference(op, x, FALSE);
  6669. result := op;
  6670. Symbol(symbol, op);
  6671. END Field;
  6672. PROCEDURE Direction(direction: LONGINT): SET;
  6673. BEGIN
  6674. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6675. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6676. ELSE HALT(100);
  6677. END;
  6678. END Direction;
  6679. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6680. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6681. BEGIN
  6682. Field(port, op);
  6683. ToMemory(op.op,addressType,0);
  6684. Emit(Push(Basic.invalidPosition, op.op));
  6685. ReleaseOperand(op);
  6686. Basic.GetString(modifier.identifier, name);
  6687. PushConstString(name);
  6688. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6689. ASSERT(SemanticChecker.IsStringType(value.type));
  6690. Designate(value, op);
  6691. Emit(Push(modifier.position, op.tag));
  6692. Emit(Push(modifier.position, op.op));
  6693. ReleaseOperand(op);
  6694. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6695. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6696. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6697. Evaluate(value, op);
  6698. Emit(Push(modifier.position, op.op));
  6699. ReleaseOperand(op);
  6700. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6701. ELSE
  6702. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6703. END;
  6704. END AddPortProperty;
  6705. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6706. VAR modifier: SyntaxTree.Modifier;
  6707. BEGIN
  6708. modifier := parameter.modifiers;
  6709. WHILE modifier # NIL DO
  6710. AddPortProperty(parameter,modifier, modifier.expression);
  6711. modifier := modifier.nextModifier;
  6712. END;
  6713. END AddPortProperties;
  6714. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6715. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6716. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6717. PROCEDURE PushLens(type: SyntaxTree.Type);
  6718. BEGIN
  6719. IF IsSemiDynamicArray(type) THEN
  6720. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6721. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6722. Emit(Push(Basic.invalidPosition, op.op));
  6723. ReleaseOperand(op);
  6724. INC(dim);
  6725. ELSIF IsStaticArray(type) THEN
  6726. len := len * type(SyntaxTree.ArrayType).staticLength;
  6727. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6728. INC(dim);
  6729. ELSE
  6730. baseType := type;
  6731. END;
  6732. END PushLens;
  6733. BEGIN
  6734. (* cell *)
  6735. IF parameter.type IS SyntaxTree.ArrayType THEN
  6736. type := parameter.type;
  6737. dim := 0;
  6738. len := 1;
  6739. PushLens(type);
  6740. portType := baseType.resolved(SyntaxTree.PortType);
  6741. ELSE
  6742. portType := parameter.type(SyntaxTree.PortType);
  6743. END;
  6744. PushSelfPointer();
  6745. (* port / array of ports *)
  6746. IF IsStaticArray(type) THEN
  6747. PushConstInteger(len);
  6748. END;
  6749. Field(parameter, op);
  6750. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6751. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6752. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6753. Designate(d, op);*)
  6754. Emit(Push(Basic.invalidPosition, op.op));
  6755. ReleaseOperand(op);
  6756. (* name *)
  6757. PushConstString(name);
  6758. (* inout *)
  6759. PushConstSet(Direction(portType.direction));
  6760. (* width *)
  6761. PushConstInteger(portType.sizeInBits);
  6762. IF parameter.type IS SyntaxTree.PortType THEN
  6763. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6764. AddPortProperties(parameter);
  6765. ELSIF IsStaticArray(type)THEN
  6766. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6767. ELSIF IsSemiDynamicArray(type) THEN
  6768. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6769. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6770. Emit(Add(position,reg, sp, size));
  6771. (* dim *)
  6772. PushConstInteger(dim);
  6773. (* len array *)
  6774. Emit(Push(position, reg));
  6775. ReleaseIntermediateOperand(reg);
  6776. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6777. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6778. Emit(Add(position, sp,sp, size));
  6779. ELSE
  6780. HALT(100);
  6781. END;
  6782. END Parameter;
  6783. BEGIN
  6784. IF backend.cellsAreObjects THEN
  6785. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6786. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6787. END;
  6788. parameter := x.firstParameter;
  6789. WHILE (parameter # NIL) DO
  6790. type := parameter.type.resolved;
  6791. WHILE (type IS SyntaxTree.ArrayType) DO
  6792. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6793. END;
  6794. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6795. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6796. Parameter(name,parameter);
  6797. END;
  6798. parameter := parameter.nextParameter;
  6799. END;
  6800. ELSE HALT(200)
  6801. END;
  6802. END AddPorts;
  6803. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6804. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6805. BEGIN
  6806. Symbol(cell,op);
  6807. ToMemory(op.op,addressType,0);
  6808. Emit(Push(position,op.op));
  6809. ReleaseOperand(op);
  6810. property.GetName(name);
  6811. (* does not work when inheritance is used:
  6812. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6813. *)
  6814. PushConstString(name);
  6815. IF (value # NIL) THEN
  6816. ASSERT(
  6817. SemanticChecker.IsStringType(property.type)
  6818. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6819. OR (property.type.resolved IS SyntaxTree.FloatType)
  6820. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6821. OR (property.type.resolved IS SyntaxTree.SetType)
  6822. );
  6823. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6824. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6825. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6826. Designate(d, op);
  6827. IF SemanticChecker.IsStringType(property.type) THEN
  6828. Emit(Push(Basic.invalidPosition, op.tag))
  6829. END;
  6830. Emit(Push(Basic.invalidPosition, op.op));
  6831. ReleaseOperand(op);
  6832. END;
  6833. IF value = NIL THEN
  6834. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6835. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6836. ASSERT(SemanticChecker.IsStringType(value.type));
  6837. Designate(value, op);
  6838. PushString(op, value.type);
  6839. ReleaseOperand(op);
  6840. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6841. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6842. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6843. Evaluate(value, op);
  6844. Emit(Push(property.position, op.op));
  6845. ReleaseOperand(op);
  6846. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6847. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6848. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6849. Evaluate(value, op);
  6850. Emit(Push(property.position, op.op));
  6851. ReleaseOperand(op);
  6852. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6853. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6854. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6855. Evaluate(value, op);
  6856. Emit(Push(property.position, op.op));
  6857. ReleaseOperand(op);
  6858. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6859. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6860. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6861. Evaluate(value, op);
  6862. Emit(Push(property.position, op.op));
  6863. ReleaseOperand(op);
  6864. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6865. ELSE
  6866. HALT(200);
  6867. END;
  6868. END AddProperty;
  6869. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6870. VAR symbol: SyntaxTree.Symbol;
  6871. BEGIN
  6872. WHILE modifier # NIL DO
  6873. symbol := cellType.FindProperty(modifier.identifier);
  6874. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6875. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6876. modifier := modifier.nextModifier;
  6877. END;
  6878. END AddModifiers;
  6879. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6880. VAR last: SyntaxTree.Modifier;
  6881. BEGIN
  6882. IF to = NIL THEN
  6883. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6884. ELSE
  6885. last := to;
  6886. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6887. last := last.nextModifier;
  6888. END;
  6889. IF last.identifier # this.identifier THEN
  6890. ASSERT(last.nextModifier = NIL);
  6891. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6892. END;
  6893. END;
  6894. END AppendModifier;
  6895. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6896. BEGIN
  6897. WHILE this # NIL DO
  6898. AppendModifier(to, this);
  6899. this := this.nextModifier;
  6900. END;
  6901. END AppendModifiers;
  6902. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6903. VAR base: SyntaxTree.Type;
  6904. BEGIN
  6905. AppendModifiers(to, c.modifiers);
  6906. base := c.GetBaseValueType();
  6907. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6908. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6909. END;
  6910. END AppendCellTypeModifiers;
  6911. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6912. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6913. BEGIN
  6914. Basic.GetString(modifier.identifier, name);
  6915. PushConstString(name);
  6916. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6917. ASSERT(SemanticChecker.IsStringType(value.type));
  6918. Designate(value, op);
  6919. PushString(op, value.type);
  6920. ReleaseOperand(op);
  6921. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6922. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6923. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6924. Evaluate(value, op);
  6925. Emit(Push(modifier.position, op.op));
  6926. ReleaseOperand(op);
  6927. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6928. ELSE
  6929. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6930. END;
  6931. END AddPortProperty;
  6932. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6933. BEGIN
  6934. WHILE modifier # NIL DO
  6935. AddPortProperty(modifier, modifier.expression);
  6936. modifier := modifier.nextModifier;
  6937. END;
  6938. END AddPortProperties;
  6939. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6940. VAR op: Operand;
  6941. BEGIN
  6942. Evaluate(p, op);
  6943. Emit(Push(p.position, op.op));
  6944. ReleaseOperand(op);
  6945. IF p IS SyntaxTree.Designator THEN
  6946. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6947. END;
  6948. END PushPort;
  6949. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6950. VAR tmp: IntermediateCode.Operand;
  6951. BEGIN
  6952. actualType := actualType.resolved;
  6953. IF actualType IS SyntaxTree.StringType THEN
  6954. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6955. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6956. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6957. ELSE
  6958. tmp := op.tag;
  6959. IntermediateCode.MakeMemory(tmp,addressType);
  6960. Emit(Push(position,tmp));
  6961. END;
  6962. Emit(Push(position,op.op))
  6963. END PushString;
  6964. (* conservative check if x is potentially on the heap, excluding the module heap
  6965. required for generational garbage collector
  6966. *)
  6967. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6968. BEGIN
  6969. RETURN TRUE;
  6970. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6971. passed by reference.
  6972. pos := x.position.start;
  6973. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6974. x := x(SyntaxTree.Designator).left;
  6975. END;
  6976. RETURN x # NIL;
  6977. *)
  6978. END OnHeap;
  6979. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6980. VAR
  6981. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6982. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6983. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6984. tmp:IntermediateCode.Operand;
  6985. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6986. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6987. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6988. dest: IntermediateCode.Operand;
  6989. staticLength: LONGINT; itype: IntermediateCode.Type;
  6990. convert,isTensor: BOOLEAN;
  6991. recordType: SyntaxTree.RecordType;
  6992. baseType: SyntaxTree.Type;
  6993. left: SyntaxTree.Expression;
  6994. call: SyntaxTree.Designator;
  6995. procedure: SyntaxTree.Procedure;
  6996. temporaryVariable: SyntaxTree.Variable;
  6997. dummy: IntermediateCode.Operand;
  6998. customBuiltin: SyntaxTree.CustomBuiltin;
  6999. isVarPar: ARRAY 3 OF BOOLEAN;
  7000. callsection: Sections.Section;
  7001. segmentedName: Basic.SegmentedName;
  7002. needsTrace: BOOLEAN;
  7003. n: ARRAY 256 OF CHAR;
  7004. modifier: SyntaxTree.Modifier;
  7005. previous, init: IntermediateCode.Section;
  7006. prevScope: SyntaxTree.Scope;
  7007. firstPar: LONGINT;
  7008. saved: RegisterEntry;
  7009. callingConvention: SyntaxTree.CallingConvention;
  7010. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7011. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7012. priority: IntermediateCode.Operand;
  7013. op,callop: Operand;
  7014. BEGIN
  7015. IF type = NIL THEN RETURN END;
  7016. type := type.resolved;
  7017. IF type IS SyntaxTree.PointerType THEN
  7018. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7019. END;
  7020. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7021. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7022. recordScope := type(SyntaxTree.RecordType).recordScope;
  7023. IF recordScope.bodyProcedure # NIL THEN
  7024. procedure := recordScope.bodyProcedure;
  7025. body := procedure.procedureScope.body;
  7026. Emit(Push(position,self));
  7027. IF body.isActive THEN
  7028. StaticCallOperand(callop,procedure);
  7029. Emit(Push(position,callop.op));
  7030. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7031. Convert(priority,sizeType);
  7032. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7033. END;
  7034. Emit(Push(position,priority));
  7035. ReleaseIntermediateOperand(priority);
  7036. IF backend.cooperative THEN
  7037. Emit(Push(position,self));
  7038. CallThis(position,"Activities","Create",3)
  7039. ELSE
  7040. flags := 0;
  7041. IF body.isSafe THEN
  7042. flags := 1;
  7043. END;
  7044. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7045. Emit(Push(position,self));
  7046. CallThis(position,"Objects","CreateProcess",4)
  7047. END;
  7048. ELSE
  7049. Emit(Push(position,self));
  7050. StaticCallOperand(callop,procedure);
  7051. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7052. END;
  7053. Emit(Pop(position,self));
  7054. END;
  7055. END CallBodies;
  7056. PROCEDURE PushTD(type: SyntaxTree.Type);
  7057. VAR op: IntermediateCode.Operand;
  7058. BEGIN
  7059. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7060. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7061. ELSE
  7062. IF type.resolved IS SyntaxTree.PointerType THEN
  7063. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7064. END;
  7065. op := TypeDescriptorAdr(type.resolved);
  7066. Emit(Push(position,op));
  7067. END
  7068. END PushTD;
  7069. BEGIN
  7070. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7071. dest := destination; destination := emptyOperand;
  7072. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7073. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7074. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7075. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7076. CASE x.id OF
  7077. (* ---- COPY ----- *)
  7078. |Global.Copy:
  7079. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7080. (* ---- EXCL, INCL----- *)
  7081. |Global.Excl,Global.Incl:
  7082. Evaluate(p0,s0);
  7083. Evaluate(p1,s1);
  7084. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7085. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7086. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7087. END;
  7088. ReuseCopy(res,s0.op);
  7089. ReleaseOperand(s0);
  7090. Reuse1(tmp,s1.op);
  7091. ReleaseOperand(s1);
  7092. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7093. IF x.id = Global.Excl THEN
  7094. Emit(Not(position,tmp,tmp));
  7095. Emit(And(position,res,res,tmp));
  7096. ELSE
  7097. Emit(Or(position,res,res,tmp));
  7098. END;
  7099. ReleaseIntermediateOperand(tmp);
  7100. Designate(p0,s0);
  7101. ToMemory(s0.op,s1.op.type,0);
  7102. Emit(Mov(position,s0.op,res));
  7103. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7104. (* ---- DISPOSE ----- *)
  7105. |Global.Dispose:
  7106. Designate(p0,s0);
  7107. Emit(Push(position,s0.op));
  7108. ReleaseOperand(s0);
  7109. CallThis(position,"Runtime","Dispose", 1);
  7110. (* ---- GETPROCEDURE ----- *)
  7111. |Global.GetProcedure:
  7112. Designate(p0,s0);
  7113. PushString(s0,p0.type);
  7114. Designate(p1,s1);
  7115. PushString(s1,p1.type);
  7116. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7117. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7118. ELSE PushTD(procedureType.firstParameter.type)
  7119. END;
  7120. PushTD(procedureType.returnType);
  7121. Designate(p2,s2);
  7122. Emit(Push(position,s2.op));
  7123. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7124. CallThis(position,"Modules","GetProcedure", 7);
  7125. (* ---- ASH, LSH, ROT ----- *)
  7126. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7127. Evaluate(p0,s0);
  7128. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7129. (* make unsigned arguments in order to produced a logical shift *)
  7130. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7131. convert:= TRUE;
  7132. itype := s0.op.type;
  7133. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7134. Convert(s0.op,itype);
  7135. ELSE
  7136. convert := FALSE;
  7137. END;
  7138. END;
  7139. Evaluate(p1,s1);
  7140. IF IsIntegerConstant(p1,hint) THEN
  7141. ReuseCopy(reg,s0.op);
  7142. IF hint > 0 THEN
  7143. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7144. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7145. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7146. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7147. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7148. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7149. END;
  7150. ELSIF hint < 0 THEN
  7151. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7152. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7153. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7154. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7155. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7156. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7157. END;
  7158. END;
  7159. ReleaseOperand(s0); ReleaseOperand(s1);
  7160. ELSE
  7161. exit := NewLabel();
  7162. end := NewLabel();
  7163. ReuseCopy(reg,s0.op);
  7164. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7165. Reuse1(tmp,s1.op);
  7166. Emit(Neg(position,tmp,s1.op));
  7167. Convert(tmp,s1.op.type);
  7168. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7169. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7170. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7171. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7172. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7173. END;
  7174. ReleaseIntermediateOperand(tmp);
  7175. BrL(end);
  7176. SetLabel(exit);
  7177. ReuseCopy(tmp,s1.op);
  7178. Convert(tmp,s1.op.type);
  7179. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7180. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7181. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7182. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7183. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7184. END;
  7185. ReleaseIntermediateOperand(tmp);
  7186. SetLabel(end);
  7187. ReleaseOperand(s0); ReleaseOperand(s1);
  7188. END;
  7189. InitOperand(result,ModeValue);
  7190. IF convert THEN
  7191. itype := reg.type;
  7192. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7193. Convert(reg,itype);
  7194. END;
  7195. result.op := reg;
  7196. (* ---- CAP ----- *)
  7197. |Global.Cap:
  7198. Evaluate(p0,result);
  7199. ReuseCopy(reg,result.op);
  7200. ReleaseIntermediateOperand(result.op);
  7201. ignore := NewLabel();
  7202. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7203. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7204. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7205. SetLabel(ignore);
  7206. result.op := reg;
  7207. (* ---- CHR ----- *)
  7208. |Global.Chr, Global.Chr32:
  7209. Evaluate(p0,result);
  7210. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7211. |Global.Entier, Global.EntierH:
  7212. Evaluate(p0,result);
  7213. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7214. (* ---- MIN and MAX ----- *)
  7215. |Global.Max,Global.Min:
  7216. Evaluate(p0,s0);
  7217. Evaluate(p1,s1);
  7218. Reuse2(res,s0.op,s1.op);
  7219. else := NewLabel();
  7220. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7221. ELSE BrltL(else,s1.op,s0.op) END;
  7222. Emit(Mov(position,res,s0.op));
  7223. ReleaseOperand(s0);
  7224. end := NewLabel();
  7225. BrL(end);
  7226. SetLabel(else);
  7227. Emit(MovReplace(position,res,s1.op));
  7228. SetLabel(end);
  7229. ReleaseOperand(s1);
  7230. InitOperand(result,ModeValue);
  7231. result.op := res;
  7232. (* ---- ODD ----- *)
  7233. |Global.Odd:
  7234. IF ~conditional THEN
  7235. ConditionToValue(x)
  7236. ELSE
  7237. Evaluate(p0,result);
  7238. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7239. Reuse1(res,result.op);
  7240. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7241. ReleaseIntermediateOperand(result.op);
  7242. result.op := res;
  7243. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7244. ReleaseOperand(result);
  7245. BrL(falseLabel);
  7246. END;
  7247. (* ---- ORD ----- *)
  7248. |Global.Ord, Global.Ord32:
  7249. Evaluate(p0,result);
  7250. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7251. (* ---- SHORT, LONG ----- *)
  7252. |Global.Short, Global.Long:
  7253. Evaluate(p0,result);
  7254. IF x.type IS SyntaxTree.ComplexType THEN
  7255. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7256. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7257. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7258. ELSE
  7259. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7260. END
  7261. (* ---- HALT, SYSTEM.HALT----- *)
  7262. |Global.Halt, Global.systemHalt:
  7263. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7264. EmitTrap (position, val);
  7265. (* ---- ASSERT ----- *)
  7266. |Global.Assert:
  7267. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7268. trueL := NewLabel();
  7269. falseL := NewLabel();
  7270. Condition(p0,trueL,falseL);
  7271. IF p1 = NIL THEN val := AssertTrap
  7272. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7273. END;
  7274. SetLabel(falseL);
  7275. EmitTrap(position,val);
  7276. SetLabel(trueL);
  7277. END;
  7278. (*
  7279. Emit(TrapC(result.op,val);
  7280. *)
  7281. (* ---- INC, DEC----- *)
  7282. |Global.Inc,Global.Dec:
  7283. Expression(p0); adr := result.op;
  7284. LoadValue(result,p0.type); l := result;
  7285. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7286. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7287. END;
  7288. IF x.id = Global.Inc THEN
  7289. Emit(Add(position,l.op,l.op,r.op));
  7290. ELSE
  7291. Emit(Sub(position,l.op,l.op,r.op));
  7292. END;
  7293. ReleaseOperand(l); ReleaseOperand(r);
  7294. (* ---- LEN ----- *)
  7295. |Global.Len: (* dynamic length, static length done by checker *)
  7296. Designate(p0,operand);
  7297. IF p1 = NIL THEN
  7298. InitOperand(l,ModeValue);
  7299. l.op := IntermediateCode.Immediate(sizeType,0);
  7300. ELSE
  7301. Evaluate(p1,l);
  7302. END;
  7303. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7304. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7305. Dereference(operand, p0.type.resolved, FALSE);
  7306. END;
  7307. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7308. ReleaseOperand(operand); ReleaseOperand(l);
  7309. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7310. ASSERT(p1 # NIL);
  7311. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7312. Dereference(operand,p0.type.resolved,FALSE);
  7313. END;
  7314. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7315. ReleaseOperand(operand); ReleaseOperand(l);
  7316. ELSE HALT(100);
  7317. END;
  7318. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7319. (* ---- FIRST ---- *)
  7320. |Global.First:
  7321. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7322. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7323. ELSE
  7324. Designate(p0, result)
  7325. END
  7326. (* ---- LAST ---- *)
  7327. |Global.Last:
  7328. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7329. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7330. ELSE
  7331. Designate(p0, result);
  7332. (* make sure result.op is a register *)
  7333. tmp := result.op;
  7334. ReuseCopy(result.op, result.op);
  7335. ReleaseIntermediateOperand(tmp);
  7336. (* add offset to result.op *)
  7337. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7338. END
  7339. (* ---- STEP ---- *)
  7340. |Global.Step:
  7341. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7342. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7343. ELSE
  7344. Designate(p0, result);
  7345. (* make sure result.op is a register *)
  7346. tmp := result.op;
  7347. ReuseCopy(result.op, result.op);
  7348. ReleaseIntermediateOperand(tmp);
  7349. (* add offset to result.op *)
  7350. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7351. END
  7352. (* ---- RE ---- *)
  7353. |Global.Re:
  7354. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7355. Designate(p0, result)
  7356. ELSE
  7357. Evaluate(p0, result)
  7358. END
  7359. (* ---- IM ---- *)
  7360. |Global.Im:
  7361. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7362. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7363. Designate(p0, result);
  7364. (* make sure result.op is a register *)
  7365. tmp := result.op;
  7366. ReuseCopy(result.op, result.op);
  7367. ReleaseIntermediateOperand(tmp);
  7368. (* add offset to result.op *)
  7369. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7370. (* ---- ABS ----- *)
  7371. |Global.Abs:
  7372. Evaluate(p0,operand);
  7373. type := p0.type.resolved;
  7374. InitOperand(result,ModeValue);
  7375. Reuse1a(result.op,operand.op,dest);
  7376. Emit(Abs(position,result.op,operand.op));
  7377. ReleaseOperand(operand);
  7378. (* ---- WAIT ----- *)
  7379. |Global.Wait:
  7380. Evaluate(p0,operand);
  7381. Emit(Push(position,operand.op));
  7382. ReleaseOperand(operand);
  7383. CallThis(position,"Activities","Wait", 1);
  7384. (* ---- NEW ----- *)
  7385. |Global.New:
  7386. (*! the following code is only correct for "standard" Oberon calling convention *)
  7387. IF x.type # NIL THEN
  7388. type := x.type.resolved;
  7389. firstPar := 0;
  7390. ELSE
  7391. type := p0.type.resolved;
  7392. firstPar := 1;
  7393. END;
  7394. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7395. THEN
  7396. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7397. IF backend.cooperative THEN
  7398. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7399. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7400. IF recordType.isObject THEN
  7401. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7402. IF recordType.IsActive() THEN
  7403. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7404. END;
  7405. IF recordType.IsProtected() THEN
  7406. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7407. END;
  7408. ELSE
  7409. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7410. END;
  7411. END;
  7412. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7413. CallThis(position,"Runtime","New", 1);
  7414. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7415. Emit(Result(position, pointer));
  7416. exit := NewLabel();
  7417. BreqL(exit,pointer,nil);
  7418. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7419. GetRecordTypeName (recordType,name);
  7420. IF ~recordType.isObject THEN
  7421. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7422. END;
  7423. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7424. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7425. IF recordType.isObject THEN
  7426. IF recordType.IsProtected() THEN
  7427. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7428. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7429. END;
  7430. IF recordType.IsActive() THEN
  7431. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7432. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7433. END;
  7434. END;
  7435. END;
  7436. (* initialize fields *)
  7437. IF type(SyntaxTree.PointerType).isPlain THEN
  7438. size := 0;
  7439. ELSIF recordType.isObject THEN
  7440. size := BaseObjectTypeSize;
  7441. ELSE
  7442. size := BaseRecordTypeSize;
  7443. END;
  7444. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7445. (* call initializer *)
  7446. constructor := GetConstructor(recordType);
  7447. IF constructor # NIL THEN
  7448. (*! should be unified with ProcedureCallDesignator *)
  7449. Emit(Push(position,pointer));
  7450. ReleaseIntermediateOperand(pointer);
  7451. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7452. FOR i := firstPar TO x.parameters.Length()-1 DO
  7453. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7454. formalParameter := formalParameter.nextParameter;
  7455. END;
  7456. (* static call of the constructor *)
  7457. GetCodeSectionNameForSymbol(constructor,name);
  7458. ASSERT(~constructor.isInline);
  7459. IF constructor.scope.ownerModule # module.module THEN
  7460. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7461. ELSE
  7462. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7463. END;
  7464. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7465. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7466. Emit(Pop(position,pointer));
  7467. END;
  7468. (* call bodies *)
  7469. CallBodies(pointer,type);
  7470. SetLabel(exit);
  7471. needsTrace := p0.NeedsTrace();
  7472. IF needsTrace THEN ModifyAssignments(true) END;
  7473. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7474. Emit(Push(position, pointer));
  7475. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7476. Emit(Pop(position, pointer));
  7477. END;
  7478. Designate(p0,l);
  7479. IF needsTrace THEN
  7480. CallAssignPointer(l.op, pointer);
  7481. ELSE
  7482. ToMemory(l.op,addressType,0);
  7483. Emit(Mov(position,l.op,pointer));
  7484. END;
  7485. ReleaseIntermediateOperand(pointer);
  7486. ReleaseOperand(l);
  7487. IF needsTrace THEN ModifyAssignments(false) END;
  7488. ELSE (* not cooperative backend *)
  7489. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7490. IF temporaryVariable # NIL THEN
  7491. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7492. ELSE
  7493. Designate(p0,l);
  7494. END;
  7495. (* l.op contains address of pointer to record *)
  7496. Emit(Push(position,l.op)); (* address for use after syscall *)
  7497. Emit(Push(position,l.op));
  7498. ReleaseOperand(l);
  7499. (* push type descriptor *)
  7500. reg := TypeDescriptorAdr(recordType);
  7501. Emit(Push(position,reg));
  7502. ReleaseIntermediateOperand(reg);
  7503. (* push realtime flag *)
  7504. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7505. ELSE Emit(Push(position,false));
  7506. END;
  7507. CallThis(position,"Heaps","NewRec", 3);
  7508. (* check allocation success, if not successful then do not call initializers and bodies *)
  7509. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7510. Emit(Pop(position,pointer));
  7511. MakeMemory(reg,pointer,addressType,0);
  7512. ReleaseIntermediateOperand(pointer);
  7513. pointer := reg;
  7514. exit := NewLabel();
  7515. BreqL(exit,pointer,nil);
  7516. Emit(Push(position,pointer));
  7517. (* initialize fields *)
  7518. InitFields(recordType, pointer,0);
  7519. (* call initializer *)
  7520. constructor := GetConstructor(recordType);
  7521. IF constructor # NIL THEN
  7522. (*! should be unified with ProcedureCallDesignator *)
  7523. Emit(Push(position,pointer));
  7524. ReleaseIntermediateOperand(pointer);
  7525. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7526. FOR i := firstPar TO x.parameters.Length()-1 DO
  7527. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7528. formalParameter := formalParameter.nextParameter;
  7529. END;
  7530. (* static call of the constructor *)
  7531. GetCodeSectionNameForSymbol(constructor,name);
  7532. ASSERT(~constructor.isInline);
  7533. IF constructor.scope.ownerModule # module.module THEN
  7534. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7535. ELSE
  7536. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7537. END;
  7538. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7539. ELSE
  7540. ReleaseIntermediateOperand(pointer);
  7541. END;
  7542. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7543. Emit(Pop(position,pointer));
  7544. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7545. Designate(p0,l);
  7546. IF backend.writeBarriers & OnHeap(p0) THEN
  7547. SaveRegisters();ReleaseUsedRegisters(saved);
  7548. Emit(Push(position,l.op));
  7549. Emit(Push(position,pointer));
  7550. CallThis(position,"Heaps","Assign",2);
  7551. RestoreRegisters(saved);
  7552. ELSE
  7553. ToMemory(l.op,addressType,0);
  7554. Emit(Mov(position,l.op,pointer));
  7555. END;
  7556. ReleaseOperand(l);
  7557. result.tag := emptyOperand;
  7558. ELSIF (x.type # NIL) THEN
  7559. result := l; (* temporary variable is the result of NEW Type() *)
  7560. END;
  7561. (* call bodies *)
  7562. CallBodies(pointer,type);
  7563. ReleaseIntermediateOperand(pointer);
  7564. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7565. end := NewLabel();
  7566. BrL(end);
  7567. SetLabel(exit);
  7568. Designate(p0,l);
  7569. ToMemory(l.op,addressType,0);
  7570. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7571. ReleaseOperand(l);
  7572. SetLabel(end);
  7573. ELSE
  7574. SetLabel(exit);
  7575. END;
  7576. END;
  7577. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7578. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7579. IF ~backend.cooperative THEN (* simpler version *)
  7580. (*
  7581. push len0
  7582. push len1
  7583. push len2
  7584. push len_size
  7585. push len_adr
  7586. push tag
  7587. push static elements
  7588. push element size
  7589. push adr
  7590. *)
  7591. dim := 0;
  7592. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7593. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7594. parameter := x.parameters.GetExpression(i);
  7595. Evaluate(parameter,r);
  7596. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7597. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7598. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7599. END;
  7600. Emit(Push(position,r.op));
  7601. ReleaseOperand(r);
  7602. INC(dim);
  7603. END;
  7604. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7605. Emit(Mov(position, adr, sp));
  7606. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7607. Emit(Push(position, adr));
  7608. ReleaseIntermediateOperand(adr);
  7609. openDim := dim;
  7610. staticLength := 1;
  7611. IF type IS SyntaxTree.ArrayType THEN
  7612. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7613. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7614. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7615. END;
  7616. END;
  7617. IF SemanticChecker.ContainsPointer(type) THEN
  7618. tmp := TypeDescriptorAdr(type);
  7619. ELSE
  7620. tmp := nil;
  7621. END;
  7622. Emit(Push(position,tmp)); (* type descriptor *)
  7623. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7624. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7625. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7626. Designate(p0,l);
  7627. Emit(Push(position,l.op)); (* address *)
  7628. ReleaseOperand(l);
  7629. CallThis(position,"Heaps","NewArray", 6);
  7630. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7631. Emit(Add(position,sp,sp,tmp));
  7632. ELSE
  7633. dim := 0;
  7634. IntermediateCode.InitOperand(reg);
  7635. IF p1 # NIL THEN
  7636. FOR i := firstPar TO x.parameters.Length()-1 DO
  7637. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7638. parameter := x.parameters.GetExpression(i);
  7639. Evaluate(parameter,r);
  7640. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7641. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7642. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7643. END;
  7644. Emit(Push(position,r.op));
  7645. IF i=1 THEN
  7646. CopyInt(reg,r.op);
  7647. ELSE
  7648. MulInt(reg, reg, r.op);
  7649. END;
  7650. ReleaseOperand(r);
  7651. INC(dim);
  7652. END;
  7653. Convert(reg,addressType);
  7654. ELSE
  7655. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7656. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7657. END;
  7658. openDim := dim;
  7659. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7660. IF backend.cooperative THEN
  7661. size := ToMemoryUnits(system,system.SizeOf(type));
  7662. WHILE type IS SyntaxTree.ArrayType DO
  7663. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7664. END;
  7665. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7666. IF (size # 1) THEN
  7667. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7668. END;
  7669. Emit(Push(position,reg));
  7670. size := ToMemoryUnits(system,system.SizeOf(type));
  7671. IF (size # 1) THEN
  7672. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7673. END;
  7674. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7675. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7676. Emit(Push(position,reg));
  7677. ReleaseIntermediateOperand(reg);
  7678. CallThis(position,"Runtime","New", 1);
  7679. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7680. Emit(Result(position, pointer));
  7681. exit := NewLabel();
  7682. else := NewLabel();
  7683. BreqL(else,pointer,nil);
  7684. IF ~type.hasPointers THEN
  7685. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7686. ELSIF type IS SyntaxTree.RecordType THEN
  7687. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7688. ELSIF type IS SyntaxTree.ProcedureType THEN
  7689. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7690. ELSE
  7691. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7692. END;
  7693. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7694. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7695. 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))));
  7696. IF type IS SyntaxTree.RecordType THEN
  7697. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7698. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7699. ELSE
  7700. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7701. END;
  7702. i := openDim;
  7703. WHILE i > 0 DO
  7704. DEC (i);
  7705. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7706. END;
  7707. needsTrace := p0.NeedsTrace();
  7708. IF needsTrace THEN ModifyAssignments(true) END;
  7709. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7710. Emit(Push(position, pointer));
  7711. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7712. Emit(Pop(position, pointer));
  7713. END;
  7714. Designate(p0,l);
  7715. IF needsTrace THEN
  7716. CallAssignPointer(l.op, pointer);
  7717. ModifyAssignments(false);
  7718. ELSE
  7719. ToMemory(l.op,addressType,0);
  7720. Emit(Mov(position,l.op,pointer));
  7721. END;
  7722. ReleaseIntermediateOperand(pointer);
  7723. ReleaseOperand(l);
  7724. BrL(exit);
  7725. SetLabel(else);
  7726. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7727. Designate(p0,l);
  7728. IF needsTrace THEN
  7729. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7730. ELSE
  7731. ToMemory(l.op,addressType,0);
  7732. Emit(Mov(position,l.op,pointer));
  7733. END;
  7734. ReleaseOperand(l);
  7735. SetLabel(exit);
  7736. ELSE
  7737. (*! the following code is only correct for "standard" Oberon calling convention *)
  7738. IF SemanticChecker.ContainsPointer(type) THEN
  7739. IF type IS SyntaxTree.ArrayType THEN
  7740. staticLength := 1;
  7741. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7742. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7743. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7744. END;
  7745. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7746. MulInt(reg,reg,tmp);
  7747. END;
  7748. Designate(p0,l);
  7749. IF openDim > 0 THEN
  7750. Emit(Push(position,l.op)); (* address for use after syscall *)
  7751. END;
  7752. Emit(Push(position,l.op)); (* address *)
  7753. ReleaseOperand(l);
  7754. tmp := TypeDescriptorAdr(type);
  7755. Emit(Push(position,tmp)); (* type descriptor *)
  7756. ReleaseIntermediateOperand(tmp);
  7757. Emit(Push(position,reg)); (* number Elements *)
  7758. ReleaseIntermediateOperand(reg);
  7759. tmp := IntermediateCode.Immediate(addressType,dim);
  7760. Emit(Push(position,tmp)); (* dimensions *)
  7761. (* push realtime flag *)
  7762. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7763. ELSE Emit(Push(position,false));
  7764. END;
  7765. CallThis(position,"Heaps","NewArr",5)
  7766. ELSE
  7767. size := ToMemoryUnits(system,system.SizeOf(type));
  7768. IF (size # 1) THEN
  7769. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7770. (*
  7771. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7772. *)
  7773. END;
  7774. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7775. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7776. AddInt(reg, reg, tmp);
  7777. (*
  7778. Emit(Add(position,reg,reg,tmp));
  7779. *)
  7780. Designate(p0,l);
  7781. IF openDim >0 THEN
  7782. Emit(Push(position,l.op)); (* address for use after syscall *)
  7783. END;
  7784. Emit(Push(position,l.op)); (* address for syscall *)
  7785. ReleaseOperand(l); (* pointer address *)
  7786. Emit(Push(position,reg)); (* size *)
  7787. ReleaseIntermediateOperand(reg);
  7788. (* push realtime flag *)
  7789. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7790. ELSE Emit(Push(position,false));
  7791. END;
  7792. CallThis(position,"Heaps","NewSys", 3)
  7793. END;
  7794. IF openDim > 0 THEN
  7795. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7796. Emit(Pop(position,adr));
  7797. ToMemory(adr,addressType,0);
  7798. ReuseCopy(tmp,adr);
  7799. ReleaseIntermediateOperand(adr);
  7800. adr := tmp;
  7801. else := NewLabel();
  7802. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7803. i := openDim-1;
  7804. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7805. WHILE (i >= 0) DO
  7806. Emit(Pop(position,reg));
  7807. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7808. Emit(Mov(position,res,reg));
  7809. DEC(i);
  7810. END;
  7811. ReleaseIntermediateOperand(adr);
  7812. ReleaseIntermediateOperand(reg);
  7813. exit := NewLabel();
  7814. BrL(exit);
  7815. SetLabel(else);
  7816. (* else part: array could not be allocated *)
  7817. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7818. Emit(Add(position,sp,sp,tmp));
  7819. SetLabel(exit);
  7820. END;
  7821. END;
  7822. END;
  7823. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7824. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7825. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7826. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7827. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7828. callingConvention := procedureType.callingConvention;
  7829. left.SetType(procedure.type);
  7830. formalParameter := procedureType.firstParameter;
  7831. (* push array to allocate *)
  7832. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7833. formalParameter :=formalParameter.nextParameter;
  7834. (* push length array *)
  7835. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7836. (* push size *)
  7837. type := t0;
  7838. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7839. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7840. END;
  7841. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7842. Emit(Push(position,tmp));
  7843. (* *)
  7844. IF SemanticChecker.ContainsPointer(type) THEN
  7845. tmp := TypeDescriptorAdr(type);
  7846. ELSE
  7847. tmp := IntermediateCode.Immediate(addressType, 0);
  7848. END;
  7849. Emit(Push(position,tmp)); (* type descriptor *)
  7850. StaticCallOperand(result,procedure);
  7851. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7852. ReleaseOperand(result);
  7853. END;
  7854. (*
  7855. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7856. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7857. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7858. *)
  7859. ELSE
  7860. (*
  7861. push len0
  7862. push len1
  7863. push len2
  7864. push size
  7865. push len_adr
  7866. push element_size
  7867. push tag
  7868. push adr
  7869. *)
  7870. dim := 0;
  7871. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7872. isTensor := TRUE;
  7873. ELSE
  7874. isTensor := FALSE;
  7875. END;
  7876. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7877. IF ~isTensor THEN
  7878. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7879. END;
  7880. parameter := x.parameters.GetExpression(i);
  7881. Evaluate(parameter,r);
  7882. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7883. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7884. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7885. END;
  7886. Emit(Push(position,r.op));
  7887. ReleaseOperand(r);
  7888. INC(dim);
  7889. END;
  7890. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7891. Emit(Mov(position, adr, sp));
  7892. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7893. Emit(Push(position, adr));
  7894. ReleaseIntermediateOperand(adr);
  7895. openDim := dim;
  7896. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7897. IF isTensor THEN
  7898. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7899. ELSE
  7900. baseType := SemanticChecker.ArrayBase(type,openDim);
  7901. END;
  7902. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7903. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7904. IF SemanticChecker.ContainsPointer(baseType) THEN
  7905. tmp := TypeDescriptorAdr(baseType);
  7906. ELSE
  7907. tmp := nil;
  7908. END;
  7909. Emit(Push(position,tmp)); (* type descriptor *)
  7910. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7911. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7912. ELSE (* error message has already been emited *)
  7913. RETURN;
  7914. END;
  7915. Designate(p0,l);
  7916. IF isTensor THEN
  7917. Emit(Push(position,l.op)); (* address *)
  7918. ELSE
  7919. Emit(Push(position,l.tag)); (* address *)
  7920. END;
  7921. ReleaseOperand(l);
  7922. StaticCallOperand(result,procedure);
  7923. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7924. ReleaseOperand(result);
  7925. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7926. Emit(Add(position,sp,sp,tmp));
  7927. END;
  7928. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7929. THEN
  7930. IF ~backend.cellsAreObjects THEN RETURN END;
  7931. IF InCellScope(currentScope) THEN
  7932. PushSelfPointer()
  7933. ELSE
  7934. Emit(Push(position, nil));
  7935. END;
  7936. (* push temp address *)
  7937. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7938. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7939. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7940. (* l.op contains address of pointer to record *)
  7941. Emit(Push(position,l.op)); (* address for use after syscall *)
  7942. ReleaseOperand(l);
  7943. (* push type descriptor *)
  7944. reg := TypeDescriptorAdr(baseType);
  7945. Emit(Push(position,reg));
  7946. ReleaseIntermediateOperand(reg);
  7947. (* push name *)
  7948. (*Global.GetSymbolName(p0, n);*)
  7949. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7950. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7951. ELSE
  7952. Global.GetModuleName(module.module, n);
  7953. END;
  7954. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7955. (*type.typeDeclaration.GetName(n);*)
  7956. PushConstString(n);
  7957. (* push cellnet boolean *)
  7958. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7959. (* push engine boolean *)
  7960. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7961. (* allocate *)
  7962. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7963. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7964. (* l.op contains address of pointer to record *)
  7965. ToMemory(l.op,addressType,0);
  7966. (* l.op contains value of pointer to record *)
  7967. InitFields(baseType, l.op,0);
  7968. (* add capabilities *)
  7969. modifier := p0(SyntaxTree.Designator).modifiers;
  7970. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7971. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7972. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7973. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7974. END;
  7975. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7976. (*
  7977. modifier := baseType(SyntaxTree.CellType).modifiers;
  7978. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7979. modifier := p0(SyntaxTree.Designator).modifiers;
  7980. *)
  7981. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7982. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7983. (* l.op contains address of pointer to record *)
  7984. ToMemory(l.op,addressType,0);
  7985. (* l.op contains value of pointer to record *)
  7986. Emit(Push(position,l.op)); (* address for use after syscall *)
  7987. ReleaseOperand(l);
  7988. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7989. prevScope := currentScope;
  7990. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7991. previous := section;
  7992. section := init;
  7993. (* add ports *)
  7994. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7995. CloseInitializer(previous);
  7996. currentScope := prevScope;
  7997. Symbol(temporaryVariable,l);
  7998. ToMemory(l.op,addressType,0);
  7999. Emit(Push(position,l.op));
  8000. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8001. (*
  8002. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8003. IF constructor # NIL THEN
  8004. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8005. FOR i := 1 TO x.parameters.Length()-1 DO
  8006. p := x.parameters.GetExpression(i);
  8007. Global.GetSymbolName(parameter,name);
  8008. Evaluate(p, value);
  8009. ASSERT(value.type # NIL);
  8010. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8011. par := instance.AddParameter(name);
  8012. par.SetInteger(value.integer);
  8013. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8014. par := instance.AddParameter(name);
  8015. par.SetBoolean(value.boolean);
  8016. ELSE Error(x.position,NotYetImplemented)
  8017. END;
  8018. parameter := parameter.nextParameter
  8019. END;
  8020. END;
  8021. *)
  8022. (* call initializer *)
  8023. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8024. IF constructor # NIL THEN
  8025. (*! should be unified with ProcedureCallDesignator *)
  8026. IF backend.cellsAreObjects THEN
  8027. Symbol(temporaryVariable,l);
  8028. ToMemory(l.op,addressType,0);
  8029. Emit(Push(position,l.op));
  8030. ReleaseOperand(l);
  8031. END;
  8032. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8033. FOR i := firstPar TO x.parameters.Length()-1 DO
  8034. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8035. formalParameter := formalParameter.nextParameter;
  8036. END;
  8037. (* static call of the constructor *)
  8038. Global.GetSymbolSegmentedName(constructor,name);
  8039. ASSERT(~constructor.isInline);
  8040. IF constructor.scope.ownerModule # module.module THEN
  8041. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8042. ELSE
  8043. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8044. END;
  8045. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8046. (*ELSE
  8047. ReleaseIntermediateOperand(pointer);*)
  8048. END;
  8049. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8050. ToMemory(l.op, addressType, 0);
  8051. Designate(p0,s0);
  8052. ToMemory(s0.op,addressType,0);
  8053. Emit(Mov(position,s0.op,l.op));
  8054. ReleaseOperand(l);
  8055. ReleaseOperand(s0);
  8056. result.tag := emptyOperand;
  8057. (* start *)
  8058. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8059. (* push cell *)
  8060. Symbol(temporaryVariable, l);
  8061. ToMemory(l.op,addressType,0);
  8062. Emit(Push(Basic.invalidPosition,l.op));
  8063. (* push delegate *)
  8064. Emit(Push(Basic.invalidPosition,l.op));
  8065. ReleaseOperand(l);
  8066. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8067. Emit(Push(position, s1.op));
  8068. ReleaseOperand(s1);
  8069. CallThis(position,"ActiveCellsRuntime","Start",3);
  8070. END;
  8071. (*IF temporaryVariable # NIL THEN
  8072. end := NewLabel();
  8073. BrL(end);
  8074. SetLabel(exit);
  8075. Designate(p0,l);
  8076. ToMemory(l.op,addressType,0);
  8077. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8078. ReleaseOperand(l);
  8079. SetLabel(end);
  8080. ELSE
  8081. SetLabel(exit);
  8082. END;
  8083. *)
  8084. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8085. ELSE (* no pointer to record, no pointer to array *)
  8086. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8087. (* ignore new statement *)
  8088. Warning(p0.position, "cannot run on final hardware");
  8089. ELSE
  8090. HALT(200);
  8091. END;
  8092. END;
  8093. (* ---- ADDRESSOF----- *)
  8094. |Global.systemAdr:
  8095. Designate(p0,s0);
  8096. s0.mode := ModeValue;
  8097. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8098. ReleaseIntermediateOperand(s0.op);
  8099. s0.op := s0.tag;
  8100. IntermediateCode.InitOperand(s0.tag);
  8101. END;
  8102. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8103. result := s0;
  8104. (* ---- BIT ----- *)
  8105. |Global.systemBit:
  8106. Evaluate(p0,s0);
  8107. ToMemory(s0.op,addressType,0);
  8108. ReuseCopy(res,s0.op);
  8109. ReleaseOperand(s0);
  8110. Evaluate(p1,s1);
  8111. Emit(Ror(position,res,res,s1.op));
  8112. ReleaseOperand(s1);
  8113. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8114. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8115. IF ~conditional THEN
  8116. InitOperand(result,ModeValue); result.op := res;
  8117. ELSE
  8118. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8119. BrL(falseLabel);
  8120. ReleaseIntermediateOperand(res);
  8121. END;
  8122. (* --- MSK ----*)
  8123. |Global.systemMsk:
  8124. Evaluate(p0,s0);
  8125. Evaluate(p1,s1);
  8126. ReuseCopy(res,s0.op);
  8127. ReleaseOperand(s0);
  8128. Emit(And(position,res,res,s1.op));
  8129. ReleaseOperand(s1);
  8130. InitOperand(result,ModeValue);
  8131. result.op := res;
  8132. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8133. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8134. Evaluate(p0,s0);
  8135. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8136. ReleaseOperand(s0);
  8137. InitOperand(result,ModeValue);
  8138. result.op := res;
  8139. (* ---- SYSTEM.GetStackPointer ----- *)
  8140. |Global.systemGetStackPointer:
  8141. InitOperand(result,ModeValue);
  8142. result.op := sp;
  8143. (* ---- SYSTEM.GetFramePointer ----- *)
  8144. |Global.systemGetFramePointer:
  8145. InitOperand(result,ModeValue);
  8146. result.op := fp;
  8147. (* ---- SYSTEM.GetActivity ----- *)
  8148. |Global.systemGetActivity:
  8149. ASSERT(backend.cooperative);
  8150. InitOperand(result,ModeValue);
  8151. result.op := ap;
  8152. (* ---- SYSTEM.SetStackPointer ----- *)
  8153. |Global.systemSetStackPointer:
  8154. Evaluate(p0,s0); (* *)
  8155. Emit(Mov(position,sp,s0.op));
  8156. ReleaseOperand(s0);
  8157. (* ---- SYSTEM.SetFramePointer ----- *)
  8158. |Global.systemSetFramePointer:
  8159. Evaluate(p0,s0); (* *)
  8160. Emit(Mov(position,fp,s0.op));
  8161. ReleaseOperand(s0);
  8162. (* ---- SYSTEM.Activity ----- *)
  8163. |Global.systemSetActivity:
  8164. ASSERT(backend.cooperative);
  8165. Evaluate(p0,s0); (* *)
  8166. Emit(Mov(position,ap,s0.op));
  8167. ReleaseOperand(s0);
  8168. (* ---- SYSTEM.VAL ----- *)
  8169. |Global.systemVal:
  8170. Expression(p1);
  8171. s1 := result;
  8172. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8173. IF s1.mode = ModeReference THEN
  8174. (* nothing to be done if not record type, just take over new type *)
  8175. IF (type IS SyntaxTree.RecordType) THEN
  8176. ReleaseIntermediateOperand(s1.tag);
  8177. s1.tag := TypeDescriptorAdr(type);
  8178. UseIntermediateOperand(s1.tag);
  8179. END;
  8180. result := s1;
  8181. ELSE (* copy over result to different type, may not use convert *)
  8182. itype := IntermediateCode.GetType(system,type);
  8183. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8184. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8185. Emit(Mov(position,s0.op,s1.op));
  8186. ReleaseOperand(s1);
  8187. InitOperand(result,ModeValue);
  8188. result.op := s0.op;
  8189. ELSE (* different size, must convert *)
  8190. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8191. Convert(s1.op, IntermediateCode.GetType(system,type));
  8192. result := s1;
  8193. END;
  8194. END;
  8195. (* ---- SYSTEM.GET ----- *)
  8196. |Global.systemGet:
  8197. Evaluate(p0,s0); (* adr *)
  8198. Designate(p1,s1); (* variable *)
  8199. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8200. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8201. Emit(Mov(position,s1.op,s0.op));
  8202. ReleaseOperand(s1);
  8203. ReleaseOperand(s0);
  8204. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8205. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8206. Evaluate(p0,s0); (* *)
  8207. Evaluate(p1,s1); (* variable *)
  8208. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8209. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8210. (* real part *)
  8211. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8212. Emit(Mov(position,res, s1.op));
  8213. ReleaseIntermediateOperand(res);
  8214. (* imaginary part *)
  8215. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8216. Emit(Mov(position,res, s1.tag));
  8217. ReleaseIntermediateOperand(res);
  8218. ReleaseOperand(s1);
  8219. ReleaseOperand(s0);
  8220. ELSE
  8221. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8222. ReleaseOperand(s0);
  8223. Emit(Mov(position,res,s1.op));
  8224. ReleaseIntermediateOperand(res);
  8225. ReleaseOperand(s1);
  8226. END;
  8227. (* ---- SYSTEM.MOVE ----- *)
  8228. |Global.systemMove:
  8229. Evaluate(p0,s0);
  8230. Evaluate(p1,s1);
  8231. Evaluate(p2,s2);
  8232. Emit(Copy(position,s1.op,s0.op,s2.op));
  8233. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8234. (* ---- SYSTEM.NEW ----- *)
  8235. |Global.systemNew:
  8236. Designate(p0,s0);
  8237. Emit(Push(position,s0.op));
  8238. ReleaseOperand(s0);
  8239. Evaluate(p1,s1);
  8240. Emit(Push(position,s1.op));
  8241. ReleaseOperand(s1);
  8242. (* push realtime flag: false by default *)
  8243. Emit(Push(position,false));
  8244. CallThis(position,"Heaps","NewSys",3);
  8245. (* ---- SYSTEM.CALL ----- *)
  8246. |Global.systemRef:
  8247. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8248. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8249. s0.mode := ModeValue;
  8250. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8251. result := s0
  8252. (* ---- INCR ----- *)
  8253. |Global.Incr:
  8254. Designate(p0,operand);
  8255. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8256. Dereference(operand,p0.type.resolved,FALSE);
  8257. END;
  8258. ASSERT(p1 # NIL);
  8259. Evaluate(p1,l);
  8260. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8261. ReleaseOperand(operand); ReleaseOperand(l);
  8262. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8263. (* ---- SUM ----- *)
  8264. |Global.Sum: HALT(200);
  8265. (* ---- ALL ----- *)
  8266. |Global.All: HALT(200);
  8267. (* ---- CAS ----- *)
  8268. |Global.Cas:
  8269. needsTrace := p0.NeedsTrace();
  8270. IF needsTrace THEN ModifyAssignments(true) END;
  8271. Designate(p0,s0);
  8272. Evaluate(p1,s1);
  8273. Evaluate(p2,s2);
  8274. IF needsTrace THEN
  8275. Emit(Push(position, s0.op));
  8276. Emit(Push(position, s1.op));
  8277. Emit(Push(position, s2.op));
  8278. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8279. ELSE
  8280. Emit(Cas(position,s0.op,s1.op,s2.op));
  8281. END;
  8282. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8283. IF needsTrace THEN ModifyAssignments(false) END;
  8284. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8285. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8286. IF conditional THEN
  8287. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8288. BrL(falseLabel);
  8289. ReleaseIntermediateOperand(res);
  8290. END;
  8291. (* ---- DIM ----- *)
  8292. |Global.Dim:
  8293. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8294. Designate(p0,s0);
  8295. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8296. Dereference(s0,p0.type.resolved,FALSE);
  8297. END;
  8298. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8299. ReleaseOperand(s0);
  8300. (* ---- RESHAPE ----- *)
  8301. |Global.Reshape:
  8302. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8303. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8304. left.SetType(procedure.type);
  8305. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8306. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8307. END;
  8308. (* ---- SYSTEM.TYPECODE ----- *)
  8309. |Global.systemTypeCode:
  8310. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8311. IF type.resolved IS SyntaxTree.PointerType THEN
  8312. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8313. END;
  8314. result.op := TypeDescriptorAdr(type);
  8315. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8316. result.mode := ModeValue;
  8317. (* ---- SYSTEM.TRACE ----- *)
  8318. |Global.systemTrace:
  8319. SystemTrace(x.parameters, x.position);
  8320. (* ----- CONNECT ------*)
  8321. |Global.Connect:
  8322. IF backend.cellsAreObjects THEN
  8323. PushPort(p0);
  8324. PushPort(p1);
  8325. IF p2 # NIL THEN
  8326. Evaluate(p2, s2);
  8327. Emit(Push(p2.position, s2.op));
  8328. ReleaseOperand(s2);
  8329. ELSE
  8330. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8331. END;
  8332. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8333. ELSE
  8334. Warning(x.position, "cannot run on final hardware");
  8335. END;
  8336. (* ----- DELEGATE ------*)
  8337. |Global.Delegate:
  8338. IF backend.cellsAreObjects THEN
  8339. PushPort(p0);
  8340. PushPort(p1);
  8341. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8342. ELSE
  8343. Warning(x.position, "cannot run on final hardware");
  8344. END;
  8345. (* ----- SEND ------*)
  8346. |Global.Send:
  8347. Evaluate(p0,s0);
  8348. Evaluate(p1,s1);
  8349. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8350. Emit(Push(position,s0.op));
  8351. Emit(Push(position,s1.op));
  8352. (*
  8353. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8354. *)
  8355. IF ~backend.cellsAreObjects THEN
  8356. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8357. END;
  8358. ReleaseOperand(s0);
  8359. ReleaseOperand(s1);
  8360. IF backend.cellsAreObjects THEN
  8361. CallThis(position,"ActiveCellsRuntime","Send",2);
  8362. ELSE
  8363. CallThis(position,ChannelModuleName,"Send",2);
  8364. END;
  8365. (* ----- RECEIVE ------*)
  8366. |Global.Receive:
  8367. Evaluate(p0,s0);
  8368. Emit(Push(position,s0.op));
  8369. Designate(p1,s1);
  8370. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8371. Emit(Push(position,s1.op));
  8372. IF p2 # NIL THEN
  8373. Designate(p2,s2);
  8374. Emit(Push(position,s2.op));
  8375. END;
  8376. (*
  8377. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8378. *)
  8379. IF ~backend.cellsAreObjects THEN
  8380. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8381. END;
  8382. ReleaseOperand(s0);
  8383. ReleaseOperand(s1);
  8384. ReleaseOperand(s2);
  8385. IF backend.cellsAreObjects THEN
  8386. IF p2 = NIL THEN
  8387. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8388. ELSE
  8389. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8390. END;
  8391. ELSE
  8392. IF p2 = NIL THEN
  8393. CallThis(position,ChannelModuleName,"Receive",2)
  8394. ELSE
  8395. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8396. END;
  8397. END;
  8398. | Global.systemSpecial:
  8399. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8400. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8401. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8402. (* determine if parameters are of the VAR kind *)
  8403. ASSERT(x.parameters.Length() <= 3);
  8404. formalParameter := procedureType.firstParameter;
  8405. FOR i := 0 TO x.parameters.Length() - 1 DO
  8406. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8407. formalParameter := formalParameter.nextParameter
  8408. END;
  8409. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8410. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8411. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8412. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8413. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8414. IF procedureType.returnType # NIL THEN
  8415. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8416. Emit(Result(position, res));
  8417. (*InitOperand(result,ModeValue);
  8418. result.op := res;
  8419. *)
  8420. IF ~conditional THEN
  8421. InitOperand(result,ModeValue); result.op := res;
  8422. ELSE
  8423. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8424. BrL(falseLabel);
  8425. ReleaseIntermediateOperand(res);
  8426. END;
  8427. END
  8428. ELSE (* function not yet implemented *)
  8429. Error(position,"not yet implemented");
  8430. END;
  8431. destination := dest;
  8432. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8433. END VisitBuiltinCallDesignator;
  8434. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8435. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8436. BEGIN
  8437. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8438. dest := destination; destination := emptyOperand;
  8439. Expression(x.left);
  8440. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8441. ELSIF isUnchecked THEN (* no check *)
  8442. ELSE
  8443. trueL := NewLabel();
  8444. falseL := NewLabel();
  8445. IF IsPointerToRecord(x.left.type,recordType) THEN
  8446. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8447. Emit(Mov(position,tag, result.op));
  8448. IF result.mode # ModeValue THEN
  8449. ptr := tag;
  8450. IntermediateCode.MakeMemory(ptr,addressType);
  8451. Emit(Mov(position,tag, ptr));
  8452. END;
  8453. IF ~backend.cooperative THEN
  8454. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8455. END;
  8456. IntermediateCode.MakeMemory(tag,addressType);
  8457. ELSE
  8458. tag := result.tag;
  8459. UseIntermediateOperand(tag);
  8460. END;
  8461. TypeTest(tag,x.type,trueL,falseL,FALSE);
  8462. ReleaseIntermediateOperand(tag);
  8463. SetLabel(falseL);
  8464. EmitTrap(position,TypeCheckTrap);
  8465. SetLabel(trueL);
  8466. END;
  8467. destination := dest;
  8468. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8469. END VisitTypeGuardDesignator;
  8470. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8471. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8472. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8473. VAR label: Label; pc: LONGINT;
  8474. BEGIN
  8475. IF backend.cooperative & ~isUnchecked THEN
  8476. pc := section.pc;
  8477. label := NewLabel();
  8478. BrneL(label, operand.op, nil);
  8479. EmitTrap(position, NilPointerTrap);
  8480. SetLabel(label);
  8481. INC(statCoopNilCheck, section.pc - pc);
  8482. END;
  8483. END NilCheck;
  8484. BEGIN
  8485. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8486. ReuseCopy(dereferenced,operand.op);
  8487. ReleaseOperand(operand);
  8488. operand.mode := ModeReference;
  8489. operand.op := dereferenced;
  8490. operand.tag := dereferenced;
  8491. UseIntermediateOperand(operand.tag);
  8492. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8493. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8494. ReleaseIntermediateOperand(operand.tag);
  8495. operand.tag := TypeDescriptorAdr(type);
  8496. ELSE
  8497. IF ~backend.cooperative THEN
  8498. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8499. END;
  8500. IntermediateCode.MakeMemory(operand.tag,addressType);
  8501. END;
  8502. NilCheck(operand.op);
  8503. ELSIF type IS SyntaxTree.ArrayType THEN
  8504. IF isUnsafe THEN
  8505. NilCheck(operand.op);
  8506. ReleaseIntermediateOperand(operand.tag);
  8507. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8508. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8509. ELSE
  8510. operand.tag := emptyOperand;
  8511. END;
  8512. ELSE
  8513. NilCheck(operand.op);
  8514. IF backend.cooperative THEN
  8515. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8516. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8517. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8518. ELSE
  8519. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8520. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8521. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8522. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8523. END;
  8524. END;
  8525. ELSIF type IS SyntaxTree.MathArrayType THEN
  8526. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8527. IntermediateCode.MakeMemory(operand.op,addressType);
  8528. ELSE HALT(100);
  8529. END;
  8530. END Dereference;
  8531. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8532. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8533. BEGIN
  8534. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8535. dest := destination; destination := emptyOperand;
  8536. Evaluate(x.left,d);
  8537. type := x.type.resolved;
  8538. prevIsUnchecked := isUnchecked;
  8539. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8540. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8541. END;
  8542. Dereference(d,type,IsUnsafePointer(x.left.type));
  8543. isUnchecked := prevIsUnchecked;
  8544. result := d;
  8545. 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
  8546. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8547. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8548. END;
  8549. END;
  8550. destination := dest;
  8551. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8552. END VisitDereferenceDesignator;
  8553. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8554. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8555. BEGIN
  8556. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8557. dest := destination; destination := emptyOperand;
  8558. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8559. tag := result.op;
  8560. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8561. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8562. StaticCallOperand(result,procedure.super);
  8563. ReleaseIntermediateOperand(result.tag);
  8564. UseIntermediateOperand(tag); (* necessary ? *)
  8565. result.tag := tag;
  8566. destination := dest;
  8567. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8568. END VisitSupercallDesignator;
  8569. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8570. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8571. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8572. name: Basic.SegmentedName;
  8573. procedure: SyntaxTree.Procedure;
  8574. procedureType: SyntaxTree.ProcedureType;
  8575. BEGIN
  8576. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8577. dest := destination; destination := emptyOperand;
  8578. scope := currentScope;
  8579. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8580. scope := scope.outerScope;
  8581. END;
  8582. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8583. moduleSection := meta.ModuleSection();
  8584. IF backend.cooperative THEN
  8585. moduleOffset := 0;
  8586. ELSE
  8587. moduleOffset := moduleSection.pc;
  8588. END;
  8589. result.mode := ModeValue;
  8590. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8591. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8592. result.mode := ModeValue;
  8593. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8594. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8595. ELSE
  8596. GetBaseRegister(basereg,currentScope,scope);
  8597. InitOperand(result,ModeReference);
  8598. result.op := basereg;
  8599. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8600. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8601. parametersSize := ProcParametersSize(procedure);
  8602. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8603. IF backend.cooperative THEN
  8604. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8605. END;
  8606. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8607. MakeMemory(result.op, result.op, addressType, 0);
  8608. END;
  8609. (* tag must be loaded when dereferencing SELF pointer *)
  8610. END;
  8611. destination := dest;
  8612. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8613. END VisitSelfDesignator;
  8614. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8615. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8616. BEGIN
  8617. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8618. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8619. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8620. parameter := procedureType.returnParameter;
  8621. IF currentIsInline THEN
  8622. map := currentMapper.Get(NIL);
  8623. IF map # NIL THEN
  8624. Designate(map.to, result);
  8625. ELSE
  8626. HALT(200);
  8627. END;
  8628. RETURN;
  8629. END;
  8630. VisitParameter(parameter);
  8631. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8632. END VisitResultDesignator;
  8633. (** values *)
  8634. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8635. BEGIN
  8636. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8637. IF conditional THEN
  8638. IF x.value THEN BrL(trueLabel)
  8639. ELSE BrL(falseLabel)
  8640. END;
  8641. ELSE
  8642. InitOperand(result,ModeValue);
  8643. IF x.value THEN result.op := true ELSE result.op := false END;
  8644. END;
  8645. END VisitBooleanValue;
  8646. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8647. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8648. BEGIN
  8649. Global.GetModuleSegmentedName(module.module, name);
  8650. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8651. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8652. RETURN section
  8653. END GetDataSection;
  8654. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8655. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8656. BEGIN
  8657. type := vop.type;
  8658. data := GetDataSection();
  8659. pc := EnterImmediate(data,vop);
  8660. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8661. IntermediateCode.MakeMemory(vop, type);
  8662. END GetImmediateMem;
  8663. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8664. BEGIN
  8665. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8666. InitOperand(result,ModeValue);
  8667. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8668. IF ~supportedImmediate(result.op) &~inData THEN
  8669. GetImmediateMem(result.op)
  8670. END;
  8671. END VisitIntegerValue;
  8672. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8673. BEGIN
  8674. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8675. InitOperand(result,ModeValue);
  8676. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8677. END VisitCharacterValue;
  8678. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8679. BEGIN
  8680. IF Trace THEN TraceEnter("VisitSetValue") END;
  8681. InitOperand(result,ModeValue);
  8682. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8683. END VisitSetValue;
  8684. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8685. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8686. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8687. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8688. BEGIN
  8689. numberElements := x.elements.Length();
  8690. FOR i := 0 TO numberElements-1 DO
  8691. expression := x.elements.GetExpression(i);
  8692. IF expression IS SyntaxTree.MathArrayExpression THEN
  8693. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8694. ELSE
  8695. inData := TRUE;
  8696. Evaluate(expression,op);
  8697. irv.Emit(Data(position,op.op));
  8698. inData := FALSE;
  8699. ReleaseOperand(op);
  8700. END;
  8701. END;
  8702. END RecursiveData;
  8703. BEGIN
  8704. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8705. IF ~TryConstantDeclaration() THEN
  8706. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8707. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8708. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8709. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8710. ELSE
  8711. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8712. END;
  8713. RecursiveData(x.array);
  8714. InitOperand(result,ModeReference);
  8715. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8716. END
  8717. END VisitMathArrayValue;
  8718. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8719. VAR constant: Sections.Section;
  8720. BEGIN
  8721. IF constantDeclaration = NIL THEN
  8722. RETURN FALSE
  8723. ELSE
  8724. (* Is a constant in this module: did we generate it already? *)
  8725. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8726. IF constant # NIL THEN
  8727. InitOperand(result,ModeReference);
  8728. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8729. RETURN TRUE;
  8730. END;
  8731. END;
  8732. RETURN FALSE
  8733. END TryConstantDeclaration;
  8734. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8735. BEGIN
  8736. constantDeclaration := x;
  8737. VExpression(x.value.resolved);
  8738. END VisitConstant;
  8739. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8740. BEGIN
  8741. IF Trace THEN TraceEnter("VisitRealValue") END;
  8742. InitOperand(result,ModeValue);
  8743. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8744. END VisitRealValue;
  8745. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8746. VAR
  8747. componentType: SyntaxTree.Type;
  8748. BEGIN
  8749. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8750. ASSERT(x.type IS SyntaxTree.ComplexType);
  8751. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8752. InitOperand(result,ModeValue);
  8753. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8754. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8755. END VisitComplexValue;
  8756. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8757. VAR i: LONGINT; name: Basic.SegmentedName;
  8758. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8759. BEGIN
  8760. IF Trace THEN TraceEnter("VisitStringValue") END;
  8761. IF ~TryConstantDeclaration() THEN
  8762. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8763. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8764. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8765. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8766. ELSE
  8767. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8768. END;
  8769. FOR i := 0 TO x.length-1 DO
  8770. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8771. irv.Emit(Data(position,op));
  8772. END;
  8773. InitOperand(result,ModeReference);
  8774. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8775. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8776. END
  8777. END VisitStringValue;
  8778. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8779. BEGIN
  8780. IF Trace THEN TraceEnter("VisitNilValue") END;
  8781. InitOperand(result,ModeValue);
  8782. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8783. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8784. END VisitNilValue;
  8785. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8786. BEGIN
  8787. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8788. InitOperand(result,ModeValue);
  8789. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8790. END VisitEnumerationValue;
  8791. (** symbols *)
  8792. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8793. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8794. END VisitImport;
  8795. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8796. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8797. BEGIN
  8798. IF scope # baseScope THEN
  8799. (* left := [fp+8] *)
  8800. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8801. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8802. ReuseCopy(left,right);
  8803. ReleaseIntermediateOperand(right);
  8804. scope := scope.outerScope; DEC(level);
  8805. (* { left := [left+8] } *)
  8806. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8807. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8808. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8809. Emit(Mov(position,left,right));
  8810. scope := scope.outerScope; DEC(level);
  8811. END;
  8812. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8813. result := left;
  8814. ELSE
  8815. result := fp;
  8816. END;
  8817. END GetBaseRegister;
  8818. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8819. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8820. BEGIN
  8821. IF Trace THEN TraceEnter("VisitVariable"); END;
  8822. type := x.type.resolved;
  8823. IF (x.useRegister) THEN
  8824. InitOperand(result, ModeValue);
  8825. IF x.registerNumber < 0 THEN
  8826. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8827. reg := x.registerNumber;
  8828. ELSE
  8829. reg := registerUsageCount.Map(x.registerNumber);
  8830. UseRegister(reg);
  8831. END;
  8832. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8833. ELSIF x.externalName # NIL THEN
  8834. InitOperand(result,ModeReference);
  8835. Basic.ToSegmentedName(x.externalName^, name);
  8836. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8837. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8838. InitOperand(result,ModeReference);
  8839. GetBaseRegister(result.op,currentScope,x.scope);
  8840. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8841. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8842. InitOperand(result,ModeReference);
  8843. GetCodeSectionNameForSymbol(x,name);
  8844. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8845. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8846. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8847. InitOperand(result,ModeReference);
  8848. GetCodeSectionNameForSymbol(x,name);
  8849. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8850. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8851. ELSE (* field, left designator must have been emitted *)
  8852. ASSERT(result.mode = ModeReference);
  8853. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8854. ReuseCopy(temp,result.op);
  8855. ReleaseIntermediateOperand(result.op);
  8856. result.op := temp;
  8857. END;
  8858. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8859. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8860. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8861. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8862. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8863. END;
  8864. END;
  8865. END;
  8866. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8867. ValueToCondition(result);
  8868. ELSIF type IS SyntaxTree.ProcedureType THEN
  8869. ReleaseIntermediateOperand(result.tag);
  8870. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8871. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8872. UseIntermediateOperand(result.tag);
  8873. ELSE
  8874. result.tag := nil; (* nil *)
  8875. END;
  8876. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8877. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8878. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8879. ReleaseIntermediateOperand(result.tag);
  8880. Global.GetSymbolSegmentedName(x,name);
  8881. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8882. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8883. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8884. ELSE
  8885. END;
  8886. ELSE
  8887. ReleaseIntermediateOperand(result.tag);
  8888. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8889. END;
  8890. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8891. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8892. ReleaseIntermediateOperand(result.tag);
  8893. result.tag := result.op;
  8894. UseIntermediateOperand(result.tag);
  8895. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8896. IntermediateCode.MakeMemory(result.op,addressType);
  8897. END;
  8898. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8899. ReleaseIntermediateOperand(result.tag);
  8900. result.tag := TypeDescriptorAdr(type);
  8901. UseIntermediateOperand(result.tag);
  8902. (* tag for pointer type computed not here but during dereferencing *)
  8903. END;
  8904. IF Trace THEN TraceExit("VisitVariable") END;
  8905. END VisitVariable;
  8906. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8907. BEGIN
  8908. VisitVariable(property);
  8909. END VisitProperty;
  8910. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8911. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  8912. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  8913. BEGIN
  8914. type := x.type.resolved;
  8915. IF Trace THEN TraceEnter("VisitParameter") END;
  8916. IF x.ownerType IS SyntaxTree.CellType THEN
  8917. ptype := x.type.resolved;
  8918. IF backend.cellsAreObjects THEN
  8919. ASSERT(result.mode = ModeReference);
  8920. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8921. ReuseCopy(temp,result.op);
  8922. ReleaseIntermediateOperand(result.op);
  8923. result.op := temp;
  8924. END;
  8925. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8926. RETURN;
  8927. ELSE
  8928. InitOperand(result,ModeReference);
  8929. GetCodeSectionNameForSymbol(x,name);
  8930. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8931. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8932. RETURN;
  8933. END;
  8934. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8935. InitOperand(result,ModeReference);
  8936. GetCodeSectionNameForSymbol(x,name);
  8937. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8938. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8939. RETURN
  8940. ELSE
  8941. GetBaseRegister(basereg,currentScope,x.scope);
  8942. InitOperand(result,ModeReference);
  8943. result.op := basereg;
  8944. END;
  8945. IF IsOpenArray(type) THEN
  8946. result.tag := basereg;
  8947. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8948. IntermediateCode.MakeMemory(result.op,addressType);
  8949. IF Global.IsOberonProcedure(x.ownerType) THEN
  8950. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8951. UseIntermediateOperand(result.tag);
  8952. ELSE
  8953. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8954. END;
  8955. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8956. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8957. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8958. ELSIF IsStaticArray(type) THEN
  8959. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8960. IntermediateCode.MakeMemory(result.op,addressType);
  8961. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8962. ELSIF type IS SyntaxTree.MathArrayType THEN
  8963. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8964. WITH type: SyntaxTree.MathArrayType DO
  8965. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8966. IF type.form = SyntaxTree.Tensor THEN
  8967. ELSIF type.form = SyntaxTree.Open THEN
  8968. result.tag := result.op;
  8969. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8970. IntermediateCode.MakeMemory(result.op,addressType);
  8971. UseIntermediateOperand(result.tag);
  8972. ELSIF type.form = SyntaxTree.Static THEN
  8973. IF x.kind = SyntaxTree.ConstParameter THEN
  8974. IntermediateCode.MakeMemory(result.op,addressType);
  8975. END;
  8976. ELSE HALT(100)
  8977. END;
  8978. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8979. IF type.form = SyntaxTree.Tensor THEN
  8980. ToMemory(result.op,addressType,0);
  8981. ELSIF type.form = SyntaxTree.Open THEN
  8982. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8983. ReuseCopy(result.tag, mem);
  8984. ReleaseIntermediateOperand(mem);
  8985. ReleaseIntermediateOperand(result.op);
  8986. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8987. ELSIF type.form = SyntaxTree.Static THEN
  8988. IntermediateCode.MakeMemory(result.op,addressType);
  8989. ELSE HALT(100)
  8990. END;
  8991. ELSE HALT(100)
  8992. END;
  8993. END;
  8994. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8995. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8996. IntermediateCode.MakeMemory(result.op,addressType);
  8997. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8998. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8999. END;
  9000. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  9001. ValueToCondition(result);
  9002. ELSIF type IS SyntaxTree.ProcedureType THEN
  9003. ReleaseIntermediateOperand(result.tag);
  9004. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9005. IF x.kind = SyntaxTree.VarParameter THEN
  9006. ReuseCopy(result.tag,result.op);
  9007. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9008. IntermediateCode.MakeMemory(result.tag,addressType);
  9009. ELSE
  9010. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9011. UseIntermediateOperand(result.tag);
  9012. END;
  9013. ELSE
  9014. result.tag := nil;
  9015. END;
  9016. (* tag for pointer type computed not here but during dereferencing *)
  9017. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9018. ReleaseIntermediateOperand(result.tag);
  9019. result.tag := basereg;
  9020. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9021. IntermediateCode.MakeMemory(result.tag,addressType);
  9022. UseIntermediateOperand(result.tag);
  9023. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9024. ReleaseIntermediateOperand(result.tag);
  9025. result.tag := TypeDescriptorAdr(type);
  9026. UseIntermediateOperand(result.tag);
  9027. END;
  9028. IF Trace THEN TraceExit("VisitParameter") END;
  9029. END VisitParameter;
  9030. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9031. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9032. BEGIN
  9033. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9034. (* left.p: left already emitted *)
  9035. tag := result.op; (* value of pointer to left *)
  9036. (* get type desc *)
  9037. tmp := result.tag;
  9038. IntermediateCode.MakeMemory(tmp,addressType);
  9039. (* get method adr *)
  9040. Reuse1(reg,tmp);
  9041. ReleaseIntermediateOperand(tmp);
  9042. IF backend.cooperative THEN
  9043. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9044. WHILE recordType.baseType # NIL DO
  9045. recordType := recordType.GetBaseRecord ();
  9046. END;
  9047. GetRecordTypeName (recordType,name);
  9048. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9049. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9050. offset := 0;
  9051. ELSE
  9052. offset := 2;
  9053. END;
  9054. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9055. ELSIF meta.simple THEN
  9056. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9057. ELSE
  9058. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9059. END;
  9060. InitOperand(operand,ModeReference);
  9061. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9062. operand.op := reg;
  9063. operand.tag := tag;
  9064. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9065. END DynamicCallOperand;
  9066. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9067. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9068. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9069. BEGIN
  9070. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9071. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9072. tag := operand.op;
  9073. ReleaseIntermediateOperand(operand.tag);
  9074. ELSE tag := nil
  9075. END;
  9076. IF x.isInline THEN
  9077. sectionType := Sections.InlineCodeSection;
  9078. ELSE
  9079. sectionType := Sections.CodeSection;
  9080. END;
  9081. IF x.externalName # NIL THEN
  9082. Basic.ToSegmentedName(x.externalName^, name);
  9083. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9084. ELSE
  9085. GetCodeSectionNameForSymbol(x, name);
  9086. IF (x.scope.ownerModule = module.module) THEN
  9087. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9088. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9089. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9090. IF source.pc = 0 THEN (* no code yet *)
  9091. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9092. END;
  9093. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9094. bits := x.procedureScope.body.code.inlineCode;
  9095. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9096. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9097. binary.CopyBits(bits, 0, bits.GetSize());
  9098. source.SetResolved(binary);
  9099. ELSE
  9100. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9101. END;
  9102. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9103. END;
  9104. InitOperand(operand,ModeValue);
  9105. operand.op := reg;
  9106. operand.tag := tag;
  9107. IF Trace THEN TraceExit("StaticCallOperand") END;
  9108. END StaticCallOperand;
  9109. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9110. (* handle expressions of the form designator.procedure or procedure *)
  9111. BEGIN
  9112. IF Trace THEN TraceEnter("VisitProcedure") END;
  9113. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9114. DynamicCallOperand(result,x);
  9115. ELSIF x.isInline THEN
  9116. StaticCallOperand(result,x);
  9117. ELSE
  9118. StaticCallOperand(result,x);
  9119. END;
  9120. IF Trace THEN TraceExit("VisitProcedure") END;
  9121. END VisitProcedure;
  9122. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9123. BEGIN
  9124. VisitProcedure(x);
  9125. END VisitOperator;
  9126. (** statements *)
  9127. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9128. BEGIN
  9129. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9130. Expression(x.call);
  9131. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9132. ReleaseOperand(result)
  9133. END;
  9134. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9135. END VisitProcedureCallStatement;
  9136. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9137. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9138. leftBase, rightBase: SyntaxTree.Type;
  9139. procedureName,s: SyntaxTree.IdentifierString;
  9140. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9141. size: LONGINT; rightKind: LONGINT;
  9142. dummy: IntermediateCode.Operand;
  9143. CONST moduleName = "FoxArrayBase";
  9144. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9145. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9146. BEGIN
  9147. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9148. IF base IS SyntaxTree.MathArrayType THEN
  9149. base := OpenArray(base(SyntaxTree.MathArrayType));
  9150. END;
  9151. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9152. result.SetArrayBase(base);
  9153. RETURN result
  9154. END OpenArray;
  9155. BEGIN
  9156. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9157. SaveRegisters();ReleaseUsedRegisters(saved);
  9158. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9159. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9160. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9161. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9162. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9163. IF leftType.form = SyntaxTree.Tensor THEN
  9164. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9165. ELSIF leftType.form = SyntaxTree.Open THEN
  9166. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9167. ELSIF leftType.form = SyntaxTree.Static THEN
  9168. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9169. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9170. END;
  9171. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9172. IF procedure = NIL THEN
  9173. s := "Instruction not supported on target, emulation procedure ";
  9174. Strings.Append(s,moduleName);
  9175. Strings.Append(s,".");
  9176. Strings.Append(s,procedureName);
  9177. Strings.Append(s," not present");
  9178. Error(position,s);
  9179. ELSE
  9180. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9181. parameter.SetType(leftType);
  9182. parameter.SetAccess(SyntaxTree.Internal);
  9183. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9184. parameter.SetKind(rightKind);
  9185. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9186. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9187. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9188. StaticCallOperand(result,procedure);
  9189. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9190. ReleaseOperand(result);
  9191. END;
  9192. RestoreRegisters(saved);
  9193. END;
  9194. END AssignMathArray;
  9195. VAR modifyAssignmentCounter := 0: LONGINT;
  9196. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9197. VAR processor,mem,dst: IntermediateCode.Operand;
  9198. BEGIN
  9199. IF value.intValue = true.intValue THEN
  9200. INC(modifyAssignmentCounter);
  9201. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9202. modifyAssignmentsPC := section.pc;
  9203. ELSE
  9204. DEC(modifyAssignmentCounter);
  9205. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9206. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9207. END;
  9208. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9209. dst := NewRegisterOperand (addressType);
  9210. Emit(Mov(position,dst, processor));
  9211. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9212. Emit(Mov(position,mem, value));
  9213. ReleaseIntermediateOperand(dst);
  9214. END ModifyAssignments;
  9215. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9216. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9217. BEGIN
  9218. type := left.type.resolved;
  9219. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9220. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9221. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9222. IF procedureType.returnParameter = parameter THEN
  9223. (* this is the only case where the destination can be dynamically smaller than the source
  9224. in all other cases the dynamic size has to be taken
  9225. *)
  9226. IF backend.cooperative THEN
  9227. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9228. ELSE
  9229. MakeMemory(mem, tag, addressType, 0);
  9230. END;
  9231. RETURN mem;
  9232. END;
  9233. END;
  9234. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9235. END CopySize;
  9236. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9237. VAR
  9238. leftO, rightO: Operand;
  9239. arg,mem, sizeOp: IntermediateCode.Operand;
  9240. leftType, rightType, componentType, base: SyntaxTree.Type;
  9241. size: LONGINT;
  9242. parameters: SyntaxTree.ExpressionList;
  9243. procedure: SyntaxTree.Procedure;
  9244. call: SyntaxTree.ProcedureCallDesignator;
  9245. designator: SyntaxTree.Designator;
  9246. saved: RegisterEntry;
  9247. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9248. VAR procedureType: SyntaxTree.ProcedureType;
  9249. BEGIN
  9250. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9251. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9252. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9253. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9254. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9255. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9256. IF right.id = Global.Reshape THEN RETURN TRUE
  9257. END;
  9258. END;
  9259. END;
  9260. END;
  9261. RETURN FALSE
  9262. END CanPassAsResultParameter;
  9263. BEGIN
  9264. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9265. leftType := left.type.resolved; rightType:= right.type.resolved;
  9266. IF backend.cooperative & left.NeedsTrace() THEN
  9267. ModifyAssignments(true);
  9268. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9269. Designate(right, rightO);
  9270. Designate(left, leftO);
  9271. ASSERT(leftO.mode = ModeReference);
  9272. TransferToRegister(leftO.op, leftO.op);
  9273. TransferToRegister(rightO.op, rightO.op);
  9274. Emit(Push(position, leftO.op));
  9275. Emit(Push(position, rightO.op));
  9276. CallAssignMethod(leftO.op, rightO.op, left.type);
  9277. Emit(Pop(position, rightO.op));
  9278. Emit(Pop(position, leftO.op));
  9279. sizeOp := CopySize(left, leftO.tag);
  9280. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9281. ReleaseIntermediateOperand(sizeOp);
  9282. ReleaseOperand(leftO);
  9283. ReleaseOperand(rightO);
  9284. ELSE
  9285. Evaluate(right,rightO);
  9286. Designate(left,leftO);
  9287. ASSERT(leftO.mode = ModeReference);
  9288. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9289. (* copy procedure address first *)
  9290. MakeMemory(mem,leftO.op,addressType,0);
  9291. Emit(Mov(position,mem,rightO.op));
  9292. ReleaseIntermediateOperand(mem);
  9293. (* copy pointer address *)
  9294. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9295. CallAssignPointer(leftO.tag, rightO.tag);
  9296. ELSE
  9297. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9298. CallAssignPointer(leftO.op, rightO.op);
  9299. END;
  9300. ReleaseOperand(leftO);
  9301. ReleaseOperand(rightO);
  9302. END;
  9303. ModifyAssignments(false);
  9304. RETURN;
  9305. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9306. SaveRegisters();ReleaseUsedRegisters(saved);
  9307. IF SemanticChecker.IsPointerType(leftType) THEN
  9308. Evaluate(right,rightO);
  9309. Designate(left,leftO);
  9310. Emit(Push(position,leftO.op));
  9311. ReleaseOperand(leftO);
  9312. Emit(Push(position,rightO.op));
  9313. ReleaseOperand(rightO);
  9314. CallThis(position,"Heaps","Assign",2);
  9315. ELSIF leftType.IsRecordType() THEN
  9316. Designate(right,rightO);
  9317. Designate(left,leftO);
  9318. Emit(Push(position,leftO.op));
  9319. Emit(Push(position,leftO.tag)); (* type desc *)
  9320. ReleaseOperand(leftO);
  9321. Emit(Push(position,rightO.op));
  9322. ReleaseOperand(rightO);
  9323. CallThis(position,"Heaps","AssignRecord",3);
  9324. ELSIF IsStaticArray(leftType) THEN
  9325. size := StaticArrayNumElements(leftType);
  9326. base := StaticArrayBaseType(leftType);
  9327. Designate(right,rightO);
  9328. Designate(left,leftO);
  9329. Emit(Push(position,leftO.op));
  9330. ReleaseOperand(leftO);
  9331. arg := TypeDescriptorAdr(base);
  9332. Emit(Push(position,arg));
  9333. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9334. Emit(Push(position,rightO.op));
  9335. ReleaseOperand(rightO);
  9336. CallThis(position,"Heaps","AssignArray",4);
  9337. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9338. size := StaticMathArrayNumElements(leftType);
  9339. base := StaticMathArrayBaseType(leftType);
  9340. Designate(right,rightO);
  9341. Designate(left,leftO);
  9342. Emit(Push(position,leftO.op));
  9343. ReleaseOperand(leftO);
  9344. arg := TypeDescriptorAdr(base);
  9345. Emit(Push(position,arg));
  9346. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9347. Emit(Push(position,rightO.op));
  9348. ReleaseOperand(rightO);
  9349. CallThis(position,"Heaps","AssignArray",4);
  9350. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9351. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9352. Evaluate(right,rightO);
  9353. Designate(left,leftO);
  9354. MakeMemory(mem,leftO.op,addressType,0);
  9355. Emit(Mov(position,mem,rightO.op));
  9356. ReleaseIntermediateOperand(mem);
  9357. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9358. Emit (Push(position, leftO.tag));
  9359. ReleaseOperand(leftO);
  9360. Emit (Push(position, rightO.tag));
  9361. ReleaseOperand(rightO);
  9362. CallThis(position,"Heaps","Assign", 2);
  9363. ELSE HALT(100); (* missing ? *)
  9364. END;
  9365. RestoreRegisters(saved);
  9366. RETURN;
  9367. END;
  9368. IF CanPassAsResultParameter(right) THEN
  9369. procedureResultDesignator := left(SyntaxTree.Designator);
  9370. Expression(right);
  9371. procedureResultDesignator := NIL;
  9372. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9373. (* left <-- ALIAS OF right: zerocopy *)
  9374. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9375. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9376. designator.SetType(procedure.type);
  9377. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9378. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9379. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9380. END;
  9381. ELSIF leftType IS SyntaxTree.RangeType THEN
  9382. (* LHS is of array range type *)
  9383. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9384. Evaluate(right, rightO);
  9385. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9386. (* first *)
  9387. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9388. Emit(Mov(position,mem, rightO.op));
  9389. ReleaseIntermediateOperand(mem);
  9390. (* last *)
  9391. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9392. Emit(Mov(position,mem, rightO.tag));
  9393. ReleaseIntermediateOperand(mem);
  9394. (* step *)
  9395. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9396. Emit(Mov(position,mem, rightO.extra));
  9397. ReleaseIntermediateOperand(mem);
  9398. ReleaseOperand(rightO);
  9399. ReleaseOperand(leftO)
  9400. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9401. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9402. Evaluate(right, rightO);
  9403. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9404. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9405. (* real part *)
  9406. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9407. Emit(Mov(position,mem, rightO.op));
  9408. ReleaseIntermediateOperand(mem);
  9409. (* imaginary part *)
  9410. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9411. Emit(Mov(position,mem, rightO.tag));
  9412. ReleaseIntermediateOperand(mem);
  9413. ReleaseOperand(rightO);
  9414. ReleaseOperand(leftO)
  9415. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9416. OR (leftType IS SyntaxTree.PortType) THEN
  9417. (* rightO := leftO;*)
  9418. Evaluate(right,rightO);
  9419. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9420. Designate(left,leftO);
  9421. IF leftO.mode = ModeReference THEN
  9422. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9423. destination := mem;
  9424. ELSE
  9425. destination := leftO.op;
  9426. END;
  9427. ReleaseOperand(leftO);
  9428. IF destination.mode # IntermediateCode.Undefined THEN
  9429. Emit(Mov(position,destination,rightO.op));
  9430. END;
  9431. ReleaseOperand(rightO);
  9432. ReleaseIntermediateOperand(mem);
  9433. IntermediateCode.InitOperand(destination);
  9434. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9435. Evaluate(right,rightO);
  9436. Designate(left,leftO);
  9437. MakeMemory(mem,leftO.op,addressType,0);
  9438. Emit(Mov(position,mem,rightO.op));
  9439. ReleaseIntermediateOperand(mem);
  9440. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9441. (* delegate *)
  9442. (*
  9443. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9444. *)
  9445. Emit(Mov(position,leftO.tag,rightO.tag));
  9446. END;
  9447. ReleaseOperand(leftO);
  9448. ReleaseOperand(rightO);
  9449. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9450. Designate(right,rightO);
  9451. Designate(left,leftO);
  9452. sizeOp := CopySize(left, leftO.tag);
  9453. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9454. ReleaseIntermediateOperand(sizeOp);
  9455. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9456. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9457. IF (rightType IS SyntaxTree.StringType) THEN
  9458. CopyString(left,right);
  9459. 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
  9460. Designate(right,rightO);
  9461. Designate(left,leftO);
  9462. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9463. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9464. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9465. ELSE
  9466. HALT(201)
  9467. END;
  9468. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9469. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9470. Designate(right,rightO);
  9471. Designate(left,leftO);
  9472. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9473. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9474. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9475. Emit(Mov(position, leftO.op, mem));
  9476. ReleaseIntermediateOperand(mem);
  9477. ELSE
  9478. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9479. END;
  9480. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9481. ELSE
  9482. AssignMathArray(left,right);
  9483. END;
  9484. ELSE
  9485. HALT(200);
  9486. END;
  9487. END Assign;
  9488. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9489. BEGIN
  9490. IF Trace THEN TraceEnter("VisitAssignment") END;
  9491. Assign(x.left,x.right);
  9492. IF Trace THEN TraceExit("VisitAssignment") END;
  9493. END VisitAssignment;
  9494. PROCEDURE EmitCooperativeSwitch;
  9495. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9496. BEGIN
  9497. ASSERT (cooperativeSwitches);
  9498. pc := section.pc;
  9499. IF lastSwitchPC = section.pc THEN RETURN END;
  9500. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9501. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9502. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9503. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9504. INC(statCoopSwitch, section.pc - pc);
  9505. END EmitCooperativeSwitch;
  9506. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9507. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9508. BEGIN
  9509. p0 := communication.left; p1 := communication.right;
  9510. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9511. Evaluate(p0,s0);
  9512. Evaluate(p1,s1);
  9513. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9514. Emit(Push(position,s0.op));
  9515. Emit(Push(position,s1.op));
  9516. (*
  9517. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9518. *)
  9519. IF ~backend.cellsAreObjects THEN
  9520. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9521. END;
  9522. ReleaseOperand(s0);
  9523. ReleaseOperand(s1);
  9524. IF backend.cellsAreObjects THEN
  9525. CallThis(position,"ActiveCellsRuntime","Send",2);
  9526. ELSE
  9527. CallThis(position,ChannelModuleName,"Send",2);
  9528. END;
  9529. (* ----- RECEIVE ------*)
  9530. ELSE
  9531. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9532. tmp := p0; p0 := p1; p1 := tmp;
  9533. END;
  9534. Evaluate(p0,s0);
  9535. Emit(Push(position,s0.op));
  9536. Designate(p1,s1);
  9537. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9538. Emit(Push(position,s1.op));
  9539. (*
  9540. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9541. *)
  9542. IF ~backend.cellsAreObjects THEN
  9543. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9544. END;
  9545. ReleaseOperand(s0);
  9546. ReleaseOperand(s1);
  9547. IF backend.cellsAreObjects THEN
  9548. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9549. ELSE
  9550. CallThis(position,ChannelModuleName,"Receive",2)
  9551. END;
  9552. END;
  9553. END VisitCommunicationStatement;
  9554. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9555. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9556. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9557. VAR true, false: Label; condition, value: BOOLEAN;
  9558. BEGIN
  9559. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9560. IF condition THEN
  9561. true := NewLabel();
  9562. false := NewLabel();
  9563. Condition(if.condition,true,false);
  9564. SetLabel(true);
  9565. StatementSequence(if.statements);
  9566. BrL(end);
  9567. SetLabel(false);
  9568. ELSE
  9569. IF value THEN (* always true *)
  9570. escape := TRUE;
  9571. StatementSequence(if.statements);
  9572. (* no branch necessary -- rest skipped *)
  9573. END;
  9574. END;
  9575. END IfPart;
  9576. BEGIN
  9577. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9578. end := NewLabel();
  9579. elsifs := x.ElsifParts();
  9580. IfPart(x.ifPart);
  9581. FOR i := 0 TO elsifs-1 DO
  9582. IF ~escape THEN
  9583. elsif := x.GetElsifPart(i);
  9584. IfPart(elsif);
  9585. END;
  9586. END;
  9587. IF (x.elsePart # NIL) & ~escape THEN
  9588. StatementSequence(x.elsePart);
  9589. END;
  9590. SetLabel(end);
  9591. IF Trace THEN TraceExit("VisitIfStatement") END;
  9592. END VisitIfStatement;
  9593. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  9594. VAR reg: IntermediateCode.Operand;
  9595. BEGIN
  9596. trueL := NewLabel();
  9597. IF backend.cooperative THEN
  9598. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  9599. Emit(Mov(position,reg,tag));
  9600. TypeTest(reg, x.type, trueL, NIL,TRUE);
  9601. ReleaseIntermediateOperand(reg);
  9602. ELSE
  9603. TypeTest(tag, x.type, trueL, NIL,TRUE);
  9604. END;
  9605. END BrWithPart;
  9606. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  9607. BEGIN
  9608. StatementSequence(x.statements);
  9609. END EmitWithPart;
  9610. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9611. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  9612. tag: IntermediateCode.Operand;
  9613. BEGIN
  9614. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9615. endL := NewLabel();
  9616. elseL := NewLabel();
  9617. Designate(x.variable,res);
  9618. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9619. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9620. END;
  9621. ReuseCopy(tag, res.tag);
  9622. ReleaseOperand(res);
  9623. NEW(trueL, x.WithParts());
  9624. FOR i := 0 TO x.WithParts()-1 DO
  9625. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  9626. END;
  9627. ReleaseIntermediateOperand(tag);
  9628. BrL(elseL);
  9629. FOR i := 0 TO x.WithParts()-1 DO
  9630. SetLabel(trueL[i]);
  9631. EmitWithPart(x.GetWithPart(i));
  9632. BrL(endL);
  9633. END;
  9634. SetLabel(elseL);
  9635. IF x.elsePart = NIL THEN
  9636. IF ~isUnchecked THEN
  9637. EmitTrap(position,WithTrap);
  9638. END;
  9639. ELSE
  9640. StatementSequence(x.elsePart)
  9641. END;
  9642. SetLabel(endL);
  9643. IF Trace THEN TraceExit("VisitWithStatement") END;
  9644. END VisitWithStatement;
  9645. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9646. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9647. out,else: Label; label: Label;
  9648. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9649. symbol: SyntaxTree.Symbol;
  9650. table: BOOLEAN;
  9651. BEGIN
  9652. (*! split case statement into if-elsif statements for large case label lists *)
  9653. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9654. range := x.max-x.min+1;
  9655. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  9656. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  9657. table := FALSE;
  9658. size := x.caseParts.Length();
  9659. ELSE
  9660. table := TRUE;
  9661. size := LONGINT(range);
  9662. END;
  9663. Evaluate(x.variable,var);
  9664. ReuseCopy(tmp,var.op);
  9665. ReleaseIntermediateOperand(var.op);
  9666. var.op := tmp;
  9667. (*
  9668. UniqueId(name,module.module,"case",caseId);
  9669. *)
  9670. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9671. else := NewLabel();
  9672. IF table THEN
  9673. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9674. Convert(var.op,addressType);
  9675. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9676. ReuseCopy(res,var.op);
  9677. ReleaseOperand(var);
  9678. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9679. Global.GetModuleSegmentedName(module.module, name);
  9680. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9681. symbol := SyntaxTree.NewSymbol(name[1]);
  9682. symbol.SetScope(moduleScope);
  9683. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9684. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9685. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9686. Emit(Add(position,res,res,jmp));
  9687. IntermediateCode.MakeMemory(res,addressType);
  9688. Emit(Br(position,res));
  9689. ReleaseIntermediateOperand(res);
  9690. ELSE
  9691. ReuseCopy(res,var.op); (* make sure it is in a register *)
  9692. ReleaseOperand(var);
  9693. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  9694. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  9695. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9696. part := x.GetCasePart(i);
  9697. constant := part.firstConstant;
  9698. fixups[i] := NewLabel();
  9699. WHILE(constant # NIL) DO (* case labels for this case part *)
  9700. IF constant.min = constant.max THEN
  9701. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  9702. ELSE
  9703. label := NewLabel();
  9704. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  9705. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  9706. BrL(fixups[i]);
  9707. SetLabel(label);
  9708. END;
  9709. constant := constant.next;
  9710. END;
  9711. END;
  9712. BrL(else);
  9713. ReleaseIntermediateOperand(res);
  9714. END;
  9715. out := NewLabel();
  9716. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9717. part := x.GetCasePart(i);
  9718. constant := part.firstConstant;
  9719. IF table THEN
  9720. label := NewLabel();
  9721. SetLabel(label);
  9722. WHILE(constant # NIL) DO (* case labels for this case part *)
  9723. FOR j := constant.min TO constant.max DO
  9724. fixups[j-x.min] := label;
  9725. END;
  9726. constant := constant.next;
  9727. END;
  9728. ELSE
  9729. SetLabel(fixups[i]);
  9730. END;
  9731. StatementSequence(part.statements);
  9732. BrL(out);
  9733. END;
  9734. SetLabel(else);
  9735. FOR i := 0 TO size-1 DO
  9736. IF fixups[i] = NIL THEN
  9737. fixups[i] := else;
  9738. END;
  9739. END;
  9740. IF x.elsePart # NIL THEN
  9741. StatementSequence(x.elsePart);
  9742. ELSIF ~isUnchecked THEN
  9743. EmitTrap(position,CaseTrap);
  9744. END;
  9745. SetLabel(out);
  9746. IF table THEN
  9747. FOR i := 0 TO size-1 DO
  9748. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9749. section.Emit(Data(position,op));
  9750. END;
  9751. END;
  9752. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9753. END VisitCaseStatement;
  9754. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9755. VAR start: Label; true,false: Label;
  9756. BEGIN
  9757. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9758. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9759. start := NewLabel();
  9760. true := NewLabel();
  9761. false := NewLabel();
  9762. SetLabel(start);
  9763. Condition(x.condition,true,false);
  9764. SetLabel(true);
  9765. StatementSequence(x.statements);
  9766. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9767. BrL(start);
  9768. SetLabel(false);
  9769. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9770. END VisitWhileStatement;
  9771. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9772. VAR false,true: Label;
  9773. BEGIN
  9774. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9775. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9776. true := NewLabel();
  9777. false := NewLabel();
  9778. SetLabel(false);
  9779. StatementSequence(x.statements);
  9780. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9781. Condition(x.condition,true,false);
  9782. SetLabel(true);
  9783. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9784. END VisitRepeatStatement;
  9785. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9786. VAR
  9787. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9788. temporaryVariable: SyntaxTree.Variable;
  9789. temporaryVariableDesignator : SyntaxTree.Designator;
  9790. BEGIN
  9791. IF Trace THEN TraceEnter("VisitForStatement") END;
  9792. true := NewLabel();
  9793. false := NewLabel();
  9794. start := NewLabel();
  9795. Assign(x.variable,x.from);
  9796. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9797. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9798. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9799. Assign(temporaryVariableDesignator,x.to);
  9800. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9801. IF by > 0 THEN
  9802. cmp := Scanner.LessEqual
  9803. ELSE
  9804. cmp := Scanner.GreaterEqual
  9805. END;
  9806. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9807. binary.SetType(system.booleanType);
  9808. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9809. SetLabel(start);
  9810. Condition(binary,true,false);
  9811. SetLabel(true);
  9812. StatementSequence(x.statements);
  9813. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9814. binary.SetType(x.variable.type);
  9815. Assign(x.variable,binary);
  9816. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9817. BrL(start);
  9818. SetLabel(false);
  9819. IF Trace THEN TraceExit("VisitForStatement") END;
  9820. END VisitForStatement;
  9821. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9822. VAR prevLoop: Label;
  9823. BEGIN
  9824. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9825. prevLoop := currentLoop;
  9826. currentLoop := NewLabel();
  9827. StatementSequence(x.statements);
  9828. SetLabel(currentLoop);
  9829. currentLoop := prevLoop;
  9830. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9831. END VisitExitableBlock;
  9832. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9833. VAR prevLoop,start: Label;
  9834. BEGIN
  9835. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9836. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9837. start := NewLabel();
  9838. prevLoop := currentLoop;
  9839. SetLabel(start);
  9840. currentLoop := NewLabel();
  9841. StatementSequence(x.statements);
  9842. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9843. BrL(start);
  9844. SetLabel(currentLoop);
  9845. currentLoop := prevLoop;
  9846. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9847. END VisitLoopStatement;
  9848. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9849. VAR outer: SyntaxTree.Statement;
  9850. BEGIN
  9851. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9852. IF locked THEN (* r if we jump out of an exclusive block *)
  9853. outer := x.outer;
  9854. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9855. outer := outer.outer;
  9856. END;
  9857. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9858. Lock(FALSE);
  9859. END;
  9860. END;
  9861. BrL(currentLoop);
  9862. IF Trace THEN TraceExit("VisitExitStatement") END;
  9863. END VisitExitStatement;
  9864. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9865. VAR
  9866. expression, parameterDesignator: SyntaxTree.Expression;
  9867. type, componentType: SyntaxTree.Type;
  9868. res, right: Operand;
  9869. left, mem, reg: IntermediateCode.Operand;
  9870. parameter: SyntaxTree.Parameter;
  9871. procedure: SyntaxTree.Procedure;
  9872. procedureType: SyntaxTree.ProcedureType;
  9873. returnTypeOffset: LONGINT;
  9874. delegate: BOOLEAN;
  9875. map: SymbolMap;
  9876. callingConvention, parametersSize: LONGINT;
  9877. BEGIN
  9878. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9879. expression := x.returnValue;
  9880. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9881. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9882. IF currentIsInline THEN
  9883. IF expression # NIL THEN
  9884. map := currentMapper.Get(NIL);
  9885. IF map # NIL THEN
  9886. Assign(map.to, expression);
  9887. ELSE
  9888. Evaluate(expression,res);
  9889. Emit(Return(position,res.op));
  9890. ReleaseOperand(res);
  9891. END;
  9892. END;
  9893. BrL(currentInlineExit);
  9894. RETURN;
  9895. END;
  9896. IF expression # NIL THEN
  9897. type := expression.type.resolved;
  9898. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9899. IF locked THEN Lock(FALSE) END;
  9900. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9901. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9902. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9903. 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
  9904. (* return without structured return parameter *)
  9905. Evaluate(expression,res);
  9906. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9907. IF locked OR profile THEN
  9908. Emit(Push(position,res.op));
  9909. IF delegate THEN HALT(200) END;
  9910. ReleaseOperand(res);
  9911. IF locked THEN Lock(FALSE) END;
  9912. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9913. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9914. reg := NewRegisterOperand(res.op.type);
  9915. Emit(Pop(position,reg));
  9916. Emit(Return(position,reg));
  9917. ReleaseIntermediateOperand(reg);
  9918. ELSE
  9919. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9920. Emit(Return(position,res.op));
  9921. ReleaseOperand(res);
  9922. END;
  9923. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9924. THEN
  9925. (* return using structured return parameter *)
  9926. 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)
  9927. OR SemanticChecker.IsPointerType(type));
  9928. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9929. parameter :=procedureType.returnParameter;
  9930. ASSERT(parameter # NIL);
  9931. returnTypeOffset := parameter.offsetInBits;
  9932. (*
  9933. IF parameter# NIL THEN
  9934. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9935. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9936. ELSE
  9937. returnTypeOffset := system.offsetFirstParameter
  9938. END;
  9939. *)
  9940. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9941. IF type IS SyntaxTree.RangeType THEN
  9942. (* array range type *)
  9943. Evaluate(expression, right);
  9944. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9945. Emit(Mov(position,mem, right.op)); (* first *)
  9946. ReleaseIntermediateOperand(mem);
  9947. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9948. Emit(Mov(position,mem, right.tag)); (* last *)
  9949. ReleaseIntermediateOperand(mem);
  9950. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9951. Emit(Mov(position,mem, right.extra)); (* step *)
  9952. ReleaseIntermediateOperand(mem);
  9953. ReleaseOperand(right);
  9954. ELSIF type IS SyntaxTree.ComplexType THEN
  9955. Evaluate(expression, right);
  9956. componentType := type(SyntaxTree.ComplexType).componentType;
  9957. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9958. Emit(Mov(position,mem, right.op)); (* real part *)
  9959. ReleaseIntermediateOperand(mem);
  9960. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9961. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9962. ReleaseIntermediateOperand(mem);
  9963. ReleaseOperand(right);
  9964. ELSE (* covers cases: pointer / record / array *)
  9965. parameter := procedureType.returnParameter;
  9966. checker.SetCurrentScope(currentScope);
  9967. ASSERT(parameter # NIL);
  9968. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9969. Assign(parameterDesignator,expression);
  9970. END;
  9971. ReleaseIntermediateOperand(left);
  9972. IF locked THEN Lock(FALSE) END;
  9973. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9974. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9975. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9976. parameter := procedureType.returnParameter;
  9977. checker.SetCurrentScope(currentScope);
  9978. IF parameter = NIL THEN
  9979. Error(procedure.position, "structured return of parameter of procedure not found");
  9980. ELSE
  9981. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9982. Assign(parameterDesignator,expression);
  9983. END;
  9984. IF locked THEN Lock(FALSE) END;
  9985. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9986. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9987. ELSE
  9988. HALT(200);
  9989. END;
  9990. ELSE
  9991. IF locked THEN Lock(FALSE) END;
  9992. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9993. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9994. END;
  9995. IF backend.cooperative THEN
  9996. BrL(exitLabel);
  9997. ELSE
  9998. callingConvention := procedureType.callingConvention;
  9999. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10000. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10001. ELSE
  10002. parametersSize := 0;
  10003. END;
  10004. EmitLeave(section, position,procedure, callingConvention);
  10005. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10006. END;
  10007. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10008. END VisitReturnStatement;
  10009. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10010. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10011. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10012. statements: SyntaxTree.StatementSequence;
  10013. name, suffix: SyntaxTree.IdentifierString;
  10014. BEGIN
  10015. Strings.IntToStr(awaitProcCounter,suffix);
  10016. Strings.Concat("@AwaitProcedure",suffix,name);
  10017. identifier := SyntaxTree.NewIdentifier(name);
  10018. INC(awaitProcCounter);
  10019. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10020. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10021. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10022. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10023. procedure.SetAccess(SyntaxTree.Hidden);
  10024. procedure.SetScope(currentScope);
  10025. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10026. procedureType.SetReturnType(system.booleanType);
  10027. procedure.SetType(procedureType);
  10028. body := SyntaxTree.NewBody(x.position,procedureScope);
  10029. procedureScope.SetBody(body);
  10030. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10031. returnStatement.SetReturnValue(x.condition);
  10032. statements := SyntaxTree.NewStatementSequence();
  10033. statements.AddStatement(returnStatement);
  10034. body.SetStatementSequence(statements);
  10035. currentScope.AddProcedure(procedure);
  10036. RETURN procedure
  10037. END MakeAwaitProcedure;
  10038. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10039. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10040. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  10041. BEGIN
  10042. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10043. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10044. IF backend.cooperative THEN
  10045. start := NewLabel();
  10046. true := NewLabel();
  10047. false := NewLabel();
  10048. SetLabel(start);
  10049. Condition(x.condition,true,false);
  10050. SetLabel(false);
  10051. PushSelfPointer();
  10052. CallThis(position,"ExclusiveBlocks","Await",1);
  10053. BrL(start);
  10054. SetLabel(true);
  10055. PushSelfPointer();
  10056. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10057. ELSE
  10058. proc := MakeAwaitProcedure(x);
  10059. Emit(Push(position,fp));
  10060. GetCodeSectionNameForSymbol(proc,name);
  10061. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10062. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10063. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10064. Emit(Call(position,call,ProcParametersSize(proc)));
  10065. Emit(Result(position,res));
  10066. (*
  10067. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10068. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10069. *)
  10070. InitOperand(result,ModeValue);
  10071. result.op := res;
  10072. label := NewLabel();
  10073. BreqL(label, result.op, SELF.true);
  10074. ReleaseOperand(result);
  10075. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10076. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10077. Emit(Push(position,res));
  10078. Emit(Push(position,fp));
  10079. PushSelfPointer();
  10080. Emit(Push(position,nil));
  10081. CallThis(position,"Objects","Await",4);
  10082. SetLabel(label);
  10083. END;
  10084. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10085. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10086. END VisitAwaitStatement;
  10087. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10088. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10089. BEGIN
  10090. FOR i := 0 TO x.Length() - 1 DO
  10091. statement := x.GetStatement( i );
  10092. Statement(statement);
  10093. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10094. END;
  10095. END StatementSequence;
  10096. PROCEDURE PushSelfPointer;
  10097. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10098. procedureType: SyntaxTree.ProcedureType;
  10099. BEGIN
  10100. scope := currentScope;
  10101. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10102. scope := scope.outerScope;
  10103. END;
  10104. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10105. moduleSection := meta.ModuleSection();
  10106. IF backend.cooperative THEN
  10107. moduleOffset := 0;
  10108. ELSE
  10109. moduleOffset := moduleSection.pc;
  10110. END;
  10111. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10112. ELSE
  10113. GetBaseRegister(op.op,currentScope,scope);
  10114. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10115. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10116. parametersSize := ProcParametersSize(procedure);
  10117. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10118. IF backend.cooperative THEN
  10119. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10120. END;
  10121. IntermediateCode.MakeMemory(op.op,addressType);
  10122. END;
  10123. Emit(Push(position,op.op));
  10124. ReleaseOperand(op);
  10125. END PushSelfPointer;
  10126. PROCEDURE Lock(lock: BOOLEAN);
  10127. BEGIN
  10128. IF Trace THEN TraceEnter("Lock") END;
  10129. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10130. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10131. ASSERT(modifyAssignmentCounter = 0);
  10132. IF dump # NIL THEN
  10133. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10134. dump.Ln;dump.Update;
  10135. END;
  10136. PushSelfPointer;
  10137. IF backend.cooperative THEN
  10138. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10139. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10140. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10141. END;
  10142. ELSE
  10143. Emit(Push(position,true));
  10144. IF lock THEN CallThis(position,"Objects","Lock",2)
  10145. ELSE CallThis(position,"Objects","Unlock",2);
  10146. END;
  10147. END;
  10148. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10149. IF Trace THEN TraceExit("Lock") END;
  10150. END Lock;
  10151. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10152. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10153. BEGIN
  10154. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10155. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10156. previouslyUnchecked := isUnchecked;
  10157. isUnchecked := isUnchecked OR x.isUnchecked;
  10158. previouslyCooperativeSwitches := cooperativeSwitches;
  10159. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10160. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10161. IF x.statements # NIL THEN
  10162. StatementSequence(x.statements);
  10163. END;
  10164. IF (x IS SyntaxTree.Body) THEN
  10165. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10166. section.SetFinally(section.pc);
  10167. StatementSequence(x(SyntaxTree.Body).finally)
  10168. ELSIF x.isExclusive THEN
  10169. end := NewLabel();
  10170. BrL(end);
  10171. section.SetFinally(section.pc);
  10172. Lock(FALSE);
  10173. EmitTrap(position,RethrowTrap);
  10174. SetLabel(end);
  10175. END;
  10176. END;
  10177. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10178. isUnchecked := previouslyUnchecked;
  10179. cooperativeSwitches := previouslyCooperativeSwitches;
  10180. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10181. END VisitStatementBlock;
  10182. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10183. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10184. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10185. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10186. procedure: SyntaxTree.Procedure;
  10187. map: SymbolMap;
  10188. callingConvention, parametersSize: LONGINT;
  10189. BEGIN
  10190. scope := currentScope;
  10191. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10192. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10193. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10194. return := emptyOperand;
  10195. IF Trace THEN TraceEnter("VisitCode") END;
  10196. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10197. NEW(in, x.inRules.Length());
  10198. FOR i := 0 TO LEN(in)-1 DO
  10199. statement := x.inRules.GetStatement(i);
  10200. WITH statement: SyntaxTree.Assignment DO
  10201. Evaluate(statement.right, operand);
  10202. result := operand.op;
  10203. NEW(str, 64);
  10204. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10205. in[i] := result; IntermediateCode.SetString(in[i], str);
  10206. ReleaseIntermediateOperand(operand.tag);
  10207. END;
  10208. END;
  10209. ELSE in := NIL
  10210. END;
  10211. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10212. NEW(out, x.outRules.Length());
  10213. FOR i := 0 TO LEN(out)-1 DO
  10214. statement := x.outRules.GetStatement(i);
  10215. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10216. WITH statement:
  10217. SyntaxTree.Assignment DO
  10218. Designate(statement.left, operand);
  10219. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10220. NEW(str, 64);
  10221. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10222. out[i] := result; IntermediateCode.SetString(out[i], str);
  10223. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10224. | SyntaxTree.ReturnStatement DO
  10225. NEW(str, 64);
  10226. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10227. IF currentIsInline THEN
  10228. map := currentMapper.Get(NIL);
  10229. Designate(map.to, operand);
  10230. IF map.isAddress THEN
  10231. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10232. ELSE
  10233. result := operand.op;
  10234. END;
  10235. (*! only if it does not fit into register
  10236. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10237. *)
  10238. (*Evaluate(map.to, operand);*)
  10239. out[i] := result;
  10240. ELSE
  10241. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10242. END;
  10243. IntermediateCode.SetString(out[i], str);
  10244. ReleaseIntermediateOperand(operand.tag);
  10245. return := out[i];
  10246. ELSE
  10247. END;
  10248. END;
  10249. ELSE out := NIL
  10250. END;
  10251. Emit(Asm(x.position,x.sourceCode, in, out));
  10252. IF in # NIL THEN
  10253. FOR i := 0 TO LEN(in)-1 DO
  10254. ReleaseIntermediateOperand(in[i]);
  10255. END;
  10256. END;
  10257. IF out # NIL THEN
  10258. FOR i := 0 TO LEN(out)-1 DO
  10259. WITH statement:
  10260. SyntaxTree.Assignment DO
  10261. ReleaseIntermediateOperand(out[i]);
  10262. |SyntaxTree.ReturnStatement DO
  10263. (* release happens below *)
  10264. ELSE
  10265. END;
  10266. statement := x.outRules.GetStatement(i);
  10267. END;
  10268. END;
  10269. IF return.mode # IntermediateCode.Undefined THEN
  10270. IF currentIsInline THEN
  10271. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10272. Symbol(procedureType.returnParameter, par);
  10273. MakeMemory(mem, par.op, return.type, 0);
  10274. ReleaseOperand(par);
  10275. Emit(Mov(position, mem, return));
  10276. ReleaseIntermediateOperand(mem);
  10277. ELSE
  10278. Emit(Return(position,return));
  10279. END;
  10280. ReleaseIntermediateOperand(return);
  10281. IF currentIsInline THEN RETURN END;
  10282. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10283. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10284. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10285. ELSE
  10286. parametersSize := 0;
  10287. END;
  10288. EmitLeave(section, position,procedure, callingConvention);
  10289. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10290. END;
  10291. IF Trace THEN TraceExit("VisitCode") END;
  10292. END VisitCode;
  10293. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10294. BEGIN
  10295. RETURN ProcedureParametersSize(system, procedure);
  10296. END ProcParametersSize;
  10297. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10298. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10299. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10300. const, call: IntermediateCode.Operand;
  10301. parameterDesignator: SyntaxTree.Expression;
  10302. saved: RegisterEntry;
  10303. name: Basic.SegmentedName;
  10304. BEGIN
  10305. IF Trace THEN TraceEnter("ParameterCopies") END;
  10306. parameter := x.firstParameter;
  10307. WHILE parameter # NIL DO
  10308. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10309. type := parameter.type.resolved;
  10310. IF IsOpenArray(type) THEN
  10311. VisitParameter(parameter);
  10312. op := result;
  10313. IF backend.cooperative & parameter.NeedsTrace() THEN
  10314. length := GetArrayLength(type, op.tag);
  10315. size := NewRegisterOperand(addressType);
  10316. base := ArrayBaseType(type);
  10317. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10318. Emit(Mul(position, size, length, const));
  10319. dst := NewRegisterOperand (addressType);
  10320. Emit(Mov(position, dst, size));
  10321. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10322. Emit(Sub(position,dst,sp,dst));
  10323. Emit(And(position,dst,dst,const));
  10324. Emit(Mov(position,sp,dst));
  10325. par := fp;
  10326. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10327. IntermediateCode.InitImmediate(null, byteType, 0);
  10328. Emit(Fill(position, dst, size, null));
  10329. ReleaseIntermediateOperand(dst);
  10330. ReleaseIntermediateOperand(length);
  10331. SaveRegisters();ReleaseUsedRegisters(saved);
  10332. (* register dst has been freed before SaveRegisters already *)
  10333. base := ArrayBaseType(type);
  10334. (* assign method of open array *)
  10335. IF base.IsRecordType() THEN
  10336. Emit (Push(position, length));
  10337. Emit (Push(position, dst));
  10338. Emit (Push(position, op.op));
  10339. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10340. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10341. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10342. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10343. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10344. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10345. Emit (Push(position,length));
  10346. Emit (Push(position, dst));
  10347. Emit (Push(position, length));
  10348. Emit (Push(position, op.op));
  10349. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10350. ELSE
  10351. Emit (Push(position, length));
  10352. Emit (Push(position, dst));
  10353. Emit (Push(position, length));
  10354. Emit (Push(position, op.op));
  10355. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10356. ASSERT(ArrayBaseType(type).IsPointer());
  10357. END;
  10358. RestoreRegisters(saved);
  10359. ELSE
  10360. temp := GetDynamicSize(type,op.tag);
  10361. ReuseCopy(size,temp);
  10362. ReleaseIntermediateOperand(temp);
  10363. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10364. Emit(Sub(position,size,sp,size));
  10365. Emit(And(position,size,size,const));
  10366. Emit(Mov(position,sp,size));
  10367. par := fp;
  10368. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10369. ReleaseIntermediateOperand(size);
  10370. size := GetDynamicSize(type,op.tag);
  10371. END;
  10372. Emit(Copy(position,sp,op.op,size));
  10373. ReleaseIntermediateOperand(size);
  10374. ReleaseOperand(op);
  10375. IntermediateCode.MakeMemory(par,addressType);
  10376. Emit(Mov(position,par,sp));
  10377. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10378. checker.SetCurrentScope(currentScope);
  10379. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10380. Assign(parameterDesignator,parameterDesignator);
  10381. END;
  10382. END;
  10383. parameter := parameter.nextParameter;
  10384. END;
  10385. IF Trace THEN TraceExit("ParameterCopies") END;
  10386. END ParameterCopies;
  10387. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10388. VAR x: SyntaxTree.Variable;
  10389. BEGIN
  10390. x := scope.firstVariable;
  10391. WHILE x # NIL DO
  10392. InitVariable(x,FALSE);
  10393. x := x.nextVariable;
  10394. END;
  10395. END InitVariables;
  10396. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10397. BEGIN
  10398. IF (symbol # NIL) THEN
  10399. RETURN fingerPrinter.SymbolFP(symbol).public
  10400. ELSE
  10401. RETURN 0
  10402. END;
  10403. END GetFingerprint;
  10404. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10405. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10406. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10407. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10408. name: Basic.SegmentedName;
  10409. offset: LONGINT;
  10410. BEGIN
  10411. IF Trace THEN TraceEnter("Body") END;
  10412. ReleaseUsedRegisters(saved); (* just in case ... *)
  10413. section := ir;
  10414. exitLabel := NewLabel ();
  10415. IF moduleBody THEN moduleBodySection := section END;
  10416. IF ir.comments # NIL THEN
  10417. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10418. commentPrintout.SingleStatement(TRUE);
  10419. dump := ir.comments;
  10420. ELSE
  10421. commentPrintout := NIL;
  10422. dump := NIL;
  10423. END;
  10424. prevScope := currentScope;
  10425. currentScope := scope;
  10426. lastSwitchPC := 0;
  10427. cooperativeSwitches := backend.cooperative;
  10428. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10429. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10430. IF x # NIL THEN
  10431. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10432. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10433. IF moduleBody THEN
  10434. ProfilerInit();
  10435. ELSE
  10436. Basic.SegmentedNameToString(ir.name, string);
  10437. ProfilerAddProcedure(numberProcedures,string);
  10438. ProfilerEnterExit(numberProcedures,TRUE);
  10439. END;
  10440. END;
  10441. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10442. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10443. END;
  10444. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10445. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10446. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10447. IF procedure = cellScope.bodyProcedure THEN
  10448. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10449. StaticCallOperand(op, cellScope.constructor);
  10450. Emit(Call(position,op.op,0));
  10451. END;
  10452. END;
  10453. END;
  10454. InitVariables(scope);
  10455. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10456. GetCodeSectionNameForSymbol(procedure, name);
  10457. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10458. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10459. IF ProtectModulesPointers THEN
  10460. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10461. ELSE
  10462. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10463. END;
  10464. IntermediateCode.SetOffset(right,offset); (* tag *)
  10465. IntermediateCode.InitMemory(left,addressType,fp,0);
  10466. Emit(Mov(position, left, right));
  10467. END;
  10468. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10469. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10470. ParameterCopies(procedureType);
  10471. IF x.code = NIL THEN
  10472. VisitStatementBlock(x);
  10473. ELSE
  10474. VisitCode(x.code)
  10475. END;
  10476. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10477. IF ~backend.cooperative THEN
  10478. ProfilerEnterExit(numberProcedures,FALSE);
  10479. END;
  10480. INC(numberProcedures);
  10481. END;
  10482. END;
  10483. IF backend.cooperative THEN
  10484. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10485. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10486. END;
  10487. IF x # NIL THEN
  10488. SELF.position := x.position;
  10489. END;
  10490. CheckRegistersFree();
  10491. ASSERT(modifyAssignmentCounter = 0);
  10492. currentScope := prevScope;
  10493. IF Trace THEN TraceExit("Body") END;
  10494. END Body;
  10495. END ImplementationVisitor;
  10496. MetaDataGenerator=OBJECT
  10497. VAR
  10498. implementationVisitor: ImplementationVisitor;
  10499. declarationVisitor: DeclarationVisitor;
  10500. module: Sections.Module;
  10501. moduleName: ARRAY 128 OF CHAR;
  10502. moduleNamePool: Basic.HashTableInt;
  10503. moduleNamePoolSection: IntermediateCode.Section;
  10504. modulePointerSection: IntermediateCode.Section;
  10505. modulePointerSizePC: LONGINT;
  10506. modulePointerSectionOffset: LONGINT;
  10507. modulePointers: LONGINT;
  10508. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10509. RecordBaseOffset: LONGINT;
  10510. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10511. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10512. TypeTags: LONGINT; (* type extension level support *)
  10513. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10514. patchInfoPC: LONGINT;
  10515. patchCRC: LONGINT;
  10516. CONST
  10517. EmptyBlockOffset = 2;
  10518. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10519. BEGIN
  10520. IF implementationVisitor.backend.cooperative THEN
  10521. TypeTags := MAX(LONGINT);
  10522. BaseTypesTableOffset := 0;
  10523. MethodTableOffset := 2;
  10524. TypeRecordBaseOffset := 0;
  10525. RecordBaseOffset := 0;
  10526. ELSIF simple THEN
  10527. TypeTags := 3; (* only 3 extensions allowed *)
  10528. BaseTypesTableOffset := 1;
  10529. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10530. TypeRecordBaseOffset := 0;
  10531. RecordBaseOffset := 1;
  10532. ELSE
  10533. TypeTags := 16;
  10534. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10535. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10536. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10537. (* change this when Heaps.HeapBlock is modified *)
  10538. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10539. RecordBaseOffset := 8; (* addresses *)
  10540. ELSE
  10541. RecordBaseOffset := 9; (* addresses *)
  10542. END;
  10543. END;
  10544. SELF.simple := simple;
  10545. SELF.implementationVisitor := implementationVisitor;
  10546. SELF.declarationVisitor := declarationVisitor;
  10547. implementationVisitor.meta := SELF;
  10548. declarationVisitor.meta := SELF;
  10549. END InitMetaDataGenerator;
  10550. PROCEDURE SetModule(module: Sections.Module);
  10551. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10552. BEGIN
  10553. SELF.module := module;
  10554. Global.GetModuleName(module.module,moduleName);
  10555. Global.GetSymbolSegmentedName(module.module, name);
  10556. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10557. NEW(moduleNamePool, 32);
  10558. (*! require GC protection *)
  10559. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10560. IF ProtectModulesPointers THEN
  10561. name := "Heaps.AnyPtr";
  10562. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10563. (* set base pointer *)
  10564. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10565. END;
  10566. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10567. modulePointers := 0;
  10568. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10569. AddPointer(moduleNamePoolSection, namePoolOffset);
  10570. END;
  10571. END SetModule;
  10572. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10573. BEGIN
  10574. IF ~implementationVisitor.backend.cooperative THEN
  10575. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10576. INC(modulePointers);
  10577. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10578. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10579. END;
  10580. END AddPointer;
  10581. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10582. BEGIN
  10583. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10584. END GetTypeRecordBaseOffset;
  10585. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10586. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10587. BEGIN
  10588. (* change this when Heaps.HeapBlock is modified *)
  10589. INC(dataAdrOffset,7);
  10590. Info(section,"headerAdr");
  10591. Address(section,0);
  10592. Info(section,"typeDesc");
  10593. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10594. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10595. NamedSymbol(section, name, symbol, 0, offset);
  10596. Info(section,"mark: LONGINT;");
  10597. Longint(section,-1);
  10598. Info(section,"refCount: LONGINT;");
  10599. Longint(section,0);
  10600. (*
  10601. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10602. *)
  10603. Info(section,"dataAdr-: ADDRESS");
  10604. Symbol(section,section, dataAdrOffset,0);
  10605. Info(section,"size-: SIZE");
  10606. Address(section,0);
  10607. Info(section,"nextMark: HeapBlock;");
  10608. Address(section,0);
  10609. END HeapBlock;
  10610. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10611. VAR i: LONGINT;
  10612. BEGIN
  10613. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10614. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10615. Info(section,"count*: LONGINT");
  10616. Longint(section,0);
  10617. Info(section,"locked*: BOOLEAN");
  10618. Longint(section,0);
  10619. Info(section,"awaitingLock*: ProcessQueue");
  10620. Address(section,0);
  10621. Address(section,0);
  10622. Info(section,"awaitingCond*: ProcessQueue");
  10623. Address(section,0);
  10624. Address(section,0);
  10625. Info(section,"lockedBy*: ANY");
  10626. Address(section,0);
  10627. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10628. Longint(section,1);
  10629. FOR i := 2 TO 6 DO
  10630. Longint(section,0);
  10631. END;
  10632. Info(section,"lock*: ANY");
  10633. Address(section,0);
  10634. END ProtectedHeapBlock;
  10635. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10636. BEGIN
  10637. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10638. END Info;
  10639. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10640. VAR op: IntermediateCode.Operand;
  10641. BEGIN
  10642. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10643. section.Emit(Data(Basic.invalidPosition,op));
  10644. END Address;
  10645. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10646. VAR op: IntermediateCode.Operand;
  10647. BEGIN
  10648. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10649. section.Emit(Data(Basic.invalidPosition,op));
  10650. END Size;
  10651. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10652. VAR op: IntermediateCode.Operand;
  10653. BEGIN
  10654. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10655. section.Emit(Data(Basic.invalidPosition,op));
  10656. END Set;
  10657. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10658. VAR op: IntermediateCode.Operand;
  10659. BEGIN
  10660. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10661. section.Emit(Data(Basic.invalidPosition,op));
  10662. END Longint;
  10663. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10664. VAR op,noOperand: IntermediateCode.Operand;
  10665. BEGIN
  10666. IntermediateCode.InitOperand(noOperand);
  10667. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10668. section.PatchOperands(pc,op,noOperand,noOperand);
  10669. END PatchSize;
  10670. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10671. VAR op,noOperand: IntermediateCode.Operand;
  10672. BEGIN
  10673. IntermediateCode.InitOperand(noOperand);
  10674. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10675. section.PatchOperands(pc,op,noOperand,noOperand);
  10676. END PatchLongint;
  10677. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10678. VAR op, noOperand: IntermediateCode.Operand;
  10679. BEGIN
  10680. IntermediateCode.InitOperand(noOperand);
  10681. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10682. section.PatchOperands(pc,op,noOperand,noOperand);
  10683. END PatchSymbol;
  10684. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10685. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10686. BEGIN
  10687. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10688. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10689. section.Emit(Data(Basic.invalidPosition,op));
  10690. END Boolean;
  10691. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10692. VAR op: IntermediateCode.Operand;
  10693. BEGIN
  10694. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10695. section.Emit(Data(Basic.invalidPosition,op));
  10696. END Char;
  10697. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10698. VAR i: LONGINT;
  10699. BEGIN
  10700. Info(section,str);
  10701. i := 0;
  10702. WHILE(str[i] # 0X) DO
  10703. Char(section,str[i]);
  10704. INC(i);
  10705. END;
  10706. Char(section,0X);
  10707. END String;
  10708. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10709. VAR s: Basic.SectionName;
  10710. BEGIN
  10711. StringPool.GetString(str, s);
  10712. String(section, s);
  10713. END String0;
  10714. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10715. VAR op: IntermediateCode.Operand;
  10716. BEGIN
  10717. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10718. IntermediateCode.SetOffset(op,realOffset);
  10719. section.Emit(Data(Basic.invalidPosition,op));
  10720. END NamedSymbol;
  10721. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10722. VAR op: IntermediateCode.Operand;
  10723. BEGIN
  10724. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10725. IntermediateCode.SetOffset(op,realOffset);
  10726. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10727. END NamedSymbolAt;
  10728. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10729. BEGIN
  10730. IF symbol= NIL THEN
  10731. Address( section, realOffset);
  10732. ASSERT(virtualOffset = 0);
  10733. ELSE
  10734. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10735. END;
  10736. END Symbol;
  10737. (* OutPointers delivers
  10738. {pointerOffset}
  10739. *)
  10740. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10741. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10742. BEGIN
  10743. type := type.resolved;
  10744. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10745. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10746. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10747. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10748. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10749. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10750. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10751. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10752. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10753. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10754. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10755. ELSIF (type IS SyntaxTree.RecordType) THEN
  10756. (* never treat a record like a pointer, even if the pointer field is set! *)
  10757. WITH type: SyntaxTree.RecordType DO
  10758. base := type.GetBaseRecord();
  10759. IF base # NIL THEN
  10760. Pointers(offset,symbol,section, base,numberPointers);
  10761. END;
  10762. variable := type.recordScope.firstVariable;
  10763. WHILE(variable # NIL) DO
  10764. IF ~(variable.untraced) THEN
  10765. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10766. END;
  10767. variable := variable.nextVariable;
  10768. END;
  10769. END;
  10770. ELSIF (type IS SyntaxTree.CellType) THEN
  10771. WITH type: SyntaxTree.CellType DO
  10772. base := type.GetBaseRecord();
  10773. IF base # NIL THEN
  10774. Pointers(offset,symbol,section, base,numberPointers);
  10775. END;
  10776. variable := type.cellScope.firstVariable;
  10777. WHILE(variable # NIL) DO
  10778. IF ~(variable.untraced) THEN
  10779. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10780. END;
  10781. variable := variable.nextVariable;
  10782. END;
  10783. property := type.firstProperty;
  10784. WHILE(property # NIL) DO
  10785. IF ~(property.untraced) THEN
  10786. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10787. END;
  10788. property := property.nextProperty;
  10789. END;
  10790. parameter := type.firstParameter;
  10791. WHILE(parameter # NIL) DO
  10792. IF ~(parameter.untraced) THEN
  10793. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10794. END;
  10795. parameter := parameter.nextParameter;
  10796. END;
  10797. END;
  10798. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10799. WITH type: SyntaxTree.ArrayType DO
  10800. IF type.form= SyntaxTree.Static THEN
  10801. n := type.staticLength;
  10802. base := type.arrayBase.resolved;
  10803. WHILE(base IS SyntaxTree.ArrayType) DO
  10804. type := base(SyntaxTree.ArrayType);
  10805. n := n* type.staticLength;
  10806. base := type.arrayBase.resolved;
  10807. END;
  10808. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10809. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10810. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10811. FOR i := 0 TO n-1 DO
  10812. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10813. END;
  10814. END;
  10815. ELSE
  10816. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10817. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10818. END;
  10819. END;
  10820. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10821. WITH type: SyntaxTree.MathArrayType DO
  10822. IF type.form = SyntaxTree.Static THEN
  10823. n := type.staticLength;
  10824. base := type.arrayBase.resolved;
  10825. WHILE(base IS SyntaxTree.MathArrayType) DO
  10826. type := base(SyntaxTree.MathArrayType);
  10827. n := n* type.staticLength;
  10828. base := type.arrayBase.resolved;
  10829. END;
  10830. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10831. IF SemanticChecker.ContainsPointer(base) THEN
  10832. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10833. FOR i := 0 TO n-1 DO
  10834. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10835. END;
  10836. END;
  10837. ELSE
  10838. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10839. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10840. END
  10841. END;
  10842. (* ELSE no pointers in type *)
  10843. END;
  10844. END Pointers;
  10845. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10846. VAR position,i: LONGINT; ch: CHAR;
  10847. BEGIN
  10848. IF pool.Has(index) THEN
  10849. RETURN pool.GetInt(index)
  10850. ELSE
  10851. position := source.pc;
  10852. pool.PutInt(index, position);
  10853. Info(source, name);
  10854. i := 0;
  10855. REPEAT
  10856. ch := name[i]; INC(i);
  10857. Char( source, ch);
  10858. UNTIL ch = 0X;
  10859. END;
  10860. RETURN position;
  10861. END EnterDynamicName;
  10862. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10863. VAR name: Basic.SectionName; position: LONGINT;
  10864. BEGIN
  10865. IF pool.Has(index) THEN
  10866. RETURN pool.GetInt(index)
  10867. ELSE
  10868. StringPool.GetString(index, name);
  10869. position := EnterDynamicName(source,name,index, pool);
  10870. END;
  10871. RETURN position;
  10872. END DynamicName;
  10873. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10874. VAR section: IntermediateCode.Section;
  10875. BEGIN
  10876. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10877. IF implementationVisitor.backend.cooperative THEN
  10878. Info(section, "TypeDescriptor");
  10879. Basic.ToSegmentedName("BaseTypes.Array", name);
  10880. NamedSymbol(section, name,NIL, 0, 0);
  10881. BasePointer(section);
  10882. offset := 0;
  10883. ELSE
  10884. IF ProtectModulesPointers THEN
  10885. HeapBlock(mName,typeName,section,2);
  10886. END;
  10887. Info(section, "HeapBlock");
  10888. IF ProtectModulesPointers THEN
  10889. Symbol(section,section,2,0);
  10890. ELSE
  10891. Address(section,0);
  10892. END;
  10893. Info(section, "TypeDescriptor");
  10894. Address(section,0);
  10895. offset := section.pc;
  10896. END;
  10897. RETURN section
  10898. END NamedBlock;
  10899. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10900. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10901. BEGIN
  10902. COPY(moduleName,name);
  10903. Strings.Append(name,suffix);
  10904. Basic.ToSegmentedName(name, pooledName);
  10905. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10906. END Block;
  10907. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10908. VAR name: Basic.SegmentedName;
  10909. BEGIN
  10910. Info(source,"ArrayHeader");
  10911. IF implementationVisitor.backend.cooperative THEN
  10912. sizePC := source.pc;
  10913. Address(source,0);
  10914. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10915. IF baseType # "" THEN
  10916. Basic.ToSegmentedName(baseType, name);
  10917. NamedSymbol(source, name,NIL, 0, 0);
  10918. ELSE
  10919. Address(source,0);
  10920. END;
  10921. Address(source,0);
  10922. ELSE
  10923. Address(source,0);
  10924. Address(source,0);
  10925. (* first pointer for GC *)
  10926. IF hasPointer THEN
  10927. (* points to first element in the array, this is NOT the base type descriptor *)
  10928. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10929. ELSE
  10930. Address(source,0);
  10931. END;
  10932. sizePC := source.pc;
  10933. Address(source,0);
  10934. Info(source,"array data");
  10935. END;
  10936. END ArrayBlock;
  10937. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10938. BEGIN
  10939. IF implementationVisitor.backend.cooperative THEN
  10940. PatchSize(section, pc, size);
  10941. PatchSize(section, pc + 3, size);
  10942. ELSE
  10943. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10944. PatchSize(section, pc, size);
  10945. END;
  10946. END PatchArray;
  10947. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10948. VAR
  10949. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10950. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10951. poolMap: Basic.HashTableInt;
  10952. namePool: IntermediateCode.Section;
  10953. namePoolOffset: LONGINT;
  10954. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10955. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10956. BEGIN
  10957. Basic.SegmentedNameToString(s1.name,n1);
  10958. Basic.SegmentedNameToString(s2.name,n2);
  10959. index := 0;
  10960. ch1 := n1[index];
  10961. ch2 := n2[index];
  10962. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10963. INC(index);
  10964. ch1 := n1[index];
  10965. ch2 := n2[index];
  10966. END;
  10967. RETURN ch1 < ch2;
  10968. END Compare;
  10969. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10970. VAR
  10971. i, j: LONGINT;
  10972. x, t: Sections.Section;
  10973. BEGIN
  10974. IF lo < hi THEN
  10975. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10976. WHILE i <= j DO
  10977. WHILE Compare(list[i], x) DO INC(i) END;
  10978. WHILE Compare(x, list[j]) DO DEC(j) END;
  10979. IF i <= j THEN
  10980. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10981. INC(i); DEC(j)
  10982. END
  10983. END;
  10984. IF lo < j THEN QuickSort(list, lo, j) END;
  10985. IF i < hi THEN QuickSort(list, i, hi) END
  10986. END;
  10987. END QuickSort;
  10988. (*
  10989. ExportDesc* = RECORD
  10990. fp*: ADDRESS;
  10991. name* {UNTRACED}: DynamicName;
  10992. adr*: ADDRESS;
  10993. exports*: LONGINT;
  10994. dsc* {UNTRACED}: ExportArray
  10995. END;
  10996. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10997. *)
  10998. PROCEDURE ExportDesc2(
  10999. source: IntermediateCode.Section;
  11000. namePool: IntermediateCode.Section;
  11001. fingerPrinter: FingerPrinter.FingerPrinter;
  11002. symbol: Sections.Section;
  11003. name: StringPool.Index;
  11004. VAR patchAdr: LONGINT
  11005. ): BOOLEAN;
  11006. VAR fingerPrint: SyntaxTree.FingerPrint;
  11007. BEGIN
  11008. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11009. & (symbol.type # Sections.InlineCodeSection)
  11010. THEN
  11011. *)
  11012. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11013. & (symbol.type # Sections.ExitCodeSection)
  11014. & (symbol.type # Sections.InlineCodeSection))
  11015. THEN
  11016. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11017. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11018. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11019. Longint(source,fingerPrint.public);
  11020. ELSE
  11021. Longint(source, 0);
  11022. END;
  11023. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11024. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11025. Symbol(source, symbol,0,0);
  11026. patchAdr := source.pc;
  11027. Longint(source, 0);
  11028. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11029. Address(source,0);
  11030. END;
  11031. RETURN TRUE
  11032. ELSE
  11033. RETURN FALSE
  11034. END;
  11035. END ExportDesc2;
  11036. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11037. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11038. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11039. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11040. nextPatch: LONGINT;
  11041. TYPE
  11042. Scope = RECORD
  11043. elements: LONGINT;
  11044. gelements: LONGINT;
  11045. section: IntermediateCode.Section;
  11046. patchAdr: LONGINT;
  11047. arraySizePC: LONGINT;
  11048. beginPC: LONGINT; (* current scope start pc *)
  11049. END;
  11050. BEGIN
  11051. Basic.InitSegmentedName(prev);
  11052. olevel := -1;
  11053. scopes[0].section := source;
  11054. scopes[0].arraySizePC := MIN(LONGINT);
  11055. FOR s := 0 TO LEN(sections)-1 DO
  11056. symbol := sections[s];
  11057. 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
  11058. this := sections[s].name;
  11059. level := 0;
  11060. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11061. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11062. INC(level);
  11063. END;
  11064. WHILE level < olevel DO
  11065. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11066. IF olevel > 0 THEN
  11067. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11068. nextPatch := scopes[olevel-1].patchAdr+1;
  11069. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11070. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11071. END;
  11072. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11073. DEC(olevel);
  11074. END;
  11075. IF (level < LEN(this)) & (this[level] > 0) THEN
  11076. IF level > olevel THEN
  11077. (*TRACE("opening",level); *)
  11078. IF scopes[level].section = NIL THEN
  11079. arrayName := ".@ExportArray";
  11080. Strings.AppendInt(arrayName, level);
  11081. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11082. AddPointer(scopes[level].section,offset);
  11083. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11084. END;
  11085. scopes[level].beginPC := scopes[level].section.pc;
  11086. olevel := level;
  11087. scopes[olevel].elements := 0;
  11088. END;
  11089. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11090. sym := sections[s];
  11091. ELSE
  11092. sym := NIL;
  11093. END;
  11094. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11095. THEN
  11096. INC(scopes[olevel].elements);
  11097. END;
  11098. (* enter string in scope *)
  11099. INC(level);
  11100. END;
  11101. END;
  11102. Basic.SegmentedNameToString(this, name);
  11103. prev := this;
  11104. END;
  11105. END;
  11106. WHILE 0 <= olevel DO
  11107. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11108. IF olevel > 0 THEN
  11109. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11110. nextPatch := scopes[olevel-1].patchAdr+1;
  11111. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11112. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11113. END;
  11114. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11115. DEC(olevel);
  11116. END;
  11117. level := 0;
  11118. WHILE (level < LEN(scopes)) DO
  11119. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11120. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11121. END;
  11122. INC(level);
  11123. END;
  11124. END Export;
  11125. BEGIN
  11126. NEW(fingerPrinter);
  11127. NEW(poolMap, 64);
  11128. (* 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 *)
  11129. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11130. NEW(sectionArray, module.allSections.Length());
  11131. FOR i := 0 TO module.allSections.Length() - 1 DO
  11132. section := module.allSections.GetSection(i);
  11133. sectionArray[i] := section;
  11134. END;
  11135. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11136. Export(sectionArray^);
  11137. END ExportDesc;
  11138. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11139. VAR
  11140. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11141. BEGIN
  11142. Info(source, "exception table offsets array descriptor");
  11143. size := 0;
  11144. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11145. Info(source, "exception table content");
  11146. FOR i := 0 TO module.allSections.Length() - 1 DO
  11147. p := module.allSections.GetSection(i);
  11148. IF p.type = Sections.CodeSection THEN
  11149. finallyPC := p(IntermediateCode.Section).finally;
  11150. IF finallyPC>=0 THEN
  11151. Symbol( source, p, 0,0);
  11152. Symbol( source, p, finallyPC, 0);
  11153. Symbol( source, p, finallyPC,0);
  11154. INC(size);
  11155. END;
  11156. END
  11157. END;
  11158. PatchArray(source,sizePC,size);
  11159. END ExceptionArray;
  11160. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11161. VAR i: LONGINT; ch: CHAR;
  11162. BEGIN
  11163. i := 0;
  11164. REPEAT
  11165. ch := name[i]; INC(i);
  11166. Char( section, ch);
  11167. UNTIL ch = 0X;
  11168. WHILE i < 32 DO
  11169. Char( section, 0X); INC(i);
  11170. END;
  11171. END Name;
  11172. PROCEDURE References(section: IntermediateCode.Section);
  11173. CONST
  11174. sfTypeNone = 0X;
  11175. sfTypeCHAR = 01X;
  11176. sfTypeCHAR8 = 02X;
  11177. sfTypeCHAR16 = 03X;
  11178. sfTypeCHAR32 = 04X;
  11179. sfTypeRANGE = 05X;
  11180. sfTypeSHORTINT = 06X;
  11181. sfTypeINTEGER = 07X;
  11182. sfTypeLONGINT = 08X;
  11183. sfTypeHUGEINT = 09X;
  11184. sfTypeWORD = 0AX;
  11185. sfTypeLONGWORD = 0BX;
  11186. sfTypeSIGNED8 = 0CX;
  11187. sfTypeSIGNED16 = 0DX;
  11188. sfTypeSIGNED32 = 0EX;
  11189. sfTypeSIGNED64 = 0FX;
  11190. sfTypeUNSIGNED8 = 10X;
  11191. sfTypeUNSIGNED16 = 11X;
  11192. sfTypeUNSIGNED32 = 12X;
  11193. sfTypeUNSIGNED64 = 13X;
  11194. sfTypeREAL = 14X;
  11195. sfTypeLONGREAL = 15X;
  11196. sfTypeCOMPLEX = 16X;
  11197. sfTypeLONGCOMPLEX = 17X;
  11198. sfTypeBOOLEAN = 18X;
  11199. sfTypeSET = 19X;
  11200. sfTypeANY = 1AX;
  11201. sfTypeOBJECT = 1BX;
  11202. sfTypeBYTE = 1CX;
  11203. sfTypeADDRESS = 1DX;
  11204. sfTypeSIZE = 1EX;
  11205. sfTypeIndirect = 1FX;
  11206. sfTypeRecord = 20X;
  11207. sfTypePointerToRecord = 21X;
  11208. sfTypePointerToArray = 22X;
  11209. sfTypeOpenArray = 23X;
  11210. sfTypeStaticArray = 24X;
  11211. sfTypeDynamicArray = 25X;
  11212. sfTypeMathStaticArray = 26X;
  11213. sfTypeMathOpenArray = 27X;
  11214. sfTypeMathTensor = 28X;
  11215. sfTypeProcedure = 29X;
  11216. sfTypeDelegate = 2AX;
  11217. sfTypeENUM = 2BX;
  11218. (* sfTypeCELL = 2CX; *)
  11219. sfTypePORT = 2DX;
  11220. sfIN = 0X;
  11221. sfOUT = 1X;
  11222. flagDelegate = 0;
  11223. flagConstructor = 1;
  11224. (* variable / parameter addressing modes *)
  11225. sfAbsolute = 0X; (* global vars *)
  11226. sfRelative = 1X; (* variables, value parameters *)
  11227. sfIndirect = 2X; (* var parameters *)
  11228. sfScopeBegin = 0F0X;
  11229. sfScopeEnd = 0F1X;
  11230. sfProcedure = 0F2X;
  11231. sfVariable = 0F3X;
  11232. sfTypeDeclaration = 0F4X;
  11233. sfModule = 0FFX;
  11234. RefInfo = TRUE;
  11235. VAR
  11236. sizePC, startPC, lastOffset: LONGINT;
  11237. indirectTypes: Basic.HashTable;
  11238. PROCEDURE CurrentIndex(): LONGINT;
  11239. VAR i: LONGINT;
  11240. BEGIN
  11241. FOR i := startPC TO section.pc -1 DO
  11242. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11243. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11244. END;
  11245. startPC := section.pc;
  11246. RETURN lastOffset;
  11247. END CurrentIndex;
  11248. (*
  11249. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11250. Module = sfModule prevSymbol:SIZE name:String Scope.
  11251. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11252. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11253. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11254. Type =
  11255. sfTypePointerToRecord
  11256. | sfTypePointerToArray Type
  11257. | sfTypeOpenArray Type
  11258. | sfTypeDynamicArray Type
  11259. | sfTypeStaticArray length:SIZE Type
  11260. | sfTypeMathOpenArray Type
  11261. | sfTypeMathStaticArray length:SIZE Type
  11262. | sfTypeMathTensor Type
  11263. | sfTypeRecord tdAdr:ADDRESS
  11264. | sfTypeProcedure {Parameter} return:Type
  11265. | sfTypeDelegate {Parameter} return:Type
  11266. | sfTypePort (sfIN | sfOUT)
  11267. | sfTypeBOOLEAN
  11268. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11269. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11270. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11271. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11272. | sfTypeWORD | sfTypeLONGWORD
  11273. | sfTypeREAL | sfTypeLONGREAL
  11274. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11275. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11276. | sfTypeIndirect offset:SIZE.
  11277. *)
  11278. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11279. VAR offset: SIZE;
  11280. BEGIN
  11281. IF indirectTypes.Has(type) THEN
  11282. offset := indirectTypes.GetInt(type);
  11283. Char(section, sfTypeIndirect);
  11284. Size(section, offset);
  11285. RETURN TRUE;
  11286. ELSE
  11287. indirectTypes.PutInt(type, CurrentIndex());
  11288. RETURN FALSE;
  11289. END;
  11290. END Indirect;
  11291. PROCEDURE NType(type: SyntaxTree.Type);
  11292. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11293. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11294. BEGIN
  11295. IF type = NIL THEN
  11296. Char(section, sfTypeNone)
  11297. ELSE
  11298. type := type.resolved;
  11299. size := type.sizeInBits;
  11300. WITH type:
  11301. SyntaxTree.PointerType DO
  11302. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11303. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11304. Char(section, sfTypePointerToRecord);
  11305. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11306. ELSE
  11307. IF RefInfo THEN Info(section,"PointerToArray") END;
  11308. Char(section, sfTypePointerToArray);
  11309. NType(type.pointerBase);
  11310. END;
  11311. | SyntaxTree.ArrayType DO
  11312. IF ~Indirect(type) THEN
  11313. IF type.form = SyntaxTree.Open THEN
  11314. IF RefInfo THEN Info(section,"OpenArray") END;
  11315. Char(section, sfTypeOpenArray);
  11316. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11317. IF RefInfo THEN Info(section,"DynamicArray") END;
  11318. Char(section, sfTypeDynamicArray);
  11319. ELSIF type.form = SyntaxTree.Static THEN
  11320. IF RefInfo THEN Info(section,"StaticArray") END;
  11321. Char(section, sfTypeStaticArray);
  11322. Size(section, type.staticLength);
  11323. ELSE
  11324. HALT(100);
  11325. END;
  11326. NType(type.arrayBase);
  11327. END;
  11328. | SyntaxTree.MathArrayType DO
  11329. IF ~Indirect(type) THEN
  11330. IF type.form = SyntaxTree.Open THEN
  11331. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11332. Char(section, sfTypeMathOpenArray);
  11333. ELSIF type.form = SyntaxTree.Static THEN
  11334. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11335. Char(section, sfTypeMathStaticArray);
  11336. Size(section, type.staticLength);
  11337. ELSIF type.form = SyntaxTree.Tensor THEN
  11338. IF RefInfo THEN Info(section,"MathTensor") END;
  11339. Char(section, sfTypeMathTensor);
  11340. ELSE
  11341. HALT(100);
  11342. END;
  11343. NType(type.arrayBase);
  11344. END;
  11345. | SyntaxTree.RecordType DO
  11346. IF ~Indirect(type) THEN
  11347. IF type.pointerType # NIL (* OBJECT *) THEN
  11348. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11349. Char(section, sfTypePointerToRecord)
  11350. ELSE
  11351. IF RefInfo THEN Info(section,"Record") END;
  11352. Char(section, sfTypeRecord);
  11353. td := type.typeDeclaration;
  11354. IF RefInfo THEN Info(section,"TD") END;
  11355. IF (td # NIL) THEN
  11356. Global.GetSymbolSegmentedName(td,segmentedName);
  11357. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11358. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11359. ELSE
  11360. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11361. END;
  11362. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11363. Symbol(section, tir, 0, offset);
  11364. ELSE
  11365. Address(section, 0);
  11366. END;
  11367. END;
  11368. END;
  11369. | SyntaxTree.CellType DO
  11370. IF ~Indirect(type) THEN
  11371. IF RefInfo THEN Info(section,"Record") END;
  11372. Char(section, sfTypeRecord);
  11373. td := type.typeDeclaration;
  11374. IF RefInfo THEN Info(section,"TD") END;
  11375. IF (td # NIL) THEN
  11376. Global.GetSymbolSegmentedName(td,segmentedName);
  11377. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11378. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11379. ELSE
  11380. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11381. END;
  11382. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11383. Symbol(section, tir, 0, offset);
  11384. ELSE
  11385. Address(section, 0);
  11386. END;
  11387. END;
  11388. | SyntaxTree.PortType DO
  11389. Char(section, sfTypePORT);
  11390. IF type.direction = SyntaxTree.OutPort THEN
  11391. Char(section, sfOUT)
  11392. ELSE
  11393. Char(section, sfIN)
  11394. END;
  11395. | SyntaxTree.ProcedureType DO
  11396. IF ~Indirect(type) THEN
  11397. IF type.isDelegate THEN
  11398. Char(section, sfTypeDelegate);
  11399. ELSE
  11400. Char(section, sfTypeProcedure);
  11401. END;
  11402. parameter := type.firstParameter;
  11403. WHILE(parameter # NIL) DO
  11404. NParameter(parameter, -1);
  11405. parameter := parameter.nextParameter;
  11406. END;
  11407. NType(type.returnType);
  11408. END;
  11409. | SyntaxTree.EnumerationType DO
  11410. Char(section, sfTypeENUM);
  11411. | SyntaxTree.BasicType DO
  11412. WITH type:
  11413. SyntaxTree.BooleanType DO
  11414. IF RefInfo THEN Info(section,"Boolean") END;
  11415. Char(section, sfTypeBOOLEAN);
  11416. | SyntaxTree.CharacterType DO
  11417. IF type = module.system.characterType THEN
  11418. IF RefInfo THEN Info(section,"CHAR") END;
  11419. Char(section, sfTypeCHAR);
  11420. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11421. IF RefInfo THEN Info(section,"CHAR8") END;
  11422. Char(section, sfTypeCHAR8)
  11423. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11424. IF RefInfo THEN Info(section,"CHAR16") END;
  11425. Char(section, sfTypeCHAR16);
  11426. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11427. IF RefInfo THEN Info(section,"CHAR32") END;
  11428. Char(section, sfTypeCHAR32);
  11429. ELSE
  11430. HALT(100);
  11431. END;
  11432. |SyntaxTree.IntegerType DO
  11433. IF type(SyntaxTree.IntegerType).signed THEN
  11434. IF (type = module.system.shortintType) THEN
  11435. IF RefInfo THEN Info(section,"SHORTINT") END;
  11436. Char(section, sfTypeSHORTINT)
  11437. ELSIF (type = module.system.integerType) THEN
  11438. IF RefInfo THEN Info(section,"INTEGER") END;
  11439. Char(section, sfTypeINTEGER)
  11440. ELSIF (type = module.system.longintType) THEN
  11441. IF RefInfo THEN Info(section,"LONGINT") END;
  11442. Char(section, sfTypeLONGINT)
  11443. ELSIF (type = module.system.hugeintType) THEN
  11444. IF RefInfo THEN Info(section,"HUGEINT") END;
  11445. Char(section, sfTypeHUGEINT)
  11446. ELSIF (type = module.system.wordType) THEN
  11447. IF RefInfo THEN Info(section,"WORD") END;
  11448. Char(section, sfTypeWORD)
  11449. ELSIF (type = module.system.longWordType) THEN
  11450. IF RefInfo THEN Info(section,"LONGWORD") END;
  11451. Char(section, sfTypeLONGWORD);
  11452. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11453. IF RefInfo THEN Info(section,"SIGNED8") END;
  11454. Char(section, sfTypeSIGNED8)
  11455. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11456. IF RefInfo THEN Info(section,"SIGNED16") END;
  11457. Char(section, sfTypeSIGNED16)
  11458. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11459. IF RefInfo THEN Info(section,"SIGNED32") END;
  11460. Char(section, sfTypeSIGNED32)
  11461. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11462. IF RefInfo THEN Info(section,"SIGNED64") END;
  11463. Char(section, sfTypeSIGNED64)
  11464. ELSE
  11465. HALT(100);
  11466. END
  11467. ELSE (* unsigned *)
  11468. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11469. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11470. Char(section, sfTypeUNSIGNED8)
  11471. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11472. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11473. Char(section, sfTypeUNSIGNED16)
  11474. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11475. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11476. Char(section, sfTypeUNSIGNED32)
  11477. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11478. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11479. Char(section, sfTypeUNSIGNED64)
  11480. ELSE
  11481. HALT(100)
  11482. END
  11483. END;
  11484. | SyntaxTree.FloatType DO
  11485. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11486. IF RefInfo THEN Info(section,"REAL") END;
  11487. Char(section, sfTypeREAL);
  11488. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11489. IF RefInfo THEN Info(section,"LONGREAL") END;
  11490. Char(section, sfTypeLONGREAL);
  11491. ELSE
  11492. HALT(100);
  11493. END;
  11494. | SyntaxTree.ComplexType DO
  11495. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11496. IF RefInfo THEN Info(section,"COMPLEX") END;
  11497. Char(section, sfTypeCOMPLEX);
  11498. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11499. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11500. Char(section, sfTypeLONGCOMPLEX);
  11501. ELSE
  11502. HALT(100);
  11503. END;
  11504. |SyntaxTree.SetType DO
  11505. IF RefInfo THEN Info(section,"SET") END;
  11506. Char(section, sfTypeSET);
  11507. |SyntaxTree.AnyType DO
  11508. IF RefInfo THEN Info(section,"ANY") END;
  11509. Char(section, sfTypeANY);
  11510. |SyntaxTree.ObjectType DO
  11511. IF RefInfo THEN Info(section,"OBJECT") END;
  11512. Char(section, sfTypeOBJECT);
  11513. |SyntaxTree.ByteType DO
  11514. IF RefInfo THEN Info(section,"BYTE") END;
  11515. Char(section, sfTypeBYTE);
  11516. |SyntaxTree.RangeType DO
  11517. IF RefInfo THEN Info(section,"RANGE") END;
  11518. Char(section, sfTypeRANGE)
  11519. |SyntaxTree.AddressType DO
  11520. IF RefInfo THEN Info(section,"ADDRESS") END;
  11521. Char(section, sfTypeADDRESS)
  11522. |SyntaxTree.SizeType DO
  11523. IF RefInfo THEN Info(section,"SIZE") END;
  11524. Char(section, sfTypeSIZE)
  11525. ELSE
  11526. HALT(100)
  11527. END;
  11528. ELSE HALT(101);
  11529. END;
  11530. END;
  11531. END NType;
  11532. (*
  11533. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11534. *)
  11535. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11536. VAR type: SyntaxTree.Type;
  11537. BEGIN
  11538. IF RefInfo THEN Info(section, "Parameter") END;
  11539. Char(section, sfVariable);
  11540. Size(section, procOffset);
  11541. String0(section, parameter.name);
  11542. type := parameter.type.resolved;
  11543. IF parameter.kind = SyntaxTree.VarParameter THEN
  11544. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11545. ELSE Char(section, sfIndirect)
  11546. END;
  11547. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11548. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11549. Char(section, sfIndirect);
  11550. ELSE
  11551. Char(section, sfRelative);
  11552. END;
  11553. ELSE
  11554. Char(section, sfRelative);
  11555. END;
  11556. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11557. NType(parameter.type);
  11558. END NParameter;
  11559. (*
  11560. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11561. *)
  11562. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11563. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11564. flags: SET;
  11565. BEGIN
  11566. IF procedure.externalName # NIL THEN RETURN END;
  11567. IF RefInfo THEN Info(section, "Procedure") END;
  11568. pos := CurrentIndex();
  11569. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11570. Char(section, sfProcedure);
  11571. Size(section, scopeOffset);
  11572. String0(section,procedure.name);
  11573. s := module.allSections.FindBySymbol(procedure);
  11574. Symbol(section,s,0,0); (* start *)
  11575. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11576. flags := {};
  11577. IF procedureType.isDelegate THEN
  11578. INCL(flags, flagDelegate);
  11579. END;
  11580. IF procedure.isConstructor THEN
  11581. INCL(flags, flagConstructor);
  11582. END;
  11583. Set(section, flags);
  11584. IF RefInfo THEN Info(section, "Parameters") END;
  11585. parameter := procedureType.firstParameter;
  11586. WHILE(parameter # NIL) DO
  11587. NParameter(parameter, pos);
  11588. parameter := parameter.nextParameter;
  11589. END;
  11590. IF procedureType.returnParameter # NIL THEN
  11591. NParameter(procedureType.returnParameter, pos);
  11592. END;
  11593. IF procedureType.selfParameter # NIL THEN
  11594. NParameter(procedureType.selfParameter, pos);
  11595. END;
  11596. IF RefInfo THEN Info(section, "ReturnType") END;
  11597. NType(procedureType.returnType);
  11598. NScope(procedure.procedureScope, pos);
  11599. END NProcedure;
  11600. (*
  11601. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11602. *)
  11603. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11604. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11605. BEGIN
  11606. IF RefInfo THEN Info(section, "Variable") END;
  11607. pos := CurrentIndex();
  11608. Char(section, sfVariable);
  11609. Size(section, scopeOffset);
  11610. String0(section, variable.name);
  11611. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11612. Char(section, sfAbsolute);
  11613. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11614. NamedSymbol(section, sn,variable, 0,0);
  11615. ELSE
  11616. Char(section, sfRelative);
  11617. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11618. END;
  11619. NType(variable.type);
  11620. s := module.allSections.FindBySymbol(variable);
  11621. END NVariable;
  11622. (*
  11623. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11624. *)
  11625. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11626. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11627. BEGIN
  11628. IF typeDeclaration = NIL THEN RETURN END;
  11629. pos := CurrentIndex();
  11630. s := module.allSections.FindBySymbol(typeDeclaration);
  11631. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11632. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11633. Char(section, sfTypeDeclaration);
  11634. Size(section, scopeOffset);
  11635. String0(section, typeDeclaration.name);
  11636. declared := typeDeclaration.declaredType.resolved;
  11637. IF (declared IS SyntaxTree.PointerType) THEN
  11638. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11639. END;
  11640. WITH declared:
  11641. SyntaxTree.RecordType DO
  11642. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11643. Symbol(section, s, 0, offset);
  11644. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11645. Basic.AppendToSegmentedName(name,".@Info");
  11646. s := module.allSections.FindByName(name);
  11647. IF s # NIL THEN (* does not work for coop *)
  11648. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11649. END;
  11650. NScope(declared.recordScope, pos);
  11651. |SyntaxTree.CellType DO
  11652. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11653. Symbol(section, s, 0, offset);
  11654. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11655. Basic.AppendToSegmentedName(name,".@Info");
  11656. s := module.allSections.FindByName(name);
  11657. IF s # NIL THEN
  11658. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11659. END;
  11660. NScope(declared.cellScope, pos);
  11661. ELSE
  11662. Address(section, 0);
  11663. END;
  11664. END NTypeDeclaration;
  11665. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11666. VAR pos: LONGINT;
  11667. BEGIN
  11668. pos := CurrentIndex();
  11669. Char(section,sfModule);
  11670. Size(section, prevSymbol);
  11671. String0(section, module.name);
  11672. NScope(module.moduleScope, pos);
  11673. END NModule;
  11674. (*
  11675. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11676. *)
  11677. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11678. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  11679. BEGIN
  11680. IF scope = NIL THEN RETURN END;
  11681. IF RefInfo THEN Info(section, "Scope") END;
  11682. Char(section, sfScopeBegin);
  11683. variable := scope.firstVariable;
  11684. WHILE (variable # NIL) DO
  11685. NVariable(variable, prevSymbol);
  11686. variable := variable.nextVariable;
  11687. END;
  11688. WITH scope:
  11689. SyntaxTree.ModuleScope DO
  11690. bodyProcedure := scope.bodyProcedure;
  11691. |SyntaxTree.RecordScope DO
  11692. bodyProcedure := scope.bodyProcedure;
  11693. ELSE
  11694. bodyProcedure := NIL;
  11695. END;
  11696. IF bodyProcedure # NIL THEN
  11697. NProcedure(bodyProcedure, prevSymbol)
  11698. END;
  11699. procedure := scope.firstProcedure;
  11700. WHILE procedure # NIL DO
  11701. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11702. procedure := procedure.nextProcedure;
  11703. END;
  11704. typeDeclaration := scope.firstTypeDeclaration;
  11705. WHILE typeDeclaration # NIL DO
  11706. NTypeDeclaration(typeDeclaration, prevSymbol);
  11707. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11708. END;
  11709. Char(section, sfScopeEnd); (* scope ends *)
  11710. END NScope;
  11711. BEGIN
  11712. NEW(indirectTypes, 32);
  11713. ArrayBlock(section,sizePC,"", FALSE);
  11714. startPC := section.pc;
  11715. NModule(module.module, -1);
  11716. PatchArray(section,sizePC,CurrentIndex());
  11717. END References;
  11718. (*
  11719. Command* = RECORD
  11720. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11721. name*: Name; (* name of the procedure *)
  11722. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11723. entryAdr* : ADDRESS; (* entry address of procedure *)
  11724. END;
  11725. *)
  11726. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11727. VAR
  11728. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11729. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11730. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11731. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11732. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11733. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11734. BEGIN
  11735. RETURN
  11736. (type = NIL) OR
  11737. (type.resolved IS SyntaxTree.RecordType) OR
  11738. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11739. (type.resolved IS SyntaxTree.AnyType);
  11740. END TypeAllowed;
  11741. BEGIN
  11742. numberParameters := procedureType.numberParameters;
  11743. RETURN
  11744. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11745. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11746. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11747. END GetProcedureAllowed;
  11748. PROCEDURE WriteType(type : SyntaxTree.Type);
  11749. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11750. name: Basic.SegmentedName; offset: LONGINT;
  11751. BEGIN
  11752. IF type = NIL THEN
  11753. Address(source,0);
  11754. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11755. Address(source,1);
  11756. ELSE
  11757. type := type.resolved;
  11758. IF type IS SyntaxTree.PointerType THEN
  11759. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11760. END;
  11761. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11762. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11763. name[0] := typeDeclaration.name; name[1] := -1;
  11764. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11765. ASSERT(section # NIL);
  11766. ELSE
  11767. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11768. (* TODO *)
  11769. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11770. END;
  11771. IF implementationVisitor.backend.cooperative THEN
  11772. offset := 0;
  11773. ELSE
  11774. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11775. END;
  11776. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11777. END;
  11778. END WriteType;
  11779. BEGIN
  11780. Info(source, "command array descriptor");
  11781. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11782. numberCommands := 0;
  11783. Info(source, "command array content");
  11784. FOR i := 0 TO module.allSections.Length() - 1 DO
  11785. p := module.allSections.GetSection(i);
  11786. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11787. procedure := p.symbol(SyntaxTree.Procedure);
  11788. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11789. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11790. procedure.GetName(name);
  11791. Name(source,name);
  11792. numberParameters := procedureType.numberParameters;
  11793. (* offset of type of first parameter *)
  11794. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11795. ELSE WriteType(procedureType.firstParameter.type)
  11796. END;
  11797. (* offset of type of return parameter *)
  11798. WriteType(procedureType.returnType);
  11799. (* command name *)
  11800. (* command code offset *)
  11801. Symbol(source,p,0,0);
  11802. INC(numberCommands);
  11803. IF Trace THEN
  11804. D.Ln;
  11805. END;
  11806. END;
  11807. END
  11808. END;
  11809. PatchArray(source,sizePC,numberCommands);
  11810. END CommandArray;
  11811. (* to prevent from double import of different module aliases *)
  11812. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11813. VAR i: SyntaxTree.Import;
  11814. BEGIN
  11815. i := module.module.moduleScope.firstImport;
  11816. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11817. i := i.nextImport;
  11818. END;
  11819. RETURN i = import
  11820. END IsFirstDirectOccurence;
  11821. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11822. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11823. BEGIN
  11824. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11825. ArrayBlock(source,pc,"", FALSE);
  11826. Info(source, "import module array data");
  11827. IF implementationVisitor.backend.cooperative THEN
  11828. offset := 0;
  11829. ELSE
  11830. IF module.system.addressType.sizeInBits = 64 THEN
  11831. (* change this when Heaps.HeapBlock is modified *)
  11832. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11833. ELSE
  11834. (* change this when Heaps.HeapBlock is modified *)
  11835. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11836. END;
  11837. END;
  11838. import := module.module.moduleScope.firstImport;
  11839. numberImports := 0;
  11840. WHILE import # NIL DO
  11841. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11842. Global.GetModuleSegmentedName(import.module,name);
  11843. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11844. NamedSymbol(source, name, NIL, 0, offset);
  11845. INC(numberImports);
  11846. END;
  11847. import := import.nextImport
  11848. END;
  11849. PatchArray(source,pc,numberImports);
  11850. END ImportsArray;
  11851. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11852. VAR
  11853. p: Sections.Section; sizePC, size, i: LONGINT;
  11854. BEGIN
  11855. Info(source, "Type info section");
  11856. size := 0;
  11857. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11858. FOR i := 0 TO module.allSections.Length() - 1 DO
  11859. p := module.allSections.GetSection(i);
  11860. WITH p: IntermediateCode.Section DO
  11861. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11862. Symbol(source,p,EmptyBlockOffset,0);
  11863. INC(size);
  11864. END;
  11865. END
  11866. END;
  11867. PatchArray(source,sizePC,size);
  11868. END TypeInfoSection;
  11869. (*
  11870. ProcTableEntry* = RECORD
  11871. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11872. noPtr*: LONGINT;
  11873. END;
  11874. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11875. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11876. *)
  11877. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11878. VAR
  11879. numberPointers: LONGINT;
  11880. procedure: SyntaxTree.Procedure;
  11881. BEGIN
  11882. Info(section,"pcFrom");
  11883. Symbol(section,procedureSection,0,0);
  11884. Info(section,"pcTo");
  11885. Symbol(section, procedureSection, procedureSection.pc, 0);
  11886. Info(section,"pointer to offsets array");
  11887. Symbol(section, section,section.pc+1,0);
  11888. Info(section,"offsets array");
  11889. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11890. PointerArray(section, procedure.procedureScope, numberPointers);
  11891. END ProcedureDescriptor;
  11892. (* only for tracing, the descriptor is otherwise not complete ! *)
  11893. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11894. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11895. BEGIN
  11896. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11897. name := procedureSection.name;
  11898. Basic.AppendToSegmentedName(name,".@Info");
  11899. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11900. Address(section,0);
  11901. Symbol(section,section,2,0);
  11902. (*
  11903. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11904. descSize: SIZE;
  11905. sentinel: ADDRESS; (* = MPO-4 *)
  11906. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11907. flags*: SET;
  11908. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11909. name*: Name;
  11910. END;
  11911. *)
  11912. Size(section, 0);
  11913. Address(section,0);
  11914. Address(section,0);
  11915. Set(section,{});
  11916. moduleSection := ModuleSection();
  11917. Symbol( section, moduleSection, moduleSection.pc,0);
  11918. IF procedureSection.symbol = NIL THEN
  11919. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11920. ELSE
  11921. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11922. END;
  11923. Name(section, infoName);
  11924. Size(section, 0);
  11925. RETURN section;
  11926. END MakeProcedureDescriptorTag;
  11927. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11928. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11929. BEGIN
  11930. name := procedureSection.name;
  11931. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11932. IF implementationVisitor.backend.cooperative THEN
  11933. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11934. Info(section, "TypeDescriptor");
  11935. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11936. NamedSymbol(dest, name,NIL, 0, 0);
  11937. BaseRecord(dest);
  11938. offset := 0;
  11939. ELSIF CreateProcedureDescInfo THEN
  11940. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11941. Address(dest,0);
  11942. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11943. offset := dest.pc;
  11944. ELSE
  11945. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11946. END;
  11947. ProcedureDescriptor(dest, procedureSection);
  11948. Symbol(section, dest, offset, 0);
  11949. END ProcedureDescriptorPointer;
  11950. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11951. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11952. BEGIN
  11953. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11954. numberProcs := 0;
  11955. FOR i := 0 TO module.allSections.Length() - 1 DO
  11956. destination := module.allSections.GetSection(i);
  11957. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11958. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11959. INC(numberProcs);
  11960. END
  11961. END;
  11962. PatchArray(section, sizePC, numberProcs);
  11963. END ProcedureDescriptorArray;
  11964. (*
  11965. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11966. VAR
  11967. next*: Module; (** once a module is published, all fields are read-only *)
  11968. name*: Name;
  11969. init, published: BOOLEAN;
  11970. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11971. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11972. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11973. command*: POINTER TO ARRAY OF Command;
  11974. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11975. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11976. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11977. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11978. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11979. data*, code*: Bytes;
  11980. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11981. export*: ExportDesc;
  11982. term*: TerminationHandler;
  11983. exTable*: ExceptionTable;
  11984. noProcs*: LONGINT;
  11985. firstProc*: ADDRESS; <- done by loader
  11986. maxPtrs*: LONGINT;
  11987. crc*: LONGINT;
  11988. *)
  11989. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11990. BEGIN
  11991. Info(section, "cycle");
  11992. Size(section,0);
  11993. Info(section, "references");
  11994. Size(section,0);
  11995. Info(section, "nextMarked");
  11996. Address(section,0);
  11997. Info(section, "nextWatched");
  11998. Address(section,0);
  11999. END BasePointer;
  12000. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12001. BEGIN
  12002. BasePointer(section);
  12003. Info(section, "action");
  12004. Address(section,0);
  12005. Info(section, "monitor");
  12006. Address(section,0);
  12007. END BaseObject;
  12008. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12009. BEGIN
  12010. BasePointer(section);
  12011. Info(section, "action");
  12012. Address(section,0);
  12013. Info(section, "monitor");
  12014. Address(section,0);
  12015. END BaseRecord;
  12016. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12017. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12018. pooledName: Basic.SegmentedName;
  12019. symbol: SyntaxTree.Symbol;
  12020. BEGIN
  12021. Global.GetModuleName(module.module,name);
  12022. Strings.Append(name,".@Module.@Descriptor");
  12023. Basic.ToSegmentedName(name, pooledName);
  12024. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12025. Symbol(section,descriptorSection,0,0);
  12026. Info(descriptorSection, "descriptor");
  12027. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12028. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12029. Address(descriptorSection,0);
  12030. Global.GetModuleName(module.module,name);
  12031. Strings.Append(name,".@Trace");
  12032. Basic.ToSegmentedName(name, pooledName);
  12033. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12034. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12035. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12036. END ModuleDescriptor;
  12037. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12038. VAR name: ARRAY 128 OF CHAR;
  12039. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12040. symbol: SyntaxTree.Symbol;
  12041. BEGIN
  12042. Global.GetModuleName(module.module,name);
  12043. Strings.Append(name,".@Module");
  12044. Basic.ToSegmentedName(name, pooledName);
  12045. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12046. moduleSection.SetExported(TRUE);
  12047. IF moduleSection.pc = 0 THEN
  12048. IF implementationVisitor.backend.cooperative THEN
  12049. Info(moduleSection, "descriptor");
  12050. ModuleDescriptor(moduleSection);
  12051. BaseObject(moduleSection);
  12052. implementationVisitor.CreateTraceModuleMethod(module.module);
  12053. ELSE
  12054. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12055. Info(moduleSection, "HeapBlock");
  12056. Symbol(moduleSection,moduleSection,2,0);
  12057. Info(moduleSection, "TypeDescriptor");
  12058. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12059. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12060. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12061. END;
  12062. END;
  12063. RETURN moduleSection;
  12064. END ModuleSection;
  12065. PROCEDURE NewModuleInfo();
  12066. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12067. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12068. sectionName: Basic.SectionName;
  12069. CONST MPO=-40000000H;
  12070. BEGIN
  12071. (*
  12072. TypeDesc* = POINTER TO RECORD
  12073. descSize: SIZE;
  12074. sentinel: LONGINT; (* = MPO-4 *)
  12075. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12076. flags*: SET;
  12077. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12078. name*: Name;
  12079. refsOffset: SIZE;
  12080. END;
  12081. *)
  12082. (*name is missing prefixes sometimes*)
  12083. Global.GetModuleSegmentedName(module.module,name);
  12084. Basic.AppendToSegmentedName(name,".@Info");
  12085. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12086. IF ~implementationVisitor.backend.cooperative THEN
  12087. Info(source, "HeapBlock");
  12088. Address(source,0); (* an empty heap block prevents GC marking *)
  12089. Info(source, "TypeDescriptor");
  12090. Address(source,0);
  12091. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12092. END;
  12093. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12094. Address(source,MPO-4);
  12095. Info(source, "type tag pointer");
  12096. Address( source,0);
  12097. Info(source, "type flags");
  12098. flags := {};
  12099. Set( source, flags);
  12100. Info(source, "pointer to module");
  12101. moduleSection := ModuleSection();
  12102. Symbol( source, moduleSection, moduleSection.pc,0);
  12103. Info(source, "type name");
  12104. i := 0;
  12105. sectionName := "@Self";
  12106. (*
  12107. Global.GetSymbolSegmentedName(td,name);
  12108. Basic.SegmentedNameToString(name, sectionName);
  12109. *)
  12110. Name(source,sectionName);
  12111. patchInfoPC := source.pc;
  12112. Size(source, 0);
  12113. END NewModuleInfo;
  12114. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12115. VAR
  12116. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12117. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12118. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12119. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  12120. referenceSectionOffset : LONGINT;
  12121. name: Basic.SegmentedName; offset: LONGINT;
  12122. flags: SET;
  12123. BEGIN
  12124. NewModuleInfo();
  12125. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12126. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12127. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12128. ImportsArray(importSection);
  12129. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12130. CommandArray(commandsSection);
  12131. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12132. ExceptionArray(exceptionSection);
  12133. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12134. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12135. TypeInfoSection(typeInfoSection);
  12136. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12137. referenceSection.SetExported(TRUE);
  12138. References(referenceSection);
  12139. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12140. ProcedureDescriptorArray(procTableSection, numberProcs);
  12141. IF ProtectModulesPointers THEN
  12142. name := "Heaps.AnyPtr";
  12143. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12144. (* set base pointer *)
  12145. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12146. END;
  12147. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12148. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12149. moduleSection := ModuleSection();
  12150. Info(moduleSection, "nextRoot*: RootObject");
  12151. Address(moduleSection,0);
  12152. Info(moduleSection, "next*: Module");
  12153. Address(moduleSection,0);
  12154. Info(moduleSection, "name*: Name");
  12155. Name(moduleSection,moduleName);
  12156. Info(moduleSection, "init, published: BOOLEAN");
  12157. Boolean(moduleSection,FALSE);
  12158. Boolean(moduleSection,FALSE);
  12159. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12160. Boolean(moduleSection,FALSE);
  12161. Boolean(moduleSection,FALSE);
  12162. Info(moduleSection, "refcnt*: LONGINT");
  12163. Longint(moduleSection,0);
  12164. Info(moduleSection, "sb*: ADDRESS");
  12165. Address(moduleSection,0);
  12166. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12167. Address(moduleSection,0);
  12168. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12169. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12170. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12171. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12172. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12173. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12174. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12175. Symbol(moduleSection,importSection,importSectionOffset,0);
  12176. Info(moduleSection, "procTable*: ProcTable");
  12177. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12178. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12179. Address(moduleSection,0);
  12180. Address(moduleSection,0);
  12181. Address(moduleSection,0);
  12182. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12183. Info(moduleSection, "export*: ExportDesc");
  12184. ExportDesc(moduleSection);
  12185. Info(moduleSection, "term*: TerminationHandler");
  12186. Address(moduleSection,0);
  12187. Info(moduleSection, "exTable*: ExceptionTable");
  12188. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12189. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12190. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12191. Info(moduleSection, "crc*: LONGINT");
  12192. patchCRC:= moduleSection.pc;
  12193. Longint(moduleSection, 0); (*! must be implemented *)
  12194. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12195. Info(moduleSection, "body*: ADDRESS");
  12196. Symbol(moduleSection, bodyProc, 0,0);
  12197. Info(moduleSection, "module flags");
  12198. flags := {};
  12199. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12200. Set( moduleSection, flags);
  12201. IF implementationVisitor.backend.cooperative THEN
  12202. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12203. Info(moduleSection, "monitor.owner");
  12204. Address(moduleSection,0);
  12205. Info(moduleSection, "monitor.nestingLevel");
  12206. Address(moduleSection,0);
  12207. Info(moduleSection, "monitor.blockedQueue");
  12208. Address(moduleSection,0); Address(moduleSection,0);
  12209. Info(moduleSection, "monitor.waitingQueue");
  12210. Address(moduleSection,0); Address(moduleSection,0);
  12211. Info(moduleSection, "monitor.waitingSentinel");
  12212. Address(moduleSection,0);
  12213. END;
  12214. END Module;
  12215. PROCEDURE PatchCRC(crc: LONGINT);
  12216. BEGIN
  12217. IF ~simple THEN
  12218. PatchLongint(ModuleSection(), patchCRC, crc);
  12219. END;
  12220. END PatchCRC;
  12221. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12222. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12223. BEGIN
  12224. ArrayBlock(source,pc,"",FALSE);
  12225. Info(source, "pointer offsets array data");
  12226. IF scope IS SyntaxTree.RecordScope THEN
  12227. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12228. ELSIF scope IS SyntaxTree.CellScope THEN
  12229. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12230. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12231. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12232. WHILE variable # NIL DO
  12233. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12234. symbol := module.allSections.FindBySymbol(variable);
  12235. ASSERT(symbol # NIL);
  12236. Pointers(0,symbol, source,variable.type,numberPointers);
  12237. END;
  12238. variable := variable.nextVariable;
  12239. END;
  12240. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12241. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12242. WHILE parameter # NIL DO
  12243. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12244. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12245. END;
  12246. parameter := parameter.nextParameter;
  12247. END;
  12248. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12249. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12250. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12251. IF implementationVisitor.backend.preciseGC THEN
  12252. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12253. END;
  12254. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12255. END;
  12256. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12257. WHILE(variable # NIL) DO
  12258. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12259. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12260. END;
  12261. variable := variable.nextVariable
  12262. END;
  12263. END;
  12264. PatchArray(source,pc,numberPointers);
  12265. END PointerArray;
  12266. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12267. VAR recordType: SyntaxTree.RecordType;
  12268. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  12269. section: Sections.Section; cellType: SyntaxTree.CellType;
  12270. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12271. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12272. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12273. sectionName: Basic.SectionName;
  12274. CONST MPO=-40000000H;
  12275. BEGIN
  12276. (*
  12277. TypeDesc* = POINTER TO RECORD
  12278. descSize: SIZE;
  12279. sentinel: LONGINT; (* = MPO-4 *)
  12280. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12281. flags*: SET;
  12282. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12283. name*: Name;
  12284. refsOffset: SIZE;
  12285. END;
  12286. *)
  12287. (* source := module.sections.FindByName(...) *)
  12288. Global.GetSymbolSegmentedName(td,name);
  12289. Basic.AppendToSegmentedName(name,".@Info");
  12290. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12291. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12292. Address(source,0);
  12293. Info(source, "TypeDescriptor");
  12294. Address(source,0);
  12295. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12296. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12297. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12298. Info(source, "type tag pointer");
  12299. Symbol( source, tag, offset, 0);
  12300. Info(source, "type flags");
  12301. flags := {};
  12302. IF isProtected THEN INCL(flags,31) END;
  12303. Set( source, flags);
  12304. Info(source, "pointer to module");
  12305. moduleSection := ModuleSection();
  12306. Symbol( source, moduleSection, moduleSection.pc,0);
  12307. Info(source, "type name");
  12308. i := 0;
  12309. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12310. (*
  12311. Global.GetSymbolSegmentedName(td,name);
  12312. Basic.SegmentedNameToString(name, sectionName);
  12313. *)
  12314. Name(source,sectionName);
  12315. Size(source, 0);
  12316. RETURN source;
  12317. END NewTypeDescriptorInfo;
  12318. PROCEDURE NewTypeDescriptor;
  12319. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12320. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12321. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12322. numberPointers: LONGINT; padding, i: LONGINT;
  12323. CONST MPO=-40000000H;
  12324. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12325. VAR i: LONGINT;
  12326. PROCEDURE Td(record: SyntaxTree.RecordType);
  12327. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12328. BEGIN
  12329. IF record # NIL THEN
  12330. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12331. baseTD := record.typeDeclaration;
  12332. Global.GetSymbolSegmentedName(baseTD,name);
  12333. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12334. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12335. ELSE
  12336. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12337. END;
  12338. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12339. Symbol(source, tir, 0, offset);
  12340. IF reverse THEN Td(record.GetBaseRecord()) END;
  12341. END;
  12342. END Td;
  12343. BEGIN
  12344. Info(source, "tag table");
  12345. baseRecord := recordType;
  12346. i := 0;
  12347. WHILE baseRecord # NIL DO
  12348. INC(i);
  12349. baseRecord := baseRecord.GetBaseRecord();
  12350. END;
  12351. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12352. IF ~reverse THEN Td(recordType) END;
  12353. WHILE i < size DO
  12354. Address(source,0);
  12355. INC(i);
  12356. END;
  12357. IF reverse THEN Td(recordType) END;
  12358. END TdTable;
  12359. PROCEDURE MethodTable(reverse: BOOLEAN);
  12360. VAR i,methods: LONGINT;
  12361. BEGIN
  12362. Info(source, "method table");
  12363. IF recordType # NIL THEN
  12364. methods := recordType.recordScope.numberMethods;
  12365. IF reverse THEN
  12366. FOR i := methods-1 TO 0 BY -1 DO
  12367. procedure := recordType.recordScope.FindMethod(i);
  12368. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12369. NamedSymbol(source, name,procedure, 0,0);
  12370. END;
  12371. ELSE
  12372. FOR i := 0 TO methods-1 DO
  12373. procedure := recordType.recordScope.FindMethod(i);
  12374. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12375. NamedSymbol(source, name,procedure, 0,0);
  12376. END;
  12377. END;
  12378. END;
  12379. END MethodTable;
  12380. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12381. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12382. BEGIN
  12383. Info(source, "method table");
  12384. baseRecord := recordType;
  12385. WHILE baseRecord.baseType # NIL DO
  12386. baseRecord := baseRecord.GetBaseRecord ();
  12387. END;
  12388. GetRecordTypeName (baseRecord, name);
  12389. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12390. IF name = stackFrame THEN
  12391. start := 0;
  12392. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12393. baseRecord := recordType;
  12394. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12395. baseRecord := baseRecord.GetBaseRecord ();
  12396. END;
  12397. IF baseRecord # NIL THEN
  12398. GetRecordTypeName (baseRecord, name);
  12399. IF pointer & ~baseRecord.isObject THEN
  12400. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12401. END;
  12402. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12403. ELSIF recordType.isObject THEN
  12404. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12405. ELSIF pointer THEN
  12406. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12407. ELSE
  12408. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12409. END;
  12410. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12411. Symbol(source, tir, 0, 0);
  12412. start := 0;
  12413. baseRecord := recordType;
  12414. WHILE (baseRecord # NIL) DO
  12415. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12416. baseRecord := baseRecord.GetBaseRecord ();
  12417. END;
  12418. ELSE
  12419. (* explicit trace method: *)
  12420. procedure := recordType.recordScope.FindMethod(0);
  12421. IF ~procedure.isFinalizer THEN
  12422. Global.GetSymbolSegmentedName(procedure, name);
  12423. NamedSymbol(source, name,procedure, 0,0);
  12424. END;
  12425. start := 1;
  12426. END;
  12427. IF (name # stackFrame) & recordType.isObject THEN
  12428. baseRecord := recordType;
  12429. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12430. baseRecord := baseRecord.GetBaseRecord ();
  12431. END;
  12432. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12433. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12434. ELSE
  12435. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12436. END;
  12437. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12438. Symbol(source, tir, 0, 0);
  12439. END;
  12440. methods := recordType.recordScope.numberMethods;
  12441. FOR i := start TO methods-1 DO
  12442. procedure := recordType.recordScope.FindMethod(i);
  12443. IF ~procedure.isFinalizer THEN
  12444. Global.GetSymbolSegmentedName(procedure, name);
  12445. NamedSymbol(source, name,procedure, 0,0);
  12446. END;
  12447. END;
  12448. END CooperativeMethodTable;
  12449. BEGIN
  12450. Global.GetSymbolSegmentedName(td,name);
  12451. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12452. source.SetExported(IsExported(td));
  12453. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12454. IF implementationVisitor.backend.cooperative THEN
  12455. base := NIL;
  12456. baseRecord := recordType.GetBaseRecord();
  12457. IF baseRecord # NIL THEN
  12458. baseTD := baseRecord.typeDeclaration;
  12459. END;
  12460. IF ~recordType.isObject THEN
  12461. Info(source, "parent");
  12462. IF baseRecord # NIL THEN
  12463. Global.GetSymbolSegmentedName(baseTD,name);
  12464. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12465. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12466. ELSE
  12467. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12468. END;
  12469. Symbol(source, tir, 0, 0);
  12470. ELSE
  12471. Address(source,0);
  12472. END;
  12473. Info(source, "record size");
  12474. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12475. CooperativeMethodTable(FALSE);
  12476. base := source;
  12477. Global.GetSymbolSegmentedName(td,name);
  12478. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12479. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12480. source.SetExported(IsExported(td));
  12481. END;
  12482. Info(source, "parent");
  12483. IF baseRecord # NIL THEN
  12484. Global.GetSymbolSegmentedName(baseTD,name);
  12485. sym := baseTD;
  12486. IF ~recordType.isObject THEN
  12487. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12488. sym := NIL;
  12489. END;
  12490. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12491. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12492. ELSE
  12493. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12494. END;
  12495. Symbol(source, tir, 0, 0);
  12496. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12497. Address(source,0);
  12498. ELSE
  12499. IF recordType.isObject THEN
  12500. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12501. ELSE
  12502. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12503. END;
  12504. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12505. Symbol(source, tir, 0, 0);
  12506. END;
  12507. Info(source, "base record descriptor");
  12508. Symbol(source, base, 0, 0);
  12509. CooperativeMethodTable(TRUE);
  12510. IF recordType.hasPointers THEN
  12511. IF ~HasExplicitTraceMethod (recordType) THEN
  12512. implementationVisitor.CreateTraceMethod(recordType);
  12513. END;
  12514. implementationVisitor.CreateResetProcedure(recordType);
  12515. implementationVisitor.CreateAssignProcedure(recordType);
  12516. END;
  12517. ELSIF ~simple THEN
  12518. (*
  12519. MethodEnd = MPO
  12520. ---
  12521. methods (# methods)
  12522. ---
  12523. tags (16)
  12524. ---
  12525. TypeDesc = TypeInfoAdr
  12526. ---
  12527. td adr ---> rec size
  12528. ----
  12529. pointer offsets
  12530. ----
  12531. (padding)
  12532. -----
  12533. empty [2 addresses aligned]
  12534. empty
  12535. empty
  12536. numPtrs
  12537. ---
  12538. pointer offsets
  12539. ---
  12540. *)
  12541. Info(source, "MethodEnd = MPO");
  12542. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12543. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12544. MethodTable(TRUE);
  12545. TdTable(TypeTags, TRUE);
  12546. Info(source, "type descriptor info pointer");
  12547. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12548. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12549. IF (cellType # NIL) THEN
  12550. IF cellType.sizeInBits < 0 THEN
  12551. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12552. END;
  12553. Info(source, "cell size");
  12554. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12555. ELSE
  12556. Info(source, "record size");
  12557. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12558. END;
  12559. Info(source, "pointer offsets pointer");
  12560. padding := 1- source.pc MOD 2;
  12561. Symbol(source, source, source.pc+1+padding,0);
  12562. IF padding >0 THEN
  12563. Info(source, "padding");
  12564. FOR i := 1 TO padding DO Address(source,0) END;
  12565. END;
  12566. IF cellType # NIL THEN
  12567. PointerArray(source, cellType.cellScope, numberPointers);
  12568. ELSE
  12569. PointerArray(source, recordType.recordScope, numberPointers);
  12570. END;
  12571. ELSE
  12572. (*
  12573. simple:
  12574. td adr --> size
  12575. tag(1)
  12576. tag(2)
  12577. tag(3)
  12578. methods ->
  12579. *)
  12580. Info(source, "record size");
  12581. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12582. TdTable(TypeTags, FALSE);
  12583. MethodTable(FALSE);
  12584. END;
  12585. END NewTypeDescriptor;
  12586. BEGIN
  12587. x := x.resolved;
  12588. IF (x IS SyntaxTree.PointerType) THEN
  12589. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12590. END;
  12591. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12592. recordType := x(SyntaxTree.RecordType);
  12593. td := x.typeDeclaration;
  12594. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12595. ASSERT(td # NIL);
  12596. section := module.allSections.FindBySymbol(td); (* TODO *)
  12597. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12598. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12599. NewTypeDescriptor
  12600. END;
  12601. END;
  12602. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12603. cellType := x(SyntaxTree.CellType);
  12604. td := x.typeDeclaration;
  12605. section := module.allSections.FindBySymbol(td); (* TODO *)
  12606. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12607. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12608. NewTypeDescriptor
  12609. END;
  12610. END;
  12611. END
  12612. END CheckTypeDeclaration
  12613. END MetaDataGenerator;
  12614. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12615. VAR
  12616. trace-: BOOLEAN;
  12617. traceString-: SyntaxTree.IdentifierString;
  12618. traceModuleName-: SyntaxTree.IdentifierString;
  12619. profile-: BOOLEAN;
  12620. noRuntimeChecks: BOOLEAN;
  12621. simpleMetaData-: BOOLEAN;
  12622. noAsserts: BOOLEAN;
  12623. optimize-: BOOLEAN;
  12624. cooperative-: BOOLEAN;
  12625. preregisterStatic-: BOOLEAN;
  12626. dump-: Basic.Writer;
  12627. cellsAreObjects: BOOLEAN;
  12628. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12629. experiment: BOOLEAN;
  12630. PROCEDURE &InitIntermediateBackend*;
  12631. BEGIN
  12632. simpleMetaData := FALSE;
  12633. InitBackend;
  12634. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12635. SetTraceModuleName(DefaultTraceModuleName);
  12636. END InitIntermediateBackend;
  12637. (* must be overwritten by actual backend, if parameter registers should be used *)
  12638. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  12639. BEGIN
  12640. register := -1;
  12641. RETURN FALSE;
  12642. END GetParameterRegister;
  12643. PROCEDURE ResetParameterRegisters*;
  12644. BEGIN
  12645. END ResetParameterRegisters;
  12646. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12647. VAR
  12648. declarationVisitor: DeclarationVisitor;
  12649. implementationVisitor: ImplementationVisitor;
  12650. module: Sections.Module;
  12651. name, platformName: SyntaxTree.IdentifierString;
  12652. meta: MetaDataGenerator;
  12653. crc: CRC.CRC32Stream;
  12654. BEGIN
  12655. ResetError;
  12656. Global.GetSymbolName(x,name);
  12657. NEW(module,x,system); (* backend structures *)
  12658. Global.GetModuleName(x, name);
  12659. module.SetModuleName(name);
  12660. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12661. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12662. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12663. declarationVisitor.Module(x,module);
  12664. IF ~meta.simple THEN
  12665. meta.Module(implementationVisitor.moduleBodySection);
  12666. END;
  12667. GetDescription(platformName);
  12668. module.SetPlatformName(platformName);
  12669. NEW(crc);
  12670. module.allSections.WriteRaw(crc);
  12671. crc.Update;
  12672. meta.PatchCRC(crc.GetCRC());
  12673. RETURN module
  12674. END GenerateIntermediate;
  12675. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12676. BEGIN RETURN TRUE
  12677. END SupportedImmediate;
  12678. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12679. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12680. END ProcessSyntaxTreeModule;
  12681. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12682. VAR
  12683. result: Sections.Module;
  12684. traceName: Basic.MessageString;
  12685. BEGIN
  12686. ASSERT(intermediateCodeModule IS Sections.Module);
  12687. result := intermediateCodeModule(Sections.Module);
  12688. IF trace THEN
  12689. traceName := "intermediate code trace: ";
  12690. Strings.Append(traceName,traceString);
  12691. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12692. IF (traceString="") OR (traceString="*") THEN
  12693. result.Dump(dump);
  12694. dump.Update
  12695. ELSE
  12696. Sections.DumpFiltered(dump, result, traceString);
  12697. END
  12698. END;
  12699. RETURN result
  12700. END ProcessIntermediateCodeModule;
  12701. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12702. BEGIN instructionSet := "Intermediate";
  12703. END GetDescription;
  12704. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12705. BEGIN
  12706. SELF.simpleMetaData := simpleMetaData;
  12707. END SetSimpleMetaData;
  12708. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12709. BEGIN COPY(name, traceModuleName)
  12710. END SetTraceModuleName;
  12711. PROCEDURE DefineOptions*(options: Options.Options);
  12712. BEGIN
  12713. DefineOptions^(options);
  12714. options.Add(0X,"trace",Options.String);
  12715. options.Add(0X,"builtinsModule",Options.String);
  12716. options.Add(0X,"traceModule",Options.String);
  12717. options.Add(0X,"profile",Options.Flag);
  12718. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12719. options.Add(0X,"noAsserts",Options.Flag);
  12720. options.Add(0X,"metaData",Options.String);
  12721. options.Add('o',"optimize", Options.Flag);
  12722. options.Add(0X,"preregisterStatic", Options.Flag);
  12723. options.Add(0X,"cellsAreObjects", Options.Flag);
  12724. options.Add(0X,"preciseGC", Options.Flag);
  12725. options.Add(0X,"trackLeave", Options.Flag);
  12726. options.Add(0X,"writeBarriers", Options.Flag);
  12727. options.Add(0X,"experiment", Options.Flag);
  12728. END DefineOptions;
  12729. PROCEDURE GetOptions*(options: Options.Options);
  12730. VAR name,string: SyntaxTree.IdentifierString;
  12731. BEGIN
  12732. GetOptions^(options);
  12733. trace := options.GetString("trace",traceString);
  12734. profile := options.GetFlag("profile");
  12735. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12736. noAsserts := options.GetFlag("noAsserts");
  12737. cooperative := options.GetFlag("cooperative");
  12738. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12739. simpleMetaData := TRUE
  12740. END;
  12741. IF options.GetString("metaData",string) THEN
  12742. IF string = "simple" THEN simpleMetaData := TRUE
  12743. ELSIF string ="full" THEN simpleMetaData := FALSE
  12744. END;
  12745. END;
  12746. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12747. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12748. optimize := options.GetFlag("optimize");
  12749. preregisterStatic := options.GetFlag("preregisterStatic");
  12750. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12751. preciseGC := options.GetFlag("preciseGC");
  12752. trackLeave := options.GetFlag("trackLeave");
  12753. writeBarriers := options.GetFlag("writeBarriers");
  12754. experiment := options.GetFlag("experiment");
  12755. END GetOptions;
  12756. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12757. BEGIN RETURN SymbolFileFormat.Get()
  12758. END DefaultSymbolFileFormat;
  12759. END IntermediateBackend;
  12760. (* ----------------------------------- register allocation ------------------------------------- *)
  12761. (* register mapping scheme
  12762. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12763. spill offset
  12764. part(n) --> ticket <--> physical register
  12765. spill offset
  12766. *)
  12767. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12768. emptyOperand: IntermediateCode.Operand;
  12769. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12770. statCoopResetVariables: LONGINT;
  12771. statCoopModifyAssignments: LONGINT;
  12772. modifyAssignmentsPC : LONGINT;
  12773. statCoopNilCheck: LONGINT;
  12774. statCoopSwitch: LONGINT;
  12775. statCoopAssignProcedure: LONGINT;
  12776. statCoopTraceMethod: LONGINT;
  12777. statCoopResetProcedure: LONGINT;
  12778. statCoopTraceModule: LONGINT;
  12779. PROCEDURE ResetStatistics*;
  12780. BEGIN
  12781. statCoopResetVariables := 0;
  12782. statCoopModifyAssignments := 0;
  12783. statCoopNilCheck:= 0;
  12784. statCoopSwitch:= 0;
  12785. statCoopAssignProcedure:= 0;
  12786. statCoopTraceMethod:= 0;
  12787. statCoopResetProcedure:= 0;
  12788. statCoopTraceModule:= 0;
  12789. END ResetStatistics;
  12790. PROCEDURE Statistics*;
  12791. BEGIN
  12792. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12793. TRACE(statCoopNilCheck, statCoopSwitch);
  12794. TRACE(statCoopAssignProcedure,
  12795. statCoopTraceMethod,
  12796. statCoopResetProcedure,
  12797. statCoopTraceModule)
  12798. END Statistics;
  12799. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12800. VAR h: LONGINT;
  12801. BEGIN
  12802. WHILE b # 0 DO
  12803. h := a MOD b;
  12804. a := b;
  12805. b := h;
  12806. END;
  12807. RETURN a
  12808. END GCD;
  12809. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12810. BEGIN
  12811. RETURN a*b DIV GCD(a,b)
  12812. END SCM;
  12813. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12814. BEGIN
  12815. (*TRACE(a,b);*)
  12816. IF a = 0 THEN RETURN b
  12817. ELSIF b = 0 THEN RETURN a
  12818. ELSE RETURN SCM(a,b)
  12819. END;
  12820. END CommonAlignment;
  12821. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12822. BEGIN
  12823. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12824. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12825. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12826. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12827. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12828. END
  12829. END PassBySingleReference;
  12830. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12831. BEGIN
  12832. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12833. END PassInRegister;
  12834. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12835. VAR new: RegisterEntry;
  12836. BEGIN
  12837. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12838. IF queue = NIL THEN
  12839. queue := new
  12840. ELSE
  12841. new.next := queue;
  12842. IF queue#NIL THEN queue.prev := new END;
  12843. queue := new
  12844. END;
  12845. END AddRegisterEntry;
  12846. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12847. VAR this: RegisterEntry;
  12848. BEGIN
  12849. this := queue;
  12850. WHILE (this # NIL) & (this.register # register) DO
  12851. this := this.next;
  12852. END;
  12853. IF this = NIL THEN
  12854. RETURN FALSE
  12855. END;
  12856. ASSERT(this # NIL);
  12857. IF this = queue THEN queue := queue.next END;
  12858. IF this.prev # NIL THEN this.prev.next := this.next END;
  12859. IF this.next # NIL THEN this.next.prev := this.prev END;
  12860. RETURN TRUE
  12861. END RemoveRegisterEntry;
  12862. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12863. BEGIN ASSERT(cond);
  12864. END Assert;
  12865. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12866. BEGIN
  12867. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12868. END ReusableRegister;
  12869. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12870. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12871. BEGIN
  12872. procedure := moduleScope.bodyProcedure;
  12873. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12874. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12875. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12876. procedure.SetScope(moduleScope);
  12877. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12878. procedure.SetAccess(SyntaxTree.Hidden);
  12879. moduleScope.SetBodyProcedure(procedure);
  12880. moduleScope.AddProcedure(procedure);
  12881. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12882. END;
  12883. END EnsureBodyProcedure;
  12884. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12885. VAR import: SyntaxTree.Import;
  12886. selfName: SyntaxTree.IdentifierString;
  12887. module: SyntaxTree.Module;
  12888. BEGIN
  12889. scope.ownerModule.GetName(selfName);
  12890. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12891. module := scope.ownerModule
  12892. ELSE
  12893. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12894. IF import = NIL THEN
  12895. RETURN NIL
  12896. ELSIF import.module = NIL THEN
  12897. RETURN NIL
  12898. ELSE module := import.module
  12899. END;
  12900. END;
  12901. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12902. END GetSymbol;
  12903. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12904. BEGIN
  12905. op.mode := mode;
  12906. IntermediateCode.InitOperand(op.op);
  12907. IntermediateCode.InitOperand(op.tag);
  12908. IntermediateCode.InitOperand(op.extra);
  12909. op.dimOffset := 0;
  12910. END InitOperand;
  12911. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12912. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12913. BEGIN RETURN IntermediateCode.GetType(system, type)
  12914. END GetType;
  12915. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12916. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12917. BEGIN
  12918. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12919. (*
  12920. UniqueId(name,module,name,adr);
  12921. *)
  12922. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12923. constant.SetValue(value);
  12924. constant.SetAccess(SyntaxTree.Hidden);
  12925. module.moduleScope.AddConstant(constant);
  12926. constant.SetScope(module.moduleScope);
  12927. RETURN constant
  12928. END BuildConstant;
  12929. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12930. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12931. BEGIN
  12932. variable := scope.firstVariable;
  12933. WHILE variable # NIL DO
  12934. IF variable.NeedsTrace() THEN
  12935. RETURN TRUE;
  12936. END;
  12937. variable := variable.nextVariable;
  12938. END;
  12939. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12940. WHILE parameter # NIL DO
  12941. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12942. RETURN TRUE;
  12943. END;
  12944. parameter := parameter.nextParameter;
  12945. END;
  12946. RETURN FALSE;
  12947. END HasPointers;
  12948. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12949. 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));
  12950. END IsVariableParameter;
  12951. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12952. VAR parameter: SyntaxTree.Parameter;
  12953. BEGIN
  12954. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12955. WHILE parameter # NIL DO
  12956. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12957. IF parameter.movable THEN RETURN TRUE END;
  12958. parameter := parameter.nextParameter;
  12959. END;
  12960. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12961. END HasVariableParameters;
  12962. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12963. BEGIN
  12964. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12965. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12966. END HasExplicitTraceMethod;
  12967. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12968. BEGIN
  12969. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12970. IF (expression IS SyntaxTree.IntegerValue) THEN
  12971. val := expression(SyntaxTree.IntegerValue).value;
  12972. RETURN TRUE
  12973. ELSE
  12974. RETURN FALSE
  12975. END;
  12976. END IsIntegerConstant;
  12977. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12978. BEGIN
  12979. IF val <= 0 THEN RETURN FALSE END;
  12980. exp := 0;
  12981. WHILE ~ODD(val) DO
  12982. val := val DIV 2;
  12983. INC(exp)
  12984. END;
  12985. RETURN val = 1
  12986. END PowerOf2;
  12987. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12988. VAR procedure: SyntaxTree.Procedure;
  12989. BEGIN
  12990. procedure := record.recordScope.constructor;
  12991. IF procedure = NIL THEN
  12992. record := record.GetBaseRecord();
  12993. IF record # NIL THEN
  12994. procedure := GetConstructor(record)
  12995. END;
  12996. END;
  12997. RETURN procedure;
  12998. END GetConstructor;
  12999. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13000. BEGIN
  13001. value := SHORT(op.intValue);
  13002. RETURN op.mode = IntermediateCode.ModeImmediate;
  13003. END IsIntegerImmediate;
  13004. (** whether a type strictily is a pointer to record or object type
  13005. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13006. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13007. BEGIN
  13008. IF type = NIL THEN
  13009. RETURN FALSE
  13010. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13011. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13012. ELSE
  13013. RETURN FALSE
  13014. END
  13015. END IsStrictlyPointerToRecord;
  13016. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13017. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13018. END IsUnsafePointer;
  13019. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13020. BEGIN type := type.resolved;
  13021. IF type IS SyntaxTree.PointerType THEN
  13022. type := type(SyntaxTree.PointerType).pointerBase;
  13023. type := type.resolved;
  13024. IF type IS SyntaxTree.RecordType THEN
  13025. recordType := type(SyntaxTree.RecordType);
  13026. RETURN TRUE
  13027. ELSE
  13028. RETURN FALSE
  13029. END
  13030. ELSIF type IS SyntaxTree.RecordType THEN
  13031. recordType := type(SyntaxTree.RecordType);
  13032. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13033. ELSIF type IS SyntaxTree.ObjectType THEN
  13034. RETURN TRUE
  13035. ELSIF type IS SyntaxTree.AnyType THEN
  13036. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13037. ELSE
  13038. RETURN FALSE
  13039. END;
  13040. END IsPointerToRecord;
  13041. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13042. BEGIN
  13043. type := type.resolved;
  13044. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13045. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13046. END IsArrayOfSystemByte;
  13047. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13048. BEGIN
  13049. IF type = NIL THEN RETURN FALSE END;
  13050. type := type.resolved;
  13051. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13052. END IsOpenArray;
  13053. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13054. BEGIN
  13055. IF type = NIL THEN RETURN FALSE END;
  13056. type := type.resolved;
  13057. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13058. END IsSemiDynamicArray;
  13059. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13060. BEGIN
  13061. IF type = NIL THEN RETURN FALSE END;
  13062. type := type.resolved;
  13063. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13064. END IsStaticArray;
  13065. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13066. BEGIN
  13067. IF type = NIL THEN RETURN FALSE END;
  13068. type := type.resolved;
  13069. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13070. END IsStaticMathArray;
  13071. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13072. BEGIN
  13073. WHILE (IsStaticMathArray(type)) DO
  13074. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13075. END;
  13076. RETURN type;
  13077. END StaticMathArrayBaseType;
  13078. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13079. VAR size: LONGINT;
  13080. BEGIN
  13081. size := 1;
  13082. WHILE (IsStaticArray(type)) DO
  13083. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13084. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13085. END;
  13086. RETURN size;
  13087. END StaticArrayNumElements;
  13088. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13089. VAR size: LONGINT;
  13090. BEGIN
  13091. size := 1;
  13092. WHILE (IsStaticMathArray(type)) DO
  13093. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13094. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13095. END;
  13096. RETURN size;
  13097. END StaticMathArrayNumElements;
  13098. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13099. BEGIN
  13100. WHILE (IsStaticArray(type)) DO
  13101. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13102. END;
  13103. RETURN type;
  13104. END StaticArrayBaseType;
  13105. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13106. BEGIN
  13107. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13108. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13109. END;
  13110. RETURN type;
  13111. END ArrayBaseType;
  13112. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13113. BEGIN
  13114. IF type = NIL THEN RETURN FALSE END;
  13115. type := type.resolved;
  13116. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13117. END IsDelegate;
  13118. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13119. VAR i: LONGINT;
  13120. BEGIN
  13121. i := 0; type := type.resolved;
  13122. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13123. INC(i);
  13124. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13125. END;
  13126. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13127. INC(i);
  13128. type := type(SyntaxTree.MathArrayType).arrayBase;
  13129. IF type # NIL THEN type := type.resolved END;
  13130. END;
  13131. RETURN i
  13132. END DynamicDim;
  13133. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13134. BEGIN
  13135. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13136. type := type(SyntaxTree.ArrayType).arrayBase;
  13137. END;
  13138. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13139. type := type(SyntaxTree.MathArrayType).arrayBase;
  13140. END;
  13141. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13142. END StaticSize;
  13143. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13144. BEGIN
  13145. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13146. END IsImmediate;
  13147. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13148. BEGIN
  13149. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13150. END IsAddress;
  13151. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13152. BEGIN
  13153. RETURN (x.mode = IntermediateCode.ModeRegister);
  13154. END IsRegister;
  13155. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13156. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13157. BEGIN
  13158. typeDeclaration := recordType.typeDeclaration;
  13159. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13160. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13161. END GetRecordTypeName;
  13162. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13163. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13164. BEGIN
  13165. parSize := 0;
  13166. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13167. parameter := procedureType.returnParameter;
  13168. INC(parSize,system.SizeOfParameter(parameter));
  13169. parSize := parSize + (-parSize) MOD system.addressSize;
  13170. END;
  13171. parameter :=procedureType.lastParameter;
  13172. WHILE (parameter # NIL) DO
  13173. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13174. INC(parSize, system.addressSize);
  13175. ELSE
  13176. INC(parSize,system.SizeOfParameter(parameter));
  13177. parSize := parSize + (-parSize) MOD system.addressSize;
  13178. END;
  13179. parameter := parameter.prevParameter;
  13180. END;
  13181. IF procedureType.selfParameter # NIL THEN
  13182. parameter := procedureType.selfParameter;
  13183. INC(parSize,system.SizeOfParameter(parameter));
  13184. parSize := parSize + (-parSize) MOD system.addressSize;
  13185. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13186. END; (* method => self pointer *)
  13187. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13188. RETURN ToMemoryUnits(system,parSize)
  13189. END ParametersSize;
  13190. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13191. BEGIN
  13192. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13193. END IsNested;
  13194. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13195. BEGIN
  13196. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13197. scope := scope.outerScope;
  13198. END;
  13199. RETURN scope # NIL;
  13200. END InCellScope;
  13201. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13202. BEGIN
  13203. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13204. END ProcedureParametersSize;
  13205. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13206. VAR dataUnit: LONGINT;
  13207. BEGIN dataUnit := system.dataUnit;
  13208. ASSERT(size MOD system.dataUnit = 0);
  13209. RETURN LONGINT(size DIV system.dataUnit)
  13210. END ToMemoryUnits;
  13211. PROCEDURE Get*(): Backend.Backend;
  13212. VAR backend: IntermediateBackend;
  13213. BEGIN NEW(backend); RETURN backend
  13214. END Get;
  13215. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13216. VAR instruction: IntermediateCode.Instruction;
  13217. BEGIN
  13218. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13219. RETURN instruction
  13220. END Nop;
  13221. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13222. VAR instruction: IntermediateCode.Instruction;
  13223. BEGIN
  13224. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13225. RETURN instruction
  13226. END Mov;
  13227. (* like Mov but ensures that no new register will be allocated for dest *)
  13228. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13229. VAR instruction: IntermediateCode.Instruction;
  13230. BEGIN
  13231. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13232. RETURN instruction
  13233. END MovReplace;
  13234. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13235. VAR instruction: IntermediateCode.Instruction;
  13236. BEGIN
  13237. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13238. RETURN instruction
  13239. END Conv;
  13240. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13241. VAR instruction: IntermediateCode.Instruction;
  13242. BEGIN
  13243. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13244. RETURN instruction
  13245. END Call;
  13246. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13247. VAR op1, op2, op3: IntermediateCode.Operand;
  13248. VAR instruction: IntermediateCode.Instruction;
  13249. BEGIN
  13250. IntermediateCode.InitNumber(op1,pcOffset);
  13251. IntermediateCode.InitNumber(op2,callingConvention);
  13252. IntermediateCode.InitNumber(op3,unwind);
  13253. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13254. RETURN instruction
  13255. END Exit;
  13256. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13257. VAR instruction: IntermediateCode.Instruction;
  13258. BEGIN
  13259. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13260. RETURN instruction
  13261. END Return;
  13262. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13263. VAR instruction: IntermediateCode.Instruction;
  13264. BEGIN
  13265. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13266. RETURN instruction
  13267. END Result;
  13268. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13269. VAR op1: IntermediateCode.Operand;
  13270. VAR instruction: IntermediateCode.Instruction;
  13271. BEGIN
  13272. IntermediateCode.InitNumber(op1,nr);
  13273. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13274. RETURN instruction
  13275. END Trap;
  13276. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13277. VAR instruction: IntermediateCode.Instruction;
  13278. BEGIN
  13279. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13280. RETURN instruction
  13281. END Br;
  13282. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13283. VAR instruction: IntermediateCode.Instruction;
  13284. BEGIN
  13285. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13286. RETURN instruction
  13287. END Breq;
  13288. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13289. VAR instruction: IntermediateCode.Instruction;
  13290. BEGIN
  13291. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13292. RETURN instruction
  13293. END Brne;
  13294. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13295. VAR instruction: IntermediateCode.Instruction;
  13296. BEGIN
  13297. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13298. RETURN instruction
  13299. END Brge;
  13300. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13301. VAR instruction: IntermediateCode.Instruction;
  13302. BEGIN
  13303. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13304. RETURN instruction
  13305. END Brlt;
  13306. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13307. VAR instruction: IntermediateCode.Instruction;
  13308. BEGIN
  13309. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13310. RETURN instruction
  13311. END Pop;
  13312. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13313. VAR instruction: IntermediateCode.Instruction;
  13314. BEGIN
  13315. ASSERT(op.mode # IntermediateCode.Undefined);
  13316. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13317. RETURN instruction
  13318. END Push;
  13319. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13320. VAR instruction: IntermediateCode.Instruction;
  13321. BEGIN
  13322. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13323. RETURN instruction
  13324. END Neg;
  13325. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13326. VAR instruction: IntermediateCode.Instruction;
  13327. BEGIN
  13328. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13329. RETURN instruction
  13330. END Not;
  13331. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13332. VAR instruction: IntermediateCode.Instruction;
  13333. BEGIN
  13334. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13335. RETURN instruction
  13336. END Abs;
  13337. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13338. VAR instruction: IntermediateCode.Instruction;
  13339. BEGIN
  13340. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13341. ASSERT(~IsImmediate(instruction.op1));
  13342. RETURN instruction
  13343. END Mul;
  13344. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13345. VAR instruction: IntermediateCode.Instruction;
  13346. BEGIN
  13347. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13348. RETURN instruction
  13349. END Div;
  13350. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13351. VAR instruction: IntermediateCode.Instruction;
  13352. BEGIN
  13353. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13354. RETURN instruction
  13355. END Mod;
  13356. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13357. VAR instruction: IntermediateCode.Instruction;
  13358. BEGIN
  13359. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13360. RETURN instruction
  13361. END Sub;
  13362. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13363. VAR instruction: IntermediateCode.Instruction;
  13364. BEGIN
  13365. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13366. RETURN instruction
  13367. END Add;
  13368. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13369. VAR instruction: IntermediateCode.Instruction;
  13370. BEGIN
  13371. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13372. RETURN instruction
  13373. END And;
  13374. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13375. VAR instruction: IntermediateCode.Instruction;
  13376. BEGIN
  13377. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13378. RETURN instruction
  13379. END Or;
  13380. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13381. VAR instruction: IntermediateCode.Instruction;
  13382. BEGIN
  13383. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13384. RETURN instruction
  13385. END Xor;
  13386. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13387. VAR instruction: IntermediateCode.Instruction;
  13388. BEGIN
  13389. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13390. RETURN instruction
  13391. END Shl;
  13392. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13393. VAR instruction: IntermediateCode.Instruction;
  13394. BEGIN
  13395. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13396. RETURN instruction
  13397. END Shr;
  13398. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13399. VAR instruction: IntermediateCode.Instruction;
  13400. BEGIN
  13401. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13402. RETURN instruction
  13403. END Rol;
  13404. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13405. VAR instruction: IntermediateCode.Instruction;
  13406. BEGIN
  13407. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13408. RETURN instruction
  13409. END Ror;
  13410. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13411. VAR instruction: IntermediateCode.Instruction;
  13412. BEGIN
  13413. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13414. RETURN instruction
  13415. END Cas;
  13416. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13417. VAR instruction: IntermediateCode.Instruction;
  13418. BEGIN
  13419. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13420. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13421. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13422. RETURN instruction
  13423. END Copy;
  13424. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13425. VAR instruction: IntermediateCode.Instruction;
  13426. BEGIN
  13427. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13428. RETURN instruction
  13429. END Fill;
  13430. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13431. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13432. BEGIN
  13433. string := IntermediateCode.String(s);
  13434. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13435. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13436. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13437. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13438. RETURN instruction
  13439. END Asm;
  13440. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13441. VAR instruction: IntermediateCode.Instruction;
  13442. BEGIN
  13443. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13444. RETURN instruction
  13445. END Data;
  13446. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13447. VAR instruction: IntermediateCode.Instruction;
  13448. BEGIN
  13449. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13450. IntermediateCode.SetSubType(instruction, subtype);
  13451. RETURN instruction
  13452. END SpecialInstruction;
  13453. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13454. VAR op1: IntermediateCode.Operand;
  13455. VAR instruction: IntermediateCode.Instruction;
  13456. BEGIN
  13457. (*! generate a warning if size exceeds a certain limit *)
  13458. (*
  13459. ASSERT(bytes < 1000000); (* sanity check *)
  13460. *)
  13461. ASSERT(0 <= units); (* sanity check *)
  13462. IntermediateCode.InitNumber(op1,units);
  13463. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13464. RETURN instruction
  13465. END Reserve;
  13466. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13467. VAR op1: IntermediateCode.Operand;
  13468. VAR instruction: IntermediateCode.Instruction;
  13469. BEGIN
  13470. IntermediateCode.InitNumber(op1,position.start);
  13471. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13472. RETURN instruction
  13473. END LabelInstruction;
  13474. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13475. VAR pc: LONGINT;
  13476. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13477. BEGIN
  13478. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13479. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13480. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13481. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13482. IF instr.op1.type.form = IntermediateCode.Float THEN
  13483. RETURN instr.op1.floatValue = op.floatValue
  13484. ELSE
  13485. RETURN instr.op1.intValue = op.intValue
  13486. END;
  13487. END ProvidesValue;
  13488. BEGIN
  13489. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13490. pc := 0;
  13491. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13492. INC(pc);
  13493. END;
  13494. IF pc = data.pc THEN
  13495. data.Emit(Data(Basic.invalidPosition,vop));
  13496. END;
  13497. RETURN pc
  13498. END EnterImmediate;
  13499. PROCEDURE Init;
  13500. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13501. BEGIN
  13502. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13503. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13504. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13505. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13506. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13507. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13508. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13509. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13510. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13511. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13512. IntermediateCode.InitOperand(emptyOperand);
  13513. FOR i := 0 TO NumberSystemCalls-1 DO
  13514. name := "@SystemCall";
  13515. Basic.AppendNumber(name,i);
  13516. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13517. END;
  13518. END Init;
  13519. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13520. BEGIN
  13521. RETURN (symbol # NIL) & symbol.NeedsSection();
  13522. END IsExported;
  13523. BEGIN
  13524. Init;
  13525. END FoxIntermediateBackend.
  13526. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13527. # Release.Build --path="/temp/obg/" Win32 ~
  13528. # 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 ~
  13529. FStols.CloseFiles A2Z.exe ~
  13530. System.FreeDownTo FoxIntermediateBackend ~
  13531. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13532. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13533. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13534. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13535. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13536. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13537. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13538. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13539. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13540. GenericLinker.Mod Loader.Mod BootConsole.Mod