strspn.S 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  1. /* strspn (str, ss) -- Return the length of the initial segment of STR
  2. which contains only characters from SS.
  3. For AMD x86-64.
  4. Copyright (C) 1994-1997, 2000, 2002, 2003, 2004, 2005
  5. Free Software Foundation, Inc.
  6. This file is part of the GNU C Library.
  7. Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>.
  8. Bug fixes by Alan Modra <Alan@SPRI.Levels.UniSA.Edu.Au>.
  9. Adopted for x86-64 by Andreas Jaeger <aj@suse.de>.
  10. The GNU C Library is free software; you can redistribute it and/or
  11. modify it under the terms of the GNU Lesser General Public
  12. License as published by the Free Software Foundation; either
  13. version 2.1 of the License, or (at your option) any later version.
  14. The GNU C Library is distributed in the hope that it will be useful,
  15. but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  17. Lesser General Public License for more details.
  18. You should have received a copy of the GNU Lesser General Public
  19. License along with the GNU C Library; if not, write to the Free
  20. Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  21. 02111-1307 USA. */
  22. #include "_glibc_inc.h"
  23. .text
  24. .global strspn
  25. .set strspn,__strspn
  26. .hidden __strspn
  27. ENTRY (__strspn)
  28. movq %rdi, %rdx /* Save SRC. */
  29. /* First we create a table with flags for all possible characters.
  30. For the ASCII (7bit/8bit) or ISO-8859-X character sets which are
  31. supported by the C string functions we have 256 characters.
  32. Before inserting marks for the stop characters we clear the whole
  33. table. */
  34. movq %rdi, %r8 /* Save value. */
  35. subq $256, %rsp /* Make space for 256 bytes. */
  36. movl $32, %ecx /* 32*8 bytes = 256 bytes. */
  37. movq %rsp, %rdi
  38. xorl %eax, %eax /* We store 0s. */
  39. cld
  40. rep
  41. stosq
  42. movq %rsi, %rax /* Setup stopset. */
  43. /* For understanding the following code remember that %rcx == 0 now.
  44. Although all the following instruction only modify %cl we always
  45. have a correct zero-extended 64-bit value in %rcx. */
  46. .p2align 4
  47. L(2): movb (%rax), %cl /* get byte from stopset */
  48. testb %cl, %cl /* is NUL char? */
  49. jz L(1) /* yes => start compare loop */
  50. movb %cl, (%rsp,%rcx) /* set corresponding byte in stopset table */
  51. movb 1(%rax), %cl /* get byte from stopset */
  52. testb $0xff, %cl /* is NUL char? */
  53. jz L(1) /* yes => start compare loop */
  54. movb %cl, (%rsp,%rcx) /* set corresponding byte in stopset table */
  55. movb 2(%rax), %cl /* get byte from stopset */
  56. testb $0xff, %cl /* is NUL char? */
  57. jz L(1) /* yes => start compare loop */
  58. movb %cl, (%rsp,%rcx) /* set corresponding byte in stopset table */
  59. movb 3(%rax), %cl /* get byte from stopset */
  60. addq $4, %rax /* increment stopset pointer */
  61. movb %cl, (%rsp,%rcx) /* set corresponding byte in stopset table */
  62. testb $0xff, %cl /* is NUL char? */
  63. jnz L(2) /* no => process next dword from stopset */
  64. L(1): leaq -4(%rdx), %rax /* prepare loop */
  65. /* We use a neat trick for the following loop. Normally we would
  66. have to test for two termination conditions
  67. 1. a character in the stopset was found
  68. and
  69. 2. the end of the string was found
  70. But as a sign that the character is in the stopset we store its
  71. value in the table. But the value of NUL is NUL so the loop
  72. terminates for NUL in every case. */
  73. .p2align 4
  74. L(3): addq $4, %rax /* adjust pointer for full loop round */
  75. movb (%rax), %cl /* get byte from string */
  76. testb %cl, (%rsp,%rcx) /* is it contained in skipset? */
  77. jz L(4) /* no => return */
  78. movb 1(%rax), %cl /* get byte from string */
  79. testb %cl, (%rsp,%rcx) /* is it contained in skipset? */
  80. jz L(5) /* no => return */
  81. movb 2(%rax), %cl /* get byte from string */
  82. testb %cl, (%rsp,%rcx) /* is it contained in skipset? */
  83. jz L(6) /* no => return */
  84. movb 3(%rax), %cl /* get byte from string */
  85. testb %cl, (%rsp,%rcx) /* is it contained in skipset? */
  86. jnz L(3) /* yes => start loop again */
  87. incq %rax /* adjust pointer */
  88. L(6): incq %rax
  89. L(5): incq %rax
  90. L(4): addq $256, %rsp /* remove stopset */
  91. subq %rdx, %rax /* we have to return the number of valid
  92. characters, so compute distance to first
  93. non-valid character */
  94. ret
  95. END (__strspn)