sVXܝ\]]ٶm
8`vIBB14hPu︠={R`lڷ,pEI(} # cJm_ߧw >rTSX1
ʕvԩSjժ,y!.]ŋܸqC`-AAAZ666>.]:ȑ#ҥc_ƍiڴ)jբFxyy۫Wx wahcccC]3fL cu1f
;w5پ%&ܻ |oHhV(@) $cZ
!F|>1;;;|||(TAX"m۶O?4XN:Ş={t钆 իW:A3'v2zCƌ'|B.] 7n`ѢEٳG㘗ͣA2/Ǝ 5_~MppJG+Q"GjoD7T"AGlLKTRGGGޞeҶm[ZhAjj* ?F.cee3DGGRxq~QZ5sY֯_ϬYhԨ1]v4hЀ[n v,..۷ ~hQxqo߮QHhh*٣ujʙ?66xÕTzh7U +.#&A;{<=#&F3bG)V
|L:mf;Fhܸ1}
G !ɰPB$$$lj
oo4?~&NP.^H`` #FԢחN:C(PSAAZ*ţW ] &jJi@ʕ([tWҫ߷e(_^K+#F`Ĉ&1 nnnkRJqqtt
ww/1c$:ez왥Yf\pAr}q7oLJ;wjDȱ#$$DE^ҥJEBBO2H׀+\fa15O
c a9wrrlٲz7I֨Q[ұcGKN-شi6rW~~~/_^ٲݻﶶ,ZHcѐĐ!C} 0kkZhQngga-?RnoM( c.6:q!!ybDDУw_ު;;;S\9fڵ+ ,`9~=<J!@JjTm;vd|p_T)wrrL2:2e
#Fȑ"mll4i{lܸs_^U9ѣ^^^ .$22lcXre
.@wLIm/ cbDnEPꁙ1oΜ;RW;::2sLQSӪU+ʔQJ)>өDEEe3# :t(eŊf >HL
\.' Y'[@t@W^p\;(gϟg%&kkʔ)<̟?zqP]zua$qIʖ-k>7mTk
tx7իW(p
sŅfM
OϹsQg&#G ~~~Z9/Ҭi)- B ȁRq\5и'GGG|||tzʕZ|iL@d2JMs 4VȨ\1_Z1+`@ ] 5G{cOؾsoT)+\ d (Dnb$7o } CDDc))) s t@~`*>iB(]@t@1Kiv 2U)H"Z[YY1q H*urǏ <п}l}qww37 T*I@sx(Ss|$ ;w UQom۶N:z2 t'''wA/_h*vڥ9i{.H%nbZ6R+@ @ ЋX(\.g9e2.V)o5|nC]˗hMg1 IDAT \.7j[hKr;>XJ!A$-n%:::G'4By{{߿? ~"o5FwZn /^0i-[=fCmtmsŜTps@
(.>M[͑7CoggGBK)u'n2 IIIۗD̚5+z\\ik+/='beeE
48Ǯ@ @ Ș(cKb9Η6KN>!tU֭vvvybgmkkKJ>߽{c%àA4qppTh돶{Wiܨ@+rbӈ@psڴ9ݪaeeL :L&ҥK\r'O ___TBZ-2T@HaÆ\~=MaܹVzcEp^qFu+T %e(nA=
`ee%eOl ..A'+WeƤ4G<~DL_6m<-[ׯ2d aÆŅ?^zc.\@ӦMYp!ue VMBxxQ^:J(x"M6eɒc3uT>39@-:5G݂` \
#W ] dmLEK kke *VUd8qǏӯ_?ի'L>SR%-[Fƍ͚GY0
Qhee7|XJJ
.䣏>b߿_g0 :СCU#55~QV-g4#xyz庇G
6T ʕ+[.M6T_T¶m ػw/=z`柮.Гy5E|nݺ1|VDÞ={ eRJ!ˑ儆f:h>J t #ҩQ:RPm_#W l] ed2Kc7 7Uto֬F
]6+V̒>9::xbvB`֬Y3&#?6!8991rHGEEq5nܸ[2-νY/55/_f,}r@wrG*4侁@&b!+;
؛t鲆uEk]___U_"[%JPr,헵5SNviי8qb<5R֭5jȖ{_$b =zՂ.Ћ-+ ujKr'B[.^(#ρS e ())V؛^g,ի|y&'Om۶&雭--J[0,Y-[d8}vZ0-[?7 2V
$O.}
?tSe0@; P h^bB l Uj56XLDuU
P-%{[}SSS1b?IM߾}>/<}mq"ec:ŋgѢEfKTD ̙=@-=!!A%>@
sCV:t7Y_'z ݁ k1d!" ,Qll,k7lw_UC=)Ozg\r%:#d% H'$$d?z͚5U>sLI&̝;䱿===Yn- -qz|QB\pssBrR,֣to1|C'@ ,$[b nLELL jԓ=R'%%h" Օ͛}>{, 6Xyxx{N8oߞ+W}s/Ζ-[̲ƕ+W=R ~P5W%)R7OģPZARP{
.,{.YgaV`2]-掱sNBBBZڤIϳg6x5jHNfؿomҤ wlv山k6WHjLB-8{
U r4k .(+zPf;pI dfO%W'nիf VTkhu0ҥKw^ƍuU* L:kdA5'ZM%&&jl^Z~`|lmA߿_gVPcqwwgС\t]v1j(7oN2epssʔ)C˖-9r${ <8bZyIF׳997`eeUHm&\LC!Qj`xzhdkk3@ӵ
ebhb<\M4
c݆M+o FX_(֭[~$fZLDjP >|H3Fh۶-+WL=ONNf 2$f͚dr/_o߾po}<8}欔&
c6˱F빗'K/Yφm[[[1:'ry'bs?.X6ihRGҰP?z(ʕ+fk`` sPxq
[lYzW^|'-ĘP,*bxYx* ʖ-Wv0Y 9 Hg7VYߋд3h(wZoqիBgZ=7nŋ呑 ݺ-YS 6)T3*K驭 W'ml40 .ߌi`bbĊ,Ǵ>rзo߮f ʕ+Ga֮]A.3m4
w$B)@wgKos?-9O$X1_ZQ 9(-_ Q(fٲe&ӧOuTԖ Wsrr2s_[A'""Bíkp y#
?+@uMΝ|2={':8*] d31".Vrά]͂/{ jhKb~N8Q!555[Ʈ^z4ljL-ס}NZH2%@ 6JJJby$UCsy Uj[Aiĸ6{ѥK4˽.J Gc|<3]ҥK5e2Yڼy-35 SLi]?!dhqLLRC.@ ~$+ԭ۶;1J&yZj<ݻ/w}R(Y?\#%6g22e\l{>00#Gj7oe<ʕn@J n~Z4k1en/gi jYJB PjT?eΖ./ǏT:\~֭[3zh4 gҹsg~gxڰջ`0*UO>3i$s >\yppۏ*Ðy!QQRQ(^ؠ^q)UZ (,^t@`9 ȱ>{ά `~u >3d[ڵk_fnݺm366g2w\7oNΝ9w1UńׯFlTF ͛7s8 2dHބyF#>3M3IQlYkiAơUKIL oow=^l9p`0QjÉδʊ2Kq歴2v _5K,pS\.
\p!ÃRRRV?[[[3c 飒(66!C0}tի;&xx8C MX ML*(YOBQ^^ʂ+89#>>A< 9䴒 <`mfh*U4.ܹCRRKM6FofZо}{3w\T1bǏ G8F Ӏ ~c"Mks| ōiVIսL&S
իW3x`\.gҥZqLL JJ{]z? #99Y| CpZ**XPtPHP\,B X
X)M>E>'NHsO5j+?dޤI,z7OիWܽ{WRʕ+t=G<}~tRp5URkhlB6/?`8cAo~K+ơlYv=t1B ]jD&NbNl\峺Tɓ'pttdٲefٳgOIHH %%0RRR
?γg46 WRkW,f o2xp9f=7g
z Y Ћx{g tjw1B eF$/ڻ Ϝ5K[}#%%Eƍ Y''k&M[ {ӦMzު ݻw Si:ŵ .Ejj*;w/dҥZ-)))k Uq*}V sRz%Keaݯ1z$Q/R8B ., `1
Ln͛7:wW}^:[lPB&cF,:Kw IIIk d< gʕoߞ dzrr2;wcǎL4IFݻh e 6oX)qUK'02ƌչRїKT2+B
fi([=r/@ l&R=~V6ylmmiY[gj~UVݻwk$
zu2ԬZ
/_ yPoݺ5ȑ#&_ݿ3gҦM<995慕Ç~ qΟ?foU2B=>hy
3"ܢ%s/:2k_Yv?&Oa?+ z ;+ 04ľ lF/Ĕ] ~ڨTɒ ڷ[_HLJ[TTIX,X [n5*^|ITT666,X"Edkgs[:uDDD =R26c\hKఘ6!6
PbӀ ;ߤ eЀ*eZ'""I&|B
QjU5jDPB 'N$""h
qۭk
qЬiS DŽ(P@{d^|۷w AAAHuI||<_ѣGܸq G a*֭Ze
w X:Dt)ZT /]\lu$^gĹb.U4\lyF~N_jlH}ތǎ cǎ yuVN8B շNN~@mۻ'g e@~z ׯ"..HMME&LBB}yׯ_g(+UeKoV5lw6nbH#rE #Gs12CѺc5[jIfGk`O IF!+Y~1u2Flr'P~&Qjj*?<]۶di _'cFd؈Qie2`JН\e̙|ᇔ*7=~ٳwHLT5[g ʸGm>l/7nW:r%ock'-4i$Ae7}4Uy՚unϡB"H[Ae%z,
3te{bsMmJ xe$r'qRݼuטc ?@T5"'11aÆMp[gik-^ $-ga~n0N %hҸa(SNd|6ilq*zS:⁝jeW58wO,~ ,hT6KaAϤ@wb )5\>`8y'Uپe#.cÚUܺ nֵX A^0ɘ3f&((d kDx^W/_2tPZwx ʫwVnm{ƎM~#CI IDAT[/pt <= g8'-[0 9q2h@<<=w;`?PPL'!9&$3y_zg+uj\xƎ ˴irD8LرcP( 22R W,36uL)9+ 7
c=>FDtLu 0=t[=...[=ԪY#*Qo/A^d4TjE Sڲtʕ-R£G2
-[бcG LOsl۶MO>綶,Y0ʉڒd$oft#ǎ[slAwň
yC6mbbb9:sn
]3yy)@r,MWND888`2 /Ov -1i
(Ƶ)UdxpF ͈#x ?Çgᄄo 7Z[[ןhZ
>}N+WbϨ(GNbIf8,3gYa'.R;;z2Wy]J,Pb, dVc!y:۽AFnʙ=w 5i<= qj|U)djyN`(V7Kȣ$?ʒ W2#Qjj*CGԈ0-M(]JBŋFPp) Lw$ҥ {pÇ$'jE[9]s $&&ҧ ?yjL(|A`ܽk(-q,j; ψcqxb}"4Qht*F
yZ{^9u 7nbæ̈́JWWVʟ۱' OD#]c&M~5i}}}fzǍ5"""Ϡr/rE\\\h9קf͚fI|2Νѣ:]/y3k>i)fd2
+i8s)) 2ys_Yts _wI.^bu)9+˕Uʒq ?}3Ӥd ?~[3*||B7jh=H #QB6$?8Xp>[}b'0rvݧ>>>FB
|G,Y???J,QQQH@@ 7n
j/Q8˗,BbV˿ڠL>b-r܆ HmV eJqT- ؇9w{:k;ozDtJJ
6ldz]ɪV¾vt}QQ䀟܄ yD|
c~J|#'|,7ժ1y_'22"EPpaIV\ν{wJ=) M||'3Wq ~QQFe}'enE yTwFo߾?4bzM(UR12 ܹCHH~INN&22`߿ &22`qP(qnkcĹB986:/N !$s5fHOc45WߧVKyJJ
AAAܺu/^d$+T^~͝;wxFVԮUCvӯO/.^sg'F4bhXxn肬G 5}
_F϶(cƚU+ֵ |8fxf=Ǡ
ݠՍ&$\nn CQH] 9"-E.3f먣#=;QfMud2ܻwի f֭[봴{{{1mdݸ^J\<ɊUk2mzfNrӞYb10$cXXE],z4 &۷mURowt*W hԠ>eg6ll9;{&
l,T=m>] U:revRJmys41(x^|ݻw}6g(=
"""x9w֭[<{h]]]HN =Lׯ: ylش 'e4cǙ`Nt'=q*, FSѼ2% 3 /58m*W*Oan7EޞyS
Ȱ^hټ;ۭ~ /sI9w90|fﴵ5ڶ]6\|
6g~Y-jլAк'Fȓ,_?&Mk= ;Ȃ.49"#"-r< ʈY>{MOdggٽ;vǹ|FdT$QQoQ(QtjԨF/:RlYMLl,?EyZ||x~}AuuJsB- 2Qį@ %`Fl?>3ڳo?*V!(!yY=32V Dq ,<R /L~zuP`ADD謳t?lܼj }HoolmmQ(O߭Kg_V/_F__|U9֢%/@ C!yA]
5}ߔ.]6[>{FCxaV7뼴m,%m1̈́@7)@ &\\ G7fϙ^LL N1:y~''.OٲgΞw"'*!\\TbPF͐P(6b
\ƁhۡcVs#MDd]\"""i*fd -%}soo/nHu 66Sg
tg`M^ B cx@i)DBBbs!ь; e{
P`o-1ldQ=\b!Ѓ_̝=Ӡ
Vr%۾*xo^CB+@ hgʍz
!f9X( OZ~㦬fMj{V2FDrr/bm8˺
=
ۿ"@ XW~-~ 5ZDv| Of s8
U [ŐlZ3:zl\ Qf@2lC\bkkk~ښc0h@08yJcEmn b@ ,?mA=+"???~1\b$*--f՚sh<˦۫#r,cHB-<3;:@Pp
Eݰx
z6*X.;\YK4ors%.2K*%dF^1oBm$F1 KhдK-784FqBJes
*C 6Jn6n0G$uWC{w3!Z3{C8Q\:w1?$6l۷v"PMt@ C "@h& <$F矕iqsN@3 eh$!f]\ds1FUpLzggF gXhtFe
n ̔iՋ6 -@ ' eɪ@&c#vE ۷̞3:
3a$L*-сր%JB0F@[=;,BuO ݻhټYl&9jrr2Ab_CvIu@1gPHJHwoy ް[
L12k\I%rJlՆ }GGG|ظ8̈́yVhH.Pr%V,[´)E&Ǥ?
>\.g#y!kkkWT?Et@ ȀcFDFҽW SYhi GFMp&K'Z(,U`mmY? >2 f^Z ]*]̟ ;} \2}%%I6Rt):Ӻv'@ R`uU6x&&&F}FyOٰi)6f,˭+EJ5kZ ŷ KN/^LoJ$Y|;h[nS?$41l(^%W.LX`4"ƍMl>iK2!mb.Blj EcS)ɋ/|yA1@Z5
'2sb{"Bl 8]e$IڵIF `7o!4446w FWȊm Ծm{Ʊ'-'''~ =];w2/P D+@5`7ʜ 'V"ITJ˖xQ.0 x GE0;
K/fs'evKw)թ
'ܾs0dN[ a̝=b4 42I&eo|BNmb (w?st5 ph}TL<567Q'a<;JIN l6ofɰ HlT,߿ݻ $Is$k,Pno&\"7I9WۑwDAAgږ(w߿s?pv%MXzb 1@0h: ,Q X$3w`6I.͝ӧ8m~ p sa"э7Ixxxx\<<>\4꩑4iR6_¹)cF:qt^g( P>o ;:vή={ - #۰ [mNP~̀4@`Y`F (=uZv%b?v0{j,̜:gn90Nj/r81DAssz
{> 8xȮt]*TƤb lBU̇+%D ڒݺt#U*;!Nǒ-R Ac
.^s'Sd oPp0ǎ 7koڂN|QHJ <ȂBKzn=ZI_r%ٻzl PH*(5"\r]6Sƌt&Oj}<5;5_N ?Ξ;oIgox˫?皵]h9ZtAd}*4-
?#.b]I S Q)\W%v+RX= f6 *SP~배 x4i`=SZ
ዊ9>?;#e}{4fE _|IVm~ðσi+?XtA 3'(2"bsU%Jz.عkŅ9+gT]];*āQ|`0 K8v ɒ%x2;vZ%4b 8b\^^TRXG S~#F:W#__'550_=O
'/"8*s
-4w Ǎazv# ??:tjg@T0!Ă.;_Z+gLOdʘh*!}zJ/N&ҩ#%Ņ;wf}3 *Ec{e"eI1wCt-]n;kҥ< K?>~DeC*}b ut7陙"Er=%˖|*K~ GWL
Ȗ5k-_ubT:I
A}Q*&Ml- a&z36}T̆dmm
J_H
,kWǙ8 ~ٌ[ڡv͑ A
)\`Dȑ- sJqG4܀]r,6R 0g@ oLR%HBRLA
(R7oY̸hE??1PNNNtҙ1"A6-صBP+5*c{ӧM&Nvvĵ7uTE}
}x F
]]])_,J#~ O`~ Kf@ L|"6D۷{#%{v)Yкe r;dI&5LJ6Y5&O= +6Ngj{qKdlG ࡱ.a(m [TM{ ɑ={ DLhX 2~lF ]%&%}6o!m4O
ɉܹrѶM+2OǕ+WypX4.y3O~j^ͩMSeAzKq#[`c/}٫#םj(p Ny/I0a ;c<}
z,# fQGDs t: eJ\鑉/ }|]xzr=^ze#MԌ >Ĺ=SБ#
|R
8 9 ?~WZ͜[Х+ 6j';
A.(h Ĺ hX^ON _TMzL]-N܅*u8~$oܠZʸڭΗ[Q_ǖT$y&LH]9m
s @j R- ^хLR߸A~9{rEAP)2G<~իUUk;>VyZRE&%=9o;RI'k!999#{vZ4kJ V%\iؠ>gNVď3frasDcqoQq ^|Eebp]~>Gp H%[f ,Gr$}U ~~@}u6\O\
'd4iR笙.TС ̖-Xj'O6fI,Z4vmɐ>}/S>rp)Ρ/m 'Hd:rCDnռ> q%K~Le
Z fCf%XG!hW?RO:EPP0ʕUKz
Yx\JT}
MӘiSTY~Yx'w.X|WWy/iִ ?>Ϟ?ݻw"svxޕƪ/ Iz:lݦ{q|CܽwOӆ={k8poIȍT)SZqaF a?s G@ `\n Hk
iۺ<,V d2e F<,jD=k
ՂN 8xse^xY%;ʗjUR)S;y7Ϝ}1Vn8Qy"Yz%oҔ7oZ} %I9;W.rdNڴiȐ>= xJ{ĸpy
AA0fE̐fu\^;VL ?DDz>}˗t2_#_ ?~̋+\2E
Ƀw>|MlYc66y6U=X?%040PâyQb@ym8SV%ggq6o!<<v\fQA+_Mu(Usf y)ѱK7vci7*7`}P:;0g ̞1 9D& #_|}}yo߆kx`}dWWW%Ri'N[B7Ҥ }tIij:T[aߙ5OFɬ3$CYSFn(\ ]o,䧟GFz
(jczUTeHOQf =Lu3G3ں}]{2*]/cvgf%NnZ"AꄇSt9? T@\aPÒPP0
+ׯ?@3h`
ʢ/Xx"]?x@f9vD L*I2&Ă ,D5gP`P=ze/&"\rEr0^8E!
}b;J%L?*QEACYNS䇗?-۶gނ1z04lPXsu\1Y̙;f3`5 \5e`: Aŋ!7:DE`
.Qƣ5/kPYhe]Iʒ>+,,~ I~;zuk PlNQN= >"R¡#$H,(mI˛*+S? 3S֡bP툏y#>肠g>%_<̙9O_-DDPBe je5|Pyͪ ̀oӽkXM). M *կG䆄 r`NҧKgp%Ka0chw-I+ @|Bꃿ@\ϋE梊ED]zA믔UrbKj#L1ciٶ=O<)
qi_떊r lH9ұQ `ͺƚvaw0%fow|-HsQ؆
|h?;uaꌙV/n"#Hm<;`*9 =F:عkHQ0s/h*q@kC
ӥgF>sT5"ZQ 3n]{\<"Z.TИL% \n ?*f^ѱkw~:1F 1Q5CEZq)8ĘFX_(f4(WyWEq kԄn[eNNN4g03D.g ht̀EKR~C._*R4qCP$'pAMaEU 5ĕؽw-HzMQAa
1ʭwߨ [ʎ3ͥ\\T VsݺuM2wBE EDDDV5 3A&O3J9C+
8*P^D=f :.Z;̝+} + Ky hռw1lH4kɝwEA =%88 -Lm _H$emƚ{DĢ #
pNLm;t2UPB ڷ3\a~^,2gӧQ>3f͎bN?n"s'/ #[6ofҵ`YM2
VDA83 Fzdb:ujCM=fX Nj`PcΜ9:d
ܹ{u6..
m& M[6y$kP3`[lB5V-U>K _D5,& Q7jL$ ΚIbwwm8E"AtApDQ唍jU!!!ӏ9sYN ړ*eJCMQmtύZ04nւ7o Q+DJ6OG }/ Ǐ%Gl&7r)O: g Mʒu HjSD ͛7T(W''';H &d+rKas栂J,jQϓ',] ??-JE}.")d"
_MV-MX""ѻ/OD<(v (*l?aNצUKg3hmIP.M*Ra: s/b^NR2: /_4"RIF5~Q
_ FXi*~) /v Ă.#Xt%Xsx͓5R2Y`Eeڊ]ȨePPP0wȱcHA6cƚ7EJ6(G̑s$aBϟӹ{O{gov( h' THj3gϑ"yr
*yÙ2e$00gj.C=:y/P HecXo(Z8 c'L"44X_1M1U 3d`E}?.} Յ ' X(pڔ6m0bwQ~#SA3H^ܸ@"0#i A=iݲ"E{\凇+)צ!3{6U*VXeP(ԭ.AtAAۋ
˱dy]n߹K&MM} tC? O*T@Hmƞ3dO hgg jO5~A$ wkĉr"D'ORN=^r ` e!5ȡG6#{65Ô#9?NʟIN| ?fА|Q.H{۷rn M)nnn,k&<<< `J9A^D9]+1 #l߱
*YTja ?phW1͛ѻ/Mԙ3"E; $$TIg' *PQŅYӧPx1M> =j/5( X1mmV|u?S]_5).m<ǚ,f'Nїiն=\)a5 }VңV7͍gQR%M<|(&N6 0FD/
:F,_&25D}{ӧWOS]R,=?"q&q+@}ةUQ?x7o葯H1]>J":$KSREM|!=z%Lgu0*0_tAb~L6M6:odԿ30EuY*G IDATYU1hP?q(| e9`CڴiXb)ŊѴ :v펟n_( N(K'˛' ]Uz(+~~ qzE=* JXl9+WcIla\
H(VqiȖ5+W$w\6ͷ\qT (st1'N"
Yeï#*^N(R.I.PFZPp0LRlظI$h3v6GǛ)DDD0hPvmuL
=ÁYvֶu+OUIw` \qE_OˀOѻ74mT+3n H'o^Tzuz2~L й+ϞIWtb{f7(auT(_ά ̚'#FFDr.* .FpEix
x]
| T?5 1rOfY^,%yd,Y0f_6knT0Tqq _zET&vK5YnHvt7թ\E&~J<=3IS1jQut! D
eE.>+2|ryyJՕcF)cF&Lbk&Ta7`L8A*Hy 0_ok ~ 9)$m@gޚ@߸+?? } ///\lT߾c'z9""3aU]>b4-^3N&m4"`U $PyQZх+o<0J/f DZ't?_K%.8*_J5GIyhڤ
#6p 97r9ܹk*w1 &$75az$vw)a9w>?2@i@oe4F7Ou@):y"˖YtP5c
O(ݺtO
ں} `\(肣ʘNNNTZ@7阷`s,B8qbzF]lʪ?t
S]rćK1/ٙFE"=+b $RIo4MJiҤhA y$+V:d2N.` "N=4HEtԁi綽t
tc5 BCC9|(_V6^bN:Gu 'e%ρ%@i@SvM@@ *T긎Kٹ{M|J
T@? &ٙ&2{45_1 9B8r[eR,"@ZՕ? bx3kq\tj}N~yŅYӦ!}zS݆#홗K4wBb,] 0ȥu`ez&C̙,7o6b$uGZBO)+.[>Sڹ7Տ =Fn=xv^f"Er&Ogʪ,̮y
cΠkѾcguIPD%""9\yE*UױtcAܵ*5j1wBF p(l,.
o S _TjyC~O?2/^، K,A LuF!oM <|_6c`t Sٻ=> X
<f%vvvnZl\E"r}ԅ]S ePAtAEt,b[j5gf1 &OaSB__)l9!`LGsh]~lέۢX0mAiWjg 4kӤQCvoiS(Tto߾e)TY{i *& k|W-# rX9蕫W`3BtqvfM k&!?Px5h7Dz*+`4>pҜxxx07:zIǒ#{6(<<5Sju&Nʻw=
+;YD W"C/\LX L'M%Sp!2f_p^|ɝw9y4ǎ0 CGRVMd ک#galARvQ DaT(˗hݎK;W.HEeTk$ϣ@ TFG֭hҨ! $ٷcs5tz` 0) KN"VHד5ywޥi<{CǯSn M/;wҲM{ӻv ٔ RzMS>2 "bU+TDI7(
/>(KNhv81ԣef-ۘ =vܡQ.-{e
1X{a2 ڣ7֬MgƮ[XlO>#ʖ1mt;;~ňQosLȍ D}u
(+Sa8T+xڲl#ylXAϤWȫUt`"Eh٢uk&Q"7 3g2m{-P`,0
5DAXt%RūL<Ѭ@)R$O >(--7 ԩU\^^ܸyPs pHpN|iV_zEӖmXh,-@*[G#U*6G^\cǙ2m d>'R .f7mJҤI=jdV=
eJe=3fzc'''zNo5֥( v% 6;n
g& ?~KZO"9jԠ^ڔ.YjUٵ{S,CGԗY*.3K@O_| $`!f-M&*YfYn Mă
5W搜,險˾W ٰz%S ZN!<L@A *v,5Fu([ .VRYz
[-W`"N]bT5Ĥ-XȳgϘ RJJԩ]
Zݽ#_.Y+-M_J8x!M]Kͥ[s=),Z
_vmb͚o)uj4'F=) Z kh]v:{e_spqW6CAwAUͩ+1 /^<
JJTT} ؽ{K`&ښ <)&.15c
:ӧiФ)&O@~]cNE%M6/H/xy[3l:ʜk
8p_;&j< QXt@z /Y[P#2E
*/GʕP R3X
1 jM&4Z# t @?u啓E觟s쌗>>(Z0%+g۷o9pvdמ=DwQȳJ]lCA hzGDDsnvڍgfWJə=; ċċs.'ObR(|}R)6x&XS}q $OZQA>kl\GT"A25Z B\^x{S }|ț'ŹU`מ=l߹mu{)X y> q@ϴ-Ud8owC P/]nDL;eE?:t,]"[m[Z%{
*iӦ!g ȑy' y!~uiq& bϞ} ;~0}7Ln(eĂ.#ϴOgހ Θŏya^v#. o!2 @cTytMG ci`\%/އƞ%zw8;9sfŕW Ȟ 9ə#gC+ >9x0O<֦Á<`
*HpT2A] &×9jkW>]:J,W dϞ9=[62wqY <āC|jt2ʯ|p[n9 `\53:ՍWx g?٬ } )P8AuZ53{tصש]߿7oİthߎ~3̉j7QITp3MnZ%$NGb% v$I*/@xx8~ח7o|SB~ &EspE A2ٙC#"l ѡs7 Z*,P '''ʗ+Kiࠩ\ǩ w0&ӡ Ji pq5777Rx8s o<&447oq-nͣGx¬`Sk=B3zx ^9- ,@?zK/c= T& VcYpEc; &piiՂ% "E@^Lק|) 3`,*n@26n@UTԦZ jݝ=;>]:;K+]_?@B(`,E )VeK`xI $L W]ع/-pgVrƚr>|/̝0rS8wk7pHjljTg?)2jZ~u44^zʅ`+Qljbkukb)!/^Pd""t3}*(,lAtA*ز by t~ ;
n ֬[ox&F*Өb#{6̜b?Ǎc1F&Urʂ/.@1TZ@i>cҒPCZ: a~1+ =xѹE`EhӲ% & }MM DG:nfȒ% sy{ V
U+Wݻ<* %%I>,y`Qo
g6\z6Z|Feܹ{WS Y"VDA{# v_z IDAT ec(Wԭ{>ȺbK@m1nFƞ#߿gm t8;[ڴiie
,7ySHʟ(/4 \@ 7
ur@lьo\2l۱Ӣmx ٳkI i|!;A\\At|H^ǟԉЭRqՀD#w\L 7>ޟٲm;feY+ޢ,Qg^T6~qSZWV[D(_ U+WJJI g>V2r`N\]]Bp1)&ADA giLU1u LNNgJ9an@f1T'I^=pqt
cΟ ;~'Q>ۀS#LfTQ9^ }xzfjTRR%K?Q >jao/^-8yQ Ld(qrb͊/V,Z9qC~ε
5"]*h~ & C.//}nŢXv o3o*hMS;tuudTT*+3GvƏ73fZT)Srh Ci)LfO_&/^O'bww-B)U8 0Kn)|}YF֬]gμ>={0v@Sx. =↪bQ ]=:Ʃ0r5M+WH_RPASΝػ&tҿc
ţvˬz_g K/dA)V(KDbx{{ 3xoݾ={ؾs7N6~_hz?%Kc۵/2boZ@Ŕ
9?gjU;vҹ{ϾGUM}???ɉտ>Ηq)8'9u>퍷_O10<{ٹ{2,w ѵs'n\f"]DA{*G|B.퍇ۧ`l(a($\Tm'''UB=)XE;
~3g8v/]1ns8;)S&r΅O|x/ ҥ}w~vþGҥv=""BJOS )&(`$C ~.EXyD{ XZ{ UGTύ+ gV
ҮMkթM u\~kׯsu^7 Sɉ ӓ-kVeˢ7ٳe3sfcsY _{w u [*ɒJz,ym-˲K m 4IC'!$C7 930@wBHHH0d!dleKd[WڬRi+WcVvy?s$-Օꫫs}dٲcywm3_xo_~f:)IH}oM81gM> ]ۊ$ϒ5=9ko-8y;ߙ rYCںm[֯ߐ
6unlذ!6l ^-[_0aB9L:5 sL6Ӧ裏1G Y3g+O<{{ ߽w7u 7 ? |I1$ K㥶"#F^;n-7^]&NݛNwww^+vѝ?Ǹq];vl2#3f옌 36GNq]?n\ƌ3P7x.ry?Yݹbٺm[3?Mi?deJ$!GӸبQpsu6u/O=t ^H?hV Z A~<'~ =~m.lA6lXe4.gEu$Fn.77?t;1}~k h ^pI(+ oڎNq1Osd\,Zxe.X3[ػwo=</^ŏ,#K4}gE|;} #ܝ5fLM6A_2s Yp˲p0aB/͛7gc˳GÏdZsiKmb_H$%$ok}>+ :o C~(hmRHkܙ I~9%C G 矗sfgޜ9;wa;kz:+Wʚ5Oe՚5YfM6nfV$⡏hgiI֦,ՕWˋoؐ/gx Сl-/Ss%oi),%yg
g 0 }TΙys3OϬ2omߞ
6f
Yn] :qf7ٞ$9ȿ!ܟJ3~ÂEV)I8bM5"ɏ&4 nƖ$?F olR KW}N˾#Fˬ33} Ɓ$&FMcU2&Z??_sE$ԧ/Io C;;#O
UzOj~
onpWJ,95o5)h٨ˢ_җKU5cb H㈳}J6ҩIvqL$dR
CA J<}iV4* o}Qlݚy]:Ћ؟$,g*'4NՇIOr,yL4^ڸ)/dC8&lw=Gr)$ǥѯqw(\oJE͇$/ i5^;8* <|yPpdv U vw S>4vuH2P` {z/+w C+ï{8TՀ$/.'/ 苒:@;y7x [nʹSkUgU_y==8=i\SIooo+R"\\v˸4d t hs_]N5+ stɔ-U> ^͛7/EA@ٚmNPxaѥط Ќ*f
P؇~D
*Eo~~;:NˑG Y2Rt hI6T k\;Iεl@@VY{裲 zV83rȒ)\@@*Cfm.cƌəg^2BKt h9'YgY2: R ~~lRg ?'8t hG ,zY;̱l@@VٓdUQ@n)X6 @+%ŏejq@?ɲ Ze}۷VV е -+ <]vժ Skq Zj[L)A? ZikQ@ًS[\&'gـ #m}f gـ Rm[ i[6 @رC@O[6 ݻwǎ 4; 0
]cA?ʲ E@m=i =:ӦZ6 @]
v;x}e: JO'ɘct`_k% G{jW=,U~ht }+@Ljoc,UZ\ t%vWn t >zJ' / Hkq v: BKuAoť Zh##F.^e退 0($ٻw_8t h%5vػwo锝
*G 7V ; RU: LQ5 {43M 0<zرz]Ldـ R2f;蛷lifK
*G Y-[t`X9dIk[젃 HGi%LR4 t hIFMY@: 'GN2er
$- )0v;}s~Kt h 载˥Ӵ -S>vtu碢6t
*E;u{Aof
0,zϟ{N@ zNpy~Z t Vf >cj?/ K W׃: 'S/0}*ڵcA@Y:볃e˖t]"`g[l@@a;::rܱ|AYt h#'OΘ1cjO=t3V[6 @R2xz'Vlf*t hS:bqʦ: %tΝ;ai=( "&P2ayj%:AKt hSK'|y' )N><Me: E)|At.k2P/ -3tٳk[mk,`Xɓ'eƌx&w'y̲ Z9gdiS,9 I+0FK.kfڃ
*N .YXSG,
@˔ Z g}./: }ϴij k=Il@@V}ߺd,ULrdɄ^XtIS'ho Zы#dULuA 2W Օ:|)֟de: ~2
ll@@V ըD -tB]ϓd2' ˂#G۷ /T/ -S>2vZ۷hf#A@82 W\vim %M|u
W$)/7ye?u 0StgxM/.Y4'y Z#9g]o" @Kt&d]
prI%]6 .vA@t ?پ}Gi 38# w\m &k退 CmRJ&,Z pruE}Z`ҥL( E-Ǎ˅̫'W
QtA_QF N{)ɳ 0OrbɄE Y: @+R:a jU&?V IDAT: ĭ%O?̘>Vhr]@ $Lf-;v-֛t j7',PϗtcI- `O0!ϟ_4"`ȍLrCɄ\PdD abAI%Z .Qٙ u=wNۚ)t jE+^|L%I {lyz{{KyAt 2[:;;s
[4 t 2[.L6|og: ڤ$ [j_&^}0K t
$Ueȑ#snoٲuk^\tDA@!S/ɓj] 瀀[iT[w~[
I @@pu==ztn6O&f) C]͜ t I:6hoY پ}G4 $Ɍ*'NW.}AhoA@!Sn)G qD qĜ}֙*W@@s3bo: 0<<(?t6י&͛rԃ.:@;;ɸDٙ9矯r*P)@@hoN82~xkM@Y /NZ*^T$:@t¼[е :@|*ׄ}v uuNTB Hooov z9g [t@@hsŽ*{5 .@@hkN8U^}]@t :;M}: px&Z2a̘19SU {R-@@hOgO8T&TAߓW =^<4ͪn iN9dUkҾvw N9E՚Oav @@SfUA /W5jTfΜrMIFL8n 't
B;耀Ц/p62: L?^@ : +0c6-: CЧO> t@@hSK'e@@0,{MOO@6 >QamUR W2zh[TJ:^- q
: t@ 5j
K7 耀+ep^|qku-S)@@h_E ep}8ڎ}}}*6֭?柿J WV ocO
4; fmܸ);v IR*֤V
4dq\R myͱd چ/ l]*֤ zxJ3%_z%kҥh* j|G,ƍT=?Y橪SMr: *U_Kۛ_ޟ{/ۿr@:_r? G/sɴ{ T$U>#m&oӟlQO_-3@@mI??mB?iMreR Ii 7WSO9
|^:'YIĀVP?Ϧ|(}}}mSOȯfp: }~ÆL8)Ω}Q>O HKKI[Z@3^Nrq:?CKsq:>L8OJ̲ zkRMI2x M=/[Ͷ|.;-'b %ٝ7߷ӓ}Yp9i(@~?$$c9: C$N2u]GݻܓN<1v惿k}w%Yj: C7w#U; ̗+ٿ.h~:;~*oߑy_|?I 0Ժfb7 iI8Ɍ|<3{nEM^Z [$N2O:ļg~:wy{uu'c_Uv.(,
@@rv'#ZƏ =~6~twwbX[$HrP~Y3gn
]ٳ&[`oߑo};?ܓo
$+[Wt YB)| ys SOͬ33c0amܿ^~yg6RV^UWgGdٲ깿 I[ 7ǧq9O1-mѾ gc o[ ?~7 _Nr`p 8 vIoUhߘj_V NL >-Ct$ F6 ZN_F 4.5zq VG M0'Ni I㤗
(oM$|y hWcB'`>GL $צq;2io$+H 76.>IiC$_K4^X-/ 1%(IO231IFC~CI 94n%t hctF%ٕ$ -`w^B IENDB` forkstat-0.01.17/forkstat.c 0000644 0001750 0001750 00000070442 13074175331 014173 0 ustar king king /*
* Copyright (C) 2014-2017 Canonical Ltd.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* Written by Colin Ian King
*
* Some of this code originally derived from eventstat and powerstat
* also by the same author.
*
*/
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define APP_NAME "forkstat"
#define MAX_PIDS (32769) /* Hash Max PIDs */
#define NULL_PID (-1)
#define OPT_CMD_LONG (0x00000001)
#define OPT_CMD_SHORT (0x00000002)
#define OPT_CMD_DIRNAME_STRIP (0x00000004)
#define OPT_STATS (0x00000008)
#define OPT_QUIET (0x00000010)
#define OPT_EV_FORK (0x00000100)
#define OPT_EV_EXEC (0x00000200)
#define OPT_EV_EXIT (0x00000400)
#define OPT_EV_CORE (0x00000800)
#define OPT_EV_COMM (0x00001000)
#define OPT_EV_CLNE (0x00002000)
#define OPT_EV_MASK (0x00003f00)
#define OPT_EV_ALL (OPT_EV_MASK)
#define GOT_TGID (0x01)
#define GOT_PPID (0x02)
#define GOT_ALL (GOT_TGID | GOT_PPID)
#ifndef LINUX_VERSION_CODE
#define LINUX_VERSION_CODE KERNEL_VERSION(2,0,0)
#endif
/* /proc info cache */
typedef struct proc_info {
struct proc_info *next; /* next proc info in hashed linked list */
pid_t pid; /* Process ID */
char *cmdline; /* /proc/pid/cmdline text */
bool kernel_thread; /* true if a kernel thread */
struct timeval start; /* time when process started */
} proc_info_t;
/* For kernel task checking */
typedef struct {
char *task; /* Name of kernel task */
size_t len; /* Length */
} kernel_task_info;
typedef enum {
STAT_FORK = 0,
STAT_EXEC,
STAT_EXIT,
STAT_CORE,
STAT_COMM,
STAT_CLNE,
STAT_LAST
} event_t;
typedef struct proc_stats {
struct proc_stats *next;/* Next one in list */
char *name; /* Process name */
uint64_t count[STAT_LAST]; /* Tally count */
uint64_t total; /* Tally count total of all counts */
} proc_stats_t;
typedef struct {
const char *event; /* Event name */
const char *label; /* Human readable label */
const int flag; /* option flag */
const event_t stat; /* stat enum */
} ev_map_t;
/* Mapping of event names to option flags and event_t types */
static const ev_map_t ev_map[] = {
{ "fork", "Fork", OPT_EV_FORK, STAT_FORK },
{ "exec", "Exec", OPT_EV_EXEC, STAT_EXEC },
{ "exit", "Exit", OPT_EV_EXIT, STAT_EXIT },
{ "core", "Coredump", OPT_EV_CORE, STAT_CORE },
{ "comm", "Comm", OPT_EV_COMM, STAT_COMM },
{ "clone","Clone", OPT_EV_CLNE, STAT_CLNE },
{ "all", "", OPT_EV_ALL, 0 },
{ NULL, NULL, 0, 0 }
};
#define KERN_TASK_INFO(str) { str, sizeof(str) - 1 }
static volatile bool stop_recv; /* sighandler stop flag */
static bool sane_procs; /* true if not inside a container */
static proc_info_t *proc_info[MAX_PIDS]; /* Proc hash table */
static proc_stats_t *proc_stats[MAX_PIDS]; /* Proc stats hash table */
static unsigned int opt_flags = OPT_CMD_LONG; /* Default option */
static int row = 0; /* tty row number */
static long int opt_duration = -1; /* duration, < 0 means run forever */
/* Default void no process info struct */
static proc_info_t no_info = {
.pid = NULL_PID,
.cmdline = "",
.kernel_thread = false,
.start = { 0, 0 },
.next = NULL,
};
/*
* Attempt to catch a range of signals so
* we can clean
*/
static const int signals[] = {
/* POSIX.1-1990 */
#ifdef SIGHUP
SIGHUP,
#endif
#ifdef SIGINT
SIGINT,
#endif
#ifdef SIGQUIT
SIGQUIT,
#endif
#ifdef SIGFPE
SIGFPE,
#endif
#ifdef SIGTERM
SIGTERM,
#endif
#ifdef SIGUSR1
SIGUSR1,
#endif
#ifdef SIGUSR2
SIGUSR2,
/* POSIX.1-2001 */
#endif
#ifdef SIGXCPU
SIGXCPU,
#endif
#ifdef SIGXFSZ
SIGXFSZ,
#endif
/* Linux various */
#ifdef SIGIOT
SIGIOT,
#endif
#ifdef SIGSTKFLT
SIGSTKFLT,
#endif
#ifdef SIGPWR
SIGPWR,
#endif
#ifdef SIGINFO
SIGINFO,
#endif
#ifdef SIGVTALRM
SIGVTALRM,
#endif
-1,
};
static proc_info_t *proc_info_get(pid_t pid);
/*
* pid_max_digits()
* determine (or guess) maximum digits of pids
*/
static int pid_max_digits(void)
{
static int max_digits;
ssize_t n;
int fd;
const int default_digits = 6;
const int min_digits = 5;
char buf[32];
if (max_digits)
goto ret;
max_digits = default_digits;
fd = open("/proc/sys/kernel/pid_max", O_RDONLY);
if (fd < 0)
goto ret;
n = read(fd, buf, sizeof(buf) - 1);
(void)close(fd);
if (n < 0)
goto ret;
buf[n] = '\0';
max_digits = 0;
while (buf[max_digits] >= '0' && buf[max_digits] <= '9')
max_digits++;
if (max_digits < min_digits)
max_digits = min_digits;
ret:
return max_digits;
}
/*
* get_parent_pid()
* get parent pid and set is_thread to true if process
* not forked but a newly created thread
*/
static pid_t get_parent_pid(const pid_t pid, bool *is_thread)
{
FILE *fp;
char path[PATH_MAX];
char buffer[4096];
pid_t tgid = 0, ppid = 0;
unsigned int got = 0;
*is_thread = false;
snprintf(path, sizeof(path), "/proc/%u/status", pid);
if ((fp = fopen(path, "r")) == NULL)
return 0;
while (((got & GOT_ALL) != GOT_ALL) &&
(fgets(buffer, sizeof(buffer), fp) != NULL)) {
if (!strncmp(buffer, "Tgid:", 5)) {
if (sscanf(buffer + 5, "%u", &tgid) == 1) {
got |= GOT_TGID;
} else {
tgid = 0;
}
}
if (!strncmp(buffer, "PPid:", 5)) {
if (sscanf(buffer + 5, "%u", &ppid) == 1) {
got |= GOT_PPID;
} else {
ppid = 0;
}
}
}
(void)fclose(fp);
if ((got & GOT_ALL) == GOT_ALL) {
/* TGID and PID are not the same if it is a thread */
if (tgid != pid) {
/* In this case, the parent is the TGID */
ppid = tgid;
*is_thread = true;
}
} else {
ppid = 0;
}
return ppid;
}
/*
* sane_proc_pid_info()
* detect if proc info mapping from /proc/timer_stats
* maps to proc pids OK. If we are in a container or
* we can't tell, return false.
*/
static bool sane_proc_pid_info(void)
{
FILE *fp;
static const char pattern[] = "container=";
const char *ptr = pattern;
bool ret = true;
fp = fopen("/proc/1/environ", "r");
if (!fp)
return false;
while (!feof(fp)) {
int ch = getc(fp);
if (*ptr == ch) {
ptr++;
/* Match? So we're inside a container */
if (*ptr == '\0') {
ret = false;
break;
}
} else {
/* No match, skip to end of var and restart scan */
do {
ch = getc(fp);
} while ((ch != EOF) && (ch != '\0'));
ptr = pattern;
}
}
(void)fclose(fp);
return ret;
}
/*
* pid_a_kernel_thread
* is a process a kernel thread?
*/
static bool pid_a_kernel_thread(const char *task, const pid_t id)
{
if (sane_procs) {
return getpgid(id) == 0;
} else {
/* In side a container, make a guess at kernel threads */
int i;
pid_t pgid = getpgid(id);
/* This fails for kernel threads inside a container */
if (pgid >= 0)
return pgid == 0;
/*
* This is not exactly accurate, but if we can't look up
* a process then try and infer something from the comm field.
* Until we have better kernel support to map /proc/timer_stats
* pids to containerised pids this is the best we can do.
*/
static const kernel_task_info kernel_tasks[] = {
KERN_TASK_INFO("swapper/"),
KERN_TASK_INFO("kworker/"),
KERN_TASK_INFO("ksoftirqd/"),
KERN_TASK_INFO("watchdog/"),
KERN_TASK_INFO("migration/"),
KERN_TASK_INFO("irq/"),
KERN_TASK_INFO("mmcqd/"),
KERN_TASK_INFO("jbd2/"),
KERN_TASK_INFO("kthreadd"),
KERN_TASK_INFO("kthrotld"),
KERN_TASK_INFO("kswapd"),
KERN_TASK_INFO("ecryptfs-kthrea"),
KERN_TASK_INFO("kauditd"),
KERN_TASK_INFO("kblockd"),
KERN_TASK_INFO("kcryptd"),
KERN_TASK_INFO("kdevtmpfs"),
KERN_TASK_INFO("khelper"),
KERN_TASK_INFO("khubd"),
KERN_TASK_INFO("khugepaged"),
KERN_TASK_INFO("khungtaskd"),
KERN_TASK_INFO("flush-"),
KERN_TASK_INFO("bdi-default-"),
{ NULL, 0 }
};
for (i = 0; kernel_tasks[i].task != NULL; i++) {
if (strncmp(task, kernel_tasks[i].task, kernel_tasks[i].len) == 0)
return true;
}
}
return false;
}
/*
* tty_height()
* try and find height of tty
*/
static int tty_height(void)
{
#ifdef TIOCGWINSZ
int fd = 0;
struct winsize ws;
/* if tty and we can get a sane width, return it */
if (isatty(fd) &&
(ioctl(fd, TIOCGWINSZ, &ws) != -1) &&
(0 < ws.ws_row) &&
(ws.ws_row == (size_t)ws.ws_row))
return ws.ws_row;
#endif
return 25; /* else standard tty 80x25 */
}
/*
* print_heading()
* print heading to output
*/
static void print_heading(void)
{
int pid_size;
if (opt_flags & OPT_QUIET)
return;
pid_size = pid_max_digits();
printf("Time Event %*.*s Info Duration Process\n",
pid_size, pid_size, "PID");
}
/*
* row_increment()
* bump row increment and re-print heading if required
*/
static void row_increment(void)
{
int tty_rows = tty_height();
row++;
if ((tty_rows > 2) && (row >= tty_rows)) {
print_heading();
row = 2;
}
}
/*
* timeval_to_double()
* convert timeval to seconds as a double
*/
static inline double timeval_to_double(const struct timeval *tv)
{
return (double)tv->tv_sec + ((double)tv->tv_usec / 1000000.0);
}
/*
* proc_info_hash()
* hash on PID
*/
static inline size_t proc_info_hash(const pid_t pid)
{
return pid % MAX_PIDS;
}
/*
* proc_name_hash()
* Hash a string, from Dan Bernstein comp.lang.c (xor version)
*/
static inline unsigned int proc_name_hash(const char *str)
{
register unsigned int hash = 5381;
register unsigned int c;
while ((c = *str++)) {
/* (hash * 33) ^ c */
hash = ((hash << 5) + hash) ^ c;
}
return hash % MAX_PIDS;
}
static void proc_stats_account(const pid_t pid, const event_t event)
{
unsigned int h;
char *name;
proc_stats_t *stats;
proc_info_t *info;
if (!(opt_flags & OPT_STATS))
return;
info = proc_info_get(pid);
if (info == &no_info)
return;
name = info->cmdline;
h = proc_name_hash(name);
stats = proc_stats[h];
while (stats) {
if (!strcmp(stats->name, name)) {
stats->count[event]++;
stats->total++;
return;
}
stats = stats->next;
}
stats = calloc(1, sizeof(*stats));
if (stats == NULL)
return; /* silently ignore */
stats->name = strdup(name);
if (stats->name == NULL) {
free(stats);
return;
}
stats->count[event]++;
stats->total++;
stats->next = proc_stats[h];
proc_stats[h] = stats;
}
/*
* stats_cmp()
* compare stats total, used for sorting list
*/
static int stats_cmp(const void *v1, const void *v2)
{
proc_stats_t *const *s1 = (proc_stats_t *const *)v1;
proc_stats_t *const *s2 = (proc_stats_t *const *)v2;
if ((*s2)->total == (*s1)->total)
return 0;
return ((*s2)->total > (*s1)->total) ? 1 : -1;
}
/*
* proc_stats_report()
* report event statistics
*/
static void proc_stats_report(void)
{
size_t i, n = 0;
proc_stats_t *stats, **sorted;
if (!(opt_flags & OPT_STATS))
return;
for (i = 0; i < MAX_PIDS; i++)
for (stats = proc_stats[i]; stats; stats = stats->next)
n++;
if (!n) {
printf("\nNo statistics gathered.\n");
return;
}
printf("\n");
for (i = 0; i < STAT_LAST; i++)
printf("%8s ", ev_map[i].label);
printf(" Total Process\n");
sorted = calloc(n, sizeof(proc_stats_t *));
if (sorted == NULL) {
fprintf(stderr, "Cannot sort statistics, out of memory.\n");
return;
}
for (n = 0, i = 0; i < MAX_PIDS; i++)
for (stats = proc_stats[i]; stats; stats = stats->next)
sorted[n++] = stats;
qsort(sorted, n, sizeof(proc_stats_t *), stats_cmp);
for (i = 0; i < n; i++) {
int j;
stats = sorted[i];
for (j = 0; j < STAT_LAST; j++)
printf("%8" PRIu64 " ", stats->count[j]);
printf("%8" PRIu64 " %s\n", stats->total, stats->name);
}
free(sorted);
}
/*
* proc_stats_free()
* free stats list
*/
static void proc_stats_free(void)
{
size_t i;
for (i = 0; i < MAX_PIDS; i++) {
proc_stats_t *stats = proc_stats[i];
while (stats) {
proc_stats_t *next = stats->next;
free(stats->name);
free(stats);
stats = next;
}
}
}
/*
* proc_comm()
* get process name from comm field
*/
static char *proc_comm(const pid_t pid)
{
char buffer[4096];
int fd;
ssize_t ret;
snprintf(buffer, sizeof(buffer), "/proc/%d/comm", pid);
if ((fd = open(buffer, O_RDONLY)) < 0) {
return NULL;
}
if ((ret = read(fd, buffer, sizeof(buffer) - 1)) <= 0) {
(void)close(fd);
return NULL;
}
(void)close(fd);
buffer[ret - 1] = '\0'; /* remove trailing '\n' */
return strdup(buffer);
}
/*
* proc_cmdline
* get process's /proc/pid/cmdline
*/
static char *proc_cmdline(const pid_t pid)
{
char buffer[4096];
char *ptr;
int fd;
ssize_t ret;
snprintf(buffer, sizeof(buffer), "/proc/%d/cmdline", pid);
if ((fd = open(buffer, O_RDONLY)) < 0) {
return proc_comm(pid);
}
memset(buffer, 0, sizeof(buffer));
if ((ret = read(fd, buffer, sizeof(buffer) - 1)) <= 0) {
(void)close(fd);
return proc_comm(pid);
}
(void)close(fd);
buffer[ret] = '\0'; /* Keeps coverity scan happy */
/*
* OPT_CMD_LONG option we get the full cmdline args
*/
if (opt_flags & OPT_CMD_LONG) {
for (ptr = buffer; ptr < buffer + ret; ptr++) {
if (*ptr == '\0') {
if (*(ptr + 1) == '\0')
break;
*ptr = ' ';
}
}
}
/*
* OPT_CMD_SHORT option we discard anything after a space
*/
if (opt_flags & OPT_CMD_SHORT) {
for (ptr = buffer; *ptr && (ptr < buffer + ret); ptr++) {
if (*ptr == ' ') {
*ptr = '\0';
break;
}
}
}
if (opt_flags & OPT_CMD_DIRNAME_STRIP)
return strdup(basename(buffer));
return strdup(buffer);
}
/*
* proc_info_get()
* get proc info on a given pid
*/
static proc_info_t *proc_info_get(const pid_t pid)
{
size_t i = proc_info_hash(pid);
proc_info_t *info = proc_info[i];
while (info) {
if (proc_info[i]->pid == pid)
return info;
info = info->next;
}
return &no_info;
}
/*
* proc_info_free()
* free cached process info and remove from hash table
*/
static void proc_info_free(const pid_t pid)
{
size_t i = proc_info_hash(pid);
proc_info_t *info = proc_info[i];
while (info) {
if (info->pid == pid) {
info->pid = NULL_PID;
free(info->cmdline);
info->cmdline = NULL;
return;
}
info = info->next;
}
}
/*
* proc_info_unload()
* free all hashed proc info entries
*/
static void proc_info_unload(void)
{
size_t i;
for (i = 0; i < MAX_PIDS; i++) {
proc_info_t *info = proc_info[i];
while (info) {
proc_info_t *next = info->next;
free(info->cmdline);
free(info);
info = next;
}
}
}
/*
* proc_info_update()
* uopdate process name, for example, if exec has occurred
*/
static proc_info_t const *proc_info_update(const pid_t pid)
{
proc_info_t *info = proc_info_get(pid);
char *newcmd;
if (info == &no_info)
return &no_info;
if ((newcmd = proc_cmdline(pid)) == NULL)
return &no_info;
free(info->cmdline);
info->cmdline = newcmd;
return info;
}
/*
* proc_info_add()
* add processes info of a given pid to the hash table
*/
static proc_info_t *proc_info_add(const pid_t pid, struct timeval *tv)
{
size_t i = proc_info_hash(pid);
proc_info_t *info;
char *cmdline;
cmdline = proc_cmdline(pid);
if (!cmdline)
return NULL;
/* Re-use any info on the list if it's free */
info = proc_info[i];
while (info) {
if (info->pid == NULL_PID)
break;
info = info->next;
}
if (info == NULL) {
if ((info = calloc(1, sizeof(proc_info_t))) == NULL) {
fprintf(stderr, "Cannot allocate all proc info\n");
free(cmdline);
return NULL;
}
info->next = proc_info[i];
proc_info[i] = info;
}
info->cmdline = cmdline;
info->pid = pid;
info->kernel_thread = pid_a_kernel_thread(cmdline, pid);
if (tv)
info->start = *tv;
else {
info->start.tv_sec = 0;
info->start.tv_usec = 0;
}
return info;
}
/*
* proc_thread_info_add()
* Add a processes' thread into proc cache
*/
static void proc_thread_info_add(const pid_t pid)
{
DIR *dir;
struct dirent *dirent;
char path[PATH_MAX];
snprintf(path, sizeof(path), "/proc/%i/task", pid);
if ((dir = opendir(path)) == NULL)
return;
while ((dirent = readdir(dir))) {
if (isdigit(dirent->d_name[0])) {
pid_t tpid;
errno = 0;
tpid = (pid_t)strtol(dirent->d_name, NULL, 10);
if ((!errno) && (tpid != pid))
(void)proc_info_add(tpid, NULL);
}
}
(void)closedir(dir);
}
/*
* proc_info_load()
* load up all current processes info into hash table
*/
static int proc_info_load(void)
{
DIR *dir;
struct dirent *dirent;
if ((dir = opendir("/proc")) == NULL)
return -1;
while ((dirent = readdir(dir))) {
if (isdigit(dirent->d_name[0])) {
pid_t pid;
errno = 0;
pid = (pid_t)strtol(dirent->d_name, NULL, 10);
(void)proc_info_add(pid, NULL);
if (!errno)
proc_thread_info_add(pid);
}
}
(void)closedir(dir);
return 0;
}
/*
* handle_sig()
* catch signal and flag a stop
*/
static void handle_sig(int dummy)
{
(void)dummy;
stop_recv = true;
}
/*
* netlink_connect()
* connect to netlink socket
*/
static int netlink_connect(void)
{
int sock;
struct sockaddr_nl addr;
if ((sock = socket(PF_NETLINK, SOCK_DGRAM, NETLINK_CONNECTOR)) < 0) {
if (errno == EPROTONOSUPPORT)
return -EPROTONOSUPPORT;
fprintf(stderr, "socket failed: errno=%d (%s)\n",
errno, strerror(errno));
return -1;
}
memset(&addr, 0, sizeof(addr));
addr.nl_pid = getpid();
addr.nl_family = AF_NETLINK;
addr.nl_groups = CN_IDX_PROC;
if (bind(sock, (struct sockaddr *)&addr, sizeof(addr)) < 0) {
fprintf(stderr, "bind failed: errno=%d (%s)\n",
errno, strerror(errno));
(void)close(sock);
return -1;
}
return sock;
}
/*
* netlink_listen()
* proc connector listen
*/
static int netlink_listen(const int sock)
{
struct iovec iov[3];
struct nlmsghdr nlmsghdr;
struct cn_msg cn_msg;
enum proc_cn_mcast_op op;
memset(&nlmsghdr, 0, sizeof(nlmsghdr));
nlmsghdr.nlmsg_len = NLMSG_LENGTH(sizeof(cn_msg) + sizeof(op));
nlmsghdr.nlmsg_pid = getpid();
nlmsghdr.nlmsg_type = NLMSG_DONE;
iov[0].iov_base = &nlmsghdr;
iov[0].iov_len = sizeof(nlmsghdr);
memset(&cn_msg, 0, sizeof(cn_msg));
cn_msg.id.idx = CN_IDX_PROC;
cn_msg.id.val = CN_VAL_PROC;
cn_msg.len = sizeof(enum proc_cn_mcast_op);
iov[1].iov_base = &cn_msg;
iov[1].iov_len = sizeof(cn_msg);
op = PROC_CN_MCAST_LISTEN;
iov[2].iov_base = &op;
iov[2].iov_len = sizeof(op);
return writev(sock, iov, 3);
}
/*
* set_prioity
* set high priority to try and get netlink activty
* before short lived processes die
*/
static void set_priority(void)
{
int max;
struct sched_param param;
int sched;
#if defined(SCHED_DEADLINE)
sched = SCHED_DEADLINE;
#elif defined(SCHED_SCHED_FIFO)
sched = SCHED_FIFO;
#elif defined(SCHED_RR)
sched = SCHED_FIFO;
#else
sched = SCHED_OTHER; /* Oh well */
#endif
if ((max = sched_get_priority_max(sched)) < 0)
return;
memset(¶m, 0, sizeof(param));
param.sched_priority = max;
(void)sched_setscheduler(getpid(), sched, ¶m);
}
/*
* monitor()
* monitor system activity
*/
static int monitor(const int sock)
{
struct nlmsghdr *nlmsghdr;
const int pid_size = pid_max_digits();
print_heading();
set_priority();
while (!stop_recv) {
ssize_t len;
char __attribute__ ((aligned(NLMSG_ALIGNTO)))buf[4096];
if ((len = recv(sock, buf, sizeof(buf), 0)) == 0) {
return 0;
}
if (len == -1) {
int err = errno;
switch (err) {
case EINTR:
return 0;
case ENOBUFS: {
time_t now;
struct tm tm;
now = time(NULL);
if (now == ((time_t) -1)) {
printf("--:--:-- recv ----- "
"nobufs %8.8s (%s)\n",
"", strerror(err));
} else {
(void)localtime_r(&now, &tm);
printf("%2.2d:%2.2d:%2.2d recv ----- "
"nobufs %8.8s (%s)\n",
tm.tm_hour, tm.tm_min, tm.tm_sec, "",
strerror(err));
}
break;
}
default:
fprintf(stderr,"recv failed: errno=%d (%s)\n",
err, strerror(err));
return -1;
}
}
for (nlmsghdr = (struct nlmsghdr *)buf;
NLMSG_OK (nlmsghdr, len);
nlmsghdr = NLMSG_NEXT (nlmsghdr, len)) {
struct cn_msg *cn_msg;
struct proc_event *proc_ev;
struct tm tm;
char when[10];
time_t now;
pid_t ppid;
bool is_thread;
#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,14)
struct timeval tv;
char duration[32];
proc_info_t const *info1, *info2;
#endif
#if LINUX_VERSION_CODE >= KERNEL_VERSION(3,1,0)
char *comm;
#endif
if (stop_recv)
break;
if ((nlmsghdr->nlmsg_type == NLMSG_ERROR) ||
(nlmsghdr->nlmsg_type == NLMSG_NOOP))
continue;
cn_msg = NLMSG_DATA(nlmsghdr);
if ((cn_msg->id.idx != CN_IDX_PROC) ||
(cn_msg->id.val != CN_VAL_PROC))
continue;
proc_ev = (struct proc_event *)cn_msg->data;
now = time(NULL);
if (now == ((time_t) -1)) {
snprintf(when, sizeof(when), "--:--:--");
} else {
(void)localtime_r(&now, &tm);
snprintf(when, sizeof(when), "%2.2d:%2.2d:%2.2d",
tm.tm_hour, tm.tm_min, tm.tm_sec);
}
switch (proc_ev->what) {
#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,14)
case PROC_EVENT_FORK:
ppid = get_parent_pid(proc_ev->event_data.fork.child_pid, &is_thread);
proc_stats_account(proc_ev->event_data.fork.parent_pid,
is_thread ? STAT_CLNE : STAT_FORK);
if (gettimeofday(&tv, NULL) < 0) {
memset(&tv, 0, sizeof tv);
}
info1 = proc_info_get(ppid);
info2 = proc_info_add(proc_ev->event_data.fork.child_pid, &tv);
if (!(opt_flags & OPT_QUIET) &&
(((opt_flags & OPT_EV_FORK) && !is_thread) ||
((opt_flags & OPT_EV_CLNE) && is_thread))) {
if (info1 != NULL && info2 != NULL) {
char *type = is_thread ? "clone" : "fork";
row_increment();
printf("%s %-5.5s %*d parent %8s %s%s%s\n",
when,
type,
pid_size, ppid,
"",
info1->kernel_thread ? "[" : "",
info1->cmdline,
info1->kernel_thread ? "]" : "");
row_increment();
printf("%s %-5.5s %*d %-6.6s %8s %s%s%s\n",
when,
type,
pid_size, proc_ev->event_data.fork.child_pid,
is_thread ? "thread" : "child",
"",
info1->kernel_thread ? "[" : "",
info2->cmdline,
info1->kernel_thread ? "]" : "");
}
}
break;
case PROC_EVENT_EXEC:
proc_stats_account(proc_ev->event_data.exec.process_pid, STAT_EXEC);
info1 = proc_info_update(proc_ev->event_data.exec.process_pid);
if (!(opt_flags & OPT_QUIET) && (opt_flags & OPT_EV_EXEC)) {
row_increment();
printf("%s exec %*d %8s %s%s%s\n",
when,
pid_size, proc_ev->event_data.exec.process_pid,
"",
info1->kernel_thread ? "[" : "",
info1->cmdline,
info1->kernel_thread ? "]" : "");
}
break;
case PROC_EVENT_EXIT:
proc_stats_account(proc_ev->event_data.exit.process_pid, STAT_EXIT);
if (!(opt_flags & OPT_QUIET) && (opt_flags & OPT_EV_EXIT)) {
info1 = proc_info_get(proc_ev->event_data.exit.process_pid);
if (info1->start.tv_sec) {
double d1, d2;
if (gettimeofday(&tv, NULL) < 0) {
memset(&tv, 0, sizeof tv);
}
d1 = timeval_to_double(&info1->start);
d2 = timeval_to_double(&tv);
snprintf(duration, sizeof(duration), "%8.3f", d2 - d1);
} else {
snprintf(duration, sizeof(duration), "unknown");
}
row_increment();
printf("%s exit %*d %5d %8s %s%s%s\n",
when,
pid_size, proc_ev->event_data.exit.process_pid,
proc_ev->event_data.exit.exit_code,
duration,
info1->kernel_thread ? "[" : "",
info1->cmdline,
info1->kernel_thread ? "]" : "");
}
proc_info_free(proc_ev->event_data.exit.process_pid);
break;
#endif
#if LINUX_VERSION_CODE >= KERNEL_VERSION(3,9,0)
case PROC_EVENT_COREDUMP:
proc_stats_account(proc_ev->event_data.coredump.process_pid, STAT_CORE);
if (!(opt_flags & OPT_QUIET) && (opt_flags & OPT_EV_CORE)) {
info1 = proc_info_get(proc_ev->event_data.coredump.process_pid);
row_increment();
printf("%s core %*d %8s %s%s%s\n",
when,
pid_size, proc_ev->event_data.exit.process_pid,
"",
info1->kernel_thread ? "[" : "",
info1->cmdline,
info1->kernel_thread ? "]" : "");
}
break;
#endif
#if LINUX_VERSION_CODE >= KERNEL_VERSION(3,1,0)
case PROC_EVENT_COMM:
proc_stats_account(proc_ev->event_data.comm.process_pid, STAT_COMM);
if (!(opt_flags & OPT_QUIET) && (opt_flags & OPT_EV_COMM)) {
info1 = proc_info_get(proc_ev->event_data.comm.process_pid);
comm = proc_comm(proc_ev->event_data.comm.process_pid);
if (comm == NULL)
break;
row_increment();
printf("%s comm %*d %8s %s%s%s -> %s\n",
when,
pid_size, proc_ev->event_data.exit.process_pid,
"",
info1->kernel_thread ? "[" : "",
info1->cmdline,
info1->kernel_thread ? "]" : "",
comm);
free(comm);
}
break;
#endif
default:
break;
}
}
}
return 0;
}
/*
* show_help()
* simple help
*/
static void show_help(char *const argv[])
{
printf("%s, version %s\n\n", APP_NAME, VERSION);
printf("usage: %s [-d|-D|-e|-h|-s|-S|-q]\n", argv[0]);
printf("-d\tstrip off directory path from process name.\n");
printf("-D\tspecify run duration in seconds.\n");
printf("-e\tselect which events to monitor.\n");
printf("-h\tshow this help.\n");
printf("-s\tshow short process name.\n");
printf("-S\tshow event statistics at end of the run.\n");
printf("-q\trun quietly and enable -S option.\n");
}
/*
* parse_ev()
* parse event strings, turn into flag mask
*/
static int parse_ev(char *arg)
{
char *str, *token;
for (str = arg; (token = strtok(str, ",")) != NULL; str = NULL) {
size_t i;
bool found = false;
for (i = 0; ev_map[i].event; i++) {
if (!strcmp(token, ev_map[i].event)) {
opt_flags |= ev_map[i].flag;
found = true;
}
}
if (!found) {
fprintf(stderr, "Unknown event '%s'.\n", token);
return -1;
}
}
return 0;
}
int main(int argc, char * const argv[])
{
size_t i;
int sock = -1, ret = EXIT_FAILURE;
struct sigaction new_action;
for (;;) {
int c = getopt(argc, argv, "dD:e:hsSq");
if (c == -1)
break;
switch (c) {
case 'd':
opt_flags |= OPT_CMD_DIRNAME_STRIP;
break;
case 'D':
opt_duration = strtol(optarg, NULL, 10);
if (opt_duration <= 0) {
fprintf(stderr, "Illegal duration.\n");
exit(EXIT_FAILURE);
}
break;
case 'e':
if (parse_ev(optarg) < 0)
exit(EXIT_FAILURE);
break;
case 'h':
show_help(argv);
exit(EXIT_SUCCESS);
case 's':
opt_flags &= ~OPT_CMD_LONG;
opt_flags |= OPT_CMD_SHORT;
break;
case 'S':
opt_flags |= OPT_STATS;
break;
case 'q':
opt_flags |= OPT_QUIET;
break;
default:
show_help(argv);
exit(EXIT_FAILURE);
}
}
if ((opt_flags & OPT_EV_MASK) == 0)
opt_flags |= (OPT_EV_FORK | OPT_EV_EXEC | OPT_EV_EXIT | OPT_EV_CLNE);
if (geteuid() != 0) {
fprintf(stderr, "Need to run with root access.\n");
goto abort_sock;
}
memset(&new_action, 0, sizeof(new_action));
for (i = 0; signals[i] != -1; i++) {
new_action.sa_handler = handle_sig;
sigemptyset(&new_action.sa_mask);
new_action.sa_flags = 0;
if (sigaction(signals[i], &new_action, NULL) < 0) {
fprintf(stderr, "sigaction failed: errno=%d (%s)\n",
errno, strerror(errno));
goto abort_sock;
}
}
sane_procs = sane_proc_pid_info();
if (proc_info_load() < 0) {
fprintf(stderr, "Cannot load process cache. Is /proc mounted?\n");
goto abort_sock;
}
sock = netlink_connect();
if (sock == -EPROTONOSUPPORT) {
fprintf(stderr, "Cannot show process activity with this kernel, netlink required.\n");
goto abort_sock;
}
/* Handle other failures */
if (sock < 0)
goto abort_sock;
if (netlink_listen(sock) < 0) {
fprintf(stderr, "netlink listen failed: errno=%d (%s)\n",
errno, strerror(errno));
goto close_abort;
}
if (opt_duration > 0)
alarm(opt_duration);
if (monitor(sock) == 0) {
ret = EXIT_SUCCESS;
proc_stats_report();
}
close_abort:
(void)close(sock);
abort_sock:
proc_info_unload();
proc_stats_free();
exit(ret);
}
forkstat-0.01.17/Makefile 0000644 0001750 0001750 00000003433 13074175331 013626 0 ustar king king #
# Copyright (C) 2014-2017 Canonical, Ltd.
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; either version 2
# of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
#
VERSION=0.01.17
#
# Version "Frantic Forking Finder"
#
CFLAGS += -Wall -Wextra -DVERSION='"$(VERSION)"' -O2
#
# Pedantic flags
#
ifeq ($(PEDANTIC),1)
CFLAGS += -Wabi -Wcast-qual -Wfloat-equal -Wmissing-declarations \
-Wmissing-format-attribute -Wno-long-long -Wpacked \
-Wredundant-decls -Wshadow -Wno-missing-field-initializers \
-Wno-missing-braces -Wno-sign-compare -Wno-multichar
endif
export DEB_BUILD_HARDENING=1
BINDIR=/usr/bin
MANDIR=/usr/share/man/man8
forkstat: forkstat.o
$(CC) $(CPPFLAGS) $(CFLAGS) $< -o $@ $(LDFLAGS)
forkstat.8.gz: forkstat.8
gzip -c $< > $@
dist:
rm -rf forkstat-$(VERSION)
mkdir forkstat-$(VERSION)
cp -rp Makefile forkstat.c forkstat.8 mascot COPYING \
snapcraft forkstat-$(VERSION)
tar -zcf forkstat-$(VERSION).tar.gz forkstat-$(VERSION)
rm -rf forkstat-$(VERSION)
clean:
rm -f forkstat forkstat.o forkstat.8.gz
rm -f forkstat-$(VERSION).tar.gz
install: forkstat forkstat.8.gz
mkdir -p ${DESTDIR}${BINDIR}
cp forkstat ${DESTDIR}${BINDIR}
mkdir -p ${DESTDIR}${MANDIR}
cp forkstat.8.gz ${DESTDIR}${MANDIR}
forkstat-0.01.17/forkstat.8 0000644 0001750 0001750 00000006305 13074175331 014115 0 ustar king king .\" Hey, EMACS: -*- nroff -*-
.\" First parameter, NAME, should be all caps
.\" Second parameter, SECTION, should be 1-8, maybe w/ subsection
.\" other parameters are allowed: see man(7), man(1)
.TH FORKSTAT 8 "14 April, 2017"
.\" Please adjust this date whenever revising the manpage.
.\"
.\" Some roff macros, for reference:
.\" .nh disable hyphenation
.\" .hy enable hyphenation
.\" .ad l left justify
.\" .ad b justify to both left and right margins
.\" .nf disable filling
.\" .fi enable filling
.\" .br insert line break
.\" .sp insert n+1 empty lines
.\" for manpage-specific macros, see man(7)
.SH NAME
forkstat \- a tool to show process fork/exec/exit activity
.br
.SH SYNOPSIS
.B forkstat
.RI [ \-d ]
.RI [ \-D ]
.RI [ \-e ]
.RI [ \-h ]
.RI [ \-s ]
.RI [ \-S ]
.RI [ \-q ]
.br
.SH DESCRIPTION
Forkstat is a program that logs process fork(), exec(), exit(), coredump and
process name change activity.
It is useful for monitoring system behaviour and to track down rogue processes
that are spawning off processes and potentially abusing the system.
Note that forkstat uses the Linux netlink connector to gather process activity
and this may miss events if the system is overly busy. Netlink connector also requires
root privilege.
Forkstat will display several columns of process related information:
.TS
l lw(5i).
\fBTitle Description\fR
Time When the fork/exec/exit event occurred.
Event Type of event.
PID Process or thread ID.
Info Parent or child if a fork, or exit value.
Duration T{
On exit, the duration the command ran for in seconds.
Process The process name. The name will be in [ ] brackets if it is a kernel thread.
T}
.TE
.SH OPTIONS
forkstat options are as follow:
.TP
.B \-d
strip off the directory path from the process name.
.TP
.B \-D seconds
specify duration in seconds to run forkstat.
.TP
.B \-e
specify events to trace as a comma seperated list. By default the fork, exec and exit
events are traced. Available events are:
.TS
l lw(5i).
\fBEvent Description\fR
fork forks
exec execs
exit exits
core core dumps
comm process name changes in comm field
clone clone (normally on thread creation)
all all the events above
.TE
.TP
.B \-h
show brief help summary.
.TP
.B \-s
show short process name information.
.TP
.B \-S
show event statistics.
.TP
.B \-q
run quietly and enable the \-S option.
.SH EXAMPLES
.LP
Show process activity with short process names and directory base path stripped off:
.RS 8
forkstat \-s \-d
.RE
.LP
Trace forks and core dumps only:
.RS 8
forkstat \-e fork,core
.RE
.LP
Trace all events and print statistics at end:
.RS 8
forkstat \-e all \-S
.RE
.LP
Trace all events for 10 minutes:
.RS 8
forkstat \-e all \-D 600
.RE
.LP
Trace clones for 1 minute:
.RS 8
forkstat \-e clone \-D 60
.RE
.SH SEE ALSO
.BR vmstat (8)
.SH AUTHOR
forkstat was written by Colin King
.PP
This manual page was written by Colin King ,
for the Ubuntu project (but may be used by others).
.SH COPYRIGHT
Copyright \(co 2014-2017 Canonical Ltd.
.br
This is free software; see the source for copying conditions. There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
forkstat-0.01.17/snapcraft/ 0000755 0001750 0001750 00000000000 13074175331 014144 5 ustar king king forkstat-0.01.17/snapcraft/snapcraft.yaml 0000644 0001750 0001750 00000001060 13074175331 017006 0 ustar king king name: forkstat
version: 0.01.16-20161115-107-bf63416
summary: process fork/exec/exit monitoring tool
description: Forkstat monitors process fork(), exec() and exit() activity. It is useful for monitoring system behaviour and to track down rogue processes that are spawning off processes and potentially abusing the system.
confinement: devmode
parts:
forkstat:
plugin: make
source: git://kernel.ubuntu.com/cking/forkstat
build-packages:
- gcc
- make
apps:
forkstat:
command: usr/bin/forkstat
forkstat-0.01.17/snapcraft/Makefile 0000644 0001750 0001750 00000001270 13074175331 015604 0 ustar king king VERSION=$(shell git tag | tail -1 | cut -c2-)
COMMITS=$(shell git log --oneline | wc -l)
SHA=$(shell git log -1 --oneline | cut -d' ' -f1)
DATE=$(shell date +'%Y%m%d')
V=$(VERSION)-$(DATE)-$(COMMITS)-$(SHA)
all: get_icon set_version
snapcraft
set_version:
cat snapcraft.yaml | sed 's/version: .*/version: $(V)/' > snapcraft-tmp.yaml
mv snapcraft-tmp.yaml snapcraft.yaml
get_icon:
@if [ ! -e setup/gui/icon.svg ]; \
then \
echo copying icon.svg; \
mkdir -p setup/gui; \
cp ../mascot/forkstat.svg setup/gui/icon.svg; \
fi;
clean:
rm -rf setup *.snap
snapcraft clean
cat snapcraft.yaml | sed 's/version: .*/version: 0/' > snapcraft-tmp.yaml
mv snapcraft-tmp.yaml snapcraft.yaml
forkstat-0.01.17/COPYING 0000644 0001750 0001750 00000043254 13074175331 013226 0 ustar king king GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Lesser General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License.