Mercurial > cgi-bin > hgwebdir.cgi > VMS > C_Libraries > Histogram

annotate Histogram.c @ 32:20f99e6710b3

find changesets by author, revision, files, or words in the commit message
hide animating VP and entry point
author Nina Engelhardt <nengel@mailbox.tu-berlin.de>
date Wed, 15 May 2013 15:28:42 +0200
parents 2aa025da7c60
children
rev   line source
Me@0 1 /*
Me@0 2 * Copyright 2010 OpenSourceStewardshipFoundation.org
Me@0 3 * Licensed under GNU General Public License version 2
Me@0 4 *
Me@0 5 * Author: seanhalle@yahoo.com
Me@0 6 *
Me@0 7 */
Me@4 8 #include <stdio.h>
seanhalle@22 9 #include <string.h>
seanhalle@24 10 #include <malloc.h>
seanhalle@24 11
Me@0 12 #include "Histogram.h"
nengel@32 13 #include "VMS_impl/VMS.h"
Me@0 14
Me@0 15
Me@0 16 /*This Histogram Abstract Data Type has a number of bins plus a range of
Me@0 17 * values that the bins span, both chosen at creation.
Me@0 18 *
Me@0 19 *One creates a Histogram instance using the makeHistogram function, then
Me@0 20 * updates it with the addToHist function, and prints it out with the
Me@0 21 * printHist function.
Me@0 22 *
Me@0 23 *Note, the bin width is an integer, so the end of the range is adjusted
Me@0 24 * accordingly. Use the bin-width to calculate the bin boundaries.
Me@0 25 */
Me@0 26
Me@0 27
Me@0 28 Histogram *
SeanHalle@5 29 makeHistogram( int32 numBins, int32 startOfRange, int32 endOfRange )
Me@0 30 {
Me@0 31 Histogram *hist;
SeanHalle@5 32 int32 i;
Me@0 33
Me@0 34
Me@16 35 hist = VMS_int__malloc( sizeof(Histogram) );
Me@16 36 hist->bins = VMS_int__malloc( numBins * sizeof(int32) );
Me@0 37
Me@0 38 hist->numBins = numBins;
Me@0 39 hist->binWidth = (endOfRange - startOfRange) / numBins;
Me@0 40 hist->endOfRange = startOfRange + hist->binWidth * numBins;
Me@0 41 hist->startOfRange = startOfRange;
Me@0 42
Me@0 43 for( i = 0; i < hist->numBins; i++ )
Me@0 44 {
Me@0 45 hist->bins[ i ] = 0;
Me@0 46 }
Me@0 47
Me@7 48 hist->name = NULL;
Me@7 49 return hist;
Me@7 50 }
Me@7 51
nengel@28 52 void
Me@7 53 makeHist_helper( Histogram *hist, int32 numBins,
Me@7 54 int32 startOfRange, int32 binWidth, char *nameCopy )
Me@7 55 {
Me@7 56 hist->numBins = numBins;
Me@7 57 hist->binWidth = binWidth;
Me@7 58 hist->endOfRange = startOfRange + hist->binWidth * numBins;
Me@7 59 hist->startOfRange = startOfRange;
Me@7 60 hist->name = nameCopy;
Me@7 61 memset( hist->bins, 0, numBins * sizeof(int32) );
Me@7 62 }
Me@7 63
Me@7 64
Me@7 65 Histogram *
Me@7 66 makeFixedBinHist( int32 numBins, int32 startOfRange, int32 binWidth,
Me@7 67 char *name )
Me@7 68
Me@7 69 {
Me@7 70 Histogram *hist;
Me@7 71
Me@16 72 hist = VMS_int__malloc( sizeof(Histogram) );
Me@16 73 hist->bins = VMS_int__malloc( numBins * sizeof(int32) );
Me@7 74
seanhalle@22 75 char *nameCopy = (char *)VMS_int__strDup(name);
seanhalle@22 76 makeHist_helper( hist, numBins, startOfRange, binWidth, nameCopy);
Me@7 77
Me@7 78 return hist;
Me@7 79 }
Me@7 80
Me@7 81 Histogram *
Me@15 82 makeFixedBinHistExt( int32 numBins, int32 startOfRange, int32 binWidth,
Me@7 83 char *name )
Me@7 84
Me@7 85 {
Me@7 86 Histogram *hist;
Me@7 87
Me@7 88 hist = malloc( sizeof(Histogram) );
Me@7 89 hist->bins = malloc( numBins * sizeof(int32) );
Me@7 90
Me@7 91 makeHist_helper( hist, numBins, startOfRange, binWidth, strdup(name));
Me@7 92
Me@0 93 return hist;
Me@0 94 }
Me@0 95
nengel@27 96 void
SeanHalle@5 97 addToHist( int32 value, Histogram *hist )
Me@0 98 {
SeanHalle@5 99 int32 binIdx;
Me@0 100
Me@0 101 if( value < hist->startOfRange )
Me@0 102 { binIdx = 0;
Me@0 103 }
Me@0 104 else if( value > hist->endOfRange )
Me@0 105 { binIdx = hist->numBins - 1;
Me@0 106 }
Me@0 107 else
Me@0 108 {
Me@0 109 binIdx = (value - hist->startOfRange) / hist->binWidth;
Me@0 110 }
Me@0 111
Me@0 112 hist->bins[ binIdx ] += 1;
Me@0 113 }
Me@0 114
nengel@27 115 void
Me@8 116 subFromHist( int32 value, Histogram *hist )
Me@8 117 {
Me@8 118 int32 binIdx;
Me@8 119
Me@8 120 if( value < hist->startOfRange )
Me@8 121 { binIdx = 0;
Me@8 122 }
Me@8 123 else if( value > hist->endOfRange )
Me@8 124 { binIdx = hist->numBins - 1;
Me@8 125 }
Me@8 126 else
Me@8 127 {
Me@8 128 binIdx = (value - hist->startOfRange) / hist->binWidth;
Me@8 129 }
Me@8 130
Me@8 131 hist->bins[ binIdx ] -= 1;
Me@8 132 }
Me@8 133
SeanHalle@5 134
Me@7 135 /*Inline because use with RDTSC in innermost code so need ultra-fast
Me@7 136 */
nengel@27 137 void
msach@10 138 addIntervalToHist( uint32 startIntvl, uint32 endIntvl, Histogram *hist )
SeanHalle@5 139 {
SeanHalle@5 140 int32 value;
SeanHalle@5 141
SeanHalle@5 142 value = endIntvl - startIntvl;
SeanHalle@5 143 if( value < 0 || value > 10000000 ) return; //sanity check
SeanHalle@5 144 addToHist( value, hist );
SeanHalle@5 145 }
SeanHalle@5 146
nengel@27 147 void
Me@8 148 subIntervalFromHist( int32 startIntvl, int32 endIntvl, Histogram *hist )
Me@8 149 {
Me@8 150 int32 value;
Me@8 151
Me@8 152 value = endIntvl - startIntvl;
Me@8 153 if( value < 0 || value > 10000000 ) return; //sanity check
Me@8 154 subFromHist( value, hist );
Me@8 155 }
Me@8 156
Me@0 157 void
msach@10 158 saveHistToFile(Histogram *hist)
msach@10 159 {
msach@10 160 FILE *output;
msach@10 161 int32 binIdx, binStart, binEnd, centerValue, width;
msach@10 162 int32 maxHeight, i,n;
msach@11 163 float32 total, total2, expectedValue1, expectedValue2;
msach@10 164
msach@10 165 if(hist == NULL || hist->name == NULL)
msach@10 166 return;
msach@10 167
msach@10 168 //Calculate the average
msach@10 169 //do all except the top bin
msach@10 170 maxHeight = 0; total = 0.0; expectedValue1 = 0.0;
msach@10 171 for( i = 0; i < hist->numBins -1; i++ )
msach@10 172 {
msach@10 173 if( maxHeight < hist->bins[ i ] ) maxHeight = hist->bins[ i ];
msach@10 174 total += hist->bins[ i ];
msach@10 175 binStart = hist->startOfRange + hist->binWidth * i;
msach@10 176 expectedValue1 += hist->bins[ i ] * (binStart + hist->binWidth/2.0);
msach@10 177 }
msach@10 178 //copy and calc expected value minus the top bin
msach@10 179 expectedValue2 = expectedValue1;
msach@10 180 expectedValue2 /= total;
msach@10 181 total2 = total;
msach@10 182 //now do last iteration, to add the top bin
msach@10 183 if(maxHeight < hist->bins[ i ])
msach@10 184 maxHeight = hist->bins[ i ];
msach@10 185 total += hist->bins[ i ];
msach@10 186 binStart = hist->startOfRange + hist->binWidth * i;
msach@10 187 expectedValue1 += hist->bins[ i ] * (binStart + hist->binWidth/2.0);
msach@10 188
msach@10 189 expectedValue1 /= total;
msach@10 190
msach@10 191
msach@10 192
msach@10 193
msach@10 194 //If a histogram directory does not exist, do not save to file.
msach@10 195 //TODO change to argument
msach@10 196 char filename[255];
msach@10 197 for(n=0;n<255;n++)
msach@10 198 {
msach@10 199 sprintf(filename, "./histograms/%s.%d.dat", hist->name,n);
msach@10 200 output = fopen(filename,"r");
msach@10 201 if(output)
msach@10 202 {
msach@10 203 fclose(output);
msach@10 204 }else{
msach@10 205 break;
msach@10 206 }
msach@10 207 }
msach@10 208 printf("Saving Hist to File: %s ...\n", filename);
msach@10 209 output = fopen(filename,"w+");
msach@10 210 if(output == NULL){
msach@10 211 printf("[!]No histogram was saved. To save histograms create folder 'histograms'.\n");
msach@10 212 return;
msach@10 213 }
msach@10 214
msach@10 215 fprintf(output, "#\n# Histogram Name: %s\n", hist->name);
msach@10 216 fprintf(output, "# Expected Values\n");
msach@10 217 fprintf(output, "#\tnum samples: %d | expected value: %3.2f \n",
msach@10 218 (int)total, expectedValue1 );
msach@10 219 fprintf(output, "#\tminus top bin, num samples: %d | expected value: %3.2f \n",
msach@10 220 (int)total2, expectedValue2 );
msach@10 221 fprintf(output, "#\n# [Interval] [Center Value] [Count] [relative Count] [Width]\n");
msach@10 222
msach@10 223 for( binIdx = 0; binIdx < hist->numBins; binIdx++ )
msach@10 224 {
msach@10 225 binStart = hist->startOfRange + hist->binWidth * binIdx;
msach@10 226 binEnd = binStart + hist->binWidth - 1;
msach@10 227 centerValue = (binStart+binEnd)/2;
msach@10 228 width = (binEnd-binStart)+1;
msach@10 229 fprintf(output, "%d-%d\t%d\t%d\t%.4f\t%d\n", binStart, binEnd, centerValue,
msach@10 230 hist->bins[ binIdx ],
msach@10 231 hist->bins[ binIdx ]/total, width);
msach@10 232 }
msach@10 233
msach@10 234 fclose(output);
msach@10 235 fflush(stdout);
msach@10 236 }
msach@10 237
msach@10 238 void
Me@0 239 printHist( Histogram *hist )
Me@0 240 {
Me@7 241 int32 binIdx, i, numBars, maxHeight, barValue, binStart, binEnd;
Me@8 242 float32 total, total2, binPercent, expectedValue1, expectedValue2;
Me@0 243
Me@8 244 if( hist == NULL ) return;
Me@8 245
Me@7 246 //do all except the top bin
Me@7 247 maxHeight = 0; total = 0.0; expectedValue1 = 0.0;
Me@7 248 for( i = 0; i < hist->numBins -1; i++ )
Me@0 249 {
Me@0 250 if( maxHeight < hist->bins[ i ] ) maxHeight = hist->bins[ i ];
Me@7 251 total += hist->bins[ i ];
Me@7 252 binStart = hist->startOfRange + hist->binWidth * i;
Me@7 253 expectedValue1 += hist->bins[ i ] * (binStart + hist->binWidth/2.0);
Me@0 254 }
Me@7 255 //copy and calc expected value minus the top bin
Me@8 256 expectedValue2 = expectedValue1;
Me@7 257 expectedValue2 /= total;
Me@8 258 total2 = total;
Me@7 259 //now do last iteration, to add the top bin
Me@7 260 if( maxHeight < hist->bins[ i ] ) maxHeight = hist->bins[ i ];
Me@7 261 total += hist->bins[ i ];
Me@7 262 binStart = hist->startOfRange + hist->binWidth * i;
Me@7 263 expectedValue1 += hist->bins[ i ] * (binStart + hist->binWidth/2.0);
Me@7 264
Me@7 265 expectedValue1 /= total;
Me@7 266
Me@7 267 printf( "histogram: " );
Me@7 268 if( hist->name != NULL ) printf( "%s\n", hist->name );
Me@7 269 else printf( "\n" );
Me@8 270 printf( " num samples: %d | expected value: %3.2f \n",
Me@8 271 (int)total, expectedValue1 );
Me@8 272 printf( "minus top bin, num samples: %d | expected value: %3.2f \n",
Me@8 273 (int)total2, expectedValue2 );
Me@7 274
msach@10 275 if(maxHeight < 60){
msach@10 276 barValue = 1;
msach@10 277 printf("Single Bar Value: %i\n", barValue);
msach@10 278 }else{
msach@10 279 barValue = maxHeight / 60; //60 spaces across page for tallest bin
msach@10 280 printf("Single Bar Value: %0.3f\n", (float)maxHeight /60);
msach@10 281 }
msach@10 282
Me@8 283 if( barValue == 0 ) { printf("error: bar val zero\n"); return; }
Me@0 284 for( binIdx = 0; binIdx < hist->numBins; binIdx++ )
Me@0 285 {
Me@0 286 binStart = hist->startOfRange + hist->binWidth * binIdx;
Me@0 287 binEnd = binStart + hist->binWidth - 1;
Me@7 288 binPercent = 100 * hist->bins[ binIdx ] / total;
Me@7 289 printf("bin range: %d - %d | %3.2f", binStart, binEnd, binPercent );
Me@0 290
Me@0 291 numBars = hist->bins[ binIdx ] / barValue;
Me@0 292 //print one bin, height of bar is num dashes across page
Me@0 293 for( i = 0; i < numBars; i++ )
Me@0 294 {
Me@0 295 printf("-");
Me@0 296 }
Me@0 297 printf("\n");
Me@0 298 }
Me@0 299 }
Me@0 300
Me@3 301 void
Me@3 302 freeHist( Histogram *hist )
Me@3 303 {
Me@16 304 VMS_int__free( hist->bins );
Me@16 305 VMS_int__free( hist->name );
Me@16 306 VMS_int__free( hist );
Me@15 307 }
Me@15 308 void
Me@15 309 freeHistExt( Histogram *hist )
Me@15 310 {
Me@7 311 free( hist->bins );
Me@7 312 free( hist->name );
Me@7 313 free( hist );
Me@7 314 }