ELF>"@b@8 @@@@888OO UU!U!  ]]!]!TTTDDPtd000ddQtdRtdUU!U! /lib64/ld-linux-x86-64.so.2GNU GNURUBRRԲگ³.1!124)fUa92&  {]XU|P s; d"c]5nAIo8eQa!a!.a!ta!'a!libstdc++.so.6__gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable_ZdlPvm_Znam_ZTVN10__cxxabiv117__class_type_infoE_ZTVN10__cxxabiv120__si_class_type_infoE__cxa_pure_virtual__gxx_personality_v0_ZdaPv_Znwm__cxa_throw_bad_array_new_lengthlibm.so.6_Jv_RegisterClassesexplibgcc_s.so.1_Unwind_Resumelibc.so.6fflush__printf_chk_IO_putcsrandoptindputstime__stack_chk_failputcharabortstdinmemchrstrpbrk__assert_failstrtodstrtolstrlen__cxa_atexitmemsetmemcmp__fprintf_chkstdoutfputcmemcpy__ctype_b_locoptargstderrgetopt_longfreopenfwrite__memcpy_chkstrchr__cxa_finalize_IO_getc__libc_start_mainferrorGCC_3.0CXXABI_1.3CXXABI_1.3.8CXXABI_1.3.9GLIBCXX_3.4GLIBC_2.14GLIBC_2.4GLIBC_2.3GLIBC_2.3.4GLIBC_2.2.5     * P&y Pӯk xѯ yѯ t)G` ii ii ti ui ui U!#U!U!P#V! V!@V!`V!V!V!V! V!W!+ W!>@W!M`W!bW!mW!wW!W!X! X!@X!`X!X!X!X!X!Y! Y!@Y!*`Y!5Y!:Y!GY!LY!`Z!j Z!H@Z!z`Z!~Z!Z!Z!Z![! [!h[!\!p[!x[![!p[![!0[!\![![![!0[![! [! ]![!`[![!@\!H]!\!Х\!\!p(\!`]!0\!8\!@\!`P\!x]!X\!`\!h\!Px\!]!\!\!\!\!\!\!\!.\!.\!\!]!.]!\!]!.(]!/0]!]!@]! /P]!@/X]!8]!h]!`/p]!8]!]!/]!8]!]!0]!\!Pa!Pa!Xa!\!\!]!8]!\!\!!\!! ]!!H]!!`]!!x]!!]!!_!_!_!_!_!_!`a!)a!4a!2a!5a!3a!1`! `!(`!0`!8`!@`!H`! P`! X`! ``! h`! p`!x`!`!`!`!`!`!`!`!`!`!`!`! `!"`!#`!$`!%`!&a!'a!(a!*a!+ a!,(a!-0a!.8a!/@a!0HHeD!HtH5D!%D!@%D!h%D!h%D!h%D!h%D!h%zD!h%rD!h%jD!hp%bD!h`%ZD!h P%RD!h @%JD!h 0%BD!h %:D!h %2D!h%*D!h%"D!h%D!h%D!h% D!h%D!h%C!h%C!h%C!hp%C!h`%C!hP%C!h@%C!h0%C!h %C!h%C!h%C!h%C!h %C!h!%C!h"%C!h#%C!h$%zC!h%% B!fH%H *H0H5.H=0C!HD!HŻH D!HD!H5 D!H HC!HH= D!HB!H5C!H=_HC!HC!HԹHwC!HtC!HqC!oC!iC!cC!]C!WC!?H C!HC!C!C!sUHH=B!HAWAVAUATSH dH%(HE1H=B!HtHYB!H5HH8L@HHH H5B!H=!HLH8(L(HHHBH>nHGB!LH H=HL8H0LIƋLPPHCPPPPPPPpxPh`LHނHLH=A!&H @!H=0 Dž,HMLoMtxMt$I~ I^0HtI~H{E!H9t HtI>H;Pr H;Xr HtL@IHuM$$MuL' L<H H;!H8HMdH3 %(,He[A\A]A^A_]H=?!,H?!H5 HXHtHLH @!H=?!H 1IHLmL;H H@:!H8HHHH=;?!H ?!H- 3Yd@1I^HHPTLڳH cH=<=!DH=>!H>!UH)HHvH!H5Z>!UH)HHHH?HHtH!u'H=!@f.H=a2!H?u ^fDH11Zf.;rhH 18!HĨH=̭[]A\A]A^A_f.H 7!H= -멐H5v@苌tt%H=7!L1\@H 7!H=0f@f.SGHHw(HÉGH=tLH=Ht1H=Ht^H=ެHu# C[C[ÃC[H=6!HHG1K[DC[H 6!HR1fDSHHH=Z.H޿ 6H 6!H`H߾1YH޿ H=eHٺlH޿ H=HٺH=Hٺ9H=HٺYkH޿ H=HٺEH=޳Hٺ,HH߾1H=HٺH޿ H=HٺH=HٺH޿ H=HٺH=AHٺqH=HٺfH='HٺMH=Hٺ4H=%HٺwH=Hٺ2H=Hٺ#H=HٺmH= HٺyH=pHٺH=HٺH=VHٺlH=%HٺSH=Hٺ:H=Hٺ}!H=HٺoH=IHٺH=HٺH=?HٺH=HٺH޿ H=Hٺ~HH߹1H=HٺJH=cHٺM1H=HٺHYH߹1mH=Hٺ}H=}HٺqH=HٺbH޿ H=HٺH޿ HH=$[e@AWAVH5AUAT1USI11HL-A$DID$L4(A>-MLLH'L|HH5J1!"2Au-P\t'A>H51!IAt%PށuH50!\H50!" H6A9$,HH5 []A\A]A^A_1'~Au"<@A>H5m0!I\At<\uH5Q0!\?DH590!''[fH5!0!-A~߃A<vyI@-H5/!MIA>߃A<v@-t@=PH5/!=Mw6H5>L1H5/!IuD$H7WO DGDOGGÐfu*HtF<,t4J<$HGHG$;G G$|GDHHuGD0< wJH71ʃ0 w)HNHDHHDBDA0A vۀ-t9G9G }GHVGG 1HDFDA0A w*H H7HLJЉO DFDA0A v9}9O |G$f.HHH H5GHGHGHH:HW`HOhH~H HGPHHG HG(G0HGXHHZG4G8G<G@?HwpHWxHHƇLJff.H(t f.GĀu ̀wH7u0NtB;V=H 1 @H;V$9uG@)ЁO‰G1f.HHw@HHw@ATUSHdH%(HD$1HtXHHDLc:HL`HEHHHuHT$dH3%(HEH$uH[]A\H{f.Ht!Sf.HsHHu[Ht H?t 1DH@AUATIUSHHHdH%(HD$1HHDHHH?HtHHuHLHLH}HHtjHt_IImHEIHHHtHsH}AԄuI]IHHuImHL$dH3 %(H$uH[]A\A]H$IAHt H?t 1DH@HGH9+d!USH_H=eHH9v38u/HHuH9vL< @< @ t.D1H[]DA AA @A uHH9uހ9uO9@H9vIfH9tD A8t A_u@-uIA:H@uH9wKH1!H5 H=!AHQIHHDƾH1fD1DD׃߃A@A-A_A tA zf.HH9< t< tHT$ D\$ H)H4$HL H4$D\$ T$ y@Hw6D DAAv$ tHHOH9wHEDa t u f.HH9v t t; tH!H=!H AHFHHE1sfH)D$H~pD$`AVAUATUSH_tHH9HH9DA8tA_<-HHuH9MAIƒ߃A<-t{<_tw<=HHkH)I9KQHwQfDMq@v> t9HHJI9uI[]A\A]A^f.[1]A\A]A^À t uHI9vM t t tHE!H=!H HEHHE1H!HۼH=!IEHHDHrH1fDHHt4H9r ~fDH9tsDA8t <-ufA_u`HHuH9vD<-A<_Au9߃Aw*f.HH9t< t< t< u f1HH!H=!H AHzHHE1ff.H7HWAWAVHAUATUSHdH %(H$1HH|$Ht$XH|$PHD$PHD$X+<L|$PHHD$pHD$xD$hD$lLI9HD$HsoLE1H&DHھ H)Ht8HxH9v/?%uڀ%uIcAH|plhAfDA L|$D$<1E1HD$H@8H@@@HHD$HHD$0HD$L9H@ H@(@0H@P@XH@`H@h+HD$`E1D$8HD$H$AHD$@MtHD$Hx(H<$H<$HHL)HL$ L4HD$(I~HL$ IHLLH8CD5H<$L,$Dl$8A}IH`EIH|$E'H|${HD$Dt$8L|$Lh AH9IH LL)HXHHDA?%AG<{<}+MtHD$Hx(LD$@H ׍DHLLHt$`H=!cHD$AH9ILh bf.MtHD$Hx(t!H<$Y L$$H\$A$D< tl< th< ` 1@H H=r胹 @%Ð tf@SHHہ请1f.H9wHafH{u[1Ðff.ATUSHHt#IHfDH{HLHHu[]A\ff.SHHtH{WHHu[Ðff.AUATIUSIHH(HdH%(HD$1HtDH{HLHHuAUAuH1II]Ht@HsLHHHuLI]Ht@H{HHuHL$dH3 %(uH([]A\A]HLH请*f.AWAVAUATUSHdH%(H$1 H|$MH\$H HD$D$PD$T L3MIHHD$PMfHD$0fDHHHCEL$D;HuEQE~܋5f L1I<$HA9~ At DiDY ADjAFDZ AAF8tčUA9Hc~Gf At DYDQ ADZAFDR AAF8;HA9H|$0膼H|$0貼HHM6MtIHt MfT$TL$PHHH\$$dL$`HD$0$`L$ s Mu~NIt$@HpwHT$LHD$DH$pHD$ D$@Ƅ$pDŽ$t(HD$ HHD$Lru$`IwL$ $dH$ ȳLnHT$H|$L<9Awux$ H|$LD刄$p$ H$tbM9l$DvE$pI$`$t$dHHD$ Hpl$DL$ H$pMuHD$ D$@Ƅ$pDŽ$t9HD$ HHD$LtH|$0u$`IwL$ $dH$ XL论HT$H|$L9Awwn$ H|$LD刄$p$ H$t49l$DrE$pI$`$t$dHHD$ Hp螱l$DL$ IFHD$HD$@AƄ$pDŽ$tD9AfAAmDL觸tH|$0D薸uH$pDd$l$@Ld$HHD$8D LZtH|$0J<t9l$tЋD$@tljHD$8HHD$( DtLuꋔ$d$`IwL牔$ H$ ht$L輸L貸LHT$H|$LD9w$ D$ $ H|$(L扔$tH$pDD$ E=DDd$AAD9l$DrE$pH$xI$`$tH$d蓯Dl$D$`HL$IwHy A$dHA芰 HD$HtHH$dH3%(HĘ[]A\A]A^A_H|$P111H|$00 H G GHH$dH3%("HĘH5 []A\A]A^A_گH H=}HL$Yt_Cl HÃtPAE1uXAurEt3EuH H==#H5| $BH5k 1H=U MHܢ1E1LtHL$CHËl vE^H  H=蚮<@USHH2HsHHHHtH1H[]G ~=HL19BHH9u @ҁ1AWAVAUATUSHH(= dH%(HD$1@E HIԅHt1@ 9BHH9u@IHEIt1AHA9wLuMHMnHHAUuH<$D$wLDID$Ict=t|A9MMMHcADRDJ AAFIDJAvX9rM6MuH\$dH3%(LH([]A\A]A^A_ÍIH@IcUMMAT늃tAу EA9HcM A;)1HA;  A E y膪@u A豪IE15A葪I|褫@AUATUSHHHt(IIHDH{HLL>HHuH[]A\A]Ðf.AVAUHATUHoSIIHH dH%(HD$1oI]IHtH{LLHHHuAUAuH1II]HtHsLHHHuL I]Ht@H{HHuMtL袪HL$dH3 %(u H []A\A]A^HLHЪKf.UHAWAVAUATISHdH%(HE1lIcE HH9H<˨AU HE~HuHTHHH9uHuLe9l|IEH`AU H}HI Ht1@9BHH9uZ H`L@%HUA(|I0HEdH3%(He[A\A]A^A_]IEAU H]HXHHH`^MHE1pHHDtH9rH`AU EHHHHH)HpLEE1DžxAxIT HO9r@ex9}IcM HpHHHH)HeH)ċEHHDHEAELpAfDIcM IL;eL tkHuHH&A$HLD<3D9sIcM H}HމEIL HMLLML;eDEHMLMEuD9|w AMH}HuLHM詧lD|HMA9 u>HXRxLpA ڃxeE1XH a H=fHrDxA H=+ ANHھ1(1AAtFHpDHuLA~A<tHuLLEMdD9MLEsȉ]HA9wA@6Hù1HHA(芙A(LHHC$DEHELLHC CDLEE(HELEEM@1 HA9vVEE~A<tHuLLUDMLEHMHMLEDMLUtAD AHA9wC<c11A|t HK<HA9wH<zH}LșL HEHHE1H=) AH1D;t?E1 @EHCDH= A H1ߗD9+wH= K0C(Hʉ賗H H=-&Lk MtOH5v AO{I!A9͉qA\AH)ȋK!D9]A\wHxAAI2)ƉsN!ȉHEE9EtySHuAME,I A\A!ЉUHCIHL4E.覓sEDV!AE9EEuSA1EA9zCT-A;TSe1EATtAO BLA8A`RLՑIA`LpMhLC1MHSEMH= H1 t:E1EuRHCDH= A H1ېD9#w΋MH= H1趐!H5 ,`HLHFfDAWAVAUATIUSH( fA$(I$HD$HbADŽ$XHD$ADŽ$\D$ D$H|$˵LI$_I$hAAM4$M_M$hE\$ME1MzfD1EMAtAPAH(I@ ~#I$HHtDHH9uI9AP8LAJ;M MuD9l$u-9l$ ~'A$(I$HH|$Hl$ Dl$LA$XA$\A$XfDAxHy1AH菎 H H=W%H=~ 虐M4$ME1A$\ADŽ$\A$X9A$(H\$HD$I$HADŽ$XADŽ$\HI$H܏H(H[]A\A]A^A_VH(L[]A\A]A^A_@SHH?H52ʹH[ATUSHtHHHHhAAH;HtsLhkIMc@1@MJtAQAI(IA ~$LHHtfDHAH9uIAQ8AK;MMuH5dH f.HHHuD(H@Ex8tsH@1fD‹4u HH<9(wH0Ht7(t-1f.9t HH9(w[]A\H C H=~0͍x tH  H=f~1觍=DHy1AH+ ]H H=VH= ʍ/H H=(|fAWAVAUATIUSHHhHtH;H辋 uZI$HHt裌I$@Ht葌I$0HtI$ H8H[]A\A]A^A_[H H=}11H-~eA$(u`A9$(vLI$@؋tI$HHH= RAHD1sA9$(XZwH P H=rL5ӋAD$ HA$PE$<ED$H}H= P1 YE$8H= L^H[}1D܉I,$HHEH= LH8DHf.SH Ht3H5z1莅HH߉[ 鑅[@f.J ATIUHS SHUHz0DJH tH5)v1H tH5u1D}Lt$$vtjID$D$$H tH5uD@81E)LLD-IċD$$uH CtH5u1fuH "tDD9l$ D$$D9l$L$9L$ ttHsHH5uAESHٿ1~ZYuLHT$$H3@H sH5tE1~L\HT$$LEH ِH5tH={Lq~H H5ftH={KR~Mf.USHHHH~|*HHH5tt H5tHHH1[] ~AWAVH AUATUSHHcH9IH<@H}AH$ADPHHH9H<`}HADhAADEHHH9sHH9rM' @ MNL4$ - DID$ HcP8p.fDA $H5q1zE9,IzDDpAuHT$H5;q1zЃx-H DHxf1-n0H= mm\HL$}lHeHbH5eHE1m}ttjL%etLfHH$D$;B\HL$1LrmuHExu}|uHqH56e1.m1HTGH5lD$1mH5d1lH ECA܃L-eDH5 e1lDHH=ghVlH$D$;BsYDdHL$AD$A9}H=dlfD1LDlD9uzf.9]h H5\1c9l$ uLck8kXHt$ L=XLt$0HHL$Ht$HLHL$8Ld$0Ld$ L|$( LlXH qSLDD$H5{X1ڿ^w  L BSAUH5a_SA؉Lɿ1\^[A]dH H5}W16^Hs H= H=~W] DHD$ L% L=WLt$0HD$H= X]У L H d H5^H^ 1] @H5W1]HEH VHLHt$HLd$0HL$8Ld$ L|$(H=^]H=W ]H=Y\HD$HdH3%(z HX[]A\A]A^A_@H5DW1]HEH IH8IH59SHD19MH=yILID$8I9D$0A|$@cI|$0IT$8H H)5NH) ML$HLa H  H5W5 1LXZ fH5AS11۽LB@C$H5H1ڿoLt?,zLt*)9uH5pH1-LH=bHK (H5fT1Kܑ H H5NPu!H5Puu H5@tH5PIHѿ1KH=`T[KH=GOKy @LH51]KH5LG1=KI|$pTH=JGJfH HLH$DH=GJސ CJ0H{ HLH$H?HD$HH51JH \?HgFH  IT$H5]T1iJS H H5Ou!H5Ouu H5?tH5OHѿ1!JH=ZTIH=UFI PH5f1ItH5NIHѿ1IH=P?[\]`{|}~in_word_setPerfect_Hashhashwordlistlengthtablestringpool,No key positions selected. GNU gperf %s 1989-2017Bruno HaibleDouglas C. SchmidtWritten by %s and %s. Invalid value for option -s. output-fileignore-casedelimiterslanguageslot-nameinitializer-suffixhash-fn-namehash-function-namelookup-fn-namelookup-function-nameclass-nameseven-bitcompare-strncmpreadonly-tablesenumincludesglobal-tableconstants-prefixword-array-namelength-table-nameswitchomit-struct-typekey-positionscompare-strlencompare-lengthsduplicatesfastinitial-assojumpmultiple-iterationsno-strlenoccurrence-sortpicstring-pool-namenull-stringsrandomsize-multiplehelpversiondebug dumping Options: TYPE is........: %s UPPERLOWER is..: %s KRC is.........: %s C is...........: %s ANSIC is.......: %s CPLUSPLUS is...: %s SEVENBIT is....: %s LENTABLE is....: %s COMP is........: %s CONST is.......: %s ENUM is........: %s INCLUDE is.....: %s GLOBAL is......: %s NULLSTRINGS is.: %s SHAREDLIB is...: %s SWITCH is......: %s NOTYPE is......: %s DUP is.........: %s NOLENGTH is....: %s RANDOM is......: %s DEBUG is.......: %s lookup function name = %s hash function name = %s word list name = %s length table name = %s string pool name = %s slot name = %s initializer suffix = %s asso_values iterations = %d jump value = %d hash table size multiplier = %g initial associated value = %d delimiters = %s number of switch statements = %d all characters are used in the hash function maximum keysig size = %d key positions are: unsupported language option %s, defaulting to ANSI-C Try '%s --help' for more information. GNU 'gperf' generates perfect hash functions. Usage: %s [OPTION]... [INPUT-FILE] If a long option shows an argument as mandatory, then it is mandatory for the equivalent short option also. --output-file=FILE Write output to specified file. The results are written to standard output if no output file is specified or if it is -. -e, --delimiters=DELIMITER-LIST Allow user to provide a string containing delimiters used to separate keywords from their attributes. Default is ",". -t, --struct-type Allows the user to include a structured type declaration for generated code. Any text before %%%% is considered part of the type declaration. Key words and additional fields may follow this, one group of fields per line. --ignore-case Consider upper and lower case ASCII characters as equivalent. Note that locale dependent case mappings are ignored. Language for the output code: -L, --language=LANGUAGE-NAME Generates code in the specified language. Languages handled are currently C++, ANSI-C, C, and KR-C. The default is ANSI-C. -K, --slot-name=NAME Select name of the keyword component in the keyword structure. -F, --initializer-suffix=INITIALIZERS Initializers for additional components in the keyword structure. -H, --hash-function-name=NAME Specify name of generated hash function. Default is 'hash'. -N, --lookup-function-name=NAME Specify name of generated lookup function. Default name is 'in_word_set'. -Z, --class-name=NAME Specify name of generated C++ class. Default name is 'Perfect_Hash'. -7, --seven-bit Assume 7-bit characters. -l, --compare-lengths Compare key lengths before trying a string comparison. This is necessary if the keywords contain NUL bytes. It also helps cut down on the number of string comparisons made during the lookup. -c, --compare-strncmp Generate comparison code using strncmp rather than strcmp. -C, --readonly-tables Make the contents of generated lookup tables constant, i.e., readonly. -E, --enum Define constant values using an enum local to the lookup function rather than with defines. -I, --includes Include the necessary system include file at the beginning of the code. -G, --global-table Generate the static table of keywords as a static global variable, rather than hiding it inside of the lookup function (which is the default behavior). -P, --pic Optimize the generated table for inclusion in shared libraries. This reduces the startup time of programs using a shared library containing the generated code. -Q, --string-pool-name=NAME Specify name of string pool generated by option --pic. Default name is 'stringpool'. --null-strings Use NULL strings instead of empty strings for empty keyword table entries. --constants-prefix=PREFIX Specify prefix for the constants like TOTAL_KEYWORDS. -W, --word-array-name=NAME Specify name of word list array. Default name is 'wordlist'. --length-table-name=NAME Specify name of length table array. Default name is 'lengthtable'. -S, --switch=COUNT Causes the generated C code to use a switch statement scheme, rather than an array lookup table. This can lead to a reduction in both time and space requirements for some keyfiles. The COUNT argument determines how many switch statements are generated. A value of 1 generates 1 switch containing all the elements, a value of 2 generates 2 tables with 1/2 the elements in each table, etc. If COUNT is very large, say 1000000, the generated C code does a binary search. -T, --omit-struct-type Prevents the transfer of the type declaration to the output file. Use this option if the type is already defined elsewhere. -k, --key-positions=KEYS Select the key positions used in the hash function. The allowable choices range between 1-%d, inclusive. The positions are separated by commas, ranges may be used, and key positions may occur in any order. Also, the meta-character '*' causes the generated hash function to consider ALL key positions, and $ indicates the "final character" of a key, e.g., $,1,2,4,6-10. -D, --duplicates Handle keywords that hash to duplicate values. This is useful for certain highly redundant keyword sets. -m, --multiple-iterations=ITERATIONS Perform multiple choices of the -i and -j values, and choose the best results. This increases the running time by a factor of ITERATIONS but does a good job minimizing the generated table size. -i, --initial-asso=N Provide an initial value for the associate values array. Default is 0. Setting this value larger helps inflate the size of the final table. -j, --jump=JUMP-VALUE Affects the "jump value", i.e., how far to advance the associated character value upon collisions. Must be an odd number, default is %d. -n, --no-strlen Do not include the length of the keyword when computing the hash function. -r, --random Utilizes randomness to initialize the associated values table. -s, --size-multiple=N Affects the size of the generated hash table. The numeric argument N indicates "how many times larger or smaller" the associated value range should be, in relationship to the number of keys, e.g. a value of 3 means "allow the maximum associated value to be about 3 times larger than the number of input keys". Conversely, a value of 1/3 means "make the maximum associated value about 3 times smaller than the number of input keys". A larger table should decrease the time required for an unsuccessful search, at the expense of extra table space. Default value is 1. Informative output: -h, --help Print this message. -v, --version Print the gperf version number. -d, --debug Enables the debugging option (produces verbose output to the standard error). Report bugs to . acCdDe:Ef:F:gGhH:i:Ij:k:K:lL:m:nN:oOpPQ:rs:S:tTvW:Z:7Starting program %s, version %s, with debugging on. Initial value %d should be non-zero, ignoring and continuing. warning, -r option superceeds -i, ignoring -i option and continuing Jump value %d must be a positive number. Jump value %d should be odd, adding 1 and continuing... Invalid position value or range, use 1,2,3-%d,'$' or '*'. Duplicate key positions selected asso_iterations value must not be negative, assuming 0 warning, -r option supersedes -i, disabling -i option and continuing Size multiple %g is excessive, did you really mean this?! (try '%s --help' for help) Size multiple %g is extremely small, did you really mean this?! (try '%s --help' for help) number of switches %s must be a positive number Copyright (C) %s Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Extra trailing arguments to %s. optimized-collision-resolution:77777777777:99999979x97`98@9(9788778778777777878H8088877H755X5H58874h4P473777777777 5P98588?HB #<15Keyword_Factorydefine(standard input)%s: The input file is empty! 7bit%s:%u: unterminated string %s:%u: missing argument in %%define %s ARG declaration. %s:%u: junk after declaration %s:%u: missing argument in %%%s=ARG declaration. %s: error while reading input file %s:%u: warning: junk after %%%% is ignored %s:%u: %s:%u: only one %%{...%%} section is allowed %s:%u: %%} outside of %%{...%%} section %s:%u: %%{...%%} section already closed %s:%u: warning: junk after %%} is ignored %s:%u: warning: %% directives are ignored inside the %%{...%%} section %s:%u: number of switches %s must be a positive number %s:%u: unrecognized %% directive %s:%u: unterminated %%{ section %s: missing struct declaration for option --struct-type %s:%u: declarations are not allowed in the keywords section. To declare a keyword starting with %%, enclose it in double-quotes. %s:%u: octal escape out of range %s:%u: hexadecimal escape without any hex digits %s:%u: hexadecimal escape out of range %s:%u: invalid escape sequence in string %s:%u: string not followed by delimiter %s: No keywords in input file! JJJJJJJJJJJJJJTJTJTJTJTJTJTJTJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJAJ.JJJJJJJJJJJJJJJJIJIJIJ}I dumping boolean array information size = %d iteration number = %d end of array dump dumping the hash table total available table slots = %d, total bytes = %d, total collisions = %d location, %*s, keyword keysig end dumping hash table %8d, %*s, %.*s bool array size = %d, total bytes = %d Empty input keyword is not allowed. To recognize an empty input keyword, your code should check for len == 0 before calling the gperf generated lookup function. Option --seven-bit has been specified, but keyword "%.*s" contains non-ASCII characters. Try removing option --seven-bit. %d input keys have identical hash values, examine output carefully... %d input keys have identical hash values, try different key positions or use option -D. total non-linked keys = %d maximum associated value is %d maximum size of generated hash table is %d dumping the keyword list without duplicates Key link: "%.*s" = "%.*s", with key set "], expected number of iterations between %g and %g. try options -m or -r, or use new key positions. Internal error, unexpected duplicate hash code dumping occurrence and associated values tables Dumping key list information: total non-static linked keywords = %d total keywords = %d total duplicates = %d maximum key length = %d List contents are: (hash value, key length, index, %*s, keyword): asso_values[%c] = %6d, occurrences[%c] = %6d Computed positions: Computed alpha increments: %u:+%u". use option -D. keyword #, %*s, keyword end of keyword list %9d, Step %u chooses _asso_values[Keyword equivalence classes: '%c' %.*s (re-initialized bool_array) Step %u chose _asso_values[] in %u iterations. try options -m or -r. end table dumping selcharsEnd dumping list. %11d,%11d,%6d, #define %s %d %senum %s { %s %s = %d#line %u %*slengthptr = &%s[%d]; %*swordptr = &%s[%d]; %*sif (len == %d) %*s { %*sresword = &%s[%d]%*sgoto compare; %*s } %s ,%s%*sif (key < %d) %*s { %*s } %*selse %*s { ./output.cc%*sif (key == %d) %*s { %*sswitch (key) %*sswitch (key - %d) %*s case %d: %*s break; %s %s%s%s keyword = %.*s, index = %d dup_ptr->count >= 2 %s %s }; %*dTOTAL_KEYWORDSMIN_WORD_LENGTHMAX_WORD_LENGTHMAX_HASH_VALUE(((unsigned char)* ^ (unsigned char)*) & ~32) == 0 == * && !gperf_case_strcmp ( + 1, + 1strncmp ( + 1, len - 1, len) && [len] == '\0'memcmp (str[len - 1]str[%d]static_cast((unsigned char)unsigned charunsigned shortunsigned intlen + hvalinline %s:: }; return %s /*FALLTHROUGH*/ case %d: hval += /*ARGSUSED*/%sstatic %s%s %s[] = %s { %s }; %sstruct %s_t %s { %s char %s_str%d[sizeof()];%sstatic %s[] = %s { -1(char*)0""%s} && key >= %sMIN_HASH_VALUE) { %s%s%s *lengthptr; %s*wordptr;*wordendptr;*resword; %s%sresword; return 0;%*s %s%schar *s = wordptr->%s*wordptr + %s; %*s if (str) %*s return %s; %*s } %*s lengthptr++; compare:; if (resword) return resword; }.%s) %*s return &%s[index]; %*s } %*s %s%*s %s%schar *s = ; %*s if () %*s return %s; %*s } %*s lengthptr++; %*s} %*sif (len == %s[key]) %*s{ %*s %sint o = %s[key]; %*s if (o >= 0) %*s { %*s %s%schar *s = o; %*s if () %*s return &%s[key] } return 0;s && %s%s const char *#errorregister const /* /* Computed positions: -k'' */#include %3d }; #endif %*s/* hash value = %4d, keyword = "%.*s" */ %*swordendptr = wordptr + %d; %*sgoto multicompare; (int)(size_t)&((struct %s_t *)0)->%s_str%d /* hash value = %d, index = %d */%*s/* know %d <= key <= %d, contains %d cases */ min_hash_value <= lowest_case_valuelowest_case_value <= max_hash_valuestatic linked keyword = %.*s, index = %d dup_ptr[%lu]: hash_value = %d, index = %d, count = %d lookup_array[dup_ptr->hash_value] == dup_ptr->index%sstatic %s%s lookup[] = %s {(str, len) %schar *str; %ssize_t len; (str, len) %sconst char *str; %ssize_t len; (%sconst char *str, %ssize_t len) #ifdef __GNUC__ __inline #else #ifdef __cplusplus inline #endif #endif static %s%s asso_values[] = { %sunsigned int hval = %s; switch (%s) { default: break; } return hval%sstatic %sstruct %s_t %s_contents = %s { %s#define %s ((%schar *) &%s_contents) if (len <= %sMAX_WORD_LENGTH && len >= %sMIN_WORD_LENGTH) { %sunsigned int key = %s (str, len); if (key <= %sMAX_HASH_VALUE%*s if (len == *lengthptr) %*s { %*s wordptr++; %*s } %*s return 0; { %s%schar *s = resword->%s) return resword; } if (key <= %sMAX_HASH_VALUE) %*s{ %*s %sint index = lookup[key]; %*s if (index >= 0) %*s { %*s if (len == %s[index]) %*s { %*s %s%schar *s = %s[index]%*s else if (index < -%sTOTAL_KEYWORDS) %*s { %*s %sint offset = - 1 - %sTOTAL_KEYWORDS - index; %*s %s%s%s *lengthptr = &%s[%sTOTAL_KEYWORDS + lookup[offset]]; *wordptr = &%s[%sTOTAL_KEYWORDS + lookup[offset]]; *wordendptr = wordptr + -lookup[offset + 1]; %*s while (wordptr < wordendptr) %*s { %*s if (len == *lengthptr) %*s { %*s wordptr++; %*s } %*s } %*s{ %*s %s%schar *s = %s[key]%*smulticompare: %*s while (wordptr < wordendptr) %*s { (s1, s2, n) %schar *s1; %schar *s2; %ssize_t n; (s1, s2, n) %sconst char *s1; %sconst char *s2; %ssize_t n; (%sconst char *s1, %sconst char *s2, %ssize_t n) (s1, s2) %schar *s1; %schar *s2; (s1, s2) %sconst char *s1; %sconst char *s2; (%sconst char *s1, %sconst char *s2) code produced by gperf version %s */ %s "gperf generated tables don't work with this execution character set. Please report a bug to ." /* maximum key range = %d, duplicates = %d */ #ifndef GPERF_DOWNCASE #define GPERF_DOWNCASE 1 static unsigned char gperf_downcase[256] = {#ifndef GPERF_CASE_MEMCMP #define GPERF_CASE_MEMCMP 1 static int gperf_case_memcmp { for (; n > 0;) { unsigned char c1 = gperf_downcase[(unsigned char)*s1++]; unsigned char c2 = gperf_downcase[(unsigned char)*s2++]; if (c1 == c2) { n--; continue; } return (int)c1 - (int)c2; } return 0; }#ifndef GPERF_CASE_STRNCMP #define GPERF_CASE_STRNCMP 1 static int gperf_case_strncmp { for (; n > 0;) { unsigned char c1 = gperf_downcase[(unsigned char)*s1++]; unsigned char c2 = gperf_downcase[(unsigned char)*s2++]; if (c1 != 0 && c1 == c2) { n--; continue; } return (int)c1 - (int)c2; } return 0; }#ifndef GPERF_CASE_STRCMP #define GPERF_CASE_STRCMP 1 static int gperf_case_strcmp { for (;;) { unsigned char c1 = gperf_downcase[(unsigned char)*s1++]; unsigned char c2 = gperf_downcase[(unsigned char)*s2++]; if (c1 != 0 && c1 == c2) continue; return (int)c1 - (int)c2; } }class %s { private: static inline unsigned int %s (const char *str, size_t len); public: static %s%s%s (const char *str, size_t len); }; #if !((' ' == 32) && ('!' == 33) && ('"' == 34) && ('#' == 35) \ && ('%%' == 37) && ('&' == 38) && ('\'' == 39) && ('(' == 40) \ && (')' == 41) && ('*' == 42) && ('+' == 43) && (',' == 44) \ && ('-' == 45) && ('.' == 46) && ('/' == 47) && ('0' == 48) \ && ('1' == 49) && ('2' == 50) && ('3' == 51) && ('4' == 52) \ && ('5' == 53) && ('6' == 54) && ('7' == 55) && ('8' == 56) \ && ('9' == 57) && (':' == 58) && (';' == 59) && ('<' == 60) \ && ('=' == 61) && ('>' == 62) && ('?' == 63) && ('A' == 65) \ && ('B' == 66) && ('C' == 67) && ('D' == 68) && ('E' == 69) \ && ('F' == 70) && ('G' == 71) && ('H' == 72) && ('I' == 73) \ && ('J' == 74) && ('K' == 75) && ('L' == 76) && ('M' == 77) \ && ('N' == 78) && ('O' == 79) && ('P' == 80) && ('Q' == 81) \ && ('R' == 82) && ('S' == 83) && ('T' == 84) && ('U' == 85) \ && ('V' == 86) && ('W' == 87) && ('X' == 88) && ('Y' == 89) \ && ('Z' == 90) && ('[' == 91) && ('\\' == 92) && (']' == 93) \ && ('^' == 94) && ('_' == 95) && ('a' == 97) && ('b' == 98) \ && ('c' == 99) && ('d' == 100) && ('e' == 101) && ('f' == 102) \ && ('g' == 103) && ('h' == 104) && ('i' == 105) && ('j' == 106) \ && ('k' == 107) && ('l' == 108) && ('m' == 109) && ('n' == 110) \ && ('o' == 111) && ('p' == 112) && ('q' == 113) && ('r' == 114) \ && ('s' == 115) && ('t' == 116) && ('u' == 117) && ('v' == 118) \ && ('w' == 119) && ('x' == 120) && ('y' == 121) && ('z' == 122) \ && ('{' == 123) && ('|' == 124) && ('}' == 125) && ('~' == 126)) /* The character set is not based on ISO-646. */ void output_switches(KeywordExt_List*, int, int, int, int, int)void Output::output_lookup_array() const16Output_Constants14Output_Defines11Output_Enum11Output_Expr12Output_Expr114Output_Compare21Output_Compare_Strcmp22Output_Compare_Strncmp21Output_Compare_Memcmp?Cannot open input file '%s' -wCannot open output file '%s' error while writing output file 18KeywordExt_Factory./getline.cc*n - nchars_avail == (size_t) (read_pos - *lineptr)int getstr(char**, size_t*, FILE*, char, size_t);`, <| L$< <\, |\t ,L4lLd|  < t  l    $  ,$ << t      \  l | |-< -\ . . . l0 \1d l1| 1 1 3<343T3,45=L<>t>@@A\LFLLNOD\Pl|Z] <],l_\t@D[ A {\hXKBD A(D0(A ABBV0N (F ABBG zPLRx*  $HrCPBB B(A0A8KDEEHGLGGGGGAAKGLGGGGGBBBABBANLR 8H0A(B BBBY 4 Ac D G A G I b F GD`\hAL|PBBI B(C0A8P@ 8M0A(B BBBJ  (,D\t ( 0 8 D4@BBB A(D0Jp 0A(A BBBD | U4BAD J@  AABF xTAR4 Ld |  4BAA D0h  AABA @8(F`H<4PBBD A(J@ (A ABBA t<XAT0A AAH C0LX BBB A(A0 (A BBBK A (C BBBA  4 \D 'BBE B(F0A8G 8A0A(B BBBD  B] 8!BAw H A$h!KHO I j!Dp!T,!BBE B(A0A8D@aHBPPHK@ 8H0A(B BBBS LP#BBE B(D0A8D` 8D0A(B BBBD # ,#9FAG gAA4 TsAAG y AAD NAAT #l #WD A  $ %sNa, `%4BAA lAB p%#Aa< %xBBD A(JP (A ABBA dT 0&BBB B(A0A8G!R 8A0A(B BBBA R 8H0A(B BBBE $ .8AAG jCA .HL . BBB B(A0A8G`. 8A0A(B BBBA 4L 0EBBA A(D0t(A ABBD| 0BBE A(E0MP 0A(A BBBA , 1OAC HK% A < 5 AC HH+.t. A L4 x;V BBB B(A0A8D` 8D0A(B BBBA $ =AC C A $ >Jm I G4 >  AC HHl A d HBBB B(D0A8D`g 8D0A(B BBBE D8D0A(B BBB| KAV, K-BAA ^ ABA | M0 BBB B(D0A8D@u 8A0A(B BBBE eHHPdHA@oHiPHHW@ 8A0A(B BBBL(dO|@O  8O$@O$Ab$DPOOAAM0}AAlxO,AdO,OAC HN A <PBBB A(D0 (A BBB[ PBAt K Ad4 QFHDD (R0H(M A ABE ~ ABG p(_0H(H X(M0T(A aAB4SAAI0 AAB Z AAT SBBB B(D0A8LpxN_xAp`xH`xBpM 8A0A(B BBBJ DxO\xBp"xPPxAp\x tp h ` X P $xVGAAM jHATV[BBL B(A0A8DPXT`WXAPj 8D0A(B BBBE l[AX\1\$\AAM sAA4\AAJ { FAB NCA<h]BAD h ABN q ABL ,\^BAD  ABX <^BAD { ABK q ABL 4_sFAR a AAD DMA4_AAR t FAI kFA<<8`BBA A(GP0 (A ABBE l|fBBI B(H0A8N@wHPP[HA@+ 8A0A(B BBBB 8F0A(B BBBlhBBI B(H0A8UP-XI`bXAPB 8A0A(B BBBF \8F0A(B BBBL\xkBBI B(H0A8SP^ 8K0A(B BBBS HnPn+$hnGu L V B \ L ,nNBBB B(A0A8V"BXA HUB2 8A0A(B BBBE MFHVMFHaVBIQYFFFnWFBEBLEOAH[]IBAM]AmM_B,4|AAN@) AAE Dd~;BAD D@`  AABA 0H[PMHA@,,BAD aAB!HT< AO Pm.L. A |TPaBB B(D0A8G`{ 8A0A(B BBBH  8F0A(B BBBA E x pCDeBBE B(H0H8M@r8A0A(B BBBdЇP$:)w=,JLMa  T)(/M?.#P#etLK FH+H>NMNbZm7wcCEIGWSTk ll*D5f:iGjLm`njoHOzP~Qrshvd\!p0\!0 ]!`@H]!Хp`]!`x]!P]!\!..\!.\!./]! /@/8]!`/8]!/8]!0\!*G H U!U!o  `!H p ooX oo ob]!v&6FVfv&6FVfvPa!ce52550742528552a2d4b2daaf15abc2b39d2e.debugX.shstrtab.interp.note.ABI-tag.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.plt.got.text.fini.rodata.eh_frame_hdr.eh_frame.gcc_except_table.init_array.fini_array.jcr.data.rel.ro.dynamic.got.plt.data.bss.gnu_debuglink 88TT !tt$4o8> FNo l[oX X jH H p tB~HHy``p Z 00d55NNU!UU!UU!UV!V ]!]_!_0`!`HHa!Ha  a!ha( ha4a!