xref: /titanic_51/usr/src/lib/libc/port/fp/quadint.h (revision a31148363f598def767ac48c5d82e1572e44b935)
1 /*
2  * Copyright (c) 1992, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * This software was developed by the Computer Systems Engineering group
6  * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
7  * contributed to Berkeley.
8  *
9  * Redistribution and use in source and binary forms, with or without
10  * modification, are permitted provided that the following conditions
11  * are met:
12  * 1. Redistributions of source code must retain the above copyright
13  *    notice, this list of conditions and the following disclaimer.
14  * 2. Redistributions in binary form must reproduce the above copyright
15  *    notice, this list of conditions and the following disclaimer in the
16  *    documentation and/or other materials provided with the distribution.
17  * 3. All advertising materials mentioning features or use of this software
18  *    must display the following acknowledgement:
19  *	This product includes software developed by the University of
20  *	California, Berkeley and its contributors.
21  * 4. Neither the name of the University nor the names of its contributors
22  *    may be used to endorse or promote products derived from this software
23  *    without specific prior written permission.
24  *
25  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35  * SUCH DAMAGE.
36  *
37  *	@(#)quad.h	8.1 (Berkeley) 6/4/93
38  */
39 
40 /*
41  * Quad arithmetic.
42  *
43  * This library makes the following assumptions:
44  *
45  *  - The type long long aka longlong_t exists.
46  *
47  *  - A quad variable is exactly twice as long as `long'.
48  *
49  *  - The machine's arithmetic is two's complement.
50  *
51  * This library can provide 128-bit arithmetic on a machine with 128-bit
52  * quads and 64-bit longs, for instance, or 96-bit arithmetic on machines
53  * with 48-bit longs.
54  */
55 
56 #ifndef __QUADINT_H
57 #define	__QUADINT_H
58 
59 #pragma ident	"%Z%%M%	%I%	%E% SMI"
60 
61 #include <sys/isa_defs.h>
62 #include <sys/types.h>
63 #include <limits.h>
64 
65 #ifdef __cplusplus
66 extern "C" {
67 #endif
68 
69 /*
70  * Define the order of 32-bit words in 64-bit words.
71  */
72 #ifdef _LONG_LONG_LTOH
73 #define	_QUAD_HIGHWORD 1
74 #define	_QUAD_LOWWORD 0
75 #else
76 #define	_QUAD_HIGHWORD 0
77 #define	_QUAD_LOWWORD 1
78 #endif
79 
80 /*
81  * Depending on the desired operation, we view a `long long' in
82  * one or more of the following formats.
83  */
84 union uu {
85 	longlong_t	q;		/* as a (signed) quad */
86 	u_longlong_t	uq;		/* as an unsigned quad */
87 	long		sl[2];		/* as two signed longs */
88 	ulong_t		ul[2];		/* as two unsigned longs */
89 };
90 
91 /*
92  * Define high and low longwords.
93  */
94 #define	H		_QUAD_HIGHWORD
95 #define	L		_QUAD_LOWWORD
96 
97 /*
98  * Total number of bits in a longlong_t and in the pieces that make it up.
99  * These are used for shifting, and also below for halfword extraction
100  * and assembly.
101  */
102 #define	QUAD_BITS	(sizeof (u_longlong_t) * CHAR_BIT)
103 #define	LONG_BITS	(sizeof (long) * CHAR_BIT)
104 #define	HALF_BITS	(sizeof (long) * CHAR_BIT / 2)
105 
106 /*
107  * Extract high and low shortwords from longword, and move low shortword of
108  * longword to upper half of long, i.e., produce the upper longword of
109  * ((longlong_t)(x) << (number_of_bits_in_long/2)).
110  * (`x' must actually be ulong_t.)
111  *
112  * These are used in the multiply code, to split a longword into upper
113  * and lower halves, and to reassemble a product as a longlong_t, shifted left
114  * (sizeof(long)*CHAR_BIT/2).
115  */
116 #define	HHALF(x)	((x) >> HALF_BITS)
117 #define	LHALF(x)	((x) & ((1 << HALF_BITS) - 1))
118 #define	LHUP(x)		((x) << HALF_BITS)
119 
120 longlong_t	___divdi3(longlong_t a, longlong_t b);
121 longlong_t	___moddi3(longlong_t a, longlong_t b);
122 u_longlong_t	___qdivrem(u_longlong_t u, u_longlong_t v, u_longlong_t *rem);
123 u_longlong_t	___udivdi3(u_longlong_t a, u_longlong_t b);
124 u_longlong_t	___umoddi3(u_longlong_t a, u_longlong_t b);
125 
126 typedef unsigned int	qshift_t;
127 
128 #ifdef __cplusplus
129 }
130 #endif
131 
132 #endif	/* !__QUADINT_H */
133