@@ -218,7 +218,7 @@ inc_blksize_ctr (blksize_hist_t &hist, size_t blksize, size_t offset)
218
218
219
219
static void
220
220
print_align_hist (const std::unordered_map<int , size_t >& align_map)
221
- {
221
+ {
222
222
/* Convert to ordered map (convenient, since we need to mutate counts),
223
223
* find requests for offset zero (any alignment), and calculate total. */
224
224
std::map<int , size_t > align_hist;
@@ -244,10 +244,10 @@ print_align_hist(const std::unordered_map<int, size_t>& align_map)
244
244
auto it = align_hist.find (bits);
245
245
if (it != align_hist.end ())
246
246
it->second += requests;
247
- }
247
+ }
248
248
el.second += any_align_count;
249
249
}
250
-
250
+
251
251
/* The smallest alignment must have the largest number of requests, so we
252
252
* can iterate in map-order, skipping over bits for which the number of
253
253
* requests does not change */
@@ -264,9 +264,9 @@ print_align_hist(const std::unordered_map<int, size_t>& align_map)
264
264
}
265
265
266
266
// Only print if number of requests differs from the next alignment
267
- it++;
267
+ it++;
268
268
if (it == align_hist.end () || it->second != requests) {
269
- fprintf (fp, " %2d bit aligned: %5.1f%% (%zu)\n " ,
269
+ fprintf (fp, " %2d bit aligned: %5.1f%% (%zu)\n " ,
270
270
bits, static_cast <double >(requests*100 ) / total, requests);
271
271
}
272
272
}
0 commit comments