/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 07:26

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