2012-05-28 13:03:47 +10:00
# ifndef _ASM_WORD_AT_A_TIME_H
# define _ASM_WORD_AT_A_TIME_H
/*
* Word - at - a - time interfaces for PowerPC .
*/
# include <linux/kernel.h>
# include <asm/asm-compat.h>
2016-10-13 16:42:53 +11:00
# include <asm/ppc_asm.h>
2012-05-28 13:03:47 +10:00
2013-09-23 12:04:41 +10:00
# ifdef __BIG_ENDIAN__
2012-05-28 13:03:47 +10:00
struct word_at_a_time {
const unsigned long high_bits , low_bits ;
} ;
# define WORD_AT_A_TIME_CONSTANTS { REPEAT_BYTE(0xfe) + 1, REPEAT_BYTE(0x7f) }
/* Bit set in the bytes that have a zero */
static inline long prep_zero_mask ( unsigned long val , unsigned long rhs , const struct word_at_a_time * c )
{
unsigned long mask = ( val & c - > low_bits ) + c - > low_bits ;
return ~ ( mask | rhs ) ;
}
# define create_zero_mask(mask) (mask)
static inline long find_zero ( unsigned long mask )
{
long leading_zero_bits ;
asm ( PPC_CNTLZL " %0,%1 " : " =r " ( leading_zero_bits ) : " r " ( mask ) ) ;
return leading_zero_bits > > 3 ;
}
static inline bool has_zero ( unsigned long val , unsigned long * data , const struct word_at_a_time * c )
{
unsigned long rhs = val | c - > low_bits ;
* data = rhs ;
return ( val + c - > high_bits ) & ~ rhs ;
}
2015-10-07 09:29:11 -04:00
static inline unsigned long zero_bytemask ( unsigned long mask )
{
return ~ 1ul < < __fls ( mask ) ;
}
2013-09-23 12:04:41 +10:00
# else
2014-09-19 09:40:20 +10:00
# ifdef CONFIG_64BIT
/* unused */
2013-09-23 12:04:41 +10:00
struct word_at_a_time {
} ;
2014-09-19 09:40:20 +10:00
# define WORD_AT_A_TIME_CONSTANTS { }
2013-09-23 12:04:41 +10:00
2014-09-19 09:40:20 +10:00
/* This will give us 0xff for a NULL char and 0x00 elsewhere */
static inline unsigned long has_zero ( unsigned long a , unsigned long * bits , const struct word_at_a_time * c )
{
unsigned long ret ;
unsigned long zero = 0 ;
2013-09-23 12:04:41 +10:00
2014-09-19 09:40:20 +10:00
asm ( " cmpb %0,%1,%2 " : " =r " ( ret ) : " r " ( a ) , " r " ( zero ) ) ;
* bits = ret ;
2013-09-26 08:30:09 +02:00
2014-09-19 09:40:20 +10:00
return ret ;
}
static inline unsigned long prep_zero_mask ( unsigned long a , unsigned long bits , const struct word_at_a_time * c )
{
return bits ;
}
/* Alan Modra's little-endian strlen tail for 64-bit */
static inline unsigned long create_zero_mask ( unsigned long bits )
2013-09-23 12:04:41 +10:00
{
2013-09-26 08:30:09 +02:00
unsigned long leading_zero_bits ;
long trailing_zero_bit_mask ;
2014-09-19 09:40:20 +10:00
asm ( " addi %1,%2,-1 \n \t "
" andc %1,%1,%2 \n \t "
" popcntd %0,%1 "
: " =r " ( leading_zero_bits ) , " =&r " ( trailing_zero_bit_mask )
powerpc: Fix bad inline asm constraint in create_zero_mask()
In create_zero_mask() we have:
addi %1,%2,-1
andc %1,%1,%2
popcntd %0,%1
using the "r" constraint for %2. r0 is a valid register in the "r" set,
but addi X,r0,X turns it into an li:
li r7,-1
andc r7,r7,r0
popcntd r4,r7
Fix this by using the "b" constraint, for which r0 is not a valid
register.
This was found with a kernel build using gcc trunk, narrowed down to
when -frename-registers was enabled at -O2. It is just luck however
that we aren't seeing this on older toolchains.
Thanks to Segher for working with me to find this issue.
Cc: stable@vger.kernel.org
Fixes: d0cebfa650a0 ("powerpc: word-at-a-time optimization for 64-bit Little Endian")
Signed-off-by: Anton Blanchard <anton@samba.org>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2016-04-30 08:29:27 +10:00
: " b " ( bits ) ) ;
2014-09-19 09:40:20 +10:00
return leading_zero_bits ;
}
static inline unsigned long find_zero ( unsigned long mask )
{
return mask > > 3 ;
}
/* This assumes that we never ask for an all 1s bitmask */
static inline unsigned long zero_bytemask ( unsigned long mask )
{
return ( 1UL < < mask ) - 1 ;
2013-09-23 12:04:41 +10:00
}
# else /* 32-bit case */
2014-09-19 09:40:20 +10:00
struct word_at_a_time {
const unsigned long one_bits , high_bits ;
} ;
# define WORD_AT_A_TIME_CONSTANTS { REPEAT_BYTE(0x01), REPEAT_BYTE(0x80) }
2013-09-26 08:30:09 +02:00
/*
* This is largely generic for little - endian machines , but the
* optimal byte mask counting is probably going to be something
* that is architecture - specific . If you have a reliably fast
* bit count instruction , that might be better than the multiply
* and shift , for example .
*/
2013-09-23 12:04:41 +10:00
/* Carl Chatfield / Jan Achrenius G+ version for 32-bit */
static inline long count_masked_bytes ( long mask )
{
/* (000000 0000ff 00ffff ffffff) -> ( 1 1 2 3 ) */
long a = ( 0x0ff0001 + mask ) > > 23 ;
/* Fix the 1 for 00 case */
return a & mask ;
}
2013-09-26 08:30:09 +02:00
static inline unsigned long create_zero_mask ( unsigned long bits )
{
bits = ( bits - 1 ) & ~ bits ;
return bits > > 7 ;
}
static inline unsigned long find_zero ( unsigned long mask )
{
return count_masked_bytes ( mask ) ;
}
2013-09-23 12:04:41 +10:00
/* Return nonzero if it has a zero */
static inline unsigned long has_zero ( unsigned long a , unsigned long * bits , const struct word_at_a_time * c )
{
unsigned long mask = ( ( a - c - > one_bits ) & ~ a ) & c - > high_bits ;
* bits = mask ;
return mask ;
}
static inline unsigned long prep_zero_mask ( unsigned long a , unsigned long bits , const struct word_at_a_time * c )
{
return bits ;
}
/* The mask we created is directly usable as a bytemask */
# define zero_bytemask(mask) (mask)
2014-09-19 09:40:20 +10:00
# endif /* CONFIG_64BIT */
# endif /* __BIG_ENDIAN__ */
2013-09-23 12:04:41 +10:00
2014-09-25 16:45:11 +10:00
/*
* We use load_unaligned_zero ( ) in a selftest , which builds a userspace
* program . Some linker scripts seem to discard the . fixup section , so allow
* the test code to use a different section name .
*/
# ifndef FIXUP_SECTION
# define FIXUP_SECTION ".fixup"
# endif
2014-09-19 09:40:19 +10:00
static inline unsigned long load_unaligned_zeropad ( const void * addr )
{
unsigned long ret , offset , tmp ;
asm (
" 1: " PPC_LL " %[ret], 0(%[addr]) \n "
" 2: \n "
2014-09-25 16:45:11 +10:00
" .section " FIXUP_SECTION " , \" ax \" \n "
2014-09-19 09:40:19 +10:00
" 3: "
# ifdef __powerpc64__
" clrrdi %[tmp], %[addr], 3 \n \t "
" clrlsldi %[offset], %[addr], 61, 3 \n \t "
" ld %[ret], 0(%[tmp]) \n \t "
# ifdef __BIG_ENDIAN__
" sld %[ret], %[ret], %[offset] \n \t "
# else
" srd %[ret], %[ret], %[offset] \n \t "
# endif
# else
" clrrwi %[tmp], %[addr], 2 \n \t "
" clrlslwi %[offset], %[addr], 30, 3 \n \t "
" lwz %[ret], 0(%[tmp]) \n \t "
# ifdef __BIG_ENDIAN__
" slw %[ret], %[ret], %[offset] \n \t "
# else
" srw %[ret], %[ret], %[offset] \n \t "
# endif
# endif
" b 2b \n "
" .previous \n "
2016-10-13 16:42:53 +11:00
EX_TABLE ( 1 b , 3 b )
2014-09-19 09:40:19 +10:00
: [ tmp ] " =&b " ( tmp ) , [ offset ] " =&r " ( offset ) , [ ret ] " =&r " ( ret )
: [ addr ] " b " ( addr ) , " m " ( * ( unsigned long * ) addr ) ) ;
return ret ;
}
2014-09-25 16:45:11 +10:00
# undef FIXUP_SECTION
2012-05-28 13:03:47 +10:00
# endif /* _ASM_WORD_AT_A_TIME_H */