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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
// Copyright (c) Athena Dev Teams - Licensed under GNU GPL
// For more information, see LICENCE in the main folder
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include "strlib.h"
#include "../common/cbasetypes.h"
#include "../common/utils.h"
#include "../common/malloc.h"
#define J_MAX_MALLOC_SIZE 65535
// escapes a string in-place (' -> \' , \ -> \\ , % -> _)
char* jstrescape (char* pt)
{
//copy from here
char *ptr;
int i = 0, j = 0;
//copy string to temporary
CREATE(ptr, char, J_MAX_MALLOC_SIZE);
strcpy(ptr,pt);
while (ptr[i] != '\0') {
switch (ptr[i]) {
case '\'':
pt[j++] = '\\';
pt[j++] = ptr[i++];
break;
case '\\':
pt[j++] = '\\';
pt[j++] = ptr[i++];
break;
case '%':
pt[j++] = '_'; i++;
break;
default:
pt[j++] = ptr[i++];
}
}
pt[j++] = '\0';
aFree(ptr);
return pt;
}
// escapes a string into a provided buffer
char* jstrescapecpy (char* pt, const char* spt)
{
//copy from here
//WARNING: Target string pt should be able to hold strlen(spt)*2, as each time
//a escape character is found, the target's final length increases! [Skotlex]
int i =0, j=0;
if (!spt) { //Return an empty string [Skotlex]
pt[0] = '\0';
return &pt[0];
}
while (spt[i] != '\0') {
switch (spt[i]) {
case '\'':
pt[j++] = '\\';
pt[j++] = spt[i++];
break;
case '\\':
pt[j++] = '\\';
pt[j++] = spt[i++];
break;
case '%':
pt[j++] = '_'; i++;
break;
default:
pt[j++] = spt[i++];
}
}
pt[j++] = '\0';
return &pt[0];
}
// escapes exactly 'size' bytes of a string into a provided buffer
int jmemescapecpy (char* pt, const char* spt, int size)
{
//copy from here
int i =0, j=0;
while (i < size) {
switch (spt[i]) {
case '\'':
pt[j++] = '\\';
pt[j++] = spt[i++];
break;
case '\\':
pt[j++] = '\\';
pt[j++] = spt[i++];
break;
case '%':
pt[j++] = '_'; i++;
break;
default:
pt[j++] = spt[i++];
}
}
// copy size is 0 ~ (j-1)
return j;
}
// Function to suppress control characters in a string.
int remove_control_chars(char* str)
{
int i;
int change = 0;
for(i = 0; str[i]; i++) {
if (str[i] < 32) {
str[i] = '_';
change = 1;
}
}
return change;
}
//Trims a string, also removes illegal characters such as \t and reduces continous spaces to a single one. by [Foruken]
char* trim(char* str, const char* delim)
{
char* strp = strtok(str,delim);
char buf[1024];
char* bufp = buf;
memset(buf,0,sizeof buf);
while(strp) {
strcpy(bufp, strp);
bufp = bufp + strlen(strp);
strp = strtok(NULL, delim);
if (strp) {
strcpy(bufp," ");
bufp++;
}
}
strcpy(str,buf);
return str;
}
//stristr: Case insensitive version of strstr, code taken from
//http://www.daniweb.com/code/snippet313.html, Dave Sinkula
//
const char* stristr(const char* haystack, const char* needle)
{
if ( !*needle )
{
return haystack;
}
for ( ; *haystack; ++haystack )
{
if ( TOUPPER(*haystack) == TOUPPER(*needle) )
{
// matched starting char -- loop through remaining chars
const char *h, *n;
for ( h = haystack, n = needle; *h && *n; ++h, ++n )
{
if ( TOUPPER(*h) != TOUPPER(*n) )
{
break;
}
}
if ( !*n ) // matched all of 'needle' to null termination
{
return haystack; // return the start of the match
}
}
}
return 0;
}
#ifdef __WIN32
char* _strtok_r(char *s1, const char *s2, char **lasts)
{
char *ret;
if (s1 == NULL)
s1 = *lasts;
while(*s1 && strchr(s2, *s1))
++s1;
if(*s1 == '\0')
return NULL;
ret = s1;
while(*s1 && !strchr(s2, *s1))
++s1;
if(*s1)
*s1++ = '\0';
*lasts = s1;
return ret;
}
#endif
#if !defined(WIN32) || (defined(_MSC_VER) && _MSC_VER < 1400)
/* Find the length of STRING, but scan at most MAXLEN characters.
If no '\0' terminator is found in that many characters, return MAXLEN. */
size_t strnlen (const char* string, size_t maxlen)
{
const char* end = memchr (string, '\0', maxlen);
return end ? (size_t) (end - string) : maxlen;
}
#endif
|
