config root man

Current Path : /usr/bin/

FreeBSD hs32.drive.ne.jp 9.1-RELEASE FreeBSD 9.1-RELEASE #1: Wed Jan 14 12:18:08 JST 2015 root@hs32.drive.ne.jp:/sys/amd64/compile/hs32 amd64
Upload File :
Current File : //usr/bin/gperf

ELF	>@@`H@8@@@@@@@@@@>> @@a@ah	 0@0@a0@a@@Ptd$$A$AQtd/libexec/ld-elf.so.1FreeBSD
%40$/'3-1)&,%.*!2+
	 #"(
.aCavCa 8!i
1@CaCa-;/5'oe'f!CaXKuBX!j[>|@d5S!DaXxIaXDa}J
`Da@IaT+=/QL@"Da)libstdc++.so.6_ZdaPv_Znwm_Jv_RegisterClasses_ZdlPv_Znam__cxa_pure_virtual__gxx_personality_v0_ZTVN10__cxxabiv117__class_type_infoE_ZTVN10__cxxabiv120__si_class_type_infoElibm.so.5explibgcc_s.so.1_Unwind_Resumelibc.so.7__stack_chk_guardfwritememcpyputchar__progname__stderrpstrlenstrtod__cxa_atexit__assertfreopen__stack_chk_failtimefputcferroroptindfflushmemset_init_tlsenviron__stdoutpfprintfabortisprintmemchratoistrpbrkstrchrgetcsrandgetopt_long__stdinpputsoptarg_endGCC_3.0FBSD_1.0CXXABI_1.3GLIBCXX_3.4 P&y	 (z0ӯkt)%(zCaCaCaCaDaXDa"`Da'Da1BaBaBa Ba(Ba0Ba	8Ba@Ba
HBaPBaXBa`BahBapBaxBaBaBaBaBaBaBaBaBaBaBa!Ba#Ba$Ba%Ba&Ba)Ba*Ca+Ca,Ca-Ca. Ca/(Ca00Ca28Ca3Ho躭H51!%1!@%1!h%1!h%1!h%1!h%1!h%1!h%1!h%1!hp%1!h`%~1!h	P%v1!h
@%n1!h0%f1!h %^1!h
%V1!h%N1!h%F1!h%>1!h%61!h%.1!h%&1!h%1!h%1!h%1!hp%1!h`%0!hP%0!h@%0!h0%0!h %0!h%0!h%0!h%0!h %0!h!%0!h"%0!h#%0!h$%0!h%%0!h&UHAULoATSHHcÅLdL%6!~:HWHt1HZ0!t#H</HF0!HDH;0!Hu0@aHt+H@LL"֐=Q1!UHt$HH/!H/!HHu%1!DfDUH=,!HtHt(@aIAÐ1! SHuH{Ht+[@O1H=0!@@H{Hu[ÐfDfD0! SHuH{Ht+[@O1H=b0!@@H{Hu[ÐUHSHHHcv(H} H3DK1ҋKAA!{uU1DHHLMtbDR#CG
CA!DHHLMt9A@(;E(uIp H} HcHH9u{u	A@;EuHL[]H(HE1[]LAWE1AVAUIATUSHWփx-HcHH@HHt
@(A9DLHyEEH=*/!1E@H$@xEuAIcL$IEJ< tuH=.!D1@;IEJ P(D9~.11H@ H5.!<HRIEJ 9h(ًPH#@H=w.!1IArH
[.!H[]A\A]A^A_+@EDH=/.!d$A)о@1IEJ P(Of.H?Ht?H?Ht4SWHG6u0ɉtЉtЉtK{HSHH[1Hf.4SWHG6u0ɉtЉtЉtK{H|SHH[1H'H7HWH7HWH,!E@HHDfDfDSHH`HtH{hHtH{PHt~H{Ht	[o[SHH`HtJH{hHt<H{PHt.H{Ht	[[SHӄt0H9rdHH9@vW8t	<-uL_uGAHuH9v/B<v,B<v%-t _t t	t?
Du [[1@HH9tH="+!H‰پ@1}fDAVMAUAATIUHSH_H9sCdV@t6fDH9v+H:DuBHuH9v
< t<	t
f1[]A\A]A^HH9t< t<	tA$t/H9LwHH9t8t	<-u_uAHuH9v&B<vB<v-t_t t1	t+H=*!HMD@1iHH9< t<	tH}H)H9v| 	
fH	ft
tHHH9t? uH9v t	t
u2IHH9ufH޿HH=*)!HD龸@1돐AVMAUAATIUHSH_t/H9rxHH9vl8t	<-ua_u\AHuH9v B<vAB<v:-t5_t0=t6H=(!HMD@11[]A\A]A^LcHH)L9voS ta	t\
ftUH	t
tIHL9v>A$ uA$ t	t
u"III9uHHGH='!HD龸@1@@AWAVAUATUSHH<$H$H$H$HDŽ$HDŽ$H2L$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)6MtHI~eHHH|LLBD5H|$0Dl$DE1ADH!HËD$DVH|$8D$,At
H|$8H$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</E<*g</EHu5<
u
fIHD< HuEHuHcŃH|pLd$pALd$pAI\$H9\$vBAD$1<
!1<
< ft
<	EHH9\$wڄ$Ld$D9l$(H\$H$HL$H@8HL$ H@@@HD$DHt$8HL$L Ht$0HH-LL)H{wHHLH+$MEID$H$T$,IHA Q0WT$,@LLH$
"!Lr 'MH$Hy(&H$IT$I9L`(	AD$1<
u	<
t< @t
<	EHI9wބH$Lq fDH<
uEHuIEHuHU<
t,H<*Hu</uHI΋T$,@LLH$
c!!Lq L$,H=!!H¾@@1wH$Lp H|$0pHHD$0|(;t5H}Ht$0HHHD;D+H|$0H\$0HL$0H$HJPHʄE11A<Ht$0HLHDH$LHXhHt$0HLHD D*DH$HZ`H|$8t
H|$8hH$HT$H !HpH9T$ HL$HHD$PL$(HD$`L$\HT$ 
HH)wHHPELd$ LE<#<%+<"I9<
HuHL9f<
H|$PNHtIݹXCaI){!DyD$`MHEƈD$`H$HHxHPT$\HÿPHHHHL$HHl$HH)L9d$ D$\LMI)DXCaII)DLH]H)eI9IHh(<"EHD$`HI9Lm<\uHB<Vv)L$\H¾@H=>!1$@HE111uCB<B<EPDHD,B<B<	wtPHEHI9D$`@*L$\H¾@THE	D$`HE
D$`HE
D$`HED$`HED$`HED$`/k7bHDh</~'<7#HFl</~<7HFlADZENHUD$`=P)L$,H=!H¾p@1H$Lq ]H;l$0t4HHXH#HHHIH|$0Ld$0AEH$H|$0BXHD$0H9D$0s'fDP
t
 t	uHH9D$0rH|$0tHL$09d@@HH=!1:HMI)I~rLHHI1I9v1A|$
