9838b7032e
This is strictly the application of the script 'x-indent-all.sh' from util/modular. Compared to the patch that Daniel posted in January, I've added a few indent flags: -bap -psl -T PrivatePtr -T pmWait -T _XFUNCPROTOBEGIN -T _XFUNCPROTOEND -T _X_EXPORT The typedefs were needed to make the output of sdksyms.sh match the previous output, otherwise, the code is formatted badly enough that sdksyms.sh generates incorrect output. The generated code was compared with the previous version and found to be essentially identical -- "assert" line numbers and BUILD_TIME were the only differences found. The comparison was done with this script: dir1=$1 dir2=$2 for dir in $dir1 $dir2; do (cd $dir && find . -name '*.o' | while read file; do dir=`dirname $file` base=`basename $file .o` dump=$dir/$base.dump objdump -d $file > $dump done) done find $dir1 -name '*.dump' | while read dump; do otherdump=`echo $dump | sed "s;$dir1;$dir2;"` diff -u $dump $otherdump done Signed-off-by: Keith Packard <keithp@keithp.com> Acked-by: Daniel Stone <daniel@fooishbar.org> Acked-by: Alan Coopersmith <alan.coopersmith@oracle.com>
127 lines
4.2 KiB
C
127 lines
4.2 KiB
C
|
|
#ifdef HAVE_XORG_CONFIG_H
|
|
#include <xorg-config.h>
|
|
#endif
|
|
|
|
#include <X11/Xarch.h>
|
|
|
|
#ifndef FIXEDBASE
|
|
#define CHECKRETURN(b) if(width <= ((b) * 32)) return(base + (b))
|
|
#else
|
|
#define CHECKRETURN(b) if(width <= ((b) * 32)) return(base)
|
|
#endif
|
|
|
|
#if X_BYTE_ORDER == X_BIG_ENDIAN
|
|
#define SHIFT_L(value, shift) ((value) >> (shift))
|
|
#define SHIFT_R(value, shift) ((value) << (shift))
|
|
#else
|
|
#define SHIFT_L(value, shift) ((value) << (shift))
|
|
#define SHIFT_R(value, shift) ((value) >> (shift))
|
|
#endif
|
|
|
|
#ifndef MSBFIRST
|
|
#ifdef FIXEDBASE
|
|
#define WRITE_IN_BITORDER(dest, offset, data) *(dest) = data;
|
|
#else
|
|
#define WRITE_IN_BITORDER(dest, offset, data) *(dest + offset) = data;
|
|
#endif
|
|
#else
|
|
#ifdef FIXEDBASE
|
|
#define WRITE_IN_BITORDER(dest, offset, data) *(dest) = SWAP_BITS_IN_BYTES(data);
|
|
#else
|
|
#define WRITE_IN_BITORDER(dest, offset, data) *(dest + offset) = SWAP_BITS_IN_BYTES(data)
|
|
#endif
|
|
#endif
|
|
|
|
#ifdef FIXEDBASE
|
|
#ifdef MSBFIRST
|
|
#define WRITE_BITS(b) *base = SWAP_BITS_IN_BYTES(b)
|
|
#define WRITE_BITS1(b) { \
|
|
*base = byte_reversed_expand3[(b) & 0xFF] | \
|
|
byte_reversed_expand3[((b) & 0xFF00) >> 8] << 24; }
|
|
#define WRITE_BITS2(b) { \
|
|
*base = byte_reversed_expand3[(b) & 0xFF] | \
|
|
byte_reversed_expand3[((b) & 0xFF00) >> 8] << 24; \
|
|
*base = byte_reversed_expand3[((b) & 0xFF00) >> 8] >> 8 | \
|
|
byte_reversed_expand3[((b) & 0xFF0000) >> 16] << 16; }
|
|
#define WRITE_BITS3(b) { \
|
|
*base = byte_reversed_expand3[(b) & 0xFF] | \
|
|
byte_reversed_expand3[((b) & 0xFF00) >> 8] << 24; \
|
|
*base = byte_reversed_expand3[((b) & 0xFF00) >> 8] >> 8 | \
|
|
byte_reversed_expand3[((b) & 0xFF0000) >> 16] << 16; \
|
|
*base = byte_reversed_expand3[((b) & 0xFF0000) >> 16] >> 16 | \
|
|
byte_reversed_expand3[((b) & 0xFF000000) >> 24] << 8; }
|
|
#else
|
|
#define WRITE_BITS(b) *base = (b)
|
|
#define WRITE_BITS1(b) { \
|
|
*base = byte_expand3[(b) & 0xFF] | \
|
|
byte_expand3[((b) & 0xFF00) >> 8] << 24; }
|
|
#define WRITE_BITS2(b) { \
|
|
*base = byte_expand3[(b) & 0xFF] | \
|
|
byte_expand3[((b) & 0xFF00) >> 8] << 24; \
|
|
*base = byte_expand3[((b) & 0xFF00) >> 8] >> 8 | \
|
|
byte_expand3[((b) & 0xFF0000) >> 16] << 16; }
|
|
#define WRITE_BITS3(b) { \
|
|
*base = byte_expand3[(b) & 0xFF] | \
|
|
byte_expand3[((b) & 0xFF00) >> 8] << 24; \
|
|
*base = byte_expand3[((b) & 0xFF00) >> 8] >> 8 | \
|
|
byte_expand3[((b) & 0xFF0000) >> 16] << 16; \
|
|
*base = byte_expand3[((b) & 0xFF0000) >> 16] >> 16 | \
|
|
byte_expand3[((b) & 0xFF000000) >> 24] << 8; }
|
|
#endif
|
|
#else
|
|
#ifdef MSBFIRST
|
|
#define WRITE_BITS(b) *(base++) = SWAP_BITS_IN_BYTES(b)
|
|
#define WRITE_BITS1(b) { \
|
|
*(base++) = byte_reversed_expand3[(b) & 0xFF] | \
|
|
byte_reversed_expand3[((b) & 0xFF00) >> 8] << 24; }
|
|
#define WRITE_BITS2(b) { \
|
|
*(base) = byte_reversed_expand3[(b) & 0xFF] | \
|
|
byte_reversed_expand3[((b) & 0xFF00) >> 8] << 24; \
|
|
*(base + 1) = byte_reversed_expand3[((b) & 0xFF00) >> 8] >> 8 | \
|
|
byte_reversed_expand3[((b) & 0xFF0000) >> 16] << 16; \
|
|
base += 2; }
|
|
#define WRITE_BITS3(b) { \
|
|
*(base) = byte_reversed_expand3[(b) & 0xFF] | \
|
|
byte_reversed_expand3[((b) & 0xFF00) >> 8] << 24; \
|
|
*(base + 1) = byte_reversed_expand3[((b) & 0xFF00) >> 8] >> 8 | \
|
|
byte_reversed_expand3[((b) & 0xFF0000) >> 16] << 16; \
|
|
*(base + 2) = byte_reversed_expand3[((b) & 0xFF0000) >> 16] >> 16 | \
|
|
byte_reversed_expand3[((b) & 0xFF000000) >> 24] << 8; \
|
|
base += 3; }
|
|
#else
|
|
#define WRITE_BITS(b) *(base++) = (b)
|
|
#define WRITE_BITS1(b) { \
|
|
*(base++) = byte_expand3[(b) & 0xFF] | \
|
|
byte_expand3[((b) & 0xFF00) >> 8] << 24; }
|
|
#define WRITE_BITS2(b) { \
|
|
*(base) = byte_expand3[(b) & 0xFF] | \
|
|
byte_expand3[((b) & 0xFF00) >> 8] << 24; \
|
|
*(base + 1) = byte_expand3[((b) & 0xFF00) >> 8] >> 8 | \
|
|
byte_expand3[((b) & 0xFF0000) >> 16] << 16; \
|
|
base += 2; }
|
|
#define WRITE_BITS3(b) { \
|
|
*(base) = byte_expand3[(b) & 0xFF] | \
|
|
byte_expand3[((b) & 0xFF00) >> 8] << 24; \
|
|
*(base + 1) = byte_expand3[((b) & 0xFF00) >> 8] >> 8 | \
|
|
byte_expand3[((b) & 0xFF0000) >> 16] << 16; \
|
|
*(base + 2) = byte_expand3[((b) & 0xFF0000) >> 16] >> 16 | \
|
|
byte_expand3[((b) & 0xFF000000) >> 24] << 8; \
|
|
base += 3; }
|
|
#endif
|
|
#endif
|
|
|
|
#ifdef FIXEDBASE
|
|
#ifdef MSBFIRST
|
|
#define EXPNAME(x) x##MSBFirstFixedBase
|
|
#else
|
|
#define EXPNAME(x) x##LSBFirstFixedBase
|
|
#endif
|
|
#else
|
|
#ifdef MSBFIRST
|
|
#define EXPNAME(x) x##MSBFirst
|
|
#else
|
|
#define EXPNAME(x) x##LSBFirst
|
|
#endif
|
|
#endif
|