File: profiler_counter.c

package info (click to toggle)
libwfa2 2.3.3-4
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 10,072 kB
  • sloc: ansic: 13,812; python: 540; cpp: 500; makefile: 268; sh: 176; lisp: 41
file content (294 lines) | stat: -rw-r--r-- 10,925 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
/*
 *                             The MIT License
 *
 * Wavefront Alignment Algorithms
 * Copyright (c) 2017 by Santiago Marco-Sola  <santiagomsola@gmail.com>
 *
 * This file is part of Wavefront Alignment Algorithms.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 *
 * PROJECT: Wavefront Alignment Algorithms
 * AUTHOR(S): Santiago Marco-Sola <santiagomsola@gmail.com>
 * VERSION: v20.08.25
 * DESCRIPTION: Simple profile counter
 */

#include "utils/commons.h"
#include "profiler_counter.h"

/*
 * Counters
 */
void counter_reset(
    profiler_counter_t* const counter) {
  memset(counter,0,sizeof(profiler_counter_t));
}
void counter_add(
    profiler_counter_t* const counter,
    const uint64_t amount) {
  // Add to total & increment number of samples
  counter->total += amount;
  ++(counter->samples);
  // From http://www.johndcook.com/standard_deviation.html
  // See Knuth TAOCP vol 2, 3rd edition, page 232
  if (counter->samples == 1) {
    counter->min = amount;
    counter->max = amount;
    counter->m_oldM = amount;
    counter->m_newM = amount;
    counter->m_oldS = 0.0;
  } else {
    counter->min = MIN(counter->min,amount);
    counter->max = MAX(counter->max,amount);
    counter->m_newM = counter->m_oldM + ((double)amount-counter->m_oldM)/(double)counter->samples;
    counter->m_newS = counter->m_oldS + ((double)amount-counter->m_oldM)*((double)amount-counter->m_newM);
    counter->m_oldM = counter->m_newM;
    counter->m_oldS = counter->m_newS;
  }
}
uint64_t counter_get_total(const profiler_counter_t* const counter) {
  return counter->total;
}
uint64_t counter_get_num_samples(const profiler_counter_t* const counter) {
  return counter->samples;
}
uint64_t counter_get_min(const profiler_counter_t* const counter) {
  return counter->min;
}
uint64_t counter_get_max(const profiler_counter_t* const counter) {
  return counter->max;
}
double counter_get_mean(const profiler_counter_t* const counter) {
  return (double)counter->total/(double)counter->samples;
}
double counter_get_variance(const profiler_counter_t* const counter) {
  return ((counter->samples > 1) ? counter->m_newS/(double)(counter->samples - 1) : 0.0);
}
double counter_get_stddev(const profiler_counter_t* const counter) {
  return sqrt(counter_get_variance(counter));
}
void counter_combine_sum(
    profiler_counter_t* const counter_dst,
    profiler_counter_t* const counter_src) {
  counter_dst->total += counter_src->total;
  counter_dst->samples += counter_src->samples;
  counter_dst->min = MIN(counter_dst->min,counter_src->min);
  counter_dst->max = MAX(counter_dst->max,counter_src->max);
  if (counter_src->m_newS!=0.0) counter_dst->m_newS = counter_src->m_newS;
  if (counter_src->m_newM!=0.0) counter_dst->m_newM = counter_src->m_newM;
  if (counter_src->m_oldS!=0.0) counter_dst->m_oldS = counter_src->m_oldS;
  if (counter_src->m_oldM!=0.0) counter_dst->m_oldM = counter_src->m_oldM;
}
void counter_print_stats(
    FILE* const stream,
    const profiler_counter_t* const counter,
    const profiler_counter_t* const ref_counter,
    const char* const units) {
  // Print Samples
  const uint64_t num_samples = counter_get_num_samples(counter);
  if (num_samples >= METRIC_FACTOR_1G) {
    fprintf(stream," (samples=%" PRIu64 "G",num_samples/METRIC_FACTOR_1G);
  } else if (num_samples >= METRIC_FACTOR_1M) {
    fprintf(stream," (samples=%" PRIu64 "M",num_samples/METRIC_FACTOR_1M);
  } else if (num_samples >= METRIC_FACTOR_1K) {
    fprintf(stream," (samples=%" PRIu64 "K",num_samples/METRIC_FACTOR_1K);
  } else {
    fprintf(stream," (samples=%" PRIu64 "",num_samples);
    if (num_samples==0) {
      fprintf(stream,",--n/a--)}\n");
      return;
    }
  }
  // Print Mean
  const double mean = counter_get_mean(counter);
  if (mean >= METRIC_FACTOR_1G) {
    fprintf(stream,"{mean%.2fG",mean/METRIC_FACTOR_1G);
  } else if (mean >= METRIC_FACTOR_1M) {
    fprintf(stream,"{mean%.2fM",mean/METRIC_FACTOR_1M);
  } else if (mean >= METRIC_FACTOR_1K) {
    fprintf(stream,"{mean%.2fK",mean/METRIC_FACTOR_1K);
  } else {
    fprintf(stream,"{mean%.2f",mean);
  }
  // Print Min
  const uint64_t min = counter_get_min(counter);
  if (min >= METRIC_FACTOR_1G) {
    fprintf(stream,",min%.2fG",(double)min/METRIC_FACTOR_1G);
  } else if (min >= METRIC_FACTOR_1M) {
    fprintf(stream,",min%.2fM",(double)min/METRIC_FACTOR_1M);
  } else if (min >= METRIC_FACTOR_1K) {
    fprintf(stream,",min%.2fK",(double)min/METRIC_FACTOR_1K);
  } else {
    fprintf(stream,",min%.2f",(double)min);
  }
  // Print Max
  const uint64_t max = counter_get_max(counter);
  if (max >= METRIC_FACTOR_1G) {
    fprintf(stream,",Max%.2fG",(double)max/METRIC_FACTOR_1G);
  } else if (max >= METRIC_FACTOR_1M) {
    fprintf(stream,",Max%.2fM",(double)max/METRIC_FACTOR_1M);
  } else if (max >= METRIC_FACTOR_1K) {
    fprintf(stream,",Max%.2fK",(double)max/METRIC_FACTOR_1K);
  } else {
    fprintf(stream,",Max%.2f",(double)max);
  }
  // Print Variance
  const uint64_t var = counter_get_variance(counter);
  if (var >= METRIC_FACTOR_1G) {
    fprintf(stream,",Var%.2fG",(double)var/METRIC_FACTOR_1G);
  } else if (var >= METRIC_FACTOR_1M) {
    fprintf(stream,",Var%.2fM",(double)var/METRIC_FACTOR_1M);
  } else if (var >= METRIC_FACTOR_1K) {
    fprintf(stream,",Var%.2fK",(double)var/METRIC_FACTOR_1K);
  } else {
    fprintf(stream,",Var%.2f",(double)var);
  }
  // Print Standard Deviation
  const uint64_t stdDev = counter_get_stddev(counter);
  if (stdDev >= METRIC_FACTOR_1G) {
    fprintf(stream,",StdDev%.2fG)}\n",(double)stdDev/METRIC_FACTOR_1G);
  } else if (stdDev >= METRIC_FACTOR_1M) {
    fprintf(stream,",StdDev%.2fM)}\n",(double)stdDev/METRIC_FACTOR_1M);
  } else if (stdDev >= METRIC_FACTOR_1K) {
    fprintf(stream,",StdDev%.2fK)}\n",(double)stdDev/METRIC_FACTOR_1K);
  } else {
    fprintf(stream,",StdDev%.2f)}\n",(double)stdDev);
  }
}
void counter_print(
    FILE* const stream,
    const profiler_counter_t* const counter,
    const profiler_counter_t* const ref_counter,
    const char* const units,
    const bool full_report) {
  const uint64_t total = counter_get_total(counter);
  // Print Total
  if (total >= METRIC_FACTOR_1G) {
    fprintf(stream,"%7.2f G%s",(double)total/METRIC_FACTOR_1G,units);
  } else if (total >= METRIC_FACTOR_1M) {
    fprintf(stream,"%7.2f M%s",(double)total/METRIC_FACTOR_1M,units);
  } else if (total >= METRIC_FACTOR_1K) {
    fprintf(stream,"%7.2f K%s",(double)total/METRIC_FACTOR_1K,units);
  } else {
    fprintf(stream,"%7.2f %s ",(double)total,units);
  }
  // Print percentage wrt reference
  if (ref_counter!=NULL) {
    if (total==0) {
        fprintf(stream," (  0.00 %%)");
    } else {
      const uint64_t total_ref = counter_get_total(ref_counter);
      if (total_ref==0) {
        fprintf(stream," (  n/a  %%)");
      } else {
        const double percentage = (double)(total*100)/(double)total_ref;
        fprintf(stream," (%6.02f %%)",percentage);
      }
    }
  } else {
    fprintf(stream,"           ");
  }
  // Full report
  if (!full_report) {
    fprintf(stream,"\n");
    return;
  } else {
    counter_print_stats(stream,counter,ref_counter,units);
  }
}
void percentage_print(
    FILE* const stream,
    const profiler_counter_t* const counter,
    const char* const units) {
  // Print Mean
  const double mean = counter_get_mean(counter);
  fprintf(stream,"%7.2f %%%s\t\t",mean,units);
  // Print Samples
  const uint64_t num_samples = counter_get_num_samples(counter);
  if (num_samples >= METRIC_FACTOR_1G) {
    fprintf(stream," (samples=%" PRIu64 "G",num_samples/METRIC_FACTOR_1G);
  } else if (num_samples >= METRIC_FACTOR_1M) {
    fprintf(stream," (samples=%" PRIu64 "M",num_samples/METRIC_FACTOR_1M);
  } else if (num_samples >= METRIC_FACTOR_1K) {
    fprintf(stream," (samples=%" PRIu64 "K",num_samples/METRIC_FACTOR_1K);
  } else {
    fprintf(stream," (samples=%" PRIu64 "",num_samples);
  }
  if (num_samples == 0) {
    fprintf(stream,")\n");
    return;
  }
  // Print Min/Max
  fprintf(stream,",min%.2f%%,Max%.2f%%",
      (double)counter_get_min(counter),(double)counter_get_max(counter));
  // Print Variance/StandardDeviation
  fprintf(stream,",Var%.2f,StdDev%.2f)\n",
      counter_get_variance(counter),counter_get_stddev(counter));
}
/*
 * Reference Counter (Counts wrt a reference counter. Eg ranks)
 */
