+g2l dZddlZddlZddlZddlmZmZmZGddejZ dZ dZ dZ dZ d Z d d gZejrgZdZ dZd d d ddddddddd Z ejdejejzZ ejdZ ejdZ ejdejZ ejdejZ ejdejejzZ deddDZ dd d!d"d#d$d%d&d'd(d) Z d*Z! d+Z" d,Z# d-Z$ d.Z% e!e$e#e"gZ& gd/Z' ejd(d0ee&e'Dej)Z* d1Z+ d*Z, d2Z- d-Z. d3Z/iZ0 gd4Z1e2e1D]!\Z3Z4e45D]Z6e3e0e6<"d5Z7d6Z8d7Z9d8Z:d9Z;d:Zd=Z?ejd>Z@d?ZAd@ZBdAZCdBZDdCZEGdDdEeFZGdFZHdS)Ga C/C++ preprocessor for finding dependencies Reasons for using the Waf preprocessor by default #. Some c/c++ extensions (Qt) require a custom preprocessor for obtaining the dependencies (.moc files) #. Not all compilers provide .d files for obtaining the dependencies (portability) #. A naive file scanner will not catch the constructs such as "#include foo()" #. A naive file scanner will catch unnecessary dependencies (change an unused header -> recompile everything) Regarding the speed concerns: * the preprocessing is performed only when files must be compiled * the macros are evaluated only for #if/#elif/#include * system headers are not scanned by default Now if you do not want the Waf preprocessor, the tool +gccdeps* uses the .d files produced during the compilation to track the dependencies (useful when used with the boost libraries). It only works with gcc >= 4.4 though. A dumb preprocessor is also available in the tool *c_dumbpreproc* N)LogsUtilsErrorsceZdZdS) PreprocErrorN)__name__ __module__ __qualname__+/git_repos/avwlv2/waflib/Tools/c_preproc.pyrr sr ri-Fz/usr/local/includez /usr/include!&&z&=||z|=^z^=&|~) notnot_eqandand_eqoror_eqxorxor_eqbitandbitorcomplzc^[ ]*(?:#|%:)[ ]*(ifdef|ifndef|if|else|elif|endif|include|import|define|undef|pragma)[ ]*(.*) *$z ^[a-zA-Z_]\w*z^[a-zA-Z_][a-zA-Z0-9_]*[(]z ^\s*once\s*z\\ * z7//.*?$|/\*.*?\*/|\'(?:\\.|[^\\\'])*\'|"(?:\\.|[^\\"])*"c"g|] \}}d|z|f S)z??r ).0abs r r&]s$ C C CDAqT!VQK C C Cr z =-/!'()<>z #~\|^[]{} \') 0r$r%tnfvr\'iOTsc)a$0[xX](?P[a-fA-F0-9]+)(?P[uUlL]*)|L*?'(?P(\\.|[^\\'])+)'|(?P\d+)[Ee](?P[+-]*?\d+)(?P[fFlL]*)|(?P\d*\.\d+)([Ee](?P[+-]*?\d+))?(?P[fFlL]*)|(?P\d+\.\d*)([Ee](?P[+-]*?\d+))?(?P[fFlL]*)|(?P0*)(?P\d+)(?P[uUlL]*)zL?"([^"\\]|\\.)*"z [a-zA-Z_]\w*z%:%:|<<=|>>=|\.\.\.|<<|<%|<:|<=|>>|>=|\+\+|\+=|--|->|-=|\*=|/=|%:|%=|%>|==|&&|&=|\|\||\|=|\^=|:>|!=|##|[\(\)\{\}\[\]<>\?\|\^\*\+&=:!#;,%/\-\?\~\.]c&g|]\}}d|d|dS)z(?P<>)r )r#nameparts r r&r&}s+ i i ittttt!< i i ir r$ucJ|}|ddkrdS|S)zCReplace function used with :py:attr:`waflib.Tools.c_preproc.re_cpp`r/ )group)mr;s r replrHs&WWYYaDCKK  r )z* / %z+ -z<< >>z < <= >= >z== !=z& | ^z&& ||,c d|z}n#t$rt|}YnwxYw d|z}n#t$rt|}YnwxYw|}|dkr||z}n~|dkr||z}nq|dkr||z }nd|dkr||z}nW|dkr||z }nJ|dkr||z }n=|dkrt||k}n"|d ks|d kr||z}n|d ks|d krt|p|}n|d ks|dkr||z}n|dks|dkrt|o|}n|dks|dkrt||k}n|dks|dkrt||z }n|dkrt||k}nh|dkrt||k}nN|dkrt||k}n4|dkrt||k}n|dkr||z}n|dkr||z }nd}|S)z Apply arithmetic rules to compute a result :param val1: input parameter :type val1: int or string :param val2: input parameter :type val2: int or string :param val_op: C operator in *+*, */*, *-*, etc :type val_op: string :rtype: int r%+r*rDrz==rr rrrrrrz!=rrz<=z>=z<>) TypeErrorint)val_1val_2val_opr$r%dr<s r reduce_numsrUsi%i!! %jj!!!%i!! %jj!!! HH!e!!ff!e!!ff!e!!ff!e!!ff!e!!ff!e!!gg !q&kk!!ffg!e!!ggd !&qkk!!ffh!e!!gge !'ll!!ggh !q&kk!!ffe !A#hh!!gg !q&kk!!ff !a%jj!!ff !a%jj!!gg !q&kk!!gg1f!!gg1f!!! s$$.A  A c|std|d\}}|tkrw|dkrd}d}|t|krL||\}}|tkr|dkr |dz}|dkrn6n |dkr|dz }|dz }|t|kLtd|zt|d|\}}|||dzdfS|dkrt |ddS|d kr-t |dd\}}t d |d |fS|d kr9t |dd\}}t t | |fS|d kr,t |dd\}}t ||fStd|z|tkr ||ddfS|tkr d|ddfStd|z)a- Try to obtain a number from a list of tokens. The token types are defined in :py:attr:`waflib.Tools.ccroot.tok_types`. :param lst: list of preprocessor tokens :type lst: list of tuple (tokentype, value) :return: a pair containing the number and the rest of the list :rtype: tuple(value, list) zempty list for get_numr(r?rparen expected %rNrLrz-1rMrrzInvalid op token %r for get_numzInvalid token %r for get_num) rOPlenget_termget_numrUrPNUMIDENT)lstpr4 count_parr8num_s r r]r]s& /-... a&!QGG#XX91 SXX VFQBww S1ni a   s((1niFA SXX +c1 2 22s1Q3x  8C AaCDD Cxx #abb'  Cxxc!""g83 tS# & & ,,Cxxc!""g83 3s88|  c ""Cxxc!""g83 XX:s  7#= > >>3hh CG5jj CG3c9:::r cp|stdt|\}}|s|gfS|d\}}|tkr|dkrt|ddS|dkrd}d}|t |krS||\}}|tkr%|dkr|dz}n|dkr|dz }n |d kr|dkrn*|dz }|t |kStd |zt |rt|d|St||dzdSt|dd\}}|s+t |||}tt|fg|zS|d\}}|tkrtd |zt|t|kr+t |||}tt|fg|zSt|dd\} }t || |} tt|f||ft| fg|zStd |z) z Evaluate an expression recursively, for example:: 1+1+1 -> 2+1 -> 3 :param lst: list of tokens :type lst: list of tuple(token, value) :return: the value and the remaining tokens :rtype: value, list zempty list for get_termrrIrXN?r?rW:rYzop expected %rzcannot reduce %r) rr]rZr\r[rPrUr^prec) r`rcrar4rbr8num2p2v2num3s r r\r\sp 0./// CLLc  r a&!QGG#XX 3qrr7  Cxx91 SXX VFQBww S1nii s((1nii s(( a FA SXX +c1 2 22 #hh C!H   C!I  s122w94 ) sD! $ $D c4[MC' ( (( F62rBhh '#- . .. 2h$q' sD! $ $D c4[MC' ( ((ABB  ID# tT2 & &D c3Z!Q#t5; < <<&,---r c8t|\}}t|fS)z Take a list of tokens and output true or false for #if/#elif conditions. :param lst: a list of tokens :type lst: list of tuple(token, value) :return: a token :rtype: tuple(NUM, int) )r\r^)r`rcs r reduce_evalrn\s SMMc c r cDd|D}d|S)z Merge a list of tokens into a string :param lst: a list of tokens :type lst: list of tuple(token, value) :rtype: string c2g|]\}}t|Sr )str)r#rjrks r r&zstringize..ps"$$$HRB$$$r )join)r`s r stringizerths'%$$$$  r cvd}|dtkr|dtkrt}nd|dtkr*|dtks|dtkrt}n)|dtkr|dtkrt}|std|d|||d|dzfS)z Token pasting works between identifiers, particular operators, and identifiers and numbers:: a ## b -> ab > ## = -> >= a ## 2 -> a2 :param t1: token :type t1: tuple(type, value) :param t2: token :type t2: tuple(type, value) Nrz!tokens do not make a valid paste z and rX)rZr_r^r)t1t2p1s r paste_tokensryss qERKKBqERKK ""eunn"Q%5..BqESLL ""esllr!u|| " N RRRLMMM RURU]r cd}|t|kr||\}}|tkr|dkr||=|t|kr||\}}|tkr ||vrtdf||<nstdf||<ne|tkr7|dkr1||=||\}}||=||vrtdf||<n1tdf||<n#t d|zn|tkr||vrt ||t rt||\}} | ||<||} | d} t | dtrD||=| dd} t| |||gz| D]} | || |dz }nWg}||=|t|krt d|z||\}}|tks|dkrt d|z||=g}d}|t|kr||\}}||=|tkr|dkr|dkr| ||f|dz }n|d kr|r| |n|d kr,|st d |z| |g}nF| ||fn.| ||f|dkr|dz }n |d kr|dz}|t|kt d g} | d}d}|t| krv| |\}}|tkr|d kr|dzt| krz| |dzdtkr`| |dzd|vrM||| |dzd}| tt|f|dz }n| ||fn|tkr-|dkr&| r |dzt| kr| d}| |dzdtkr| |dzd|vr||| |dzd}|r8t||d| d<| |ddnb| ||f| |n4| |dzdtkr| |dzddkrg}t| d}t|}|||z dzdD]3}||| td f4|r|t| dkrP| d\}}| d\}}|dkr4| |d kr||kr| | |z } nt|| |dz| d<|dz }nw| ||fn_|tkr=||vr9|||}t||||gz| |n| ||f|dz }|t| kvt| |||gzt#t| dz ddD]}| || ||dz }|t|kdSdS)a Replace the tokens in lst, using the macros provided in defs, and a list of macros that cannot be re-applied :param lst: list of tokens :type lst: list of tuple(token, value) :param defs: macro definitions :type defs: dict :param ban: macros that cannot be substituted (recursion is not allowed) :type ban: list of string :return: the new list of tokens :rtype: value, list rdefinedrXrWInvalid define expression %rNz!expected ( after %r (got nothing)zexpected ( after %rr?rIzempty param in funcall %rzmalformed macro### __VA_ARGS__)r[r_r^rZr isinstancerq extract_macrolist reduce_tokensinsertappendSTRrtryextendpoprange)r`defsbanr8rar4rjrkr$r% macro_defto_addaccutmpargs one_param count_paren arg_tablejtoksrvva_toksstptxp3v3p4v4s r rrs3s88|| q6&1a%ZZANN 1v#c((ll1vHR U{{ d Qxc!ffQxc!ff rbCii QAXb" Q d Qxc!ffQxc!ff 6< = ==!$ Ezza4iia# a ! !DAqDGAw9 aL61t$$~ A !!!9D$c1#g&&&  ZZ3!VQQ D ACHH}} ;a? @ @@1vHR Rxx299 -1 2 22 AIK c#hh,,!fVR Q b[A%% sR!!!a{{ 99  I 99<6:;;; {{9yyR!!!!Bx   99a{{ 99a{1 c#hh,,4 ) * ** D! I A c&kk//q Xb" bR3YY 1s6{{  vac{1~666!A#;q>Y;V;V9VAaC[^,-t {{C4)***Avqq {{B8 ((rTzz )!A#F ## Hr 1+a.E ! !fQqSk!n &A&AIfQqSk!n-.   T!W--b T!""X     b"X    T     1Q3KNe # #qs A-(G(G 1   YYbeAghh # #A     S " " " "    t99Q;;H"bH"b $JJ ((*** 3YY277 88::: F1Q3K00RAvqq {{B8 ++" // )B- dD$QC((( kk$ kk2r(!VQ c&kk//D$c1#g&&& 3t99Q;B ' 'ZZ47q&! 3s88||||||r ct||g|std|r,|d\}}|tkr||vrtd|zt|\}}t |dkS)a Reduce the tokens by :py:func:`waflib.Tools.c_preproc.reduce_tokens` and try to return a 0/1 result by :py:func:`waflib.Tools.c_preproc.reduce_eval`. :param lst: list of tokens :type lst: list of tuple(token, value) :param defs: macro definitions :type defs: dict :rtype: int zmissing tokens to evaluaterzmissing macro %r)rrr_rnrP)r`rrar4s r eval_macror<ssD" 312220 Q$!Q%ZZATMM (3. / //CA A! r cTt|}t|rL|d\}}|d\}}|tkrt dd}d}i}d} |dz }||\}}|dkr9|t kr |||<|dz }|}n|tkr|dkrnt d|t kr5|tkr |dkr|}n|tkr|dkrnt d|dkrG|t kr |||<|dz }|}nS|tkr|d krt d t d |d krt d t d ||||dzdgfS|d\}}t |dkr|g|ddgfS|gdggfS)a> Process a macro definition of the form:: #define f(x, y) x * y into a function or a simple macro without arguments :param txt: expression to exact a macro definition from :type txt: string :return: a tuple containing the name, the list of arguments and the replacement :rtype: tuple(string, [list, list]) rrXz expected (rWr?zunexpected token (3)rIzcomma or ... expectedz...znot implemented (1)zcomma or ... expected (2)znot implemented (2)zunexpected elseN)r:rr)tokenizere_funsearchrZrr_r[) txtr1rar@r4r8pindexparamsprevs r rrRsc]] MM#6 aD'!T 1$!Q"WW l # ##! & & $ *61 A$41a ckkEzzVAY q[V TT bQ#XX . / //  Bww188 TT bQ#XX / 0 00  EzzVAY q[V TT bQ%ZZ - . .. 3 4 44  , - -- ( ) ))A *F 1Q344! "" Q4&1aVVaZZ r1QRR5k  rH: r z^\s*(<(?:.*)>|"(?:.*)")cFt|}|r'|d}|d|ddfSt|}t ||dg|st d|zt |dkr(|ddtkrd|ddfSn]|dddkrK|dddkr9dt| d df}|St d|z) z Process a line in the form:: #include foo :param txt: include line to process :type txt: string :param defs: macro definitions :type defs: dict :return: the file name :rtype: string rXrr waf_includezcould not parse include %r"rNr>) re_includerrFrrrr[rrtlstriprstrip)rrrGrrets r extract_includers's  # QQrT   tTM?+++ 91C7888IINN !WQZ3 tAwqz/ !WQZ348A;#-- ioo$$S))0055 53 :036777r c|std|ddkrt|S|d}|dkrWt|dkr,|dtjvrt |dd d St |dd d S|rv|d krt|dkrdSd D]V}t||krA|dd|zr"d|zt |dd|zd fcSWd S t|S#t$rtd|zwxYw)zy Parse a c character :param txt: character to parse :type txt: string :return: a character literal :rtype: string zattempted to parse a null charrr6rXrNr0)rrrXr(zcould not parse char literal %r) rordr[string hexdigitsrPisdigitchr_escKeyError)rr<r8s r parse_charrso 75666FdNN S/VHHXX]]s1v!111 c!""gr   SWb  iikk ?#XX#c((A++ ! %%a #hhlls1QqS5z))++l aCS1Q3Z## $$$$%%? !* ??? 7#= > >>?s  D**Ec0t|ddS)z Convert a string into a list of tokens (shlex.split does not apply to c/c++/d) :param s: input to tokenize :type s: string :return: a list of tokens :rtype: list of tuple(token, value) N)tokenize_private)r;s r rrs AAAr cg}t|D]g}|j}tD]T}||}|rC|tkrV|t vr t }n |dkr d}t}n|dkr d}t}n|tkr|drt|d}n|drt|dd}n}|d r |d }nf|d }|rt|}nI|d p |d }n2|t kr|d krd}n|dkrd}n|tkr |dd}| ||fnVi|S)NtruerXfalseroctr(hexrn0charn2n4z%:r}z%:%:r~r) re_clexerfinditerrF tok_typesr_ g_optransrZlowerr^rPrrr)r;rmatchrGr@r4s r rrs   ##$ $ U k!" " dqww1   u}} Y dd ''))v   a dd ''))w   a d  %  a))aa !E((  aahh  aa !D'' !D''aa !F))a  a==qq 1T77 aaggqq  T aa v++ a  1R4QJJay EA  B r cg}|D]{}|rw|d}|dkr||5|dkr.||d|d||dzditd|z||S)N=rrrErXr|)findr ValueError)r`ryposs r format_definesrs  9 9Q 9 3 RiiJJqMMMM aJJ!DSD'''1SUVV99-.... 3a7 8 88 9 r cFeZdZdZd dZdZd dZdZdZd Z d Z d Z dS)c_parserz~ Used by :py:func:`waflib.Tools.c_preproc.scan` to parse c/h files. Note that by default, only project headers are parsed. Ncg|_ |i|_nt||_g|_d|_g|_|pg|_ g|_ g|_ d|_ t|_ t|_ dS)Nrrr) linesrdictstate count_filescurrentnode_stack nodepathsnodesnamescurfileset ban_includeslisted)selfrdefiness r __init__zc_parser.__init__"s$* _499W 49$*$$?$.$*9$*@$,ee$5$+WWr c |jj}n5#t$r(tjt x}|j_YnwxYw||f} ||S#t $r||}|rt|ddrd}np| |jj rQ|jj | |jj }|rt|ddrd}|||<|cYSwxYw)z Find a file from the input directory :param node: directory :type node: :py:class:`waflib.Node.Node` :param filename: header to find :type filename: string :return: the node if found, or None :rtype: :py:class:`waflib.Node.Node` childrenN)ctxpreproc_cache_nodeAttributeErrorr lru_cacheFILE_CACHE_SIZEr find_resourcegetattr is_child_ofbldnodesrcnode search_node path_from)rnodefilenamecachekeyrrs r cached_find_resourcezc_parser.cached_find_resourceAs2J 8 &55 JJJ).)I)II548 & & &J x#  *      H % %3 sJ%% SS ) * * 8  ' ' dh6F(G(G H HS Z.. c5: ::: s" /AA AB,D?Drc|dr|j|dS||_d}|dkrZ|jr2t |jD]}|||}|rnn!||jd|}|s$|jD]}|||}|rn|j }|rR||j vrI||vr/| ||j || |n3||vr/| ||j||S)a Try to obtain a node from the filename based from the include paths. Will add the node found to :py:attr:`waflib.Tools.c_preproc.c_parser.nodes` or the file name to :py:attr:`waflib.Tools.c_preproc.c_parser.names` if no corresponding file is found. Called by :py:attr:`waflib.Tools.c_preproc.c_parser.start`. :param filename: header to find :type filename: string :return: the node if found :rtype: :py:class:`waflib.Node.Node` z.mocNrr)endswithrrr MSVC_VERSIONreversedrrrrraddraddlines)rrkindenvfoundr2rs r tryfindzc_parser.tryfind`sv:X $$, % S[[ L d, - -    & &q( 3 3U   e   % %d&t jdkr*t jd|tjYdSYdSwxYw)z Add the lines from a header in the list of preprocessor lines to parse :param node: header :type node: :py:class:`waflib.Node.Node` rXzrecursion limit exceededzpreproc: reading file %rzcould not read the file %rrzparsing %r failed %sN)rrparentrrecursion_limitrrverbosedebugrrrEnvironmentError Exceptionerror traceback format_exc)rrrs r rzc_parser.addliness' ,,,a '' 0 1 11 \0:($///   D ! !5:U ;;; 2T9 : :: EEE lQJ%tY-A-C-CDDDDDDEs1B""ADDc^ tjd|j|jj||_|||jrLt|j}||j d|D|j r|j \}}|tkr*|xj dzc_ |j Y |j}|dddkr|t"n|dkr| |dd krt$|jvst&|jvr|dkr} tj&r(tjd| |tOj(Yd} ~ nd} ~ wwxYw|j dSdS)a Preprocess a source file to obtain the dependencies, which are accumulated to :py:attr:`waflib.Tools.c_preproc.c_parser.nodes` and :py:attr:`waflib.Tools.c_preproc.c_parser.names`. :param node: source file :type node: :py:class:`waflib.Node.Node` :param env: config set containing additional defines to take into account :type env: :py:class:`waflib.ConfigSet.ConfigSet` zpreproc: scanning %s (in %s)cg|]}d|fS)definer r#rs r r&z"c_parser.start..s111xm111r rXNrifendifrerifdefifndefincludeimportelifelser#zInvalid define line %rundefpragmaz(preproc: line parsing failed (%s): %s %s))rrr@r current_filerDEFINESrrrrrrrrrr undefinedskippedignoredrrracceptedre_macrrFrrrr define_namerr __delitem__re_pragma_oncerrrrr ) rrrr`tokenlinerrrGrincr's r startzc_parser.starts* +TY 8HIII$-- [3  $ $3;;===:11S111222 F]:>>##=E4 w    ?] JE RaRyD \\) '   YY[[[ Qx34:DJ!6!6 }} htnndi 0 0S eBiieBii '   d  Q aggii49$$eBiieBii (   d  Q aggii49$$eBiieBii )  u00"433[dCc455T  D-... & b XeBii )w   HTNNDI . .uRy & b XeBii )w  eBi (  :*.di  &&'' ::: 1D8 9 99: '   d  Q 'aggii49$$ iAGGII&&& (  TZZ\\**/ D-... ]]] |] Z:AtYEYE[E[\\\]I F]F]F]F]F]s9/A2Q"G;QM<;Q<NB>Q R "4RR cZt|S)z_ :param line: define line :type line: string :rtype: string :return: the define name )r6rrF)rr;s r r7zc_parser.define_name&s" d   ! ! # ##r )NN)rN) rr r __doc__rrrrrrr=r7r r r rrsXXXX>>....`   "   6[][][]z$$$$$r rcN jj}n*#t$rtjdjzwxYwt r|fdt Dz}n d|D}t|}|j dj |j |j fS)a Get the dependencies using a c/c++ preprocessor, this is required for finding dependencies of the kind:: #include some_macro() This function is bound as a task method on :py:class:`waflib.Tools.c.c` and :py:class:`waflib.Tools.cxx.cxx` for example z:%r is missing a feature such as "c", "cxx" or "includes": cXg|]&}jjj|'Sr ) generatorbldrootfind_dir)r#rtasks r r&zscan..=s/UUUadn(-66q99UUUr cg|]B}||jjs||jj@|CSr )rrrrr$s r r&zscan..?sE___Q!-- ">">_!--PQPUP]B^B^_q___r r) rBincludes_nodesrrWafError go_absolutestandard_includesrr=inputsrrr)rFincnrrs` r scanrN/sg  &$$gggTW[Weefffg`UUUUCTUUUU))__$___) 4;q>48$$$ CIs '7)Ir?rerrwaflibrrrrIrrrrrrJrKis_win32r strict_quotesrcompile IGNORECASE MULTILINEr r6rr9r DOTALLr ziprrr^rZr_rCHARr exp_typesrsMrr5r4r2r3rHrhops enumeratersymsr rBrUr]r\rnrtryrrrrrrrrrobjectrrNr r r r_s[ 0&&&&&&&&&&6? Q@ s)>:> -           J 2:j   O $ $ 0 1 1M2=99# ; -- NPRPY\^\hPh j j C CCC \$B$B C C CaQA2222BTV W W      #ub !      BJsxx i issS\^gOhOh i i ijjlnlp q q #  Q  / R     MLLy~~GAt **,,Q $q''A A A F4;4;4;lC.C.C.J      0"$n n n n b,C C C JRZ1 2 2 !8!8!8F???>   ' ' ' R    P$P$P$P$P$vP$P$P$dr