pg_sql.cpp 223 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425
  1. #include "../../parser/pg_wrapper/pg_compat.h"
  2. #ifdef _WIN32
  3. #define __restrict
  4. #endif
  5. #define TypeName PG_TypeName
  6. #define SortBy PG_SortBy
  7. #undef SIZEOF_SIZE_T
  8. extern "C" {
  9. #include "postgres.h"
  10. #include "nodes/pg_list.h"
  11. #include "nodes/parsenodes.h"
  12. #include "nodes/value.h"
  13. #undef Min
  14. #undef Max
  15. #undef TypeName
  16. #undef SortBy
  17. #undef TRACE
  18. #undef INFO
  19. #undef WARNING
  20. #undef ERROR
  21. #undef FATAL
  22. #undef NOTICE
  23. }
  24. #include "util/charset/utf8.h"
  25. #include "utils.h"
  26. #include <yql/essentials/ast/yql_expr.h>
  27. #include <yql/essentials/sql/settings/partitioning.h>
  28. #include <yql/essentials/parser/pg_wrapper/interface/config.h>
  29. #include <yql/essentials/parser/pg_wrapper/interface/parser.h>
  30. #include <yql/essentials/parser/pg_wrapper/interface/utils.h>
  31. #include <yql/essentials/parser/pg_wrapper/interface/raw_parser.h>
  32. #include <yql/essentials/parser/pg_wrapper/postgresql/src/backend/catalog/pg_type_d.h>
  33. #include <yql/essentials/parser/pg_catalog/catalog.h>
  34. #include <yql/essentials/providers/common/provider/yql_provider_names.h>
  35. #include <yql/essentials/minikql/mkql_type_builder.h>
  36. #include <yql/essentials/core/issue/yql_issue.h>
  37. #include <yql/essentials/core/sql_types/yql_callable_names.h>
  38. #include <yql/essentials/parser/pg_catalog/catalog.h>
  39. #include <yql/essentials/utils/log/log_level.h>
  40. #include <yql/essentials/utils/log/log.h>
  41. #include <util/string/builder.h>
  42. #include <util/string/cast.h>
  43. #include <util/string/join.h>
  44. #include <util/string/split.h>
  45. #include <util/generic/scope.h>
  46. #include <util/generic/stack.h>
  47. #include <util/generic/hash_set.h>
  48. constexpr auto PREPARED_PARAM_PREFIX = "$p";
  49. constexpr auto AUTO_PARAM_PREFIX = "a";
  50. constexpr auto DEFAULT_PARAM_TYPE = "unknown";
  51. namespace NSQLTranslationPG {
  52. using namespace NYql;
  53. static const THashSet<TString> SystemColumns = { "tableoid", "xmin", "cmin", "xmax", "cmax", "ctid" };
  54. template <typename T>
  55. const T* CastNode(const void* nodeptr, int tag) {
  56. Y_ENSURE(nodeTag(nodeptr) == tag);
  57. return static_cast<const T*>(nodeptr);
  58. }
  59. const Node* Expr2Node(const Expr* e) {
  60. return reinterpret_cast<const Node*>(e);
  61. }
  62. int NodeTag(const Node* node) {
  63. return nodeTag(node);
  64. }
  65. int NodeTag(const ValUnion& val) {
  66. return NodeTag(&val.node);
  67. }
  68. int IntVal(const ValUnion& val) {
  69. Y_ENSURE(val.node.type == T_Integer);
  70. return intVal(&val.node);
  71. }
  72. bool BoolVal(const ValUnion& val) {
  73. Y_ENSURE(val.node.type == T_Boolean);
  74. return boolVal(&val.node);
  75. }
  76. const char* StrFloatVal(const ValUnion& val) {
  77. Y_ENSURE(val.node.type == T_Float);
  78. return strVal(&val.node);
  79. }
  80. const char* StrVal(const ValUnion& val) {
  81. Y_ENSURE(val.node.type == T_String || val.node.type == T_BitString);
  82. return strVal(&val.node);
  83. }
  84. int BoolVal(const Node* node) {
  85. Y_ENSURE(node->type == T_Boolean);
  86. return boolVal(node);
  87. }
  88. int IntVal(const Node* node) {
  89. Y_ENSURE(node->type == T_Integer);
  90. return intVal(node);
  91. }
  92. double FloatVal(const Node* node) {
  93. Y_ENSURE(node->type == T_Float);
  94. return floatVal(node);
  95. }
  96. const char* StrFloatVal(const Node* node) {
  97. Y_ENSURE(node->type == T_Float);
  98. return strVal(node);
  99. }
  100. const char* StrVal(const Node* node) {
  101. Y_ENSURE(node->type == T_String || node->type == T_BitString);
  102. return strVal(node);
  103. }
  104. bool ValueAsString(const ValUnion& val, bool isNull, TString& ret) {
  105. if (isNull) {
  106. ret = "NULL";
  107. return true;
  108. }
  109. switch (NodeTag(val)) {
  110. case T_Boolean: {
  111. ret = BoolVal(val) ? "t" : "f";
  112. return true;
  113. }
  114. case T_Integer: {
  115. ret = ToString(IntVal(val));
  116. return true;
  117. }
  118. case T_Float: {
  119. ret = StrFloatVal(val);
  120. return true;
  121. }
  122. case T_String:
  123. case T_BitString: {
  124. ret = StrVal(val);
  125. return true;
  126. }
  127. default:
  128. return false;
  129. }
  130. }
  131. int ListLength(const List* list) {
  132. return list_length(list);
  133. }
  134. int StrLength(const char* s) {
  135. return s ? strlen(s) : 0;
  136. }
  137. int StrCompare(const char* s1, const char* s2) {
  138. return strcmp(s1 ? s1 : "", s2 ? s2 : "");
  139. }
  140. int StrICompare(const char* s1, const char* s2) {
  141. return stricmp(s1 ? s1 : "", s2 ? s2 : "");
  142. }
  143. std::shared_ptr<List> ListMake1(void* cell) {
  144. return std::shared_ptr<List>(list_make1(cell), list_free);
  145. }
  146. #define CAST_NODE(nodeType, nodeptr) CastNode<nodeType>(nodeptr, T_##nodeType)
  147. #define CAST_NODE_EXT(nodeType, tag, nodeptr) CastNode<nodeType>(nodeptr, tag)
  148. #define LIST_CAST_NTH(nodeType, list, index) CAST_NODE(nodeType, list_nth(list, index))
  149. #define LIST_CAST_EXT_NTH(nodeType, tag, list, index) CAST_NODE_EXT(nodeType, tag, list_nth(list, i))
  150. const Node* ListNodeNth(const List* list, int index) {
  151. return static_cast<const Node*>(list_nth(list, index));
  152. }
  153. const IndexElem* IndexElement(const Node* node) {
  154. Y_ENSURE(node->type == T_IndexElem);
  155. return ((const IndexElem*)node);
  156. }
  157. #define AT_LOCATION(node) \
  158. TLocationGuard guard(this, node->location);
  159. #define AT_LOCATION_EX(node, field) \
  160. TLocationGuard guard(this, node->field);
  161. std::tuple<TStringBuf, TStringBuf> getSchemaAndObjectName(const List* nameList) {
  162. switch (ListLength(nameList)) {
  163. case 2: {
  164. const auto clusterName = StrVal(ListNodeNth(nameList, 0));
  165. const auto tableName = StrVal(ListNodeNth(nameList, 1));
  166. return {clusterName, tableName};
  167. }
  168. case 1: {
  169. const auto tableName = StrVal(ListNodeNth(nameList, 0));
  170. return {"", tableName};
  171. }
  172. default: {
  173. return {"", ""};
  174. }
  175. }
  176. }
  177. struct TPgConst {
  178. TMaybe<TString> value;
  179. enum class Type {
  180. boolean,
  181. int4,
  182. int8,
  183. numeric,
  184. text,
  185. unknown,
  186. bit,
  187. nil,
  188. };
  189. static TString ToString(const TPgConst::Type& type) {
  190. switch (type) {
  191. case TPgConst::Type::boolean:
  192. return "bool";
  193. case TPgConst::Type::int4:
  194. return "int4";
  195. case TPgConst::Type::int8:
  196. return "int8";
  197. case TPgConst::Type::numeric:
  198. return "numeric";
  199. case TPgConst::Type::text:
  200. return "text";
  201. case TPgConst::Type::unknown:
  202. return "unknown";
  203. case TPgConst::Type::bit:
  204. return "bit";
  205. case TPgConst::Type::nil:
  206. return "unknown";
  207. }
  208. }
  209. Type type;
  210. };
  211. TMaybe<TPgConst> GetValueNType(const A_Const* value) {
  212. TPgConst pgConst;
  213. if (value->isnull) {
  214. pgConst.type = TPgConst::Type::nil;
  215. return pgConst;
  216. }
  217. const auto& val = value->val;
  218. switch (NodeTag(val)) {
  219. case T_Boolean: {
  220. pgConst.value = BoolVal(val) ? "t" : "f";
  221. pgConst.type = TPgConst::Type::boolean;
  222. return pgConst;
  223. }
  224. case T_Integer: {
  225. pgConst.value = ToString(IntVal(val));
  226. pgConst.type = TPgConst::Type::int4;
  227. return pgConst;
  228. }
  229. case T_Float: {
  230. auto s = StrFloatVal(val);
  231. i64 v;
  232. const bool isInt8 = TryFromString<i64>(s, v);
  233. pgConst.value = ToString(s);
  234. pgConst.type = isInt8 ? TPgConst::Type::int8 : TPgConst::Type::numeric;
  235. return pgConst;
  236. }
  237. case T_String: {
  238. pgConst.value = ToString(StrVal(val));
  239. pgConst.type = TPgConst::Type::unknown; // to support implicit casts
  240. return pgConst;
  241. }
  242. case T_BitString: {
  243. pgConst.value = ToString(StrVal(val));
  244. pgConst.type = TPgConst::Type::bit;
  245. return pgConst;
  246. }
  247. default: {
  248. return {};
  249. }
  250. }
  251. }
  252. class TConverter : public IPGParseEvents {
  253. friend class TLocationGuard;
  254. private:
  255. class TLocationGuard {
  256. private:
  257. TConverter* Owner;
  258. public:
  259. TLocationGuard(TConverter* owner, int location)
  260. : Owner(owner)
  261. {
  262. Owner->PushPosition(location);
  263. }
  264. ~TLocationGuard() {
  265. Owner->PopPosition();
  266. }
  267. };
  268. public:
  269. struct TFromDesc {
  270. TAstNode* Source = nullptr;
  271. TString Alias;
  272. TVector<TString> ColNames;
  273. bool InjectRead = false;
  274. };
  275. struct TReadWriteKeyExprs {
  276. TAstNode* SinkOrSource = nullptr;
  277. TAstNode* Key = nullptr;
  278. };
  279. struct TExprSettings {
  280. bool AllowColumns = false;
  281. bool AllowAggregates = false;
  282. bool AllowOver = false;
  283. bool AllowReturnSet = false;
  284. bool AllowSubLinks = false;
  285. bool AutoParametrizeEnabled = true;
  286. TVector<TAstNode*>* WindowItems = nullptr;
  287. TString Scope;
  288. };
  289. struct TView {
  290. TString Name;
  291. TVector<TString> ColNames;
  292. TAstNode* Source = nullptr;
  293. };
  294. using TViews = THashMap<TString, TView>;
  295. struct TState {
  296. TMaybe<TString> ApplicationName;
  297. TString CostBasedOptimizer;
  298. TVector<TAstNode*> Statements;
  299. ui32 ReadIndex = 0;
  300. TViews Views;
  301. TVector<TViews> CTE;
  302. const TView* CurrentRecursiveView = nullptr;
  303. TVector<NYql::TPosition> Positions = {NYql::TPosition()};
  304. THashMap<TString, TString> ParamNameToPgTypeName;
  305. NYql::IAutoParamBuilderPtr AutoParamValues;
  306. };
  307. TConverter(TVector<TAstParseResult>& astParseResults, const NSQLTranslation::TTranslationSettings& settings,
  308. const TString& query, TVector<TStmtParseInfo>* stmtParseInfo, bool perStatementResult,
  309. TMaybe<ui32> sqlProcArgsCount)
  310. : AstParseResults(astParseResults)
  311. , Settings(settings)
  312. , DqEngineEnabled(Settings.DqDefaultAuto->Allow())
  313. , BlockEngineEnabled(Settings.BlockDefaultAuto->Allow())
  314. , StmtParseInfo(stmtParseInfo)
  315. , PerStatementResult(perStatementResult)
  316. , SqlProcArgsCount(sqlProcArgsCount)
  317. {
  318. Y_ENSURE(settings.Mode == NSQLTranslation::ESqlMode::QUERY || settings.Mode == NSQLTranslation::ESqlMode::LIMITED_VIEW);
  319. Y_ENSURE(settings.Mode != NSQLTranslation::ESqlMode::LIMITED_VIEW || !perStatementResult);
  320. State.ApplicationName = Settings.ApplicationName;
  321. AstParseResults.push_back({});
  322. if (StmtParseInfo) {
  323. StmtParseInfo->push_back({});
  324. }
  325. ScanRows(query);
  326. for (auto& flag : Settings.Flags) {
  327. if (flag == "DqEngineEnable") {
  328. DqEngineEnabled = true;
  329. } else if (flag == "DqEngineForce") {
  330. DqEngineForce = true;
  331. } else if (flag == "BlockEngineEnable") {
  332. BlockEngineEnabled = true;
  333. } else if (flag == "BlockEngineForce") {
  334. BlockEngineForce = true;
  335. } if (flag == "UnorderedResult") {
  336. UnorderedResult = true;
  337. }
  338. }
  339. if (Settings.PathPrefix) {
  340. TablePathPrefix = Settings.PathPrefix + "/";
  341. }
  342. for (const auto& [cluster, provider] : Settings.ClusterMapping) {
  343. if (provider != PgProviderName) {
  344. Provider = provider;
  345. break;
  346. }
  347. }
  348. if (!Provider) {
  349. Provider = PgProviderName;
  350. }
  351. Y_ENSURE(!Provider.empty());
  352. for (size_t i = 0; i < Settings.PgParameterTypeOids.size(); ++i) {
  353. const auto paramName = PREPARED_PARAM_PREFIX + ToString(i + 1);
  354. const auto typeOid = Settings.PgParameterTypeOids[i];
  355. const auto& typeName =
  356. typeOid != UNKNOWNOID ? NPg::LookupType(typeOid).Name : DEFAULT_PARAM_TYPE;
  357. State.ParamNameToPgTypeName[paramName] = typeName;
  358. }
  359. }
  360. void OnResult(const List* raw) {
  361. if (!PerStatementResult) {
  362. AstParseResults[StatementId].Pool = std::make_unique<TMemoryPool>(4096);
  363. AstParseResults[StatementId].Root = ParseResult(raw);
  364. AstParseResults[StatementId].PgAutoParamValues = State.AutoParamValues;
  365. return;
  366. }
  367. AstParseResults.resize(ListLength(raw));
  368. if (StmtParseInfo) {
  369. StmtParseInfo->resize(AstParseResults.size());
  370. }
  371. for (; StatementId < AstParseResults.size(); ++StatementId) {
  372. AstParseResults[StatementId].Pool = std::make_unique<TMemoryPool>(4096);
  373. AstParseResults[StatementId].Root = ParseResult(raw, StatementId);
  374. AstParseResults[StatementId].PgAutoParamValues = State.AutoParamValues;
  375. State = {};
  376. }
  377. }
  378. void OnError(const TIssue& issue) {
  379. AstParseResults[StatementId].Issues.AddIssue(issue);
  380. }
  381. void PrepareStatements() {
  382. auto configSource = L(A("DataSource"), QA(TString(NYql::ConfigProviderName)));
  383. State.Statements.push_back(L(A("let"), A("world"), L(A(TString(NYql::ConfigureName)), A("world"), configSource,
  384. QA("OrderedColumns"))));
  385. }
  386. TAstNode* ParseResult(const List* raw, const TMaybe<ui32> statementId = Nothing()) {
  387. PrepareStatements();
  388. auto configSource = L(A("DataSource"), QA(TString(NYql::ConfigProviderName)));
  389. ui32 blockEnginePgmPos = State.Statements.size();
  390. State.Statements.push_back(configSource);
  391. ui32 costBasedOptimizerPos = State.Statements.size();
  392. State.Statements.push_back(configSource);
  393. ui32 dqEnginePgmPos = State.Statements.size();
  394. State.Statements.push_back(configSource);
  395. if (statementId) {
  396. if (!ParseRawStmt(LIST_CAST_NTH(RawStmt, raw, *statementId))) {
  397. return nullptr;
  398. }
  399. } else {
  400. for (int i = 0; i < ListLength(raw); ++i) {
  401. if (!ParseRawStmt(LIST_CAST_NTH(RawStmt, raw, i))) {
  402. return nullptr;
  403. }
  404. }
  405. }
  406. if (!State.Views.empty()) {
  407. AddError("Not all views have been dropped");
  408. return nullptr;
  409. }
  410. if (Settings.EndOfQueryCommit && Settings.Mode != NSQLTranslation::ESqlMode::LIMITED_VIEW) {
  411. State.Statements.push_back(L(A("let"), A("world"), L(A("CommitAll!"),
  412. A("world"))));
  413. }
  414. AddVariableDeclarations();
  415. if (Settings.Mode != NSQLTranslation::ESqlMode::LIMITED_VIEW) {
  416. State.Statements.push_back(L(A("return"), A("world")));
  417. }
  418. if (DqEngineEnabled) {
  419. State.Statements[dqEnginePgmPos] = L(A("let"), A("world"), L(A(TString(NYql::ConfigureName)), A("world"), configSource,
  420. QA("DqEngine"), QA(DqEngineForce ? "force" : "auto")));
  421. } else {
  422. State.Statements.erase(State.Statements.begin() + dqEnginePgmPos);
  423. }
  424. if (State.CostBasedOptimizer) {
  425. State.Statements[costBasedOptimizerPos] = L(A("let"), A("world"), L(A(TString(NYql::ConfigureName)), A("world"), configSource,
  426. QA("CostBasedOptimizer"), QA(State.CostBasedOptimizer)));
  427. } else {
  428. State.Statements.erase(State.Statements.begin() + costBasedOptimizerPos);
  429. }
  430. if (BlockEngineEnabled) {
  431. State.Statements[blockEnginePgmPos] = L(A("let"), A("world"), L(A(TString(NYql::ConfigureName)), A("world"), configSource,
  432. QA("BlockEngine"), QA(BlockEngineForce ? "force" : "auto")));
  433. } else {
  434. State.Statements.erase(State.Statements.begin() + blockEnginePgmPos);
  435. }
  436. return FinishStatements();
  437. }
  438. TAstNode* FinishStatements() {
  439. return VL(State.Statements.data(), State.Statements.size());
  440. }
  441. [[nodiscard]]
  442. bool ParseRawStmt(const RawStmt* value) {
  443. AT_LOCATION_EX(value, stmt_location);
  444. auto node = value->stmt;
  445. if (Settings.Mode == NSQLTranslation::ESqlMode::LIMITED_VIEW) {
  446. if (NodeTag(node) != T_SelectStmt && NodeTag(node) != T_VariableSetStmt) {
  447. AddError("Unsupported statement in LIMITED_VIEW mode");
  448. return false;
  449. }
  450. }
  451. if (StmtParseInfo) {
  452. (*StmtParseInfo)[StatementId].CommandTagName = GetCommandName(node);
  453. }
  454. switch (NodeTag(node)) {
  455. case T_SelectStmt:
  456. return ParseSelectStmt(CAST_NODE(SelectStmt, node), {.Inner = false}) != nullptr;
  457. case T_InsertStmt:
  458. return ParseInsertStmt(CAST_NODE(InsertStmt, node)) != nullptr;
  459. case T_UpdateStmt:
  460. return ParseUpdateStmt(CAST_NODE(UpdateStmt, node)) != nullptr;
  461. case T_ViewStmt:
  462. return ParseViewStmt(CAST_NODE(ViewStmt, node)) != nullptr;
  463. case T_CreateStmt:
  464. return ParseCreateStmt(CAST_NODE(CreateStmt, node)) != nullptr;
  465. case T_DropStmt:
  466. return ParseDropStmt(CAST_NODE(DropStmt, node)) != nullptr;
  467. case T_VariableSetStmt:
  468. {
  469. // YQL-16284
  470. const char* node_name = CAST_NODE(VariableSetStmt, node)->name;
  471. const char* skip_statements[] = {
  472. "extra_float_digits", // jdbc
  473. "application_name", // jdbc
  474. "statement_timeout", // pg_dump
  475. "lock_timeout", // pg_dump
  476. "idle_in_transaction_session_timeout", // pg_dump
  477. "client_encoding", // pg_dump
  478. "standard_conforming_strings", // pg_dump
  479. "check_function_bodies", // pg_dump
  480. "xmloption", // pg_dump
  481. "client_min_messages", // pg_dump
  482. "row_security", // pg_dump
  483. "escape_string_warning", // zabbix
  484. "bytea_output", // zabbix
  485. "datestyle", // pgadmin 4
  486. "timezone", // mediawiki
  487. NULL,
  488. };
  489. for (int i = 0; skip_statements[i] != NULL; i++){
  490. const char *skip_name = skip_statements[i];
  491. if (stricmp(node_name, skip_name) == 0){
  492. return true;
  493. }
  494. };
  495. };
  496. return ParseVariableSetStmt(CAST_NODE(VariableSetStmt, node)) != nullptr;
  497. case T_DeleteStmt:
  498. return ParseDeleteStmt(CAST_NODE(DeleteStmt, node)) != nullptr;
  499. case T_VariableShowStmt:
  500. return ParseVariableShowStmt(CAST_NODE(VariableShowStmt, node)) != nullptr;
  501. case T_TransactionStmt:
  502. return ParseTransactionStmt(CAST_NODE(TransactionStmt, node));
  503. case T_IndexStmt:
  504. return ParseIndexStmt(CAST_NODE(IndexStmt, node)) != nullptr;
  505. case T_CreateSeqStmt:
  506. return ParseCreateSeqStmt(CAST_NODE(CreateSeqStmt, node)) != nullptr;
  507. case T_AlterSeqStmt:
  508. return ParseAlterSeqStmt(CAST_NODE(AlterSeqStmt, node)) != nullptr;
  509. case T_AlterTableStmt:
  510. return ParseAlterTableStmt(CAST_NODE(AlterTableStmt, node)) != nullptr;
  511. default:
  512. NodeNotImplemented(value, node);
  513. return false;
  514. }
  515. }
  516. [[nodiscard]]
  517. bool ExtractPgConstsForAutoParam(List* rawValuesLists, TVector<TPgConst>& pgConsts) {
  518. YQL_LOG_CTX_SCOPE(TStringBuf("PgSql Autoparametrize"), __FUNCTION__);
  519. Y_ABORT_UNLESS(rawValuesLists);
  520. size_t rows = ListLength(rawValuesLists);
  521. if (rows == 0 || !Settings.AutoParametrizeEnabled || !Settings.AutoParametrizeValuesStmt) {
  522. return false;
  523. }
  524. size_t cols = ListLength(CAST_NODE(List, ListNodeNth(rawValuesLists, 0)));
  525. pgConsts.reserve(rows * cols);
  526. for (int rowIdx = 0; rowIdx < ListLength(rawValuesLists); ++rowIdx) {
  527. const auto rawRow = CAST_NODE(List, ListNodeNth(rawValuesLists, rowIdx));
  528. for (int colIdx = 0; colIdx < ListLength(rawRow); ++colIdx) {
  529. const auto rawCell = ListNodeNth(rawRow, colIdx);
  530. if (NodeTag(rawCell) != T_A_Const) {
  531. YQL_CLOG(INFO, Default) << "Auto parametrization of " << NodeTag(rawCell) << " is not supported";
  532. return false;
  533. }
  534. auto pgConst = GetValueNType(CAST_NODE(A_Const, rawCell));
  535. if (!pgConst) {
  536. return false;
  537. }
  538. pgConsts.push_back(std::move(pgConst.GetRef()));
  539. }
  540. }
  541. return true;
  542. }
  543. TMaybe<TVector<TPgConst::Type>> InferColumnTypesForValuesStmt(const TVector<TPgConst>& values, size_t cols) {
  544. Y_ABORT_UNLESS((values.size() % cols == 0), "wrong amount of columns for auto param values vector");
  545. TVector<TMaybe<TPgConst::Type>> maybeColumnTypes(cols);
  546. for (size_t i = 0; i < values.size(); ++i) {
  547. const auto& value = values[i];
  548. size_t col = i % cols;
  549. auto& columnType = maybeColumnTypes[col];
  550. if (!columnType || columnType.GetRef() == TPgConst::Type::unknown || columnType.GetRef() == TPgConst::Type::nil) {
  551. columnType = value.type;
  552. continue;
  553. }
  554. // should we allow compatible types here?
  555. if (columnType.GetRef() != value.type && columnType.GetRef() != TPgConst::Type::unknown && columnType.GetRef() != TPgConst::Type::nil) {
  556. YQL_CLOG(INFO, Default)
  557. << "Failed to auto parametrize: different types: "
  558. << TPgConst::ToString(columnType.GetRef()) << " and " << TPgConst::ToString(value.type)
  559. << " in col " << col;
  560. return {};
  561. }
  562. }
  563. TVector<TPgConst::Type> columnTypes;
  564. for (auto& maybeColumnType: maybeColumnTypes) {
  565. if (maybeColumnType.Empty()) {
  566. YQL_CLOG(INFO, Default) << "Failed to auto parametrize: can't infer PgType for column";
  567. return {};
  568. }
  569. columnTypes.emplace_back(maybeColumnType.GetRef());
  570. }
  571. return columnTypes;
  572. }
  573. TString AddSimpleAutoParam(TPgConst&& valueNType) {
  574. if (!State.AutoParamValues) {
  575. Y_ENSURE(Settings.AutoParamBuilderFactory);
  576. State.AutoParamValues = Settings.AutoParamBuilderFactory->MakeBuilder();
  577. }
  578. auto nextName = TString(AUTO_PARAM_PREFIX) + ToString(State.AutoParamValues->Size());
  579. auto& type = State.AutoParamValues->Add(nextName);
  580. type.Pg(TPgConst::ToString(valueNType.type));
  581. auto& data = type.FinishType();
  582. data.Pg(valueNType.value);
  583. data.FinishData();
  584. return nextName;
  585. }
  586. TString AddValuesAutoParam(TVector<TPgConst>&& values, TVector<TPgConst::Type>&& columnTypes) {
  587. if (!State.AutoParamValues) {
  588. Y_ENSURE(Settings.AutoParamBuilderFactory);
  589. State.AutoParamValues = Settings.AutoParamBuilderFactory->MakeBuilder();
  590. }
  591. auto nextName = TString(AUTO_PARAM_PREFIX) + ToString(State.AutoParamValues->Size());
  592. auto& type = State.AutoParamValues->Add(nextName);
  593. type.BeginList();
  594. type.BeginTuple();
  595. for (const auto& t : columnTypes) {
  596. type.BeforeItem();
  597. type.Pg(TPgConst::ToString(t));
  598. type.AfterItem();
  599. }
  600. type.EndTuple();
  601. type.EndList();
  602. auto& data = type.FinishType();
  603. data.BeginList();
  604. size_t cols = columnTypes.size();
  605. for (size_t idx = 0; idx < values.size(); idx += cols){
  606. data.BeforeItem();
  607. data.BeginTuple();
  608. for (size_t delta = 0; delta < cols; ++delta) {
  609. data.BeforeItem();
  610. data.Pg(values[idx + delta].value);
  611. data.AfterItem();
  612. }
  613. data.EndTuple();
  614. data.AfterItem();
  615. }
  616. data.EndList();
  617. data.FinishData();
  618. return nextName;
  619. }
  620. TAstNode* MakeValuesStmtAutoParam(TVector<TPgConst>&& values, TVector<TPgConst::Type>&& columnTypes) {
  621. TVector<TAstNode*> autoParamTupleType;
  622. autoParamTupleType.reserve(columnTypes.size());
  623. autoParamTupleType.push_back(A("TupleType"));
  624. for (const auto& type : columnTypes) {
  625. auto pgType = L(A("PgType"), QA(TPgConst::ToString(type)));
  626. autoParamTupleType.push_back(pgType);
  627. }
  628. const auto paramType = L(A("ListType"), VL(autoParamTupleType));
  629. const auto paramName = AddValuesAutoParam(std::move(values), std::move(columnTypes));
  630. State.Statements.push_back(L(A("declare"), A(paramName), paramType));
  631. YQL_CLOG(INFO, Default) << "Successfully autoparametrized VALUES at" << State.Positions.back();
  632. return A(paramName);
  633. }
  634. [[nodiscard]]
  635. TAstNode* ParseValuesList(List* valuesLists, bool buildCommonType) {
  636. TVector<TAstNode*> valNames;
  637. uint64 colIdx = 0;
  638. TExprSettings settings;
  639. settings.AllowColumns = false;
  640. settings.Scope = "VALUES";
  641. for (int valueIndex = 0; valueIndex < ListLength(valuesLists); ++valueIndex) {
  642. auto node = ListNodeNth(valuesLists, valueIndex);
  643. if (NodeTag(node) != T_List) {
  644. NodeNotImplemented(node);
  645. return nullptr;
  646. }
  647. auto lst = CAST_NODE(List, node);
  648. if (valueIndex == 0) {
  649. for (int item = 0; item < ListLength(lst); ++item) {
  650. valNames.push_back(QA("column" + ToString(colIdx++)));
  651. }
  652. } else {
  653. if (ListLength(lst) != (int)valNames.size()) {
  654. AddError("VALUES lists must all be the same length");
  655. return nullptr;
  656. }
  657. }
  658. }
  659. TVector<TPgConst> pgConsts;
  660. bool canAutoparametrize = ExtractPgConstsForAutoParam(valuesLists, pgConsts);
  661. if (canAutoparametrize) {
  662. auto maybeColumnTypes = InferColumnTypesForValuesStmt(pgConsts, valNames.size());
  663. if (maybeColumnTypes) {
  664. auto valuesNode = MakeValuesStmtAutoParam(std::move(pgConsts), std::move(maybeColumnTypes.GetRef()));
  665. return QL(QA("values"), QVL(valNames.data(), valNames.size()), valuesNode);
  666. }
  667. }
  668. TVector<TAstNode*> valueRows;
  669. valueRows.reserve(ListLength(valuesLists));
  670. valueRows.push_back(A(buildCommonType ? "PgValuesList" : "AsList"));
  671. for (int valueIndex = 0; valueIndex < ListLength(valuesLists); ++valueIndex) {
  672. auto node = ListNodeNth(valuesLists, valueIndex);
  673. if (NodeTag(node) != T_List) {
  674. NodeNotImplemented(node);
  675. return nullptr;
  676. }
  677. auto lst = CAST_NODE(List, node);
  678. TVector<TAstNode*> row;
  679. for (int item = 0; item < ListLength(lst); ++item) {
  680. auto cell = ParseExpr(ListNodeNth(lst, item), settings);
  681. if (!cell) {
  682. return nullptr;
  683. }
  684. row.push_back(cell);
  685. }
  686. valueRows.push_back(QVL(row.data(), row.size()));
  687. }
  688. return QL(QA("values"), QVL(valNames.data(), valNames.size()), VL(valueRows));
  689. }
  690. TAstNode* ParseSetConfig(const FuncCall* value) {
  691. auto length = ListLength(value->args);
  692. if (length != 3) {
  693. AddError(TStringBuilder() << "Expected 3 arguments, but got: " << length);
  694. return nullptr;
  695. }
  696. VariableSetStmt config;
  697. config.kind = VAR_SET_VALUE;
  698. auto arg0 = ListNodeNth(value->args, 0);
  699. auto arg1 = ListNodeNth(value->args, 1);
  700. auto arg2 = ListNodeNth(value->args, 2);
  701. if (NodeTag(arg2) != T_A_Const) {
  702. AddError(TStringBuilder() << "Expected AConst node as is_local arg, but got node with tag: " << NodeTag(arg2));
  703. return nullptr;
  704. }
  705. auto isLocalConst = CAST_NODE(A_Const, arg2);
  706. if (isLocalConst->isnull) {
  707. AddError(TStringBuilder() << "Expected t/f, but got null");
  708. return nullptr;
  709. }
  710. if (NodeTag(isLocalConst->val) != T_Boolean) {
  711. AddError(TStringBuilder() << "Expected bool in const, but got something wrong: " << NodeTag(isLocalConst->val));
  712. return nullptr;
  713. }
  714. config.is_local = BoolVal(isLocalConst->val);
  715. if (NodeTag(arg0) != T_A_Const || NodeTag(arg1) != T_A_Const) {
  716. AddError(TStringBuilder() << "Expected const with string, but got something else: " << NodeTag(arg0));
  717. return nullptr;
  718. }
  719. if (CAST_NODE(A_Const, arg0)->isnull || CAST_NODE(A_Const, arg1)->isnull) {
  720. AddError(TStringBuilder() << "Expected string const as name arg, but got null");
  721. return nullptr;
  722. }
  723. auto name = CAST_NODE(A_Const, arg0)->val;
  724. auto val = CAST_NODE(A_Const, arg1)->val;
  725. if (NodeTag(name) != T_String || NodeTag(val) != T_String) {
  726. AddError(TStringBuilder() << "Expected string const as name arg, but got something else: " << NodeTag(name));
  727. return nullptr;
  728. }
  729. config.name = (char*)StrVal(name);
  730. config.args = list_make1((void*)arg1);
  731. return ParseVariableSetStmt(&config, true);
  732. }
  733. using TTraverseSelectStack = TStack<std::pair<const SelectStmt*, bool>>;
  734. using TTraverseNodeStack = TStack<std::pair<const Node*, bool>>;
  735. struct TSelectStmtSettings {
  736. bool Inner = true;
  737. mutable TVector<TAstNode*> TargetColumns;
  738. bool AllowEmptyResSet = false;
  739. bool EmitPgStar = false;
  740. bool FillTargetColumns = false;
  741. bool UnknownsAllowed = false;
  742. const TView* Recursive = nullptr;
  743. };
  744. [[nodiscard]]
  745. TAstNode* ParseSelectStmt(
  746. const SelectStmt* value,
  747. const TSelectStmtSettings& selectSettings
  748. ) {
  749. if (Settings.Mode == NSQLTranslation::ESqlMode::LIMITED_VIEW) {
  750. if (HasSelectInLimitedView) {
  751. AddError("Expected exactly one SELECT in LIMITED_VIEW mode");
  752. return nullptr;
  753. }
  754. HasSelectInLimitedView = true;
  755. }
  756. bool isValuesClauseOfInsertStmt = selectSettings.FillTargetColumns;
  757. State.CTE.emplace_back();
  758. auto prevRecursiveView = State.CurrentRecursiveView;
  759. State.CurrentRecursiveView = selectSettings.Recursive;
  760. Y_DEFER {
  761. State.CTE.pop_back();
  762. State.CurrentRecursiveView = prevRecursiveView;
  763. };
  764. if (value->withClause) {
  765. if (!ParseWithClause(CAST_NODE(WithClause, value->withClause))) {
  766. return nullptr;
  767. }
  768. }
  769. TTraverseSelectStack traverseSelectStack;
  770. traverseSelectStack.push({ value, false });
  771. TVector<const SelectStmt*> setItems;
  772. TVector<TAstNode*> setOpsNodes;
  773. while (!traverseSelectStack.empty()) {
  774. auto& top = traverseSelectStack.top();
  775. if (top.first->op == SETOP_NONE) {
  776. // leaf
  777. setItems.push_back(top.first);
  778. setOpsNodes.push_back(QA("push"));
  779. traverseSelectStack.pop();
  780. } else {
  781. if (!top.first->larg || !top.first->rarg) {
  782. AddError("SelectStmt: expected larg and rarg");
  783. return nullptr;
  784. }
  785. if (!top.second) {
  786. traverseSelectStack.push({ top.first->rarg, false });
  787. traverseSelectStack.push({ top.first->larg, false });
  788. top.second = true;
  789. } else {
  790. TString op;
  791. switch (top.first->op) {
  792. case SETOP_UNION:
  793. op = "union"; break;
  794. case SETOP_INTERSECT:
  795. op = "intersect"; break;
  796. case SETOP_EXCEPT:
  797. op = "except"; break;
  798. default:
  799. AddError(TStringBuilder() << "SetOperation unsupported value: " << (int)top.first->op);
  800. return nullptr;
  801. }
  802. if (top.first->all) {
  803. op += "_all";
  804. }
  805. setOpsNodes.push_back(QA(op));
  806. traverseSelectStack.pop();
  807. }
  808. }
  809. }
  810. bool hasCombiningQueries = (1 < setItems.size());
  811. TAstNode* sort = nullptr;
  812. if (ListLength(value->sortClause) > 0) {
  813. TVector<TAstNode*> sortItems;
  814. for (int i = 0; i < ListLength(value->sortClause); ++i) {
  815. auto node = ListNodeNth(value->sortClause, i);
  816. if (NodeTag(node) != T_SortBy) {
  817. NodeNotImplemented(value, node);
  818. return nullptr;
  819. }
  820. auto sort = ParseSortBy(CAST_NODE_EXT(PG_SortBy, T_SortBy, node), !hasCombiningQueries, true);
  821. if (!sort) {
  822. return nullptr;
  823. }
  824. sortItems.push_back(sort);
  825. }
  826. sort = QVL(sortItems.data(), sortItems.size());
  827. }
  828. TVector<TAstNode*> setItemNodes;
  829. for (size_t id = 0; id < setItems.size(); ++id) {
  830. const auto& x = setItems[id];
  831. bool hasDistinctAll = false;
  832. TVector<TAstNode*> distinctOnItems;
  833. if (x->distinctClause) {
  834. if (linitial(x->distinctClause) == NULL) {
  835. hasDistinctAll = true;
  836. } else {
  837. for (int i = 0; i < ListLength(x->distinctClause); ++i) {
  838. auto node = ListNodeNth(x->distinctClause, i);
  839. TAstNode* expr;
  840. if (NodeTag(node) == T_A_Const && (NodeTag(CAST_NODE(A_Const, node)->val) == T_Integer)) {
  841. expr = MakeProjectionRef("DISTINCT ON", CAST_NODE(A_Const, node));
  842. } else {
  843. TExprSettings settings;
  844. settings.AllowColumns = true;
  845. settings.Scope = "DISTINCT ON";
  846. expr = ParseExpr(node, settings);
  847. }
  848. if (!expr) {
  849. return nullptr;
  850. }
  851. auto lambda = L(A("lambda"), QL(), expr);
  852. distinctOnItems.push_back(L(A("PgGroup"), L(A("Void")), lambda));
  853. }
  854. }
  855. }
  856. if (x->intoClause) {
  857. AddError("SelectStmt: not supported intoClause");
  858. return nullptr;
  859. }
  860. TVector<TAstNode*> fromList;
  861. TVector<TAstNode*> joinOps;
  862. for (int i = 0; i < ListLength(x->fromClause); ++i) {
  863. auto node = ListNodeNth(x->fromClause, i);
  864. if (NodeTag(node) != T_JoinExpr) {
  865. auto p = ParseFromClause(node);
  866. if (!p) {
  867. return nullptr;
  868. }
  869. AddFrom(*p, fromList);
  870. joinOps.push_back(QL(QL(QA("push"))));
  871. } else {
  872. TTraverseNodeStack traverseNodeStack;
  873. traverseNodeStack.push({ node, false });
  874. TVector<TAstNode*> oneJoinGroup;
  875. while (!traverseNodeStack.empty()) {
  876. auto& top = traverseNodeStack.top();
  877. if (NodeTag(top.first) != T_JoinExpr) {
  878. // leaf
  879. auto p = ParseFromClause(top.first);
  880. if (!p) {
  881. return nullptr;
  882. }
  883. AddFrom(*p, fromList);
  884. traverseNodeStack.pop();
  885. oneJoinGroup.push_back(QL(QA("push")));
  886. } else {
  887. auto join = CAST_NODE(JoinExpr, top.first);
  888. if (!join->larg || !join->rarg) {
  889. AddError("JoinExpr: expected larg and rarg");
  890. return nullptr;
  891. }
  892. if (join->alias) {
  893. AddError("JoinExpr: unsupported alias");
  894. return nullptr;
  895. }
  896. if (join->isNatural) {
  897. AddError("JoinExpr: unsupported isNatural");
  898. return nullptr;
  899. }
  900. if (!top.second) {
  901. traverseNodeStack.push({ join->rarg, false });
  902. traverseNodeStack.push({ join->larg, false });
  903. top.second = true;
  904. } else {
  905. TString op;
  906. switch (join->jointype) {
  907. case JOIN_INNER:
  908. op = join->quals ? "inner" : "cross"; break;
  909. case JOIN_LEFT:
  910. op = "left"; break;
  911. case JOIN_FULL:
  912. op = "full"; break;
  913. case JOIN_RIGHT:
  914. op = "right"; break;
  915. default:
  916. AddError(TStringBuilder() << "jointype unsupported value: " << (int)join->jointype);
  917. return nullptr;
  918. }
  919. if (ListLength(join->usingClause) > 0) {
  920. if (join->join_using_alias) {
  921. AddError(TStringBuilder() << "join USING: unsupported AS");
  922. return nullptr;
  923. }
  924. if (op == "cross") {
  925. op = "inner";
  926. }
  927. auto len = ListLength(join->usingClause);
  928. TVector<TAstNode*> fields(len);
  929. THashSet<TString> present;
  930. for (decltype(len) i = 0; i < len; ++i) {
  931. auto node = ListNodeNth(join->usingClause, i);
  932. if (NodeTag(node) != T_String) {
  933. AddError("JoinExpr: unexpected non-string constant");
  934. return nullptr;
  935. }
  936. if (present.contains(StrVal(node))) {
  937. AddError(TStringBuilder() << "USING clause: duplicated column " << StrVal(node));
  938. return nullptr;
  939. }
  940. fields[i] = QAX(StrVal(node));
  941. }
  942. oneJoinGroup.push_back(QL(QA(op), QA("using"), QVL(fields)));
  943. } else {
  944. if (op != "cross" && !join->quals) {
  945. AddError("join_expr: expected quals for non-cross join");
  946. return nullptr;
  947. }
  948. if (op == "cross") {
  949. oneJoinGroup.push_back(QL(QA(op)));
  950. } else {
  951. TExprSettings settings;
  952. settings.AllowColumns = true;
  953. settings.Scope = "JOIN ON";
  954. auto quals = ParseExpr(join->quals, settings);
  955. if (!quals) {
  956. return nullptr;
  957. }
  958. auto lambda = L(A("lambda"), QL(), quals);
  959. oneJoinGroup.push_back(QL(QA(op), L(A("PgWhere"), L(A("Void")), lambda)));
  960. }
  961. }
  962. traverseNodeStack.pop();
  963. }
  964. }
  965. }
  966. joinOps.push_back(QVL(oneJoinGroup.data(), oneJoinGroup.size()));
  967. }
  968. }
  969. TAstNode* whereFilter = nullptr;
  970. if (x->whereClause) {
  971. TExprSettings settings;
  972. settings.AllowColumns = true;
  973. settings.AllowSubLinks = true;
  974. settings.Scope = "WHERE";
  975. whereFilter = ParseExpr(x->whereClause, settings);
  976. if (!whereFilter) {
  977. return nullptr;
  978. }
  979. }
  980. TAstNode* groupBy = nullptr;
  981. if (ListLength(x->groupClause) > 0) {
  982. TVector<TAstNode*> groupByItems;
  983. for (int i = 0; i < ListLength(x->groupClause); ++i) {
  984. auto node = ListNodeNth(x->groupClause, i);
  985. TAstNode* expr;
  986. if (NodeTag(node) == T_A_Const && (NodeTag(CAST_NODE(A_Const, node)->val) == T_Integer)) {
  987. expr = MakeProjectionRef("GROUP BY", CAST_NODE(A_Const, node));
  988. } else {
  989. TExprSettings settings;
  990. settings.AllowColumns = true;
  991. settings.Scope = "GROUP BY";
  992. if (NodeTag(node) == T_GroupingSet) {
  993. expr = ParseGroupingSet(CAST_NODE(GroupingSet, node), settings);
  994. } else {
  995. expr = ParseExpr(node, settings);
  996. }
  997. }
  998. if (!expr) {
  999. return nullptr;
  1000. }
  1001. auto lambda = L(A("lambda"), QL(), expr);
  1002. groupByItems.push_back(L(A("PgGroup"), L(A("Void")), lambda));
  1003. }
  1004. groupBy = QVL(groupByItems.data(), groupByItems.size());
  1005. }
  1006. TAstNode* having = nullptr;
  1007. if (x->havingClause) {
  1008. TExprSettings settings;
  1009. settings.AllowColumns = true;
  1010. settings.Scope = "HAVING";
  1011. settings.AllowAggregates = true;
  1012. settings.AllowSubLinks = true;
  1013. having = ParseExpr(x->havingClause, settings);
  1014. if (!having) {
  1015. return nullptr;
  1016. }
  1017. }
  1018. TVector<TAstNode*> windowItems;
  1019. if (ListLength(x->windowClause) > 0) {
  1020. for (int i = 0; i < ListLength(x->windowClause); ++i) {
  1021. auto node = ListNodeNth(x->windowClause, i);
  1022. if (NodeTag(node) != T_WindowDef) {
  1023. NodeNotImplemented(x, node);
  1024. return nullptr;
  1025. }
  1026. auto win = ParseWindowDef(CAST_NODE(WindowDef, node));
  1027. if (!win) {
  1028. return nullptr;
  1029. }
  1030. windowItems.push_back(win);
  1031. }
  1032. }
  1033. if (ListLength(x->valuesLists) && ListLength(x->fromClause)) {
  1034. AddError("SelectStmt: values_lists isn't compatible to from_clause");
  1035. return nullptr;
  1036. }
  1037. if (!selectSettings.AllowEmptyResSet && (ListLength(x->valuesLists) == 0) && (ListLength(x->targetList) == 0)) {
  1038. AddError("SelectStmt: both values_list and target_list are not allowed to be empty");
  1039. return nullptr;
  1040. }
  1041. if (x != value && ListLength(x->sortClause) > 0) {
  1042. AddError("SelectStmt: sortClause should be used only on top");
  1043. return nullptr;
  1044. }
  1045. if (x != value) {
  1046. if (x->limitOption == LIMIT_OPTION_COUNT || x->limitOption == LIMIT_OPTION_DEFAULT) {
  1047. if (x->limitCount || x->limitOffset) {
  1048. AddError("SelectStmt: limit should be used only on top");
  1049. return nullptr;
  1050. }
  1051. } else {
  1052. AddError(TStringBuilder() << "LimitOption unsupported value: " << (int)x->limitOption);
  1053. return nullptr;
  1054. }
  1055. if (ListLength(x->lockingClause) > 0) {
  1056. AddWarning(TIssuesIds::PG_NO_LOCKING_SUPPORT, "SelectStmt: lockingClause is ignored");
  1057. }
  1058. }
  1059. TVector<TAstNode*> res;
  1060. ui32 i = 0;
  1061. if (selectSettings.EmitPgStar && id + 1 == setItems.size()) {
  1062. res.emplace_back(CreatePgStarResultItem());
  1063. i++;
  1064. }
  1065. bool maybeSelectWithJustSetConfig = !selectSettings.Inner && !sort && windowItems.empty() && !having && !groupBy && !whereFilter && !x->distinctClause && ListLength(x->targetList) == 1;
  1066. if (maybeSelectWithJustSetConfig) {
  1067. auto node = ListNodeNth(x->targetList, 0);
  1068. if (NodeTag(node) != T_ResTarget) {
  1069. NodeNotImplemented(x, node);
  1070. return nullptr;
  1071. }
  1072. auto r = CAST_NODE(ResTarget, node);
  1073. if (!r->val) {
  1074. AddError("SelectStmt: expected val");
  1075. return nullptr;
  1076. }
  1077. auto call = r->val;
  1078. if (NodeTag(call) == T_FuncCall) {
  1079. auto fn = CAST_NODE(FuncCall, call);
  1080. if (ListLength(fn->funcname) == 1) {
  1081. auto nameNode = ListNodeNth(fn->funcname, 0);
  1082. if (NodeTag(nameNode) != T_String) {
  1083. AddError("Function name must be string");
  1084. return nullptr;
  1085. }
  1086. auto name = to_lower(TString(StrVal(ListNodeNth(fn->funcname, 0))));
  1087. if (name == "set_config") {
  1088. return ParseSetConfig(fn);
  1089. }
  1090. }
  1091. }
  1092. }
  1093. for (int targetIndex = 0; targetIndex < ListLength(x->targetList); ++targetIndex) {
  1094. auto node = ListNodeNth(x->targetList, targetIndex);
  1095. if (NodeTag(node) != T_ResTarget) {
  1096. NodeNotImplemented(x, node);
  1097. return nullptr;
  1098. }
  1099. auto r = CAST_NODE(ResTarget, node);
  1100. if (!r->val) {
  1101. AddError("SelectStmt: expected val");
  1102. return nullptr;
  1103. }
  1104. TExprSettings settings;
  1105. settings.AllowColumns = true;
  1106. settings.AllowAggregates = true;
  1107. settings.AllowOver = true;
  1108. settings.AllowSubLinks = true;
  1109. settings.WindowItems = &windowItems;
  1110. settings.Scope = "SELECT";
  1111. auto x = ParseExpr(r->val, settings);
  1112. if (!x) {
  1113. return nullptr;
  1114. }
  1115. res.push_back(CreatePgResultItem(r, x, i));
  1116. }
  1117. TVector<TAstNode*> setItemOptions;
  1118. if (selectSettings.EmitPgStar) {
  1119. setItemOptions.push_back(QL(QA("emit_pg_star")));
  1120. }
  1121. if (!selectSettings.TargetColumns.empty()) {
  1122. setItemOptions.push_back(QL(QA("target_columns"), QVL(selectSettings.TargetColumns.data(), selectSettings.TargetColumns.size())));
  1123. }
  1124. if (selectSettings.FillTargetColumns) {
  1125. setItemOptions.push_back(QL(QA("fill_target_columns")));
  1126. }
  1127. if (ListLength(x->targetList) > 0) {
  1128. setItemOptions.push_back(QL(QA("result"), QVL(res.data(), res.size())));
  1129. } else {
  1130. auto valuesList = ParseValuesList(x->valuesLists, /*buildCommonType=*/!isValuesClauseOfInsertStmt);
  1131. if (!valuesList) {
  1132. return nullptr;
  1133. }
  1134. setItemOptions.push_back(valuesList);
  1135. }
  1136. if (!fromList.empty()) {
  1137. setItemOptions.push_back(QL(QA("from"), QVL(fromList.data(), fromList.size())));
  1138. setItemOptions.push_back(QL(QA("join_ops"), QVL(joinOps.data(), joinOps.size())));
  1139. }
  1140. if (whereFilter) {
  1141. auto lambda = L(A("lambda"), QL(), whereFilter);
  1142. setItemOptions.push_back(QL(QA("where"), L(A("PgWhere"), L(A("Void")), lambda)));
  1143. }
  1144. if (groupBy) {
  1145. setItemOptions.push_back(QL(QA("group_by"), groupBy));
  1146. }
  1147. if (windowItems.size()) {
  1148. auto window = QVL(windowItems.data(), windowItems.size());
  1149. setItemOptions.push_back(QL(QA("window"), window));
  1150. }
  1151. if (having) {
  1152. auto lambda = L(A("lambda"), QL(), having);
  1153. setItemOptions.push_back(QL(QA("having"), L(A("PgWhere"), L(A("Void")), lambda)));
  1154. }
  1155. if (hasDistinctAll) {
  1156. setItemOptions.push_back(QL(QA("distinct_all")));
  1157. } else if (!distinctOnItems.empty()) {
  1158. auto distinctOn = QVL(distinctOnItems.data(), distinctOnItems.size());
  1159. setItemOptions.push_back(QL(QA("distinct_on"), distinctOn));
  1160. }
  1161. if (!hasCombiningQueries && sort) {
  1162. setItemOptions.push_back(QL(QA("sort"), sort));
  1163. }
  1164. if (selectSettings.UnknownsAllowed || hasCombiningQueries) {
  1165. setItemOptions.push_back(QL(QA("unknowns_allowed")));
  1166. }
  1167. auto setItem = L(A("PgSetItem"), QVL(setItemOptions.data(), setItemOptions.size()));
  1168. setItemNodes.push_back(setItem);
  1169. }
  1170. if (value->intoClause) {
  1171. AddError("SelectStmt: not supported intoClause");
  1172. return nullptr;
  1173. }
  1174. if (ListLength(value->lockingClause) > 0) {
  1175. AddWarning(TIssuesIds::PG_NO_LOCKING_SUPPORT, "SelectStmt: lockingClause is ignored");
  1176. }
  1177. TAstNode* limit = nullptr;
  1178. TAstNode* offset = nullptr;
  1179. if (value->limitOption == LIMIT_OPTION_COUNT || value->limitOption == LIMIT_OPTION_DEFAULT) {
  1180. if (value->limitCount) {
  1181. TExprSettings settings;
  1182. settings.AllowColumns = false;
  1183. settings.AllowSubLinks = true;
  1184. settings.Scope = "LIMIT";
  1185. limit = ParseExpr(value->limitCount, settings);
  1186. if (!limit) {
  1187. return nullptr;
  1188. }
  1189. }
  1190. if (value->limitOffset) {
  1191. TExprSettings settings;
  1192. settings.AllowColumns = false;
  1193. settings.AllowSubLinks = true;
  1194. settings.Scope = "OFFSET";
  1195. offset = ParseExpr(value->limitOffset, settings);
  1196. if (!offset) {
  1197. return nullptr;
  1198. }
  1199. }
  1200. } else {
  1201. AddError(TStringBuilder() << "LimitOption unsupported value: " << (int)value->limitOption);
  1202. return nullptr;
  1203. }
  1204. TVector<TAstNode*> selectOptions;
  1205. selectOptions.push_back(QL(QA("set_items"), QVL(setItemNodes.data(), setItemNodes.size())));
  1206. selectOptions.push_back(QL(QA("set_ops"), QVL(setOpsNodes.data(), setOpsNodes.size())));
  1207. if (hasCombiningQueries && sort) {
  1208. selectOptions.push_back(QL(QA("sort"), sort));
  1209. }
  1210. if (limit) {
  1211. selectOptions.push_back(QL(QA("limit"), limit));
  1212. }
  1213. if (offset) {
  1214. selectOptions.push_back(QL(QA("offset"), offset));
  1215. }
  1216. auto output = L(A("PgSelect"), QVL(selectOptions.data(), selectOptions.size()));
  1217. if (selectSettings.Inner) {
  1218. return output;
  1219. }
  1220. if (Settings.Mode == NSQLTranslation::ESqlMode::LIMITED_VIEW) {
  1221. State.Statements.push_back(L(A("return"), L(A("Right!"), L(A("Cons!"), A("world"), output))));
  1222. return State.Statements.back();
  1223. }
  1224. auto resOptions = BuildResultOptions(!sort);
  1225. State.Statements.push_back(L(A("let"), A("output"), output));
  1226. State.Statements.push_back(L(A("let"), A("result_sink"), L(A("DataSink"), QA(TString(NYql::ResultProviderName)))));
  1227. State.Statements.push_back(L(A("let"), A("world"), L(A("Write!"),
  1228. A("world"), A("result_sink"), L(A("Key")), A("output"), resOptions)));
  1229. State.Statements.push_back(L(A("let"), A("world"), L(A("Commit!"),
  1230. A("world"), A("result_sink"))));
  1231. return State.Statements.back();
  1232. }
  1233. TAstNode* BuildResultOptions(bool unordered) {
  1234. TVector<TAstNode*> options;
  1235. options.push_back(QL(QA("type")));
  1236. options.push_back(QL(QA("autoref")));
  1237. if (unordered && UnorderedResult) {
  1238. options.push_back(QL(QA("unordered")));
  1239. }
  1240. return QVL(options.data(), options.size());
  1241. }
  1242. [[nodiscard]]
  1243. bool ParseWithClause(const WithClause* value) {
  1244. AT_LOCATION(value);
  1245. for (int i = 0; i < ListLength(value->ctes); ++i) {
  1246. auto object = ListNodeNth(value->ctes, i);
  1247. if (NodeTag(object) != T_CommonTableExpr) {
  1248. NodeNotImplemented(value, object);
  1249. return false;
  1250. }
  1251. if (!ParseCTE(CAST_NODE(CommonTableExpr, object), value->recursive)) {
  1252. return false;
  1253. }
  1254. }
  1255. return true;
  1256. }
  1257. [[nodiscard]]
  1258. bool ParseCTE(const CommonTableExpr* value, bool recursive) {
  1259. AT_LOCATION(value);
  1260. TView view;
  1261. view.Name = value->ctename;
  1262. for (int i = 0; i < ListLength(value->aliascolnames); ++i) {
  1263. auto node = ListNodeNth(value->aliascolnames, i);
  1264. if (NodeTag(node) != T_String) {
  1265. NodeNotImplemented(value, node);
  1266. return false;
  1267. }
  1268. view.ColNames.push_back(StrVal(node));
  1269. }
  1270. if (NodeTag(value->ctequery) != T_SelectStmt) {
  1271. AddError("Expected Select statement as CTE query");
  1272. return false;
  1273. }
  1274. view.Source = ParseSelectStmt(CAST_NODE(SelectStmt, value->ctequery), {
  1275. .Inner = true,
  1276. .Recursive = recursive ? &view : nullptr
  1277. });
  1278. if (!view.Source) {
  1279. return false;
  1280. }
  1281. auto& currentCTEs = State.CTE.back();
  1282. if (currentCTEs.find(view.Name) != currentCTEs.end()) {
  1283. AddError(TStringBuilder() << "CTE already exists: '" << view.Name << "'");
  1284. return false;
  1285. }
  1286. currentCTEs[view.Name] = view;
  1287. return true;
  1288. }
  1289. [[nodiscard]]
  1290. TAstNode* AsScalarContext(TAstNode* subquery) {
  1291. return L(A("SingleMember"), L(A("Head"), L(A("Take"), subquery, L(A("Uint64"), QA("1")))));
  1292. }
  1293. [[nodiscard]]
  1294. TAstNode* MakeLambda(TVector<TAstNode*> args, TAstNode* body) {
  1295. return L(A("lambda"), QVL(args), body);
  1296. }
  1297. [[nodiscard]]
  1298. TAstNode* CreatePgStarResultItem() {
  1299. TAstNode* starLambda = L(A("lambda"), QL(), L(A("PgStar")));
  1300. return L(A("PgResultItem"), QAX(""), L(A("Void")), starLambda);
  1301. }
  1302. [[nodiscard]]
  1303. TAstNode* CreatePgResultItem(const ResTarget* r, TAstNode* x, ui32& columnIndex) {
  1304. bool isStar = false;
  1305. if (NodeTag(r->val) == T_ColumnRef) {
  1306. auto ref = CAST_NODE(ColumnRef, r->val);
  1307. for (int fieldNo = 0; fieldNo < ListLength(ref->fields); ++fieldNo) {
  1308. if (NodeTag(ListNodeNth(ref->fields, fieldNo)) == T_A_Star) {
  1309. isStar = true;
  1310. break;
  1311. }
  1312. }
  1313. }
  1314. TString name;
  1315. if (!isStar) {
  1316. name = r->name;
  1317. if (name.empty()) {
  1318. if (NodeTag(r->val) == T_ColumnRef) {
  1319. auto ref = CAST_NODE(ColumnRef, r->val);
  1320. auto field = ListNodeNth(ref->fields, ListLength(ref->fields) - 1);
  1321. if (NodeTag(field) == T_String) {
  1322. name = StrVal(field);
  1323. }
  1324. } else if (NodeTag(r->val) == T_FuncCall) {
  1325. auto func = CAST_NODE(FuncCall, r->val);
  1326. if (!ExtractFuncName(func, name, nullptr)) {
  1327. return nullptr;
  1328. }
  1329. }
  1330. }
  1331. if (name.empty()) {
  1332. name = "column" + ToString(columnIndex++);
  1333. }
  1334. }
  1335. const auto lambda = L(A("lambda"), QL(), x);
  1336. const auto columnName = QAX(name);
  1337. return L(A("PgResultItem"), columnName, L(A("Void")), lambda);
  1338. }
  1339. [[nodiscard]]
  1340. std::optional<TVector<TAstNode*>> ParseReturningList(const List* returningList) {
  1341. TVector <TAstNode*> list;
  1342. if (ListLength(returningList) == 0) {
  1343. return {};
  1344. }
  1345. ui32 index = 0;
  1346. for (int i = 0; i < ListLength(returningList); i++) {
  1347. auto node = ListNodeNth(returningList, i);
  1348. if (NodeTag(node) != T_ResTarget) {
  1349. NodeNotImplemented(returningList, node);
  1350. return std::nullopt;
  1351. }
  1352. auto r = CAST_NODE(ResTarget, node);
  1353. if (!r->val) {
  1354. AddError("SelectStmt: expected value");
  1355. return std::nullopt;
  1356. }
  1357. if (NodeTag(r->val) != T_ColumnRef) {
  1358. NodeNotImplemented(r, r->val);
  1359. return std::nullopt;
  1360. }
  1361. TExprSettings settings;
  1362. settings.AllowColumns = true;
  1363. auto columnRef = ParseColumnRef(CAST_NODE(ColumnRef, r->val), settings);
  1364. if (!columnRef) {
  1365. return std::nullopt;
  1366. }
  1367. list.emplace_back(CreatePgResultItem(r, columnRef, index));
  1368. }
  1369. return list;
  1370. }
  1371. [[nodiscard]]
  1372. TAstNode* ParseInsertStmt(const InsertStmt* value) {
  1373. if (value->onConflictClause) {
  1374. AddError("InsertStmt: not supported onConflictClause");
  1375. return nullptr;
  1376. }
  1377. TVector <TAstNode*> returningList;
  1378. if (value->returningList) {
  1379. auto list = ParseReturningList(value->returningList);
  1380. if (list.has_value()) {
  1381. returningList = list.value();
  1382. } else {
  1383. return nullptr;
  1384. }
  1385. }
  1386. if (value->withClause) {
  1387. AddError("InsertStmt: not supported withClause");
  1388. return nullptr;
  1389. }
  1390. const auto [sink, key] = ParseWriteRangeVar(value->relation);
  1391. if (!sink || !key) {
  1392. return nullptr;
  1393. }
  1394. TVector <TAstNode*> targetColumns;
  1395. if (value->cols) {
  1396. for (int i = 0; i < ListLength(value->cols); i++) {
  1397. auto node = ListNodeNth(value->cols, i);
  1398. if (NodeTag(node) != T_ResTarget) {
  1399. NodeNotImplemented(value, node);
  1400. return nullptr;
  1401. }
  1402. auto r = CAST_NODE(ResTarget, node);
  1403. if (!r->name) {
  1404. AddError("SelectStmt: expected name");
  1405. return nullptr;
  1406. }
  1407. targetColumns.push_back(QA(r->name));
  1408. }
  1409. }
  1410. const auto select = (value->selectStmt)
  1411. ? ParseSelectStmt(
  1412. CAST_NODE(SelectStmt, value->selectStmt),
  1413. {
  1414. .Inner = true,
  1415. .TargetColumns = targetColumns,
  1416. .AllowEmptyResSet = false,
  1417. .EmitPgStar = false,
  1418. .FillTargetColumns = true,
  1419. .UnknownsAllowed = true
  1420. })
  1421. : L(A("Void"));
  1422. if (!select) {
  1423. return nullptr;
  1424. }
  1425. const auto writeOptions = BuildWriteOptions(value, std::move(returningList));
  1426. State.Statements.push_back(L(
  1427. A("let"),
  1428. A("world"),
  1429. L(
  1430. A("Write!"),
  1431. A("world"),
  1432. sink,
  1433. key,
  1434. select,
  1435. writeOptions
  1436. )
  1437. ));
  1438. return State.Statements.back();
  1439. }
  1440. [[nodiscard]]
  1441. TAstNode* ParseUpdateStmt(const UpdateStmt* value) {
  1442. const auto fromClause = value->fromClause ? value->fromClause : ListMake1(value->relation).get();
  1443. SelectStmt selectStmt {
  1444. .type = T_SelectStmt,
  1445. .targetList = value->targetList,
  1446. .fromClause = fromClause,
  1447. .whereClause = value->whereClause,
  1448. .withClause = value->withClause,
  1449. };
  1450. const auto select = ParseSelectStmt(
  1451. &selectStmt,
  1452. {
  1453. .Inner = true,
  1454. .AllowEmptyResSet = true,
  1455. .EmitPgStar = true,
  1456. .FillTargetColumns = false,
  1457. .UnknownsAllowed = true
  1458. }
  1459. );
  1460. if (!select) {
  1461. return nullptr;
  1462. }
  1463. const auto [sink, key] = ParseWriteRangeVar(value->relation);
  1464. if (!sink || !key) {
  1465. return nullptr;
  1466. }
  1467. TVector<TAstNode*> returningList;
  1468. if (value->returningList) {
  1469. auto list = ParseReturningList(value->returningList);
  1470. if (list.has_value()) {
  1471. returningList = list.value();
  1472. } else {
  1473. return nullptr;
  1474. }
  1475. }
  1476. TVector<TAstNode*> options;
  1477. options.push_back(QL(QA("pg_update"), A("update_select")));
  1478. options.push_back(QL(QA("mode"), QA("update")));
  1479. if (!returningList.empty()) {
  1480. options.push_back(QL(QA("returning"), QVL(returningList.data(), returningList.size())));
  1481. }
  1482. const auto writeUpdate = L(A("block"), QL(
  1483. L(A("let"), A("update_select"), select),
  1484. L(A("let"), A("sink"), sink),
  1485. L(A("let"), A("key"), key),
  1486. L(A("return"), L(
  1487. A("Write!"),
  1488. A("world"),
  1489. A("sink"),
  1490. A("key"),
  1491. L(A("Void")),
  1492. QVL(options.data(), options.size())))
  1493. ));
  1494. State.Statements.push_back(L(
  1495. A("let"),
  1496. A("world"),
  1497. writeUpdate
  1498. ));
  1499. return State.Statements.back();
  1500. }
  1501. [[nodiscard]]
  1502. TAstNode* ParseViewStmt(const ViewStmt* value) {
  1503. if (ListLength(value->options) > 0) {
  1504. AddError("Create view: not supported options");
  1505. return nullptr;
  1506. }
  1507. TView view;
  1508. if (StrLength(value->view->catalogname) > 0) {
  1509. AddError("catalogname is not supported");
  1510. return nullptr;
  1511. }
  1512. if (StrLength(value->view->schemaname) > 0) {
  1513. AddError("schemaname is not supported");
  1514. return nullptr;
  1515. }
  1516. if (StrLength(value->view->relname) == 0) {
  1517. AddError("relname should be specified");
  1518. return nullptr;
  1519. }
  1520. view.Name = value->view->relname;
  1521. if (value->view->alias) {
  1522. AddError("alias is not supported");
  1523. return nullptr;
  1524. }
  1525. if (ListLength(value->aliases) == 0) {
  1526. AddError("expected at least one target column");
  1527. return nullptr;
  1528. }
  1529. for (int i = 0; i < ListLength(value->aliases); ++i) {
  1530. auto node = ListNodeNth(value->aliases, i);
  1531. if (NodeTag(node) != T_String) {
  1532. NodeNotImplemented(value, node);
  1533. return nullptr;
  1534. }
  1535. view.ColNames.push_back(StrVal(node));
  1536. }
  1537. if (value->withCheckOption != NO_CHECK_OPTION) {
  1538. AddError("Create view: not supported options");
  1539. return nullptr;
  1540. }
  1541. view.Source = ParseSelectStmt(CAST_NODE(SelectStmt, value->query), { .Inner = true });
  1542. if (!view.Source) {
  1543. return nullptr;
  1544. }
  1545. auto it = State.Views.find(view.Name);
  1546. if (it != State.Views.end() && !value->replace) {
  1547. AddError(TStringBuilder() << "View already exists: '" << view.Name << "'");
  1548. return nullptr;
  1549. }
  1550. State.Views[view.Name] = view;
  1551. return State.Statements.back();
  1552. }
  1553. #pragma region CreateTable
  1554. private:
  1555. struct TColumnInfo {
  1556. TString Name;
  1557. TString Type;
  1558. bool Serial = false;
  1559. bool NotNull = false;
  1560. TAstNode* Default = nullptr;
  1561. };
  1562. struct TCreateTableCtx {
  1563. std::unordered_map<TString, TColumnInfo> ColumnsSet;
  1564. std::vector<TString> ColumnOrder;
  1565. std::vector<TAstNode*> PrimaryKey;
  1566. std::vector<std::vector<TAstNode*>> UniqConstr;
  1567. bool isTemporary;
  1568. bool ifNotExists;
  1569. };
  1570. bool CheckConstraintSupported(const Constraint* pk) {
  1571. bool isSupported = true;
  1572. if (pk->deferrable) {
  1573. AddError("DEFERRABLE constraints not supported");
  1574. isSupported = false;
  1575. }
  1576. if (pk->initdeferred) {
  1577. AddError("INITIALLY DEFERRED constraints not supported");
  1578. isSupported = false;
  1579. }
  1580. if (0 < ListLength(pk->including)) {
  1581. AddError("INCLUDING columns not supported");
  1582. isSupported = false;
  1583. }
  1584. if (0 < ListLength(pk->options)) {
  1585. AddError("WITH options not supported");
  1586. isSupported = false;
  1587. }
  1588. if (pk->indexname) {
  1589. AddError("INDEX name not supported");
  1590. isSupported = false;
  1591. }
  1592. if (pk->indexspace) {
  1593. AddError("USING INDEX TABLESPACE not supported");
  1594. isSupported = false;
  1595. }
  1596. return isSupported;
  1597. }
  1598. bool FillPrimaryKeyColumns(TCreateTableCtx& ctx, const Constraint* pk) {
  1599. if (!CheckConstraintSupported(pk))
  1600. return false;
  1601. for (int i = 0; i < ListLength(pk->keys); ++i) {
  1602. auto node = ListNodeNth(pk->keys, i);
  1603. auto nodeName = StrVal(node);
  1604. auto it = ctx.ColumnsSet.find(nodeName);
  1605. if (it == ctx.ColumnsSet.end()) {
  1606. AddError("PK column does not belong to table");
  1607. return false;
  1608. }
  1609. it->second.NotNull = true;
  1610. ctx.PrimaryKey.push_back(QA(StrVal(node)));
  1611. }
  1612. Y_ENSURE(0 < ctx.PrimaryKey.size());
  1613. return true;
  1614. }
  1615. bool FillUniqueConstraint(TCreateTableCtx& ctx, const Constraint* constr) {
  1616. if (!CheckConstraintSupported(constr))
  1617. return false;
  1618. const auto length = ListLength(constr->keys);
  1619. std::vector<TAstNode*> uniq;
  1620. uniq.reserve(length);
  1621. for (auto i = 0; i < length; ++i) {
  1622. auto node = ListNodeNth(constr->keys, i);
  1623. auto nodeName = StrVal(node);
  1624. if (!ctx.ColumnsSet.contains(nodeName)) {
  1625. AddError("UNIQUE column does not belong to table");
  1626. return false;
  1627. }
  1628. uniq.push_back(QA(nodeName));
  1629. }
  1630. Y_ENSURE(0 < uniq.size());
  1631. ctx.UniqConstr.emplace_back(std::move(uniq));
  1632. return true;
  1633. }
  1634. const TString& FindColumnTypeAlias(const TString& colType, bool& isTypeSerial) {
  1635. const static std::unordered_map<TString, TString> aliasMap {
  1636. {"smallserial", "int2"},
  1637. {"serial2", "int2"},
  1638. {"serial", "int4"},
  1639. {"serial4", "int4"},
  1640. {"bigserial", "int8"},
  1641. {"serial8", "int8"},
  1642. };
  1643. const auto aliasIt = aliasMap.find(to_lower(colType));
  1644. if (aliasIt == aliasMap.end()) {
  1645. isTypeSerial = false;
  1646. return colType;
  1647. }
  1648. isTypeSerial = true;
  1649. return aliasIt->second;
  1650. }
  1651. bool AddColumn(TCreateTableCtx& ctx, const ColumnDef* node) {
  1652. TColumnInfo cinfo{.Name = node->colname};
  1653. if (SystemColumns.contains(to_lower(cinfo.Name))) {
  1654. AddError(TStringBuilder() << "system column can't be used: " << node->colname);
  1655. return false;
  1656. }
  1657. if (node->constraints) {
  1658. for (int i = 0; i < ListLength(node->constraints); ++i) {
  1659. auto constraintNode =
  1660. CAST_NODE(Constraint, ListNodeNth(node->constraints, i));
  1661. switch (constraintNode->contype) {
  1662. case CONSTR_NOTNULL:
  1663. cinfo.NotNull = true;
  1664. break;
  1665. case CONSTR_PRIMARY: {
  1666. if (!ctx.PrimaryKey.empty()) {
  1667. AddError("Only a single PK is allowed per table");
  1668. return false;
  1669. }
  1670. cinfo.NotNull = true;
  1671. ctx.PrimaryKey.push_back(QA(node->colname));
  1672. } break;
  1673. case CONSTR_UNIQUE: {
  1674. ctx.UniqConstr.push_back({QA(node->colname)});
  1675. } break;
  1676. case CONSTR_DEFAULT: {
  1677. TExprSettings settings;
  1678. settings.AllowColumns = false;
  1679. settings.Scope = "DEFAULT";
  1680. settings.AutoParametrizeEnabled = false;
  1681. cinfo.Default = ParseExpr(constraintNode->raw_expr, settings);
  1682. if (!cinfo.Default) {
  1683. return false;
  1684. }
  1685. } break;
  1686. default:
  1687. AddError("column constraint not supported");
  1688. return false;
  1689. }
  1690. }
  1691. }
  1692. // for now we pass just the last part of the type name
  1693. auto colTypeVal = StrVal( ListNodeNth(node->typeName->names,
  1694. ListLength(node->typeName->names) - 1));
  1695. cinfo.Type = FindColumnTypeAlias(colTypeVal, cinfo.Serial);
  1696. auto [it, inserted] = ctx.ColumnsSet.emplace(node->colname, cinfo);
  1697. if (!inserted) {
  1698. AddError("duplicated column names found");
  1699. return false;
  1700. }
  1701. ctx.ColumnOrder.push_back(node->colname);
  1702. return true;
  1703. }
  1704. bool AddConstraint(TCreateTableCtx& ctx, const Constraint* node) {
  1705. switch (node->contype) {
  1706. case CONSTR_PRIMARY: {
  1707. if (!ctx.PrimaryKey.empty()) {
  1708. AddError("Only a single PK is allowed per table");
  1709. return false;
  1710. }
  1711. if (!FillPrimaryKeyColumns(ctx, node)) {
  1712. return false;
  1713. }
  1714. } break;
  1715. case CONSTR_UNIQUE: {
  1716. if (!FillUniqueConstraint(ctx, node)) {
  1717. return false;
  1718. }
  1719. } break;
  1720. // TODO: support table-level not null constraints like:
  1721. // CHECK (col1 is not null [OR col2 is not null])
  1722. default:
  1723. AddError("table constraint not supported");
  1724. return false;
  1725. }
  1726. return true;
  1727. }
  1728. TAstNode* BuildColumnsOptions(TCreateTableCtx& ctx) {
  1729. std::vector<TAstNode*> columns;
  1730. for(const auto& name: ctx.ColumnOrder) {
  1731. auto it = ctx.ColumnsSet.find(name);
  1732. Y_ENSURE(it != ctx.ColumnsSet.end());
  1733. const auto& cinfo = it->second;
  1734. std::vector<TAstNode*> constraints;
  1735. if (cinfo.Serial) {
  1736. constraints.push_back(QL(QA("serial")));
  1737. }
  1738. if (cinfo.NotNull) {
  1739. constraints.push_back(QL(QA("not_null")));
  1740. }
  1741. if (cinfo.Default) {
  1742. constraints.push_back(QL(QA("default"), cinfo.Default));
  1743. }
  1744. columns.push_back(QL(QA(cinfo.Name), L(A("PgType"), QA(cinfo.Type)), QL(QA("columnConstraints"), QVL(constraints.data(), constraints.size()))));
  1745. }
  1746. return QVL(columns.data(), columns.size());
  1747. }
  1748. TAstNode* BuildCreateTableOptions(TCreateTableCtx& ctx) {
  1749. std::vector<TAstNode*> options;
  1750. TString mode = (ctx.ifNotExists) ? "create_if_not_exists" : "create";
  1751. options.push_back(QL(QA("mode"), QA(mode)));
  1752. options.push_back(QL(QA("columns"), BuildColumnsOptions(ctx)));
  1753. if (!ctx.PrimaryKey.empty()) {
  1754. options.push_back(QL(QA("primarykey"), QVL(ctx.PrimaryKey.data(), ctx.PrimaryKey.size())));
  1755. }
  1756. for (auto& uniq : ctx.UniqConstr) {
  1757. auto columns = QVL(uniq.data(), uniq.size());
  1758. options.push_back(QL(QA("index"), QL(
  1759. QL(QA("indexName")),
  1760. QL(QA("indexType"), QA("syncGlobalUnique")),
  1761. QL(QA("dataColumns"), QL()),
  1762. QL(QA("indexColumns"), columns))));
  1763. }
  1764. if (ctx.isTemporary) {
  1765. options.push_back(QL(QA("temporary")));
  1766. }
  1767. return QVL(options.data(), options.size());
  1768. }
  1769. TAstNode* BuildWriteOptions(const InsertStmt* value, TVector<TAstNode*> returningList = {}) {
  1770. std::vector<TAstNode*> options;
  1771. const auto insertMode = (ProviderToInsertModeMap.contains(Provider))
  1772. ? ProviderToInsertModeMap.at(Provider)
  1773. : "append";
  1774. options.push_back(QL(QA("mode"), QA(insertMode)));
  1775. if (!returningList.empty()) {
  1776. options.push_back(QL(QA("returning"), QVL(returningList.data(), returningList.size())));
  1777. }
  1778. if (!value->selectStmt) {
  1779. options.push_back(QL(QA("default_values")));
  1780. }
  1781. return QVL(options.data(), options.size());
  1782. }
  1783. public:
  1784. [[nodiscard]]
  1785. TAstNode* ParseCreateStmt(const CreateStmt* value) {
  1786. // See also transformCreateStmt() in parse_utilcmd.c
  1787. if (0 < ListLength(value->inhRelations)) {
  1788. AddError("table inheritance not supported");
  1789. return nullptr;
  1790. }
  1791. if (value->partspec) {
  1792. AddError("PARTITION BY clause not supported");
  1793. return nullptr;
  1794. }
  1795. if (value->partbound) {
  1796. AddError("FOR VALUES clause not supported");
  1797. return nullptr;
  1798. }
  1799. // if we ever support typed tables, check transformOfType() in parse_utilcmd.c
  1800. if (value->ofTypename) {
  1801. AddError("typed tables not supported");
  1802. return nullptr;
  1803. }
  1804. if (0 < ListLength(value->options)) {
  1805. AddError("table options not supported");
  1806. return nullptr;
  1807. }
  1808. if (value->oncommit != ONCOMMIT_NOOP && value->oncommit != ONCOMMIT_PRESERVE_ROWS) {
  1809. AddError("ON COMMIT actions not supported");
  1810. return nullptr;
  1811. }
  1812. if (value->tablespacename) {
  1813. AddError("TABLESPACE not supported");
  1814. return nullptr;
  1815. }
  1816. if (value->accessMethod) {
  1817. AddError("USING not supported");
  1818. return nullptr;
  1819. }
  1820. TCreateTableCtx ctx {};
  1821. if (value->if_not_exists) {
  1822. ctx.ifNotExists = true;
  1823. }
  1824. const auto relPersistence = static_cast<NPg::ERelPersistence>(value->relation->relpersistence);
  1825. switch (relPersistence) {
  1826. case NPg::ERelPersistence::Temp:
  1827. ctx.isTemporary = true;
  1828. break;
  1829. case NPg::ERelPersistence::Unlogged:
  1830. AddError("UNLOGGED tables not supported");
  1831. return nullptr;
  1832. break;
  1833. case NPg::ERelPersistence::Permanent:
  1834. break;
  1835. }
  1836. auto [sink, key] = ParseWriteRangeVar(value->relation, true);
  1837. if (!sink || !key) {
  1838. return nullptr;
  1839. }
  1840. for (int i = 0; i < ListLength(value->tableElts); ++i) {
  1841. auto rawNode = ListNodeNth(value->tableElts, i);
  1842. switch (NodeTag(rawNode)) {
  1843. case T_ColumnDef:
  1844. if (!AddColumn(ctx, CAST_NODE(ColumnDef, rawNode))) {
  1845. return nullptr;
  1846. }
  1847. break;
  1848. case T_Constraint:
  1849. if (!AddConstraint(ctx, CAST_NODE(Constraint, rawNode))) {
  1850. return nullptr;
  1851. }
  1852. break;
  1853. default:
  1854. NodeNotImplemented(value, rawNode);
  1855. return nullptr;
  1856. }
  1857. }
  1858. State.Statements.push_back(
  1859. L(A("let"), A("world"),
  1860. L(A("Write!"), A("world"), sink, key, L(A("Void")),
  1861. BuildCreateTableOptions(ctx))));
  1862. return State.Statements.back();
  1863. }
  1864. #pragma endregion CreateTable
  1865. [[nodiscard]]
  1866. TAstNode* ParseDropStmt(const DropStmt* value) {
  1867. TVector<const List*> nameListNodes;
  1868. for (int i = 0; i < ListLength(value->objects); ++i) {
  1869. auto object = ListNodeNth(value->objects, i);
  1870. if (NodeTag(object) != T_List) {
  1871. NodeNotImplemented(value, object);
  1872. return nullptr;
  1873. }
  1874. auto nameListNode = CAST_NODE(List, object);
  1875. nameListNodes.push_back(nameListNode);
  1876. }
  1877. switch (value->removeType) {
  1878. case OBJECT_VIEW: {
  1879. return ParseDropViewStmt(value, nameListNodes);
  1880. }
  1881. case OBJECT_TABLE: {
  1882. return ParseDropTableStmt(value, nameListNodes);
  1883. }
  1884. case OBJECT_INDEX: {
  1885. return ParseDropIndexStmt(value, nameListNodes);
  1886. }
  1887. case OBJECT_SEQUENCE: {
  1888. return ParseDropSequenceStmt(value, nameListNodes);
  1889. }
  1890. default: {
  1891. AddError("Not supported object type for DROP");
  1892. return nullptr;
  1893. }
  1894. }
  1895. }
  1896. TAstNode* ParseDropViewStmt(const DropStmt* value, const TVector<const List*>& names) {
  1897. // behavior and concurrent don't matter here
  1898. for (const auto& nameList : names) {
  1899. if (ListLength(nameList) != 1) {
  1900. AddError("Expected view name");
  1901. }
  1902. const auto nameNode = ListNodeNth(nameList, 0);
  1903. if (NodeTag(nameNode) != T_String) {
  1904. NodeNotImplemented(value, nameNode);
  1905. return nullptr;
  1906. }
  1907. const auto name = StrVal(nameNode);
  1908. auto it = State.Views.find(name);
  1909. if (!value->missing_ok && it == State.Views.end()) {
  1910. AddError(TStringBuilder() << "View not found: '" << name << "'");
  1911. return nullptr;
  1912. }
  1913. if (it != State.Views.end()) {
  1914. State.Views.erase(it);
  1915. }
  1916. }
  1917. return State.Statements.back();
  1918. }
  1919. TAstNode* ParseDropTableStmt(const DropStmt* value, const TVector<const List*>& names) {
  1920. if (value->behavior == DROP_CASCADE) {
  1921. AddError("CASCADE is not implemented");
  1922. return nullptr;
  1923. }
  1924. for (const auto& nameList : names) {
  1925. const auto [clusterName, tableName] = getSchemaAndObjectName(nameList);
  1926. const auto [sink, key] = ParseQualifiedRelationName(
  1927. /* catalogName */ "",
  1928. clusterName,
  1929. tableName,
  1930. /* isSink */ true,
  1931. /* isScheme */ true
  1932. );
  1933. if (sink == nullptr) {
  1934. return nullptr;
  1935. }
  1936. TString mode = (value->missing_ok) ? "drop_if_exists" : "drop";
  1937. State.Statements.push_back(L(
  1938. A("let"),
  1939. A("world"),
  1940. L(
  1941. A("Write!"),
  1942. A("world"),
  1943. sink,
  1944. key,
  1945. L(A("Void")),
  1946. QL(
  1947. QL(QA("mode"), QA(mode))
  1948. )
  1949. )
  1950. ));
  1951. }
  1952. return State.Statements.back();
  1953. }
  1954. TAstNode* ParseDropIndexStmt(const DropStmt* value, const TVector<const List*>& names) {
  1955. if (value->behavior == DROP_CASCADE) {
  1956. AddError("CASCADE is not implemented");
  1957. return nullptr;
  1958. }
  1959. if (names.size() != 1) {
  1960. AddError("DROP INDEX requires exactly one index");
  1961. return nullptr;
  1962. }
  1963. for (const auto& nameList : names) {
  1964. const auto [clusterName, indexName] = getSchemaAndObjectName(nameList);
  1965. const auto [sink, key] = ParseQualifiedPgObjectName(
  1966. /* catalogName */ "",
  1967. clusterName,
  1968. indexName,
  1969. "pgIndex"
  1970. );
  1971. TString missingOk = (value->missing_ok) ? "true" : "false";
  1972. State.Statements.push_back(L(
  1973. A("let"),
  1974. A("world"),
  1975. L(
  1976. A("Write!"),
  1977. A("world"),
  1978. sink,
  1979. key,
  1980. L(A("Void")),
  1981. QL(
  1982. QL(QA("mode"), QA("dropIndex")),
  1983. QL(QA("ifExists"), QA(missingOk))
  1984. )
  1985. )
  1986. ));
  1987. }
  1988. return State.Statements.back();
  1989. }
  1990. TAstNode* ParseDropSequenceStmt(const DropStmt* value, const TVector<const List*>& names) {
  1991. if (value->behavior == DROP_CASCADE) {
  1992. AddError("CASCADE is not implemented");
  1993. return nullptr;
  1994. }
  1995. if (names.size() != 1) {
  1996. AddError("DROP SEQUENCE requires exactly one sequence");
  1997. return nullptr;
  1998. }
  1999. for (const auto& nameList : names) {
  2000. const auto [clusterName, indexName] = getSchemaAndObjectName(nameList);
  2001. const auto [sink, key] = ParseQualifiedPgObjectName(
  2002. /* catalogName */ "",
  2003. clusterName,
  2004. indexName,
  2005. "pgSequence"
  2006. );
  2007. TString mode = (value->missing_ok) ? "drop_if_exists" : "drop";
  2008. State.Statements.push_back(L(
  2009. A("let"),
  2010. A("world"),
  2011. L(
  2012. A("Write!"),
  2013. A("world"),
  2014. sink,
  2015. key,
  2016. L(A("Void")),
  2017. QL(
  2018. QL(QA("mode"), QA(mode))
  2019. )
  2020. )
  2021. ));
  2022. }
  2023. return State.Statements.back();
  2024. }
  2025. [[nodiscard]]
  2026. TAstNode* ParseVariableSetStmt(const VariableSetStmt* value, bool isSetConfig = false) {
  2027. if (value->kind != VAR_SET_VALUE) {
  2028. AddError(TStringBuilder() << "VariableSetStmt, not supported kind: " << (int)value->kind);
  2029. return nullptr;
  2030. }
  2031. auto name = to_lower(TString(value->name));
  2032. if (name == "search_path") {
  2033. THashSet<TString> visitedValues;
  2034. TVector<TString> values;
  2035. for (int i = 0; i < ListLength(value->args); ++i) {
  2036. auto val = ListNodeNth(value->args, i);
  2037. if (NodeTag(val) != T_A_Const || CAST_NODE(A_Const, val)->isnull || NodeTag(CAST_NODE(A_Const, val)->val) != T_String) {
  2038. AddError(TStringBuilder() << "VariableSetStmt, expected string literal for " << value->name << " option");
  2039. return nullptr;
  2040. }
  2041. TString rawStr = to_lower(TString(StrVal(CAST_NODE(A_Const, val)->val)));
  2042. if (visitedValues.emplace(rawStr).second) {
  2043. values.emplace_back(rawStr);
  2044. }
  2045. }
  2046. if (values.size() != 1) {
  2047. AddError(TStringBuilder() << "VariableSetStmt, expected 1 unique scheme, but got: " << values.size());
  2048. return nullptr;
  2049. }
  2050. auto rawStr = values[0];
  2051. if (rawStr != "pg_catalog" && rawStr != "public" && rawStr != "" && rawStr != "information_schema") {
  2052. AddError(TStringBuilder() << "VariableSetStmt, search path supports only 'information_schema', 'public', 'pg_catalog', '' but got: '" << rawStr << "'");
  2053. return nullptr;
  2054. }
  2055. if (Settings.GUCSettings) {
  2056. Settings.GUCSettings->Set(name, rawStr, value->is_local);
  2057. if (StmtParseInfo) {
  2058. (*StmtParseInfo)[StatementId].KeepInCache = false;
  2059. }
  2060. }
  2061. return State.Statements.back();
  2062. }
  2063. if (isSetConfig) {
  2064. if (name != "search_path") {
  2065. AddError(TStringBuilder() << "VariableSetStmt, set_config doesn't support that option:" << name);
  2066. return nullptr;
  2067. }
  2068. }
  2069. if (name == "useblocks" || name == "emitaggapply" || name == "unorderedresult") {
  2070. if (ListLength(value->args) != 1) {
  2071. AddError(TStringBuilder() << "VariableSetStmt, expected 1 arg, but got: " << ListLength(value->args));
  2072. return nullptr;
  2073. }
  2074. auto arg = ListNodeNth(value->args, 0);
  2075. if (NodeTag(arg) == T_A_Const && (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String)) {
  2076. TString rawStr = StrVal(CAST_NODE(A_Const, arg)->val);
  2077. if (name == "unorderedresult") {
  2078. UnorderedResult = (rawStr == "true");
  2079. } else {
  2080. auto configSource = L(A("DataSource"), QA(TString(NYql::ConfigProviderName)));
  2081. State.Statements.push_back(L(A("let"), A("world"), L(A(TString(NYql::ConfigureName)), A("world"), configSource,
  2082. QA(TString(rawStr == "true" ? "" : "Disable") + TString((name == "useblocks") ? "UseBlocks" : "PgEmitAggApply")))));
  2083. }
  2084. } else {
  2085. AddError(TStringBuilder() << "VariableSetStmt, expected string literal for " << value->name << " option");
  2086. return nullptr;
  2087. }
  2088. } else if (name == "dqengine" || name == "blockengine") {
  2089. if (ListLength(value->args) != 1) {
  2090. AddError(TStringBuilder() << "VariableSetStmt, expected 1 arg, but got: " << ListLength(value->args));
  2091. return nullptr;
  2092. }
  2093. auto arg = ListNodeNth(value->args, 0);
  2094. if (NodeTag(arg) == T_A_Const && (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String)) {
  2095. auto rawStr = StrVal(CAST_NODE(A_Const, arg)->val);
  2096. auto str = to_lower(TString(rawStr));
  2097. const bool isDqEngine = name == "dqengine";
  2098. auto& enable = isDqEngine ? DqEngineEnabled : BlockEngineEnabled;
  2099. auto& force = isDqEngine ? DqEngineForce : BlockEngineForce;
  2100. if (str == "auto") {
  2101. enable = true;
  2102. force = false;
  2103. } else if (str == "force") {
  2104. enable = true;
  2105. force = true;
  2106. } else if (str == "disable") {
  2107. enable = false;
  2108. force = false;
  2109. } else {
  2110. AddError(TStringBuilder() << "VariableSetStmt, not supported " << value->name << " option value: " << rawStr);
  2111. return nullptr;
  2112. }
  2113. } else {
  2114. AddError(TStringBuilder() << "VariableSetStmt, expected string literal for " << value->name << " option");
  2115. return nullptr;
  2116. }
  2117. } else if (name.StartsWith("dq.") || name.StartsWith("yt.") || name.StartsWith("s3.") || name.StartsWith("ydb.")) {
  2118. if (ListLength(value->args) != 1) {
  2119. AddError(TStringBuilder() << "VariableSetStmt, expected 1 arg, but got: " << ListLength(value->args));
  2120. return nullptr;
  2121. }
  2122. auto arg = ListNodeNth(value->args, 0);
  2123. if (NodeTag(arg) == T_A_Const && (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String)) {
  2124. auto dotPos = name.find('.');
  2125. auto provider = name.substr(0, dotPos);
  2126. TString providerName;
  2127. if (name.StartsWith("dq.")) {
  2128. providerName = NYql::DqProviderName;
  2129. } else if (name.StartsWith("yt.")) {
  2130. providerName = NYql::YtProviderName;
  2131. } else if (name.StartsWith("s3.")) {
  2132. providerName = NYql::S3ProviderName;
  2133. } else if (name.StartsWith("ydb.")) {
  2134. providerName = NYql::YdbProviderName;
  2135. } else {
  2136. Y_ASSERT(0);
  2137. }
  2138. auto providerSource = L(A("DataSource"), QA(providerName), QA("$all"));
  2139. auto rawStr = StrVal(CAST_NODE(A_Const, arg)->val);
  2140. State.Statements.push_back(L(A("let"), A("world"), L(A(TString(NYql::ConfigureName)), A("world"), providerSource,
  2141. QA("Attr"), QAX(name.substr(dotPos + 1)), QAX(rawStr))));
  2142. } else {
  2143. AddError(TStringBuilder() << "VariableSetStmt, expected string literal for " << value->name << " option");
  2144. return nullptr;
  2145. }
  2146. } else if (name == "tablepathprefix") {
  2147. if (ListLength(value->args) != 1) {
  2148. AddError(TStringBuilder() << "VariableSetStmt, expected 1 arg, but got: " << ListLength(value->args));
  2149. return nullptr;
  2150. }
  2151. auto arg = ListNodeNth(value->args, 0);
  2152. if (NodeTag(arg) == T_A_Const && (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String)) {
  2153. auto rawStr = StrVal(CAST_NODE(A_Const, arg)->val);
  2154. TablePathPrefix = rawStr;
  2155. } else {
  2156. AddError(TStringBuilder() << "VariableSetStmt, expected string literal for " << value->name << " option");
  2157. return nullptr;
  2158. }
  2159. } else if (name == "costbasedoptimizer") {
  2160. if (ListLength(value->args) != 1) {
  2161. AddError(TStringBuilder() << "VariableSetStmt, expected 1 arg, but got: " << ListLength(value->args));
  2162. return nullptr;
  2163. }
  2164. auto arg = ListNodeNth(value->args, 0);
  2165. if (NodeTag(arg) == T_A_Const && (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String)) {
  2166. auto rawStr = StrVal(CAST_NODE(A_Const, arg)->val);
  2167. auto str = to_lower(TString(rawStr));
  2168. if (!(str == "disable" || str == "pg" || str == "native")) {
  2169. AddError(TStringBuilder() << "VariableSetStmt, not supported CostBasedOptimizer option value: " << rawStr);
  2170. return nullptr;
  2171. }
  2172. State.CostBasedOptimizer = str;
  2173. } else {
  2174. AddError(TStringBuilder() << "VariableSetStmt, expected string literal for " << value->name << " option");
  2175. return nullptr;
  2176. }
  2177. } else if (name == "applicationname") {
  2178. if (ListLength(value->args) != 1) {
  2179. AddError(TStringBuilder() << "VariableSetStmt, expected 1 arg, but got: " << ListLength(value->args));
  2180. return nullptr;
  2181. }
  2182. auto arg = ListNodeNth(value->args, 0);
  2183. if (NodeTag(arg) == T_A_Const && (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String)) {
  2184. auto rawStr = StrVal(CAST_NODE(A_Const, arg)->val);
  2185. State.ApplicationName = rawStr;
  2186. } else {
  2187. AddError(TStringBuilder() << "VariableSetStmt, expected string literal for " << value->name << " option");
  2188. return nullptr;
  2189. }
  2190. } else {
  2191. AddError(TStringBuilder() << "VariableSetStmt, not supported name: " << value->name);
  2192. return nullptr;
  2193. }
  2194. return State.Statements.back();
  2195. }
  2196. [[nodiscard]]
  2197. TAstNode* ParseDeleteStmt(const DeleteStmt* value) {
  2198. if (value->usingClause) {
  2199. AddError("using is not supported");
  2200. return nullptr;
  2201. }
  2202. TVector <TAstNode*> returningList;
  2203. if (value->returningList) {
  2204. auto list = ParseReturningList(value->returningList);
  2205. if (list.has_value()) {
  2206. returningList = list.value();
  2207. } else {
  2208. return nullptr;
  2209. }
  2210. }
  2211. if (value->withClause) {
  2212. AddError("with is not supported");
  2213. return nullptr;
  2214. }
  2215. if (!value->relation) {
  2216. AddError("DeleteStmt: expected relation");
  2217. return nullptr;
  2218. }
  2219. TVector<TAstNode*> fromList;
  2220. auto p = ParseRangeVar(value->relation);
  2221. if (!p) {
  2222. return nullptr;
  2223. }
  2224. AddFrom(*p, fromList);
  2225. TAstNode* whereFilter = nullptr;
  2226. if (value->whereClause) {
  2227. TExprSettings settings;
  2228. settings.AllowColumns = true;
  2229. settings.AllowSubLinks = true;
  2230. settings.Scope = "WHERE";
  2231. whereFilter = ParseExpr(value->whereClause, settings);
  2232. if (!whereFilter) {
  2233. return nullptr;
  2234. }
  2235. }
  2236. TVector<TAstNode*> setItemOptions;
  2237. setItemOptions.push_back(QL(QA("result"), QVL(CreatePgStarResultItem())));
  2238. setItemOptions.push_back(QL(QA("from"), QVL(fromList.data(), fromList.size())));
  2239. setItemOptions.push_back(QL(QA("join_ops"), QVL(QL(QL(QA("push"))))));
  2240. NYql::TAstNode* lambda = nullptr;
  2241. if (whereFilter) {
  2242. lambda = L(A("lambda"), QL(), whereFilter);
  2243. setItemOptions.push_back(QL(QA("where"), L(A("PgWhere"), L(A("Void")), lambda)));
  2244. }
  2245. auto setItemNode = L(A("PgSetItem"), QVL(setItemOptions.data(), setItemOptions.size()));
  2246. TVector<TAstNode*> selectOptions;
  2247. selectOptions.push_back(QL(QA("set_items"), QVL(setItemNode)));
  2248. selectOptions.push_back(QL(QA("set_ops"), QVL(QA("push"))));
  2249. auto select = L(A("PgSelect"), QVL(selectOptions.data(), selectOptions.size()));
  2250. auto [sink, key] = ParseWriteRangeVar(value->relation);
  2251. if (!sink || !key) {
  2252. return nullptr;
  2253. }
  2254. std::vector<TAstNode*> options;
  2255. options.push_back(QL(QA("pg_delete"), select));
  2256. options.push_back(QL(QA("mode"), QA("delete")));
  2257. if (!returningList.empty()) {
  2258. options.push_back(QL(QA("returning"), QVL(returningList.data(), returningList.size())));
  2259. }
  2260. State.Statements.push_back(L(
  2261. A("let"),
  2262. A("world"),
  2263. L(
  2264. A("Write!"),
  2265. A("world"),
  2266. sink,
  2267. key,
  2268. L(A("Void")),
  2269. QVL(options.data(), options.size())
  2270. )
  2271. ));
  2272. return State.Statements.back();
  2273. }
  2274. TMaybe<TString> GetConfigVariable(const TString& varName) {
  2275. if (varName == "server_version") {
  2276. return GetPostgresServerVersionStr();
  2277. }
  2278. if (varName == "server_version_num") {
  2279. return GetPostgresServerVersionNum();
  2280. }
  2281. if (varName == "standard_conforming_strings"){
  2282. return "on";
  2283. }
  2284. if (varName == "search_path"){
  2285. auto searchPath = Settings.GUCSettings->Get("search_path");
  2286. return searchPath ? *searchPath : "public";
  2287. }
  2288. if (varName == "default_transaction_read_only"){
  2289. return "off"; // mediawiki
  2290. }
  2291. if (varName == "transaction_isolation"){
  2292. return "serializable";
  2293. }
  2294. return {};
  2295. }
  2296. TMaybe<std::vector<TAstNode*>> ParseIndexElements(List* list) {
  2297. const auto length = ListLength(list);
  2298. std::vector<TAstNode*> columns;
  2299. columns.reserve(length);
  2300. for (auto i = 0; i < length; ++i) {
  2301. auto node = ListNodeNth(list, i);
  2302. auto indexElem = IndexElement(node);
  2303. if (indexElem->expr || indexElem->indexcolname) {
  2304. AddError("index expression is not supported yet");
  2305. return {};
  2306. }
  2307. columns.push_back(QA(indexElem->name));
  2308. }
  2309. return columns;
  2310. }
  2311. [[nodiscard]]
  2312. TAstNode* ParseVariableShowStmt(const VariableShowStmt* value) {
  2313. const auto varName = to_lower(TString(value->name));
  2314. const auto varValue = GetConfigVariable(varName);
  2315. if (!varValue) {
  2316. AddError("unrecognized configuration parameter \"" + varName + "\"");
  2317. return nullptr;
  2318. }
  2319. const auto columnName = QAX(varName);
  2320. const auto varValueNode =
  2321. L(A("PgConst"), QAX(*varValue), L(A("PgType"), QA("text")));
  2322. const auto lambda = L(A("lambda"), QL(), varValueNode);
  2323. const auto res = QL(L(A("PgResultItem"), columnName, L(A("Void")), lambda));
  2324. const auto setItem = L(A("PgSetItem"), QL(QL(QA("result"), res)));
  2325. const auto setItems = QL(QA("set_items"), QL(setItem));
  2326. const auto setOps = QL(QA("set_ops"), QVL(QA("push")));
  2327. const auto selectOptions = QL(setItems, setOps);
  2328. const auto output = L(A("PgSelect"), selectOptions);
  2329. State.Statements.push_back(L(A("let"), A("output"), output));
  2330. State.Statements.push_back(L(A("let"), A("result_sink"), L(A("DataSink"), QA(TString(NYql::ResultProviderName)))));
  2331. const auto resOptions = BuildResultOptions(true);
  2332. State.Statements.push_back(L(A("let"), A("world"), L(A("Write!"),
  2333. A("world"), A("result_sink"), L(A("Key")), A("output"), resOptions)));
  2334. State.Statements.push_back(L(A("let"), A("world"), L(A("Commit!"),
  2335. A("world"), A("result_sink"))));
  2336. return State.Statements.back();
  2337. }
  2338. [[nodiscard]]
  2339. bool ParseTransactionStmt(const TransactionStmt* value) {
  2340. switch (value->kind) {
  2341. case TRANS_STMT_BEGIN:
  2342. case TRANS_STMT_START:
  2343. case TRANS_STMT_SAVEPOINT:
  2344. case TRANS_STMT_RELEASE:
  2345. case TRANS_STMT_ROLLBACK_TO:
  2346. return true;
  2347. case TRANS_STMT_COMMIT:
  2348. State.Statements.push_back(L(A("let"), A("world"), L(A("CommitAll!"),
  2349. A("world"))));
  2350. if (Settings.GUCSettings) {
  2351. Settings.GUCSettings->Commit();
  2352. }
  2353. return true;
  2354. case TRANS_STMT_ROLLBACK:
  2355. State.Statements.push_back(L(A("let"), A("world"), L(A("CommitAll!"),
  2356. A("world"), QL(QL(QA("mode"), QA("rollback"))))));
  2357. if (Settings.GUCSettings) {
  2358. Settings.GUCSettings->RollBack();
  2359. }
  2360. return true;
  2361. default:
  2362. AddError(TStringBuilder() << "TransactionStmt: kind is not supported: " << (int)value->kind);
  2363. return false;
  2364. }
  2365. }
  2366. [[nodiscard]]
  2367. TAstNode* ParseIndexStmt(const IndexStmt* value) {
  2368. if (value->unique) {
  2369. AddError("unique index creation is not supported yet");
  2370. return nullptr;
  2371. }
  2372. if (value->primary) {
  2373. AddError("primary key creation is not supported yet");
  2374. return nullptr;
  2375. }
  2376. if (value->isconstraint || value->deferrable || value->initdeferred) {
  2377. AddError("constraint modification is not supported yet");
  2378. return nullptr;
  2379. }
  2380. if (value->whereClause) {
  2381. AddError("partial index is not supported yet");
  2382. return nullptr;
  2383. }
  2384. if (value->options) {
  2385. AddError("storage parameters for index is not supported yet");
  2386. return nullptr;
  2387. }
  2388. auto columns = ParseIndexElements(value->indexParams);
  2389. if (!columns)
  2390. return nullptr;
  2391. auto coverColumns = ParseIndexElements(value->indexIncludingParams);
  2392. if (!coverColumns)
  2393. return nullptr;
  2394. const auto [sink, key] = ParseWriteRangeVar(value->relation, true);
  2395. if (!sink || !key) {
  2396. return nullptr;
  2397. }
  2398. std::vector<TAstNode*> flags;
  2399. flags.emplace_back(QA("pg"));
  2400. if (value->if_not_exists) {
  2401. flags.emplace_back(QA("ifNotExists"));
  2402. }
  2403. std::vector<TAstNode*> desc;
  2404. auto indexNameAtom = QA("indexName");
  2405. if (value->idxname) {
  2406. desc.emplace_back(QL(indexNameAtom, QA(value->idxname)));
  2407. } else {
  2408. desc.emplace_back(QL(indexNameAtom));
  2409. }
  2410. desc.emplace_back(QL(QA("indexType"), QA(value->unique ? "syncGlobalUnique" : "syncGlobal")));
  2411. desc.emplace_back(QL(QA("indexColumns"), QVL(columns->data(), columns->size())));
  2412. desc.emplace_back(QL(QA("dataColumns"), QVL(coverColumns->data(), coverColumns->size())));
  2413. desc.emplace_back(QL(QA("flags"), QVL(flags.data(), flags.size())));
  2414. State.Statements.push_back(L(
  2415. A("let"),
  2416. A("world"),
  2417. L(
  2418. A("Write!"),
  2419. A("world"),
  2420. sink,
  2421. key,
  2422. L(A("Void")),
  2423. QL(
  2424. QL(QA("mode"), QA("alter")),
  2425. QL(QA("actions"), QL(QL(QA("addIndex"), QVL(desc.data(), desc.size()))))
  2426. )
  2427. )
  2428. ));
  2429. return State.Statements.back();
  2430. }
  2431. [[nodiscard]]
  2432. TAstNode* ParseCreateSeqStmt(const CreateSeqStmt* value) {
  2433. std::vector<TAstNode*> options;
  2434. TString mode = (value->if_not_exists) ? "create_if_not_exists" : "create";
  2435. options.push_back(QL(QA("mode"), QA(mode)));
  2436. auto [sink, key] = ParseQualifiedPgObjectName(
  2437. value->sequence->catalogname,
  2438. value->sequence->schemaname,
  2439. value->sequence->relname,
  2440. "pgSequence"
  2441. );
  2442. if (!sink || !key) {
  2443. return nullptr;
  2444. }
  2445. const auto relPersistence = static_cast<NPg::ERelPersistence>(value->sequence->relpersistence);
  2446. switch (relPersistence) {
  2447. case NPg::ERelPersistence::Temp:
  2448. options.push_back(QL(QA("temporary")));
  2449. break;
  2450. case NPg::ERelPersistence::Unlogged:
  2451. AddError("UNLOGGED sequence not supported");
  2452. return nullptr;
  2453. break;
  2454. case NPg::ERelPersistence::Permanent:
  2455. break;
  2456. }
  2457. for (int i = 0; i < ListLength(value->options); ++i) {
  2458. auto rawNode = ListNodeNth(value->options, i);
  2459. switch (NodeTag(rawNode)) {
  2460. case T_DefElem: {
  2461. const auto* defElem = CAST_NODE(DefElem, rawNode);
  2462. TString nameElem = defElem->defname;
  2463. if (defElem->arg) {
  2464. switch (NodeTag(defElem->arg))
  2465. {
  2466. case T_Boolean:
  2467. options.emplace_back(QL(QAX(nameElem), QA(ToString(boolVal(defElem->arg)))));
  2468. break;
  2469. case T_Integer:
  2470. options.emplace_back(QL(QAX(nameElem), QA(ToString(intVal(defElem->arg)))));
  2471. break;
  2472. case T_Float:
  2473. options.emplace_back(QL(QAX(nameElem), QA(strVal(defElem->arg))));
  2474. break;
  2475. case T_TypeName: {
  2476. const auto* typeName = CAST_NODE_EXT(PG_TypeName, T_TypeName, defElem->arg);
  2477. if (ListLength(typeName->names) > 0) {
  2478. options.emplace_back(QL(QAX(nameElem),
  2479. QAX(StrVal(ListNodeNth(typeName->names, ListLength(typeName->names) - 1)))));
  2480. }
  2481. break;
  2482. }
  2483. default:
  2484. NodeNotImplemented(defElem->arg);
  2485. return nullptr;
  2486. }
  2487. }
  2488. break;
  2489. }
  2490. default:
  2491. NodeNotImplemented(rawNode);
  2492. return nullptr;
  2493. }
  2494. }
  2495. if (value->for_identity) {
  2496. options.push_back(QL(QA("for_identity")));
  2497. }
  2498. if (value->ownerId != InvalidOid) {
  2499. options.push_back(QL(QA("owner_id"), QA(ToString(value->ownerId))));
  2500. }
  2501. State.Statements.push_back(
  2502. L(A("let"), A("world"),
  2503. L(A("Write!"), A("world"), sink, key, L(A("Void")),
  2504. QVL(options.data(), options.size()))));
  2505. return State.Statements.back();
  2506. }
  2507. [[nodiscard]]
  2508. TAstNode* ParseAlterSeqStmt(const AlterSeqStmt* value) {
  2509. std::vector<TAstNode*> options;
  2510. TString mode = (value->missing_ok) ? "alter_if_exists" : "alter";
  2511. options.push_back(QL(QA("mode"), QA(mode)));
  2512. auto [sink, key] = ParseQualifiedPgObjectName(
  2513. value->sequence->catalogname,
  2514. value->sequence->schemaname,
  2515. value->sequence->relname,
  2516. "pgSequence"
  2517. );
  2518. if (!sink || !key) {
  2519. return nullptr;
  2520. }
  2521. for (int i = 0; i < ListLength(value->options); ++i) {
  2522. auto rawNode = ListNodeNth(value->options, i);
  2523. switch (NodeTag(rawNode)) {
  2524. case T_DefElem: {
  2525. const auto* defElem = CAST_NODE(DefElem, rawNode);
  2526. TString nameElem = defElem->defname;
  2527. if (defElem->arg) {
  2528. switch (NodeTag(defElem->arg))
  2529. {
  2530. case T_Boolean:
  2531. options.emplace_back(QL(QAX(nameElem), QA(ToString(boolVal(defElem->arg)))));
  2532. break;
  2533. case T_Integer:
  2534. options.emplace_back(QL(QAX(nameElem), QA(ToString(intVal(defElem->arg)))));
  2535. break;
  2536. case T_Float:
  2537. options.emplace_back(QL(QAX(nameElem), QA(strVal(defElem->arg))));
  2538. break;
  2539. case T_TypeName: {
  2540. const auto* typeName = CAST_NODE_EXT(PG_TypeName, T_TypeName, defElem->arg);
  2541. if (ListLength(typeName->names) > 0) {
  2542. options.emplace_back(QL(QAX(nameElem),
  2543. QAX(StrVal(ListNodeNth(typeName->names, ListLength(typeName->names) - 1)))));
  2544. }
  2545. break;
  2546. }
  2547. default:
  2548. NodeNotImplemented(defElem->arg);
  2549. return nullptr;
  2550. }
  2551. } else {
  2552. if (nameElem == "restart") {
  2553. options.emplace_back(QL(QAX(nameElem), QA(TString())));
  2554. }
  2555. }
  2556. break;
  2557. }
  2558. default:
  2559. NodeNotImplemented(rawNode);
  2560. return nullptr;
  2561. }
  2562. }
  2563. if (value->for_identity) {
  2564. options.push_back(QL(QA("for_identity")));
  2565. }
  2566. State.Statements.push_back(
  2567. L(A("let"), A("world"),
  2568. L(A("Write!"), A("world"), sink, key, L(A("Void")),
  2569. QVL(options.data(), options.size()))));
  2570. return State.Statements.back();
  2571. }
  2572. [[nodiscard]]
  2573. TAstNode* ParseAlterTableStmt(const AlterTableStmt* value) {
  2574. std::vector<TAstNode*> options;
  2575. TString mode = (value->missing_ok) ? "alter_if_exists" : "alter";
  2576. options.push_back(QL(QA("mode"), QA(mode)));
  2577. const auto [sink, key] = ParseWriteRangeVar(value->relation, true);
  2578. if (!sink || !key) {
  2579. return nullptr;
  2580. }
  2581. std::vector<TAstNode*> alterColumns;
  2582. for (int i = 0; i < ListLength(value->cmds); ++i) {
  2583. auto rawNode = ListNodeNth(value->cmds, i);
  2584. const auto* cmd = CAST_NODE(AlterTableCmd, rawNode);
  2585. switch (cmd->subtype) {
  2586. case AT_ColumnDefault: { /* ALTER COLUMN DEFAULT */
  2587. const auto* def = cmd->def;
  2588. const auto* colName = cmd->name;
  2589. if (def == nullptr) {
  2590. alterColumns.push_back(QL(QAX(colName), QL(QA("setDefault"), QL(QA("Null")))));
  2591. break;
  2592. }
  2593. switch (NodeTag(def)) {
  2594. case T_FuncCall: {
  2595. const auto* newDefault = CAST_NODE(FuncCall, def);
  2596. const auto* funcName = ListNodeNth(newDefault->funcname, 0);
  2597. if (NodeTag(funcName) != T_String) {
  2598. NodeNotImplemented(newDefault, funcName);
  2599. return nullptr;
  2600. }
  2601. auto strFuncName = StrVal(funcName);
  2602. if (strcmp(strFuncName, "nextval") != 0) {
  2603. NodeNotImplemented(newDefault, funcName);
  2604. return nullptr;
  2605. }
  2606. const auto* rawArg = ListNodeNth(newDefault->args, 0);
  2607. if (NodeTag(rawArg) != T_TypeCast && NodeTag(rawArg) != T_A_Const) {
  2608. AddError(TStringBuilder() << "Expected type cast node or a_const, but got something wrong: " << NodeTag(rawArg));
  2609. return nullptr;
  2610. }
  2611. const A_Const* localConst = nullptr;
  2612. if (NodeTag(rawArg) == T_TypeCast) {
  2613. auto localCast = CAST_NODE(TypeCast, rawArg)->arg;
  2614. if (NodeTag(localCast) != T_A_Const) {
  2615. AddError(TStringBuilder() << "Expected a_const in cast, but got something wrong: " << NodeTag(localCast));
  2616. return nullptr;
  2617. }
  2618. localConst = CAST_NODE(A_Const, localCast);
  2619. } else {
  2620. localConst = CAST_NODE(A_Const, rawArg);
  2621. }
  2622. if (NodeTag(localConst->val) != T_String) {
  2623. AddError(TStringBuilder() << "Expected string in const, but got something wrong: " << NodeTag(localConst->val));
  2624. return nullptr;
  2625. }
  2626. auto seqName = StrVal(localConst->val);
  2627. TVector<TString> seqNameList;
  2628. Split(seqName, ".", seqNameList);
  2629. if (seqNameList.size() != 2 && seqNameList.size() != 1) {
  2630. AddError(TStringBuilder() << "Expected list size is 1 or 2, but there are " << seqNameList.size());
  2631. return nullptr;
  2632. }
  2633. alterColumns.push_back(QL(QAX(colName), QL(QA("setDefault"), QL(QA("nextval"), QA(seqNameList.back())))));
  2634. break;
  2635. }
  2636. default:
  2637. NodeNotImplemented(def);
  2638. return nullptr;
  2639. }
  2640. break;
  2641. }
  2642. default:
  2643. NodeNotImplemented(rawNode);
  2644. return nullptr;
  2645. }
  2646. }
  2647. std::vector<TAstNode*> actions { QL(QA("alterColumns"), QVL(alterColumns.data(), alterColumns.size())) };
  2648. options.push_back(
  2649. QL(QA("actions"),
  2650. QVL(actions.data(), actions.size())
  2651. )
  2652. );
  2653. State.Statements.push_back(
  2654. L(A("let"), A("world"),
  2655. L(A("Write!"), A("world"), sink, key, L(A("Void")),
  2656. QVL(options.data(), options.size()))));
  2657. return State.Statements.back();
  2658. }
  2659. TMaybe<TFromDesc> ParseFromClause(const Node* node) {
  2660. switch (NodeTag(node)) {
  2661. case T_RangeVar:
  2662. return ParseRangeVar(CAST_NODE(RangeVar, node));
  2663. case T_RangeSubselect:
  2664. return ParseRangeSubselect(CAST_NODE(RangeSubselect, node));
  2665. case T_RangeFunction:
  2666. return ParseRangeFunction(CAST_NODE(RangeFunction, node));
  2667. default:
  2668. NodeNotImplementedImpl<SelectStmt>(node);
  2669. return {};
  2670. }
  2671. }
  2672. void AddFrom(const TFromDesc& p, TVector<TAstNode*>& fromList) {
  2673. auto aliasNode = QAX(p.Alias);
  2674. TVector<TAstNode*> colNamesNodes;
  2675. for (const auto& c : p.ColNames) {
  2676. colNamesNodes.push_back(QAX(c));
  2677. }
  2678. auto colNamesTuple = QVL(colNamesNodes.data(), colNamesNodes.size());
  2679. if (p.InjectRead) {
  2680. auto label = "read" + ToString(State.ReadIndex);
  2681. State.Statements.push_back(L(A("let"), A(label), p.Source));
  2682. State.Statements.push_back(L(A("let"), A("world"), L(A("Left!"), A(label))));
  2683. fromList.push_back(QL(L(A("Right!"), A(label)), aliasNode, colNamesTuple));
  2684. ++State.ReadIndex;
  2685. } else {
  2686. auto source = p.Source;
  2687. if (!source) {
  2688. source = L(A("PgSelf"));
  2689. }
  2690. fromList.push_back(QL(source, aliasNode, colNamesTuple));
  2691. }
  2692. }
  2693. bool ParseAlias(const Alias* alias, TString& res, TVector<TString>& colnames) {
  2694. for (int i = 0; i < ListLength(alias->colnames); ++i) {
  2695. auto node = ListNodeNth(alias->colnames, i);
  2696. if (NodeTag(node) != T_String) {
  2697. NodeNotImplemented(alias, node);
  2698. return false;
  2699. }
  2700. colnames.push_back(StrVal(node));
  2701. }
  2702. res = alias->aliasname;
  2703. return true;
  2704. }
  2705. TString ResolveCluster(const TStringBuf schemaname, TString name) {
  2706. if (NYql::NPg::GetStaticColumns().contains(NPg::TTableInfoKey{"pg_catalog", name})) {
  2707. return "pg_catalog";
  2708. }
  2709. if (schemaname == "public") {
  2710. return Settings.DefaultCluster;;
  2711. }
  2712. if (schemaname == "" && Settings.GUCSettings) {
  2713. auto search_path = Settings.GUCSettings->Get("search_path");
  2714. if (!search_path || *search_path == "public" || search_path->empty()) {
  2715. return Settings.DefaultCluster;
  2716. }
  2717. return TString(*search_path);
  2718. }
  2719. return TString(schemaname);
  2720. }
  2721. TAstNode* BuildClusterSinkOrSourceExpression(
  2722. bool isSink, const TStringBuf schemaname) {
  2723. TString usedCluster(schemaname);
  2724. auto p = Settings.ClusterMapping.FindPtr(usedCluster);
  2725. if (!p) {
  2726. usedCluster = to_lower(usedCluster);
  2727. p = Settings.ClusterMapping.FindPtr(usedCluster);
  2728. }
  2729. if (!p) {
  2730. AddError(TStringBuilder() << "Unknown cluster: " << schemaname);
  2731. return nullptr;
  2732. }
  2733. return L(isSink ? A("DataSink") : A("DataSource"), QAX(*p), QAX(usedCluster));
  2734. }
  2735. TAstNode* BuildTableKeyExpression(const TStringBuf relname,
  2736. const TStringBuf cluster, bool isScheme = false
  2737. ) {
  2738. auto lowerCluster = to_lower(TString(cluster));
  2739. bool noPrefix = (lowerCluster == "pg_catalog" || lowerCluster == "information_schema");
  2740. TString tableName = noPrefix ? to_lower(TString(relname)) : TablePathPrefix + relname;
  2741. return L(A("Key"), QL(QA(isScheme ? "tablescheme" : "table"),
  2742. L(A("String"), QAX(std::move(tableName)))));
  2743. }
  2744. TReadWriteKeyExprs ParseQualifiedRelationName(const TStringBuf catalogname,
  2745. const TStringBuf schemaname,
  2746. const TStringBuf relname,
  2747. bool isSink, bool isScheme) {
  2748. if (!catalogname.empty()) {
  2749. AddError("catalogname is not supported");
  2750. return {};
  2751. }
  2752. if (relname.empty()) {
  2753. AddError("relname should be specified");
  2754. return {};
  2755. }
  2756. const auto cluster = ResolveCluster(schemaname, TString(relname));
  2757. const auto sinkOrSource = BuildClusterSinkOrSourceExpression(isSink, cluster);
  2758. const auto key = BuildTableKeyExpression(relname, cluster, isScheme);
  2759. return {sinkOrSource, key};
  2760. }
  2761. TAstNode* BuildPgObjectExpression(const TStringBuf objectName, const TStringBuf objectType) {
  2762. bool noPrefix = (objectType == "pgIndex");
  2763. TString name = noPrefix ? TString(objectName) : TablePathPrefix + TString(objectName);
  2764. return L(A("Key"), QL(QA("pgObject"),
  2765. L(A("String"), QAX(std::move(name))),
  2766. L(A("String"), QA(objectType))
  2767. ));
  2768. }
  2769. TReadWriteKeyExprs ParseQualifiedPgObjectName(const TStringBuf catalogname,
  2770. const TStringBuf schemaname,
  2771. const TStringBuf objectName,
  2772. const TStringBuf pgObjectType) {
  2773. if (!catalogname.empty()) {
  2774. AddError("catalogname is not supported");
  2775. return {};
  2776. }
  2777. if (objectName.empty()) {
  2778. AddError("objectName should be specified");
  2779. return {};
  2780. }
  2781. const auto cluster = ResolveCluster(schemaname, TString(objectName));
  2782. const auto sinkOrSource = BuildClusterSinkOrSourceExpression(true, cluster);
  2783. const auto key = BuildPgObjectExpression(objectName, pgObjectType);
  2784. return {sinkOrSource, key};
  2785. }
  2786. TReadWriteKeyExprs ParseWriteRangeVar(const RangeVar *value,
  2787. bool isScheme = false) {
  2788. if (value->alias) {
  2789. AddError("alias is not supported");
  2790. return {};
  2791. }
  2792. return ParseQualifiedRelationName(value->catalogname, value->schemaname,
  2793. value->relname,
  2794. /* isSink */ true, isScheme);
  2795. }
  2796. TMaybe<TFromDesc> ParseRangeVar(const RangeVar* value) {
  2797. AT_LOCATION(value);
  2798. const TView* view = nullptr;
  2799. if (StrLength(value->schemaname) == 0) {
  2800. for (auto rit = State.CTE.rbegin(); rit != State.CTE.rend(); ++rit) {
  2801. auto cteIt = rit->find(value->relname);
  2802. if (cteIt != rit->end()) {
  2803. view = &cteIt->second;
  2804. break;
  2805. }
  2806. }
  2807. if (!view && State.CurrentRecursiveView && State.CurrentRecursiveView->Name == value->relname) {
  2808. view = State.CurrentRecursiveView;
  2809. }
  2810. if (!view) {
  2811. auto viewIt = State.Views.find(value->relname);
  2812. if (viewIt != State.Views.end()) {
  2813. view = &viewIt->second;
  2814. }
  2815. }
  2816. }
  2817. TString alias;
  2818. TVector<TString> colnames;
  2819. if (value->alias) {
  2820. if (!ParseAlias(value->alias, alias, colnames)) {
  2821. return {};
  2822. }
  2823. } else {
  2824. alias = value->relname;
  2825. }
  2826. if (view) {
  2827. return TFromDesc{view->Source, alias, colnames.empty() ? view->ColNames : colnames, false };
  2828. }
  2829. TString schemaname = value->schemaname;
  2830. if (!StrCompare(value->schemaname, "bindings")) {
  2831. bool isBinding = false;
  2832. switch (Settings.BindingsMode) {
  2833. case NSQLTranslation::EBindingsMode::DISABLED:
  2834. AddError("Please remove 'bindings.' from your query, the support for this syntax has ended");
  2835. return {};
  2836. case NSQLTranslation::EBindingsMode::ENABLED:
  2837. isBinding = true;
  2838. break;
  2839. case NSQLTranslation::EBindingsMode::DROP_WITH_WARNING:
  2840. AddWarning(TIssuesIds::YQL_DEPRECATED_BINDINGS, "Please remove 'bindings.' from your query, the support for this syntax will be dropped soon");
  2841. [[fallthrough]];
  2842. case NSQLTranslation::EBindingsMode::DROP:
  2843. schemaname = Settings.DefaultCluster;
  2844. break;
  2845. }
  2846. if (isBinding) {
  2847. auto s = BuildBindingSource(value);
  2848. if (!s) {
  2849. return {};
  2850. }
  2851. return TFromDesc{ s, alias, colnames, true };
  2852. }
  2853. }
  2854. const auto [source, key] = ParseQualifiedRelationName(
  2855. value->catalogname, schemaname, value->relname,
  2856. /* isSink */ false,
  2857. /* isScheme */ false);
  2858. if (source == nullptr || key == nullptr) {
  2859. return {};
  2860. }
  2861. const auto readExpr = this->SqlProcArgsCount ?
  2862. L(A("Cons!"),
  2863. A("world"),
  2864. L(
  2865. A("PgTableContent"),
  2866. QA("pg_catalog"),
  2867. QAX(value->relname),
  2868. L(A("Void")),
  2869. QL()
  2870. )
  2871. ) :
  2872. L(
  2873. A("Read!"),
  2874. A("world"),
  2875. source,
  2876. key,
  2877. L(A("Void")),
  2878. QL()
  2879. );
  2880. return TFromDesc {
  2881. readExpr,
  2882. alias,
  2883. colnames,
  2884. /* injectRead */ true,
  2885. };
  2886. }
  2887. TAstNode* BuildBindingSource(const RangeVar* value) {
  2888. if (StrLength(value->relname) == 0) {
  2889. AddError("relname should be specified");
  2890. }
  2891. const TString binding = value->relname;
  2892. NSQLTranslation::TBindingInfo bindingInfo;
  2893. if (const auto& error = ExtractBindingInfo(Settings, binding, bindingInfo)) {
  2894. AddError(error);
  2895. return nullptr;
  2896. }
  2897. TVector<TAstNode*> hints;
  2898. if (bindingInfo.Schema) {
  2899. auto schema = QA(bindingInfo.Schema);
  2900. auto type = L(A("SqlTypeFromYson"), schema);
  2901. auto columns = L(A("SqlColumnOrderFromYson"), schema);
  2902. hints.emplace_back(QL(QA("userschema"), type, columns));
  2903. }
  2904. for (auto& [key, value] : bindingInfo.Attributes) {
  2905. TVector<TAstNode*> hintValues;
  2906. hintValues.push_back(QA(NormalizeName(key)));
  2907. for (auto& v : value) {
  2908. hintValues.push_back(QA(v));
  2909. }
  2910. hints.emplace_back(QVL(hintValues.data(), hintValues.size()));
  2911. }
  2912. auto source = L(A("DataSource"), QAX(bindingInfo.ClusterType), QAX(bindingInfo.Cluster));
  2913. return L(
  2914. A("Read!"),
  2915. A("world"),
  2916. source,
  2917. L(
  2918. A("MrTableConcat"),
  2919. L(
  2920. A("Key"),
  2921. QL(
  2922. QA("table"),
  2923. L(
  2924. A("String"),
  2925. QAX(bindingInfo.Path)
  2926. )
  2927. )
  2928. )
  2929. ),
  2930. L(A("Void")),
  2931. QVL(hints.data(), hints.size())
  2932. );
  2933. }
  2934. TMaybe<TFromDesc> ParseRangeFunction(const RangeFunction* value) {
  2935. if (value->lateral) {
  2936. AddError("RangeFunction: unsupported lateral");
  2937. return {};
  2938. }
  2939. if (value->ordinality) {
  2940. AddError("RangeFunction: unsupported ordinality");
  2941. return {};
  2942. }
  2943. if (value->is_rowsfrom) {
  2944. AddError("RangeFunction: unsupported is_rowsfrom");
  2945. return {};
  2946. }
  2947. if (ListLength(value->coldeflist) > 0) {
  2948. AddError("RangeFunction: unsupported coldeflist");
  2949. return {};
  2950. }
  2951. if (ListLength(value->functions) != 1) {
  2952. AddError("RangeFunction: only one function is supported");
  2953. return {};
  2954. }
  2955. TString alias;
  2956. TVector<TString> colnames;
  2957. if (value->alias) {
  2958. if (!ParseAlias(value->alias, alias, colnames)) {
  2959. return {};
  2960. }
  2961. }
  2962. auto funcNode = ListNodeNth(value->functions, 0);
  2963. if (NodeTag(funcNode) != T_List) {
  2964. AddError("RangeFunction: expected pair");
  2965. return {};
  2966. }
  2967. auto lst = CAST_NODE(List, funcNode);
  2968. if (ListLength(lst) != 2) {
  2969. AddError("RangeFunction: expected pair");
  2970. return {};
  2971. }
  2972. TExprSettings settings;
  2973. settings.AllowColumns = false;
  2974. settings.AllowReturnSet = true;
  2975. settings.Scope = "RANGE FUNCTION";
  2976. auto node = ListNodeNth(lst, 0);
  2977. if (NodeTag(node) != T_FuncCall) {
  2978. AddError("RangeFunction: extected FuncCall");
  2979. return {};
  2980. }
  2981. bool injectRead = false;
  2982. auto func = ParseFuncCall(CAST_NODE(FuncCall, node), settings, true, injectRead);
  2983. if (!func) {
  2984. return {};
  2985. }
  2986. return TFromDesc{ func, alias, colnames, injectRead };
  2987. }
  2988. TMaybe<TFromDesc> ParseRangeSubselect(const RangeSubselect* value) {
  2989. if (value->lateral) {
  2990. AddError("RangeSubselect: unsupported lateral");
  2991. return {};
  2992. }
  2993. if (!value->alias) {
  2994. AddError("RangeSubselect: expected alias");
  2995. return {};
  2996. }
  2997. TString alias;
  2998. TVector<TString> colnames;
  2999. if (!ParseAlias(value->alias, alias, colnames)) {
  3000. return {};
  3001. }
  3002. if (!value->subquery) {
  3003. AddError("RangeSubselect: expected subquery");
  3004. return {};
  3005. }
  3006. if (NodeTag(value->subquery) != T_SelectStmt) {
  3007. NodeNotImplemented(value, value->subquery);
  3008. return {};
  3009. }
  3010. return TFromDesc{ ParseSelectStmt(CAST_NODE(SelectStmt, value->subquery), { .Inner = true }), alias, colnames, false };
  3011. }
  3012. TAstNode* ParseNullTestExpr(const NullTest* value, const TExprSettings& settings) {
  3013. AT_LOCATION(value);
  3014. if (value->argisrow) {
  3015. AddError("NullTest: unsupported argisrow");
  3016. return nullptr;
  3017. }
  3018. auto arg = ParseExpr(Expr2Node(value->arg), settings);
  3019. if (!arg) {
  3020. return nullptr;
  3021. }
  3022. auto result = L(A("Exists"), arg);
  3023. if (value->nulltesttype == IS_NULL) {
  3024. result = L(A("Not"), result);
  3025. }
  3026. return L(A("ToPg"), result);
  3027. }
  3028. struct TCaseBranch {
  3029. TAstNode* Pred;
  3030. TAstNode* Value;
  3031. };
  3032. TCaseBranch ReduceCaseBranches(std::vector<TCaseBranch>::const_iterator begin, std::vector<TCaseBranch>::const_iterator end) {
  3033. Y_ENSURE(begin < end);
  3034. const size_t branchCount = end - begin;
  3035. if (branchCount == 1) {
  3036. return *begin;
  3037. }
  3038. auto mid = begin + branchCount / 2;
  3039. auto left = ReduceCaseBranches(begin, mid);
  3040. auto right = ReduceCaseBranches(mid, end);
  3041. TVector<TAstNode*> preds;
  3042. preds.reserve(branchCount + 1);
  3043. preds.push_back(A("Or"));
  3044. for (auto it = begin; it != end; ++it) {
  3045. preds.push_back(it->Pred);
  3046. }
  3047. TCaseBranch result;
  3048. result.Pred = VL(&preds[0], preds.size());
  3049. result.Value = L(A("If"), left.Pred, left.Value, right.Value);
  3050. return result;
  3051. }
  3052. TAstNode* ParseCaseExpr(const CaseExpr* value, const TExprSettings& settings) {
  3053. AT_LOCATION(value);
  3054. TAstNode* testExpr = nullptr;
  3055. if (value->arg) {
  3056. testExpr = ParseExpr(Expr2Node(value->arg), settings);
  3057. if (!testExpr) {
  3058. return nullptr;
  3059. }
  3060. }
  3061. std::vector<TCaseBranch> branches;
  3062. for (int i = 0; i < ListLength(value->args); ++i) {
  3063. auto node = ListNodeNth(value->args, i);
  3064. auto whenNode = CAST_NODE(CaseWhen, node);
  3065. auto whenExpr = ParseExpr(Expr2Node(whenNode->expr), settings);
  3066. if (!whenExpr) {
  3067. return nullptr;
  3068. }
  3069. if (testExpr) {
  3070. whenExpr = L(A("PgOp"), QA("="), testExpr, whenExpr);
  3071. }
  3072. whenExpr = L(A("Coalesce"),
  3073. L(A("FromPg"), whenExpr),
  3074. L(A("Bool"), QA("false"))
  3075. );
  3076. auto whenResult = ParseExpr(Expr2Node(whenNode->result), settings);
  3077. if (!whenResult) {
  3078. return nullptr;
  3079. }
  3080. branches.emplace_back(TCaseBranch{ .Pred = whenExpr,.Value = whenResult });
  3081. }
  3082. TAstNode* defaultResult = nullptr;
  3083. if (value->defresult) {
  3084. defaultResult = ParseExpr(Expr2Node(value->defresult), settings);
  3085. if (!defaultResult) {
  3086. return nullptr;
  3087. }
  3088. } else {
  3089. defaultResult = L(A("Null"));
  3090. }
  3091. auto final = ReduceCaseBranches(branches.begin(), branches.end());
  3092. return L(A("If"), final.Pred, final.Value, defaultResult);
  3093. }
  3094. TAstNode* ParseParamRefExpr(const ParamRef* value) {
  3095. if (SqlProcArgsCount && (value->number < 1 || (ui32)value->number > *SqlProcArgsCount)) {
  3096. AddError(TStringBuilder() << "Unexpected parameter number: " << value->number);
  3097. return nullptr;
  3098. }
  3099. const auto varName = PREPARED_PARAM_PREFIX + ToString(value->number);
  3100. if (!State.ParamNameToPgTypeName.contains(varName)) {
  3101. State.ParamNameToPgTypeName[varName] = DEFAULT_PARAM_TYPE;
  3102. }
  3103. return A(varName);
  3104. }
  3105. TAstNode* ParseReturnStmt(const ReturnStmt* value) {
  3106. TExprSettings settings;
  3107. settings.AllowColumns = false;
  3108. settings.Scope = "RETURN";
  3109. auto expr = ParseExpr(value->returnval, settings);
  3110. if (!expr) {
  3111. return nullptr;
  3112. }
  3113. State.Statements.push_back(L(A("return"), expr));
  3114. return State.Statements.back();
  3115. }
  3116. TAstNode* ParseSQLValueFunction(const SQLValueFunction* value) {
  3117. AT_LOCATION(value);
  3118. switch (value->op) {
  3119. case SVFOP_CURRENT_DATE:
  3120. return L(A("PgCast"),
  3121. L(A("PgCall"), QA("now"), QL()),
  3122. L(A("PgType"), QA("date"))
  3123. );
  3124. case SVFOP_CURRENT_TIME:
  3125. return L(A("PgCast"),
  3126. L(A("PgCall"), QA("now"), QL()),
  3127. L(A("PgType"), QA("timetz"))
  3128. );
  3129. case SVFOP_CURRENT_TIME_N:
  3130. return L(A("PgCast"),
  3131. L(A("PgCall"), QA("now"), QL()),
  3132. L(A("PgType"), QA("timetz")),
  3133. L(A("PgConst"), QA(ToString(value->typmod)), L(A("PgType"), QA("int4")))
  3134. );
  3135. case SVFOP_CURRENT_TIMESTAMP:
  3136. return L(A("PgCall"), QA("now"), QL());
  3137. case SVFOP_CURRENT_TIMESTAMP_N:
  3138. return L(A("PgCast"),
  3139. L(A("PgCall"), QA("now"), QL()),
  3140. L(A("PgType"), QA("timestamptz")),
  3141. L(A("PgConst"), QA(ToString(value->typmod)), L(A("PgType"), QA("int4")))
  3142. );
  3143. case SVFOP_CURRENT_USER:
  3144. case SVFOP_CURRENT_ROLE:
  3145. case SVFOP_USER: {
  3146. auto user = Settings.GUCSettings->Get("ydb_user");
  3147. return L(A("PgConst"), user ? QAX(TString(*user)) : QA("postgres"), L(A("PgType"), QA("name")));
  3148. }
  3149. case SVFOP_CURRENT_CATALOG: {
  3150. std::optional<TString> database;
  3151. if (Settings.GUCSettings) {
  3152. database = Settings.GUCSettings->Get("ydb_database");
  3153. }
  3154. return L(A("PgConst"), QA(database ? *database : "postgres"), L(A("PgType"), QA("name")));
  3155. }
  3156. case SVFOP_CURRENT_SCHEMA:
  3157. return GetCurrentSchema();
  3158. default:
  3159. AddError(TStringBuilder() << "Usupported SQLValueFunction: " << (int)value->op);
  3160. return nullptr;
  3161. }
  3162. }
  3163. TAstNode* GetCurrentSchema() {
  3164. std::optional<TString> searchPath;
  3165. if (Settings.GUCSettings) {
  3166. searchPath = Settings.GUCSettings->Get("search_path");
  3167. }
  3168. return L(A("PgConst"), QA(searchPath ? *searchPath : "public"), L(A("PgType"), QA("name")));
  3169. }
  3170. TAstNode* ParseBooleanTest(const BooleanTest* value, const TExprSettings& settings) {
  3171. AT_LOCATION(value);
  3172. auto arg = ParseExpr(Expr2Node(value->arg), settings);
  3173. if (!arg) {
  3174. return nullptr;
  3175. }
  3176. TString op;
  3177. bool isNot = false;
  3178. switch (value->booltesttype) {
  3179. case IS_TRUE: {
  3180. op = "PgIsTrue";
  3181. break;
  3182. }
  3183. case IS_NOT_TRUE: {
  3184. op = "PgIsTrue";
  3185. isNot = true;
  3186. break;
  3187. }
  3188. case IS_FALSE: {
  3189. op = "PgIsFalse";
  3190. break;
  3191. }
  3192. case IS_NOT_FALSE: {
  3193. op = "PgIsFalse";
  3194. isNot = true;
  3195. break;
  3196. }
  3197. case IS_UNKNOWN: {
  3198. op = "PgIsUnknown";
  3199. break;
  3200. }
  3201. case IS_NOT_UNKNOWN: {
  3202. op = "PgIsUnknown";
  3203. isNot = true;
  3204. break;
  3205. }
  3206. default: {
  3207. TStringBuilder b;
  3208. b << "Unsupported booltesttype " << static_cast<int>(value->booltesttype);
  3209. AddError(b);
  3210. return nullptr;
  3211. }
  3212. }
  3213. auto result = L(A(op), arg);
  3214. if (isNot) {
  3215. result = L(A("PgNot"), result);
  3216. }
  3217. return result;
  3218. }
  3219. TAstNode* ParseExpr(const Node* node, const TExprSettings& settings) {
  3220. switch (NodeTag(node)) {
  3221. case T_A_Const: {
  3222. return ParseAConst(CAST_NODE(A_Const, node), settings);
  3223. }
  3224. case T_A_Expr: {
  3225. return ParseAExpr(CAST_NODE(A_Expr, node), settings);
  3226. }
  3227. case T_CaseExpr: {
  3228. return ParseCaseExpr(CAST_NODE(CaseExpr, node), settings);
  3229. }
  3230. case T_ColumnRef: {
  3231. return ParseColumnRef(CAST_NODE(ColumnRef, node), settings);
  3232. }
  3233. case T_TypeCast: {
  3234. return ParseTypeCast(CAST_NODE(TypeCast, node), settings);
  3235. }
  3236. case T_BoolExpr: {
  3237. return ParseBoolExpr(CAST_NODE(BoolExpr, node), settings);
  3238. }
  3239. case T_NullTest: {
  3240. return ParseNullTestExpr(CAST_NODE(NullTest, node), settings);
  3241. }
  3242. case T_FuncCall: {
  3243. bool injectRead;
  3244. return ParseFuncCall(CAST_NODE(FuncCall, node), settings, false, injectRead);
  3245. }
  3246. case T_A_ArrayExpr: {
  3247. return ParseAArrayExpr(CAST_NODE(A_ArrayExpr, node), settings);
  3248. }
  3249. case T_SubLink: {
  3250. return ParseSubLinkExpr(CAST_NODE(SubLink, node), settings);
  3251. }
  3252. case T_CoalesceExpr: {
  3253. return ParseCoalesceExpr(CAST_NODE(CoalesceExpr, node), settings);
  3254. }
  3255. case T_GroupingFunc: {
  3256. return ParseGroupingFunc(CAST_NODE(GroupingFunc, node));
  3257. }
  3258. case T_ParamRef: {
  3259. return ParseParamRefExpr(CAST_NODE(ParamRef, node));
  3260. }
  3261. case T_SQLValueFunction: {
  3262. return ParseSQLValueFunction(CAST_NODE(SQLValueFunction, node));
  3263. }
  3264. case T_BooleanTest: {
  3265. return ParseBooleanTest(CAST_NODE(BooleanTest, node), settings);
  3266. }
  3267. default:
  3268. NodeNotImplemented(node);
  3269. return nullptr;
  3270. }
  3271. }
  3272. TAstNode* AutoParametrizeConst(TPgConst&& valueNType, TAstNode* pgType) {
  3273. const auto& paramName = AddSimpleAutoParam(std::move(valueNType));
  3274. State.Statements.push_back(L(A("declare"), A(paramName), pgType));
  3275. YQL_CLOG(INFO, Default) << "Autoparametrized " << paramName << " at " << State.Positions.back();
  3276. return A(paramName);
  3277. }
  3278. TAstNode* ParseAConst(const A_Const* value, const TExprSettings& settings) {
  3279. AT_LOCATION(value);
  3280. const auto& val = value->val;
  3281. auto valueNType = GetValueNType(value);
  3282. if (!valueNType) {
  3283. return nullptr;
  3284. }
  3285. TAstNode* pgTypeNode = !value->isnull
  3286. ? L(A("PgType"), QA(TPgConst::ToString(valueNType->type)))
  3287. : L(A("PgType"), QA("unknown"));
  3288. if (Settings.AutoParametrizeEnabled && settings.AutoParametrizeEnabled) {
  3289. return AutoParametrizeConst(std::move(valueNType.GetRef()), pgTypeNode);
  3290. }
  3291. if (value->isnull) {
  3292. return L(A("PgCast"), L(A("Null")), pgTypeNode);
  3293. }
  3294. switch (NodeTag(val)) {
  3295. case T_Integer:
  3296. case T_Float: {
  3297. return L(A("PgConst"), QA(valueNType->value.GetRef()), pgTypeNode);
  3298. }
  3299. case T_Boolean:
  3300. case T_String:
  3301. case T_BitString: {
  3302. return L(A("PgConst"), QAX(valueNType->value.GetRef()), pgTypeNode);
  3303. }
  3304. default: {
  3305. NodeNotImplemented((const Node*)value);
  3306. return nullptr;
  3307. }
  3308. }
  3309. }
  3310. TAstNode* ParseAArrayExpr(const A_ArrayExpr* value, const TExprSettings& settings) {
  3311. AT_LOCATION(value);
  3312. TVector<TAstNode*> args;
  3313. args.push_back(A("PgArray"));
  3314. for (int i = 0; i < ListLength(value->elements); ++i) {
  3315. auto elem = ParseExpr(ListNodeNth(value->elements, i), settings);
  3316. if (!elem) {
  3317. return nullptr;
  3318. }
  3319. args.push_back(elem);
  3320. }
  3321. return VL(args.data(), args.size());
  3322. }
  3323. TAstNode* ParseCoalesceExpr(const CoalesceExpr* value, const TExprSettings& settings) {
  3324. AT_LOCATION(value);
  3325. TVector<TAstNode*> args;
  3326. args.push_back(A("Coalesce"));
  3327. for (int i = 0; i < ListLength(value->args); ++i) {
  3328. auto elem = ParseExpr(ListNodeNth(value->args, i), settings);
  3329. if (!elem) {
  3330. return nullptr;
  3331. }
  3332. args.push_back(elem);
  3333. }
  3334. return VL(args.data(), args.size());
  3335. }
  3336. TAstNode* ParseGroupingFunc(const GroupingFunc* value) {
  3337. AT_LOCATION(value);
  3338. TVector<TAstNode*> args;
  3339. args.push_back(A("PgGrouping"));
  3340. TExprSettings settings;
  3341. settings.Scope = "GROUPING";
  3342. settings.AllowColumns = true;
  3343. for (int i = 0; i < ListLength(value->args); ++i) {
  3344. auto elem = ParseExpr(ListNodeNth(value->args, i), settings);
  3345. if (!elem) {
  3346. return nullptr;
  3347. }
  3348. args.push_back(elem);
  3349. }
  3350. return VL(args.data(), args.size());
  3351. }
  3352. TAstNode* ParseGroupingSet(const GroupingSet* value, const TExprSettings& settings) {
  3353. AT_LOCATION(value);
  3354. TString mode;
  3355. switch (value->kind) {
  3356. case GROUPING_SET_ROLLUP:
  3357. mode = "rollup";
  3358. break;
  3359. case GROUPING_SET_CUBE:
  3360. mode = "cube";
  3361. break;
  3362. case GROUPING_SET_SETS:
  3363. mode = "sets";
  3364. break;
  3365. default:
  3366. AddError(TStringBuilder() << "Unexpected grouping set kind: " << (int)value->kind);
  3367. return nullptr;
  3368. }
  3369. auto innerSettings = settings;
  3370. innerSettings.Scope = to_title(mode);
  3371. TVector<TAstNode*> args;
  3372. args.push_back(A("PgGroupingSet"));
  3373. args.push_back(QA(mode));
  3374. if (value->kind == GROUPING_SET_SETS) {
  3375. // tuple for each set
  3376. for (int i = 0; i < ListLength(value->content); ++i) {
  3377. auto child = ListNodeNth(value->content, i);
  3378. if (NodeTag(child) == T_GroupingSet) {
  3379. auto kind = CAST_NODE(GroupingSet, child)->kind;
  3380. if (kind != GROUPING_SET_EMPTY) {
  3381. AddError(TStringBuilder() << "Unexpected inner grouping set kind: " << (int)kind);
  3382. return nullptr;
  3383. }
  3384. args.push_back(QL());
  3385. continue;
  3386. }
  3387. if (NodeTag(child) == T_RowExpr) {
  3388. auto row = CAST_NODE(RowExpr, child);
  3389. TVector<TAstNode*> tupleItems;
  3390. for (int j = 0; j < ListLength(row->args); ++j) {
  3391. auto elem = ParseExpr(ListNodeNth(row->args, j), innerSettings);
  3392. if (!elem) {
  3393. return nullptr;
  3394. }
  3395. tupleItems.push_back(elem);
  3396. }
  3397. args.push_back(QVL(tupleItems.data(), tupleItems.size()));
  3398. continue;
  3399. }
  3400. auto elem = ParseExpr(ListNodeNth(value->content, i), innerSettings);
  3401. if (!elem) {
  3402. return nullptr;
  3403. }
  3404. args.push_back(QL(elem));
  3405. }
  3406. } else {
  3407. // one tuple
  3408. TVector<TAstNode*> tupleItems;
  3409. for (int i = 0; i < ListLength(value->content); ++i) {
  3410. auto elem = ParseExpr(ListNodeNth(value->content, i), innerSettings);
  3411. if (!elem) {
  3412. return nullptr;
  3413. }
  3414. tupleItems.push_back(elem);
  3415. }
  3416. args.push_back(QVL(tupleItems.data(), tupleItems.size()));
  3417. }
  3418. return VL(args.data(), args.size());
  3419. }
  3420. TAstNode* ParseSubLinkExpr(const SubLink* value, const TExprSettings& settings) {
  3421. AT_LOCATION(value);
  3422. if (!settings.AllowSubLinks) {
  3423. AddError(TStringBuilder() << "SubLinks are not allowed in: " << settings.Scope);
  3424. return nullptr;
  3425. }
  3426. TString linkType;
  3427. TString operName;
  3428. switch (value->subLinkType) {
  3429. case EXISTS_SUBLINK:
  3430. linkType = "exists";
  3431. break;
  3432. case ALL_SUBLINK:
  3433. linkType = "all";
  3434. operName = "=";
  3435. break;
  3436. case ANY_SUBLINK:
  3437. linkType = "any";
  3438. operName = "=";
  3439. break;
  3440. case EXPR_SUBLINK:
  3441. linkType = "expr";
  3442. break;
  3443. case ARRAY_SUBLINK:
  3444. linkType = "array";
  3445. break;
  3446. default:
  3447. AddError(TStringBuilder() << "SublinkExpr: unsupported link type: " << (int)value->subLinkType);
  3448. return nullptr;
  3449. }
  3450. if (ListLength(value->operName) > 1) {
  3451. AddError("SubLink: unsuppoted opername");
  3452. return nullptr;
  3453. } else if (ListLength(value->operName) == 1) {
  3454. auto nameNode = ListNodeNth(value->operName, 0);
  3455. if (NodeTag(nameNode) != T_String) {
  3456. NodeNotImplemented(value, nameNode);
  3457. return nullptr;
  3458. }
  3459. operName = StrVal(nameNode);
  3460. }
  3461. TAstNode* rowTest;
  3462. if (value->testexpr) {
  3463. TExprSettings localSettings = settings;
  3464. localSettings.Scope = "SUBLINK TEST";
  3465. auto test = ParseExpr(value->testexpr, localSettings);
  3466. if (!test) {
  3467. return nullptr;
  3468. }
  3469. rowTest = L(A("lambda"), QL(A("value")), L(A("PgOp"), QAX(operName), test, A("value")));
  3470. } else {
  3471. rowTest = L(A("Void"));
  3472. }
  3473. auto select = ParseSelectStmt(CAST_NODE(SelectStmt, value->subselect), {.Inner = true});
  3474. if (!select) {
  3475. return nullptr;
  3476. }
  3477. return L(A("PgSubLink"), QA(linkType), L(A("Void")), L(A("Void")), rowTest, L(A("lambda"), QL(), select));
  3478. }
  3479. TAstNode* ParseTableRangeFunction(const TString& name, const TString& schema, List* args) {
  3480. auto source = BuildClusterSinkOrSourceExpression(false, schema);
  3481. if (!source) {
  3482. return nullptr;
  3483. }
  3484. TVector<TString> argStrs;
  3485. for (int i = 0; i < ListLength(args); ++i) {
  3486. auto arg = ListNodeNth(args, i);
  3487. if (NodeTag(arg) == T_A_Const && (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String)) {
  3488. TString rawStr = StrVal(CAST_NODE(A_Const, arg)->val);
  3489. argStrs.push_back(rawStr);
  3490. } else {
  3491. AddError("Expected String argument for table function");
  3492. return nullptr;
  3493. }
  3494. }
  3495. if (argStrs.empty()) {
  3496. AddError("Expected at least one argument for table function");
  3497. return nullptr;
  3498. }
  3499. TAstNode* key;
  3500. auto lowerName = to_lower(name);
  3501. auto options = QL();
  3502. if (lowerName == "concat") {
  3503. TVector<TAstNode*> concatArgs;
  3504. concatArgs.push_back(A("MrTableConcat"));
  3505. for (const auto& s : argStrs) {
  3506. concatArgs.push_back(L(A("Key"), QL(QA("table"),L(A("String"), QAX(s)))));
  3507. }
  3508. key = VL(concatArgs);
  3509. } else if (lowerName == "concat_view") {
  3510. if (argStrs.size() % 2 != 0) {
  3511. AddError("Expected sequence of pairs of table and view for concat_view");
  3512. return nullptr;
  3513. }
  3514. TVector<TAstNode*> concatArgs;
  3515. concatArgs.push_back(A("MrTableConcat"));
  3516. for (ui32 i = 0; i < argStrs.size(); i += 2) {
  3517. concatArgs.push_back(L(A("Key"),
  3518. QL(QA("table"),L(A("String"), QAX(argStrs[i]))),
  3519. QL(QA("view"),L(A("String"), QAX(argStrs[i + 1])))));
  3520. }
  3521. key = VL(concatArgs);
  3522. } else if (lowerName == "range") {
  3523. if (argStrs.size() > 5) {
  3524. AddError("Too many arguments");
  3525. return nullptr;
  3526. }
  3527. options = QL(QL(QA("ignorenonexisting")));
  3528. TAstNode* expr;
  3529. if (argStrs.size() == 1) {
  3530. expr = L(A("Bool"),QA("true"));
  3531. } else if (argStrs.size() == 2) {
  3532. expr = L(A(">="),A("item"),L(A("String"),QAX(argStrs[1])));
  3533. } else {
  3534. expr = L(A("And"),
  3535. L(A(">="),A("item"),L(A("String"),QAX(argStrs[1]))),
  3536. L(A("<="),A("item"),L(A("String"),QAX(argStrs[2])))
  3537. );
  3538. }
  3539. auto lambda = L(A("lambda"), QL(A("item")), expr);
  3540. auto range = L(A("MrTableRange"), QAX(argStrs[0]), lambda, QAX(argStrs.size() < 4 ? "" : argStrs[3]));
  3541. if (argStrs.size() < 5) {
  3542. key = L(A("Key"), QL(QA("table"),range));
  3543. } else {
  3544. key = L(A("Key"), QL(QA("table"),range), QL(QA("view"),L(A("String"), QAX(argStrs[4]))));
  3545. }
  3546. } else if (lowerName == "regexp" || lowerName == "like") {
  3547. if (argStrs.size() < 2 || argStrs.size() > 4) {
  3548. AddError("Expected from 2 to 4 arguments");
  3549. return nullptr;
  3550. }
  3551. options = QL(QL(QA("ignorenonexisting")));
  3552. TAstNode* expr;
  3553. if (lowerName == "regexp") {
  3554. expr = L(A("Apply"),L(A("Udf"),QA("Re2.Grep"),
  3555. QL(L(A("String"),QAX(argStrs[1])),L(A("Null")))),
  3556. A("item"));
  3557. } else {
  3558. expr = L(A("Apply"),L(A("Udf"),QA("Re2.Match"),
  3559. QL(L(A("Apply"),
  3560. L(A("Udf"), QA("Re2.PatternFromLike")),
  3561. L(A("String"),QAX(argStrs[1]))),L(A("Null")))),
  3562. A("item"));
  3563. }
  3564. auto lambda = L(A("lambda"), QL(A("item")), expr);
  3565. auto range = L(A("MrTableRange"), QAX(argStrs[0]), lambda, QAX(argStrs.size() < 3 ? "" : argStrs[2]));
  3566. if (argStrs.size() < 4) {
  3567. key = L(A("Key"), QL(QA("table"),range));
  3568. } else {
  3569. key = L(A("Key"), QL(QA("table"),range), QL(QA("view"),L(A("String"), QAX(argStrs[3]))));
  3570. }
  3571. } else {
  3572. AddError(TStringBuilder() << "Unknown table function: " << name);
  3573. return nullptr;
  3574. }
  3575. return L(
  3576. A("Read!"),
  3577. A("world"),
  3578. source,
  3579. key,
  3580. L(A("Void")),
  3581. options
  3582. );
  3583. }
  3584. TAstNode* ParseFuncCall(const FuncCall* value, const TExprSettings& settings, bool rangeFunction, bool& injectRead) {
  3585. AT_LOCATION(value);
  3586. if (ListLength(value->agg_order) > 0) {
  3587. AddError("FuncCall: unsupported agg_order");
  3588. return nullptr;
  3589. }
  3590. if (value->agg_filter) {
  3591. AddError("FuncCall: unsupported agg_filter");
  3592. return nullptr;
  3593. }
  3594. if (value->agg_within_group) {
  3595. AddError("FuncCall: unsupported agg_within_group");
  3596. return nullptr;
  3597. }
  3598. if (value->func_variadic) {
  3599. AddError("FuncCall: unsupported func_variadic");
  3600. return nullptr;
  3601. }
  3602. TAstNode* window = nullptr;
  3603. if (value->over) {
  3604. if (!settings.AllowOver) {
  3605. AddError(TStringBuilder() << "Over is not allowed in: " << settings.Scope);
  3606. return nullptr;
  3607. }
  3608. if (StrLength(value->over->name)) {
  3609. window = QAX(value->over->name);
  3610. } else {
  3611. auto index = settings.WindowItems->size();
  3612. auto def = ParseWindowDef(value->over);
  3613. if (!def) {
  3614. return nullptr;
  3615. }
  3616. window = L(A("PgAnonWindow"), QA(ToString(index)));
  3617. settings.WindowItems->push_back(def);
  3618. }
  3619. }
  3620. TString name;
  3621. TString schema;
  3622. if (!ExtractFuncName(value, name, rangeFunction ? &schema : nullptr)) {
  3623. return nullptr;
  3624. }
  3625. if (rangeFunction && !schema.empty() && schema != "pg_catalog") {
  3626. injectRead = true;
  3627. return ParseTableRangeFunction(name, schema, value->args);
  3628. }
  3629. if (name == "shobj_description" || name == "obj_description") {
  3630. AddWarning(TIssuesIds::PG_COMPAT, name + " function forced to NULL");
  3631. return L(A("Null"));
  3632. }
  3633. if (name == "current_schema") {
  3634. return GetCurrentSchema();
  3635. }
  3636. // for zabbix https://github.com/ydb-platform/ydb/issues/2904
  3637. if (name == "pg_try_advisory_lock" || name == "pg_try_advisory_lock_shared" || name == "pg_advisory_unlock" || name == "pg_try_advisory_xact_lock" || name == "pg_try_advisory_xact_lock_shared"){
  3638. AddWarning(TIssuesIds::PG_COMPAT, name + " function forced to return OK without waiting and without really lock/unlock");
  3639. return L(A("PgConst"), QA("true"), L(A("PgType"), QA("bool")));
  3640. }
  3641. if (name == "pg_advisory_lock" || name == "pg_advisory_lock_shared" || name == "pg_advisory_unlock_all" || name == "pg_advisory_xact_lock" || name == "pg_advisory_xact_lock_shared"){
  3642. AddWarning(TIssuesIds::PG_COMPAT, name + " function forced to return OK without waiting and without really lock/unlock");
  3643. return L(A("Null"));
  3644. }
  3645. const bool isAggregateFunc = NYql::NPg::HasAggregation(name, NYql::NPg::EAggKind::Normal);
  3646. const bool hasReturnSet = NYql::NPg::HasReturnSetProc(name);
  3647. if (isAggregateFunc && !settings.AllowAggregates) {
  3648. AddError(TStringBuilder() << "Aggregate functions are not allowed in: " << settings.Scope);
  3649. return nullptr;
  3650. }
  3651. if (hasReturnSet && !settings.AllowReturnSet) {
  3652. AddError(TStringBuilder() << "Generator functions are not allowed in: " << settings.Scope);
  3653. return nullptr;
  3654. }
  3655. TVector<TAstNode*> args;
  3656. TString callable;
  3657. if (window) {
  3658. if (isAggregateFunc) {
  3659. callable = "PgAggWindowCall";
  3660. } else {
  3661. callable = "PgWindowCall";
  3662. }
  3663. } else {
  3664. if (isAggregateFunc) {
  3665. callable = "PgAgg";
  3666. } else {
  3667. callable = "PgCall";
  3668. }
  3669. }
  3670. args.push_back(A(callable));
  3671. args.push_back(QAX(name));
  3672. if (window) {
  3673. args.push_back(window);
  3674. }
  3675. TVector<TAstNode*> callSettings;
  3676. if (value->agg_distinct) {
  3677. if (!isAggregateFunc) {
  3678. AddError("FuncCall: agg_distinct must be set only for aggregate functions");
  3679. return nullptr;
  3680. }
  3681. callSettings.push_back(QL(QA("distinct")));
  3682. }
  3683. if (rangeFunction) {
  3684. callSettings.push_back(QL(QA("range")));
  3685. }
  3686. args.push_back(QVL(callSettings.data(), callSettings.size()));
  3687. if (value->agg_star) {
  3688. if (name != "count") {
  3689. AddError("FuncCall: * is expected only in count function");
  3690. return nullptr;
  3691. }
  3692. } else {
  3693. if (name == "count" && ListLength(value->args) == 0) {
  3694. AddError("FuncCall: count(*) must be used to call a parameterless aggregate function");
  3695. return nullptr;
  3696. }
  3697. bool hasError = false;
  3698. for (int i = 0; i < ListLength(value->args); ++i) {
  3699. auto x = ListNodeNth(value->args, i);
  3700. auto arg = ParseExpr(x, settings);
  3701. if (!arg) {
  3702. hasError = true;
  3703. continue;
  3704. }
  3705. args.push_back(arg);
  3706. }
  3707. if (hasError) {
  3708. return nullptr;
  3709. }
  3710. }
  3711. return VL(args.data(), args.size());
  3712. }
  3713. bool ExtractFuncName(const FuncCall* value, TString& name, TString* schemaName) {
  3714. TVector<TString> names;
  3715. for (int i = 0; i < ListLength(value->funcname); ++i) {
  3716. auto x = ListNodeNth(value->funcname, i);
  3717. if (NodeTag(x) != T_String) {
  3718. NodeNotImplemented(value, x);
  3719. return false;
  3720. }
  3721. names.push_back(to_lower(TString(StrVal(x))));
  3722. }
  3723. if (names.empty()) {
  3724. AddError("FuncCall: missing function name");
  3725. return false;
  3726. }
  3727. if (names.size() > 2) {
  3728. AddError(TStringBuilder() << "FuncCall: too many name components:: " << names.size());
  3729. return false;
  3730. }
  3731. if (names.size() == 2) {
  3732. if (!schemaName && names[0] != "pg_catalog") {
  3733. AddError(TStringBuilder() << "FuncCall: expected pg_catalog, but got: " << names[0]);
  3734. return false;
  3735. }
  3736. if (schemaName) {
  3737. *schemaName = names[0];
  3738. }
  3739. }
  3740. name = names.back();
  3741. return true;
  3742. }
  3743. TAstNode* ParseTypeCast(const TypeCast* value, const TExprSettings& settings) {
  3744. AT_LOCATION(value);
  3745. if (!value->arg) {
  3746. AddError("Expected arg");
  3747. return nullptr;
  3748. }
  3749. if (!value->typeName) {
  3750. AddError("Expected type_name");
  3751. return nullptr;
  3752. }
  3753. auto arg = value->arg;
  3754. auto typeName = value->typeName;
  3755. auto supportedTypeName = typeName->typeOid == 0 &&
  3756. !typeName->setof &&
  3757. !typeName->pct_type &&
  3758. (ListLength(typeName->names) == 2 &&
  3759. NodeTag(ListNodeNth(typeName->names, 0)) == T_String &&
  3760. !StrICompare(StrVal(ListNodeNth(typeName->names, 0)), "pg_catalog") || ListLength(typeName->names) == 1) &&
  3761. NodeTag(ListNodeNth(typeName->names, ListLength(typeName->names) - 1)) == T_String;
  3762. if (NodeTag(arg) == T_A_Const &&
  3763. (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String ||
  3764. CAST_NODE(A_Const, arg)->isnull) &&
  3765. supportedTypeName &&
  3766. typeName->typemod == -1 &&
  3767. ListLength(typeName->typmods) == 0 &&
  3768. ListLength(typeName->arrayBounds) == 0) {
  3769. TStringBuf targetType = StrVal(ListNodeNth(typeName->names, ListLength(typeName->names) - 1));
  3770. if (NodeTag(CAST_NODE(A_Const, arg)->val) == T_String && targetType == "bool") {
  3771. auto str = StrVal(CAST_NODE(A_Const, arg)->val);
  3772. return L(A("PgConst"), QAX(str), L(A("PgType"), QA("bool")));
  3773. }
  3774. }
  3775. if (supportedTypeName) {
  3776. AT_LOCATION(typeName);
  3777. TStringBuf targetType = StrVal(ListNodeNth(typeName->names, ListLength(typeName->names) - 1));
  3778. auto input = ParseExpr(arg, settings);
  3779. if (!input) {
  3780. return nullptr;
  3781. }
  3782. auto finalType = TString(targetType);
  3783. if (ListLength(typeName->arrayBounds) && !finalType.StartsWith('_')) {
  3784. finalType = "_" + finalType;
  3785. }
  3786. if (!NPg::HasType(finalType)) {
  3787. AddError(TStringBuilder() << "Unknown type: " << finalType);
  3788. return nullptr;
  3789. }
  3790. if (ListLength(typeName->typmods) == 0 && typeName->typemod == -1) {
  3791. return L(A("PgCast"), input, L(A("PgType"), QAX(finalType)));
  3792. } else {
  3793. const auto& typeDesc = NPg::LookupType(finalType);
  3794. ui32 typeModInFuncId;
  3795. if (typeDesc.ArrayTypeId == typeDesc.TypeId) {
  3796. const auto& typeDescElem = NPg::LookupType(typeDesc.ElementTypeId);
  3797. typeModInFuncId = typeDescElem.TypeModInFuncId;
  3798. } else {
  3799. typeModInFuncId = typeDesc.TypeModInFuncId;
  3800. }
  3801. if (!typeModInFuncId) {
  3802. AddError(TStringBuilder() << "Type " << finalType << " doesn't support modifiers");
  3803. return nullptr;
  3804. }
  3805. const auto& procDesc = NPg::LookupProc(typeModInFuncId);
  3806. TAstNode* typeMod;
  3807. if (typeName->typemod != -1) {
  3808. typeMod = L(A("PgConst"), QA(ToString(typeName->typemod)), L(A("PgType"), QA("int4")));
  3809. } else {
  3810. TVector<TAstNode*> args;
  3811. args.push_back(A("PgArray"));
  3812. for (int i = 0; i < ListLength(typeName->typmods); ++i) {
  3813. auto typeMod = ListNodeNth(typeName->typmods, i);
  3814. if (NodeTag(typeMod) != T_A_Const) {
  3815. AddError("Expected T_A_Const as typmod");
  3816. return nullptr;
  3817. }
  3818. auto aConst = CAST_NODE(A_Const, typeMod);
  3819. TString s;
  3820. if (!ValueAsString(aConst->val, aConst->isnull, s)) {
  3821. AddError("Unsupported format of typmod");
  3822. return nullptr;
  3823. }
  3824. args.push_back(L(A("PgConst"), QAX(s), L(A("PgType"), QA("cstring"))));
  3825. }
  3826. typeMod = L(A("PgCall"), QA(procDesc.Name), QL(), VL(args.data(), args.size()));
  3827. }
  3828. return L(A("PgCast"), input, L(A("PgType"), QAX(finalType)), typeMod);
  3829. }
  3830. }
  3831. AddError("Unsupported form of type cast");
  3832. return nullptr;
  3833. }
  3834. TAstNode* ParseAndOrExpr(const BoolExpr* value, const TExprSettings& settings, const TString& pgOpName) {
  3835. auto length = ListLength(value->args);
  3836. if (length < 2) {
  3837. AddError(TStringBuilder() << "Expected >1 args for " << pgOpName << " but have " << length << " args");
  3838. return nullptr;
  3839. }
  3840. auto lhs = ParseExpr(ListNodeNth(value->args, 0), settings);
  3841. if (!lhs) {
  3842. return nullptr;
  3843. }
  3844. for (auto i = 1; i < length; ++i) {
  3845. auto rhs = ParseExpr(ListNodeNth(value->args, i), settings);
  3846. if (!rhs) {
  3847. return nullptr;
  3848. }
  3849. lhs = L(A(pgOpName), lhs, rhs);
  3850. }
  3851. return lhs;
  3852. }
  3853. TAstNode* ParseBoolExpr(const BoolExpr* value, const TExprSettings& settings) {
  3854. AT_LOCATION(value);
  3855. switch (value->boolop) {
  3856. case AND_EXPR: {
  3857. return ParseAndOrExpr(value, settings, "PgAnd");
  3858. }
  3859. case OR_EXPR: {
  3860. return ParseAndOrExpr(value, settings, "PgOr");
  3861. }
  3862. case NOT_EXPR: {
  3863. if (ListLength(value->args) != 1) {
  3864. AddError("Expected 1 arg for NOT");
  3865. return nullptr;
  3866. }
  3867. auto arg = ParseExpr(ListNodeNth(value->args, 0), settings);
  3868. if (!arg) {
  3869. return nullptr;
  3870. }
  3871. return L(A("PgNot"), arg);
  3872. }
  3873. default:
  3874. AddError(TStringBuilder() << "BoolExprType unsupported value: " << (int)value->boolop);
  3875. return nullptr;
  3876. }
  3877. }
  3878. TAstNode* ParseWindowDef(const WindowDef* value) {
  3879. AT_LOCATION(value);
  3880. auto name = QAX(value->name);
  3881. auto refName = QAX(value->refname);
  3882. TVector<TAstNode*> sortItems;
  3883. for (int i = 0; i < ListLength(value->orderClause); ++i) {
  3884. auto node = ListNodeNth(value->orderClause, i);
  3885. if (NodeTag(node) != T_SortBy) {
  3886. NodeNotImplemented(value, node);
  3887. return nullptr;
  3888. }
  3889. auto sort = ParseSortBy(CAST_NODE_EXT(PG_SortBy, T_SortBy, node), true, false);
  3890. if (!sort) {
  3891. return nullptr;
  3892. }
  3893. sortItems.push_back(sort);
  3894. }
  3895. auto sort = QVL(sortItems.data(), sortItems.size());
  3896. TVector<TAstNode*> groupByItems;
  3897. for (int i = 0; i < ListLength(value->partitionClause); ++i) {
  3898. auto node = ListNodeNth(value->partitionClause, i);
  3899. TExprSettings settings;
  3900. settings.AllowColumns = true;
  3901. settings.AllowAggregates = true;
  3902. settings.Scope = "PARTITITON BY";
  3903. auto expr = ParseExpr(node, settings);
  3904. if (!expr) {
  3905. return nullptr;
  3906. }
  3907. auto lambda = L(A("lambda"), QL(), expr);
  3908. groupByItems.push_back(L(A("PgGroup"), L(A("Void")), lambda));
  3909. }
  3910. auto group = QVL(groupByItems.data(), groupByItems.size());
  3911. TVector<TAstNode*> optionItems;
  3912. if (value->frameOptions & FRAMEOPTION_NONDEFAULT) {
  3913. TString exclude;
  3914. if (value->frameOptions & FRAMEOPTION_EXCLUDE_CURRENT_ROW) {
  3915. if (exclude) {
  3916. AddError("Wrong frame options");
  3917. return nullptr;
  3918. }
  3919. exclude = "c";
  3920. }
  3921. if (value->frameOptions & FRAMEOPTION_EXCLUDE_GROUP) {
  3922. if (exclude) {
  3923. AddError("Wrong frame options");
  3924. return nullptr;
  3925. }
  3926. exclude = "cp";
  3927. }
  3928. if (value->frameOptions & FRAMEOPTION_EXCLUDE_TIES) {
  3929. if (exclude) {
  3930. AddError("Wrong frame options");
  3931. return nullptr;
  3932. }
  3933. exclude = "p";
  3934. }
  3935. if (exclude) {
  3936. optionItems.push_back(QL(QA("exclude"), QA(exclude)));
  3937. }
  3938. TString type;
  3939. if (value->frameOptions & FRAMEOPTION_RANGE) {
  3940. if (type) {
  3941. AddError("Wrong frame options");
  3942. return nullptr;
  3943. }
  3944. type = "range";
  3945. }
  3946. if (value->frameOptions & FRAMEOPTION_ROWS) {
  3947. if (type) {
  3948. AddError("Wrong frame options");
  3949. return nullptr;
  3950. }
  3951. type = "rows";
  3952. }
  3953. if (value->frameOptions & FRAMEOPTION_GROUPS) {
  3954. if (type) {
  3955. AddError("Wrong frame options");
  3956. return nullptr;
  3957. }
  3958. type = "groups";
  3959. }
  3960. if (!type) {
  3961. AddError("Wrong frame options");
  3962. return nullptr;
  3963. }
  3964. TString from;
  3965. if (value->frameOptions & FRAMEOPTION_START_UNBOUNDED_PRECEDING) {
  3966. if (from) {
  3967. AddError("Wrong frame options");
  3968. return nullptr;
  3969. }
  3970. from = "up";
  3971. }
  3972. if (value->frameOptions & FRAMEOPTION_START_OFFSET_PRECEDING) {
  3973. if (from) {
  3974. AddError("Wrong frame options");
  3975. return nullptr;
  3976. }
  3977. from = "p";
  3978. auto offset = ConvertFrameOffset(value->startOffset);
  3979. if (!offset) {
  3980. return nullptr;
  3981. }
  3982. optionItems.push_back(QL(QA("from_value"), offset));
  3983. }
  3984. if (value->frameOptions & FRAMEOPTION_START_CURRENT_ROW) {
  3985. if (from) {
  3986. AddError("Wrong frame options");
  3987. return nullptr;
  3988. }
  3989. from = "c";
  3990. }
  3991. if (value->frameOptions & FRAMEOPTION_START_OFFSET_FOLLOWING) {
  3992. if (from) {
  3993. AddError("Wrong frame options");
  3994. return nullptr;
  3995. }
  3996. from = "f";
  3997. auto offset = ConvertFrameOffset(value->startOffset);
  3998. if (!offset) {
  3999. return nullptr;
  4000. }
  4001. optionItems.push_back(QL(QA("from_value"), offset));
  4002. }
  4003. if (value->frameOptions & FRAMEOPTION_START_UNBOUNDED_FOLLOWING) {
  4004. AddError("Wrong frame options");
  4005. return nullptr;
  4006. }
  4007. if (!from) {
  4008. AddError("Wrong frame options");
  4009. return nullptr;
  4010. }
  4011. TString to;
  4012. if (value->frameOptions & FRAMEOPTION_END_UNBOUNDED_PRECEDING) {
  4013. AddError("Wrong frame options");
  4014. return nullptr;
  4015. }
  4016. if (value->frameOptions & FRAMEOPTION_END_OFFSET_PRECEDING) {
  4017. if (to) {
  4018. AddError("Wrong frame options");
  4019. return nullptr;
  4020. }
  4021. to = "p";
  4022. auto offset = ConvertFrameOffset(value->endOffset);
  4023. if (!offset) {
  4024. return nullptr;
  4025. }
  4026. optionItems.push_back(QL(QA("to_value"), offset));
  4027. }
  4028. if (value->frameOptions & FRAMEOPTION_END_CURRENT_ROW) {
  4029. if (to) {
  4030. AddError("Wrong frame options");
  4031. return nullptr;
  4032. }
  4033. to = "c";
  4034. }
  4035. if (value->frameOptions & FRAMEOPTION_END_OFFSET_FOLLOWING) {
  4036. if (to) {
  4037. AddError("Wrong frame options");
  4038. return nullptr;
  4039. }
  4040. to = "f";
  4041. auto offset = ConvertFrameOffset(value->endOffset);
  4042. if (!offset) {
  4043. return nullptr;
  4044. }
  4045. optionItems.push_back(QL(QA("to_value"), offset));
  4046. }
  4047. if (value->frameOptions & FRAMEOPTION_END_UNBOUNDED_FOLLOWING) {
  4048. if (to) {
  4049. AddError("Wrong frame options");
  4050. return nullptr;
  4051. }
  4052. to = "uf";
  4053. }
  4054. if (!to) {
  4055. AddError("Wrong frame options");
  4056. return nullptr;
  4057. }
  4058. optionItems.push_back(QL(QA("type"), QAX(type)));
  4059. optionItems.push_back(QL(QA("from"), QAX(from)));
  4060. optionItems.push_back(QL(QA("to"), QAX(to)));
  4061. }
  4062. auto options = QVL(optionItems.data(), optionItems.size());
  4063. return L(A("PgWindow"), name, refName, group, sort, options);
  4064. }
  4065. TAstNode* ConvertFrameOffset(const Node* off) {
  4066. if (NodeTag(off) == T_A_Const
  4067. && NodeTag(CAST_NODE(A_Const, off)->val) == T_Integer) {
  4068. return L(A("Int32"), QA(ToString(IntVal(CAST_NODE(A_Const, off)->val))));
  4069. } else {
  4070. TExprSettings settings;
  4071. settings.AllowColumns = false;
  4072. settings.Scope = "FRAME";
  4073. auto offset = ParseExpr(off, settings);
  4074. if (!offset) {
  4075. return nullptr;
  4076. }
  4077. return L(A("EvaluateExpr"), L(A("Unwrap"), offset, L(A("String"), QA("Frame offset must be non-null"))));
  4078. }
  4079. }
  4080. TAstNode* ParseSortBy(const PG_SortBy* value, bool allowAggregates, bool useProjectionRefs) {
  4081. AT_LOCATION(value);
  4082. bool asc = true;
  4083. bool nullsFirst = true;
  4084. switch (value->sortby_dir) {
  4085. case SORTBY_DEFAULT:
  4086. case SORTBY_ASC:
  4087. if (Settings.PgSortNulls) {
  4088. nullsFirst = false;
  4089. }
  4090. break;
  4091. case SORTBY_DESC:
  4092. asc = false;
  4093. break;
  4094. default:
  4095. AddError(TStringBuilder() << "sortby_dir unsupported value: " << (int)value->sortby_dir);
  4096. return nullptr;
  4097. }
  4098. switch (value->sortby_nulls) {
  4099. case SORTBY_NULLS_DEFAULT:
  4100. break;
  4101. case SORTBY_NULLS_FIRST:
  4102. nullsFirst = true;
  4103. break;
  4104. case SORTBY_NULLS_LAST:
  4105. nullsFirst = false;
  4106. break;
  4107. default:
  4108. AddError(TStringBuilder() << "sortby_dir unsupported value: " << (int)value->sortby_dir);
  4109. return nullptr;
  4110. }
  4111. if (ListLength(value->useOp) > 0) {
  4112. AddError("Unsupported operators in sort_by");
  4113. return nullptr;
  4114. }
  4115. TAstNode* expr;
  4116. if (useProjectionRefs && NodeTag(value->node) == T_A_Const && (NodeTag(CAST_NODE(A_Const, value->node)->val) == T_Integer)) {
  4117. expr = MakeProjectionRef("ORDER BY", CAST_NODE(A_Const, value->node));
  4118. } else {
  4119. TExprSettings settings;
  4120. settings.AllowColumns = true;
  4121. settings.AllowSubLinks = true;
  4122. settings.Scope = "ORDER BY";
  4123. settings.AllowAggregates = allowAggregates;
  4124. expr = ParseExpr(value->node, settings);
  4125. }
  4126. if (!expr) {
  4127. return nullptr;
  4128. }
  4129. auto lambda = L(A("lambda"), QL(), expr);
  4130. return L(A("PgSort"), L(A("Void")), lambda, QA(asc ? "asc" : "desc"), QA(nullsFirst ? "first" : "last"));
  4131. }
  4132. TAstNode* ParseColumnRef(const ColumnRef* value, const TExprSettings& settings) {
  4133. AT_LOCATION(value);
  4134. if (!settings.AllowColumns) {
  4135. AddError(TStringBuilder() << "Columns are not allowed in: " << settings.Scope);
  4136. return nullptr;
  4137. }
  4138. if (ListLength(value->fields) == 0) {
  4139. AddError("No fields");
  4140. return nullptr;
  4141. }
  4142. if (ListLength(value->fields) > 2) {
  4143. AddError("Too many fields");
  4144. return nullptr;
  4145. }
  4146. bool isStar = false;
  4147. TVector<TString> fields;
  4148. for (int i = 0; i < ListLength(value->fields); ++i) {
  4149. auto x = ListNodeNth(value->fields, i);
  4150. if (isStar) {
  4151. AddError("Star is already defined");
  4152. return nullptr;
  4153. }
  4154. if (NodeTag(x) == T_String) {
  4155. fields.push_back(StrVal(x));
  4156. } else if (NodeTag(x) == T_A_Star) {
  4157. isStar = true;
  4158. } else {
  4159. NodeNotImplemented(value, x);
  4160. return nullptr;
  4161. }
  4162. }
  4163. if (isStar) {
  4164. if (fields.size() == 0) {
  4165. return L(A("PgStar"));
  4166. } else {
  4167. return L(A("PgQualifiedStar"), QAX(fields[0]));
  4168. }
  4169. } else if (fields.size() == 1) {
  4170. return L(A("PgColumnRef"), QAX(fields[0]));
  4171. } else {
  4172. return L(A("PgColumnRef"), QAX(fields[0]), QAX(fields[1]));
  4173. }
  4174. }
  4175. TAstNode* ParseAExprOp(const A_Expr* value, const TExprSettings& settings) {
  4176. AT_LOCATION(value);
  4177. if (ListLength(value->name) != 1) {
  4178. AddError(TStringBuilder() << "Unsupported count of names: " << ListLength(value->name));
  4179. return nullptr;
  4180. }
  4181. auto nameNode = ListNodeNth(value->name, 0);
  4182. if (NodeTag(nameNode) != T_String) {
  4183. NodeNotImplemented(value, nameNode);
  4184. return nullptr;
  4185. }
  4186. auto op = StrVal(nameNode);
  4187. if (!value->rexpr) {
  4188. AddError("Missing operands");
  4189. return nullptr;
  4190. }
  4191. if (!value->lexpr) {
  4192. auto rhs = ParseExpr(value->rexpr, settings);
  4193. if (!rhs) {
  4194. return nullptr;
  4195. }
  4196. return L(A("PgOp"), QAX(op), rhs);
  4197. }
  4198. auto lhs = ParseExpr(value->lexpr, settings);
  4199. auto rhs = ParseExpr(value->rexpr, settings);
  4200. if (!lhs || !rhs) {
  4201. return nullptr;
  4202. }
  4203. return L(A("PgOp"), QAX(op), lhs, rhs);
  4204. }
  4205. TAstNode* ParseAExprOpAnyAll(const A_Expr* value, const TExprSettings& settings, bool all) {
  4206. if (ListLength(value->name) != 1) {
  4207. AddError(TStringBuilder() << "Unsupported count of names: " << ListLength(value->name));
  4208. return nullptr;
  4209. }
  4210. auto nameNode = ListNodeNth(value->name, 0);
  4211. if (NodeTag(nameNode) != T_String) {
  4212. NodeNotImplemented(value, nameNode);
  4213. return nullptr;
  4214. }
  4215. auto op = StrVal(nameNode);
  4216. if (!value->lexpr || !value->rexpr) {
  4217. AddError("Missing operands");
  4218. return nullptr;
  4219. }
  4220. auto lhs = ParseExpr(value->lexpr, settings);
  4221. if (NodeTag(value->rexpr) == T_SubLink) {
  4222. auto sublink = CAST_NODE(SubLink, value->rexpr);
  4223. auto subselect = CAST_NODE(SelectStmt, sublink->subselect);
  4224. if (subselect->withClause && subselect->withClause->recursive) {
  4225. if (State.ApplicationName && State.ApplicationName->StartsWith("pgAdmin")) {
  4226. AddWarning(TIssuesIds::PG_COMPAT, "AEXPR_OP_ANY forced to false");
  4227. return L(A("PgConst"), QA("false"), L(A("PgType"), QA("bool")));
  4228. }
  4229. }
  4230. }
  4231. auto rhs = ParseExpr(value->rexpr, settings);
  4232. if (!lhs || !rhs) {
  4233. return nullptr;
  4234. }
  4235. return L(A(all ? "PgAllOp" : "PgAnyOp"), QAX(op), lhs, rhs);
  4236. }
  4237. TAstNode* ParseAExprLike(const A_Expr* value, const TExprSettings& settings, bool insensitive) {
  4238. if (ListLength(value->name) != 1) {
  4239. AddError(TStringBuilder() << "Unsupported count of names: " << ListLength(value->name));
  4240. return nullptr;
  4241. }
  4242. auto nameNode = ListNodeNth(value->name, 0);
  4243. if (NodeTag(nameNode) != T_String) {
  4244. NodeNotImplemented(value, nameNode);
  4245. return nullptr;
  4246. }
  4247. auto op = TString(StrVal(nameNode));
  4248. if (insensitive) {
  4249. if (op != "~~*" && op != "!~~*") {
  4250. AddError(TStringBuilder() << "Unsupported operation: " << op);
  4251. return nullptr;
  4252. }
  4253. } else {
  4254. if (op != "~~" && op != "!~~") {
  4255. AddError(TStringBuilder() << "Unsupported operation: " << op);
  4256. return nullptr;
  4257. }
  4258. }
  4259. if (!value->lexpr || !value->rexpr) {
  4260. AddError("Missing operands");
  4261. return nullptr;
  4262. }
  4263. auto lhs = ParseExpr(value->lexpr, settings);
  4264. auto rhs = ParseExpr(value->rexpr, settings);
  4265. if (!lhs || !rhs) {
  4266. return nullptr;
  4267. }
  4268. auto ret = L(A(insensitive ? "PgILike" : "PgLike"), lhs, rhs);
  4269. if (op[0] == '!') {
  4270. ret = L(A("PgNot"), ret);
  4271. }
  4272. return ret;
  4273. }
  4274. TAstNode* ParseAExprNullIf(const A_Expr* value, const TExprSettings& settings) {
  4275. if (ListLength(value->name) != 1) {
  4276. AddError(TStringBuilder() << "Unsupported count of names: " << ListLength(value->name));
  4277. return nullptr;
  4278. }
  4279. if (!value->lexpr || !value->rexpr) {
  4280. AddError("Missing operands");
  4281. return nullptr;
  4282. }
  4283. auto lhs = ParseExpr(value->lexpr, settings);
  4284. auto rhs = ParseExpr(value->rexpr, settings);
  4285. if (!lhs || !rhs) {
  4286. return nullptr;
  4287. }
  4288. return L(A("PgNullIf"), lhs, rhs);
  4289. }
  4290. TAstNode* ParseAExprIn(const A_Expr* value, const TExprSettings& settings) {
  4291. if (ListLength(value->name) != 1) {
  4292. AddError(TStringBuilder() << "Unsupported count of names: " << ListLength(value->name));
  4293. return nullptr;
  4294. }
  4295. auto nameNode = ListNodeNth(value->name, 0);
  4296. if (NodeTag(nameNode) != T_String) {
  4297. NodeNotImplemented(value, nameNode);
  4298. return nullptr;
  4299. }
  4300. auto op = TString(StrVal(nameNode));
  4301. if (op != "=" && op != "<>") {
  4302. AddError(TStringBuilder() << "Unsupported operation: " << op);
  4303. return nullptr;
  4304. }
  4305. if (!value->lexpr || !value->rexpr) {
  4306. AddError("Missing operands");
  4307. return nullptr;
  4308. }
  4309. auto lhs = ParseExpr(value->lexpr, settings);
  4310. if (!lhs) {
  4311. return nullptr;
  4312. }
  4313. if (NodeTag(value->rexpr) != T_List) {
  4314. NodeNotImplemented(value, value->rexpr);
  4315. return nullptr;
  4316. }
  4317. auto lst = CAST_NODE(List, value->rexpr);
  4318. TVector<TAstNode*> children;
  4319. children.reserve(2 + ListLength(lst));
  4320. children.push_back(A("PgIn"));
  4321. children.push_back(lhs);
  4322. for (int item = 0; item < ListLength(lst); ++item) {
  4323. auto cell = ParseExpr(ListNodeNth(lst, item), settings);
  4324. if (!cell) {
  4325. return nullptr;
  4326. }
  4327. children.push_back(cell);
  4328. }
  4329. auto ret = VL(children.data(), children.size());
  4330. if (op[0] == '<') {
  4331. ret = L(A("PgNot"), ret);
  4332. }
  4333. return ret;
  4334. }
  4335. TAstNode* ParseAExprBetween(const A_Expr* value, const TExprSettings& settings) {
  4336. if (!value->lexpr || !value->rexpr) {
  4337. AddError("Missing operands");
  4338. return nullptr;
  4339. }
  4340. if (NodeTag(value->rexpr) != T_List) {
  4341. AddError(TStringBuilder() << "Expected T_List tag, but have " << NodeTag(value->rexpr));
  4342. return nullptr;
  4343. }
  4344. const List* rexprList = CAST_NODE(List, value->rexpr);
  4345. if (ListLength(rexprList) != 2) {
  4346. AddError(TStringBuilder() << "Expected 2 args in BETWEEN range, but have " << ListLength(rexprList));
  4347. return nullptr;
  4348. }
  4349. auto b = ListNodeNth(rexprList, 0);
  4350. auto e = ListNodeNth(rexprList, 1);
  4351. auto lhs = ParseExpr(value->lexpr, settings);
  4352. auto rbhs = ParseExpr(b, settings);
  4353. auto rehs = ParseExpr(e, settings);
  4354. if (!lhs || !rbhs || !rehs) {
  4355. return nullptr;
  4356. }
  4357. A_Expr_Kind kind = value->kind;
  4358. bool inverse = false;
  4359. if (kind == AEXPR_NOT_BETWEEN) {
  4360. inverse = true;
  4361. kind = AEXPR_BETWEEN;
  4362. } else if (kind == AEXPR_NOT_BETWEEN_SYM) {
  4363. inverse = true;
  4364. kind = AEXPR_BETWEEN_SYM;
  4365. }
  4366. TAstNode* ret;
  4367. switch (kind) {
  4368. case AEXPR_BETWEEN:
  4369. case AEXPR_BETWEEN_SYM:
  4370. ret = L(A(kind == AEXPR_BETWEEN ? "PgBetween" : "PgBetweenSym"), lhs, rbhs, rehs);
  4371. break;
  4372. default:
  4373. AddError(TStringBuilder() << "BETWEEN kind unsupported value: " << (int)value->kind);
  4374. return nullptr;
  4375. }
  4376. if (inverse) {
  4377. ret = L(A("PgNot"), ret);
  4378. }
  4379. return ret;
  4380. }
  4381. TAstNode* ParseAExpr(const A_Expr* value, const TExprSettings& settings) {
  4382. AT_LOCATION(value);
  4383. switch (value->kind) {
  4384. case AEXPR_OP:
  4385. return ParseAExprOp(value, settings);
  4386. case AEXPR_LIKE:
  4387. case AEXPR_ILIKE:
  4388. return ParseAExprLike(value, settings, value->kind == AEXPR_ILIKE);
  4389. case AEXPR_IN:
  4390. return ParseAExprIn(value, settings);
  4391. case AEXPR_BETWEEN:
  4392. case AEXPR_NOT_BETWEEN:
  4393. case AEXPR_BETWEEN_SYM:
  4394. case AEXPR_NOT_BETWEEN_SYM:
  4395. return ParseAExprBetween(value, settings);
  4396. case AEXPR_OP_ANY:
  4397. case AEXPR_OP_ALL:
  4398. return ParseAExprOpAnyAll(value, settings, value->kind == AEXPR_OP_ALL);
  4399. case AEXPR_NULLIF:
  4400. return ParseAExprNullIf(value, settings);
  4401. default:
  4402. AddError(TStringBuilder() << "A_Expr_Kind unsupported value: " << (int)value->kind);
  4403. return nullptr;
  4404. }
  4405. }
  4406. void AddVariableDeclarations() {
  4407. for (const auto& [varName, typeName] : State.ParamNameToPgTypeName) {
  4408. const auto pgType = L(A("PgType"), QA(typeName));
  4409. State.Statements.push_back(L(A("declare"), A(varName), pgType));
  4410. }
  4411. }
  4412. template <typename T>
  4413. void NodeNotImplementedImpl(const Node* nodeptr) {
  4414. TStringBuilder b;
  4415. b << TypeName<T>() << ": ";
  4416. b << "alternative is not implemented yet : " << NodeTag(nodeptr);
  4417. AddError(b);
  4418. }
  4419. template <typename T>
  4420. void NodeNotImplemented(const T* outer, const Node* nodeptr) {
  4421. Y_UNUSED(outer);
  4422. NodeNotImplementedImpl<T>(nodeptr);
  4423. }
  4424. void NodeNotImplemented(const Node* nodeptr) {
  4425. TStringBuilder b;
  4426. b << "alternative is not implemented yet : " << NodeTag(nodeptr);
  4427. AddError(b);
  4428. }
  4429. TAstNode* VL(TAstNode** nodes, ui32 size, TPosition pos = {}) {
  4430. return TAstNode::NewList(pos.Row ? pos : State.Positions.back(), nodes, size, *AstParseResults[StatementId].Pool);
  4431. }
  4432. TAstNode* VL(TArrayRef<TAstNode*> nodes, TPosition pos = {}) {
  4433. return TAstNode::NewList(pos.Row ? pos : State.Positions.back(), nodes.data(), nodes.size(), *AstParseResults[StatementId].Pool);
  4434. }
  4435. TAstNode* QVL(TAstNode** nodes, ui32 size, TPosition pos = {}) {
  4436. return Q(VL(nodes, size, pos), pos);
  4437. }
  4438. TAstNode* QVL(TAstNode* node, TPosition pos = {}) {
  4439. return QVL(&node, 1, pos);
  4440. }
  4441. TAstNode* QVL(TArrayRef<TAstNode*> nodes, TPosition pos = {}) {
  4442. return Q(VL(nodes, pos), pos);
  4443. }
  4444. TAstNode* A(const TStringBuf str, TPosition pos = {}, ui32 flags = 0) {
  4445. return TAstNode::NewAtom(pos.Row ? pos : State.Positions.back(), str, *AstParseResults[StatementId].Pool, flags);
  4446. }
  4447. TAstNode* AX(const TString& str, TPosition pos = {}) {
  4448. return A(str, pos.Row ? pos : State.Positions.back(), TNodeFlags::ArbitraryContent);
  4449. }
  4450. TAstNode* Q(TAstNode* node, TPosition pos = {}) {
  4451. return L(A("quote", pos), node, pos);
  4452. }
  4453. TAstNode* QA(const TStringBuf str, TPosition pos = {}, ui32 flags = 0) {
  4454. return Q(A(str, pos, flags), pos);
  4455. }
  4456. TAstNode* QAX(const TString& str, TPosition pos = {}) {
  4457. return QA(str, pos, TNodeFlags::ArbitraryContent);
  4458. }
  4459. template <typename... TNodes>
  4460. TAstNode* L(TNodes... nodes) {
  4461. TLState state;
  4462. LImpl(state, nodes...);
  4463. return TAstNode::NewList(state.Position.Row ? state.Position : State.Positions.back(), state.Nodes.data(), state.Nodes.size(), *AstParseResults[StatementId].Pool);
  4464. }
  4465. template <typename... TNodes>
  4466. TAstNode* QL(TNodes... nodes) {
  4467. return Q(L(nodes...));
  4468. }
  4469. template <typename... TNodes>
  4470. TAstNode* E(TAstNode* list, TNodes... nodes) {
  4471. Y_ABORT_UNLESS(list->IsList());
  4472. TVector<TAstNode*> nodes_vec;
  4473. nodes_vec.reserve(list->GetChildrenCount() + sizeof...(nodes));
  4474. auto children = list->GetChildren();
  4475. if (children) {
  4476. nodes_vec.assign(children.begin(), children.end());
  4477. }
  4478. nodes_vec.assign({nodes...});
  4479. return VL(nodes_vec.data(), nodes_vec.size());
  4480. }
  4481. private:
  4482. void AddError(const TString& value) {
  4483. AstParseResults[StatementId].Issues.AddIssue(TIssue(State.Positions.back(), value));
  4484. }
  4485. void AddWarning(int code, const TString& value) {
  4486. AstParseResults[StatementId].Issues.AddIssue(TIssue(State.Positions.back(), value).SetCode(code, ESeverity::TSeverityIds_ESeverityId_S_WARNING));
  4487. }
  4488. struct TLState {
  4489. TPosition Position;
  4490. TVector<TAstNode*> Nodes;
  4491. };
  4492. template <typename... TNodes>
  4493. void LImpl(TLState& state, TNodes... nodes);
  4494. void LImpl(TLState& state) {
  4495. Y_UNUSED(state);
  4496. }
  4497. void LImpl(TLState& state, TPosition pos) {
  4498. state.Position = pos;
  4499. }
  4500. void LImpl(TLState& state, TAstNode* node) {
  4501. state.Nodes.push_back(node);
  4502. }
  4503. template <typename T, typename... TNodes>
  4504. void LImpl(TLState& state, T node, TNodes... nodes) {
  4505. state.Nodes.push_back(node);
  4506. LImpl(state, nodes...);
  4507. }
  4508. void PushPosition(int location) {
  4509. if (location == -1) {
  4510. State.Positions.push_back(State.Positions.back());
  4511. return;
  4512. }
  4513. State.Positions.push_back(Location2Position(location));
  4514. };
  4515. void PopPosition() {
  4516. State.Positions.pop_back();
  4517. }
  4518. NYql::TPosition Location2Position(int location) const {
  4519. if (!QuerySize) {
  4520. return NYql::TPosition(0, 0);
  4521. }
  4522. if (location < 0) {
  4523. return NYql::TPosition(0, 0);
  4524. }
  4525. auto it = LowerBound(RowStarts.begin(), RowStarts.end(), Min((ui32)location, QuerySize));
  4526. Y_ENSURE(it != RowStarts.end());
  4527. if (*it == (ui32)location) {
  4528. auto row = 1 + it - RowStarts.begin();
  4529. auto column = 1;
  4530. return NYql::TPosition(column, row);
  4531. } else {
  4532. Y_ENSURE(it != RowStarts.begin());
  4533. auto row = it - RowStarts.begin();
  4534. auto column = 1 + location - *(it - 1);
  4535. return NYql::TPosition(column, row);
  4536. }
  4537. }
  4538. void ScanRows(const TString& query) {
  4539. QuerySize = query.size();
  4540. RowStarts.push_back(0);
  4541. TPosition position(0, 1);
  4542. TTextWalker walker(position, true);
  4543. auto prevRow = position.Row;
  4544. for (ui32 i = 0; i < query.size(); ++i) {
  4545. walker.Advance(query[i]);
  4546. while (position.Row != prevRow) {
  4547. RowStarts.push_back(i);
  4548. ++prevRow;
  4549. }
  4550. }
  4551. RowStarts.push_back(QuerySize);
  4552. }
  4553. TAstNode* MakeProjectionRef(const TStringBuf& scope, const A_Const* aConst) {
  4554. AT_LOCATION(aConst);
  4555. auto num = IntVal(aConst->val);
  4556. if (num <= 0) {
  4557. AddError(TStringBuilder() << scope << ": position " << num << " is not in select list");
  4558. return nullptr;
  4559. }
  4560. return L(A("PgProjectionRef"), QA(ToString(num - 1)));
  4561. }
  4562. private:
  4563. TVector<TAstParseResult>& AstParseResults;
  4564. NSQLTranslation::TTranslationSettings Settings;
  4565. bool DqEngineEnabled = false;
  4566. bool DqEngineForce = false;
  4567. bool BlockEngineEnabled = false;
  4568. bool BlockEngineForce = false;
  4569. bool UnorderedResult = false;
  4570. TString TablePathPrefix;
  4571. TVector<ui32> RowStarts;
  4572. ui32 QuerySize;
  4573. TString Provider;
  4574. static const THashMap<TStringBuf, TString> ProviderToInsertModeMap;
  4575. TState State;
  4576. ui32 StatementId = 0;
  4577. TVector<TStmtParseInfo>* StmtParseInfo;
  4578. bool PerStatementResult;
  4579. TMaybe<ui32> SqlProcArgsCount;
  4580. bool HasSelectInLimitedView = false;
  4581. };
  4582. const THashMap<TStringBuf, TString> TConverter::ProviderToInsertModeMap = {
  4583. {NYql::KikimrProviderName, "insert_abort"},
  4584. {NYql::YtProviderName, "append"}
  4585. };
  4586. NYql::TAstParseResult PGToYql(const TString& query, const NSQLTranslation::TTranslationSettings& settings, TStmtParseInfo* stmtParseInfo) {
  4587. TVector<NYql::TAstParseResult> results;
  4588. TVector<TStmtParseInfo> stmtParseInfos;
  4589. TConverter converter(results, settings, query, &stmtParseInfos, false, Nothing());
  4590. NYql::PGParse(query, converter);
  4591. if (stmtParseInfo) {
  4592. Y_ENSURE(!stmtParseInfos.empty());
  4593. *stmtParseInfo = stmtParseInfos.back();
  4594. }
  4595. Y_ENSURE(!results.empty());
  4596. results.back().ActualSyntaxType = NYql::ESyntaxType::Pg;
  4597. return std::move(results.back());
  4598. }
  4599. TVector<NYql::TAstParseResult> PGToYqlStatements(const TString& query, const NSQLTranslation::TTranslationSettings& settings, TVector<TStmtParseInfo>* stmtParseInfo) {
  4600. TVector<NYql::TAstParseResult> results;
  4601. TConverter converter(results, settings, query, stmtParseInfo, true, Nothing());
  4602. NYql::PGParse(query, converter);
  4603. for (auto& res : results) {
  4604. res.ActualSyntaxType = NYql::ESyntaxType::Pg;
  4605. }
  4606. return results;
  4607. }
  4608. bool ParseTypeName(const PG_TypeName* typeName, TString& value, bool* setOf = nullptr) {
  4609. auto len = ListLength(typeName->names);
  4610. if (len < 1 || len > 2) {
  4611. return false;
  4612. }
  4613. if (len == 2) {
  4614. auto schemaStr = to_lower(TString(StrVal(ListNodeNth(typeName->names, 0))));
  4615. if (schemaStr != "pg_catalog") {
  4616. return false;
  4617. }
  4618. }
  4619. value = to_lower(TString(StrVal(ListNodeNth(typeName->names, len - 1))));
  4620. if (ListLength(typeName->arrayBounds) && !value.StartsWith('_')) {
  4621. value = "_" + value;
  4622. }
  4623. if (!setOf && typeName->setof) {
  4624. return false;
  4625. }
  4626. if (setOf) {
  4627. *setOf = typeName->setof;
  4628. }
  4629. return true;
  4630. }
  4631. bool ParseCreateFunctionStmtImpl(const CreateFunctionStmt* value, ui32 extensionIndex,
  4632. NPg::IExtensionSqlBuilder* builder, NYql::NPg::TProcDesc& desc) {
  4633. if (ListLength(value->funcname) != 1) {
  4634. return false;
  4635. }
  4636. auto nameNode = ListNodeNth(value->funcname, 0);
  4637. auto name = to_lower(TString(StrVal(nameNode)));
  4638. desc.ExtensionIndex = extensionIndex;
  4639. desc.Name = name;
  4640. desc.IsStrict = false;
  4641. if (value->returnType) {
  4642. TString resultTypeStr;
  4643. if (!ParseTypeName(value->returnType, resultTypeStr, &desc.ReturnSet)) {
  4644. return false;
  4645. }
  4646. if (builder) {
  4647. builder->PrepareType(extensionIndex, resultTypeStr);
  4648. }
  4649. desc.ResultType = NPg::LookupType(resultTypeStr).TypeId;
  4650. } else {
  4651. desc.ResultType = NPg::LookupType("record").TypeId;
  4652. }
  4653. for (ui32 pass = 0; pass < 2; ++pass) {
  4654. for (int i = 0; i < ListLength(value->options); ++i) {
  4655. auto node = LIST_CAST_NTH(DefElem, value->options, i);
  4656. TString defnameStr(node->defname);
  4657. if (pass == 1 && defnameStr == "as") {
  4658. auto asList = CAST_NODE(List, node->arg);
  4659. auto asListLen = ListLength(asList);
  4660. if (desc.Lang == NPg::LangC) {
  4661. if (asListLen < 1 || asListLen > 2) {
  4662. return false;
  4663. }
  4664. auto extStr = TString(StrVal(ListNodeNth(asList, 0)));
  4665. auto srcStr = asListLen > 1 ?
  4666. TString(StrVal(ListNodeNth(asList, 1))) :
  4667. name;
  4668. Y_ENSURE(extensionIndex == NPg::LookupExtensionByInstallName(extStr));
  4669. desc.Src = srcStr;
  4670. } else if (desc.Lang == NPg::LangInternal || desc.Lang == NPg::LangSQL) {
  4671. if (asListLen != 1) {
  4672. return false;
  4673. }
  4674. auto srcStr = TString(StrVal(ListNodeNth(asList, 0)));
  4675. desc.Src = srcStr;
  4676. }
  4677. } else if (pass == 0 && defnameStr == "strict") {
  4678. desc.IsStrict = BoolVal(node->arg);
  4679. } else if (pass == 0 && defnameStr == "language") {
  4680. auto langStr = to_lower(TString(StrVal(node->arg)));
  4681. if (langStr == "c") {
  4682. desc.Lang = NPg::LangC;
  4683. } else if (extensionIndex == 0 && langStr == "internal") {
  4684. desc.Lang = NPg::LangInternal;
  4685. } else if (langStr == "sql") {
  4686. desc.Lang = NPg::LangSQL;
  4687. } else {
  4688. return false;
  4689. }
  4690. }
  4691. }
  4692. }
  4693. bool hasArgNames = false;
  4694. for (int i = 0; i < ListLength(value->parameters); ++i) {
  4695. auto node = LIST_CAST_NTH(FunctionParameter, value->parameters, i);
  4696. hasArgNames = hasArgNames || (node->name != nullptr);
  4697. if (node->mode == FUNC_PARAM_IN || node->mode == FUNC_PARAM_DEFAULT) {
  4698. if (node->defexpr) {
  4699. desc.DefaultArgs.emplace_back();
  4700. auto& value = desc.DefaultArgs.back();
  4701. auto expr = node->defexpr;
  4702. if (NodeTag(expr) == T_TypeCast) {
  4703. expr = CAST_NODE(TypeCast, expr)->arg;
  4704. }
  4705. if (NodeTag(expr) != T_A_Const) {
  4706. return false;
  4707. }
  4708. auto pgConst = GetValueNType(CAST_NODE(A_Const, expr));
  4709. if (!pgConst) {
  4710. return false;
  4711. }
  4712. value = pgConst->value;
  4713. } else {
  4714. Y_ENSURE(desc.DefaultArgs.empty());
  4715. }
  4716. desc.InputArgNames.push_back(node->name ? node->name : "");
  4717. } else if (node->mode == FUNC_PARAM_OUT) {
  4718. desc.OutputArgNames.push_back(node->name ? node->name : "");
  4719. } else if (node->mode == FUNC_PARAM_VARIADIC) {
  4720. desc.VariadicArgName = node->name ? node->name : "";
  4721. } else {
  4722. return false;
  4723. }
  4724. TString argTypeStr;
  4725. if (!ParseTypeName(node->argType, argTypeStr)) {
  4726. return false;
  4727. }
  4728. if (builder) {
  4729. builder->PrepareType(extensionIndex, argTypeStr);
  4730. }
  4731. const auto& argTypeDesc = NPg::LookupType(argTypeStr);
  4732. if (node->mode == FUNC_PARAM_IN || node->mode == FUNC_PARAM_DEFAULT) {
  4733. desc.ArgTypes.push_back(argTypeDesc.TypeId);
  4734. } else if (node->mode == FUNC_PARAM_VARIADIC) {
  4735. desc.VariadicType = (argTypeDesc.ArrayTypeId == argTypeDesc.TypeId) ? argTypeDesc.ElementTypeId : argTypeDesc.TypeId;
  4736. desc.VariadicArgType = argTypeDesc.TypeId;
  4737. } else if (node->mode == FUNC_PARAM_OUT) {
  4738. desc.OutputArgTypes.push_back(argTypeDesc.TypeId);
  4739. }
  4740. }
  4741. if (!hasArgNames) {
  4742. desc.InputArgNames.clear();
  4743. desc.VariadicArgName.clear();
  4744. desc.OutputArgNames.clear();
  4745. }
  4746. if (desc.Lang == NPg::LangSQL) {
  4747. auto parser = NPg::GetSqlLanguageParser();
  4748. if (!value->sql_body) {
  4749. if (parser) {
  4750. parser->Parse(desc.Src, desc);
  4751. } else {
  4752. return false;
  4753. }
  4754. } else {
  4755. if (parser) {
  4756. parser->ParseNode(value->sql_body, desc);
  4757. } else {
  4758. return false;
  4759. }
  4760. }
  4761. if (!desc.ExprNode) {
  4762. return false;
  4763. }
  4764. }
  4765. return true;
  4766. }
  4767. class TExtensionHandler : public IPGParseEvents {
  4768. public:
  4769. TExtensionHandler(ui32 extensionIndex, NYql::NPg::IExtensionSqlBuilder& builder)
  4770. : ExtensionIndex(extensionIndex)
  4771. , Builder(builder)
  4772. {}
  4773. void OnResult(const List* raw) final {
  4774. for (int i = 0; i < ListLength(raw); ++i) {
  4775. if (!ParseRawStmt(LIST_CAST_NTH(RawStmt, raw, i))) {
  4776. continue;
  4777. }
  4778. }
  4779. }
  4780. void OnError(const TIssue& issue) final {
  4781. throw yexception() << "Can't parse extension DDL: " << issue.ToString();
  4782. }
  4783. [[nodiscard]]
  4784. bool ParseRawStmt(const RawStmt* value) {
  4785. auto node = value->stmt;
  4786. switch (NodeTag(node)) {
  4787. case T_CreateFunctionStmt:
  4788. return ParseCreateFunctionStmt(CAST_NODE(CreateFunctionStmt, node));
  4789. case T_DefineStmt:
  4790. return ParseDefineStmt(CAST_NODE(DefineStmt, node));
  4791. case T_CreateStmt:
  4792. return ParseCreateStmt(CAST_NODE(CreateStmt, node));
  4793. case T_InsertStmt:
  4794. return ParseInsertStmt(CAST_NODE(InsertStmt, node));
  4795. case T_CreateCastStmt:
  4796. return ParseCreateCastStmt(CAST_NODE(CreateCastStmt, node));
  4797. case T_CreateOpClassStmt:
  4798. return ParseCreateOpClassStmt(CAST_NODE(CreateOpClassStmt, node));
  4799. default:
  4800. return false;
  4801. }
  4802. }
  4803. [[nodiscard]]
  4804. bool ParseDefineStmt(const DefineStmt* value) {
  4805. switch (value->kind) {
  4806. case OBJECT_TYPE:
  4807. return ParseDefineType(value);
  4808. case OBJECT_OPERATOR:
  4809. return ParseDefineOperator(value);
  4810. case OBJECT_AGGREGATE:
  4811. return ParseDefineAggregate(value);
  4812. default:
  4813. return false;
  4814. }
  4815. }
  4816. [[nodiscard]]
  4817. bool ParseDefineType(const DefineStmt* value) {
  4818. if (ListLength(value->defnames) != 1) {
  4819. return false;
  4820. }
  4821. auto nameNode = ListNodeNth(value->defnames, 0);
  4822. auto name = to_lower(TString(StrVal(nameNode)));
  4823. Builder.PrepareType(ExtensionIndex, name);
  4824. NPg::TTypeDesc desc = NPg::LookupType(name);
  4825. for (int i = 0; i < ListLength(value->definition); ++i) {
  4826. auto node = LIST_CAST_NTH(DefElem, value->definition, i);
  4827. auto defnameStr = to_lower(TString(node->defname));
  4828. if (defnameStr == "internallength") {
  4829. if (NodeTag(node->arg) == T_Integer) {
  4830. desc.TypeLen = IntVal(node->arg);
  4831. } else if (NodeTag(node->arg) == T_TypeName) {
  4832. TString value;
  4833. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4834. return false;
  4835. }
  4836. if (value == "variable") {
  4837. desc.TypeLen = -1;
  4838. } else {
  4839. return false;
  4840. }
  4841. } else {
  4842. return false;
  4843. }
  4844. } else if (defnameStr == "alignment") {
  4845. if (NodeTag(node->arg) != T_TypeName) {
  4846. return false;
  4847. }
  4848. TString value;
  4849. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4850. return false;
  4851. }
  4852. if (value == "double") {
  4853. desc.TypeAlign = 'd';
  4854. } else if (value == "int") {
  4855. desc.TypeAlign = 'i';
  4856. } else if (value == "short") {
  4857. desc.TypeAlign = 's';
  4858. } else if (value == "char") {
  4859. desc.TypeAlign = 'c';
  4860. } else {
  4861. throw yexception() << "Unsupported alignment: " << value;
  4862. }
  4863. } else if (defnameStr == "input") {
  4864. if (NodeTag(node->arg) != T_TypeName) {
  4865. return false;
  4866. }
  4867. TString value;
  4868. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4869. return false;
  4870. }
  4871. try {
  4872. desc.InFuncId = NPg::LookupProc(value, {NPg::LookupType("cstring").TypeId}).ProcId;
  4873. } catch (const yexception&) {
  4874. desc.InFuncId = NPg::LookupProc(value, {
  4875. NPg::LookupType("cstring").TypeId,
  4876. NPg::LookupType("oid").TypeId,
  4877. NPg::LookupType("integer").TypeId
  4878. }).ProcId;
  4879. }
  4880. } else if (defnameStr == "output") {
  4881. if (NodeTag(node->arg) != T_TypeName) {
  4882. return false;
  4883. }
  4884. TString value;
  4885. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4886. return false;
  4887. }
  4888. desc.OutFuncId = NPg::LookupProc(value, {desc.TypeId}).ProcId;
  4889. } else if (defnameStr == "send") {
  4890. if (NodeTag(node->arg) != T_TypeName) {
  4891. return false;
  4892. }
  4893. TString value;
  4894. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4895. return false;
  4896. }
  4897. desc.SendFuncId = NPg::LookupProc(value, {desc.TypeId}).ProcId;
  4898. } else if (defnameStr == "receive") {
  4899. if (NodeTag(node->arg) != T_TypeName) {
  4900. return false;
  4901. }
  4902. TString value;
  4903. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4904. return false;
  4905. }
  4906. try {
  4907. desc.ReceiveFuncId = NPg::LookupProc(value, {NPg::LookupType("internal").TypeId}).ProcId;
  4908. } catch (const yexception&) {
  4909. desc.ReceiveFuncId = NPg::LookupProc(value, {
  4910. NPg::LookupType("internal").TypeId,
  4911. NPg::LookupType("oid").TypeId,
  4912. NPg::LookupType("integer").TypeId
  4913. }).ProcId;
  4914. }
  4915. } else if (defnameStr == "delimiter") {
  4916. if (NodeTag(node->arg) != T_String) {
  4917. return false;
  4918. }
  4919. TString value(StrVal(node->arg));
  4920. Y_ENSURE(value.size() == 1);
  4921. desc.TypeDelim = value[0];
  4922. } else if (defnameStr == "typmod_in") {
  4923. if (NodeTag(node->arg) != T_TypeName) {
  4924. return false;
  4925. }
  4926. TString value;
  4927. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4928. return false;
  4929. }
  4930. desc.TypeModInFuncId = NPg::LookupProc(value, {NPg::LookupType("_cstring").TypeId}).ProcId;
  4931. } else if (defnameStr == "typmod_out") {
  4932. if (NodeTag(node->arg) != T_TypeName) {
  4933. return false;
  4934. }
  4935. TString value;
  4936. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4937. return false;
  4938. }
  4939. desc.TypeModInFuncId = NPg::LookupProc(value, {NPg::LookupType("int4").TypeId}).ProcId;
  4940. }
  4941. }
  4942. if (desc.TypeLen >= 0 && desc.TypeLen <= 8) {
  4943. desc.PassByValue = true;
  4944. }
  4945. Builder.UpdateType(desc);
  4946. return true;
  4947. }
  4948. [[nodiscard]]
  4949. bool ParseDefineOperator(const DefineStmt* value) {
  4950. if (ListLength(value->defnames) != 1) {
  4951. return false;
  4952. }
  4953. auto nameNode = ListNodeNth(value->defnames, 0);
  4954. auto name = to_lower(TString(StrVal(nameNode)));
  4955. TString procedureName;
  4956. TString commutator;
  4957. TString negator;
  4958. ui32 leftType = 0;
  4959. ui32 rightType = 0;
  4960. for (int i = 0; i < ListLength(value->definition); ++i) {
  4961. auto node = LIST_CAST_NTH(DefElem, value->definition, i);
  4962. auto defnameStr = to_lower(TString(node->defname));
  4963. if (defnameStr == "leftarg") {
  4964. if (NodeTag(node->arg) != T_TypeName) {
  4965. return false;
  4966. }
  4967. TString value;
  4968. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4969. return false;
  4970. }
  4971. leftType = NPg::LookupType(value).TypeId;
  4972. } else if (defnameStr == "rightarg") {
  4973. if (NodeTag(node->arg) != T_TypeName) {
  4974. return false;
  4975. }
  4976. TString value;
  4977. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4978. return false;
  4979. }
  4980. rightType = NPg::LookupType(value).TypeId;
  4981. } else if (defnameStr == "procedure") {
  4982. if (NodeTag(node->arg) != T_TypeName) {
  4983. return false;
  4984. }
  4985. TString value;
  4986. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  4987. return false;
  4988. }
  4989. procedureName = value;
  4990. } else if (defnameStr == "commutator") {
  4991. if (NodeTag(node->arg) != T_String) {
  4992. return false;
  4993. }
  4994. commutator = StrVal(node->arg);
  4995. } else if (defnameStr == "negator") {
  4996. if (NodeTag(node->arg) != T_String) {
  4997. return false;
  4998. }
  4999. negator = StrVal(node->arg);
  5000. }
  5001. }
  5002. if (!leftType) {
  5003. return false;
  5004. }
  5005. if (procedureName.empty()) {
  5006. return false;
  5007. }
  5008. TVector<ui32> args;
  5009. args.push_back(leftType);
  5010. if (rightType) {
  5011. args.push_back(rightType);
  5012. }
  5013. Builder.PrepareOper(ExtensionIndex, name, args);
  5014. auto desc = NPg::LookupOper(name, args);
  5015. if (!commutator.empty()) {
  5016. TVector<ui32> commArgs;
  5017. commArgs.push_back(rightType);
  5018. commArgs.push_back(leftType);
  5019. Builder.PrepareOper(ExtensionIndex, commutator, commArgs);
  5020. desc.ComId = NPg::LookupOper(commutator, commArgs).OperId;
  5021. }
  5022. if (!negator.empty()) {
  5023. Builder.PrepareOper(ExtensionIndex, negator, args);
  5024. desc.NegateId = NPg::LookupOper(negator, args).OperId;
  5025. }
  5026. const auto& procDesc = NPg::LookupProc(procedureName, args);
  5027. desc.ProcId = procDesc.ProcId;
  5028. desc.ResultType = procDesc.ResultType;
  5029. Builder.UpdateOper(desc);
  5030. return true;
  5031. }
  5032. [[nodiscard]]
  5033. bool ParseDefineAggregate(const DefineStmt* value) {
  5034. if (ListLength(value->defnames) != 1) {
  5035. return false;
  5036. }
  5037. auto nameNode = ListNodeNth(value->defnames, 0);
  5038. auto name = to_lower(TString(StrVal(nameNode)));
  5039. TString sfunc;
  5040. ui32 stype = 0;
  5041. TString combinefunc;
  5042. TString finalfunc;
  5043. TString serialfunc;
  5044. TString deserialfunc;
  5045. bool hypothetical = false;
  5046. for (int i = 0; i < ListLength(value->definition); ++i) {
  5047. auto node = LIST_CAST_NTH(DefElem, value->definition, i);
  5048. auto defnameStr = to_lower(TString(node->defname));
  5049. if (defnameStr == "sfunc") {
  5050. if (NodeTag(node->arg) != T_TypeName) {
  5051. return false;
  5052. }
  5053. TString value;
  5054. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  5055. return false;
  5056. }
  5057. sfunc = value;
  5058. } else if (defnameStr == "stype") {
  5059. if (NodeTag(node->arg) != T_TypeName) {
  5060. return false;
  5061. }
  5062. TString value;
  5063. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  5064. return false;
  5065. }
  5066. stype = NPg::LookupType(value).TypeId;
  5067. } else if (defnameStr == "combinefunc") {
  5068. if (NodeTag(node->arg) != T_TypeName) {
  5069. return false;
  5070. }
  5071. TString value;
  5072. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  5073. return false;
  5074. }
  5075. combinefunc = value;
  5076. } else if (defnameStr == "finalfunc") {
  5077. if (NodeTag(node->arg) != T_TypeName) {
  5078. return false;
  5079. }
  5080. TString value;
  5081. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  5082. return false;
  5083. }
  5084. finalfunc = value;
  5085. } else if (defnameStr == "serialfunc") {
  5086. if (NodeTag(node->arg) != T_TypeName) {
  5087. return false;
  5088. }
  5089. TString value;
  5090. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  5091. return false;
  5092. }
  5093. serialfunc = value;
  5094. } else if (defnameStr == "deserialfunc") {
  5095. if (NodeTag(node->arg) != T_TypeName) {
  5096. return false;
  5097. }
  5098. TString value;
  5099. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node->arg), value)) {
  5100. return false;
  5101. }
  5102. deserialfunc = value;
  5103. } else if (defnameStr == "hypothetical") {
  5104. if (NodeTag(node->arg) != T_Boolean) {
  5105. return false;
  5106. }
  5107. if (BoolVal(node->arg)) {
  5108. hypothetical = true;
  5109. }
  5110. }
  5111. }
  5112. if (!sfunc || !stype) {
  5113. return false;
  5114. }
  5115. NPg::TAggregateDesc desc;
  5116. desc.Name = name;
  5117. desc.ExtensionIndex = ExtensionIndex;
  5118. if (ListLength(value->args) != 2) {
  5119. return false;
  5120. }
  5121. auto numDirectArgs = intVal(lsecond(value->args));
  5122. if (numDirectArgs >= 0) {
  5123. desc.NumDirectArgs = numDirectArgs;
  5124. desc.Kind = NPg::EAggKind::OrderedSet;
  5125. Y_ENSURE(!hypothetical);
  5126. } else if (hypothetical) {
  5127. desc.Kind = NPg::EAggKind::Hypothetical;
  5128. }
  5129. auto args = linitial_node(List, value->args);
  5130. for (int i = 0; i < ListLength(args); ++i) {
  5131. auto node = LIST_CAST_NTH(FunctionParameter, args, i);
  5132. if (node->mode == FUNC_PARAM_IN || node->mode == FUNC_PARAM_DEFAULT) {
  5133. if (node->defexpr) {
  5134. return false;
  5135. }
  5136. } else {
  5137. return false;
  5138. }
  5139. TString argTypeStr;
  5140. if (!ParseTypeName(node->argType, argTypeStr)) {
  5141. return false;
  5142. }
  5143. Builder.PrepareType(ExtensionIndex, argTypeStr);
  5144. auto argTypeId = NPg::LookupType(argTypeStr).TypeId;
  5145. desc.ArgTypes.push_back(argTypeId);
  5146. }
  5147. desc.TransTypeId = stype;
  5148. TVector<ui32> stateWithArgs;
  5149. stateWithArgs.push_back(stype);
  5150. stateWithArgs.insert(stateWithArgs.end(), desc.ArgTypes.begin(), desc.ArgTypes.end());
  5151. desc.TransFuncId = NPg::LookupProc(sfunc, stateWithArgs).ProcId;
  5152. if (!finalfunc.empty()) {
  5153. desc.FinalFuncId = NPg::LookupProc(finalfunc, { stype }).ProcId;
  5154. }
  5155. if (!combinefunc.empty()) {
  5156. desc.CombineFuncId = NPg::LookupProc(combinefunc, { stype, stype }).ProcId;
  5157. }
  5158. if (!serialfunc.empty()) {
  5159. const auto& procDesc = NPg::LookupProc(serialfunc, { stype });
  5160. Y_ENSURE(procDesc.ResultType == NPg::LookupType("bytea").TypeId);
  5161. desc.SerializeFuncId = procDesc.ProcId;
  5162. }
  5163. if (!deserialfunc.empty()) {
  5164. Y_ENSURE(!serialfunc.empty());
  5165. const auto& procDesc = NPg::LookupProc(deserialfunc, { NPg::LookupType("bytea").TypeId, stype });
  5166. Y_ENSURE(procDesc.ResultType == stype);
  5167. desc.DeserializeFuncId = procDesc.ProcId;
  5168. }
  5169. Builder.CreateAggregate(desc);
  5170. return true;
  5171. }
  5172. [[nodiscard]]
  5173. bool ParseCreateFunctionStmt(const CreateFunctionStmt* value) {
  5174. NYql::NPg::TProcDesc desc;
  5175. if (!ParseCreateFunctionStmtImpl(value, ExtensionIndex, &Builder, desc)) {
  5176. return false;
  5177. }
  5178. Builder.CreateProc(desc);
  5179. return true;
  5180. }
  5181. [[nodiscard]]
  5182. bool ParseCreateStmt(const CreateStmt* value) {
  5183. NPg::TTableInfo table;
  5184. table.Schema = "pg_catalog";
  5185. table.Name = value->relation->relname;
  5186. table.Kind = NPg::ERelKind::Relation;
  5187. table.ExtensionIndex = ExtensionIndex;
  5188. TVector<NPg::TColumnInfo> columns;
  5189. for (int i = 0; i < ListLength(value->tableElts); ++i) {
  5190. auto node = ListNodeNth(value->tableElts, i);
  5191. if (NodeTag(node) != T_ColumnDef) {
  5192. continue;
  5193. }
  5194. auto columnDef = CAST_NODE(ColumnDef, node);
  5195. NPg::TColumnInfo column;
  5196. column.Schema = table.Schema;
  5197. column.TableName = table.Name;
  5198. column.Name = columnDef->colname;
  5199. column.ExtensionIndex = ExtensionIndex;
  5200. Y_ENSURE(ParseTypeName(columnDef->typeName, column.UdtType));
  5201. columns.push_back(column);
  5202. }
  5203. Builder.CreateTable(table, columns);
  5204. return true;
  5205. }
  5206. [[nodiscard]]
  5207. bool ParseInsertStmt(const InsertStmt* value) {
  5208. TString tableName = value->relation->relname;
  5209. TVector<TString> colNames;
  5210. for (int i = 0; i < ListLength(value->cols); ++i) {
  5211. auto node = LIST_CAST_NTH(ResTarget, value->cols, i);
  5212. colNames.push_back(node->name);
  5213. }
  5214. auto select = CAST_NODE(SelectStmt, value->selectStmt);
  5215. int rows = ListLength(select->valuesLists);
  5216. if (!rows) {
  5217. return false;
  5218. }
  5219. int cols = ListLength(CAST_NODE(List, ListNodeNth(select->valuesLists, 0)));
  5220. TVector<TMaybe<TString>> data;
  5221. data.reserve(rows * cols);
  5222. for (int rowIdx = 0; rowIdx < rows; ++rowIdx) {
  5223. const auto rawRow = CAST_NODE(List, ListNodeNth(select->valuesLists, rowIdx));
  5224. for (int colIdx = 0; colIdx < ListLength(rawRow); ++colIdx) {
  5225. const auto rawCell = ListNodeNth(rawRow, colIdx);
  5226. if (NodeTag(rawCell) != T_A_Const) {
  5227. return false;
  5228. }
  5229. auto pgConst = GetValueNType(CAST_NODE(A_Const, rawCell));
  5230. if (!pgConst) {
  5231. return false;
  5232. }
  5233. data.push_back(pgConst->value);
  5234. }
  5235. }
  5236. Builder.InsertValues(NPg::TTableInfoKey{"pg_catalog", tableName}, colNames, data);
  5237. return true;
  5238. }
  5239. [[nodiscard]]
  5240. bool ParseCreateCastStmt(const CreateCastStmt* value) {
  5241. TString sourceType;
  5242. if (!ParseTypeName(value->sourcetype, sourceType)) {
  5243. return false;
  5244. }
  5245. TString targetType;
  5246. if (!ParseTypeName(value->targettype, targetType)) {
  5247. return false;
  5248. }
  5249. NPg::TCastDesc desc;
  5250. desc.ExtensionIndex = ExtensionIndex;
  5251. desc.SourceId = NPg::LookupType(sourceType).TypeId;
  5252. desc.TargetId = NPg::LookupType(targetType).TypeId;
  5253. if (value->func) {
  5254. if (ListLength(value->func->objname) != 1) {
  5255. return false;
  5256. }
  5257. TString funcName = StrVal(ListNodeNth(value->func->objname, 0));
  5258. TVector<ui32> argTypes;
  5259. for (int i = 0; i < ListLength(value->func->objargs); ++i) {
  5260. auto node = ListNodeNth(value->func->objargs, i);
  5261. if (NodeTag(node) != T_TypeName) {
  5262. return false;
  5263. }
  5264. TString value;
  5265. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, node), value)) {
  5266. return false;
  5267. }
  5268. argTypes.push_back(NPg::LookupType(value).TypeId);
  5269. }
  5270. desc.FunctionId = NPg::LookupProc(funcName, argTypes).ProcId;
  5271. } else if (value->inout) {
  5272. desc.Method = NPg::ECastMethod::InOut;
  5273. } else {
  5274. desc.Method = NPg::ECastMethod::Binary;
  5275. }
  5276. switch (value->context) {
  5277. case COERCION_IMPLICIT:
  5278. desc.CoercionCode = NPg::ECoercionCode::Implicit;
  5279. break;
  5280. case COERCION_ASSIGNMENT:
  5281. desc.CoercionCode = NPg::ECoercionCode::Assignment;
  5282. break;
  5283. case COERCION_EXPLICIT:
  5284. desc.CoercionCode = NPg::ECoercionCode::Explicit;
  5285. break;
  5286. default:
  5287. return false;
  5288. }
  5289. Builder.CreateCast(desc);
  5290. return true;
  5291. }
  5292. [[nodiscard]]
  5293. bool ParseCreateOpClassStmt(const CreateOpClassStmt* value) {
  5294. if (!value->isDefault) {
  5295. return false;
  5296. }
  5297. if (ListLength(value->opclassname) != 1) {
  5298. return false;
  5299. }
  5300. auto opClassName = to_lower(TString(StrVal(ListNodeNth(value->opclassname, 0))));
  5301. if (ListLength(value->opfamilyname) > 1) {
  5302. return false;
  5303. }
  5304. TString familyName;
  5305. if (ListLength(value->opfamilyname) == 1) {
  5306. familyName = to_lower(TString(StrVal(ListNodeNth(value->opfamilyname, 0))));
  5307. }
  5308. auto amName = to_lower(TString(value->amname));
  5309. NPg::EOpClassMethod method;
  5310. if (amName == "btree") {
  5311. method = NPg::EOpClassMethod::Btree;
  5312. } else if (amName == "hash") {
  5313. method = NPg::EOpClassMethod::Hash;
  5314. } else {
  5315. return false;
  5316. }
  5317. TString dataType;
  5318. if (!ParseTypeName(value->datatype, dataType)) {
  5319. return false;
  5320. }
  5321. auto typeId = NPg::LookupType(dataType).TypeId;
  5322. NPg::TOpClassDesc desc;
  5323. desc.ExtensionIndex = ExtensionIndex;
  5324. desc.Method = method;
  5325. desc.TypeId = typeId;
  5326. desc.Name = opClassName;
  5327. if (familyName.empty()) {
  5328. familyName = amName + "/" + opClassName;
  5329. }
  5330. desc.Family = familyName;
  5331. TVector<NPg::TAmOpDesc> ops;
  5332. TVector<NPg::TAmProcDesc> procs;
  5333. for (int i = 0; i < ListLength(value->items); ++i) {
  5334. auto node = LIST_CAST_NTH(CreateOpClassItem, value->items, i);
  5335. if (node->itemtype != OPCLASS_ITEM_OPERATOR && node->itemtype != OPCLASS_ITEM_FUNCTION) {
  5336. continue;
  5337. }
  5338. if (ListLength(node->name->objname) != 1) {
  5339. return false;
  5340. }
  5341. TString funcName = StrVal(ListNodeNth(node->name->objname, 0));
  5342. if (node->itemtype == OPCLASS_ITEM_OPERATOR) {
  5343. NPg::TAmOpDesc amOpDesc;
  5344. amOpDesc.ExtensionIndex = ExtensionIndex;
  5345. amOpDesc.Family = familyName;
  5346. amOpDesc.Strategy = node->number;
  5347. amOpDesc.LeftType = typeId;
  5348. amOpDesc.RightType = typeId;
  5349. amOpDesc.OperId = NPg::LookupOper(funcName, {typeId,typeId}).OperId;
  5350. ops.push_back(amOpDesc);
  5351. } else {
  5352. NPg::TAmProcDesc amProcDesc;
  5353. amProcDesc.ExtensionIndex = ExtensionIndex;
  5354. amProcDesc.Family = familyName;
  5355. amProcDesc.ProcNum = node->number;
  5356. amProcDesc.LeftType = typeId;
  5357. amProcDesc.RightType = typeId;
  5358. TVector<ui32> argTypes;
  5359. for (int i = 0; i < ListLength(node->name->objargs); ++i) {
  5360. auto typeName = ListNodeNth(node->name->objargs, i);
  5361. if (NodeTag(typeName) != T_TypeName) {
  5362. return false;
  5363. }
  5364. TString value;
  5365. if (!ParseTypeName(CAST_NODE_EXT(PG_TypeName, T_TypeName, typeName), value)) {
  5366. return false;
  5367. }
  5368. argTypes.push_back(NPg::LookupType(value).TypeId);
  5369. }
  5370. amProcDesc.ProcId = NPg::LookupProc(funcName, argTypes).ProcId;
  5371. procs.push_back(amProcDesc);
  5372. }
  5373. }
  5374. Builder.CreateOpClass(desc, ops, procs);
  5375. return true;
  5376. }
  5377. private:
  5378. const ui32 ExtensionIndex;
  5379. NYql::NPg::IExtensionSqlBuilder& Builder;
  5380. };
  5381. class TExtensionSqlParser : public NYql::NPg::IExtensionSqlParser {
  5382. public:
  5383. void Parse(ui32 extensionIndex, const TVector<TString>& sqls, NYql::NPg::IExtensionSqlBuilder& builder) final {
  5384. TExtensionHandler handler(extensionIndex, builder);
  5385. for (const auto& sql : sqls) {
  5386. NYql::PGParse(sql, handler);
  5387. }
  5388. NKikimr::NMiniKQL::RebuildTypeIndex();
  5389. }
  5390. };
  5391. class TSystemFunctionsHandler : public IPGParseEvents {
  5392. public:
  5393. TSystemFunctionsHandler(TVector<NPg::TProcDesc>& procs)
  5394. : Procs(procs)
  5395. {}
  5396. void OnResult(const List* raw) final {
  5397. for (int i = 0; i < ListLength(raw); ++i) {
  5398. if (!ParseRawStmt(LIST_CAST_NTH(RawStmt, raw, i))) {
  5399. continue;
  5400. }
  5401. }
  5402. }
  5403. void OnError(const TIssue& issue) final {
  5404. throw yexception() << "Can't parse system functions: " << issue.ToString();
  5405. }
  5406. [[nodiscard]]
  5407. bool ParseRawStmt(const RawStmt* value) {
  5408. auto node = value->stmt;
  5409. switch (NodeTag(node)) {
  5410. case T_CreateFunctionStmt:
  5411. return ParseCreateFunctionStmt(CAST_NODE(CreateFunctionStmt, node));
  5412. default:
  5413. return false;
  5414. }
  5415. }
  5416. [[nodiscard]]
  5417. bool ParseCreateFunctionStmt(const CreateFunctionStmt* value) {
  5418. NYql::NPg::TProcDesc desc;
  5419. if (!ParseCreateFunctionStmtImpl(value, 0, nullptr, desc)) {
  5420. return false;
  5421. }
  5422. Procs.push_back(desc);
  5423. return true;
  5424. }
  5425. private:
  5426. TVector<NPg::TProcDesc>& Procs;
  5427. };
  5428. class TSystemFunctionsParser : public NYql::NPg::ISystemFunctionsParser {
  5429. public:
  5430. void Parse(const TString& sql, TVector<NPg::TProcDesc>& procs) const final {
  5431. TSystemFunctionsHandler handler(procs);
  5432. NYql::PGParse(sql, handler);
  5433. }
  5434. };
  5435. class TSqlLanguageParser : public NYql::NPg::ISqlLanguageParser, public IPGParseEvents {
  5436. public:
  5437. TSqlLanguageParser() {
  5438. Settings.ClusterMapping["pg_catalog"] = TString(PgProviderName);
  5439. Settings.Mode = NSQLTranslation::ESqlMode::LIMITED_VIEW;
  5440. }
  5441. void Parse(const TString& sql, NPg::TProcDesc& proc) final {
  5442. Y_ENSURE(!FreezeGuard.Defined());
  5443. CurrentProc = &proc;
  5444. NYql::PGParse(sql, *this);
  5445. CurrentProc = nullptr;
  5446. }
  5447. void ParseNode(const Node* stmt, NPg::TProcDesc& proc) final {
  5448. Y_ENSURE(!FreezeGuard.Defined());
  5449. proc.ExprNode = nullptr;
  5450. if (proc.VariadicType) {
  5451. // Can't be expressed as usual lambda
  5452. return;
  5453. }
  5454. TVector<NYql::TAstParseResult> results(1);
  5455. results[0].Pool = std::make_unique<TMemoryPool>(4096);
  5456. TVector<TStmtParseInfo> stmtParseInfos(1);
  5457. TConverter converter(results, Settings, "", &stmtParseInfos, false, proc.ArgTypes.size());
  5458. converter.PrepareStatements();
  5459. TAstNode* root = nullptr;
  5460. switch (NodeTag(stmt)) {
  5461. case T_SelectStmt:
  5462. root = converter.ParseSelectStmt(CAST_NODE(SelectStmt, stmt), {.Inner = false});
  5463. break;
  5464. case T_ReturnStmt:
  5465. root = converter.ParseReturnStmt(CAST_NODE(ReturnStmt, stmt));
  5466. break;
  5467. default:
  5468. return;
  5469. }
  5470. if (!root) {
  5471. //Cerr << "Can't parse SQL for function: " << proc.Name << ", " << results[0].Issues.ToString();
  5472. return;
  5473. }
  5474. root = converter.L(converter.A("block"), converter.Q(converter.FinishStatements()));
  5475. if (NodeTag(stmt) == T_SelectStmt) {
  5476. root = converter.AsScalarContext(root);
  5477. }
  5478. TVector<TAstNode*> args;
  5479. for (ui32 i = 0; i < proc.ArgTypes.size(); ++i) {
  5480. args.push_back(converter.A("$p" + ToString(i + 1)));
  5481. }
  5482. root = converter.MakeLambda(args, root);
  5483. auto program = converter.L(converter.L(converter.A("return"), root));
  5484. TExprNode::TPtr graph;
  5485. Ctx.IssueManager.Reset();
  5486. if (!CompileExpr(*program, graph, Ctx, nullptr, nullptr, false, Max<ui32>(), 1)) {
  5487. Cerr << "Can't compile SQL for function: " << proc.Name << ", " << Ctx.IssueManager.GetIssues().ToString();
  5488. return;
  5489. }
  5490. SavedNodes.push_back(graph);
  5491. proc.ExprNode = graph.Get();
  5492. }
  5493. void Freeze() final {
  5494. Y_ENSURE(!FreezeGuard.Defined());
  5495. FreezeGuard.ConstructInPlace(Ctx);
  5496. }
  5497. TExprContext& GetContext() final {
  5498. Y_ENSURE(FreezeGuard.Defined());
  5499. return Ctx;
  5500. }
  5501. void OnResult(const List* raw) final {
  5502. if (ListLength(raw) == 1) {
  5503. ParseNode(LIST_CAST_NTH(RawStmt, raw, 0)->stmt, *CurrentProc);
  5504. }
  5505. }
  5506. void OnError(const TIssue& issue) final {
  5507. throw yexception() << "Can't parse SQL for function: " << CurrentProc->Name << ", " << issue.ToString();
  5508. }
  5509. private:
  5510. NSQLTranslation::TTranslationSettings Settings;
  5511. TExprContext Ctx;
  5512. TVector<TExprNode::TPtr> SavedNodes;
  5513. TMaybe<TExprContext::TFreezeGuard> FreezeGuard;
  5514. NPg::TProcDesc* CurrentProc = nullptr;
  5515. };
  5516. std::unique_ptr<NPg::IExtensionSqlParser> CreateExtensionSqlParser() {
  5517. return std::make_unique<TExtensionSqlParser>();
  5518. }
  5519. std::unique_ptr<NYql::NPg::ISystemFunctionsParser> CreateSystemFunctionsParser() {
  5520. return std::make_unique<TSystemFunctionsParser>();
  5521. }
  5522. std::unique_ptr<NYql::NPg::ISqlLanguageParser> CreateSqlLanguageParser() {
  5523. return std::make_unique<TSqlLanguageParser>();
  5524. }
  5525. } // NSQLTranslationPG