strcspn.S 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136
  1. /* strcspn (str, ss) -- Return the length of the initial segment of STR
  2. which contains no 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, see
  20. <http://www.gnu.org/licenses/>. */
  21. #include "_glibc_inc.h"
  22. /* Seems to be unrolled too much */
  23. /* BEWARE: `#ifdef strcspn' means that strcspn is redefined as `strpbrk' */
  24. #define STRPBRK_P (defined strcspn)
  25. .text
  26. ENTRY (strcspn)
  27. movq %rdi, %rdx /* Save SRC. */
  28. /* First we create a table with flags for all possible characters.
  29. For the ASCII (7bit/8bit) or ISO-8859-X character sets which are
  30. supported by the C string functions we have 256 characters.
  31. Before inserting marks for the stop characters we clear the whole
  32. table. */
  33. movq %rdi, %r8 /* Save value. */
  34. subq $256, %rsp /* Make space for 256 bytes. */
  35. movl $32, %ecx /* 32*8 bytes = 256 bytes. */
  36. movq %rsp, %rdi
  37. xorl %eax, %eax /* We store 0s. */
  38. cld
  39. rep
  40. stosq
  41. movq %rsi, %rax /* Setup skipset. */
  42. /* For understanding the following code remember that %rcx == 0 now.
  43. Although all the following instruction only modify %cl we always
  44. have a correct zero-extended 64-bit value in %rcx. */
  45. /* Next 3 insns are 6 bytes total, make sure we decode them in one go */
  46. .p2align 3,,6
  47. L(2): movb (%rax), %cl /* get byte from skipset */
  48. testb %cl, %cl /* is NUL char? */
  49. jz L(1) /* yes => start compare loop */
  50. movb %cl, (%rsp,%rcx) /* set corresponding byte in skipset table */
  51. movb 1(%rax), %cl /* get byte from skipset */
  52. testb %cl, %cl /* is NUL char? */
  53. jz L(1) /* yes => start compare loop */
  54. movb %cl, (%rsp,%rcx) /* set corresponding byte in skipset table */
  55. movb 2(%rax), %cl /* get byte from skipset */
  56. testb %cl, %cl /* is NUL char? */
  57. jz L(1) /* yes => start compare loop */
  58. movb %cl, (%rsp,%rcx) /* set corresponding byte in skipset table */
  59. movb 3(%rax), %cl /* get byte from skipset */
  60. addq $4, %rax /* increment skipset pointer */
  61. movb %cl, (%rsp,%rcx) /* set corresponding byte in skipset table */
  62. testb %cl, %cl /* is NUL char? */
  63. jnz L(2) /* no => process next dword from skipset */
  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 skipset was found
  68. and
  69. 2. the end of the string was found
  70. But as a sign that the character is in the skipset 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. /* Next 3 insns are 9 bytes total. */
  74. /* .p2align 4,,9 would make sure we decode them in one go, */
  75. /* but it will also align entire function to 16 bytes, */
  76. /* potentially creating largish padding at link time. */
  77. /* We are aligning to 8 bytes instead: */
  78. .p2align 3,,8
  79. L(3): addq $4, %rax /* adjust pointer for full loop round */
  80. movb (%rax), %cl /* get byte from string */
  81. cmpb %cl, (%rsp,%rcx) /* is it contained in skipset? */
  82. je L(4) /* yes => return */
  83. movb 1(%rax), %cl /* get byte from string */
  84. cmpb %cl, (%rsp,%rcx) /* is it contained in skipset? */
  85. je L(5) /* yes => return */
  86. movb 2(%rax), %cl /* get byte from string */
  87. cmpb %cl, (%rsp,%rcx) /* is it contained in skipset? */
  88. jz L(6) /* yes => return */
  89. movb 3(%rax), %cl /* get byte from string */
  90. cmpb %cl, (%rsp,%rcx) /* is it contained in skipset? */
  91. jne L(3) /* no => start loop again */
  92. incq %rax /* adjust pointer */
  93. L(6): incq %rax
  94. L(5): incq %rax
  95. L(4): addq $256, %rsp /* remove skipset */
  96. #if STRPBRK_P
  97. xorl %edx,%edx
  98. orb %cl, %cl /* was last character NUL? */
  99. cmovzq %rdx, %rax /* Yes: return NULL */
  100. #else
  101. subq %rdx, %rax /* we have to return the number of valid
  102. characters, so compute distance to first
  103. non-valid character */
  104. #endif
  105. ret
  106. END (strcspn)
  107. #if !STRPBRK_P
  108. libc_hidden_def(strcspn)
  109. #endif