xref: /onnv-gate/usr/src/lib/libbc/libc/gen/common/sparc/base_conv.c (revision 0:68f95e015346)
1*0Sstevel@tonic-gate /*
2*0Sstevel@tonic-gate  * CDDL HEADER START
3*0Sstevel@tonic-gate  *
4*0Sstevel@tonic-gate  * The contents of this file are subject to the terms of the
5*0Sstevel@tonic-gate  * Common Development and Distribution License, Version 1.0 only
6*0Sstevel@tonic-gate  * (the "License").  You may not use this file except in compliance
7*0Sstevel@tonic-gate  * with the License.
8*0Sstevel@tonic-gate  *
9*0Sstevel@tonic-gate  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*0Sstevel@tonic-gate  * or http://www.opensolaris.org/os/licensing.
11*0Sstevel@tonic-gate  * See the License for the specific language governing permissions
12*0Sstevel@tonic-gate  * and limitations under the License.
13*0Sstevel@tonic-gate  *
14*0Sstevel@tonic-gate  * When distributing Covered Code, include this CDDL HEADER in each
15*0Sstevel@tonic-gate  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*0Sstevel@tonic-gate  * If applicable, add the following below this CDDL HEADER, with the
17*0Sstevel@tonic-gate  * fields enclosed by brackets "[]" replaced with your own identifying
18*0Sstevel@tonic-gate  * information: Portions Copyright [yyyy] [name of copyright owner]
19*0Sstevel@tonic-gate  *
20*0Sstevel@tonic-gate  * CDDL HEADER END
21*0Sstevel@tonic-gate  */
22*0Sstevel@tonic-gate #pragma ident	"%Z%%M%	%I%	%E% SMI"
23*0Sstevel@tonic-gate 
24*0Sstevel@tonic-gate /*
25*0Sstevel@tonic-gate  * Copyright (c) 1986 by Sun Microsystems, Inc.
26*0Sstevel@tonic-gate  */
27*0Sstevel@tonic-gate 
28*0Sstevel@tonic-gate /*
29*0Sstevel@tonic-gate  * Machine-independent versions of base conversion primitives.
30*0Sstevel@tonic-gate  * Routines to multiply buffers by 2**16 or 10**4. Base 10**4 buffers have
31*0Sstevel@tonic-gate  * b[i] < 10000, carry in and out < 65536. Base 2**16 buffers have b[i] <
32*0Sstevel@tonic-gate  * 65536, carry in and out < 10000. If n is positive, b[0]..b[n-1] are
33*0Sstevel@tonic-gate  * processed; if n is negative, b[0]..b[n+1] are processed.
34*0Sstevel@tonic-gate  */
35*0Sstevel@tonic-gate 
36*0Sstevel@tonic-gate void
_fourdigits(t,d)37*0Sstevel@tonic-gate _fourdigits(t, d)
38*0Sstevel@tonic-gate 	unsigned        t;
39*0Sstevel@tonic-gate 	char            d[4];
40*0Sstevel@tonic-gate 
41*0Sstevel@tonic-gate /* Converts t < 10000 into four ascii digits at *pc.	 */
42*0Sstevel@tonic-gate 
43*0Sstevel@tonic-gate {
44*0Sstevel@tonic-gate 	register short  i;
45*0Sstevel@tonic-gate 
46*0Sstevel@tonic-gate 	i = 3;
47*0Sstevel@tonic-gate 	do {
48*0Sstevel@tonic-gate 		d[i] = '0' + t % 10;
49*0Sstevel@tonic-gate 		t = t / 10;
50*0Sstevel@tonic-gate 	}
51*0Sstevel@tonic-gate 	while (--i != -1);
52*0Sstevel@tonic-gate }
53*0Sstevel@tonic-gate 
54*0Sstevel@tonic-gate unsigned
_quorem10000(u,pr)55*0Sstevel@tonic-gate _quorem10000(u, pr)
56*0Sstevel@tonic-gate 	unsigned        u;
57*0Sstevel@tonic-gate 	unsigned       *pr;
58*0Sstevel@tonic-gate {
59*0Sstevel@tonic-gate 	*pr = u % 10000;
60*0Sstevel@tonic-gate 	return (u / 10000);
61*0Sstevel@tonic-gate }
62*0Sstevel@tonic-gate 
63*0Sstevel@tonic-gate void
_mul_10000(b,n,c)64*0Sstevel@tonic-gate _mul_10000(b, n, c)
65*0Sstevel@tonic-gate 	unsigned       *b;
66*0Sstevel@tonic-gate 	int             n;
67*0Sstevel@tonic-gate 	unsigned       *c;
68*0Sstevel@tonic-gate {
69*0Sstevel@tonic-gate 	/* Multiply base-2**16 buffer by 10000. */
70*0Sstevel@tonic-gate 
71*0Sstevel@tonic-gate 	register unsigned carry, t;
72*0Sstevel@tonic-gate 	register short int i;
73*0Sstevel@tonic-gate 	register unsigned *pb;
74*0Sstevel@tonic-gate 
75*0Sstevel@tonic-gate 	carry = *c;
76*0Sstevel@tonic-gate 	pb = b;
77*0Sstevel@tonic-gate 	if ((i = n) > 0) {
78*0Sstevel@tonic-gate 		i--;
79*0Sstevel@tonic-gate 		do {
80*0Sstevel@tonic-gate 			*pb = (t = (*pb * 10000) + carry) & 0xffff;
81*0Sstevel@tonic-gate 			pb++;
82*0Sstevel@tonic-gate 			carry = t >> 16;
83*0Sstevel@tonic-gate 		}
84*0Sstevel@tonic-gate 		while (--i != -1);
85*0Sstevel@tonic-gate 	} else {
86*0Sstevel@tonic-gate 		i = -i - 1;
87*0Sstevel@tonic-gate 		do {
88*0Sstevel@tonic-gate 			*pb = (t = (*pb * 10000) + carry) & 0xffff;
89*0Sstevel@tonic-gate 			pb--;
90*0Sstevel@tonic-gate 			carry = t >> 16;
91*0Sstevel@tonic-gate 		}
92*0Sstevel@tonic-gate 		while (--i != -1);
93*0Sstevel@tonic-gate 	}
94*0Sstevel@tonic-gate 	*c = carry;
95*0Sstevel@tonic-gate }
96*0Sstevel@tonic-gate 
97*0Sstevel@tonic-gate void
_mul_65536(b,n,c)98*0Sstevel@tonic-gate _mul_65536(b, n, c)
99*0Sstevel@tonic-gate 	unsigned       *b;
100*0Sstevel@tonic-gate 	int             n;
101*0Sstevel@tonic-gate 	unsigned       *c;
102*0Sstevel@tonic-gate {
103*0Sstevel@tonic-gate 	/* Multiply base-10**4 buffer by 65536. */
104*0Sstevel@tonic-gate 
105*0Sstevel@tonic-gate 	register unsigned carry, t;
106*0Sstevel@tonic-gate 	register short int i;
107*0Sstevel@tonic-gate 	register unsigned *pb;
108*0Sstevel@tonic-gate 
109*0Sstevel@tonic-gate 	carry = *c;
110*0Sstevel@tonic-gate 	pb = b;
111*0Sstevel@tonic-gate 	if ((i = n) > 0) {
112*0Sstevel@tonic-gate 		i--;
113*0Sstevel@tonic-gate 		do {
114*0Sstevel@tonic-gate 			*pb = (t = (*pb << 16) | carry) % 10000;
115*0Sstevel@tonic-gate 			pb++;
116*0Sstevel@tonic-gate 			carry = t / 10000;
117*0Sstevel@tonic-gate 		}
118*0Sstevel@tonic-gate 		while (--i != -1);
119*0Sstevel@tonic-gate 	} else {
120*0Sstevel@tonic-gate 		i = -i - 1;
121*0Sstevel@tonic-gate 		do {
122*0Sstevel@tonic-gate 			*pb = (t = (*pb << 16) | carry) % 10000;
123*0Sstevel@tonic-gate 			pb--;
124*0Sstevel@tonic-gate 			carry = t / 10000;
125*0Sstevel@tonic-gate 		}
126*0Sstevel@tonic-gate 		while (--i != -1);
127*0Sstevel@tonic-gate 	}
128*0Sstevel@tonic-gate 	*c = carry;
129*0Sstevel@tonic-gate }
130