common/lib/libc/quad/quad.h

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