You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
344 lines
6.9 KiB
344 lines
6.9 KiB
/*
|
|
Copyright (c) 2014 Arduino. All right reserved.
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
See the GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with this library; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <string>
|
|
#include <math.h>
|
|
|
|
#include "Print.h"
|
|
|
|
using std::string;
|
|
// Public Methods //////////////////////////////////////////////////////////////
|
|
|
|
/* default implementation: may be overridden */
|
|
size_t Print::write(const uint8_t *buffer, size_t size)
|
|
{
|
|
size_t n = 0;
|
|
while (size--) {
|
|
if (write(*buffer++)) n++;
|
|
else break;
|
|
}
|
|
return n;
|
|
}
|
|
|
|
size_t Print::print(string str)
|
|
{
|
|
return write(str.c_str(), str.size());
|
|
}
|
|
|
|
// size_t Print::print(const char str[])
|
|
// {
|
|
// return write(str);
|
|
// }
|
|
|
|
size_t Print::print(char c)
|
|
{
|
|
return write(c);
|
|
}
|
|
|
|
size_t Print::print(const char* c){
|
|
return write(c);
|
|
}
|
|
|
|
|
|
size_t Print::print(unsigned char b, int base)
|
|
{
|
|
return print((unsigned long) b, base);
|
|
}
|
|
|
|
size_t Print::print(int n, int base)
|
|
{
|
|
return print((long) n, base);
|
|
}
|
|
|
|
size_t Print::print(unsigned int n, int base)
|
|
{
|
|
return print((unsigned long) n, base);
|
|
}
|
|
|
|
size_t Print::print(long n, int base)
|
|
{
|
|
if (base == 0) {
|
|
return write(n);
|
|
} else if (base == 10) {
|
|
if (n < 0) {
|
|
int t = print('-');
|
|
n = -n;
|
|
return printNumber(n, 10) + t;
|
|
}
|
|
return printNumber(n, 10);
|
|
} else {
|
|
return printNumber(n, base);
|
|
}
|
|
}
|
|
|
|
size_t Print::print(unsigned long n, int base)
|
|
{
|
|
if (base == 0) return write(n);
|
|
else return printNumber(n, base);
|
|
}
|
|
|
|
size_t Print::print(long long n, int base)
|
|
{
|
|
if (base == 0) {
|
|
return write(n);
|
|
} else if (base == 10) {
|
|
if (n < 0) {
|
|
int t = print('-');
|
|
n = -n;
|
|
return printULLNumber(n, 10) + t;
|
|
}
|
|
return printULLNumber(n, 10);
|
|
} else {
|
|
return printULLNumber(n, base);
|
|
}
|
|
}
|
|
|
|
size_t Print::print(unsigned long long n, int base)
|
|
{
|
|
if (base == 0) return write(n);
|
|
else return printULLNumber(n, base);
|
|
}
|
|
|
|
size_t Print::print(double n, int digits)
|
|
{
|
|
return printFloat(n, digits);
|
|
}
|
|
|
|
size_t Print::println(void)
|
|
{
|
|
return write("\r\n");
|
|
}
|
|
|
|
size_t Print::println(const char c[])
|
|
{
|
|
size_t n = print(c);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(char c)
|
|
{
|
|
size_t n = print(c);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(unsigned char b, int base)
|
|
{
|
|
size_t n = print(b, base);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(int num, int base)
|
|
{
|
|
size_t n = print(num, base);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(unsigned int num, int base)
|
|
{
|
|
size_t n = print(num, base);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(long num, int base)
|
|
{
|
|
size_t n = print(num, base);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(unsigned long num, int base)
|
|
{
|
|
size_t n = print(num, base);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(long long num, int base)
|
|
{
|
|
size_t n = print(num, base);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(unsigned long long num, int base)
|
|
{
|
|
size_t n = print(num, base);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
size_t Print::println(double num, int digits)
|
|
{
|
|
size_t n = print(num, digits);
|
|
n += println();
|
|
return n;
|
|
}
|
|
|
|
|
|
// Private Methods /////////////////////////////////////////////////////////////
|
|
|
|
size_t Print::printNumber(unsigned long n, uint8_t base)
|
|
{
|
|
char buf[8 * sizeof(long) + 1]; // Assumes 8-bit chars plus zero byte.
|
|
char *str = &buf[sizeof(buf) - 1];
|
|
|
|
*str = '\0';
|
|
|
|
// prevent crash if called with base == 1
|
|
if (base < 2) base = 10;
|
|
|
|
do {
|
|
char c = n % base;
|
|
n /= base;
|
|
|
|
*--str = c < 10 ? c + '0' : c + 'A' - 10;
|
|
} while(n);
|
|
|
|
return write(str);
|
|
}
|
|
|
|
// REFERENCE IMPLEMENTATION FOR ULL
|
|
// size_t Print::printULLNumber(unsigned long long n, uint8_t base)
|
|
// {
|
|
// // if limited to base 10 and 16 the bufsize can be smaller
|
|
// char buf[65];
|
|
// char *str = &buf[64];
|
|
|
|
// *str = '\0';
|
|
|
|
// // prevent crash if called with base == 1
|
|
// if (base < 2) base = 10;
|
|
|
|
// do {
|
|
// unsigned long long t = n / base;
|
|
// char c = n - t * base; // faster than c = n%base;
|
|
// n = t;
|
|
// *--str = c < 10 ? c + '0' : c + 'A' - 10;
|
|
// } while(n);
|
|
|
|
// return write(str);
|
|
// }
|
|
|
|
// FAST IMPLEMENTATION FOR ULL
|
|
size_t Print::printULLNumber(unsigned long long n64, uint8_t base)
|
|
{
|
|
// if limited to base 10 and 16 the bufsize can be 20
|
|
char buf[64];
|
|
uint8_t i = 0;
|
|
uint8_t innerLoops = 0;
|
|
|
|
// prevent crash if called with base == 1
|
|
if (base < 2) base = 10;
|
|
|
|
// process chunks that fit in "16 bit math".
|
|
uint16_t top = 0xFFFF / base;
|
|
uint16_t th16 = 1;
|
|
while (th16 < top)
|
|
{
|
|
th16 *= base;
|
|
innerLoops++;
|
|
}
|
|
|
|
while (n64 > th16)
|
|
{
|
|
// 64 bit math part
|
|
uint64_t q = n64 / th16;
|
|
uint16_t r = n64 - q*th16;
|
|
n64 = q;
|
|
|
|
// 16 bit math loop to do remainder. (note buffer is filled reverse)
|
|
for (uint8_t j=0; j < innerLoops; j++)
|
|
{
|
|
uint16_t qq = r/base;
|
|
buf[i++] = r - qq*base;
|
|
r = qq;
|
|
}
|
|
}
|
|
|
|
uint16_t n16 = n64;
|
|
while (n16 > 0)
|
|
{
|
|
uint16_t qq = n16/base;
|
|
buf[i++] = n16 - qq*base;
|
|
n16 = qq;
|
|
}
|
|
|
|
size_t bytes = i;
|
|
for (; i > 0; i--)
|
|
write((char) (buf[i - 1] < 10 ?
|
|
'0' + buf[i - 1] :
|
|
'A' + buf[i - 1] - 10));
|
|
|
|
return bytes;
|
|
}
|
|
|
|
size_t Print::printFloat(double number, int digits)
|
|
{
|
|
if (digits < 0)
|
|
digits = 2;
|
|
|
|
size_t n = 0;
|
|
|
|
if (isnan(number)) return print("nan");
|
|
if (isinf(number)) return print("inf");
|
|
if (number > 4294967040.0) return print ("ovf"); // constant determined empirically
|
|
if (number <-4294967040.0) return print ("ovf"); // constant determined empirically
|
|
|
|
// Handle negative numbers
|
|
if (number < 0.0)
|
|
{
|
|
n += print('-');
|
|
number = -number;
|
|
}
|
|
|
|
// Round correctly so that print(1.999, 2) prints as "2.00"
|
|
double rounding = 0.5;
|
|
for (uint8_t i=0; i<digits; ++i)
|
|
rounding /= 10.0;
|
|
|
|
number += rounding;
|
|
|
|
// Extract the integer part of the number and print it
|
|
unsigned long int_part = (unsigned long)number;
|
|
double remainder = number - (double)int_part;
|
|
n += print(int_part);
|
|
|
|
// Print the decimal point, but only if there are digits beyond
|
|
if (digits > 0) {
|
|
n += print(".");
|
|
}
|
|
|
|
// Extract digits from the remainder one at a time
|
|
while (digits-- > 0)
|
|
{
|
|
remainder *= 10.0;
|
|
unsigned int toPrint = (unsigned int)remainder;
|
|
n += print(toPrint);
|
|
remainder -= toPrint;
|
|
}
|
|
|
|
return n;
|
|
}
|
|
|