blob: 835265bf12491174056e9e13f0dc18ae0e1e38f3 (
plain)
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
158
159
160
161
162
163
164
165
166
167
168
|
/*
* This file is part of LibCSS.
* Licensed under the MIT License,
* http://www.opensource.org/licenses/mit-license.php
* Copyright 2007-8 John-Mark Bell <jmb@netsurf-browser.org>
*/
#ifndef css_utils_h_
#define css_utils_h_
#include <libcss/types.h>
#include "utils/fpmath.h"
#ifndef max
#define max(a,b) ((a)>(b)?(a):(b))
#endif
#ifndef min
#define min(a,b) ((a)<(b)?(a):(b))
#endif
#ifndef SLEN
/* Calculate length of a string constant */
#define SLEN(s) (sizeof((s)) - 1) /* -1 for '\0' */
#endif
#ifndef UNUSED
#define UNUSED(x) ((x)=(x))
#endif
static inline fixed number_from_css_string(const css_string *string,
bool int_only, size_t *consumed)
{
size_t len;
const uint8_t *ptr;
int sign = 1;
int32_t intpart = 0;
int32_t fracpart = 0;
int32_t pwr = 1;
if (string == NULL || string->len == 0 || consumed == NULL)
return 0;
len = string->len;
ptr = string->data;
/* number = [+-]? ([0-9]+ | [0-9]* '.' [0-9]+) */
/* Extract sign, if any */
if (ptr[0] == '-') {
sign = -1;
len--;
ptr++;
} else if (ptr[0] == '+') {
len--;
ptr++;
}
/* Ensure we have either a digit or a '.' followed by a digit */
if (len == 0) {
*consumed = 0;
return 0;
} else {
if (ptr[0] == '.') {
if (len == 1 || ptr[1] < '0' || '9' < ptr[1]) {
*consumed = 0;
return 0;
}
} else if (ptr[0] < '0' || '9' < ptr[0]) {
*consumed = 0;
return 0;
}
}
/* Now extract intpart, assuming base 10 */
while (len > 0) {
/* Stop on first non-digit */
if (ptr[0] < '0' || '9' < ptr[0])
break;
/* Clamp to a max of 2^22 - 1 */
if (intpart < (1 << 22)) {
intpart *= 10;
intpart += ptr[0] - '0';
}
ptr++;
len--;
}
/* And fracpart, again, assuming base 10 */
if (int_only == false && len > 1 && ptr[0] == '.' &&
('0' <= ptr[1] && ptr[1] <= '9')) {
ptr++;
len--;
while (len > 0) {
if (ptr[0] < '0' || '9' < ptr[0])
break;
if (pwr < 1000000) {
pwr *= 10;
fracpart *= 10;
fracpart += ptr[0] - '0';
}
ptr++;
len--;
}
fracpart = ((1 << 10) * fracpart + pwr/2) / pwr;
if (fracpart >= (1 << 10)) {
intpart++;
fracpart &= (1 << 10) - 1;
}
}
/* If the intpart is larger than we can represent,
* then clamp to the maximum value we can store. */
if (intpart >= (1 << 21)) {
fracpart = (1 << 10) - 1;
intpart = (1 << 21) - 1;
}
*consumed = ptr - string->data;
return FMULI(((intpart << 10) | fracpart), sign);
}
static inline uint32_t charToHex(uint8_t c)
{
switch (c) {
case 'a': case 'A':
return 0xa;
case 'b': case 'B':
return 0xb;
case 'c': case 'C':
return 0xc;
case 'd': case 'D':
return 0xd;
case 'e': case 'E':
return 0xe;
case 'f': case 'F':
return 0xf;
case '0':
return 0x0;
case '1':
return 0x1;
case '2':
return 0x2;
case '3':
return 0x3;
case '4':
return 0x4;
case '5':
return 0x5;
case '6':
return 0x6;
case '7':
return 0x7;
case '8':
return 0x8;
case '9':
return 0x9;
}
return 0;
}
#endif
|
