mirror of
https://github.com/Zenithsiz/ftmemsim-valgrind.git
synced 2026-02-09 05:10:23 +00:00
0954cfc526
ANSIfication of the hp2ps code. The most important changes are the correct use of the stdarg mechanism (former hacks could bite on other systems, so please tell upstream), inclusion of stdlib.h instead of declaring free yourself, adding a few missed PROTO()s and using size_t for xmalloc and xrealloc.: git-svn-id: svn://svn.valgrind.org/valgrind/trunk@2399
67 lines
1.6 KiB
C
67 lines
1.6 KiB
C
/* This file is part of hp2ps, a graph drawer for memory profiles.
|
|
Copyright (C) 2002 The University Court of the University of Glasgow.
|
|
This program is governed by the license contained in the file LICENSE. */
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "Main.h"
|
|
#include "Defines.h"
|
|
#include "Error.h"
|
|
#include "HpFile.h"
|
|
#include "Utilities.h"
|
|
|
|
/* own stuff */
|
|
#include "AreaBelow.h"
|
|
|
|
/*
|
|
* Return the area enclosed by all of the curves. The algorithm
|
|
* used is the same as the trapizoidal rule for integration.
|
|
*/
|
|
|
|
floatish
|
|
AreaBelow()
|
|
{
|
|
intish i;
|
|
intish j;
|
|
intish bucket;
|
|
floatish value;
|
|
struct chunk *ch;
|
|
floatish area;
|
|
floatish trap;
|
|
floatish base;
|
|
floatish *maxima;
|
|
|
|
maxima = (floatish *) xmalloc(nsamples * sizeof(floatish));
|
|
for (i = 0; i < nsamples; i++) {
|
|
maxima[i] = 0.0;
|
|
}
|
|
|
|
for (i = 0; i < nidents; i++) {
|
|
for (ch = identtable[i]->chk; ch; ch = ch->next) {
|
|
for (j = 0; j < ch->nd; j++) {
|
|
bucket = ch->d[j].bucket;
|
|
value = ch->d[j].value;
|
|
if (bucket >= nsamples)
|
|
Disaster("bucket out of range");
|
|
maxima[ bucket ] += value;
|
|
}
|
|
}
|
|
}
|
|
|
|
area = 0.0;
|
|
|
|
for (i = 1; i < nsamples; i++) {
|
|
base = samplemap[i] - samplemap[i-1];
|
|
if (maxima[i] > maxima[i-1]) {
|
|
trap = base * maxima[i-1] + ((base * (maxima[i] - maxima[i-1]))/ 2.0);
|
|
} else {
|
|
trap = base * maxima[i] + ((base * (maxima[i-1] - maxima[i]))/ 2.0);
|
|
}
|
|
|
|
area += trap;
|
|
}
|
|
|
|
free(maxima);
|
|
return area;
|
|
}
|