45d426a34e
mips32r2 and mips64r2 (and close relatives) processors. There presently is support for ADMtek ADM5120, A mips 4Kc in a malta board, the RB533 routerboard (based on IDT RC32434) and some preliminary support for sibtye/broadcom designs. Other hardware support will be forthcomcing. This port boots multiuser under gxemul emulating the malta board and also bootstraps on the hardware whose support is forthcoming... Oleksandr Tymoshenko, Wojciech Koszek, Warner Losh, Olivier Houchard, Randall Stewert and others that have contributed to the mips2 and/or mips2-jnpr perforce branches. Juniper contirbuted a generic mips port late in the life cycle of the misp2 branch. Warner Losh merged the mips2 and Juniper code bases, and others list above have worked for the past several months to get to multiuser. In addition, the mips2 work owe a debt to the trail blazing efforts of the original mips branch in perforce done by Juli Mallett.
147 lines
4.5 KiB
C
147 lines
4.5 KiB
C
/*-
|
|
* Copyright (c) 1987, 1991 Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)endian.h 7.8 (Berkeley) 4/3/91
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _MACHINE_ENDIAN_H_
|
|
#define _MACHINE_ENDIAN_H_
|
|
|
|
#include <sys/cdefs.h>
|
|
#ifndef __ASSEMBLER__
|
|
#include <sys/_types.h>
|
|
#endif
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
/*
|
|
* Definitions for byte order, according to byte significance from low
|
|
* address to high.
|
|
*/
|
|
#define _LITTLE_ENDIAN 1234 /* LSB first: i386, vax */
|
|
#define _BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */
|
|
#define _PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */
|
|
|
|
#ifdef __MIPSEB__
|
|
#define _BYTE_ORDER _BIG_ENDIAN
|
|
#else
|
|
#define _BYTE_ORDER _LITTLE_ENDIAN
|
|
#endif /* __MIBSEB__ */
|
|
|
|
/*
|
|
* Deprecated variants that don't have enough underscores to be useful in more
|
|
* strict namespaces.
|
|
*/
|
|
#if __BSD_VISIBLE
|
|
#define LITTLE_ENDIAN _LITTLE_ENDIAN
|
|
#define BIG_ENDIAN _BIG_ENDIAN
|
|
#define PDP_ENDIAN _PDP_ENDIAN
|
|
#define BYTE_ORDER _BYTE_ORDER
|
|
#endif
|
|
|
|
#ifndef __ASSEMBLER__
|
|
#if defined(__GNUCLIKE_BUILTIN_CONSTANT_P) && defined(__OPTIMIZE__)
|
|
#define __is_constant(x) __builtin_constant_p(x)
|
|
#else
|
|
#define __is_constant(x) 0
|
|
#endif
|
|
|
|
#define __bswap16_const(x) (((x) >> 8) | (((x) << 8) & 0xff00))
|
|
#define __bswap32_const(x) (((x) >> 24) | (((x) >> 8) & 0xff00) | \
|
|
(((x) << 8) & 0xff0000) | (((x) << 24) & 0xff000000))
|
|
#define __bswap64_const(x) (((x) >> 56) | (((x) >> 40) & 0xff00) | \
|
|
(((x) >> 24) & 0xff0000) | (((x) >> 8) & 0xff000000) | \
|
|
(((x) << 8) & ((__uint64_t)0xff << 32)) | \
|
|
(((x) << 24) & ((__uint64_t)0xff << 40)) | \
|
|
(((x) << 40) & ((__uint64_t)0xff << 48)) | (((x) << 56)))
|
|
|
|
static __inline __uint16_t
|
|
__bswap16_var(__uint16_t _x)
|
|
{
|
|
|
|
return ((_x >> 8) | ((_x << 8) & 0xff00));
|
|
}
|
|
|
|
static __inline __uint32_t
|
|
__bswap32_var(__uint32_t _x)
|
|
{
|
|
|
|
return ((_x >> 24) | ((_x >> 8) & 0xff00) | ((_x << 8) & 0xff0000) |
|
|
((_x << 24) & 0xff000000));
|
|
}
|
|
|
|
static __inline __uint64_t
|
|
__bswap64_var(__uint64_t _x)
|
|
{
|
|
|
|
return ((_x >> 56) | ((_x >> 40) & 0xff00) | ((_x >> 24) & 0xff0000) |
|
|
((_x >> 8) & 0xff000000) | ((_x << 8) & ((__uint64_t)0xff << 32)) |
|
|
((_x << 24) & ((__uint64_t)0xff << 40)) |
|
|
((_x << 40) & ((__uint64_t)0xff << 48)) | ((_x << 56)));
|
|
}
|
|
|
|
#define __bswap16(x) (__uint16_t)(__is_constant(x) ? __bswap16_const(x) : \
|
|
__bswap16_var(x))
|
|
#define __bswap32(x) (__uint32_t)(__is_constant(x) ? __bswap32_const(x) : \
|
|
__bswap32_var(x))
|
|
#define __bswap64(x) (__uint64_t)(__is_constant(x) ? __bswap64_const(x) : \
|
|
__bswap64_var(x))
|
|
|
|
#ifdef __MIPSEB__
|
|
#define __htonl(x) ((__uint32_t)(x))
|
|
#define __htons(x) ((__uint16_t)(x))
|
|
#define __ntohl(x) ((__uint32_t)(x))
|
|
#define __ntohs(x) ((__uint16_t)(x))
|
|
/*
|
|
* Define the order of 32-bit words in 64-bit words.
|
|
*/
|
|
/*
|
|
* XXXMIPS: Additional parentheses to make gcc more happy.
|
|
*/
|
|
#define _QUAD_HIGHWORD 0
|
|
#define _QUAD_LOWWORD 1
|
|
#else
|
|
#define _QUAD_HIGHWORD 1
|
|
#define _QUAD_LOWWORD 0
|
|
#define __ntohl(x) (__bswap32((x)))
|
|
#define __ntohs(x) (__bswap16((x)))
|
|
#define __htonl(x) (__bswap32((x)))
|
|
#define __htons(x) (__bswap16((x)))
|
|
#endif /* _MIPSEB */
|
|
|
|
#endif /* _ASSEMBLER_ */
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif /* !_MACHINE_ENDIAN_H_ */
|