/src/ghostpdl/psi/iscannum.c

Source (jump to first uncovered line)
/* Copyright (C) 2001-2024 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 the license contained in the file LICENSE in this distribution.

   Refer to licensing information at http://www.artifex.com or contact
   Artifex Software, Inc.,  39 Mesa Street, Suite 108A, San Francisco,
   CA 94129, USA, for further information.
*/


/* 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
    };

    ps_int ival;
    double dval;
    int exp10;
    int code = 0;
    int c, d;
    ps_int max_ps_int_scan, min_ps_int_scan;
    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 > (int64_t)(maxv % 10)))

    GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
    if (!IS_DIGIT(d, c)) {
        if (c != '.')
            return_error(gs_error_syntaxerror);
        /* Might be a number starting with '.'. */
        GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
        if (!IS_DIGIT(d, c))
            return_error(gs_error_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_ps_int_scan = scanner_options & SCAN_CPSI_MODE ? MAX_PS_INT32 : MAX_PS_INT;
    min_ps_int_scan = scanner_options & SCAN_CPSI_MODE ? MIN_PS_INT32 : MIN_PS_INT;

    for (;; ival = ival * 10 + d) {
        GET_NEXT(c, sp, goto iret);
        if (!IS_DIGIT(d, c))
            break;
        if (WOULD_OVERFLOW(((ps_uint)ival), d, max_ps_int_scan)) {
            if (ival == max_ps_int_scan / 10 && d == (max_ps_int_scan % 10) + 1 && sign < 0) {
                GET_NEXT(c, sp, c = EOFC);
                dval = -(double)min_ps_int_scan;
                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_ps_int_scan;
                    break;
                }
            } else
                dval = (double)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 = (double)ival;
            exp10 = 0;
            goto fe;
        case '#':
            {
                const int radix = ival;
                ps_int uval = 0, imax;

                if (sign || radix < min_radix || radix > max_radix)
                    return_error(gs_error_syntaxerror);
                /* Avoid multiplies for power-of-2 radix. */
                if (!(radix & (radix - 1))) {
                    int shift;

                    switch (radix) {
                        case 2:
                            shift = 1, imax = MAX_PS_UINT >> 1;
                            break;
                        case 4:
                            shift = 2, imax = MAX_PS_UINT >> 2;
                            break;
                        case 8:
                            shift = 3, imax = MAX_PS_UINT >> 3;
                            break;
                        case 16:
                            shift = 4, imax = MAX_PS_UINT >> 4;
                            break;
                        case 32:
                            shift = 5, imax = MAX_PS_UINT >> 5;
                            break;
                        default:  /* can't happen */
                            return_error(gs_error_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(gs_error_limitcheck);
                    }
                } else {
                    ps_int irem = MAX_PS_UINT % radix;

                    imax = MAX_PS_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(gs_error_limitcheck);
                    }
                }
                if (scanner_options & SCAN_CPSI_MODE) {
                    ps_uint32 int1 = 0;
                    int1 |= (uval & 0xffffffff);
                    make_int(pref, (ps_int)((ps_int32)int1));
                }
                else
                    make_int(pref, uval);

                return code;
            }
    }
iret:
    if (scanner_options & SCAN_CPSI_MODE) {
        make_int(pref, (sign < 0 ? (ps_int32)-ival : (ps_int32)ival));
    }
    else {
        make_int(pref, (sign < 0 ? (ps_int)-ival : (ps_int)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(gs_error_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 = (double)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 = (double)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(gs_error_syntaxerror));
                switch (c) {
                    case '-':
                        esign = 1;
                        /* fall through */
                    case '+':
                        GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
                }
                /* Scan the exponent.  We limit it arbitrarily to 999. */
                if (!IS_DIGIT(d, c))
                    return_error(gs_error_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(gs_error_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;
        dval *= powers_10[exp10];
    } else if (exp10 < 0) {
        while (exp10 < -NUM_POWERS_10)
            dval /= powers_10[NUM_POWERS_10],
                exp10 += NUM_POWERS_10;
        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(gs_error_limitcheck);
    } else {
        if (dval < -MAX_FLOAT)
            return_error(gs_error_limitcheck);
    }
rret:
    make_real(pref, dval);
    return code;
}

Coverage Report

Created: 2025-06-10 06:49

Line	Count	Source (jump to first uncovered line)
1		/* Copyright (C) 2001-2024 Artifex Software, Inc.
2		All Rights Reserved.
3
4		This software is provided AS-IS with no warranty, either express or
5		implied.
6
7		This software is distributed under license and may not be copied,
8		modified or distributed except as expressly authorized under the terms
9		of the license contained in the file LICENSE in this distribution.
10
11		Refer to licensing information at http://www.artifex.com or contact
12		Artifex Software, Inc., 39 Mesa Street, Suite 108A, San Francisco,
13		CA 94129, USA, for further information.
14		*/
15
16
17		/* Number scanner for Ghostscript interpreter */
18		#include "math_.h"
19		#include "ghost.h"
20		#include "ierrors.h"
21		#include "scommon.h"
22		#include "iscan.h"
23		#include "iscannum.h" /* defines interface */
24		#include "scanchar.h"
25		#include "store.h"
26
27		/*
28		* Warning: this file has a "spaghetti" control structure. But since this
29		* code accounts for over 10% of the execution time of some PostScript
30		* files, this is one of the few places we feel this is justified.
31		*/
32
33		/*
34		* Scan a number. If the number consumes the entire string, return 0;
35		* if not, set *psp to the first character beyond the number and return 1.
36		*/
37		int
38		scan_number(const byte * str, const byte * end, int sign,
39		ref * pref, const byte ** psp, int scanner_options)
40	236M	{
41	236M	const byte *sp = str;
42	236M	#define GET_NEXT(cvar, sp, end_action)\
43	952M	if (sp >= end) { end_action; } else cvar = *sp++
44
45		/*
46		* Powers of 10 up to 6 can be represented accurately as
47		* a single-precision float.
48		*/
49	236M	#define NUM_POWERS_10 6
50	236M	static const float powers_10[NUM_POWERS_10 + 1] = {
51	236M	1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6
52	236M	};
53	236M	static const double neg_powers_10[NUM_POWERS_10 + 1] = {
54	236M	1e0, 1e-1, 1e-2, 1e-3, 1e-4, 1e-5, 1e-6
55	236M	};
56
57	236M	ps_int ival;
58	236M	double dval;
59	236M	int exp10;
60	236M	int code = 0;
61	236M	int c, d;
62	236M	ps_int max_ps_int_scan, min_ps_int_scan;
63	236M	const byte *const decoder = scan_char_decoder;
64	236M	#define IS_DIGIT(d, c)\
65	631M	((d = decoder[c]) < 10)
66	236M	#define WOULD_OVERFLOW(val, d, maxv)\
67	236M	(val >= maxv / 10 && (val > maxv / 10 \|\| d > (int64_t)(maxv % 10)))
68
69	236M	GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
70	236M	if (!IS_DIGIT(d, c)) {
71	47.3M	if (c != '.')
72	6.19k	return_error(gs_error_syntaxerror);
73		/* Might be a number starting with '.'. */
74	47.3M	GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
75	47.3M	if (!IS_DIGIT(d, c))
76	47.3M	return_error(gs_error_syntaxerror);
77	15.2k	ival = 0;
78	15.2k	goto i2r;
79	47.3M	}
80		/* Accumulate an integer in ival. */
81		/* Do up to 4 digits without a loop, */
82		/* since we know this can't overflow and since */
83		/* most numbers have 4 (integer) digits or fewer. */
84	188M	ival = d;
85	188M	if (end - sp >= 3) { /* just check once */
86	184M	if (!IS_DIGIT(d, (c = *sp))) {
87	39.2M	sp++;
88	39.2M	goto ind;
89	39.2M	}
90	145M	ival = ival * 10 + d;
91	145M	if (!IS_DIGIT(d, (c = sp[1]))) {
92	140M	sp += 2;
93	140M	goto ind;
94	140M	}
95	4.51M	ival = ival * 10 + d;
96	4.51M	sp += 3;
97	4.51M	if (!IS_DIGIT(d, (c = sp[-1])))
98	2.41M	goto ind;
99	2.10M	ival = ival * 10 + d;
100	2.10M	}
101
102	6.43M	max_ps_int_scan = scanner_options & SCAN_CPSI_MODE ? MAX_PS_INT32 : MAX_PS_INT;
103	6.43M	min_ps_int_scan = scanner_options & SCAN_CPSI_MODE ? MIN_PS_INT32 : MIN_PS_INT;
104
105	9.54M	for (;; ival = ival * 10 + d) {
106	9.54M	GET_NEXT(c, sp, goto iret);
107	4.88M	if (!IS_DIGIT(d, c))
108	1.78M	break;
109	3.10M	if (WOULD_OVERFLOW(((ps_uint)ival), d, max_ps_int_scan)) {
110	1.86k	if (ival == max_ps_int_scan / 10 && d == (max_ps_int_scan % 10) + 1 && sign < 0) {
111	5	GET_NEXT(c, sp, c = EOFC);
112	5	dval = -(double)min_ps_int_scan;
113	5	if (c == 'e' \|\| c == 'E') {
114	0	exp10 = 0;
115	0	goto fs;
116	5	} else if (c == '.') {
117	0	GET_NEXT(c, sp, c = EOFC);
118	0	exp10 = 0;
119	0	goto fd;
120	5	} else if (!IS_DIGIT(d, c)) {
121	5	ival = min_ps_int_scan;
122	5	break;
123	5	}
124	5	} else
125	1.86k	dval = (double)ival;
126	1.86k	goto l2d;
127	1.86k	}
128	3.10M	}
129	184M	ind: /* We saw a non-digit while accumulating an integer in ival. */
130	184M	switch (c) {
131	1.12M	case '.':
132	1.12M	GET_NEXT(c, sp, c = EOFC);
133	1.12M	goto i2r;
134	45.2M	default:
135	45.2M	*psp = sp;
136	45.2M	code = 1;
137	45.2M	break;
138	1	case EOFC:
139	1	break;
140	577	case 'e':
141	1.69k	case 'E':
142	1.69k	if (sign < 0)
143	306	ival = -ival;
144	1.69k	dval = (double)ival;
145	1.69k	exp10 = 0;
146	1.69k	goto fe;
147	137M	case '#':
148	137M	{
149	137M	const int radix = ival;
150	137M	ps_int uval = 0, imax;
151
152	137M	if (sign \|\| radix < min_radix \|\| radix > max_radix)
153	349	return_error(gs_error_syntaxerror);
154		/* Avoid multiplies for power-of-2 radix. */
155	137M	if (!(radix & (radix - 1))) {
156	137M	int shift;
157
158	137M	switch (radix) {
159	45	case 2:
160	45	shift = 1, imax = MAX_PS_UINT >> 1;
161	45	break;
162	12.1k	case 4:
163	12.1k	shift = 2, imax = MAX_PS_UINT >> 2;
164	12.1k	break;
165	119	case 8:
166	119	shift = 3, imax = MAX_PS_UINT >> 3;
167	119	break;
168	137M	case 16:
169	137M	shift = 4, imax = MAX_PS_UINT >> 4;
170	137M	break;
171	11	case 32:
172	11	shift = 5, imax = MAX_PS_UINT >> 5;
173	11	break;
174	0	default: /* can't happen */
175	0	return_error(gs_error_rangecheck);
176	137M	}
177	655M	for (;; uval = (uval << shift) + d) {
178	655M	GET_NEXT(c, sp, break);
179	586M	d = decoder[c];
180	586M	if (d >= radix) {
181	68.8M	*psp = sp;
182	68.8M	code = 1;
183	68.8M	break;
184	68.8M	}
185	517M	if (uval > imax)
186	1	return_error(gs_error_limitcheck);
187	517M	}
188	137M	} else {
189	339	ps_int irem = MAX_PS_UINT % radix;
190
191	339	imax = MAX_PS_UINT / radix;
192	648	for (;; uval = uval * radix + d) {
193	648	GET_NEXT(c, sp, break);
194	613	d = decoder[c];
195	613	if (d >= radix) {
196	296	*psp = sp;
197	296	code = 1;
198	296	break;
199	296	}
200	317	if (uval >= imax &&
201	317	(uval > imax \|\| d > irem)
202	317	)
203	8	return_error(gs_error_limitcheck);
204	317	}
205	339	}
206	137M	if (scanner_options & SCAN_CPSI_MODE) {
207	0	ps_uint32 int1 = 0;
208	0	int1 \|= (uval & 0xffffffff);
209	0	make_int(pref, (ps_int)((ps_int32)int1));
210	0	}
211	137M	else
212	137M	make_int(pref, uval);
213
214	137M	return code;
215	137M	}
216	184M	}
217	49.9M	iret:
218	49.9M	if (scanner_options & SCAN_CPSI_MODE) {
219	0	make_int(pref, (sign < 0 ? (ps_int32)-ival : (ps_int32)ival));
220	0	}
221	49.9M	else {
222	49.9M	make_int(pref, (sign < 0 ? (ps_int)-ival : (ps_int)ival));
223	49.9M	}
224	49.9M	return code;
225
226		/* Accumulate a double in dval. */
227	1.86k	l2d:
228	1.86k	exp10 = 0;
229	9.25k	for (;;) {
230	9.25k	dval = dval * 10 + d;
231	9.25k	GET_NEXT(c, sp, c = EOFC);
232	9.25k	if (!IS_DIGIT(d, c))
233	1.86k	break;
234	9.25k	}
235	1.86k	switch (c) {
236	29	case '.':
237	29	GET_NEXT(c, sp, c = EOFC);
238	29	exp10 = 0;
239	29	goto fd;
240	1.50k	default:
241	1.50k	*psp = sp;
242	1.50k	code = 1;
243		/* falls through */
244	1.63k	case EOFC:
245	1.63k	if (sign < 0)
246	348	dval = -dval;
247	1.63k	goto rret;
248	15	case 'e':
249	167	case 'E':
250	167	exp10 = 0;
251	167	goto fs;
252	28	case '#':
253	28	return_error(gs_error_syntaxerror);
254	1.86k	}
255
256		/* We saw a '.' while accumulating an integer in ival. */
257	1.13M	i2r:
258	1.13M	exp10 = 0;
259	4.08M	while (IS_DIGIT(d, c) \|\| c == '-') {
260		/*
261		* PostScript gives an error on numbers with a '-' following a '.'
262		* Adobe Acrobat Reader (PDF) apparently doesn't treat this as an
263		* error. Experiments show that the numbers following the '-' are
264		* ignored, so we swallow the fractional part. SCAN_PDF_INV_NUM
265		* enables this compatibility kloodge.
266		*/
267	2.94M	if (c == '-') {
268	33	if ((SCAN_PDF_INV_NUM & scanner_options) == 0)
269	33	break;
270	0	do {
271	0	GET_NEXT(c, sp, c = EOFC);
272	0	} while (IS_DIGIT(d, c));
273	0	break;
274	33	}
275	2.94M	if (WOULD_OVERFLOW(ival, d, max_int)) {
276	682	dval = (double)ival;
277	682	goto fd;
278	682	}
279	2.94M	ival = ival * 10 + d;
280	2.94M	exp10--;
281	2.94M	GET_NEXT(c, sp, c = EOFC);
282	2.94M	}
283	1.13M	if (sign < 0)
284	87.5k	ival = -ival;
285		/* Take a shortcut for the common case */
286	1.13M	if (!(c == 'e' \|\| c == 'E' \|\| exp10 < -NUM_POWERS_10)) { /* Check for trailing garbage */
287	1.13M	if (c != EOFC)
288	962k	*psp = sp, code = 1;
289	1.13M	make_real(pref, ival * neg_powers_10[-exp10]);
290	1.13M	return code;
291	1.13M	}
292	661	dval = (double)ival;
293	661	goto fe;
294
295		/* Now we are accumulating a double in dval. */
296	711	fd:
297	9.96k	while (IS_DIGIT(d, c)) {
298	9.25k	dval = dval * 10 + d;
299	9.25k	exp10--;
300	9.25k	GET_NEXT(c, sp, c = EOFC);
301	9.25k	}
302	878	fs:
303	878	if (sign < 0)
304	86	dval = -dval;
305	3.23k	fe:
306		/* Now dval contains the value, negated if necessary. */
307	3.23k	switch (c) {
308	632	case 'e':
309	1.91k	case 'E':
310	1.91k	{ /* Check for a following exponent. */
311	1.91k	int esign = 0;
312	1.91k	int iexp;
313
314	1.91k	GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
315	1.67k	switch (c) {
316	114	case '-':
317	114	esign = 1;
318		/* fall through */
319	128	case '+':
320	128	GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
321	1.67k	}
322		/* Scan the exponent. We limit it arbitrarily to 999. */
323	1.66k	if (!IS_DIGIT(d, c))
324	618	return_error(gs_error_syntaxerror);
325	1.04k	iexp = d;
326	2.76k	for (;; iexp = iexp * 10 + d) {
327	2.76k	GET_NEXT(c, sp, break);
328	2.56k	if (!IS_DIGIT(d, c)) {
329	847	*psp = sp;
330	847	code = 1;
331	847	break;
332	847	}
333	1.72k	if (iexp > 99)
334	7	return_error(gs_error_limitcheck);
335	1.72k	}
336	1.03k	if (esign)
337	107	exp10 -= iexp;
338	931	else
339	931	exp10 += iexp;
340	1.03k	break;
341	1.04k	}
342	982	default:
343	982	*psp = sp;
344	982	code = 1;
345	1.32k	case EOFC:
346	1.32k	;
347	3.23k	}
348		/* Compute dval * 10^exp10. */
349	2.36k	if (exp10 > 0) {
350	2.09k	while (exp10 > NUM_POWERS_10)
351	1.60k	dval *= powers_10[NUM_POWERS_10],
352	1.60k	exp10 -= NUM_POWERS_10;
353	497	dval *= powers_10[exp10];
354	1.86k	} else if (exp10 < 0) {
355	5.24k	while (exp10 < -NUM_POWERS_10)
356	3.82k	dval /= powers_10[NUM_POWERS_10],
357	3.82k	exp10 += NUM_POWERS_10;
358	1.41k	dval /= powers_10[-exp10];
359	1.41k	}
360		/*
361		* Check for an out-of-range result. Currently we don't check for
362		* absurdly large numbers of digits in the accumulation loops,
363		* but we should.
364		*/
365	2.36k	if (dval >= 0) {
366	2.03k	if (dval > MAX_FLOAT)
367	10	return_error(gs_error_limitcheck);
368	2.03k	} else {
369	330	if (dval < -MAX_FLOAT)
370	3	return_error(gs_error_limitcheck);
371	330	}
372	3.98k	rret:
373	3.98k	make_real(pref, dval);
374	3.98k	return code;
375	2.36k	}