1df8bae1dSRodney W. Grimes /*- 2df8bae1dSRodney W. Grimes * Copyright (c) 1992, 1993 3df8bae1dSRodney W. Grimes * The Regents of the University of California. All rights reserved. 4df8bae1dSRodney W. Grimes * 5df8bae1dSRodney W. Grimes * This software was developed by the Computer Systems Engineering group 6df8bae1dSRodney W. Grimes * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 7df8bae1dSRodney W. Grimes * contributed to Berkeley. 8df8bae1dSRodney W. Grimes * 9df8bae1dSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 10df8bae1dSRodney W. Grimes * modification, are permitted provided that the following conditions 11df8bae1dSRodney W. Grimes * are met: 12df8bae1dSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 13df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 14df8bae1dSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 15df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 16df8bae1dSRodney W. Grimes * documentation and/or other materials provided with the distribution. 17df8bae1dSRodney W. Grimes * 3. All advertising materials mentioning features or use of this software 18df8bae1dSRodney W. Grimes * must display the following acknowledgement: 19df8bae1dSRodney W. Grimes * This product includes software developed by the University of 20df8bae1dSRodney W. Grimes * California, Berkeley and its contributors. 21df8bae1dSRodney W. Grimes * 4. Neither the name of the University nor the names of its contributors 22df8bae1dSRodney W. Grimes * may be used to endorse or promote products derived from this software 23df8bae1dSRodney W. Grimes * without specific prior written permission. 24df8bae1dSRodney W. Grimes * 25df8bae1dSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26df8bae1dSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27df8bae1dSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28df8bae1dSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29df8bae1dSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30df8bae1dSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31df8bae1dSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32df8bae1dSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33df8bae1dSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34df8bae1dSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35df8bae1dSRodney W. Grimes * SUCH DAMAGE. 36df8bae1dSRodney W. Grimes */ 37df8bae1dSRodney W. Grimes 38ab0de15bSDavid E. O'Brien #include <sys/cdefs.h> 39ab0de15bSDavid E. O'Brien __FBSDID("$FreeBSD$"); 40ab0de15bSDavid E. O'Brien 41aab719f0SBenno Rice #include <libkern/quad.h> 42df8bae1dSRodney W. Grimes 43df8bae1dSRodney W. Grimes /* 44df8bae1dSRodney W. Grimes * Shift a (signed) quad value right (arithmetic shift right). 45df8bae1dSRodney W. Grimes */ 46df8bae1dSRodney W. Grimes quad_t 47df8bae1dSRodney W. Grimes __ashrdi3(a, shift) 48df8bae1dSRodney W. Grimes quad_t a; 49df8bae1dSRodney W. Grimes qshift_t shift; 50df8bae1dSRodney W. Grimes { 51df8bae1dSRodney W. Grimes union uu aa; 52df8bae1dSRodney W. Grimes 53df8bae1dSRodney W. Grimes aa.q = a; 54df8bae1dSRodney W. Grimes if (shift >= LONG_BITS) { 55df8bae1dSRodney W. Grimes long s; 56df8bae1dSRodney W. Grimes 57df8bae1dSRodney W. Grimes /* 58df8bae1dSRodney W. Grimes * Smear bits rightward using the machine's right-shift 59df8bae1dSRodney W. Grimes * method, whether that is sign extension or zero fill, 60df8bae1dSRodney W. Grimes * to get the `sign word' s. Note that shifting by 61df8bae1dSRodney W. Grimes * LONG_BITS is undefined, so we shift (LONG_BITS-1), 62df8bae1dSRodney W. Grimes * then 1 more, to get our answer. 63df8bae1dSRodney W. Grimes */ 64df8bae1dSRodney W. Grimes s = (aa.sl[H] >> (LONG_BITS - 1)) >> 1; 65df8bae1dSRodney W. Grimes aa.ul[L] = shift >= QUAD_BITS ? s : 66df8bae1dSRodney W. Grimes aa.sl[H] >> (shift - LONG_BITS); 67df8bae1dSRodney W. Grimes aa.ul[H] = s; 68df8bae1dSRodney W. Grimes } else if (shift > 0) { 69df8bae1dSRodney W. Grimes aa.ul[L] = (aa.ul[L] >> shift) | 70df8bae1dSRodney W. Grimes (aa.ul[H] << (LONG_BITS - shift)); 71df8bae1dSRodney W. Grimes aa.sl[H] >>= shift; 72df8bae1dSRodney W. Grimes } 73df8bae1dSRodney W. Grimes return (aa.q); 74df8bae1dSRodney W. Grimes } 75