mirror of
https://github.com/zebrajr/pytorch.git
synced 2025-12-07 00:21:07 +01:00
3c2462cf24
Summary: Pull Request resolved: https://github.com/pytorch/pytorch/pull/14163 Some of the names we were using to guard the header file was too short (e.g. DYNAMIC_HISTOGRAM_H). Reviewed By: csummersea Differential Revision: D13115451 fbshipit-source-id: cef8c84c62922616ceea17effff7bdf8d67302a2
85 lines
2.3 KiB
C++
85 lines
2.3 KiB
C++
#pragma once
|
|
|
|
#include <memory>
|
|
#include <vector>
|
|
|
|
namespace dnnlowp {
|
|
|
|
/**
|
|
* bin_width = (max - min)/nbins
|
|
* ith bin (zero-based indexing) contains [i*bin_width, (i+1)*bin_width)
|
|
* with an exception that (nbins - 1)th bin contains
|
|
* [(nbins-1)*bin_width, nbins*bin_width]
|
|
*
|
|
* Make sure to call Finalize before GetHistogram to reduce per-thread
|
|
* histogram.
|
|
*/
|
|
class Histogram {
|
|
public:
|
|
Histogram(int nbins, float min, float max)
|
|
: min_(min), max_(max), histogram_(nbins) {}
|
|
Histogram(float min, float max, const std::vector<uint64_t>& bins)
|
|
: min_(min), max_(max), histogram_(bins) {}
|
|
|
|
void Add(float f, uint64_t cnt = 1);
|
|
/**
|
|
* This version collects histogram with multiple threads using per-thread
|
|
* histogram with privatization.
|
|
* We should call Finalize before GetHistogram to reduce per-thread
|
|
* histogram.
|
|
*/
|
|
void Add(const float* f, int len);
|
|
|
|
float Min() const {
|
|
return min_;
|
|
}
|
|
float Max() const {
|
|
return max_;
|
|
}
|
|
|
|
/**
|
|
* Reduce per-thread histogram. Need to call this before GetHistogram when
|
|
* the version of Add with multiple threads was used.
|
|
*/
|
|
void Finalize();
|
|
|
|
const std::vector<uint64_t>* GetHistogram() const {
|
|
return &histogram_;
|
|
}
|
|
|
|
private:
|
|
float min_, max_;
|
|
std::vector<uint64_t> histogram_;
|
|
std::vector<uint64_t> per_thread_histogram_;
|
|
};
|
|
|
|
/// An equi-width histogram where the spread of bins change over time when
|
|
/// we see new min or max values.
|
|
class DynamicHistogram {
|
|
public:
|
|
DynamicHistogram(int nbins);
|
|
|
|
void Add(float f);
|
|
void Add(const float* f, int len);
|
|
|
|
/// Indicate we're not dynamically adjusting histogram bins any more and
|
|
/// return the current static histogram.
|
|
const Histogram* Finalize();
|
|
|
|
private:
|
|
/// Dynamic histogram is implemented by the series of static histograms
|
|
/// histograms_[i+1] is a new histogram "expanded" from histograms_[i] when
|
|
/// we see a new extremum.
|
|
/// An invariant: the beginning of the first bin of histograms_[i] exactly
|
|
/// matches with the beginning of a bin in histograms_[i+1]. The end of the
|
|
/// last bin of histograms_[i] exactly matches with the end of a bin in
|
|
/// histograms_[i+1].
|
|
std::vector<Histogram> histograms_;
|
|
int nbins_;
|
|
float min_, max_;
|
|
|
|
std::unique_ptr<Histogram> final_histogram_;
|
|
}; // class DynamicHistogram
|
|
|
|
} // namespace dnnlowp
|