I)LDC>>ADmH$H=C!H¾x@1T$,L$@LL T$,L$@LLvH$Da#H$Lr HkI9v"C<
tH|$PHHkMLXCaM)!DRMI)I}*LHHI1I9v1A|$
I)LDCD5`!udLd$pL'?%|L
H)HPHLHEL9r?E11H$DaH$Lp Ld$p!;L$\H=!H¾0@1
$L$\H=!H¾h@1
L$\H=h!H¾@1DT$,L$@LL5H$Da$j!H$Lp D$`HD$HH$HHzpAL$`H$H$HxH$HL$HBHJHĸ[]A\A]A^A_ËT$,@LLI
!H$Lr JT$,L$@LLST$,L$@LL//H$DaH$Lp <{k<;c<
[Hu<H;T$0vB<
t< t<	uHH9T$0rIL+d$0I|$Ml$L$<{t<;t<
uH$DaH$Lq WL$\H¾@H=d!1H$DL$,IH=;!@J0H1L$,H¾@L$,H¾@T$,L$˿@LLt&H$DaH$Lr 1T$,L$@LLH$DaH$Lq JH$@J0HH$H:t H=:!H¾P@1H=!H¾]@1wT$,@LL2t'H$
!@Lp HHHT$,@LLt?H$
!Lr s@HL$\H¾@+T$,@LLtH$
z!Lq T$,@LLmtH$
K!Lp T$, @LL>tH$
!Lr T$,%@LLtH$
!Lq T$,.@LLtH$
!Lp `T$,;@LLtH$
!@Lr 1T$,L$?@LL:tH$Da4
H$Lq T$,P@LLCtH$
!! Lp T$,L$]@LLtH$DaH$Lr T$,L$m@LL4H$DacH=b!L$H‹L$,@1L$,H¾@HHw@HHw@f.f.AUATIUSHHHHHHHHtHHHuH:LHLl$HLHHHtNHLl$t[Ll$ImIHI]Ht#Ht5HsH}AԄuI]IHHuImH\$HH[]A\A]I]fDfDf.HStHHHu[AUATUHSHHLl$t5Ll$@Le^HHLI]HmIHuIEHD$H[]A\A]fDfDH@H@H@@H@H@H Ht>fAVIAUIATUHSHw;u1KE1;sH~BH9AA9uKE1D)H/D;cHDDAt$H>9E~{HcHEMtAMtADH9sv3Dt%uHcUHEDNjKAA)hH)HHE(H} H[]A\A]A^1E1:f.SHD[(IADHHXAD9A@DHHJ@JHHH@D9vA:A@DAHHIcDGEE9I~&D	HEHHRDIcDGEE9[D뫐fDfD1H\$Ld$HLl$AHIͿ@fHD`Lh@<H$Ld$Ll$HÐ@AWHDaAVAUATUSH8
PH=!HtH=
!@HL$ 
L$	LHDŽ$ 
@LH5!LtL\H$0H$
HDiHL!L$0Mt]@LHLH$x	H$$	H$	L$
L$
HHD$p$X	D$h$l	D$`H$P	HD$XHEHD$P$@D$H$<D$@$8D$8$
D$0$	D$(H$	HD$ H$	HD$$	D$H$	HD$H$	H$8H6JH=!H
! @DŽ$HdcMtrMI\$H{ Hk0HtH{HXCat
HtH;H;$	r
H;$	r
HtrHHHuM$$MuLLLHDŽ$ 
@$H8
[]A\A]A^A_H=
! DŽ$%H
!_@L$Ht
H$0H!a@H=s!1H=[!H!@@HLHDŽ$ 
@HHHaLH񐐐SHH@H[H@D$H7WODGDOGGÐfD$H7WODGDOGGÐfuH9~DGDËG$;G G$}aADÀ0|[HE11@ƃ0	w&E1H@CH1DDP@ƃ0	v@-tYD9GD9G|fDG뙀$t$,nHHWDGlDGHHDHAGG HQƒ0	w(G ҍDBЉG HHHƒ0	v؋G D9;GDG$@@GHGHG HG(G0G4G8G<G@?HGH(@HGPz@HGXd$AHG`4@HGhA@HGpF@HGxO@HLJ[@HLJf@ƇLJGHGHG HG(G0G4G8G<G@?HGH(@HGPz@HGXd$AHG`4@HGhA@HGpF@HGxO@HLJ[@HLJf@ƇLJGfx	̀w<GÐfDfDHH(@t@HwHÐf.HPz@t@HwPÐf.HXd$At@HwXÐf.H`4@t@Hw`Ðf.HhA@t@HwhÐf.HpF@t@HwpÐf.HxO@t@HwxÐf.H[@tÐHHf@tÐHHtHfuDaHCa1A@H@H!@1fDfDAWIAVAUATUSHo h@p@HIIHDIHL$xHIHDHHL$pHIHDHHL$hHHHDfIHL$`HIHI@HL$XHHD HL$PHHDLDHL$HLDHLDLDHD@HI@@LD@ HL$HD@HHD@AZC@LD@LD@HDȃHDAC<$IH$AC4$AC0$AC8$ICXH$ICPH$IH$ICxH$ICpH$IChH$ICHH$HDŽ$h@H|$H=J!H4$@L$L|$@Lt$8Ll$0Ld$(H\$ LT$L$AAH=!@1L$1HL$IH=!P@1!H;]sH؋Dt=uH
!y@H
x!-@pH
]!H[]A\A]A^A_|@DH[]A\A]A^A_fDDafDAWIAVAUATUSHo h@p@HIIHDIHL$xHIHDHHL$pHIHDHHL$hHHHDfIHL$`HIHI@HL$XHHD HL$PHHDLDHL$HLDHLDLDHD@HI@@LD@ HL$HD@HHD@AZC@LD@LD@HDȃHDAC<$IH$AC4$AC0$AC8$ICXH$ICPH$IH$ICxH$ICpH$IChH$ICHH$HDŽ$h@H|$H=!H4$@L$L|$@Lt$8Ll$0Ld$(H\$ LT$RL$AAH=!@1L$1L$IH=!P@1H;]sH؋Dt=uH
e!y@]H
H!-@@H
-!H[]A\A]A^A_|@H[]A\A]A^A_fDSH(HIt[DG@Hs(HADGHu
ADC[ú@LHHu
ADC[ú@LHHu
ADC[ú@LHHu
A DC[H=D Lʾ@1K[ÐAU1ATUH@SHEE1E1fDHEJ ;-@H^H'HH"u'f3<\t#<$t<`@t;Ht<"uٿ\ݿ" AID9mUHA1[]A\A]+H޿@1뽿'pu#;H[t<\u\Fݿ':xH-'B<wHB<v-HB<vB<v-tހ==HfSHH.8@QH޿
H!H߾h@1H޿
Hٺl@
H޿
Hٺ@Hٺ9@HٺY@@H޿
kHٺ@Hٺ@}H߾@1Hٺ@WH޿

