ELF >@@hH@8@@@@@@@@@@?? @@a@ax 0@0@a0@a@@Ptd%%A%AQtd/libexec/ld-elf.so.1FreeBSDX %4$ -#* 0'& 23!"% /  )1+,(.'! CL8',.ȁ ҜcŦݣk bd|PvӪͶ2hxIk#a !h3Sy-/'ni aexZLX![5 @J T8+/$G)UZ!CaX*!DaXIaDa@IaPCa(CaCa1Ca@`Da@"Dalibstdc++.so.6_Jv_RegisterClasses_Znwm_ZTVN10__cxxabiv120__si_class_type_infoE_ZdlPv_ZTVN10__cxxabiv117__class_type_infoE__cxa_pure_virtual__gxx_personality_v0_ZdaPv_Znamlibm.so.5explibgcc_s.so.1_Unwind_Resumelibc.so.7__prognameenvirongetopt_longabortmemchr__cxa_atexitatoi__stdinpoptindstrpbrkmemcpygetc__assertputsstrlenferrorsrand_init_tlsfprintffwriteputcharisprintmemset__stdoutpfputcstrchrfflushstrtod__stack_chk_failtime__stack_chk_guardfreopen__stderrpoptarg_endGCC_3.0FBSD_1.0CXXABI_1.3GLIBCXX_3.4 P&y   (z0ӯkt)%(zCa.Ca/Ca-Ca'Da(`Da1Da*Da3Ba Ba(Ba0Ba8Ba@BaHBaPBa XBa `Ba hBa pBa xBaBaBaBaBaBaBaBaBa0BaBaBaBaBaBaBaBaCaCaCa Ca! Ca2(Ca"0Ca#8Ca$@Ca%HCa&HH5v1!%x1!@%v1!h%n1!h%f1!h%^1!h%V1!h%N1!h%F1!h%>1!hp%61!h`%.1!h P%&1!h @%1!h 0%1!h %1!h %1!h%0!h%0!h%0!h%0!h%0!h%0!h%0!h%0!h%0!hp%0!h`%0!hP%0!h@%0!h0%0!h %0!h%0!h%~0!h%v0!h %n0!h!%f0!h"%^0!h#%V0!h$%N0!h%%F0!h&UHAULoATSHH=m6!HcLdH^6!IDąHQ6!~:HWHt1H/!t#HA$ uA$ t t u"III9uHHGH=`'!HDX@1 @AWAVAUATUSHH<$H$H$H$HDŽ$HDŽ$HRL$HE1HD$pHD$xDŽ$DŽ$LLL9HD$vQ1HxH9|$v)?%u %HT$ H)YHũA  1Ll$E1D9HD$D$(eAFHHLpHHL$ H $HHQ8HT$AHHQ@L9l$H$HD$0HD$8HB HB(B0HBPBXHB`HBhE1MD$,D$DMtH $Hy(H|$0fH|$0MM)MtHI~EHHH|LLBD5H|$0Dl$DE1ADHHËD$DVH|$8D$,At H|$8hH$Hl$0H\$8Dl$DLr L;|$D$,MHT$ LL)L|$HPHLEA<$%AD$<{3<}MtH$Hz( T$,L$@LLH$DaL;|$H$Lp UMtH $Hy( $$! H|$0YHL$0Ll$8H< tU< tQ< j!H¾@1H $Lq ]H;l$0t4HHXHHHHIrH|$0xLd$0AEH$H|$0BXHD$0H9D$0s'fDP t t uHH9D$0rH|$0tHL$09d@HH=u!1HMI)I~RLHHI1I9v 1A|$ I)LDC>>ADmH$H=!H¾@1~T$,L$2@LL T$,L$;@LLvH$Da#H$Lr HkI9v"C< tH|$PtHHkMLhCaM)V!DRMI)I} LHHIy1I9v 1A|$ I)LDCD5 !udLd$pL'?%|L H)HPHLHEL9r?E11H$DaH$Lp Ld$p!;L$\H=P!H¾@1$L$\H=,!H¾@1 L$\H=!H¾@1DT$,L$@LL5H$Da$ !H$Lp D$`HD$HH$HHzpAL$`H$H$HxH$HL$HBHJHĸ[]A\A]A^A_ËT$,&@LLI L!H$Lr JT$,L$E@LLST$,L$X@LL//H$DaH$Lp <{k<;c< [HutH$ !Lr T$,@LLtH $ !Lq T$,@LLtH$ ^!Lp `T$,@LLtH$ /!@Lr 1T$,L$@LL:tH$Da4 H $Lq T$,@LLCtH$ ! Lp T$,L$@LLtH$Da H$Lr T$,L$ @LL4H$Dac H=!L$H‹L$,X@1L$,H¾@HHw@HHw@f.DfDAUATIUSHHHHHHHHt HHHuH:LHLl$HLHHHtNHLl$t[Ll$ImIHI]Ht#Ht5HsH}AԄuI]IHHuImH\$HH[]A\A]I]fDDfDHStHHHu[AUATUHSHHLl$t5Ll$@Le>HHLI]HmIHuIEHD$H[]A\A]fDfDH@H@H@@H@H@H HtfAVIAUIATUHSHw;u1KE1;sH~B H9AA9uKE1D)HD;cHDDAt$H>9E~{HcHEMtAMtADH9sv3Dt%uHcUHEDNjKAA)hH)HHE(H} H[]A\A]A^1E1:f.SHD[(IADHHXA D9A@DHHJ@JHHH@D9v A :A@DAHHIcDGE E9I ~&D HEHHRDIcDGE E9[D뫐fDfD1H\$Ld$HLl$AHIͿ@FHD`Lh@H'HH"u'f3<\t#<$t<`@t;Ht<"uٿ\ݿ" AID9mUHA1[]A\A] H޿e@1뽿'Pu#;H;t<\u\&ݿ'xH-B<wHB<v-HB<vB<v-tހ==HfSHH.@1H޿ H!H߾@1nH޿ Hٺl0@H޿ Hٺq@Hٺ9@HٺY@H޿ KHٺ@tHٺ@@]H߾(@1Hٺ@7H޿ HٺH@Hٺh@H޿ Hٺ@HٺqP@Hٺ@Hٺh@Hٺ@|Hٺw@eHٺ2@NHٺ#H@7Hٺmp@ Hٺy@ Hٺ`@Hٺ@Hٺx@Hٺ`@HٺP@Hٺ}@Hٺx@hHٺ@QHٺ@:Hٺp@#H޿ Hٺ@HߺX@1KHٺ@HٺMP@Hٺ@Hߺx@1Hٺ}P@{Hٺq@dHٺbH@MH޿ Hٺ@)H޿ Hٺ([@AWLAVAAUIATIUSHXHA4$IT$H7 It$A<$E1@@47LvH=L G$`@H H= @1H= @@1H= '@4@G@11AL$TH=l Ht$HHD$HH;V D$ t5/lHXHt$HHmHD$HH9M8DZZD$^WAD$@.[WAD$@.. .H H= ZP@sAT$4AL$]H E@ =HU ID$x,AL$fH=4 kAD$8H { 7x@AD$8AL$AL$H5 H|$ AA$H 8*LHAƄ$(pH1H)‰UHH|$ uHL)HAA$A$ A$AAAIA9)DfqA9|ȉ9ADDuAE9A5DEAuAA$AsH=y AD$0?7BH= @AD$01GH=/ fAD$45 H i DX@H= D1AL$ AL$H I$AL$ H @H H= 1bAL$THl ID$ CH[ ID$`2HJ ID$p!AL$AL$H=" YAD$<H H=b @1H=O JH I$AL$@H ID$HH5 ID$(LeqH ID$P`AL$RHj ID$hAAL$3HK ID$X"AL$AL$AL$AL$@/AD$@?AƄ$ADŽ$LHu A9~HcIDID$AA9Ɖ HX[]A\A]A^A_ J^AL$@ENH !P@H= xHM H= Z@'@H=e 1 H=W R$H=A ¾@1߽DH  @T@H H= @1薽H @0@~>@M@HOHÐf.HHAH@8H҉u fDHHHuHB@8HfH1HtfDHHuÐfATIHSHHHHAT$`H߾Z@PHAT$hH߾i@PHAT$dH߾y@PHA$H߾@PHHA$@PHHLXH[A\AfHw1e@鼻SHwH1@H襻C[Ðf@1鐻@AWAA%AAVAUATUSHH^ dLDaL H HM1L@:L+M!E11A$I I]tu H{0D;c8}@ufE"*s1AAºH[0H, A)¸Љ)ЅuL@zL@k11A]AD9c8sE~ ,蠻A)‰)ЅuMmM1L@ uH[]A\A]A^A_H []A\A]A^A_.fU1H$ASH赹1@詹tK1 @薹HxHcӋ4uH][]պ<$A1iH][]鹺@1MH][]靺UHSHH t>@1HH'@1HEH;@1H1[]ÿ*?HHI@1˸HEHH[]f.ATUHSHaO@A1莸{ 1a@uEtTHEHk@1[HHr@1G@1;HH[]A\@1#HEHo@1HH@1DU@1ZSHt Hs@1[駷f. fDAVx AU ATIUSL  ƒ%AL$p;   ƒM@ H5Q ,@1 Au`A1Զ@ʸED$pE @G@wAHD1蛶[]A\A]A^A鉸AD$tA;D$h>AA|t/@`N A ¸%AHDZA+@1A$AH5 H¿A1A$gfff)~ȺgfffA)ʅ҉A$tf1A9@1荵I$D@H1mCA9$v#t,谶A9u뤿@3AL$pjA|$lAt$dMt$lpE1A9t$t|LE1 fBxH9 AA9uA9ͻsDAA\tA;\$h @G@A%@HDHD1萴AT$d9GE9n,DA\AuԿPA1S@1GLnFA0H5h @1@1 @%A@HD1A|$pu/QLE9nvDA\t@1A誳uYE1AA)At$tuA|$xu˾L@1\1LPA1ACvs>@@1 LJFA E9nv9DAA\Cv*9}¿@1@Ӳ9|롻A9l$h~1PA赲rT@蝴A9l$hՉ1@舲A9l$h~H\$Hl$HLd$HIt @QHsL@1}u u!H$Hl$Ld$HËuH}뱋U Au`AffD1%@ tV@HD$ AHt$ H AHD$ A贑HP[fH$0AHD$AHH4~ H$AfD@rrHI gHD$@0AHt$@HzAHD$@A#HP[ÐHD$0pAHt$0HJAHD$0AHP[ÐuH bA ¸%AHDH5 @1虎1P A芐HMf.AUIATUSH8=H  ‰ Шt5H NA)H %A%AH &H %AH| %AHy %AAu*H X UA[AHЀ9HDIE9HDIU @EV@IE(bA1臍u L H5ο A1NDaH 蚎)  胎A}\tAMpE 8IE8I9E0m t *AA1AA+行  -Lq @tutLKU tLLIEPI9EHs%A}XI}HIUPH H)-H= AH8[]A\A]IE fNA%AHo NAHDC0j1 A迋 ?APA1蠋A薍IE8I9E0A}@3I}0IU8H H)siL MEpAH H 1H5{ 26@1!fA1I}l;AA11A3fDCs AC1Ċv0HHt:A)9uA1莊밿,HދHuƿAkY A1H6 Au%AuA ¸%AHD1 @AA ZHD$ pAHt$ L{HD$ AA迋 @A見 H$0AHD$%AHL#H$AAhA1TB Au%AuHA ¸%AHD1AA fA}I}ռ ;@1ЈjB@1迈Y`A1讈 Au%AuA ¸%AHD1rAhA^L HHA HAÐHAÐHAHAÐHAÐHAHAÐHAÐHA鐇HA逇HAÐHA`HAPHAÐHA0HAÐHAOt-HD9pt$HfDB9tH9u1ø@ÐATUS?oE1H\t1t[p!@1舆t*9CtQH1҃uAtH1Et%td[]A\$顇D,蒇[]A\ÿ-Ht@39st!@11[]A\*K,A[]A\$33!@1…1WHWtSHDHA9ti}BAAt9H9t`9|,HQDAH9tGH9|DAAJuH  `A,@ƆBGHD oHÐfHOtZȅHHPt@@9t7BHt+9uH A)ƄLrGHH ] A(蕄H7GGÐJ @%Ð 1Ʌ~1D9BȃH9u @%ÐfUHSt\HLMtCMډIBE1D@(E~HH 119HAD9uM9t#A9u#MMuH[(Hu[]DD[]1fDG8;F8ÐfHH7GHHt HGHuHG GHt)HJA9G }G A9G~GHHuދGtm @t?HIt7I@PH~!9x,Hω@GHxuMMuHH=x A1>H [ A薂SHH?@菤H[f.1G Su[HljHHt11fH9u1ҍBaHHu[HUSHHHuHH;Hk(HŁHuH[]ÐfDfDAVIAUIATE1 UHSu []LA\A]A^HOljH>It11AH9uMmMt}M]]AK$1;MH~B H99u9fDLA;KIHcDA@AP DFA@wTtHcEDD Ex9HcI4DA9u*A@HIDHH€D9u Dy]9\MmM}M]AK1!@)IcSIDD@:1fDAWAVIAUATUSHL?HD$M HD$MgE1Ic|$(HAT$(HŅ~5I|$ 11B<0t DATHA9t$(H|$H\$ H[(H{ D9uEHSt&;EHHtӋQFHH9uuHtHsـLHH?H;tSHCH(HkM?CM H|$tH\$H{HtH[(HuHD$H[]A\A]A^A_H+믿0cHHH@@HhDh H@(HD$H\$H0!HH@(HH@@HhDh HD$HX(HH~HAUIATIUHSHHHtDH{HLLNHHuH[]A\A]Ðf.AWHwAVIAUATUSH8H H0A~A~ _AN1A;~L~B H99u)AvAdž<A8L|$AP! L胃M.MH$MeLLHHIEH$A<APHHA0ID$0 La0t tmL DA AAT$I $1H=Z }At$(~&11ID$ H5< <0}HA9l$(H  #AW|MI]tL&|Ht IfI]ID$0L,$Hu tL褀LA<t ܯ H= H A1=|A(H}{A(1HI@H!}I6Ht0HFP(HH ~HHI@uH6HuA(AH{EPIHA*YW H,Ѕt& Љ ‰ Љ ‰ D`ET1 uAV A8A`|HA`EEHHiz1HHEH| y Ihu3 t) AXn A\H8[]A\A]A^A_1-{z% u빁AN)AN1U AH= 1HWzխ Ih QE`H= D1D !AzID$ HtHBH@(9D$ MD$ H҉D$ uH @ -!AxyT$ H=! 1@#AyM.Mt{E1MeH= A1D#AyAD$(;D$ |u~&11ID$ H5Ȭ <HyA9l$(AT$I $1H= ÿ@ByMmMuH #Ax %T$ H=\ %A@)1xAD$(c1HL~H1zH= 1 Ax= t8H  . A:xyHHxHyH ʫ #Ax@SHHtH{HHu[ÐfDfDAVHAUIATLgUSHLH HHLLI{u AuH}I]HtSE1HsH4{HHAHuH\}LDMtLsxH D[]A\A]A^E1HH'}HxATIUHSHHtH{HLHHu[]A\fAUIATUSH( AuH|I]Ht:1HsH_zHHHuH|LpH([]A\A]1HHd|HxfDfDH\$Hl$HHHsHHHHHtHEwHl$H\$HUHAVAUATS1HD8HA HE1IEeDHHHH)L\$IHt1ɉHA9AsLMt?[\]`{|}~Output file location: Input file interpretation: Details in the output code: Algorithm employed by gperf: No key positions selected. Invalid value for option -s. GNU gperf %s Bruno HaibleDouglas C. SchmidtWritten by %s and %s. output-filehash-fn-namelookup-fn-nameseven-bitkey-positionscompare-strlenduplicatesfastinitial-assojumpmultiple-iterationsno-strlenoccurrence-sortrandomsize-multiplehelpversiondebugTry '%s --help' for more information. 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 C 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 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. -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 . Starting 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 1989-1998, 2000-2004, 2006-2007Copyright (C) %s Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. acCdDe:Ef:F:gGhH:i:Ij:k:K:lL:m:nN:oOpPQ:rs:S:tTvW:Z:7Extra trailing arguments to %s. optimized-collision-resolutionIR@mL@mL@mL@mL@mL@mL@mL@mL@mL@mL@mL@;R@-R@R@R@R@Q@Q@mL@Q@Q@mL@Q@AL@Q@Q@mL@.Q@ Q@mL@mL@Q@mL@mL@P@mL@mL@mL@mL@mL@mL@AL@mL@P@P@P@AL@AL@pP@*P@O@uN@gN@%N@N@AL@AL@mL@M@L@L@mL@L@mL@mL@mL@mL@mL@mL@mL@mL@mL@P@P@P@N@^@&@@e+@t2@L;@KE@Fj@HX@Hw@Nk@N@Z@7@c@C@E@I@G@W @@S&@T@k@l@l@D@f@i@j@m@n@o0@O@P@Q@@r@s@h@v@d?HB #count >= 2 %s }; %sstatic %s[] = %s { -1(char*)0""%s}%sstruct %s_t %s { %s char %s_str%d[sizeof()];strcmp ( + 1memcmp ( register *wordptr;*wordendptr;*resword; return 0;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 register ; %*s if () %*s return %s; %*s } %*s lengthptr++; %*s} %*sif (len == %s[key]) ; %*s if (o >= 0) %*s { %*s register %schar *s = o; %*s if (s && ) %*s return &%s[key] } return 0;%s%s const const char */* /* Computed positions: -k'' */#error#include #include %3d }; #endif #ifdef __GNUC__ __inline #else #ifdef __cplusplus inline #endif #endif(str, len) register char *str; register unsigned int len; (str, len) register const char *str; register unsigned int len; (register const char *str, register unsigned int len) static %s%s asso_values[] = { register int hval = %s; switch (%s) { default: break; } return hval%*s/* hash value = %4d, keyword = "%.*s" */ %*swordendptr = wordptr + %d; %*sgoto multicompare; offsetof(struct %s_t, %s_str%d) /* hash value = %d, index = %d */%*s/* know %d <= key <= %d, contains %d cases */ min_hash_value <= lowest_case_value/usr/src/gnu/usr.bin/gperf/../../../contrib/gperf/src/output.cclowest_case_value <= max_hash_valuestatic linked keyword = %.*s, index = %d dup_ptr[%td]: hash_value = %d, index = %d, count = %d lookup_array[dup_ptr->hash_value] == dup_ptr->index%sstatic %s%s lookup[] = %s {%sstatic %sstruct %s_t %s_contents = %s { %s#define %s ((%schar *) &%s_contents) if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH) { register int key = %s (str, len); if (key <= MAX_HASH_VALUE && key >= MIN_HASH_VALUE) { register %s%s *lengthptr; register %sresword; %*smulticompare: %*s while (wordptr < wordendptr) %*s { %*s if (len == *lengthptr) %*s { %*s register %schar *s = %*s wordptr++; %*s } %*s return 0; { register %schar *s = resword->%s) return resword; } if (key <= MAX_HASH_VALUE && key >= 0)%*s{ %*s register int index = lookup[key]; %*s if (index >= 0) %*s { %*s if (len == %s[index]) %*s { %*s register %schar *s = %s[index]%*s else if (index < -TOTAL_KEYWORDS) %*s { %*s register int offset = - 1 - TOTAL_KEYWORDS - index; %*s register %s%s *lengthptr = &%s[TOTAL_KEYWORDS + lookup[offset]]; *wordptr = &%s[TOTAL_KEYWORDS + lookup[offset]]; *wordendptr = wordptr + -lookup[offset + 1]; %*s while (wordptr < wordendptr) %*s { %*s if (len == *lengthptr) %*s { %*s register %schar *s = %*s wordptr++; %*s } %*s } %*s{ %*s register int o = %s[key]%*s{ %*s register %schar *s = %s[key]#ifdef __GNUC__ __inline #ifdef __GNUC_STDC_INLINE__ __attribute__ ((__gnu_inline__)) #endif #endif code produced by gperf version %s */ #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. */ %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 (s1, s2, n) register char *s1; register char *s2; register unsigned int n; (s1, s2, n) register const char *s1; register const char *s2; register unsigned int n; (register const char *s1, register const char *s2, register unsigned int n) { 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 (s1, s2) register char *s1; register char *s2; (s1, s2) register const char *s1; register const char *s2; (register const char *s1, register const char *s2) { 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, unsigned int len); public: static %s%s%s (const char *str, unsigned int len); }; Ar@@@APX@@@@Aq@@Љ@pA0U@@P@A@U@^@0Y@@@@A`Y@`U@T@p@`@21Output_Compare_MemcmpDaAA22Output_Compare_StrncmpDaAA21Output_Compare_StrcmpDa AA12Output_Expr1DaXAA11Output_EnumDaA A14Output_DefinesDaA ACa0ACaAACaPA14Output_Compare11Output_Expr16Output_Constants A@@@0@ @A@@@A@Ј@@output_switchesoutput_lookup_array?Positions::remove internal error: not found Positions::add internal error: overflow Positions::add internal error: duplicate 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. Key link: "%.*s" = "%.*s", with key set "%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. bool array size = %d, total bytes = %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 dumping occurrence and associated values tables asso_values[%c] = %6d, occurrences[%c] = %6d 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): ], expected number of iterations between %g and %g. Internal error, unexpected duplicate hash code try options -m or -r, or use new key positions. ". use option -D. keyword #, %*s, keyword %9d, end of keyword list end table dumping selchars%11d,%11d,%6d, End dumping list. Computed alpha increments: %u:+%u Computed positions: Step %u chooses _asso_values['%c'Keyword equivalence classes: %.*s (re-initialized bool_array) Step %u chose _asso_values[] in %u iterations. try options -m or -r. 3.0.3*n - nchars_avail == (size_t) (read_pos - *lineptr)/usr/src/gnu/usr.bin/gperf/../../../contrib/gperf/lib/getline.ccgetstr;x0HH`X8Ph(x@h xx       0(X8pHXhx 0 H   `     88 P h     8 X x ( @ X p ( H h x ( h @ ("h x& h. . . . / //0/P/h1(223383P8H99X:<X<8x=XX@EGxH HKXxKp8LMM0NZ\(c@ 8cX Hcp Xc hc xc c c ccccccPdhd(d8dHdHd`eXffg(ghggg0hHihhiiXkXmmHxssxtt8u0uPvxx{{((PXȖ0zRx $@AC BKzPRx@ $@@CH<@CHT@ADG 4t@vBEB E(A0A8D@ @@@`@D@DzPLRx@ $@<@T@l@BA@BA`@A, @BEE D(D0, @\BEE D(D04,@y=ABGB B(A0A8Gl2@ 2@  2@02@$@2@BBD A(G@ 3@ 03@D$$P3@dBBA D(D@L3@d3@|3@3@ 4@4@ 4@,@4@%BEE A(D0$p5@A<@6@L :@Al@:@ P6@KJO 46@y=ABLB B(A0A8GP:@p:@:@<,;@D<@\0=@tP=@p=@=@=@=@=@>@0>@4P>@Lp>@7Dd>@ |>@4>@BEB B(A0A8GB@ 4B@BEB B(A0A8G0E@A$4F@BDA I(D0\G@HA4tL@BIE E(D0A8DT@%0T@>pT@T@$T@BGG ,@ DЈ@\@t@ @@ @ 0@@@0U@@U@A<`U@ 4TpU@BMB B(A0A8G@$0W@AKF $W@ADG $PX@BAD  0Y@%A$ `Y@ ,< pY@BHE D(A0l ^@WJL  ^@PJG , 0_@BJD A(D0$ _@BJI  a@:A$ a@JL 4D c@BBE E(D0A8Dp4| e@BBE B(A0A8DP4 j@BGB H(A0A8L@ m@yG4 n@BEB B(A0A8D@D p@'\ q@A| q@JL  r@JL  P@  `@  p@ @  s@A< @ T @l @  @ Љ@ , @t@ 4>ABGA A(O P@6>AAG`, @#>ABEA A(D`<@AT0@BAA tP@D@D @ @ @= @zAD@ @D4@AT@YJ$t@3AAG ,@@BEE K(D04@>ABBE B(A0A8DP,@EBED D(D044@@>ABFE B(A0A8Dpl@#A4@@?ABEE E(A0JP$@.BDD ,@@,?ABEA A(DPК@HJG $< @AC G,d @<BBE A(A0,`@=BBE A(A0@$@@?AAC M4@BBB B(A0A8G!,<@( [?AAC FM4l@SBBB B(A0D8DPP@ A$`@J^P @ @@ $P@-I#7Cw1M!    07Z{    ?##z   t1g  <qS "T"* j j>@ x@ @0@o@@@ 1 Ba @ @ o @oo @0@a@@@@@@@@"@2@B@R@b@r@@@@@@@@@@@"@2@B@R@b@r@@@@@@@@@@%A @a%A$FreeBSD: releng/9.3/lib/csu/amd64/crt1.c 245777 2013-01-22 07:32:26Z kib $$FreeBSD: releng/9.3/lib/csu/common/crtbrand.c 268511 2014-07-10 21:52:31Z gjb $GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]$FreeBSD: releng/9.3/lib/csu/amd64/crti.S 217105 2011-01-07 16:07:51Z kib $GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]$FreeBSD: releng/9.3/lib/csu/amd64/crtn.S 217105 2011-01-07 16:07:51Z kib $.shstrtab.interp.note.ABI-tag.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.text.fini.rodata.eh_frame_hdr.eh_frame.gcc_except_table.ctors.dtors.jcr.dynamic.got.plt.data.bss.comment @@%0@0l!o@`+ @3@1;o @ hHo @ W @ a @  kx@xf@q@w@}@f %A%h*Ah*|=A=@a@@a@(@a(@0@a0@BaBPPCaPC(CaxC  xCG