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 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359
|
/* Copyright (C) 2001-2006 Artifex Software, Inc.
All Rights Reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied, modified
or distributed except as expressly authorized under the terms of that
license. Refer to licensing information at http://www.artifex.com/
or contact Artifex Software, Inc., 7 Mt. Lassen Drive - Suite A-134,
San Rafael, CA 94903, U.S.A., +1(415)492-9861, for further information.
*/
/* $Id: iscannum.c 10571 2009-12-30 17:30:30Z alexcher $ */
/* Number scanner for Ghostscript interpreter */
#include "math_.h"
#include "ghost.h"
#include "ierrors.h"
#include "scommon.h"
#include "iscan.h"
#include "iscannum.h" /* defines interface */
#include "scanchar.h"
#include "store.h"
/*
* Warning: this file has a "spaghetti" control structure. But since this
* code accounts for over 10% of the execution time of some PostScript
* files, this is one of the few places we feel this is justified.
*/
/*
* Scan a number. If the number consumes the entire string, return 0;
* if not, set *psp to the first character beyond the number and return 1.
*/
int
scan_number(const byte * str, const byte * end, int sign,
ref * pref, const byte ** psp, int scanner_options)
{
const byte *sp = str;
#define GET_NEXT(cvar, sp, end_action)\
if (sp >= end) { end_action; } else cvar = *sp++
/*
* Powers of 10 up to 6 can be represented accurately as
* a single-precision float.
*/
#define NUM_POWERS_10 6
static const float powers_10[NUM_POWERS_10 + 1] = {
1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6
};
static const double neg_powers_10[NUM_POWERS_10 + 1] = {
1e0, 1e-1, 1e-2, 1e-3, 1e-4, 1e-5, 1e-6
};
int ival;
double dval;
int exp10;
int code = 0;
int c, d;
uint max_scan; /* max signed or unsigned int */
const byte *const decoder = scan_char_decoder;
#define IS_DIGIT(d, c)\
((d = decoder[c]) < 10)
#define WOULD_OVERFLOW(val, d, maxv)\
(val >= maxv / 10 && (val > maxv / 10 || d > (int)(maxv % 10)))
GET_NEXT(c, sp, return_error(e_syntaxerror));
if (!IS_DIGIT(d, c)) {
if (c != '.')
return_error(e_syntaxerror);
/* Might be a number starting with '.'. */
GET_NEXT(c, sp, return_error(e_syntaxerror));
if (!IS_DIGIT(d, c))
return_error(e_syntaxerror);
ival = 0;
goto i2r;
}
/* Accumulate an integer in ival. */
/* Do up to 4 digits without a loop, */
/* since we know this can't overflow and since */
/* most numbers have 4 (integer) digits or fewer. */
ival = d;
if (end - sp >= 3) { /* just check once */
if (!IS_DIGIT(d, (c = *sp))) {
sp++;
goto ind;
}
ival = ival * 10 + d;
if (!IS_DIGIT(d, (c = sp[1]))) {
sp += 2;
goto ind;
}
ival = ival * 10 + d;
sp += 3;
if (!IS_DIGIT(d, (c = sp[-1])))
goto ind;
ival = ival * 10 + d;
}
max_scan = scanner_options & SCAN_PDF_UNSIGNED && sign >= 0 ? ~0 : max_int;
for (;; ival = ival * 10 + d) {
GET_NEXT(c, sp, goto iret);
if (!IS_DIGIT(d, c))
break;
if (WOULD_OVERFLOW(((unsigned)ival), d, max_scan)) {
if (ival == max_int / 10 && d == (max_int % 10) + 1 && sign < 0) {
GET_NEXT(c, sp, c = EOFC);
dval = -(double)min_int;
if (c == 'e' || c == 'E') {
exp10 = 0;
goto fs;
} else if (c == '.') {
GET_NEXT(c, sp, c = EOFC);
exp10 = 0;
goto fd;
} else if (!IS_DIGIT(d, c)) {
ival = min_int;
break;
}
} else
dval = ival;
goto l2d;
}
}
ind: /* We saw a non-digit while accumulating an integer in ival. */
switch (c) {
case '.':
GET_NEXT(c, sp, c = EOFC);
goto i2r;
default:
*psp = sp;
code = 1;
break;
case EOFC:
break;
case 'e':
case 'E':
if (sign < 0)
ival = -ival;
dval = ival;
exp10 = 0;
goto fe;
case '#':
{
const int radix = ival;
uint uval = 0, imax;
if (sign || radix < min_radix || radix > max_radix)
return_error(e_syntaxerror);
/* Avoid multiplies for power-of-2 radix. */
if (!(radix & (radix - 1))) {
int shift;
switch (radix) {
case 2:
shift = 1, imax = max_uint >> 1;
break;
case 4:
shift = 2, imax = max_uint >> 2;
break;
case 8:
shift = 3, imax = max_uint >> 3;
break;
case 16:
shift = 4, imax = max_uint >> 4;
break;
case 32:
shift = 5, imax = max_uint >> 5;
break;
default: /* can't happen */
return_error(e_rangecheck);
}
for (;; uval = (uval << shift) + d) {
GET_NEXT(c, sp, break);
d = decoder[c];
if (d >= radix) {
*psp = sp;
code = 1;
break;
}
if (uval > imax)
return_error(e_limitcheck);
}
} else {
int irem = max_uint % radix;
imax = max_uint / radix;
for (;; uval = uval * radix + d) {
GET_NEXT(c, sp, break);
d = decoder[c];
if (d >= radix) {
*psp = sp;
code = 1;
break;
}
if (uval >= imax &&
(uval > imax || d > irem)
)
return_error(e_limitcheck);
}
}
make_int(pref, uval);
return code;
}
}
iret:
make_int(pref, (sign < 0 ? -ival : ival));
return code;
/* Accumulate a double in dval. */
l2d:
exp10 = 0;
for (;;) {
dval = dval * 10 + d;
GET_NEXT(c, sp, c = EOFC);
if (!IS_DIGIT(d, c))
break;
}
switch (c) {
case '.':
GET_NEXT(c, sp, c = EOFC);
exp10 = 0;
goto fd;
default:
*psp = sp;
code = 1;
/* falls through */
case EOFC:
if (sign < 0)
dval = -dval;
goto rret;
case 'e':
case 'E':
exp10 = 0;
goto fs;
case '#':
return_error(e_syntaxerror);
}
/* We saw a '.' while accumulating an integer in ival. */
i2r:
exp10 = 0;
while (IS_DIGIT(d, c) || c == '-') {
/*
* PostScript gives an error on numbers with a '-' following a '.'
* Adobe Acrobat Reader (PDF) apparently doesn't treat this as an
* error. Experiments show that the numbers following the '-' are
* ignored, so we swallow the fractional part. SCAN_PDF_INV_NUM
* enables this compatibility kloodge.
*/
if (c == '-') {
if ((SCAN_PDF_INV_NUM & scanner_options) == 0)
break;
do {
GET_NEXT(c, sp, c = EOFC);
} while (IS_DIGIT(d, c));
break;
}
if (WOULD_OVERFLOW(ival, d, max_int)) {
dval = ival;
goto fd;
}
ival = ival * 10 + d;
exp10--;
GET_NEXT(c, sp, c = EOFC);
}
if (sign < 0)
ival = -ival;
/* Take a shortcut for the common case */
if (!(c == 'e' || c == 'E' || exp10 < -NUM_POWERS_10)) { /* Check for trailing garbage */
if (c != EOFC)
*psp = sp, code = 1;
make_real(pref, ival * neg_powers_10[-exp10]);
return code;
}
dval = ival;
goto fe;
/* Now we are accumulating a double in dval. */
fd:
while (IS_DIGIT(d, c)) {
dval = dval * 10 + d;
exp10--;
GET_NEXT(c, sp, c = EOFC);
}
fs:
if (sign < 0)
dval = -dval;
fe:
/* Now dval contains the value, negated if necessary. */
switch (c) {
case 'e':
case 'E':
{ /* Check for a following exponent. */
int esign = 0;
int iexp;
GET_NEXT(c, sp, return_error(e_syntaxerror));
switch (c) {
case '-':
esign = 1;
case '+':
GET_NEXT(c, sp, return_error(e_syntaxerror));
}
/* Scan the exponent. We limit it arbitrarily to 999. */
if (!IS_DIGIT(d, c))
return_error(e_syntaxerror);
iexp = d;
for (;; iexp = iexp * 10 + d) {
GET_NEXT(c, sp, break);
if (!IS_DIGIT(d, c)) {
*psp = sp;
code = 1;
break;
}
if (iexp > 99)
return_error(e_limitcheck);
}
if (esign)
exp10 -= iexp;
else
exp10 += iexp;
break;
}
default:
*psp = sp;
code = 1;
case EOFC:
;
}
/* Compute dval * 10^exp10. */
if (exp10 > 0) {
while (exp10 > NUM_POWERS_10)
dval *= powers_10[NUM_POWERS_10],
exp10 -= NUM_POWERS_10;
if (exp10 > 0)
dval *= powers_10[exp10];
} else if (exp10 < 0) {
while (exp10 < -NUM_POWERS_10)
dval /= powers_10[NUM_POWERS_10],
exp10 += NUM_POWERS_10;
if (exp10 < 0)
dval /= powers_10[-exp10];
}
/*
* Check for an out-of-range result. Currently we don't check for
* absurdly large numbers of digits in the accumulation loops,
* but we should.
*/
if (dval >= 0) {
if (dval > MAX_FLOAT)
return_error(e_limitcheck);
} else {
if (dval < -MAX_FLOAT)
return_error(e_limitcheck);
}
rret:
make_real(pref, dval);
return code;
}
|