mirror of
https://github.com/intel/isa-l.git
synced 2024-12-12 17:33:50 +01:00
d6c5e9620d
New raid unit adds source for optimized xor and P+Q functions. Signed-off-by: Greg Tucker <greg.b.tucker@intel.com>
285 lines
6.9 KiB
NASM
285 lines
6.9 KiB
NASM
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
; Copyright(c) 2011-2015 Intel Corporation All rights reserved.
|
|
;
|
|
; Redistribution and use in source and binary forms, with or without
|
|
; modification, are permitted provided that the following conditions
|
|
; are met:
|
|
; * Redistributions of source code must retain the above copyright
|
|
; notice, this list of conditions and the following disclaimer.
|
|
; * 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.
|
|
; * Neither the name of Intel Corporation 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 COPYRIGHT HOLDERS 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 COPYRIGHT
|
|
; OWNER 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.
|
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
|
|
;;; Optimized xor of N source vectors using SSE
|
|
;;; int xor_gen_sse(int vects, int len, void **array)
|
|
|
|
;;; Generates xor parity vector from N (vects-1) sources in array of pointers
|
|
;;; (**array). Last pointer is the dest.
|
|
;;; Vectors must be aligned to 16 bytes. Length can be any value.
|
|
|
|
%include "reg_sizes.asm"
|
|
|
|
%ifidn __OUTPUT_FORMAT__, elf64
|
|
%define arg0 rdi
|
|
%define arg1 rsi
|
|
%define arg2 rdx
|
|
%define arg3 rcx
|
|
%define arg4 r8
|
|
%define arg5 r9
|
|
%define tmp r11
|
|
%define tmp2 rax
|
|
%define tmp2.b al
|
|
%define tmp3 arg4
|
|
%define return rax
|
|
%define PS 8
|
|
%define func(x) x:
|
|
%define FUNC_SAVE
|
|
%define FUNC_RESTORE
|
|
|
|
%elifidn __OUTPUT_FORMAT__, win64
|
|
%define arg0 rcx
|
|
%define arg1 rdx
|
|
%define arg2 r8
|
|
%define arg3 r9
|
|
%define return rax
|
|
%define tmp2 rax
|
|
%define tmp2.b al
|
|
%define PS 8
|
|
%define tmp r11
|
|
%define tmp3 r10
|
|
%define stack_size 2*16 + 8 ; must be an odd multiple of 8
|
|
%define func(x) proc_frame x
|
|
|
|
%macro FUNC_SAVE 0
|
|
alloc_stack stack_size
|
|
save_xmm128 xmm6, 0*16
|
|
save_xmm128 xmm7, 1*16
|
|
end_prolog
|
|
%endmacro
|
|
%macro FUNC_RESTORE 0
|
|
movdqa xmm6, [rsp + 0*16]
|
|
movdqa xmm7, [rsp + 1*16]
|
|
add rsp, stack_size
|
|
%endmacro
|
|
|
|
|
|
%elifidn __OUTPUT_FORMAT__, elf32
|
|
%define arg0 arg(0)
|
|
%define arg1 ecx
|
|
%define tmp2 eax
|
|
%define tmp2.b al
|
|
%define tmp3 edx
|
|
%define return eax
|
|
%define PS 4
|
|
%define func(x) x:
|
|
%define arg(x) [ebp+8+PS*x]
|
|
%define arg2 edi ; must sav/restore
|
|
%define arg3 esi
|
|
%define tmp ebx
|
|
|
|
%macro FUNC_SAVE 0
|
|
push ebp
|
|
mov ebp, esp
|
|
push esi
|
|
push edi
|
|
push ebx
|
|
mov arg1, arg(1)
|
|
mov arg2, arg(2)
|
|
%endmacro
|
|
|
|
%macro FUNC_RESTORE 0
|
|
pop ebx
|
|
pop edi
|
|
pop esi
|
|
mov esp, ebp ;if has frame pointer
|
|
pop ebp
|
|
%endmacro
|
|
|
|
%endif ; output formats
|
|
|
|
|
|
%define vec arg0
|
|
%define len arg1
|
|
%define ptr arg3
|
|
%define pos tmp3
|
|
|
|
%ifidn PS,8 ; 64-bit code
|
|
default rel
|
|
[bits 64]
|
|
%endif
|
|
|
|
;;; Use Non-temporal load/stor
|
|
%ifdef NO_NT_LDST
|
|
%define XLDR movdqa
|
|
%define XSTR movdqa
|
|
%else
|
|
%define XLDR movntdqa
|
|
%define XSTR movntdq
|
|
%endif
|
|
|
|
section .text
|
|
|
|
align 16
|
|
global xor_gen_sse:function
|
|
func(xor_gen_sse)
|
|
FUNC_SAVE
|
|
%ifidn PS,8 ;64-bit code
|
|
sub vec, 2 ; Keep as offset to last source
|
|
%else ;32-bit code
|
|
mov tmp, arg(0) ; Update vec length arg to last source
|
|
sub tmp, 2
|
|
mov arg(0), tmp
|
|
%endif
|
|
|
|
jng return_fail ;Must have at least 2 sources
|
|
cmp len, 0
|
|
je return_pass
|
|
test len, (128-1) ;Check alignment of length
|
|
jnz len_not_aligned
|
|
|
|
|
|
len_aligned_128bytes:
|
|
sub len, 128
|
|
mov pos, 0
|
|
mov tmp, vec ;Preset to last vector
|
|
|
|
loop128:
|
|
mov tmp2, [arg2+tmp*PS] ;Fetch last pointer in array
|
|
sub tmp, 1 ;Next vect
|
|
XLDR xmm0, [tmp2+pos] ;Start with end of array in last vector
|
|
XLDR xmm1, [tmp2+pos+16] ;Keep xor parity in xmm0-7
|
|
XLDR xmm2, [tmp2+pos+(2*16)]
|
|
XLDR xmm3, [tmp2+pos+(3*16)]
|
|
XLDR xmm4, [tmp2+pos+(4*16)]
|
|
XLDR xmm5, [tmp2+pos+(5*16)]
|
|
XLDR xmm6, [tmp2+pos+(6*16)]
|
|
XLDR xmm7, [tmp2+pos+(7*16)]
|
|
|
|
next_vect:
|
|
mov ptr, [arg2+tmp*PS]
|
|
sub tmp, 1
|
|
xorpd xmm0, [ptr+pos] ;Get next vector (source)
|
|
xorpd xmm1, [ptr+pos+16]
|
|
xorpd xmm2, [ptr+pos+(2*16)]
|
|
xorpd xmm3, [ptr+pos+(3*16)]
|
|
xorpd xmm4, [ptr+pos+(4*16)]
|
|
xorpd xmm5, [ptr+pos+(5*16)]
|
|
xorpd xmm6, [ptr+pos+(6*16)]
|
|
xorpd xmm7, [ptr+pos+(7*16)]
|
|
;;; prefetch [ptr+pos+(8*16)]
|
|
jge next_vect ;Loop for each vect
|
|
|
|
|
|
mov tmp, vec ;Back to last vector
|
|
mov ptr, [arg2+PS+tmp*PS] ;Address of parity vector
|
|
XSTR [ptr+pos], xmm0 ;Write parity xor vector
|
|
XSTR [ptr+pos+(1*16)], xmm1
|
|
XSTR [ptr+pos+(2*16)], xmm2
|
|
XSTR [ptr+pos+(3*16)], xmm3
|
|
XSTR [ptr+pos+(4*16)], xmm4
|
|
XSTR [ptr+pos+(5*16)], xmm5
|
|
XSTR [ptr+pos+(6*16)], xmm6
|
|
XSTR [ptr+pos+(7*16)], xmm7
|
|
add pos, 128
|
|
cmp pos, len
|
|
jle loop128
|
|
|
|
return_pass:
|
|
mov return, 0
|
|
FUNC_RESTORE
|
|
ret
|
|
|
|
|
|
|
|
;;; Do one byte at a time for no alignment case
|
|
|
|
xor_gen_byte:
|
|
mov tmp, vec ;Preset to last vector
|
|
|
|
loop_1byte:
|
|
mov ptr, [arg2+tmp*PS] ;Fetch last pointer in array
|
|
mov tmp2.b, [ptr+len-1] ;Get array n
|
|
sub tmp, 1
|
|
nextvect_1byte:
|
|
mov ptr, [arg2+tmp*PS]
|
|
xor tmp2.b, [ptr+len-1]
|
|
sub tmp, 1
|
|
jge nextvect_1byte
|
|
|
|
mov tmp, vec ;Back to last vector
|
|
mov ptr, [arg2+PS+tmp*PS] ;Get last vec
|
|
mov [ptr+len-1], tmp2.b ;Write parity
|
|
sub len, 1
|
|
test len, (8-1)
|
|
jnz loop_1byte
|
|
|
|
cmp len, 0
|
|
je return_pass
|
|
test len, (128-1) ;If not 0 and 128bit aligned
|
|
jz len_aligned_128bytes ; then do aligned case. len = y * 128
|
|
|
|
;; else we are 8-byte aligned so fall through to recheck
|
|
|
|
|
|
;; Unaligned length cases
|
|
len_not_aligned:
|
|
test len, (PS-1)
|
|
jne xor_gen_byte
|
|
mov tmp3, len
|
|
and tmp3, (128-1) ;Do the unaligned bytes 4-8 at a time
|
|
mov tmp, vec ;Preset to last vector
|
|
|
|
;; Run backwards 8 bytes (4B for 32bit) at a time for (tmp3) bytes
|
|
loopN_bytes:
|
|
mov ptr, [arg2+tmp*PS] ;Fetch last pointer in array
|
|
mov tmp2, [ptr+len-PS] ;Get array n
|
|
sub tmp, 1
|
|
nextvect_Nbytes:
|
|
mov ptr, [arg2+tmp*PS] ;Get pointer to next vector
|
|
xor tmp2, [ptr+len-PS]
|
|
sub tmp, 1
|
|
jge nextvect_Nbytes ;Loop for each source
|
|
|
|
mov tmp, vec ;Back to last vector
|
|
mov ptr, [arg2+PS+tmp*PS] ;Get last vec
|
|
mov [ptr+len-PS], tmp2 ;Write parity
|
|
sub len, PS
|
|
sub tmp3, PS
|
|
jg loopN_bytes
|
|
|
|
cmp len, 128 ;Now len is aligned to 128B
|
|
jge len_aligned_128bytes ;We can do the rest aligned
|
|
|
|
cmp len, 0
|
|
je return_pass
|
|
|
|
return_fail:
|
|
mov return, 1
|
|
FUNC_RESTORE
|
|
ret
|
|
|
|
endproc_frame
|
|
|
|
section .data
|
|
|
|
;;; func core, ver, snum
|
|
slversion xor_gen_sse, 00, 0c, 0030
|
|
|