Sponsored Content
Full Discussion: semaphore access speed
Top Forums Programming semaphore access speed Post 302238358 by migurus on Friday 19th of September 2008 05:01:24 PM
Old 09-19-2008
Jim,
I never tried profiling before, so I ran into some problem here:
$ gcc -pg -o tstloop tstloop.c
$ tstloop
128205.13 semop/s [0,0]
$ gprof tstloop
gprof: gmon.out file is missing call-graph data

Any ideas?

As far as use of time vs. gettimeofday (which, in fact I did use) is quite irrelevant, I am trying to see how many times per second system is capable of creating a process which would simply read a semaphore.

Thanks.
 

9 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

semaphore

hi, is there any command where we can monitor semaphores? (1 Reply)
Discussion started by: yls177
1 Replies

2. UNIX for Dummies Questions & Answers

Semaphore

Hi, I'm new to UNIX. I need to know what's a semaphore Do reply. Thanks VJ (3 Replies)
Discussion started by: vjsony
3 Replies

3. Filesystems, Disks and Memory

dmidecode, RAM speed = "Current Speed: Unknown"

Hello, I have a Supermicro server with a P4SCI mother board running Debian Sarge 3.1. This is the "dmidecode" output related to RAM info: RAM speed information is incomplete.. "Current Speed: Unknown", is there anyway/soft to get the speed of installed RAM modules? thanks!! Regards :)... (0 Replies)
Discussion started by: Santi
0 Replies

4. Shell Programming and Scripting

Semaphore

Hi, I am looking to use a semaphore for the first time in one of my scripts. I am just wondering if there are any simple examples or tutorials around? I am a beginner so the simpler the better :) Thanks -Jaken (2 Replies)
Discussion started by: Jaken
2 Replies

5. UNIX for Dummies Questions & Answers

semaphore

what is semaphore? can any body explain it in a more simple way than the manual ?? replies appreciated Regards raguram R (7 Replies)
Discussion started by: raguramtgr
7 Replies

6. Filesystems, Disks and Memory

data from blktrace: read speed V.S. write speed

I analysed disk performance with blktrace and get some data: read: 8,3 4 2141 2.882115217 3342 Q R 195732187 + 32 8,3 4 2142 2.882116411 3342 G R 195732187 + 32 8,3 4 2144 2.882117647 3342 I R 195732187 + 32 8,3 4 2145 ... (1 Reply)
Discussion started by: W.C.C
1 Replies

7. Shell Programming and Scripting

semaphore

Control two exclusively shared resources(semaphore). The two resources are two files. The producer will write even numbers to one file, and odd numbers to another one. The consumer respectively reads from each file until it gets 5 even numbers and 5 odd numbers. Can any one help me with the... (0 Replies)
Discussion started by: gokult
0 Replies

8. Programming

Semaphore

If I create a semaphore and then I fork a number of child processes then all the child process use that same semaphore. Since the process address spaces are different rfom each other then how all the child process are able to access the same semaphore? I understand that semaphore/mutex is at os... (0 Replies)
Discussion started by: rupeshkp728
0 Replies

9. UNIX for Beginners Questions & Answers

Semaphore

I was asked to add this piece of code to a c program which I will execute through the shell: for(long i = 0; i < NITER; i++) { sem_wait( &sema); count++; sem_post( &sema); } I didn't get it, which is the critical section ? if it's "count++" how would a thread wake up in order to enter it... (1 Reply)
Discussion started by: uniran
1 Replies
GPROF(1)						      General Commands Manual							  GPROF(1)

