作者热门文章
- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
我一直在使用 gprof 来尝试使我的 C 程序更快。目前,它的计时时间约为 3 秒,但这就是 gprof 给我的结果:
Flat profile:
Each sample counts as 0.01 seconds.
% cumulative self self total
time seconds seconds calls ms/call ms/call name
100.40 0.01 0.01 3842 0.00 0.00 insertObject
0.00 0.01 0.00 146307 0.00 0.00 getBits
0.00 0.01 0.00 1 0.00 0.00 initialize
0.00 0.01 0.00 1 0.00 10.04 lzw_decode
% 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.
Copyright (C) 2012 Free Software Foundation, Inc.
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
Call graph (explanation follows)
granularity: each sample hit covers 2 byte(s) for 99.60% of 0.01 seconds
index % time self children called name
0.01 0.00 3842/3842 lzw_decode [2]
[1] 100.0 0.01 0.00 3842 insertObject [1]
-----------------------------------------------
0.00 0.01 1/1 main [3]
[2] 100.0 0.00 0.01 1 lzw_decode [2]
0.01 0.00 3842/3842 insertObject [1]
0.00 0.00 146307/146307 getBits [4]
0.00 0.00 1/1 initialize [5]
-----------------------------------------------
<spontaneous>
[3] 100.0 0.00 0.01 main [3]
0.00 0.01 1/1 lzw_decode [2]
-----------------------------------------------
0.00 0.00 146307/146307 lzw_decode [2]
[4] 0.0 0.00 0.00 146307 getBits [4]
-----------------------------------------------
0.00 0.00 1/1 lzw_decode [2]
[5] 0.0 0.00 0.00 1 initialize [5]
-----------------------------------------------
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 is 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
`<spontaneous>' is printed in the `name' field, and all the other
fields are blank.
For the function's children, the fields have the following meanings:
self This is the amount of time that was propagated directly
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
the cycle.
Copyright (C) 2012 Free Software Foundation, Inc.
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
Index by function name
[4] getBits [1] insertObject
[5] initialize [2] lzw_decode
gprof 似乎以前对我有用,所以我不确定发生了什么。这是我的 makefile:
CC = gcc
CFLAGS = -g3 -std=c99 -pedantic -Wall -g -pg
HWK = /c/cs323/Hwk2/
objects = code1.o lzw.o
lzw: lzw.o
${CC} ${CFLAGS} -o lzw lzw.o
encode: lzw.o
${CC} ${CFLAGS} -o encode lzw.o
decode: lzw.o
${CC} ${CFLAGS} -o decode lzw.o
lzw.o: lzw.c ${HWK}code1.c
${CC} ${CFLAGS} -c lzw.c ${HWK}code1.c
这是插入对象:
void insertObject (int pref, int ch)
{
struct node x;
if (ch < 0)
{
ch=4096-ch;
}
x.chr=ch;
x.pref=pref;
int i;
i = 256;
while ((i<4096)&&(hashtable[i].chr!=(0)))
{
i++;
}
hashtable[i]=x;
}
最佳答案
如果您阅读了 gprof 文档 here ,您就会知道它如何真正描述执行时间。再说一遍,我并不是说这可能都是错误的,但很有可能它显示的是正确的时间
我知道一开始这可能看起来很困惑,我所能建议的就是使用其他分析器。有很多选择
关于c - gprof profiler 说我的 C 程序花费的时间比实际少得多,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/27033262/
地 block 输出: time=3220706 mem_heap_B=393242041 mem_heap_extra_B=73912175 mem_stacks_B=93616 heap_tree
我是一名优秀的程序员,十分优秀!