forked from MoSync/MoSync
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmaxtoa.c
157 lines (135 loc) · 3.8 KB
/
maxtoa.c
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
//
// xtoa.c
//
// Convert integers to ASCII strings
//
// Copyright (C) 2002 Michael Ringgaard. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// 3. Neither the name of the project nor the names of its contributors
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
// OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
// HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
// SUCH DAMAGE.
//
#ifndef __IOS__
#include "maxtoa.h"
#else
#include <maxtoa.h>
#endif
void xtoa(unsigned long val, char *buf, unsigned radix, int negative)
{
char *p;
char *firstdig;
char temp;
unsigned digval;
p = buf;
if (negative)
{
// Negative, so output '-' and negate
*p++ = '-';
val = (unsigned long)(-(long) val);
}
// Save pointer to first digit
firstdig = p;
do
{
digval = (unsigned) (val % radix);
val /= radix;
// Convert to ascii and store
if (digval > 9)
*p++ = (char) (digval - 10 + 'a');
else
*p++ = (char) (digval + '0');
} while (val > 0);
// We now have the digit of the number in the buffer, but in reverse
// order. Thus we reverse them now.
*p-- = '\0';
do
{
temp = *p;
*p = *firstdig;
*firstdig = temp;
p--;
firstdig++;
} while (firstdig < p);
}
#ifndef _MSC_VER
char *itoa(int val, char *buf, int radix)
{
if (radix == 10 && val < 0)
xtoa((unsigned long) val, buf, radix, 1);
else
xtoa((unsigned long)(unsigned int) val, buf, radix, 0);
return buf;
}
char *ltoa(long val, char *buf, int radix)
{
xtoa((unsigned long) val, buf, radix, (radix == 10 && val < 0));
return buf;
}
char *ultoa(unsigned long val, char *buf, int radix)
{
xtoa(val, buf, radix, 0);
return buf;
}
#endif //_MSC_VER
void xxtoa(unsigned long long val, char *buf, unsigned radix, int negative)
{
char *p;
char *firstdig;
char temp;
unsigned digval;
p = buf;
if (negative)
{
// Negative, so output '-' and negate
*p++ = '-';
val = (unsigned long)(-(long) val);
}
// Save pointer to first digit
firstdig = p;
do
{
digval = (unsigned) (val % radix);
val /= radix;
// Convert to ascii and store
if (digval > 9)
*p++ = (char) (digval - 10 + 'a');
else
*p++ = (char) (digval + '0');
} while (val > 0);
// We now have the digit of the number in the buffer, but in reverse
// order. Thus we reverse them now.
*p-- = '\0';
do
{
temp = *p;
*p = *firstdig;
*firstdig = temp;
p--;
firstdig++;
} while (firstdig < p);
}
char *lltoa(long long val, char *buf, int radix) {
xxtoa(val, buf, radix, (radix == 10 && val < 0));
return buf;
}