ev67-strcat.S 1.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. /*
  3. * arch/alpha/lib/ev67-strcat.S
  4. * 21264 version contributed by Rick Gorton <[email protected]>
  5. *
  6. * Append a null-terminated string from SRC to DST.
  7. *
  8. * Much of the information about 21264 scheduling/coding comes from:
  9. * Compiler Writer's Guide for the Alpha 21264
  10. * abbreviated as 'CWG' in other comments here
  11. * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
  12. * Scheduling notation:
  13. * E - either cluster
  14. * U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
  15. * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
  16. * Try not to change the actual algorithm if possible for consistency.
  17. * Commentary: It seems bogus to walk the input string twice - once
  18. * to determine the length, and then again while doing the copy.
  19. * A significant (future) enhancement would be to only read the input
  20. * string once.
  21. */
  22. #include <asm/export.h>
  23. .text
  24. .align 4
  25. .globl strcat
  26. .ent strcat
  27. strcat:
  28. .frame $30, 0, $26
  29. .prologue 0
  30. mov $16, $0 # E : set up return value
  31. /* Find the end of the string. */
  32. ldq_u $1, 0($16) # L : load first quadword (a0 may be misaligned)
  33. lda $2, -1 # E :
  34. insqh $2, $16, $2 # U :
  35. andnot $16, 7, $16 # E :
  36. or $2, $1, $1 # E :
  37. cmpbge $31, $1, $2 # E : bits set iff byte == 0
  38. bne $2, $found # U :
  39. $loop: ldq $1, 8($16) # L :
  40. addq $16, 8, $16 # E :
  41. cmpbge $31, $1, $2 # E :
  42. beq $2, $loop # U :
  43. $found: cttz $2, $3 # U0 :
  44. addq $16, $3, $16 # E :
  45. /* Now do the append. */
  46. mov $26, $23 # E :
  47. br __stxcpy # L0 :
  48. .end strcat
  49. EXPORT_SYMBOL(strcat)