ev67-strlen.S 1.2 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849
  1. /*
  2. * arch/alpha/lib/ev67-strlen.S
  3. * 21264 version by Rick Gorton <rick.gorton@alpha-processor.com>
  4. *
  5. * Finds length of a 0-terminated string. Optimized for the
  6. * Alpha architecture:
  7. *
  8. * - memory accessed as aligned quadwords only
  9. * - uses bcmpge to compare 8 bytes in parallel
  10. *
  11. * Much of the information about 21264 scheduling/coding comes from:
  12. * Compiler Writer's Guide for the Alpha 21264
  13. * abbreviated as 'CWG' in other comments here
  14. * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
  15. * Scheduling notation:
  16. * E - either cluster
  17. * U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
  18. * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
  19. */
  20. .set noreorder
  21. .set noat
  22. .globl strlen
  23. .ent strlen
  24. .align 4
  25. strlen:
  26. ldq_u $1, 0($16) # L : load first quadword ($16 may be misaligned)
  27. lda $2, -1($31) # E :
  28. insqh $2, $16, $2 # U :
  29. andnot $16, 7, $0 # E :
  30. or $2, $1, $1 # E :
  31. cmpbge $31, $1, $2 # E : $2 <- bitmask: bit i == 1 <==> i-th byte == 0
  32. nop # E :
  33. bne $2, $found # U :
  34. $loop: ldq $1, 8($0) # L :
  35. addq $0, 8, $0 # E : addr += 8
  36. cmpbge $31, $1, $2 # E :
  37. beq $2, $loop # U :
  38. $found:
  39. cttz $2, $3 # U0 :
  40. addq $0, $3, $0 # E :
  41. subq $0, $16, $0 # E :
  42. ret $31, ($26) # L0 :
  43. .end strlen