strchr_32.c 1.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
  1. /*
  2. * Copyright 2010 Tilera Corporation. All Rights Reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public License
  6. * as published by the Free Software Foundation, version 2.
  7. *
  8. * This program is distributed in the hope that it will be useful, but
  9. * WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
  11. * NON INFRINGEMENT. See the GNU General Public License for
  12. * more details.
  13. */
  14. #include <linux/types.h>
  15. #include <linux/string.h>
  16. #include <linux/module.h>
  17. char *strchr(const char *s, int c)
  18. {
  19. int z, g;
  20. /* Get an aligned pointer. */
  21. const uintptr_t s_int = (uintptr_t) s;
  22. const uint32_t *p = (const uint32_t *)(s_int & -4);
  23. /* Create four copies of the byte for which we are looking. */
  24. const uint32_t goal = 0x01010101 * (uint8_t) c;
  25. /* Read the first aligned word, but force bytes before the string to
  26. * match neither zero nor goal (we make sure the high bit of each
  27. * byte is 1, and the low 7 bits are all the opposite of the goal
  28. * byte).
  29. *
  30. * Note that this shift count expression works because we know shift
  31. * counts are taken mod 32.
  32. */
  33. const uint32_t before_mask = (1 << (s_int << 3)) - 1;
  34. uint32_t v = (*p | before_mask) ^ (goal & __insn_shrib(before_mask, 1));
  35. uint32_t zero_matches, goal_matches;
  36. while (1) {
  37. /* Look for a terminating '\0'. */
  38. zero_matches = __insn_seqb(v, 0);
  39. /* Look for the goal byte. */
  40. goal_matches = __insn_seqb(v, goal);
  41. if (__builtin_expect(zero_matches | goal_matches, 0))
  42. break;
  43. v = *++p;
  44. }
  45. z = __insn_ctz(zero_matches);
  46. g = __insn_ctz(goal_matches);
  47. /* If we found c before '\0' we got a match. Note that if c == '\0'
  48. * then g == z, and we correctly return the address of the '\0'
  49. * rather than NULL.
  50. */
  51. return (g <= z) ? ((char *)p) + (g >> 3) : NULL;
  52. }
  53. EXPORT_SYMBOL(strchr);