/*1* arch/alpha/lib/ev67-strlen.S2* 21264 version by Rick Gorton <[email protected]>3*4* Finds length of a 0-terminated string. Optimized for the5* Alpha architecture:6*7* - memory accessed as aligned quadwords only8* - uses bcmpge to compare 8 bytes in parallel9*10* Much of the information about 21264 scheduling/coding comes from:11* Compiler Writer's Guide for the Alpha 2126412* abbreviated as 'CWG' in other comments here13* ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html14* Scheduling notation:15* E - either cluster16* U - upper subcluster; U0 - subcluster U0; U1 - subcluster U117* L - lower subcluster; L0 - subcluster L0; L1 - subcluster L118*/1920.set noreorder21.set noat2223.globl strlen24.ent strlen25.align 426strlen:27ldq_u $1, 0($16) # L : load first quadword ($16 may be misaligned)28lda $2, -1($31) # E :29insqh $2, $16, $2 # U :30andnot $16, 7, $0 # E :3132or $2, $1, $1 # E :33cmpbge $31, $1, $2 # E : $2 <- bitmask: bit i == 1 <==> i-th byte == 034nop # E :35bne $2, $found # U :3637$loop: ldq $1, 8($0) # L :38addq $0, 8, $0 # E : addr += 839cmpbge $31, $1, $2 # E :40beq $2, $loop # U :4142$found:43cttz $2, $3 # U0 :44addq $0, $3, $0 # E :45subq $0, $16, $0 # E :46ret $31, ($26) # L0 :4748.end strlen495051