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
101 lines
2.2 KiB
C
101 lines
2.2 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 "HpFile.h"
|
|
#include "Error.h"
|
|
#include "Utilities.h"
|
|
|
|
/* own stuff */
|
|
#include "TraceElement.h"
|
|
|
|
/*
|
|
* Compute the total volume for each identifier, and the grand
|
|
* total of these totals. The identifiers whose totals when
|
|
* added together amount to less that a threshold percentage
|
|
* (default 1%) of the grand total are considered to be ``trace
|
|
* elements'' and they are thrown away.
|
|
*/
|
|
|
|
extern floatish thresholdpercent;
|
|
|
|
void TraceElement()
|
|
{
|
|
intish i;
|
|
intish j;
|
|
struct chunk* ch;
|
|
floatish grandtotal;
|
|
intish min;
|
|
floatish t;
|
|
floatish p;
|
|
struct entry* e;
|
|
intish *totals;
|
|
|
|
totals = (intish *) xmalloc(nidents * sizeof(intish));
|
|
|
|
/* find totals */
|
|
|
|
for (i = 0; i < nidents; i++) {
|
|
totals[ i ] = 0;
|
|
}
|
|
|
|
for (i = 0; i < nidents; i++) {
|
|
for (ch = identtable[i]->chk; ch; ch = ch->next) {
|
|
for (j = 0; j < ch->nd; j++) {
|
|
totals[ i ] += ch->d[j].value;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* sort on the basis of total */
|
|
|
|
for (i = 0; i < nidents-1; i++) {
|
|
min = i;
|
|
for (j = i+1; j < nidents; j++) {
|
|
if (totals[ j ] < totals[ min ]) {
|
|
min = j;
|
|
}
|
|
}
|
|
|
|
t = totals[ min ];
|
|
totals[ min ] = totals[ i ];
|
|
totals[ i ] = t;
|
|
|
|
e = identtable[ min ];
|
|
identtable[ min ] = identtable[ i ];
|
|
identtable[ i ] = e;
|
|
}
|
|
|
|
|
|
/* find the grand total (NB: can get *BIG*!) */
|
|
|
|
grandtotal = 0.0;
|
|
|
|
for (i = 0; i < nidents; i++) {
|
|
grandtotal += (floatish) totals[ i ];
|
|
}
|
|
|
|
t = 0.0; /* cumulative percentage */
|
|
|
|
for (i = 0; i < nidents; i++) {
|
|
p = (100.0 * (floatish) totals[i]) / grandtotal;
|
|
t = t + p;
|
|
if (t >= THRESHOLD_PERCENT) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* identifiers from 0 to i-1 should be removed */
|
|
for (j = 0; i < nidents; i++, j++) {
|
|
identtable[j] = identtable[i];
|
|
}
|
|
|
|
nidents = j;
|
|
|
|
free(totals);
|
|
}
|