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