tǃǃCx܋ݓwwxt_ h.T$(dh.05w5ws|sxh$/ MԃmE}{C"݁zt BxAxZxu݂Jxݚi{{9vEUMȋ4݆zMYy9݃z9t=;j;WW5whT/%;QQ5whT/mO]C1RP,$1RQ,$Ox[ RQ,$܏SC U݆ݞ܎݆ݞC ܎[ C܎[9tE܀ݘ܀ݘxth hr/<$a wEpw|wxh/h/4$a uuh/UR U}8EM; { uN{{$(1҃i{B;{r{i{DA{9vh̫j{PSZ1҃ B{{9r؍e[^_]UVSEE 0݃܃݆܆wZw\Ku uLVu u5t8t-9_t:_u(:_uF9CwrU M[^]ظ[^]UWVS]xtE pUrSh/PPu uƃt#xtWSph/^ j(E ljUEM HX9tw{;wuSu www P5E {{}$%E죈{{{M @{u}G U Ge[^_]UWVS uxt$ h04$^$K~Bҡw@ww9rI 99t9}M}QQ5wh 0RuPh60:t S^ h,$ ߋE;wukx h^04$]E e[^_]xt$ hl0<$]$ ]uċ9t-xt$ h0k4$?]$ UBUUwU9x h0$\$04$\$ Qxt< h0X\$04$v\CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstu$ Nu"9t PP5wh0$W5EEE;wbwWWP5w.www4ЉTdžxt$SSRh04$[$  s[ uxt)QQ5wh 14$i[$ A9uRwDwxt* h1K$[XZ5wh411uxt hJ1 w)wExe[^_]UEE @9Bwȉ]UEE @9Bȉ]UWVSypt8yt,{tu&1GƋFpu@ʋItu9|84ypu{ytuu1FNjGpu1B؋Xtu9|CpE̅t ދFptދFttypt ȋPptȋPtt9u9uU uM4@\}tuRKtYpUMȋ:{ttytu5KpYtuUȋytuUȋtKtYpKpYt@$EM9M61HUȋCu9@@u0{pu{tt$CttK s[puF;ur1ۃ}u03MȋQu@@uQ qC;]r͍e[^_]UWVS(E{PwNj{5{1҃ @t A@uA$B9rQQEPW1ɉډ1ۃ%i{B<u rC;{rh:j 5{5{tE11u{Eܡ{E{1>RR{t8StJCtPPEpst F;ur;uu EpK{\8E؃ E;{ie[^_]UE @E E@E]UE @E E@E]UWVShEE{PE{$E{$E{$E{$Eġ{$tE1EESi{Ѓxu]̋uC]̡{L&}ȋUG}Ȁ`@p@t@A; {rẖj5{5{y111{ A1A$C;{rE11d{UЋEԋ@1SQ,$yt5]EWV,$yt5]E5wUԋB@EЋE;{rM}uhjuuPE111pU yu 11;Bt E}ĉ@EB$R uދ;Bt E}ĉ@EB$RuހIC9r떋EċJAt@tEFa`C;]r1U@t p;C9rẖjVu_X]SuEY^Su1ɋ{{XZUEPuĹE1ۃu@u pC;]r1 }pC;]r {PE{$E{$nE{$[ǡ{$Iơ{$7Xu 5{JE"Uu 5{&E1e[^]UWVSdho5u訲u wEPPhMu8Eujj]SʱHtPuh85wа_jx xt" Vjh9StQjh9S {PEPR(wwE11ۍ} Pu5{h/9E<t!r<uL0E wRRuu,F wPPuuC wPPuuj Pu5{hY9ujjW蚰Hvt wPjjuƯPPEPu~PPEPuePPEPu<LWWEPu#3}yuVVVEPu={u Eܣww;EtSuh9\ t5(,= xuu5{h 9. tHt1QjSu軮y u蹭U)ډUU{t%E;uE;BuM;JtyRuh9M{ j蔬ƣ{UĉEȉFMN)1RP,$1RQ,${ SQF {x 1x@t)uuuh9Q uuh:>}x {;Bvu5{hD:1}E1iujjEP%Ht( uGP5{h|:5wH{X 3 {@URP4G;}r1}%Suuh:FPSuuPPMQuuTPPWuuB&tHu6PPEPuyu]UЋEu]=wuB\ wu4wPP5wh:1ۃP5{h8,1ۋE;wt PQx P5wuh:}6;}t;WWuP_d;tL;QQVPD;t{;RRSP)@rx@xe[^_]UubUVSÉR5{h;P'uPh>h>S V#L$qUWVSQϋA{P蝪^XGPWB1AV$Bxwt SSjPw$ x'xPPj5w#PPjPPj5w#PPjPPjSSj1ҡu x QQ5whwt QQjP?" x&wtRRjP " x%x=wtyPPj/S_tPPjYPPjS x@@ x΀w{wt-PPj/S tPPjPPjS! x%x xw$x=x|SSPh?J 5wr(rL(r=x.QQh)?h=?賥$K?g$?[$W 5w0r0rw8x8rwtRRj PT x%xt4rwta Pnu(5w5{h?5w$O Pv4rw jhrh@w7蝤 %=uS5{hK@xt x h@rtQQPhٞv X-؃\$\$$h1F<ٞv X-؃\$\$$hDF]6 EKt@Cxw1RQ,$݃\$$QhVF h/h/h/hjFΘ=xt S SB$ bF;5{? uc=Xt4R t{@8HPPRS萋1]UWVS5Hx$xtPPvhzJ耈WWj/vÅt@{F VFfxF(JtPSSRhJF$t QQPhR7F,tRRPhJ j*訇~ t\JtPPPRhJt WWPhR7tSSPhJ蒇 j*F j 965{eHxSCBtkK {CjY{ t&tjLxhZu;5{r{/t& iP諆CiЉC h|uɡLxt2 iPqPxiLxУTxLx5{aSCXtkK {CjX{ t&*tjLx~Xu;5{Hxr wxG|KE؋CE܋EKuJC EJt@EFEEVuJF EJt@EPPuuuQuuuRuhJQ0PjSV[pRvpxtWWuhO}~Åt a@E<`xt+SSPh.O5}ZYPhCO!} u uPjh$yWt.t=tVV5whZOq14G) {@RP8 {@RP,U4 VCthSSVh{ÃtRxt-QQVhzOD|XZshO5|ZY3hO'|93uPjSuExt hO|EM9Me[^_]Uƒ$O1y1h1W1F1 51 $1 1 1]U$PMMMMzMsMlNeN^3NWANPXNIjNBN;N4N-N&NNNN {OUVS1ۍmw$hP C@{[^]UWVS ] =yu8y hyzz?zyxtuSEphKy]{u+p5{>xtWWuhP]y~Åt a@E<`xt+SSPh.O yZYPhCOx u uPjhyWt.t=tVV5whZOI|14G) {@RP8 {@RP,U4 VthSSVh{ÃtRxt-QQVhzOxXZshO xZY3hOw93uPjSu躔Ext hOxEM9Me[^_]UWVS ] xtuSEphW/vXZSh{W"vYXSj huXZShW vYXShWuXZSj DuYXShXuXZShJXuYXSj uXZShbXuYXShXuXZSj tYXShUuXZShXuYXSj tXZSj tYXSj tXZShXguYXSj tXZShYPuYXShSYCuXZSj tYXShY,uXZShYuYXShYuXZShZuYXSj KtXZShZtYXShPZtXZShZtYXShZtXZSj tYXShZtXZSh[tYXShP[tXZSj sYXShu[tXZSh[rtYXSj sXZSh[[tYXSh\NtXZSj sYXSj sXZSj sYXShJ\#tXZSj isYXShh\ tXZSh\sYXSj EsXZSh\sYXSh\sXZSh(]sYXSh]]sXZSj sYXShr]sXZSh]sYXSh]sXZSj rYXSh^ysXZShL^lsYXSh^_sXZSj rYXSh^HsXZSh^;sYXSj rXZSh _$sYXShG_sXZSj ]rYXSj SrXZSj IrYXShl_rXZSh_rYXSh_rXZSh`rYXShU`rXZSh`rYXSj qXZSh`rYXSh`rXZSj qYXSj qXZSj qYXSha\rXZSh)aOrYXShaaBrXZSha5rYXSha(rXZShHr]ÐUS ]Sj NqYXShbqXZShVbqYXSj *qXZShbqYXShbqXZSh&cqYXShicqXZShcqYXShcqXZShcqYXSh"drqXZSh`deqYXSj pXZShdNqYXShdAqXZShe4qYXShXe'qXZSj mpYXSheqXZSj VpYXShepXZSh fpYXSj 2pXZSh(fpYXShjfpXZShfpYXShfpXZSj oYXShgpXZShJgpYXShg}pXZShgppYXSj oXZSj oYXShgOpXZSj oYXSh"h8pXZSheh+pYXSj qoXZShhpYXShhpXZSj MoYXShhoXZSh%s:%d: (%s:0x%lx) %lu executions %s: %s: unexpected end of file [bb_read_rec] 0x%lx->0x%lx (%s:%d) cnt=%lu %s: warning: ignoring basic-block exec counts (use -l or --line) B[cg_write_arcs] frompc 0x%lx selfpc 0x%lx count %lu [cg_tally] arc from %s to %s traversed %lu times [cg_read_rec] frompc 0x%lx selfpc 0x%lx count %lu [arc_lookup] parent == 0 || child == 0[arc_lookup] parent %s child %s [arc_lookup] parent %s child %s [cycle_link] is the head of cycle %d [cg_assemble] topological sort listing[cg_assemble] [prop_flags] inherits print-flag %d and prop-fract %f ends up with printflag %d and prop-fract %f [prop_flags] time %f propself %f print_time %f [propagate] toporder botches [prop_time] child with %f %f %lu/%lu [prop_time] parent [prop_time] share %f [arc_add] %lu arcs from %s to %s [tally] hit %lu += %lu [dfn] dfn( [find_cycle] couldn't find head of cycle [find_cycle] dfn_depth %d cycle_top %d [find_cycle] [find_cycle] tail [find_cycle] new cyclehead [find_cycle] glomming onto [find_cycle] and its tail [find_cycle] glommed, but not to head [pre_visit] %d:[post_visit] %d: [post_visit] member -> cg.top_order = %d [post_visit] is part of a cycle%-6.6s %5.1f %7.2f %7.2f %7lu%-6.6s %5.1f %7.2f %11.2f %7lu+%-7lu %7.7s [%d] Index by function name %6.6s %-19.19s %s (%s)%6.6s [cmp_arc] calls %f + %f %lu/%lu %-6.6s %5.1f %7.2f %7.2f%-6.6s %5.1f %7.2f %11.2f+%-7lu %7.7s %7.7s Call graph (explanation follows) Call graph granularity: each sample hit covers %ld byte(s) for %.2f%% of %.2f seconds no time propagated parentstotalcalled%6.6s %5.5s %7.7s %11.11s %7.7s/%-7.7s %-8.8s indexnameselfdescendants%time%-6.6s %5.5s %7.7s %11.11s %7.7s+%-7.7s %-8.8s %5.5s childrenindex %% time self children called name %6.6s %5.5s %7.2f %7.2f %7lu%6.6s %5.5s %7.2f %11.2f %7lu%6.6s %5.5s %7.7s %7.7s %7.7s %7.7s %6.6s %5.5s %7.7s %11.11s %7.7s %7.7s %6.6s %5.5s %7.7s %7.7s %7lu %7.7s %6.6s %5.5s %7.7s %11.11s %7lu %7.7s %6.6s %5.5s %7.2f %7.2f %7lu/%-7lu %6.6s %5.5s %7.2f %11.2f %7lu/%-7lu -----------------------------------------------_Gz??[get_src_info] 0x%lx -> %s:%d (%s) [get_src_info] no info for 0x%lx (%s:%d,%s) %s: unable to parse mapping file %s. [core_sym_class] %s: not a function [core_sym_class] %s is of class %c .clone.___gnu_compiled%s: file `%s' has no symbols [core_create_function_syms] rejecting: 0x%lx %s [core_create_function_syms] %ld %s 0x%lx [core_create_line_syms] %lu %s 0x%lx %s: somebody miscounted: ltab.len=%d instead of %ld %s: could not open %s. %s %c %s%s: -c not supported on architecture %s %s: ran out room for %lu bytes of text space bfd_get_section_contents%s: can't do -c %[^ :]No symbols in %[^ ] %s: %s: not in executable format .text$CODE$%s: can't find .text section in %s %s: %s: %s %s: address size has unexpected value of %u w[dumpsum] frompc 0x%lx selfpc 0x%lx count %lu %s: don't know how to deal with file format %d %s: file too short to be a gmon file gmon%s: file `%s' has bad magic cookie %s: file `%s' has unsupported version %d %s: %s: found bad tag %d (file corrupted?) %s: profiling rate incompatible with first gmon file %s: incompatible with first gmon file [gmon_out_read] lowpc 0x%lx highpc 0x%lx ncnt %d [gmon_out_read] samp_bytes %d hist_num_bins %d %s: file '%s' does not appear to be in gmon.out format %s: unexpected EOF after reading %d/%d bins [gmon_out_read] frompc 0x%lx selfpc 0x%lx count %lu time is in ticks, not seconds File `%s' (version %d) contains: %d histogram records %d histogram record %d call-graph records %d call-graph record %d basic-block count records %d basic-block count record Usage: %s [-[abcDhilLsTvwxyz]] [-[ACeEfFJnNOpPqSQZ][name]] [-I dirs] [-d[num]] [-k from/to] [-m min-count] [-t table-length] [--[no-]annotated-source[=name]] [--[no-]exec-counts[=name]] [--[no-]flat-profile[=name]] [--[no-]graph[=name]] [--[no-]time=name] [--all-lines] [--brief] [--debug[=level]] [--function-ordering] [--file-ordering] [--directory-path=dirs] [--display-unused-functions] [--file-format=name] [--file-info] [--help] [--line] [--min-count=n] [--no-static] [--print-path] [--separate-files] [--static-call-graph] [--sum] [--table-length=len] [--traditional] [--version] [--width=n] [--ignore-non-functions] [--demangle[=STYLE]] [--no-demangle] [--external-symbol-table=name] [@FILE] [image-file] [profile-file...] Report bugs to %s [main] debug-level=0x%x %s: unknown file format %s external-symbol-table: %s (GNU Binutils) 2.21GNU gprof %s Based on BSD gprof, copyright 1983 Regents of the University of California.This program is free software. This program has absolutely no warranty.%s: unknown demangling style `%s' aA::bBcC::d::De:E:f:F:hiI:J::k:lLm:n:N:O:p::P::q::Q::rR:sS:t:Tvw:xyzZ::%s: Only one of --function-ordering and --file-ordering may be specified. GPROF_PATH%s: sorry, file format `prof' is not yet supported gmon.sum%s: gmon.out file is missing histogram %s: gmon.out file is missing call-graph data a.outlineno-staticignore-non-functionsexternal-symbol-tableno-annotated-sourceno-flat-profileno-graphno-exec-countsfunction-orderingfile-orderingfile-infoall-linesno-demangledirectory-pathdisplay-unused-functionsmin-countprint-pathseparate-filesstatic-call-graphtable-lengthno-timewidthbriefdebughelpfile-formattraditionalversiongmon.out_gprof_mcount__mcount__mcount_internal__mcleanupDL@d{sg5fu.7IU|d :IX%s: found a symbol that covers several histogram records[scale_and_align_entries] pushing 0x%lx to 0x%lx [assign_samples] bin_low_pc=0x%lx, bin_high_pc=0x%lx, bin_count=%u [assign_samples] [0x%lx,0x%lx) %s gets %f ticks %ld overlap [assign_samples] total_time %f flat profile:Flat profile:%c%c/call for %.2f%% of %.2f %s Each sample counts as %g %s. no time accumulated total self cumulative% %5.5s %10.10s %8.8s %8.8s %8.8s %8.8s %-8.8s %5.5s %9.9s %8.8s %8.8s %8.8s %8.8s %-8.8s %5.1f %10.2f %8.2f%6.2f %9.2f %8.2f %8lu %8.2f %8.2f %8.8s %8.8s %8.8s %s: dimension unit changed between histogram records %s: from '%s' %s: to '%s' %s: dimension abbreviation changed between histogram records %s: from '%c' %s: to '%c' %s: different scales in histogram records%s: overlapping histogram records [hist_read_rec] n_lowpc 0x%lx n_highpc 0x%lx ncnt %u %s: %s: unexpected EOF after reading %u of %u samples [hist_read_rec] 0x%lx: %u T-q=G& .>Mư>KMbP? ?m@@u.AneApmBf4&k CaNgmCzDư>[annotate_source]: looking for %s, trying %s /%s: could not locate `%s' -ann *** File %s: [sym_lookup] %d probes (symtab->len=%u) [sym_lookup] %d (%u) probes, fall off [dbg_sym_lookup] address 0x%lx [dbg_sym_lookup] low=0x%lx, mid=0x%lx, high=0x%lx [dbg_sym_lookup] sym[m]=0x%lx sym[m + 1]=0x%lx [dbg_sym_lookup] binary search fails??? [symtab_finalize] favor %s@%c%c over %s@%c%c (addr=%lx) [symtab_finalize]: removed %d duplicate entries [symtab_finalize] 0x%lx-0x%lx %s [parse_id] %s -> *%d/%s:[sym_id_parse]: arc %s:%s(%lx-%lx) -> %s:%s(%lx-%lx) to %s [sym_id_parse] syms[%s]: INCL_GRAPHEXCL_GRAPHINCL_ARCSEXCL_ARCSINCL_FLATEXCL_FLATINCL_TIMEEXCL_TIMEINCL_ANNOEXCL_ANNOINCL_EXECEXCL_EXECJJK KK K*K4K>KHKRK\K (%s:%d @ %lx){%d} %4.0f%% [%d] (%d)[findcall] %s: 0x%lx to 0x%lx [findcall] 0x%lx:call destpc 0x%lx (%s) [find_call] %s: 0x%lx to 0x%lx _coroutine[find_call] 0x%lx: jsr%s [find_call] 0x%lx: bsr 0x%lx ; name=%s, addr=0x%lxoooo +<M^# d\dddddGGNNUUUUGGNNUUindexedregisterregister deferredautodecrementautoincrementautoincrement deferredbyte displacementbyte displacement deferredbyte relativebyte relative deferredword displacementword displacement deferredword relativeword relative deferredimmediateabsolutelong displacementlong displacement deferredlong relativelong relative deferredliteral[findcall] 0x%lx:calls first operand is %s second operand is %s [reladdr] not relative address [findcall] destpc 0x%lx child->name %s child->addr 0x%lx [findcall] but it's a botch 1BSduK*1#8?oovv}}}}oovv}}[findcall] 0x%lx:callf[find_call] 0x%lx: callf dest_pc=0x%lx, (name=%s, addr=0x%lx) [find_call] 0x%lx: jal[find_call] 0x%lx: jalr % the percentage of the total running time of the time program used by this function. cumulative a running sum of the number of seconds accounted seconds for by this function and those listed above it. self the number of seconds accounted for by this seconds function alone. This is the major sort for this listing. calls the number of times this function was invoked, if this function is profiled, else blank. self the average number of milliseconds spent in this ms/call function per call, if this function is profiled, else blank. total the average number of milliseconds spent in this ms/call function and its descendents per call, if this function is profiled, else blank. name the name of the function. This is the minor sort for this listing. The index shows the location of the function in the gprof listing. If the index is in parenthesis it shows where it would appear in the gprof listing if it were to be printed. call graph profile: The sum of self and descendents is the major sort for this listing. function entries: index the index of the function in the call graph listing, as an aid to locating it (see below). %time the percentage of the total time of the program accounted for by this function and its descendents. self the number of seconds spent in this function itself. descendents the number of seconds spent in the descendents of this function on behalf of this function. called the number of times this function is called (other than recursive calls). self the number of times this function calls itself recursively. name the name of the function, with an indication of its membership in a cycle, if any. listing, as an aid to locating it. parent listings: self* the number of seconds of this function's self time which is due to calls from this parent. descendents* the number of seconds of this function's descendent time which is due to calls from this parent. called** the number of times this function is called by this parent. This is the numerator of the fraction which divides up the function's time to its parents. total* the number of times this function was called by all of its parents. This is the denominator of the propagation fraction. parents the name of this parent, with an indication of the parent's membership in a cycle, if any. index the index of this parent in the call graph listing, as an aid in locating it. children listings: self* the number of seconds of this child's self time which is due to being called by this function. descendent* the number of seconds of this child's descendent's time which is due to being called by this function. called** the number of times this child is called by this function. This is the numerator of the propagation fraction for this child. total* the number of times this child is called by all functions. This is the denominator of the propagation fraction. children the name of this child, and an indication of its membership in a cycle, if any. index the index of this child in the call graph listing, as an aid to locating it. * these fields are omitted for parents (or children) in the same cycle as the function. If the function (or child) is a member of a cycle, the propagated times and propagation denominator represent the self time and descendent time of the cycle as a whole. ** static-only parents and children are indicated by a call count of 0. cycle listings: the cycle as a whole is listed with the same fields as a function entry. Below it are listed the members of the cycle, and their contributions to the time and call counts of the cycle. This table describes the call tree of the program, and was sorted by the total amount of time spent in each function and its children. Each entry in this table consists of several lines. The line with the index number at the left hand margin lists the current function. The lines above it list the functions that called this function, and the lines below it list the functions this one called. This line lists: index A unique number given to each element of the table. Index numbers are sorted numerically. The index number is printed next to every function name so it is easier to look up where the function in the table. % time This is the percentage of the `total' time that was spent in this function and its children. Note that due to different viewpoints, functions excluded by options, etc, these numbers will NOT add up to 100%. self This is the total amount of time spent in this function. children This is the total amount of time propagated into this function by its children. called This is the number of times the function was called. If the function called itself recursively, the number only includes non-recursive calls, and is followed by a `+' and the number of recursive calls. name The name of the current function. The index number is printed after it. If the function is a member of a cycle, the cycle number is printed between the function's name and the index number. For the function's parents, the fields have the following meanings: self This is the amount of time that was propagated directly from the function into this parent. children This is the amount of time that was propagated from the function's children into this parent. called This is the number of times this parent called the function `/' the total number of times the function was called. Recursive calls to the function are not included in the number after the `/'. name This is the name of the parent. The parent's index number is printed after it. If the parent is a member of a cycle, the cycle number is printed between the name and the index number. If the parents of the function cannot be determined, the word `' is printed in the `name' field, and all the other fields are blank. For the function's children, the fields have the following meanings: from the child into the function. children This is the amount of time that was propagated from the child's children to the function. called This is the number of times the function called this child `/' the total number of times the child was called. Recursive calls by the child are not listed in the number after the `/'. name This is the name of the child. The child's index number is printed after it. If the child is a member of a cycle, the cycle number is printed between the name and the index number. If there are any cycles (circles) in the call graph, there is an entry for the cycle-as-a-whole. This entry shows who called the cycle (as parents) and the members of the cycle (as children.) The `+' recursive calls entry shows the number of function calls that were internal to the cycle, and the calls entry for each member shows, for that member, how many times it was called from other members of %s: error: too many @-files encountered out of memory PZ? 0 |+p`  q،@ooopbrҏ"2BRbrҐ"2BRbr‘ґ"2BRbr’Ғ"2BRbr 4AP@(#) Copyright (c) 1983 Regents of the University of California. All rights reserved. :Al?AaIAD^ASwAAtAJApAPHBqAQACAZArARAi@sAxAAAIAzBm"BL-ByYXhaS1XZhS$ hdhS1$?UVSƉӃ=tPh$jLho(xPPhV )=t &"PPhV(t D1tPPjRe[^]UVSơ =Qh@h~h')9 RRRPl9v,ufЍRRP5(5)PjR99s)51Ѝe[^]U1҅t%=t% ‰UuUVS11҅tO5t% ËIt% ؉[^]UVS`ƅuPP3Vt[8udECC;~J53h5<=uVVh¾5<C؍e[^]QQjt1ىр| uVVh{Dž=dpDž1F"uVB t"NV tSjjj_ WPh ߃ =ht$ً[ uv,l.=ht%_1ى򋅨SƋ[u;Pu~ Whhd 4QhQǃt)RRP;:t1ىр| uPhP2ǃbt ~t!1h5< A3h5<TXPPhV5 38xe[^_]ÍL$qUWVSQ(Ia$d