summaryrefslogtreecommitdiffstats
path: root/firmware/libc/memchr.c
blob: bd99cfbc4d0121f39b21175d8305211c767bd2fc (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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
/*
FUNCTION
        <<memchr>>---search for character in memory

INDEX
        memchr

ANSI_SYNOPSIS
        #include <string.h>
        void * memchr(const void *<[s1]>, int <[c]>, size_t <[n]>);

TRAD_SYNOPSIS
        #include <string.h>
        void * memchr(<[s1]>, <[c]>, <[n]>);
        void *<[string]>;
        int *<[c]>;
        size_t *<[n]>;

DESCRIPTION
        This function scans the first <[n]> bytes of the memory pointed
        to by <[s1]> for the character <[c]> (converted to a char).

RETURNS
        Returns a pointer to the matching byte, or a null pointer if
        <[c]> does not occur in <[s1]>.

PORTABILITY
<<memchr>> is ANSI C.

<<memchr>> requires no supporting OS subroutines.

QUICKREF
        memchr ansi pure
*/

#include <string.h>
#include <limits.h>
#include "_ansi.h" /* for _DEFUN */

/* Nonzero if X is not aligned on a "long" boundary.  */
#define ROCKBOX_UNALIGNED(X) ((long)X & (sizeof (long) - 1))

/* How many bytes are loaded each iteration of the word copy loop.  */
#define LBLOCKSIZE (sizeof (long))

#if LONG_MAX == 2147483647L
#define DETECTNULL(X) (((X) - 0x01010101) & ~(X) & 0x80808080)
#else
#if LONG_MAX == 9223372036854775807L
/* Nonzero if X (a long int) contains a NULL byte. */
#define DETECTNULL(X) (((X) - 0x0101010101010101) & ~(X) & 0x8080808080808080)
#else
#error long int is not a 32bit or 64bit type.
#endif
#endif

/* DETECTCHAR returns nonzero if (long)X contains the byte used 
   to fill (long)MASK. */
#define DETECTCHAR(X,MASK) (DETECTNULL(X ^ MASK))

void *
_DEFUN (memchr, (s1, i, n),
        _CONST void *s1 _AND
        int i _AND size_t n)
{
  _CONST unsigned char *s = (_CONST unsigned char *)s1;
#if defined(PREFER_SIZE_OVER_SPEED) || defined(__OPTIMIZE_SIZE__)
  unsigned char c = (unsigned char)i;

  while (n-- > 0)
    {
      if (*s == c)
        {
          return (void *)s;
        }
      s++;
    }

  return NULL;
#else
  unsigned char c = (unsigned char)i;
  unsigned long mask,j;
  unsigned long *aligned_addr;

  if (!ROCKBOX_UNALIGNED (s))
    {
      mask = 0;
      for (j = 0; j < LBLOCKSIZE; j++)
        mask = (mask << 8) | c;

      aligned_addr = (unsigned long*)s;
      while ((!DETECTCHAR (*aligned_addr, mask)) && (n>LBLOCKSIZE))
        {
          aligned_addr++;
          n -= LBLOCKSIZE;
        }

      /* The block of bytes currently pointed to by aligned_addr
         may contain the target character or there may be less than
         LBLOCKSIZE bytes left to search. We check the last few
         bytes using the bytewise search.  */

      s = (unsigned char*)aligned_addr;
    }

  while (n-- > 0)
    {
      if (*s == c)
        {
          return (void *)s;
        }
      s++;
    }

  return NULL;
#endif /* not PREFER_SIZE_OVER_SPEED */
}