|
69
by Michael Hope
Added the C only routines from Bionic 4.04r2+20120606~gita985076b |
1 |
/*
|
2 |
* Copyright (C) 2008 The Android Open Source Project
|
|
3 |
* All rights reserved.
|
|
4 |
*
|
|
5 |
* Redistribution and use in source and binary forms, with or without
|
|
6 |
* modification, are permitted provided that the following conditions
|
|
7 |
* are met:
|
|
8 |
* * Redistributions of source code must retain the above copyright
|
|
9 |
* notice, this list of conditions and the following disclaimer.
|
|
10 |
* * Redistributions in binary form must reproduce the above copyright
|
|
11 |
* notice, this list of conditions and the following disclaimer in
|
|
12 |
* the documentation and/or other materials provided with the
|
|
13 |
* distribution.
|
|
14 |
*
|
|
15 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
16 |
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
17 |
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
18 |
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
19 |
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
20 |
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
21 |
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
|
|
22 |
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
|
23 |
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
24 |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
|
25 |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
26 |
* SUCH DAMAGE.
|
|
27 |
*/
|
|
28 |
#include <stddef.h> |
|
29 |
#include <string.h> |
|
30 |
||
31 |
void *memchr(const void *s, int c, size_t n) |
|
32 |
{
|
|
33 |
const unsigned char* p = s; |
|
34 |
const unsigned char* end = p + n; |
|
35 |
||
36 |
for (;;) { |
|
37 |
if (p >= end || p[0] == c) break; p++; |
|
38 |
if (p >= end || p[0] == c) break; p++; |
|
39 |
if (p >= end || p[0] == c) break; p++; |
|
40 |
if (p >= end || p[0] == c) break; p++; |
|
41 |
}
|
|
42 |
if (p >= end) |
|
43 |
return NULL; |
|
44 |
else
|
|
45 |
return (void*) p; |
|
46 |
}
|