Hٺ@3Hٺ@H޿
Hٺ@Hٺq@Hٺ(@Hٺ@HٺX@Hٺw@Hٺ2p@nHٺ#@WHٺm@@Hٺy@@)Hٺ@HٺP@Hٺ@Hٺ@Hٺ@Hٺ}X@Hٺ@Hٺh@qHٺ@ZHٺ@CH޿
Hٺ!@Hߺ@1kHٺ@HٺM@Hٺ@Hߺ@1Hٺ}@Hٺq0@Hٺb@mH޿
 Hٺ@IH޿
Hٺ([@$AWLAVAAUIATIUSHXHA4$IT$H It$A<$E1@@0@047LvH= G9$@HM H=f y@1H=S H@h@1H=; @@@11AL$TH= Ht$HHD$HH; D$
߭t5/lHXHt$HHHD$HH9M8DZZD$^WAD$@.[WAD$@..w
m.H) H=j Z@sAT$4AL$]H
5 E@-=H ID$x,AL$fH= AD$8H
 7@AD$8AL$AL$H5S H|$ AA$H% 8*LHAƄ$(pH1H)‰UHH|$ uHL)HAA$A$A$AAAIA9)DfqA9|ȉ9ADDuAE9A5DEAuAA$AsH= AD$0?7BH= 0@AD$01gH= AD$45 H
 D@H= D19AL$ AL$H5 I$AL$ H
  @@H H=M 1bAL$TH ID$ CH ID$`2H ID$p!AL$AL$H= yAD$<H H= @1"H= J<HQ I$AL$@H/ ID$HH5 ID$(LeqH ID$P`AL$RH ID$hAAL$3H ID$X"AL$AL$AL$AL$@/AD$@?AƄ$ADŽ$LHu
