diff options
| author | River Riddle <riverriddle@google.com> | 2019-12-18 09:28:48 -0800 |
|---|---|---|
| committer | A. Unique TensorFlower <gardener@tensorflow.org> | 2019-12-18 09:29:20 -0800 |
| commit | 4562e389a43caa2e30ebf277c12743edafe6a0ac (patch) | |
| tree | 1901855666adba9be9576e864877fe191e197085 /mlir/lib/Quantizer/Support/UniformSolvers.cpp | |
| parent | 24ab8362f2099ed42f2e05f09fb9323ad0c5ab27 (diff) | |
| download | bcm5719-llvm-4562e389a43caa2e30ebf277c12743edafe6a0ac.tar.gz bcm5719-llvm-4562e389a43caa2e30ebf277c12743edafe6a0ac.zip | |
NFC: Remove unnecessary 'llvm::' prefix from uses of llvm symbols declared in `mlir` namespace.
Aside from being cleaner, this also makes the codebase more consistent.
PiperOrigin-RevId: 286206974
Diffstat (limited to 'mlir/lib/Quantizer/Support/UniformSolvers.cpp')
| -rw-r--r-- | mlir/lib/Quantizer/Support/UniformSolvers.cpp | 10 |
1 files changed, 4 insertions, 6 deletions
diff --git a/mlir/lib/Quantizer/Support/UniformSolvers.cpp b/mlir/lib/Quantizer/Support/UniformSolvers.cpp index 341df5bf888..bd2fe686ee1 100644 --- a/mlir/lib/Quantizer/Support/UniformSolvers.cpp +++ b/mlir/lib/Quantizer/Support/UniformSolvers.cpp @@ -16,9 +16,8 @@ // ============================================================================= #include "mlir/Quantizer/Support/UniformSolvers.h" - +#include "mlir/Support/LLVM.h" #include "llvm/Support/raw_ostream.h" - #include <cmath> using namespace mlir; @@ -131,14 +130,13 @@ double UniformParamsFromMinMaxSolver::dequantize(int64_t xq) const { namespace mlir { namespace quantizer { -llvm::raw_ostream &operator<<(llvm::raw_ostream &os, - const UniformStorageParams &p) { +raw_ostream &operator<<(raw_ostream &os, const UniformStorageParams &p) { os << "UniformStorageParams{" << p.numLevels << ", " << p.minValue << "}"; return os; } -llvm::raw_ostream &operator<<(llvm::raw_ostream &os, - const UniformParamsFromMinMaxSolver &s) { +raw_ostream &operator<<(raw_ostream &os, + const UniformParamsFromMinMaxSolver &s) { os << "UniformParamsFromMinMaxSolver(" << s.getStepCount() << "){"; os << "(" << s.getBoundingMin() << ":" << s.getBoundingMax() << ") -> "; if (!s.isSatisfied()) { |

