-n

Name of the program file to profile.

-p

Generate PNG graphic and store it in file.

-d

Generate binary data file and store it in file.

-u

Do not buffer output.

-b

Collect size entries before writing them out.

--no-timer

Disable timer-based (SIGPROF) sampling of stack pointer value.

-m

Also trace mmap(2), mremap(2), and munmap(2).

-?

Print help and exit.

--usage

Print a short usage message and exit.

-V

Print version information and exit.The following options apply only when generating graphical output:

-t

Use time (rather than number of function calls) as the scale for the X axis.

-T

Also draw a graph of total memory use.

--title

Use name as the title of the graph.

-x

Make the graph size pixels wide.

-y

Make the graph size pixels high.EXIT STATUSExit status is equal to the exit status of profiled program.BUGSTo report bugs, see ⟨http://www.gnu.org/software/libc/bugs.html⟩EXAMPLEBelow is a simple program that reallocates a block of memory in cycles that rise to a peak before then cyclically reallocating thememory in smaller blocks that return to zero. After compiling the program and running the following commands, a graph of the memoryusage of the program can be found in the file memusage.png:$ memusage --data=memusage.dat ./a.out...Memory usage summary: heap total: 45200, heap peak: 6440, stack peak: 224total calls total memory failed callsmalloc| 1 400 0realloc| 40 44800 0 (nomove:40, dec:19, free:0)calloc| 0 0 0free| 1 440Histogram for block sizes:192-207 1 2% ================...2192-2207 1 2% ================2240-2255 2 4% =================================2832-2847 2 4% =================================3440-3455 2 4% =================================4032-4047 2 4% =================================4640-4655 2 4% =================================5232-5247 2 4% =================================5840-5855 2 4% =================================6432-6447 1 2% ================$ memusagestat memusage.dat memusage.pngProgram source#include <stdio.h>#include <stdlib.h>#define CYCLES 20intmain(int argc, char *argv[]){int i, j;int *p;printf("malloc: %zd\n", sizeof(int) * 100);p = malloc(sizeof(int) * 100);for (i = 0; i < CYCLES; i++) {if (i < CYCLES / 2)j = i;else

--;

printf("realloc: %zd\n", sizeof(int) * (j * 50 + 110));p = realloc(p, sizeof(int) * (j * 50 + 100));printf("realloc: %zd\n", sizeof(int) * ((j+1) * 150 + 110));p = realloc(p, sizeof(int) * ((j + 1) * 150 + 110));}free(p);exit(EXIT_SUCCESS);}