i A9~HcIDID$AA9ƉK HX[]A\A]A^A_
*^AL$@ENH
& !@H= 蘿H H= ZX@Gp@H= 1*H= RDH= ¾x@1DH
 [@T@H H=V h@1趽H
> ?@@~@@HOHÐf.HHAH@8H҉ufDHHHuHB@8HfH1HtfDHHuÐfATIHSHHHHAT$`H߾@PHAT$hH߾@PHAT$dH߾@PHA$H߾@PHHA$@PHHLXH[A\AfHw1@ܻSHwH1@HŻC[Ðf@1鰻@AWAAd$AAVAUATUSHH dLDaL H; HM1L$@ZL+M!E11A$Ij I]tuH{0D;c8}@ufE"*s1AAH[0H,+A)¸Љ)ЅuL?@蚺L?@苺11A}AD9c8sE~
,A)‰)ЅuMmM1LF@L uH[]A\A]A^A_H
[]A\A]A^A_NfU1H+$ASHչ1O@ɹtK1l@趹HxHcӋ4uH][]#A1艹H][]ٺ_@1mH][]齺UHSHH} t>t@1;HH@1'HEH@1H1[]ÿ*_HH@1HEHH[]f.ATUHSHa@A1许 1@蕸EtTHEH@1{HH@1g@1[HH[]A\@1CHEH@1'HH@1D@1ZSHt

8Hs@1[Ƿf.
fDAV AU ATIUSL		ƒ%AL$p 		ƒ@9f  H5 @1G hAuA1=@ED$pE @@@HD1軶[]A\A]A^@驸AD$tA;D$h>AA|t/@耸 A	¸d$AHDZ AK@1:A$AH5 H¿8A1	A$gfff)~ȺgfffA)ʅ҉A$tf1A9@1譵I$D@H1荵CA9$v#t,жA9u뤿@SAL$pjA|$lAt$dMt$lpE1A9t$t|LE1
fBxH9	AA9uA9ͻsDAA\tA9\$h @@`A%:@HDHD1谴AT$d9GE9n,DA\AuԿA1s*@1gLnAPH5 @18@1'Q '@d$A.@HD1A|$pu/QLE9nvDA\t*@1AʳuYE1AA)At$tuA|$xu˾L*@1|1LA1aCvs>@e@1@LJA,E9nv9DAA\Cv*9}¿?@1U@9|롻A9l$h~1AղrT?@轴A9l$hՉ1U@訲A9l$h~H\$Hl$HLd$HIt
f@qHsLv@1\CHl$H$Ld$HÐH\$Hl$HHHH蠲|*t HH@H\$Hl$1HHH޿@AUI"ATAUSH2E t"\t~AtVA]Iju˿\ǃ0Բ!߃0Ų}0轲AuH"[]A\A]飲\蒲sATX IUH StsHUHz0thZDB<H
~ 1d$A޿@װHE1HtH@0HuAd$AA؉LʿA1覰A$HE[]A\Ä1d$A޿@z uJHEpH8vAX1d$A޿@E=r A$HE[]A\HEH5 @P<1
HGd$AAH8LD@1 HEAd$AA؉Lʿ@H1软+sd$A@1褯[HE]A\DB<H
, d$A޿@1}HUSH Ht+1
@QHɯH߉S[
锰[fDH\$Hl$HLd$HC HA1H޿@" @tZH5~ D0A1HȮ tHu>}  u!H$Hl$Ld$HËuH}뱋U<u8`AH$Hl$1Ld$HU{諯y Z@,@1 jAWAVAAUEATAUSH8$  H|$L$DD$A"A*DA*B Hl$^*YXD,E~DHmuHEAd$AELD@E)A)܋H81cAEL$H|$DމD$$HEDL$$D@8A+Ad$AEDLD8@1H$d$AHEDL$$DDD$DHH8d$AD@1ެH8[]A\A]A^A_A1d$ADA踬AHT$AHBX8d$ADi@1|1d$AD0@hEmAmLd$4
AXHT$D$4D@HBd$AH81) H|$LDL$4HD$Eud$AD@19\$D$49\$|qD$9D$tPAd$ADELʉٿO@1譫H|$HT$4Aunٺd$ADz@1H|$HT$4D<(AAAAAAѫ@AWAVIAUATUSHJ uH[]A\A]A^A_HcH<H诪HD$AA<xHcH芪EIAAAGHIDI9s@HI9rM&MMHl$IL$Y8A<HcAD  Hy0tk]A<HY0EEufDH[0Ht3E^  tSDC<1HH= PAyH[0Hu̓}oHM$$MaH9l$HHmH+l$I  YsAO9HcIDH98uxuIL;CAF`H)Hc҉CA+F`ADCHH9\$ADxIcǽID433I9s,H‹B9O9LHI9rgfff)Ë" HD$d$AAHET$HT$	Ш@LD$Hi 1AAL舨~غgfffA)څ҉s*AEAL1"U1D@H(D9~
,qډAuHt$?@1믁|@-@#Hcx1HcIDHt8uxHuDAQDA<@H	H=s 1اIL$HKDKHDCH=I IԾA1襧yHt$1@H|$t
H|$]MHL[]A\A]A^A_>gfffމ)~"Ⱥgfff)ʅ҉FA9DL?A-AA'@AAfAWAAVAUAd$AATUSH@Hy LD1L6Hs(H= H5 1L@L3M1fD* Mffyu
I|$0~
f@ΧAT$89F f7,AA)@u% HHHH= :H1HHE1R~
f@:L@1+Y uR@ub A@14 uYD9tlt~1@٤ t{% @t1@认 tH5 1@菤D9uf@耦Al$8Al$<LL=I\$0HuQs<HL"H[0Ht9f@k<5CA;D$uH3I<$HcH9uAt$<fDM6M~

OHL@[]A\A]A^A_1ң@1ƣ@	^% ۃIBf. SHfy(x=u@tUDE~IH[x5HH[@tDE~xR k[ÐfDAWIAVAUATUSH) wAAhH{ 1LL@ŢM7ME1 Inf8uH}0H1 DL,@1{uH}H@eH]0Hu=^H ALD,@1=sH;FH@(H[0Ht#C;EuH3H}HcH9uH[0HuAM6M6LG@1ݡH
z H 1MLAI躡M7ME1 IntuH}0E~f@y uuDe8L@1MuH}UH]0Hu3Zf@A(L@1sH;"H[0Ht)C;EuH3H}HcH9uH[0HufDAM6M!E~

LG@1讠HK H
d 1L@AI莠 u.H[]A\A]A^A_Ad$ADe8H
[]A\A]A^A_韡fj fyut~ÐSHWHLGLO HD$OLT$`H7HG0HD$IrHG8D$ G@HD$(HGHHD$0HGPD$8GXD$@G\D$HG`D$PGdD$XGhAARGlWpHtHĠHD$hHxD$pD$xH$H[ÐfDH\$Hl$HLd$HH@A1L uz1L@
EtIHH@1HEHU@1ܞH$Hl$)Ld$H @HH@1訞HEH@1萞uH\$Hl$HLd$HH@A1O| 1Z@6EtEHH@1HEH@1H$Hl$)Ld$HLHH@1؝HEH@1ÝD@1谝iSHWHLGLO HD$OLT$`H7HG0HD$IrHG8D$ G@HD$(HGHHD$0HGPD$8GXD$@G\D$HG`D$PGdD$XGhAARGlWpHtHTHD$hHxD$pD$xH$H[ÐfDAUI1ATUSHhAHH5G 趜f= HAAċ- 荞  Hs @A1dA9싋DH;ANA
D1@3b [MAd$A1AL¾`AH$d$A= H
 1d$A޿A进 @1覛 @d$A޿@1H$L$vIEHDŽ$PAHHDŽ$@HDŽ$PALHDŽ$@LHa @@HE0Ad$AI$0A޿@HE1=) Ad$AAىL‰޿A1H$d$A˚@ H! H5j 1 A蚚 @,@1聚IEHDŽ$PAH$HDŽ$@HDŽ$PAH$HDŽ$@LHп`AHDŽ$0AHDŽ$0Af@	AH[]A\A]DA ]@4WH@ L