NAME
gprof - display call graph profile data SYNOPSIS
gprof [ options ] [ a.out [ gmon.out ... ] ] DESCRIPTION
gprof produces an execution profile of a C, Pascal, or Fortran77 program. The effect of called routines is incorporated in the profile of each caller. The profile data is taken from the call graph profile file (gmon.out by default), which is created by programs compiled with the -pg option of cc, pc, and f77. The symbol table in the named object file (a.out by default) is read and correlated with the call graph profile file. If more than one profile file is specified, the gprof output shows the sum of the profile information in the given profile files. First, a flat profile is given. This listing gives the total execution times and call counts for each of the functions in the program, sorted by decreasing time. Next, these times are propagated along the edges of the call graph. Cycles are discovered, and calls into a cycle are made to share the time of the cycle. A second listing shows the functions sorted according to the time they represent including the time of their call graph descendents. Below each function entry is shown its (direct) call graph children, and how their times are propagated to this function. A similar display above the function shows how this function's time and the time of its descendents is propagated to its (direct) call graph parents. Cycles are also shown, with an entry for the cycle as a whole as well as a listing of the members of the cycle and their contributions to the time and call counts of the cycle. FAT FILE SUPPORT
gprof accepts a ``fat'' file for the a.out file, using the host architecture from the file. (It is an error if the ``fat'' file does not contain the host architecture.) OPTIONS
The following options are available: -a suppresses the displaying of statically declared functions. If this option is given, all relevant information about the static function (such as time samples, calls to other functions, calls from other functions) belongs to the function loaded just before the static function in the a.out file. -b suppresses the displaying of a description of each field in the profile. -c the static call graph of the program is discovered by a heuristic which examines the text space of the object file. Static-only parents or children are indicated with call counts of 0. (The -c option is currently not supported.) -e name suppresses the displaying of the graph profile entry for routine name and all its descendants (unless they have other ancestors that aren't suppressed). More than one -e option may be given. Only one name may be given with each -e option. -E name suppresses the displaying of the graph profile entry for routine name (and its descendants) as -e, above, and also excludes the time spent in name (and its descendants) from the total and percentage time computations. (For example, -E mcount and all of the other monitor(3) routines are excluded by default.) -f name displays the graph profile entry of only the specified routine name and its descendants. More than one -f option may be given. Only one name may be given with each -f option. -F name displays the graph profile entry of only the routine name and its descendants (as -f, above) and also uses only the times of the displayed routines in total time and percentage computations. More than one -F option may be given. Only one name may be given with each -F option. The -F option overrides the -E option. -s a profile file gmon.sum is produced which represents the sum of the profile information in all the specified profile files. This summary profile file may be given to subsequent executions of gprof (probably also with a -s) to accumulate profile data across sev- eral runs of an a.out file. -S produces four order files suitable as input to ld(1): gmon.order is an ordering based on a closest is best algorithm, callf.order is based on call frequency, callo.order is based on call order and time.order is based on time. The order files contain only those functions which were called or sampled (including spontaneous functions). For library functions to appear correctly in the order file, a whatsloaded file produced by ld(1) should exist in the working directory. Filenames in the order file will be missing for: files compiled without the -g option, assembly files, and stripped executables. This option does not work with executables that have already been scattered. The gmon.order file can take a long time to produce and can be suppressed with the -x option. -z displays routines which have zero usage (as indicated by call counts and accumulated time). This is useful in conjunction with the -c option for discovering which routines were never called. FILES
a.out the namelist and text space. gmon.out dynamic call graph and profile. gmon.sum summarized dynamic call graph and profile. gmon.order ordering based on closest is best algorithm. callf.order ordering based on call frequency. callo.order ordering based on call order. time.order ordering based on time. SEE ALSO
monitor(3), profil(2), cc(1) dyld(1) and the DYLD_IMAGE_SUFFIX environment variable ``gprof: A Call Graph Execution Profiler'', by Graham, S.L., Kessler, P.B., McKusick, M.K.; Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, SIGPLAN Notices, Vol. 17, No. 6, pp. 120-126, June 1982. BUGS
Beware of quantization errors. The granularity of the sampling is shown, but remains statistical at best. We assume that the time for each execution of a function can be expressed by the total time for the function divided by the number of times the function is called. Thus the time propagated along the call graph arcs to parents of that function is directly proportional to the number of times that arc is traversed. Parents which are not themselves profiled will have the time of their profiled children propagated to them, but they will appear to be spontaneously invoked in the call graph listing, and will not have their time propagated further. Similarly, signal catchers, even though profiled, will appear to be spontaneous (although for more obscure reasons). Any profiled children of signal catchers should have their times propagated properly, unless the signal catcher was invoked during the execution of the profiling routine, in which case all is lost. The profiled program must call exit(2) or return normally for the profiling information to be saved in the gmon.out file. Apple Computer, Inc. November 25, 2002 GPROF(1)
All times are GMT -4. The time now is 08:08 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy