quad.h revision 1.3
1/* $OpenBSD: quad.h,v 1.3 1996/04/19 16:09:31 niklas Exp $ */ 2/* $NetBSD: quad.h,v 1.6 1996/03/14 18:52:14 christos 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#include <limits.h> 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 */ 66union 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 101extern u_quad_t __qdivrem __P((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 110typedef unsigned int qshift_t; 111#else 112typedef u_quad_t qshift_t; 113#endif 114 115__BEGIN_DECLS 116quad_t __adddi3 __P((quad_t, quad_t)); 117quad_t __anddi3 __P((quad_t, quad_t)); 118quad_t __ashldi3 __P((quad_t, qshift_t)); 119quad_t __ashrdi3 __P((quad_t, qshift_t)); 120int __cmpdi2 __P((quad_t, quad_t)); 121quad_t __divdi3 __P((quad_t, quad_t)); 122quad_t __iordi3 __P((quad_t, quad_t)); 123quad_t __lshldi3 __P((quad_t, qshift_t)); 124quad_t __lshrdi3 __P((quad_t, qshift_t)); 125quad_t __moddi3 __P((quad_t, quad_t)); 126quad_t __muldi3 __P((quad_t, quad_t)); 127quad_t __negdi2 __P((quad_t)); 128quad_t __one_cmpldi2 __P((quad_t)); 129quad_t __subdi3 __P((quad_t, quad_t)); 130int __ucmpdi2 __P((u_quad_t, u_quad_t)); 131u_quad_t __udivdi3 __P((u_quad_t, u_quad_t)); 132u_quad_t __umoddi3 __P((u_quad_t, u_quad_t)); 133quad_t __xordi3 __P((quad_t, quad_t)); 134__END_DECLS 135