i Ad$AL‰޿
AH$1舙 H5 @1h1d$A޿iAU @u	 IEHD$PAHT$HD$@HD$ PAHt$ HD$(@LH1d$A޿|AHD$0AHD$ 0A 9H5b A1˜A踚 @t?d$A޿A1蒘c@1耘Hs H=A 4@fDc@1:Hs(H= w@ c@1Hs(H= @( x[1@1ۗIEHD$pPAHT$pHD$x@@HDŽ$PAH$HDŽ$@LHпH@HD$p0AHDŽ$0AyaAd$A1AL¾AH$d$AB=o H L
 Ad$AL‰8AH$1
8 @d$A@1IEHD$PPAHT$PHD$X@HD$`PAHt$`HD$h@LH1d$At@HD$P0AHD$`0A聖 gH5 @1a1d$A@N={ $Ad$A1AL‰pAH$d$A=< d$A@1Hs(H= H5l 0	A1̕d$A@1蹕Hs(H=z mh	A蟗Ad$A1L‰	A膕= 0H
6 1d$A
A_ H5 @1?m @d$A@1H\$0Ld$@IEHD$0PAHHD$8@HD$@PALHD$H@LH @@H0Ad$AI$0A@HE1訔= Ad$AAL‰0
A1H$d$Awd$AA1dVL
 Ad$A1L‰޿`
A<i cAd$AىL¿0A1H
 d$A޿MA1yH5a @16H5y @1ɓ7Ad$AL¿A1裓fsfDH L
= Ad$AL‰޿
AH$1\ H5 p@1<H
 d$AA1
F Isc1d$A޿@= d$A޿@1ȒH5` @1谒{dH5` H¿A1荒B@1|8vA1k%d$A@1PL
 Ad$AL¾A1@"d$A@1H5 @1H5W p@1ב H59 p@1蹑H5! p@1衑!1d$A@膑= d$A@1fH5 @1NAd$AL¿	A1-{dL
 H
 Id$AA1H迒f.fDfDSHHP 		ШHSH5p 1A萐  H5 @1p hAuAffD1E=@;i tV@HD$ AHt$ Hn@HD$ pAԑHP[fH$AHD$AHH4 H$AfD@rrH gHD$@AHt$@Hzn@HD$@pACHP[ÐHD$0AHt$0HJn@HD$0pAHP[ÐuH. bA	¸d$AHDH5I @1蹎1
A誐Hmf.AUIATUSH8= 	‰	Шt5H A)H d$Ad$AH
 &H d$AH d$AH d$AAu*H
 AAHЀ9HDIE9HDIU @E@IE(A1觍 Lt }H5> A1nDaH
躎 
裎A}\tAMpE] 8IE8I9E0mC tAA10AA+  -L @tutLK tLLIEPI9EHs%A}XI}HIUPH
) H)MH= aH8[]A\A]IE fAd$AH AHDCPj1@Aߋ
 &AA1A趍IE8I9E0A}@3I}0IU8H
o H)蓋iL
 MEAH
; H 1H5ۿ R@1AA10I}lA`A11A3fDCs AC1v0HHt:A)9uA1變밿,HHuƿA苌 HA1h Au%xAuA	¸d$AHD1,A"AF ZHD$ AHt$ L{HD$ AAߋ
 H$AHD$d$AHL<H$AAA1草  Au%`AuA	¸d$AHD1QAGA=k A}I} N @1	@1rA1 Au%xAuA	¸d$AHD1諈0A衊A藊ż HTHpA`HpAÐHpAÐH0A0H0AÐH0AÐHAHAÐHAÐH0AЇHAÐHA鰇HA頇HpA鐇HpAÐHpApHpAÐHpAPOt-HD9pt$HfDB9tH9u1ø@ÐATUS?oE1H\t1t[p@1Ȇt*9CtQH1҃uAtH1Et%td[]A\$D,҇[]A\ÿ-过Ht@39st@1=1[]A\*鋇,聇[]A\$s3@11WHWtSHDHA9ti}BAAt9H9t`9|,HQDAH9tGH9|DAAJuH
 A,者BGHD	oHÐfHOteȅHHPt&@9t+9}D9tBHurGHH
  A)uH
Ҹ A(ʄPH7GGÐʸ @%Ð1Ʌ~1D9BȃH9u @%ÐfUHSt\HLMtCMډIBE1D@(E~HH 119HAD9uM9t#A9u#MMuH[(Hu[]DD[]1fDG8;F8ÐfHH7GHHtHGHuHGGHt)HJA9G}GA9G~GHHuދGtmx @t?HIt7I@PH~!9x,Hω@GHxuMMuHH= A1X~H
۶ PAւ\SHH?@诤H[f.1Ƕ Su[HljH9Ht11fH9u1ҍBaHHu[HÐfDUSHHHuHH;Hk(1HHuH[]Ð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@z1fDAWAVIAUATUSHL?HD$M HD$MgE1Ic|$(HAT$(HŅ~5I|$ 11B<0tDATHA9t$(H|$H\$
H[(H{ D9uEHSt&;EHHtӋVAHH9uuHtH賀LHH_H;tSHCH(HkM?CM
H|$tH\$H{Ht_H[(HuHD$H[]A\A]A^A_H+믿0裀HHH@@HhDh H@(HD$H\$H0aHH@(HH@@HhDh HD$HX(HHR~H*AUIATIUHSHHHtDH{HLLnHHuH[]A\A]Ðf.AWHwAVIAUATUSH8H H0A~A~_AN1A;~L~B H99u)AvAdž<A8L|$AP L裃M.MH$MeLLHHIEH$A<APHHA0ID$0: La0t tmL	DAxAAT$I$1H=ڰ A}At$(~&11ID$ H5 <p}HA9l$(H
 "A|MI]tLf|Ht IfI]ID$0L,$Hu  tLĀL<A<t \ H= A1}|A(H{A(1HI@Ha}I6Ht0HFP(HH ~HHI@uH6HuA(AHS{EPIHA*Yׯ H,Ѕt&	Љ	‰	Љ	‰	D`ET1j uAVA8A`|HA`EEHHz1HHEHX|   Ihu3
 t) AX A\H8[]A\A]A^A_1m{Vz u빁AN)AN1UP AH=8 1HzU Ih QE`H= D1Dᾀ A_zID$HtHBH@(9D$MD$H҉D$uH
 - AyT$H= 1@#AyM.Mt{E1MeH=z A1D#AyAD$(;D$|u~&11ID$ H5H <HyA9l$(AT$I$1H=  #@yMmMuH
 %#Ax %T$H=ܬ d$A@)15yAD$(c1HL~HqzH= 1Ax t8H
 .  AzxzHHExHzH
J "ABx@SHHtH{HHu[ÐfDfDAVHAUIATLgUSHLH HHLLI{ AuH}I]HtSE1HsHT{HHAHuH|}LDMtLxH D[]A\A]A^E1HHG}HyATIUHSHHtH{HL/HHu[]A\fAUIATUSH( AuH}I]Ht:1HsHzHHHuH|LpH([]A\A]1HH|HHxfDfDH\$Hl$HHHsHHHHHtHwHl$H\$HUHAVAUATS1HD8H HE1IEeDHHHH)L\$IHt1ɉHA9AsLMt<IBE1D@(E~HH 119HAD9uMDAMuċF1ÉȃA)A9uHv(HuHUH3 Lu
He[A\A]A^9vfDfDAVAUIATUSHhHtH!xHt$  uPIHHt+vI@HtvI0Ht	vI H[]A\A]A^uH
 !A1tA(tQ1A9(vAI@ًtIHH=L AA؉ھP!A1tA9(wH
" <#AtAMAP!AEME<1H= QtE8H=ק 1O#A"AD/tMeM}ID$H= X#AP8HD@<1tID$P(A9n~(11H@ H5t <H!tID$9h(܋PH#@H=I 1sM$$MuH
2 h#A*s)DH= d$A)о@1fsID$P(f[]A\A]A^@AVAUIATUSHhHtHuHr  uPIHHtsI@HtsI0HtsI H[]A\A]A^sH
Y 1!AQrE(EtQ1A9(vAI@ًtIHH= AA؉ھP!A1]rA9(wH
 <#AqAMAP!AEME<1H= rE8H= 1O#A"ADqMeM}ID$H=i X#AP8HD@<1qID$P(A9n~(11H@ H53 <HqID$9h(܋PH#@H= 1mqM$$MuH
 h#Ap(DH=Τ d$A)о@1%qID$P(f[]A\A]A^ÐfH7GGÐUHAWAVAUATSHXH}H4 HE1HUEHczHpHMHEDYE~1H]HuBH9FHuH}9EEHEHexP:xg1;PH~XA H99uE1H]DttA9wDHHHH)HEHt$HxHu1;PH~A H99uE*DH]LttEH]E9wD9EzHcHHH)HEHt$PHHuHcHHH)H\$HEDUELmAE1AID;utaHuVHuHcHHoAEUHH}kD9AsHMH}HAIEHcQH|oD;uuD9}&HEPE[K  H
 |#An]thHMAHuBDEtuH
š @mHEHuH= BЃ#A1m1҃uH5y 
;mHeHUHEHH HHMH HΉ(HH1H]HuH35 H0uuHe[A\A]A^A_HuH}HcVHuH-nD9}D}HMQ1{@)q1@)HMymHeH_nm191AWAVAUATUSH H|$8t7  XEaWGHHxmHĘ[]A\A]A^A_H|$8K HD$@Ƅ$DŽ$HT$8D$HL$pH$InBH=PMT$H$HT$H$$p$tHlHT$@H|$8L|$HD$LƄ$`DŽ$dL$`IFAIWHD$HT$ AD9d$HD$PD$T\$H
D9LtH$uӋ$t$pHt$H|$ $dH$`kLHT$@H|$8LD9rA9wn$d$`H|$XHt$ AT$THD$PkD9AD9d$Lr4T$TD$PHt$XH|$$tH$p`kDd$LHT$PIFHHD$(HT$0AD9|$HƄ$`DŽ$d>Dd$HAA)DL_tH$DKuϋ\$H	tL.tH$uD9tҋl$Hxʋl$H@tLuꋔ$t$pHt$(H|$0T$THD$P\jH|$PD#H|$PH|$PHT$@H|$8Ht$PD9Ar	A9vT$TD$PH$hHt$0E$dH$`iAD9|$Lr=$d$`H$hH|$($tH$piD|$LZ$pHT$8IvB$tHD$8HljPHHfiU  gH|$@H|$@SiHT$8HHH8LpH(I
HmHHUEVD;RuAB~ M&ALA1
AHE9tEB4'BtFV <AFQ <F@8tDKE9~GIcMI<EA0tFV <AFQ <F@8JAIHE9H$"H$HmHIHH8LpIH(H
 #AE1AfHT$8Ll$8jIt#A\tEtluIAuEtEftqH5G $	fH56 
eH|$@H= S@1E1nf|H
 @etH
֙ @eoLl$P\$HAAHl$IEHD$D9L"u拔$t$pHt$H|$T$THD$PfLHT$@H|$8L8D9r	A9uxT$TD$PH$hHt$A쉔$dH$`1fD9`D9d$L|$d$`H$hH|$$tH$pe\$HDd$LAƄ$`DŽ$dfDUHAWAVAUIATSH(H HE1
dA(HEt1H]Ѓ9wcA(HEt1҉ЃA9(HMwHDžpHuLE(IEtTE11EA9(;I@DE~HE<tԉLLt;EsA߉EL?H}t	H}dH}t	H}d  Hp
LpE1H=3 A#A1D1cA6u1DIVH= #A1UcA9wH=ݖ AN0AF(P"A.cH
 #AbMf MtIH5 
YbI$Ht%HCH=y #APH1bHHuMd$(MuH5N 
bMv8MA(tIH1҉ЃA9(wHpLpDž|AHhI҉UE11%AGAHD!D;uHM<AXIHM_HME$ya벃}@E'cIĹ1LHA(
aA(HuHID$rbHUMt$ LLXAHA(HEtbE1fAD9vRI@DDE~HEL<A?tHuDLtHUA(AA(H]HX<1t1111H]<tID$<H9u߉H<`E(1HEt-1HEʀ<tID$<uA9(wՋEA4$ATI|$H*A\$`A*``^f(`AD$(H*`^f(`H}AD$0bHpLpID$8`H5~ ,@_gE1HHHH)Lt$ILH;UuEA\EHEDEEMg ]M]IhCCM$MtlIhE1 IAuD@H(Hp ~&I@H<:uIHDuDSHHC9gM	MuMd$(Me|  t~|$AH=D 1^E'EtDE1EDtH5# ,]IWؾ#AH= 1i^ICA9wU8$AH= 1D^M8HhMHpHyHY8Ht^HpHxHt^HpHz FHpf]HHp뤋H{1CH^{  ZH
< #A4]H=! H^.A\#EHPEE/M_E1AAH<AGHIH
!
AA9rEA3B6AWH<A\HIH!ЉB6HA9HIHAA\)AO!D;EBD6uDeAD9eDAAIAWLA\LIH!ЉA<DA9vDACCAWLA\LIH!ЉC<A9LIHAOA\)!9uCwHPADA\HIH)AW!D9eHPADDeHAUHIHEE\AWDD!҉HEUIGHIHD#[AWED!ЋU9UuEAGA1ED9ЉElCAGA;TWAT uAUA8HۍA`tH]]H!Z[IA`AD$A$HHY1HID$Hi[  u-DUM_1MhEM_{A$P AH= 1HZLHyYHhHJ[HMH3
3 uHe[A\A]A^A_iZHAWAVAUATUHSH:D- EuHH[]A\A]A^A_(HEAHD$HXDžXIDž\D$H|$q{HHEELhABABLME1Mt`Lh1 MAuApAP(IH ~HHH4u9Ap8LHIBAR9tKM	MuE9HE9t=H}7zAX\XA;\$}(HHLEH
Y\$AIz1ABH-Y܋  H
 #AWH= X\Dž\X(HD$LHHDžXDž\HEHcXMtHL[]A\A]A^A_XXH[]A\A]A^A_ÐfDfDSH7H_HGHLhABABLMteLhfD1Ɋ MAuAxAP(IH ~HHH<uAx8ARHIB9M	MuHHHHu'HHHuHB(ҋ@8t*H@x1ɉʋu
HH<9(wH0Ht7(t-1ɉȋH49tHHҋ09(w[AIz1ABHW  H
w #AoUH=\ VH
K 0"ACUb t-H
' 1"AUVHH
 M$ATѐH\$Hl$HLt$L|$HLd$Ll$HHHILD$AHHHH+LmLd$EL+l$Dt$I1ALTE4$ID;t$IL
VHMALH+HL)H9IwH@H<	H}IL+SH3HD$M)HtI)HLUH;HtUHD$IHM)LeFH\$Hl$ Ld$(Ll$0Lt$8L|$@HHL9#tA$HHD$D+D$Hy@H}^H@@SHp$AB$A$ASHE1H/E1
1t%Ht11ЃuÐUHSHH Ht1H@aHHuH[ÐH3UH
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%8d, %*s, %.*s

end dumping hash table

(standard input)define%s: The input file is empty!
delimitersignore-caselanguageslot-nameinitializer-suffixhash-function-namelookup-function-nameclass-name7bitcompare-lengthscompare-strncmpreadonly-tablesenumincludesglobal-tablepicstring-pool-namenull-stringsword-array-namelength-table-nameswitchomit-struct-type%s:%u: unterminated string
%s:%u: junk after declaration
%s:%u: missing argument in %%define %s ARG 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!
'@J&@J&@J&@J&@'@J&@J&@J&@J&@J&@J&@J&@J&@s'@s'@s'@s'@s'@s'@s'@s'@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@J&@'@J&@J&@J&@J&@a'@O'@J&@J&@J&@='@J&@J&@J&@J&@J&@J&@J&@+'@J&@J&@J&@'@J&@'@J&@&@J&@}&@0@3@p3@|@15Keyword_FactoryCa@Cannot open input file '%s'
-wCannot open output file '%s'
error while writing output file
@9@9@5@18KeywordExt_FactoryDa@0@in_word_setPerfect_Hashhashwordlistlengthtablestringpool,enableddisabled$
finished dumping Options
KR-CANSI-CC++/* Command-line: 	
 !"#$&'()*;<>?[\]`{|}~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 <string.h>
                         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 <bug-gnu-gperf@gnu.org>.
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-resolutionQ@K@K@K@K@K@K@K@K@K@K@K@Q@Q@Q@Q@Q@oQ@aQ@K@PQ@3Q@K@"Q@K@Q@Q@K@P@P@K@K@P@K@K@~P@K@K@K@K@K@K@K@K@_P@0P@P@K@K@O@O@`O@M@M@M@M@K@K@K@NM@mL@bL@K@L@K@K@K@K@K@K@K@K@K@mP@P@P@M@@@{@e@t@L@K@F@H@H@N˿@N@Z@7@c@C @E%@I.@G]@Wm@@S@T@k@l@l
@D@f@i*@j/@mC@nM@o@O;@P?@QP@]@rd@sr@hw@v@d?HB
#<unsigned charunsigned shortunsigned intTOTAL_KEYWORDSMIN_WORD_LENGTHMAX_WORD_LENGTHMIN_HASH_VALUEMAX_HASH_VALUE%senum
%s  {
#define %s %d
%sstatic %s%s %s[] =
%s  {
%s   
%s  };
(unsigned char)str[len - 1]str[%d](((unsigned char)* ^ (unsigned char)*) & ~32) == 0 == * && !gperf_case_strncmp ( + 1,  + 1, len - 1, len) && [len] == '\0'inline /*ARGSUSED*/%s::
     %*d
    };len +   return %shval      /*FALLTHROUGH*/      case %d:
        hval += %s    %s = %d%s %s%s%s %*slengthptr = &%s[%d];
%*swordptr = &%s[%d];
%*sif (len == %d)
%*s  {
%*sresword = &%s[%d]%*sgoto compare;
%*s  }
#line %u %s    ,%s%*sif (key < %d)
%*s  {
%*s  }
%*selse
%*s  {
%*sif (key == %d)
%*s  {
%*sswitch (key)
%*sswitch (key - %d)
%*s    case %d:
%*s      break;
keyword = %.*s, index = %d
dup_ptr->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 <string.h>
    %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;
(int)(long)&((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_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 <bug-gnu-gperf@gnu.org>."
/* 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);
};

 A r@@@`AW@ @@APq@@@0@AT@p@@AT@^@X@@@@AX@T@T@@Ј@21Output_Compare_MemcmpDaA`A22Output_Compare_StrncmpDa@A`A21Output_Compare_StrcmpDaA`A12Output_Expr1DaApA11Output_EnumDaAA14Output_DefinesDa AACaACaACaA14Output_Compare11Output_Expr16Output_ConstantsA|@|@|@@@pA|@`@P@`A|@0@ @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;0Hh`(x8P(hH@x


0HXXphx	0	H		(	`			
 
X8
P
h



8
X
x
(@X8pHh( @H"h&.../
(/
//0/P/h1H223383P9h99x:8<x<8=Xx@8EHH hKXKpXL(MN0NZ](c@
8cX
Hcp
Xc
hc
xc
c
c
ccccccPdhd(d8dHdHd`eXffg(ghggg0hHihhiiXkXmmHxssxtt8u0uPvxx{{((PXȖ0zRx$@AC
BKzPRxL@$@CH<@CHT`@ADG 4t @vBEB E(A0A8D@@@@Dp@DzPLRxL@$@<@T @l@@BA@BA@A,@BEE D(D0,@\BEE D(D04,@yD=ABGB B(A0A8Gl1@1@1@1@$1@BBD A(G@2@2@D$$2@dBBA D(D@L@3@dP3@|`3@p3@3@3@3@,3@%BEE A(D0$4@A<5@L9@Al9@5@KJO 4 6@yY=ABLB B(A0A8G9@9@:@<,P;@D<@\<@t<@<@=@0=@P=@p=@=@=@4=@L=@7Dd0>@|@>@4`>@BEB B(A0A8GA@
4A@BEB B(A0A8GD@A$4E@BDA I(D0\@G@HA4tK@BIE E(D0A8DS@%S@>S@T@$ T@BGG , @D0@\@@tP@`@p@@@@T@T@A<T@4TT@BMB B(A0A8G@$V@AKF $@W@ADG $W@BAD 	X@%A$	X@
,<	X@BHE D(A0l	^@WJL 	`^@PJG ,	^@BJD A(D0$	p_@BJI 
0a@:A$
pa@JL 4D
b@BBE E(D0A8Dp4|
pe@BBE B(A0A8DP4
0j@BGB H(A0A8L@
m@yG4m@BEB B(A0A8D@D`p@'\p@A|Pq@JL  r@JL @@Ј@@s@A<@T@l@ @0@,s@=ABGA A(O@6=AAG`,
@
>ABEA A(D`<@@AT@BAA t@DP@D
@
@
 @=
`@zAD@
@D4@AT@YJ$t`@3AAG ,@BEE K(D04P@:>ABBE B(A0A8DP,P@EBED D(D044@O>ABFE B(A0A8Dplp@#A4@v>ABEE E(A0JP$p@.BDD ,@>ABEA A(DP0@HJG $<@AC
G,d@<BBE A(A0,@=BBE A(A0@$@>AAC
M4 @BBB B(A0A8G!,< @(>AAC
FM4lP@SBBB B(A0D8DP@A$@J^P@@
$@-I#7Cw1M!

07Z{				?##z

t1g

<qS
"T"*	j
j0>@@
@0@@@
1Aap@@	o @oo
@0@aB@R@b@r@@@@@@@@@@@"@2@B@R@b@r@@@@@@@@@@@"@2@B@R@b@r@@@@d$A @ae$A$FreeBSD: release/9.1.0/lib/csu/amd64/crt1.c 216338 2010-12-09 21:31:21Z dim $$FreeBSD: release/9.1.0/lib/csu/common/crtbrand.c 217375 2011-01-13 20:44:31Z dim $GCC: (GNU) 4.2.1 20070831 patched [FreeBSD]$FreeBSD: release/9.1.0/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: release/9.1.0/lib/csu/amd64/crtn.S 217105 2011-01-07 16:07:51Z kib $.shstrtab.interp.note.ABI-tag.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'@/@17o
@
hDo @ S@]p@pg@b,@,m@ds@y@@@f $A$)A)|D=AD=@a@@a@(@a(@0@a0@AaAP@Ca@C(CahC hC{G

Man Man