ÿØÿà JFIF    ÿÛ „ !.%+&8&+/1555$;@;4?.451 4,$,44444444444414444444444444444444444444444444444444ÿÀ  á á" ÿÄ     ÿÄ ?    !1AQaq"2‘¡±ÁðBRbrÑá#‚’¢²3S CñÿÄ   ÿÄ !    !1QAa‘2ÿÚ   ? 5˜Z¯V¦cø)›t/? z¨±>Õ5€¶‹Á¤·¼z¼Ü¬+ñ®v¤¨_ˆR­BFn©—˜ý®ç̝P8gýt·ÉSTŦˆìät?þé¼íìN/Þa)ì–í6ô… Ï¿øÃj´¿KÇü]ÿ ªô¹-eKànëÕHTx}ýSÜ›ÿ ”7Ø×&µ<¦  ¥ÑO¶[Ù¯ä¨ÞÃÿ PZ-¬;#õ|•oaÿ ©CìÞz3˜öː/¤­ñTûIØ}š^ mÓ%ªxˆ¥ÉŸu=Z+ISe¿45™¼u;ú&WØ÷€æßQ™®{|íx*TC“#ZŠìZ§²‹ 6pv…³¿¡äª*áZÐ%ÒOáˆo"x«OHk w±æ+¬V(kMúŸ5Vö«$ ÁrÏbàb57/luR ¸ÑÛj Òµì`Ðœq­û žICÀÊ•©4€Âcà¨Ï€O´<èÐ:›ù(Ë^L8þ‘ÍÌ#¸Ð_Ì©ÙK(Öz 4¬û+¸;ü’V’84‘¬ÃŽ:[â‡ÔÌáõp¢~§ªlæ£ö{®G>J¼"°‡7¯ÆÉèßû ‹É‹§ÁòÃýâßî ^ƾÙõ‹×óH#«LP½ïX=xÑÍ$|W?•~• îëÔ©ª‹ {ÝT…Kÿ ”hûâá)J*ö˜–ÔU;iÇ€/ ÆþjóZ\ýwØ=Ìm ºèËL9 ýèÆð/¨’¥öo=nË.%Îì ŽÕ¯È|{Oj²ƒE6e/ßdÄõ²Ìâ1O®ò×TsəԸhOMýíMˆ¿¼H˜l²,7Â¥#MF/Úf°Ö½± ¸–dr‹NýÊ íjqx{œÉ ä-È ¦ øÄër¨q°ð †nцýÑÄÆ’mä…n<0È™;ÁÝá¯ÁZƒ7FÀmì­ É&9ˆîéi¶ùN§Y• ÃZãAâ?•‡©‰ , ó¾IŸŠc1 4â&y­&pŠ­6;M À 0¹qç»p.á …ŸÅáK@%6·y6ƒ‰3?”úºŽ‰éX5ªPT §µ!=Mž«Ú½‹ÅgÂSâÉaþÓoö–¯ÁÔìR>5éÿ üs¶ÆUcÌ kÇR ]ÿ ù¬¼«VŽ;Â|‡~¢¦”ÏÅ°æ {L™Õ°Óv¹ò¸írŽ¡×¢CÃ!íVÕ {¶»sŒNPg/ "uÕbkm²“$ďå¿é¹§°½æz¯6 †s¿!s–wÚÝ“™Œ °.ûj>·+™Òa…©Œ&rÝÎtÛë긪Ît’LAVp%c Úý[ÄzJ¾ÇàXXç@˜ó<êL]·T˜¾¥1Ó©V‡g´æ½¦Ý@¹óø!_@´ÞâSÁ —S3™•& ]@JHÚý©ZŽ €×æÔr»Áf!‡yÞ4Mv*èÓã_{‘åóUuљØ«Oïé*®EvÑ Œ÷‡U \"㪒ÍK+À 4“M¡ï:0¥5í!'<@î´”>Ç»&Z–ïCCV˜Ì5Šo&îhè.žû |ÓK©h$s6KìŒëã)¹hI¦GïOåóI;ììü#É$Š0…Ææ¥TØ.5­¾gn´ “ÂÖ\:hœ89G)J@„}œ:’Ò{/Š"¦_Æ×7Æ3VÇŠÊa]ÚŒÙ€Ä–=®uÁßâACZƒ§§£ Qnâ:«,×{tyø¬iÛcœÜÄ€H½ÄÍCk´÷šß .W'b¤Íåh]÷€=,Žv×cÚEÚHXJX¶îo¨FÒtèöŸ>ªª6[J®Fµ£sGÁeqõfe\íjÒÐïÄÐGˆe1Ø‹.Ø”‘Ëuø Y­ˆÜ ŽG|zùªüMpDnQWÄ”%JŠ™)â*p@Örš«ÕT2Ð%ˆG#ª„ ·¤!°ŸOTÂT¸aÚ%4&h™LµšØüÐ.F¿²ÐÞ_Ç‚¾ÅÃaÜ÷09Æ q€öy˜v‡85õN÷]¬äѼóS{°_MŽ¬úÔ#°Ç¸0åÞè2ëôPcvÆw9®ií1Ä8F™˜à‰´+‰Ik1òÝ7“Ñ×ÒsÝ\x‚h`ÞÑ`ó"|µEcý£n˜h`}GÞ !±ù²Ápü²ß6 0ïi󜵩SÈÇ7˜-ÕURO˜¦´f$ªž-Í6(œ}<„ éc øs]ŽŽ„*—¾ ìdŽ„)méª\¿êÎIg¾ØÞ~I#C/¼¼´EÁÈŽi8“©õådô·>euä ƒ'Ê×लR1ÉJE1ÐAát`t;ÇР%Ý<‡¥„ÍÆ`×Oyó)õiI€ñQaŸ4Ûù\áàaÃÔ¹HÃu¹*k€¦<„e S‡&õÏ B!ŽhüÞ`yj}mªf×\¿ Ç~æ­9‡û\՞Ǖg²1Žû5V7 !àöšm° c`ܬøÇìµÒ'P"?…´Ö,"§^•õŽ¨sÔ)6˜sæéÍR¼ ò|Sl”‹7 nPW Gòú÷½§O¯‡„l¡kSÞŒr½PÊ@æ¢pŽ-mÿ #Ÿ˜Àº¶Áä¦;ïÔæ$1££`“Õ>„—·ž)ßð³ñ#Ï Ô$¶œ‰ÊE‹À;÷º ¯«P:Ñ”8–IÊtpÞ3ª“>ê“þës4ò2OÏÕ­±zô†Õ§‰.÷ä¸;¿˜“'œ›žª}«Œ{ª±Ì 9ÔóÞÕ‡0 $íWV3Üì¬ —@kÝ4@¿r¼±½¬™›?øØæ´'Áé®CË3-g$˜ö‡×auÚi´Žp/êÛ æF›Ú2v‹ã¿¿,nB1̨ƃqÞa5͝@&Æû“él÷ \C²½UÍc ¯k×¢U ÖéQå™—-r wô ÞÏ<Ò=&=ÿ Ôê Òêˈt,i—;LîÜ á¸*ÚÃ1$êL•LÍ <É)ýÐà’ ;F™{ƒ™˜€&'}‚ãÄK`¡ÞT@I;®žZóè‚s’7®°›+§O­Åq©é»²9<Ô J ¼9O’HL»Ùïì¸rk¼Ž_ý‘TŸu[²ßÚŒ·ü÷B%¯E ŸÔX5êO´ Ç•€’I0 ÉJX` ñ¹õ%;µŸD‘«´€àwÒ™U ûئžÖö\×®×´8 ½‡ºÐÆÓ§?Àkmœ=;d5*@-ì0F Rªýš[Ü6âö̃ڸr*KA9· u*µæ£?U¸Âêí†8@¦X4 e-ò„0s{ HâUpU?¼mñRa°®a%Ð'tÉ×’\¾ÊÉ]t›h>·(Ë@R¼¡Ãt h}’O÷au<+nT…Ö…MӐ??Óe95 q>í/;&JSû °¯ÊéÞ øƒ*Ã2½Ài&:nôUl=¾¿5eˆ3”ñc|Ú2V”>„»&eE;«ÚäC p¢Û úy 9š[ŒÌx¼擼A&DåÒ¯ˆ¤ÀÌ;"˜ ÏQä¸åhÊ}Ûq«Û0WžÒ|»€ø®öCm5•\ÇÀ§Pe3£]0ÃàLDÉ‰1øªxjgwT‚÷¿LΨK‹›ùs—xˆÜ±µ kæ¸f‰‰ÜGk/LÛØ6d9ò¶ùA{ƒA3š/¬D¬khÓk‰`˜"㯒r¿±Óã jx‡°e}<Ñø\3y:'À•/h½Í€Ç4~g ?Û(¼]v‘ªlKÎâ~?O‚W%{Ì:“'©úNq¾›úo(X’¥¯ˆ nFê{Ç€ü?º'ë ø‹ì Þ09ŒÌç9Æ —ËC`j@ÓÄ(+a‹un¸#ÂꟋ{K`‘ÑÍÍ'à´»/Û,KW;Þ4²þð ï Nm|~fGÏ(…³Ã)«1ö­Õ ¥‡¨©ƒÃ™ü-s=à=U66Ï«Ýc蓦W¹íž®›nÔ%êÇìŒ<#Ü×84ån®Ð ÒåOC` ñânÑs‡¢ç 1õ%Îhì½Ã½® e:ݼUZo™`  ÅZŸŒÊ«ê1ÏÄo$q¹Þ€©ˆhÐÉä¯ñ[!…Ú˜àJ:x2$Íß&PåT£6ç— ‡Í*4Ýšçjÿ ‰É nófÐ ó(L5C•åÆ\rMÒ@ò }y-W}™üýVù—ú¢=Ù”c®‘< M ž ´Phr ¦©TD ‘ù.$´÷O‡‘V2Æò.=IUŒ=ž‡â¬i™aþÓåÙ?òUø'ØÖ•.~* šTŒ!•-×áºTâ®ä#õü'´ eýlYÅÓeÕKÂrT"CÚ@u!Óxƒ{š3€}1¿(r}%«nËamjÑ%ÑNEò v ˜à  σöK³,*º.àzù¨™Ó ÚçâU¦*¿ 9{%Ö¹ njûdaXöb) kÛƱûÓ\°M7ˆÂ=û›ç¿Ã‚­V»Cg–8ÙêE- j)k$º`Ã-ùEýeBÆÇ]c¡°ñty&Òd0nõ'¡W+ƒ*|–øµFa\GQªEAÔp5\Ǽ·¼Ç8·õ -â§Ú[ ‡ uZeÖ 3}×d'+¹:ð+K†Û®s!Ï$úe€<Û”x)1»a­¡LC]¸µík…ÚàA»AYº{†ªS[¦5HÒ7ù --,ísòDØ€èk ÞÀîÜ ò@â( ËNˆë›4ô½•/¦o‡€Û7 ê•ÆêòðÜy'Án½µ á˜ݦ ndeo…[ì¶Ê,¥R³Ä=À±—–ß;£™´ñSâ*g§”ïaið‘Jå~™ÓÞ ß³Õ¢»8x埒²52>AÊb&-÷\7´éÄù€T˜,w;3{ï˜k…à¹ÄqÀ«œ{€\ ˆ¾[´¨јr &Úé„Ívˆ±8†¿]|¬ņ4I×pÞS1ÈÖz‰#Ìv‡G!YNògñ:màTz¢Ý1ô©^O=~ë|5Bã™ç•¼µõ•bÆ@úÕS¬ÈŒ#¬zünrŸ û” Z²•ï›èðV"ÁHÚý©wÝ €7¼Ìu1hÑa3Éä û f$o¿É ™Ú›ÝçnpÒ3äÌ3†Í§,Äï]$‰/pê †«À¼¸e9­Æê_C]žƒ·ý·frÁN«, E=›Çq -‰öŒ:aÏ¿±í&£Í:-} 84‘ÿ eƒQÑeëSsuiA ³g㟥ú£?ÿ ʼn*”“÷aühe:ÊWa@ÒÞk±eØ] F Ô—r.åä˜ @ö¥ªZoÐýYL·¥S²G/‡ñ <~*ZÆ´è>JlòàÛƽÿ 窘ìGN¢:I®KšJp/`íIÁÀõ#Ä-€ö­šµŒoF4|ÆQØÆ@Ì|£Ô…¢À{9˜è½Üó›€ôYÒÎYsið;ís¤€à²ˆ‚4qÉVŒI$ ‰"° æµ8cXGjœˏ¡Aâý•ËÜ¢ûï e·çLx']á"oÅÎê3¯Ç—¹”ó0nå‚âg{Œñ> S´˜îè°g238‚ãköÝfÚd´6Ò€;ò÷±¢™¼›º ¢Æ'¥Ðx'e¬ç ]bÈÆV¢ó‹kýBO ðÊâ$Ÿ!×T 3Mýמ žìٍàÌü‘8÷€àæØ8æ©6‰©L´«…oãpð„~Çk‰!ñ;‹”ÛžÍ àž±z Ÿôû øŸÝužÏ;ÿ #|u6™Þ¬ÚˆÐõA4¶â|ôl|Ê2ŽÇ¤ÝÅÇY.<#Aí.k§hóF‚”Y; M½Ö4hŸ4&›­¿tès´%FìL¥£Ãk‰ÇT¤haÁ¤ÚxfÉ`ÑìË›>i 3t‚:,–+^÷´–{Û–Nxi"x‘Ûg î¨>¥Õ܁ùZH,2Û“:8xÊ¢Çí9.É-Ìâã-=çjwµS˜dütžçwýGòú®®ûº_ˆýx$–¡ãøO EÚÛÏ÷R„×w+3£Á£öUMyR²¹âŒ°š›¸Ñãò9§Ó_Dl+Ùßc›úšGÅÌc†Ž!Ko=¶.‘Îÿ c²(2®V mª.ÿ ¹B›¹å ù„öŸSV>™ü¯$y:G¢Z×àøúdî¹û­·ýÇ´:•c LÍõi_‹ö+ÎæGÊè>OŠ•äž´§Þ{X}¨1ÚTc›»Qþ•êô°t¿OP?eæ~É{5]•ÙR£r5†nZ\ã@ &îJõ ¾àC°þV>fé¥/ü5ñÊIº_é5 ;e­h<@ Ä&æÃëE%;X,ÒãÆÞ`Oò¦kŸm#˜!ÀyÄ¢| óLšò¥Ä` ¶R=|ÈCâh5ò3DˆïF†ðÒ#ÅìÛœ?¸yhBãœí ZxßÎÄhºRK„`Þödvײ™ÀÈÑÒgŒuY w³%†ƒÓzõ ÖÏp‚dH®¦A´ù§»ÓÇMæ~)ˆð‡û:ù&Ä •vGD´À n ݇¼Ö8Fö óáà£~Ë¥x`oK|Ä?fxiØü%pìR>éò+Û±éÎ>núlFŤ'tq8LZÏvÃ?„¡ß±È⽆¯³íü@x|PöUäèØã¡ð‚ŒAìÏ"vÍwóŸÍ{ ý0.z È•Ö{,N¡£¡ŸKÕÙž>Ýœþ ÍÀ°<×EA!Å‚D™IúOÍ¡>ôG}Â` ÍßkÜL™Ž Þð™ {IøF²¹òQ3&!ÃÂÞz.d&Ï-sH¸,Ôõ˜ŽP€ 77ˆÝ¼ÊëÜw =cÕ Ú,ØÐ5ÎYÐ)ì´öœgŒ[¤ßv㙑8心>h]§µháYš£²ºÑ.{Ï7Sð•?´~×SÃKýJÛ˜ ™Íäiúu<µX¶1õ^kâçIÑ£sZ4h>j*ÔšD:4­¿_ ÷¸ Õxæÿ ¸?Mù _•­ÊÐ ä ÷ý ÑwL œ­ïnTkÛUÍN©ë:¦fV ¶ÜÔÜMªÅâA½–¿R×TXš-%iTÊT•‡Ù‚JôϐZxWÑè‰f‰òG º ×Õû2aZ7OU3[“×AT–ÞŒ…-‘¤”Ì ì&(ˆ¿­•ƒkï’:ðY¦W‘ Å)“†‘˜³Åtcø˜ñTÂwÚÇ4|üLÇªí–v- qˆèU qPE.†â‘˜µ Æ,ÐÅs]8¾„oúÑ i>ÜxxÈó)ƒ ´æÁâØ$À‰vžŸf$Ž |ãw;ÀÁIJ»b` {¦Ó¤Ú$©YÀ‘n@Óïž«9J¼êG m¤ ܯ¹ÌW4€ÐÒÅÛ‡#褕Ÿn-?í|с¥÷Ú¹¬'´ÞÜ9ÓK `hê£SÄSà?7—Wí_´…óB›»:=Ãïq`<8ñÓŒÑlú2d¬ê³£hÖ[l|$vÝro~'R®‰§°ñmY ͧäP |PUª¹·:3Œ[Û{Xÿ ºâ@‚W–Äé u‚ ¯´*=íή.pûÒdt @G‰¬ s¸ ëÉücr ÞæѨÊ@>¤¢Ö±. Þ'¯°ÌME[YéïĵÂCå½ Ué©Áû'Ê9%eÔðNU”ë‘ÌsD3/®+UI˜9h.WC”빓$#:pz:YÓ ¿xž* ³$Í +$kñAŠ‹†¢ Uê>¸)_š¬÷©ßAÂÔb9ÇU ¯¾á•9¯ÏÏ÷O÷¼¼Fähal1‰3Ì[Ïr•´UCksNÐ] R‘¸¥H+§Šé†c©vÖÞ0iÓ76s†î!§=ß ¼~Ô'°Ãmäoäš³ªøi1úÉ)³yV8 CLÄØÁ‘WYïi€H6ÖÑiámø^ÈY´°Ñ7¥Û*—Ñ©L«Qƒï—Ùrÿ ›£Ð*š¸ˆL©ˆ$ˆ ÷¾D§9È®«qbqC)–ˆïv´çñsÑVT­Ø, <àïºÀO«Jý·õ àfPìð .wFšir´þ’2_Y *Æ€x\« ì€9š@ Ž|F⇥ˆkZ@hÖÄ0t¿-<“‹qµ¾*ZL¤Ú)&BJpÓF5=$„at*Zš$’ÑtdûÝRI1 2Ž‰$€$I$#‰SÞ’Hë¬ï;Á$¡t$’`<(ñÇt)$‡Ð.Êf¢X’Kt=Éé$‚ˆªè¢oÝëòI%Rgcª÷ŠyI%¡‰ÿ !ñ)´õ $¤ Ô’IIGÿÙ# ------------------------------------------------------------------------------ # pycparser: c_generator.py # # C code generator from pycparser AST nodes. # # Eli Bendersky [https://eli.thegreenplace.net/] # License: BSD # ------------------------------------------------------------------------------ from typing import Callable, List, Optional from . import c_ast class CGenerator: """Uses the same visitor pattern as c_ast.NodeVisitor, but modified to return a value from each visit method, using string accumulation in generic_visit. """ indent_level: int reduce_parentheses: bool def __init__(self, reduce_parentheses: bool = False) -> None: """Constructs C-code generator reduce_parentheses: if True, eliminates needless parentheses on binary operators """ # Statements start with indentation of self.indent_level spaces, using # the _make_indent method. self.indent_level = 0 self.reduce_parentheses = reduce_parentheses def _make_indent(self) -> str: return " " * self.indent_level def visit(self, node: c_ast.Node) -> str: method = "visit_" + node.__class__.__name__ return getattr(self, method, self.generic_visit)(node) def generic_visit(self, node: Optional[c_ast.Node]) -> str: if node is None: return "" else: return "".join(self.visit(c) for c_name, c in node.children()) def visit_Constant(self, n: c_ast.Constant) -> str: return n.value def visit_ID(self, n: c_ast.ID) -> str: return n.name def visit_Pragma(self, n: c_ast.Pragma) -> str: ret = "#pragma" if n.string: ret += " " + n.string return ret def visit_ArrayRef(self, n: c_ast.ArrayRef) -> str: arrref = self._parenthesize_unless_simple(n.name) return arrref + "[" + self.visit(n.subscript) + "]" def visit_StructRef(self, n: c_ast.StructRef) -> str: sref = self._parenthesize_unless_simple(n.name) return sref + n.type + self.visit(n.field) def visit_FuncCall(self, n: c_ast.FuncCall) -> str: fref = self._parenthesize_unless_simple(n.name) args = self.visit(n.args) if n.args is not None else "" return fref + "(" + args + ")" def visit_UnaryOp(self, n: c_ast.UnaryOp) -> str: match n.op: case "sizeof": # Always parenthesize the argument of sizeof since it can be # a name. return f"sizeof({self.visit(n.expr)})" case "p++": operand = self._parenthesize_unless_simple(n.expr) return f"{operand}++" case "p--": operand = self._parenthesize_unless_simple(n.expr) return f"{operand}--" case _: operand = self._parenthesize_unless_simple(n.expr) return f"{n.op}{operand}" # Precedence map of binary operators: precedence_map = { # Should be in sync with c_parser.CParser.precedence # Higher numbers are stronger binding "||": 0, # weakest binding "&&": 1, "|": 2, "^": 3, "&": 4, "==": 5, "!=": 5, ">": 6, ">=": 6, "<": 6, "<=": 6, ">>": 7, "<<": 7, "+": 8, "-": 8, "*": 9, "/": 9, "%": 9, # strongest binding } def visit_BinaryOp(self, n: c_ast.BinaryOp) -> str: # Note: all binary operators are left-to-right associative # # If `n.left.op` has a stronger or equally binding precedence in # comparison to `n.op`, no parenthesis are needed for the left: # e.g., `(a*b) + c` is equivalent to `a*b + c`, as well as # `(a+b) - c` is equivalent to `a+b - c` (same precedence). # If the left operator is weaker binding than the current, then # parentheses are necessary: # e.g., `(a+b) * c` is NOT equivalent to `a+b * c`. lval_str = self._parenthesize_if( n.left, lambda d: not ( self._is_simple_node(d) or self.reduce_parentheses and isinstance(d, c_ast.BinaryOp) and self.precedence_map[d.op] >= self.precedence_map[n.op] ), ) # If `n.right.op` has a stronger -but not equal- binding precedence, # parenthesis can be omitted on the right: # e.g., `a + (b*c)` is equivalent to `a + b*c`. # If the right operator is weaker or equally binding, then parentheses # are necessary: # e.g., `a * (b+c)` is NOT equivalent to `a * b+c` and # `a - (b+c)` is NOT equivalent to `a - b+c` (same precedence). rval_str = self._parenthesize_if( n.right, lambda d: not ( self._is_simple_node(d) or self.reduce_parentheses and isinstance(d, c_ast.BinaryOp) and self.precedence_map[d.op] > self.precedence_map[n.op] ), ) return f"{lval_str} {n.op} {rval_str}" def visit_Assignment(self, n: c_ast.Assignment) -> str: rval_str = self._parenthesize_if( n.rvalue, lambda n: isinstance(n, c_ast.Assignment) ) return f"{self.visit(n.lvalue)} {n.op} {rval_str}" def visit_IdentifierType(self, n: c_ast.IdentifierType) -> str: return " ".join(n.names) def _visit_expr(self, n: c_ast.Node) -> str: match n: case c_ast.InitList(): return "{" + self.visit(n) + "}" case c_ast.ExprList() | c_ast.Compound(): return "(" + self.visit(n) + ")" case _: return self.visit(n) def visit_Decl(self, n: c_ast.Decl, no_type: bool = False) -> str: # no_type is used when a Decl is part of a DeclList, where the type is # explicitly only for the first declaration in a list. # s = n.name if no_type else self._generate_decl(n) if n.bitsize: s += " : " + self.visit(n.bitsize) if n.init: s += " = " + self._visit_expr(n.init) return s def visit_DeclList(self, n: c_ast.DeclList) -> str: s = self.visit(n.decls[0]) if len(n.decls) > 1: s += ", " + ", ".join( self.visit_Decl(decl, no_type=True) for decl in n.decls[1:] ) return s def visit_Typedef(self, n: c_ast.Typedef) -> str: s = "" if n.storage: s += " ".join(n.storage) + " " s += self._generate_type(n.type) return s def visit_Cast(self, n: c_ast.Cast) -> str: s = "(" + self._generate_type(n.to_type, emit_declname=False) + ")" return s + " " + self._parenthesize_unless_simple(n.expr) def visit_ExprList(self, n: c_ast.ExprList) -> str: visited_subexprs = [] for expr in n.exprs: visited_subexprs.append(self._visit_expr(expr)) return ", ".join(visited_subexprs) def visit_InitList(self, n: c_ast.InitList) -> str: visited_subexprs = [] for expr in n.exprs: visited_subexprs.append(self._visit_expr(expr)) return ", ".join(visited_subexprs) def visit_Enum(self, n: c_ast.Enum) -> str: return self._generate_struct_union_enum(n, name="enum") def visit_Alignas(self, n: c_ast.Alignas) -> str: return "_Alignas({})".format(self.visit(n.alignment)) def visit_Enumerator(self, n: c_ast.Enumerator) -> str: if not n.value: return "{indent}{name},\n".format( indent=self._make_indent(), name=n.name, ) else: return "{indent}{name} = {value},\n".format( indent=self._make_indent(), name=n.name, value=self.visit(n.value), ) def visit_FuncDef(self, n: c_ast.FuncDef) -> str: decl = self.visit(n.decl) self.indent_level = 0 body = self.visit(n.body) if n.param_decls: knrdecls = ";\n".join(self.visit(p) for p in n.param_decls) return decl + "\n" + knrdecls + ";\n" + body + "\n" else: return decl + "\n" + body + "\n" def visit_FileAST(self, n: c_ast.FileAST) -> str: s = "" for ext in n.ext: match ext: case c_ast.FuncDef(): s += self.visit(ext) case c_ast.Pragma(): s += self.visit(ext) + "\n" case _: s += self.visit(ext) + ";\n" return s def visit_Compound(self, n: c_ast.Compound) -> str: s = self._make_indent() + "{\n" self.indent_level += 2 if n.block_items: s += "".join(self._generate_stmt(stmt) for stmt in n.block_items) self.indent_level -= 2 s += self._make_indent() + "}\n" return s def visit_CompoundLiteral(self, n: c_ast.CompoundLiteral) -> str: return "(" + self.visit(n.type) + "){" + self.visit(n.init) + "}" def visit_EmptyStatement(self, n: c_ast.EmptyStatement) -> str: return ";" def visit_ParamList(self, n: c_ast.ParamList) -> str: return ", ".join(self.visit(param) for param in n.params) def visit_Return(self, n: c_ast.Return) -> str: s = "return" if n.expr: s += " " + self.visit(n.expr) return s + ";" def visit_Break(self, n: c_ast.Break) -> str: return "break;" def visit_Continue(self, n: c_ast.Continue) -> str: return "continue;" def visit_TernaryOp(self, n: c_ast.TernaryOp) -> str: s = "(" + self._visit_expr(n.cond) + ") ? " s += "(" + self._visit_expr(n.iftrue) + ") : " s += "(" + self._visit_expr(n.iffalse) + ")" return s def visit_If(self, n: c_ast.If) -> str: s = "if (" if n.cond: s += self.visit(n.cond) s += ")\n" s += self._generate_stmt(n.iftrue, add_indent=True) if n.iffalse: s += self._make_indent() + "else\n" s += self._generate_stmt(n.iffalse, add_indent=True) return s def visit_For(self, n: c_ast.For) -> str: s = "for (" if n.init: s += self.visit(n.init) s += ";" if n.cond: s += " " + self.visit(n.cond) s += ";" if n.next: s += " " + self.visit(n.next) s += ")\n" s += self._generate_stmt(n.stmt, add_indent=True) return s def visit_While(self, n: c_ast.While) -> str: s = "while (" if n.cond: s += self.visit(n.cond) s += ")\n" s += self._generate_stmt(n.stmt, add_indent=True) return s def visit_DoWhile(self, n: c_ast.DoWhile) -> str: s = "do\n" s += self._generate_stmt(n.stmt, add_indent=True) s += self._make_indent() + "while (" if n.cond: s += self.visit(n.cond) s += ");" return s def visit_StaticAssert(self, n: c_ast.StaticAssert) -> str: s = "_Static_assert(" s += self.visit(n.cond) if n.message: s += "," s += self.visit(n.message) s += ")" return s def visit_Switch(self, n: c_ast.Switch) -> str: s = "switch (" + self.visit(n.cond) + ")\n" s += self._generate_stmt(n.stmt, add_indent=True) return s def visit_Case(self, n: c_ast.Case) -> str: s = "case " + self.visit(n.expr) + ":\n" for stmt in n.stmts: s += self._generate_stmt(stmt, add_indent=True) return s def visit_Default(self, n: c_ast.Default) -> str: s = "default:\n" for stmt in n.stmts: s += self._generate_stmt(stmt, add_indent=True) return s def visit_Label(self, n: c_ast.Label) -> str: return n.name + ":\n" + self._generate_stmt(n.stmt) def visit_Goto(self, n: c_ast.Goto) -> str: return "goto " + n.name + ";" def visit_EllipsisParam(self, n: c_ast.EllipsisParam) -> str: return "..." def visit_Struct(self, n: c_ast.Struct) -> str: return self._generate_struct_union_enum(n, "struct") def visit_Typename(self, n: c_ast.Typename) -> str: return self._generate_type(n.type) def visit_Union(self, n: c_ast.Union) -> str: return self._generate_struct_union_enum(n, "union") def visit_NamedInitializer(self, n: c_ast.NamedInitializer) -> str: s = "" for name in n.name: if isinstance(name, c_ast.ID): s += "." + name.name else: s += "[" + self.visit(name) + "]" s += " = " + self._visit_expr(n.expr) return s def visit_FuncDecl(self, n: c_ast.FuncDecl) -> str: return self._generate_type(n) def visit_ArrayDecl(self, n: c_ast.ArrayDecl) -> str: return self._generate_type(n, emit_declname=False) def visit_TypeDecl(self, n: c_ast.TypeDecl) -> str: return self._generate_type(n, emit_declname=False) def visit_PtrDecl(self, n: c_ast.PtrDecl) -> str: return self._generate_type(n, emit_declname=False) def _generate_struct_union_enum( self, n: c_ast.Struct | c_ast.Union | c_ast.Enum, name: str ) -> str: """Generates code for structs, unions, and enums. name should be 'struct', 'union', or 'enum'. """ if name in ("struct", "union"): assert isinstance(n, (c_ast.Struct, c_ast.Union)) members = n.decls body_function = self._generate_struct_union_body else: assert name == "enum" assert isinstance(n, c_ast.Enum) members = None if n.values is None else n.values.enumerators body_function = self._generate_enum_body s = name + " " + (n.name or "") if members is not None: # None means no members # Empty sequence means an empty list of members s += "\n" s += self._make_indent() self.indent_level += 2 s += "{\n" s += body_function(members) self.indent_level -= 2 s += self._make_indent() + "}" return s def _generate_struct_union_body(self, members: List[c_ast.Node]) -> str: return "".join(self._generate_stmt(decl) for decl in members) def _generate_enum_body(self, members: List[c_ast.Enumerator]) -> str: # `[:-2] + '\n'` removes the final `,` from the enumerator list return "".join(self.visit(value) for value in members)[:-2] + "\n" def _generate_stmt(self, n: c_ast.Node, add_indent: bool = False) -> str: """Generation from a statement node. This method exists as a wrapper for individual visit_* methods to handle different treatment of some statements in this context. """ if add_indent: self.indent_level += 2 indent = self._make_indent() if add_indent: self.indent_level -= 2 match n: case ( c_ast.Decl() | c_ast.Assignment() | c_ast.Cast() | c_ast.UnaryOp() | c_ast.BinaryOp() | c_ast.TernaryOp() | c_ast.FuncCall() | c_ast.ArrayRef() | c_ast.StructRef() | c_ast.Constant() | c_ast.ID() | c_ast.Typedef() | c_ast.ExprList() ): # These can also appear in an expression context so no semicolon # is added to them automatically # return indent + self.visit(n) + ";\n" case c_ast.Compound(): # No extra indentation required before the opening brace of a # compound - because it consists of multiple lines it has to # compute its own indentation. # return self.visit(n) case c_ast.If(): return indent + self.visit(n) case _: return indent + self.visit(n) + "\n" def _generate_decl(self, n: c_ast.Decl) -> str: """Generation from a Decl node.""" s = "" if n.funcspec: s = " ".join(n.funcspec) + " " if n.storage: s += " ".join(n.storage) + " " if n.align: s += self.visit(n.align[0]) + " " s += self._generate_type(n.type) return s def _generate_type( self, n: c_ast.Node, modifiers: List[c_ast.Node] = [], emit_declname: bool = True, ) -> str: """Recursive generation from a type node. n is the type node. modifiers collects the PtrDecl, ArrayDecl and FuncDecl modifiers encountered on the way down to a TypeDecl, to allow proper generation from it. """ # ~ print(n, modifiers) match n: case c_ast.TypeDecl(): s = "" if n.quals: s += " ".join(n.quals) + " " s += self.visit(n.type) nstr = n.declname if n.declname and emit_declname else "" # Resolve modifiers. # Wrap in parens to distinguish pointer to array and pointer to # function syntax. # for i, modifier in enumerate(modifiers): match modifier: case c_ast.ArrayDecl(): if i != 0 and isinstance(modifiers[i - 1], c_ast.PtrDecl): nstr = "(" + nstr + ")" nstr += "[" if modifier.dim_quals: nstr += " ".join(modifier.dim_quals) + " " if modifier.dim is not None: nstr += self.visit(modifier.dim) nstr += "]" case c_ast.FuncDecl(): if i != 0 and isinstance(modifiers[i - 1], c_ast.PtrDecl): nstr = "(" + nstr + ")" args = ( self.visit(modifier.args) if modifier.args is not None else "" ) nstr += "(" + args + ")" case c_ast.PtrDecl(): if modifier.quals: quals = " ".join(modifier.quals) suffix = f" {nstr}" if nstr else "" nstr = f"* {quals}{suffix}" else: nstr = "*" + nstr if nstr: s += " " + nstr return s case c_ast.Decl(): return self._generate_decl(n.type) case c_ast.Typename(): return self._generate_type(n.type, emit_declname=emit_declname) case c_ast.IdentifierType(): return " ".join(n.names) + " " case c_ast.ArrayDecl() | c_ast.PtrDecl() | c_ast.FuncDecl(): return self._generate_type( n.type, modifiers + [n], emit_declname=emit_declname ) case _: return self.visit(n) def _parenthesize_if( self, n: c_ast.Node, condition: Callable[[c_ast.Node], bool] ) -> str: """Visits 'n' and returns its string representation, parenthesized if the condition function applied to the node returns True. """ s = self._visit_expr(n) if condition(n): return "(" + s + ")" else: return s def _parenthesize_unless_simple(self, n: c_ast.Node) -> str: """Common use case for _parenthesize_if""" return self._parenthesize_if(n, lambda d: not self._is_simple_node(d)) def _is_simple_node(self, n: c_ast.Node) -> bool: """Returns True for nodes that are "simple" - i.e. nodes that always have higher precedence than operators. """ return isinstance( n, (c_ast.Constant, c_ast.ID, c_ast.ArrayRef, c_ast.StructRef, c_ast.FuncCall), )