/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:56

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	262M	{
41	262M	const byte *sp = str;
42	262M	#define GET_NEXT(cvar, sp, end_action)\
43	1.05G	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	262M	#define NUM_POWERS_10 6
50	262M	static const float powers_10[NUM_POWERS_10 + 1] = {
51	262M	1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6
52	262M	};
53	262M	static const double neg_powers_10[NUM_POWERS_10 + 1] = {
54	262M	1e0, 1e-1, 1e-2, 1e-3, 1e-4, 1e-5, 1e-6
55	262M	};
56
57	262M	ps_int ival;
58	262M	double dval;
59	262M	int exp10;
60	262M	int code = 0;
61	262M	int c, d;
62	262M	ps_int max_ps_int_scan, min_ps_int_scan;
63	262M	const byte *const decoder = scan_char_decoder;
64	262M	#define IS_DIGIT(d, c)\
65	702M	((d = decoder[c]) < 10)
66	262M	#define WOULD_OVERFLOW(val, d, maxv)\
67	262M	(val >= maxv / 10 && (val > maxv / 10 \|\| d > (int64_t)(maxv % 10)))
68
69	262M	GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
70	262M	if (!IS_DIGIT(d, c)) {
71	52.5M	if (c != '.')
72	76.8k	return_error(gs_error_syntaxerror);
73		/* Might be a number starting with '.'. */
74	52.5M	GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
75	52.5M	if (!IS_DIGIT(d, c))
76	52.4M	return_error(gs_error_syntaxerror);
77	2.98k	ival = 0;
78	2.98k	goto i2r;
79	52.5M	}
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	210M	ival = d;
85	210M	if (end - sp >= 3) { /* just check once */
86	205M	if (!IS_DIGIT(d, (c = *sp))) {
87	43.7M	sp++;
88	43.7M	goto ind;
89	43.7M	}
90	161M	ival = ival * 10 + d;
91	161M	if (!IS_DIGIT(d, (c = sp[1]))) {
92	156M	sp += 2;
93	156M	goto ind;
94	156M	}
95	5.29M	ival = ival * 10 + d;
96	5.29M	sp += 3;
97	5.29M	if (!IS_DIGIT(d, (c = sp[-1])))
98	2.93M	goto ind;
99	2.35M	ival = ival * 10 + d;
100	2.35M	}
101
102	7.23M	max_ps_int_scan = scanner_options & SCAN_CPSI_MODE ? MAX_PS_INT32 : MAX_PS_INT;
103	7.23M	min_ps_int_scan = scanner_options & SCAN_CPSI_MODE ? MIN_PS_INT32 : MIN_PS_INT;
104
105	10.9M	for (;; ival = ival * 10 + d) {
106	10.9M	GET_NEXT(c, sp, goto iret);
107	5.69M	if (!IS_DIGIT(d, c))
108	2.00M	break;
109	3.68M	if (WOULD_OVERFLOW(((ps_uint)ival), d, max_ps_int_scan)) {
110	4.36k	if (ival == max_ps_int_scan / 10 && d == (max_ps_int_scan % 10) + 1 && sign < 0) {
111	253	GET_NEXT(c, sp, c = EOFC);
112	253	dval = -(double)min_ps_int_scan;
113	253	if (c == 'e' \|\| c == 'E') {
114	2	exp10 = 0;
115	2	goto fs;
116	251	} else if (c == '.') {
117	0	GET_NEXT(c, sp, c = EOFC);
118	0	exp10 = 0;
119	0	goto fd;
120	251	} else if (!IS_DIGIT(d, c)) {
121	246	ival = min_ps_int_scan;
122	246	break;
123	246	}
124	253	} else
125	4.11k	dval = (double)ival;
126	4.11k	goto l2d;
127	4.36k	}
128	3.68M	}
129	204M	ind: /* We saw a non-digit while accumulating an integer in ival. */
130	204M	switch (c) {
131	1.26M	case '.':
132	1.26M	GET_NEXT(c, sp, c = EOFC);
133	1.26M	goto i2r;
134	50.7M	default:
135	50.7M	*psp = sp;
136	50.7M	code = 1;
137	50.7M	break;
138	14	case EOFC:
139	14	break;
140	4.47k	case 'e':
141	5.14k	case 'E':
142	5.14k	if (sign < 0)
143	284	ival = -ival;
144	5.14k	dval = (double)ival;
145	5.14k	exp10 = 0;
146	5.14k	goto fe;
147	152M	case '#':
148	152M	{
149	152M	const int radix = ival;
150	152M	ps_int uval = 0, imax;
151
152	152M	if (sign \|\| radix < min_radix \|\| radix > max_radix)
153	462	return_error(gs_error_syntaxerror);
154		/* Avoid multiplies for power-of-2 radix. */
155	152M	if (!(radix & (radix - 1))) {
156	152M	int shift;
157
158	152M	switch (radix) {
159	49	case 2:
160	49	shift = 1, imax = MAX_PS_UINT >> 1;
161	49	break;
162	48	case 4:
163	48	shift = 2, imax = MAX_PS_UINT >> 2;
164	48	break;
165	123	case 8:
166	123	shift = 3, imax = MAX_PS_UINT >> 3;
167	123	break;
168	152M	case 16:
169	152M	shift = 4, imax = MAX_PS_UINT >> 4;
170	152M	break;
171	218	case 32:
172	218	shift = 5, imax = MAX_PS_UINT >> 5;
173	218	break;
174	0	default: /* can't happen */
175	0	return_error(gs_error_rangecheck);
176	152M	}
177	726M	for (;; uval = (uval << shift) + d) {
178	726M	GET_NEXT(c, sp, break);
179	649M	d = decoder[c];
180	649M	if (d >= radix) {
181	76.3M	*psp = sp;
182	76.3M	code = 1;
183	76.3M	break;
184	76.3M	}
185	573M	if (uval > imax)
186	2	return_error(gs_error_limitcheck);
187	573M	}
188	152M	} else {
189	354	ps_int irem = MAX_PS_UINT % radix;
190
191	354	imax = MAX_PS_UINT / radix;
192	1.50k	for (;; uval = uval * radix + d) {
193	1.50k	GET_NEXT(c, sp, break);
194	1.36k	d = decoder[c];
195	1.36k	if (d >= radix) {
196	195	*psp = sp;
197	195	code = 1;
198	195	break;
199	195	}
200	1.16k	if (uval >= imax &&
201	1.16k	(uval > imax \|\| d > irem)
202	1.16k	)
203	18	return_error(gs_error_limitcheck);
204	1.16k	}
205	354	}
206	152M	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	152M	else
212	152M	make_int(pref, uval);
213
214	152M	return code;
215	152M	}
216	204M	}
217	56.0M	iret:
218	56.0M	if (scanner_options & SCAN_CPSI_MODE) {
219	0	make_int(pref, (sign < 0 ? (ps_int32)-ival : (ps_int32)ival));
220	0	}
221	56.0M	else {
222	56.0M	make_int(pref, (sign < 0 ? (ps_int)-ival : (ps_int)ival));
223	56.0M	}
224	56.0M	return code;
225
226		/* Accumulate a double in dval. */
227	4.11k	l2d:
228	4.11k	exp10 = 0;
229	52.5k	for (;;) {
230	52.5k	dval = dval * 10 + d;
231	52.5k	GET_NEXT(c, sp, c = EOFC);
232	52.5k	if (!IS_DIGIT(d, c))
233	4.11k	break;
234	52.5k	}
235	4.11k	switch (c) {
236	76	case '.':
237	76	GET_NEXT(c, sp, c = EOFC);
238	76	exp10 = 0;
239	76	goto fd;
240	3.22k	default:
241	3.22k	*psp = sp;
242	3.22k	code = 1;
243		/* falls through */
244	3.76k	case EOFC:
245	3.76k	if (sign < 0)
246	248	dval = -dval;
247	3.76k	goto rret;
248	168	case 'e':
249	201	case 'E':
250	201	exp10 = 0;
251	201	goto fs;
252	71	case '#':
253	71	return_error(gs_error_syntaxerror);
254	4.11k	}
255
256		/* We saw a '.' while accumulating an integer in ival. */
257	1.27M	i2r:
258	1.27M	exp10 = 0;
259	4.64M	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	3.37M	if (c == '-') {
268	15	if ((SCAN_PDF_INV_NUM & scanner_options) == 0)
269	15	break;
270	0	do {
271	0	GET_NEXT(c, sp, c = EOFC);
272	0	} while (IS_DIGIT(d, c));
273	0	break;
274	15	}
275	3.37M	if (WOULD_OVERFLOW(ival, d, max_int)) {
276	1.03k	dval = (double)ival;
277	1.03k	goto fd;
278	1.03k	}
279	3.37M	ival = ival * 10 + d;
280	3.37M	exp10--;
281	3.37M	GET_NEXT(c, sp, c = EOFC);
282	3.37M	}
283	1.27M	if (sign < 0)
284	100k	ival = -ival;
285		/* Take a shortcut for the common case */
286	1.27M	if (!(c == 'e' \|\| c == 'E' \|\| exp10 < -NUM_POWERS_10)) { /* Check for trailing garbage */
287	1.26M	if (c != EOFC)
288	1.07M	*psp = sp, code = 1;
289	1.26M	make_real(pref, ival * neg_powers_10[-exp10]);
290	1.26M	return code;
291	1.26M	}
292	2.25k	dval = (double)ival;
293	2.25k	goto fe;
294
295		/* Now we are accumulating a double in dval. */
296	1.11k	fd:
297	11.3k	while (IS_DIGIT(d, c)) {
298	10.2k	dval = dval * 10 + d;
299	10.2k	exp10--;
300	10.2k	GET_NEXT(c, sp, c = EOFC);
301	10.2k	}
302	1.31k	fs:
303	1.31k	if (sign < 0)
304	531	dval = -dval;
305	8.71k	fe:
306		/* Now dval contains the value, negated if necessary. */
307	8.71k	switch (c) {
308	6.60k	case 'e':
309	7.63k	case 'E':
310	7.63k	{ /* Check for a following exponent. */
311	7.63k	int esign = 0;
312	7.63k	int iexp;
313
314	7.63k	GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
315	7.25k	switch (c) {
316	1.15k	case '-':
317	1.15k	esign = 1;
318		/* fall through */
319	1.63k	case '+':
320	1.63k	GET_NEXT(c, sp, return_error(gs_error_syntaxerror));
321	7.25k	}
322		/* Scan the exponent. We limit it arbitrarily to 999. */
323	7.11k	if (!IS_DIGIT(d, c))
324	4.30k	return_error(gs_error_syntaxerror);
325	2.81k	iexp = d;
326	4.22k	for (;; iexp = iexp * 10 + d) {
327	4.22k	GET_NEXT(c, sp, break);
328	3.49k	if (!IS_DIGIT(d, c)) {
329	2.07k	*psp = sp;
330	2.07k	code = 1;
331	2.07k	break;
332	2.07k	}
333	1.42k	if (iexp > 99)
334	9	return_error(gs_error_limitcheck);
335	1.42k	}
336	2.80k	if (esign)
337	1.10k	exp10 -= iexp;
338	1.70k	else
339	1.70k	exp10 += iexp;
340	2.80k	break;
341	2.81k	}
342	918	default:
343	918	*psp = sp;
344	918	code = 1;
345	1.08k	case EOFC:
346	1.08k	;
347	8.71k	}
348		/* Compute dval * 10^exp10. */
349	3.89k	if (exp10 > 0) {
350	5.28k	while (exp10 > NUM_POWERS_10)
351	4.07k	dval *= powers_10[NUM_POWERS_10],
352	4.07k	exp10 -= NUM_POWERS_10;
353	1.21k	dval *= powers_10[exp10];
354	2.67k	} else if (exp10 < 0) {
355	32.3k	while (exp10 < -NUM_POWERS_10)
356	29.9k	dval /= powers_10[NUM_POWERS_10],
357	29.9k	exp10 += NUM_POWERS_10;
358	2.36k	dval /= powers_10[-exp10];
359	2.36k	}
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	3.89k	if (dval >= 0) {
366	3.30k	if (dval > MAX_FLOAT)
367	12	return_error(gs_error_limitcheck);
368	3.30k	} else {
369	583	if (dval < -MAX_FLOAT)
370	3	return_error(gs_error_limitcheck);
371	583	}
372	7.64k	rret:
373	7.64k	make_real(pref, dval);
374	7.64k	return code;
375	3.89k	}