void rcounter_start(
    profiler_rcounter_t* const rcounter,
    const uint64_t reference) {
  rcounter->accumulated = 0;
  rcounter->begin_count = reference;
}
void rcounter_stop(
    profiler_rcounter_t* const rcounter,
    const uint64_t reference) {
  rcounter_pause(rcounter,reference);
  counter_add(&rcounter->counter,rcounter->accumulated);
}
void rcounter_pause(
    profiler_rcounter_t* const rcounter,
    const uint64_t reference) {
  rcounter->accumulated += reference - rcounter->begin_count;
}
void rcounter_restart(
    profiler_rcounter_t* const rcounter,
    const uint64_t reference) {
  rcounter->begin_count = reference;
}
void rcounter_reset(
    profiler_rcounter_t* const rcounter) {
  counter_reset(&rcounter->counter);
}
uint64_t rcounter_get_total(profiler_rcounter_t* const rcounter) {
  return counter_get_total(&rcounter->counter);
}
uint64_t rcounter_get_num_samples(profiler_rcounter_t* const rcounter) {
  return counter_get_num_samples(&rcounter->counter);
}
uint64_t rcounter_get_min(profiler_rcounter_t* const rcounter) {
  return counter_get_min(&rcounter->counter);
}
uint64_t rcounter_get_max(profiler_rcounter_t* const rcounter) {
  return counter_get_max(&rcounter->counter);
}
uint64_t rcounter_get_mean(profiler_rcounter_t* const rcounter) {
  return counter_get_mean(&rcounter->counter);
}
uint64_t rcounter_get_variance(profiler_rcounter_t* const rcounter) {
  return counter_get_variance(&rcounter->counter);
}
uint64_t rcounter_get_stddev(profiler_rcounter_t* const rcounter) {
  return counter_get_stddev(&rcounter->counter);
}