aboutsummaryrefslogtreecommitdiff
path: root/newlib/libc/string/rawmemchr.c
blob: 1458a9d8b35237d58fdb6660828a867be5a29e25 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/*
FUNCTION
	<<rawmemchr>>---find character in memory

INDEX
	rawmemchr

SYNOPSIS
	#include <string.h>
	void *rawmemchr(const void *<[src]>, int <[c]>);

DESCRIPTION
	This function searches memory starting at <<*<[src]>>> for the
	character <[c]>.  The search only ends with the first occurrence
	of <[c]>; in particular, <<NUL>> does not terminate the search.
	No bounds checking is performed, so this function should only
	be used when it is certain that the character <[c]> will be found.

RETURNS
	A pointer to the first occurance of character <[c]>.

PORTABILITY
<<rawmemchr>> is a GNU extension.

<<rawmemchr>> requires no supporting OS subroutines.

QUICKREF
	rawmemchr
*/

#include <_ansi.h>
#include <string.h>
#include <limits.h>
#include "local.h"

void *
rawmemchr (const void *src_void,
	int c)
{
  const unsigned char *src = (const unsigned char *) src_void;
  unsigned char d = c;

#if !defined(PREFER_SIZE_OVER_SPEED) && !defined(__OPTIMIZE_SIZE__)
  unsigned long *asrc;
  unsigned long  mask;
  unsigned int i;

  while (UNALIGNED_X (src))
    {
      if (*src == d)
        return (void *) src;
      src++;
    }

  /* If we get this far, we know that src is word-aligned. */
  /* The fast code reads the source one word at a time and only
     performs the bytewise search on word-sized segments if they
     contain the search character, which is detected by XORing
     the word-sized segment with a word-sized block of the search
     character and then detecting for the presence of NUL in the
     result.  */
  asrc = (unsigned long *) src;
  mask = d << 8 | d;
  mask = mask << 16 | mask;
  for (i = 32; i < sizeof(mask) * 8; i <<= 1)
    mask = (mask << i) | mask;

  while (1)
    {
      if (DETECT_CHAR (*asrc, mask))
        break;
      asrc++;
    }

  /* We have the matching word, now we resort to a bytewise loop. */

  src = (unsigned char *) asrc;

#endif /* !PREFER_SIZE_OVER_SPEED && !__OPTIMIZE_SIZE__ */

  while (1)
    {
      if (*src == d)
        return (void *) src;
      src++;
    }
}