This repository has been archived by the owner on Oct 11, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 50
/
string.h
executable file
·118 lines (106 loc) · 3.19 KB
/
string.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
// Copyright 2009 Emilie Gillet.
//
// Author: Emilie Gillet ([email protected])
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// This program 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 General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//
// -----------------------------------------------------------------------------
//
// Utility functions for string processing.
#ifndef AVRLIB_STRING_H_
#define AVRLIB_STRING_H_
#include "avrlib/base.h"
#include <string.h>
namespace avrlib {
size_t strnlen(const char* string, size_t maxlen);
void AlignRight(char* source, uint8_t width);
void AlignLeft(char* source, uint8_t width);
void PadRight(char* source, uint8_t width, char character);
template<typename T>
struct TypeInfo {
enum {
has_sign = 0,
max_size = 5
};
};
template<> struct TypeInfo<uint8_t> { enum { has_sign = 0, max_size = 3 }; };
template<> struct TypeInfo<int8_t> { enum { has_sign = 1, max_size = 4 }; };
template<> struct TypeInfo<uint16_t> { enum { has_sign = 0, max_size = 5 }; };
template<> struct TypeInfo<int16_t> { enum { has_sign = 1, max_size = 6 }; };
template<> struct TypeInfo<uint32_t> { enum { has_sign = 0, max_size = 10 }; };
template<> struct TypeInfo<int32_t> { enum { has_sign = 1, max_size = 11 }; };
static inline uint8_t NibbleToAscii(uint8_t digit) {
return digit < 10 ? digit + 48 : digit + 87;
}
template<typename T>
void Itoa(T i, uint8_t width, char* destination) {
unsigned char digits[TypeInfo<T>::max_size + 1];
if (width == 0) {
return;
}
if (i == 0) {
*destination++ = '0';
width--;
} else {
if (TypeInfo<T>::has_sign && i < 0) {
*destination++ = '-';
width--;
i = -i;
}
uint8_t digit = 0;
while (i > 0) {
digits[digit++] = i % 10;
i /= 10;
}
while (digit) {
*destination++ = 48 + digits[--digit];
width--;
}
}
if (width) {
*destination++ = '\0';
}
}
// A version of Itoa that does not allocate anything on the stack, and use
// a fixed chunk of memory for reversing the digits. Caveat: if two Itoa
// operations are taking place simultaneously, the results will be mixed.
template<typename T>
void UnsafeItoa(T i, uint8_t width, char* destination) {
static unsigned char digits[TypeInfo<T>::max_size + 1];
if (width == 0) {
return;
}
if (i == 0) {
*destination++ = '0';
width--;
} else {
if (TypeInfo<T>::has_sign && i < 0) {
*destination++ = '-';
width--;
i = -i;
}
uint8_t digit = 0;
while (i > 0) {
digits[digit++] = i % 10;
i /= 10;
}
while (digit) {
*destination++ = 48 + digits[--digit];
width--;
}
}
if (width) {
*destination++ = '\0';
}
}
} // namespace avrlib
#endif // AVRLIB_STRING_H_