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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/lib/string.C $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2011,2017 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or */
/* implied. See the License for the specific language governing */
/* permissions and limitations under the License. */
/* */
/* IBM_PROLOG_END_TAG */
#include <string.h>
#include <stdlib.h>
extern "C" void bzero(void *vdest, size_t len)
{
memset(vdest, 0, len);
}
extern "C" void *memmem(const void *haystack, size_t haystacklen,
const void *needle, size_t needlelen)
{
const void * result = NULL;
if (haystacklen >= needlelen)
{
const char * c_haystack = static_cast<const char *>(haystack);
const char * c_needle = static_cast<const char *>(needle);
bool match = false;
for (size_t i = 0; i <= (haystacklen - needlelen); i++)
{
match = true;
for (size_t j = 0; j < needlelen; j++)
{
if (*(c_haystack + i + j) != *(c_needle + j))
{
match = false;
break;
}
}
if (match)
{
result = (c_haystack + i);
break;
}
}
}
return const_cast<void *>(result);
}
extern "C" char* strcpy(char* d, const char* s)
{
char* d1 = d;
do
{
*d1 = *s;
if (*s == '\0') return d;
d1++; s++;
} while(1);
}
extern "C" int strcmp(const char* a, const char* b)
{
while((*a != '\0') && (*b != '\0'))
{
if (*a == *b)
{
a++; b++;
}
else
{
return (*a > *b) ? 1 : -1;
}
}
if (*a == *b)
return 0;
if (*a == '\0')
return -1;
else
return 1;
}
extern "C" size_t strlen(const char* a)
{
size_t length = 0;
while(*a++)
{
length++;
}
return length;
}
extern "C" size_t strnlen(const char* s, size_t n)
{
size_t length = 0;
while((length < n) && (*s++))
{
length++;
}
return length;
}
extern "C" char* strcat(char* d, const char* s)
{
char* _d = d;
while(*_d)
{
_d++;
}
while(*s)
{
*_d = *s;
_d++; s++;
}
*_d = '\0';
return d;
}
extern "C" char* strncat(char* d, const char* s, size_t n)
{
char* _d = d;
while(*_d)
{
_d++;
}
while((*s) && (0 != n))
{
*_d = *s;
_d++; s++;
n--;
}
*_d = '\0';
return d;
}
extern "C" char* strchr(const char* s, int c)
{
while((*s != '\0') && (*s != c))
{
s++;
}
if (*s == c) return (char*)s;
return NULL;
}
char* strdup(const char* s)
{
return strcpy(static_cast<char*>(malloc(strlen(s)+1)), s);
}
|
