1*b0d29bc4SBrooks Davis // Copyright 2012 The Kyua Authors. 2*b0d29bc4SBrooks Davis // All rights reserved. 3*b0d29bc4SBrooks Davis // 4*b0d29bc4SBrooks Davis // Redistribution and use in source and binary forms, with or without 5*b0d29bc4SBrooks Davis // modification, are permitted provided that the following conditions are 6*b0d29bc4SBrooks Davis // met: 7*b0d29bc4SBrooks Davis // 8*b0d29bc4SBrooks Davis // * Redistributions of source code must retain the above copyright 9*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer. 10*b0d29bc4SBrooks Davis // * Redistributions in binary form must reproduce the above copyright 11*b0d29bc4SBrooks Davis // notice, this list of conditions and the following disclaimer in the 12*b0d29bc4SBrooks Davis // documentation and/or other materials provided with the distribution. 13*b0d29bc4SBrooks Davis // * Neither the name of Google Inc. nor the names of its contributors 14*b0d29bc4SBrooks Davis // may be used to endorse or promote products derived from this software 15*b0d29bc4SBrooks Davis // without specific prior written permission. 16*b0d29bc4SBrooks Davis // 17*b0d29bc4SBrooks Davis // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18*b0d29bc4SBrooks Davis // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19*b0d29bc4SBrooks Davis // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20*b0d29bc4SBrooks Davis // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21*b0d29bc4SBrooks Davis // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22*b0d29bc4SBrooks Davis // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23*b0d29bc4SBrooks Davis // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24*b0d29bc4SBrooks Davis // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25*b0d29bc4SBrooks Davis // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26*b0d29bc4SBrooks Davis // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27*b0d29bc4SBrooks Davis // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28*b0d29bc4SBrooks Davis 29*b0d29bc4SBrooks Davis /// \file utils/units.hpp 30*b0d29bc4SBrooks Davis /// Formatters and parsers of user-friendly units. 31*b0d29bc4SBrooks Davis 32*b0d29bc4SBrooks Davis #if !defined(UTILS_UNITS_HPP) 33*b0d29bc4SBrooks Davis #define UTILS_UNITS_HPP 34*b0d29bc4SBrooks Davis 35*b0d29bc4SBrooks Davis #include "utils/units_fwd.hpp" 36*b0d29bc4SBrooks Davis 37*b0d29bc4SBrooks Davis extern "C" { 38*b0d29bc4SBrooks Davis #include <stdint.h> 39*b0d29bc4SBrooks Davis } 40*b0d29bc4SBrooks Davis 41*b0d29bc4SBrooks Davis #include <istream> 42*b0d29bc4SBrooks Davis #include <ostream> 43*b0d29bc4SBrooks Davis #include <string> 44*b0d29bc4SBrooks Davis 45*b0d29bc4SBrooks Davis namespace utils { 46*b0d29bc4SBrooks Davis namespace units { 47*b0d29bc4SBrooks Davis 48*b0d29bc4SBrooks Davis 49*b0d29bc4SBrooks Davis namespace { 50*b0d29bc4SBrooks Davis 51*b0d29bc4SBrooks Davis /// Constant representing 1 kilobyte. 52*b0d29bc4SBrooks Davis const uint64_t KB = int64_t(1) << 10; 53*b0d29bc4SBrooks Davis 54*b0d29bc4SBrooks Davis /// Constant representing 1 megabyte. 55*b0d29bc4SBrooks Davis const uint64_t MB = int64_t(1) << 20; 56*b0d29bc4SBrooks Davis 57*b0d29bc4SBrooks Davis /// Constant representing 1 gigabyte. 58*b0d29bc4SBrooks Davis const uint64_t GB = int64_t(1) << 30; 59*b0d29bc4SBrooks Davis 60*b0d29bc4SBrooks Davis /// Constant representing 1 terabyte. 61*b0d29bc4SBrooks Davis const uint64_t TB = int64_t(1) << 40; 62*b0d29bc4SBrooks Davis 63*b0d29bc4SBrooks Davis } // anonymous namespace 64*b0d29bc4SBrooks Davis 65*b0d29bc4SBrooks Davis 66*b0d29bc4SBrooks Davis /// Representation of a bytes quantity. 67*b0d29bc4SBrooks Davis /// 68*b0d29bc4SBrooks Davis /// The purpose of this class is to represent an amount of bytes in a semantic 69*b0d29bc4SBrooks Davis /// manner, and to provide functions to format such numbers for nice user 70*b0d29bc4SBrooks Davis /// presentation and to parse back such numbers. 71*b0d29bc4SBrooks Davis /// 72*b0d29bc4SBrooks Davis /// The input follows this regular expression: [0-9]+(|\.[0-9]+)[GgKkMmTt]? 73*b0d29bc4SBrooks Davis /// The output follows this regular expression: [0-9]+\.[0-9]{3}[GKMT]? 74*b0d29bc4SBrooks Davis class bytes { 75*b0d29bc4SBrooks Davis /// Raw representation, in bytes, of the quantity. 76*b0d29bc4SBrooks Davis uint64_t _count; 77*b0d29bc4SBrooks Davis 78*b0d29bc4SBrooks Davis public: 79*b0d29bc4SBrooks Davis bytes(void); 80*b0d29bc4SBrooks Davis explicit bytes(const uint64_t); 81*b0d29bc4SBrooks Davis 82*b0d29bc4SBrooks Davis static bytes parse(const std::string&); 83*b0d29bc4SBrooks Davis std::string format(void) const; 84*b0d29bc4SBrooks Davis 85*b0d29bc4SBrooks Davis operator uint64_t(void) const; 86*b0d29bc4SBrooks Davis }; 87*b0d29bc4SBrooks Davis 88*b0d29bc4SBrooks Davis 89*b0d29bc4SBrooks Davis std::istream& operator>>(std::istream&, bytes&); 90*b0d29bc4SBrooks Davis std::ostream& operator<<(std::ostream&, const bytes&); 91*b0d29bc4SBrooks Davis 92*b0d29bc4SBrooks Davis 93*b0d29bc4SBrooks Davis } // namespace units 94*b0d29bc4SBrooks Davis } // namespace utils 95*b0d29bc4SBrooks Davis 96*b0d29bc4SBrooks Davis #endif // !defined(UTILS_UNITS_HPP) 97