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