Libav
avstring.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
3  * Copyright (c) 2007 Mans Rullgard
4  *
5  * This file is part of Libav.
6  *
7  * Libav is free software; you can redistribute it and/or
8  * modify it under the terms of the GNU Lesser General Public
9  * License as published by the Free Software Foundation; either
10  * version 2.1 of the License, or (at your option) any later version.
11  *
12  * Libav is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15  * Lesser General Public License for more details.
16  *
17  * You should have received a copy of the GNU Lesser General Public
18  * License along with Libav; if not, write to the Free Software
19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  */
21 
22 #include <stdarg.h>
23 #include <stdint.h>
24 #include <stdio.h>
25 #include <string.h>
26 
27 #include "config.h"
28 #include "common.h"
29 #include "mem.h"
30 #include "avstring.h"
31 
32 int av_strstart(const char *str, const char *pfx, const char **ptr)
33 {
34  while (*pfx && *pfx == *str) {
35  pfx++;
36  str++;
37  }
38  if (!*pfx && ptr)
39  *ptr = str;
40  return !*pfx;
41 }
42 
43 int av_stristart(const char *str, const char *pfx, const char **ptr)
44 {
45  while (*pfx && av_toupper((unsigned)*pfx) == av_toupper((unsigned)*str)) {
46  pfx++;
47  str++;
48  }
49  if (!*pfx && ptr)
50  *ptr = str;
51  return !*pfx;
52 }
53 
54 char *av_stristr(const char *s1, const char *s2)
55 {
56  if (!*s2)
57  return s1;
58 
59  do
60  if (av_stristart(s1, s2, NULL))
61  return s1;
62  while (*s1++);
63 
64  return NULL;
65 }
66 
67 char *av_strnstr(const char *haystack, const char *needle, size_t hay_length)
68 {
69  size_t needle_len = strlen(needle);
70  if (!needle_len)
71  return haystack;
72  while (hay_length >= needle_len) {
73  hay_length--;
74  if (!memcmp(haystack, needle, needle_len))
75  return haystack;
76  haystack++;
77  }
78  return NULL;
79 }
80 
81 size_t av_strlcpy(char *dst, const char *src, size_t size)
82 {
83  size_t len = 0;
84  while (++len < size && *src)
85  *dst++ = *src++;
86  if (len <= size)
87  *dst = 0;
88  return len + strlen(src) - 1;
89 }
90 
91 size_t av_strlcat(char *dst, const char *src, size_t size)
92 {
93  size_t len = strlen(dst);
94  if (size <= len + 1)
95  return len + strlen(src);
96  return len + av_strlcpy(dst + len, src, size - len);
97 }
98 
99 size_t av_strlcatf(char *dst, size_t size, const char *fmt, ...)
100 {
101  int len = strlen(dst);
102  va_list vl;
103 
104  va_start(vl, fmt);
105  len += vsnprintf(dst + len, size > len ? size - len : 0, fmt, vl);
106  va_end(vl);
107 
108  return len;
109 }
110 
111 char *av_d2str(double d)
112 {
113  char *str = av_malloc(16);
114  if (str)
115  snprintf(str, 16, "%f", d);
116  return str;
117 }
118 
119 #define WHITESPACES " \n\t"
120 
121 char *av_get_token(const char **buf, const char *term)
122 {
123  char *out = av_malloc(strlen(*buf) + 1);
124  char *ret = out, *end = out;
125  const char *p = *buf;
126  if (!out)
127  return NULL;
128  p += strspn(p, WHITESPACES);
129 
130  while (*p && !strspn(p, term)) {
131  char c = *p++;
132  if (c == '\\' && *p) {
133  *out++ = *p++;
134  end = out;
135  } else if (c == '\'') {
136  while (*p && *p != '\'')
137  *out++ = *p++;
138  if (*p) {
139  p++;
140  end = out;
141  }
142  } else {
143  *out++ = c;
144  }
145  }
146 
147  do
148  *out-- = 0;
149  while (out >= end && strspn(out, WHITESPACES));
150 
151  *buf = p;
152 
153  return ret;
154 }
155 
156 int av_strcasecmp(const char *a, const char *b)
157 {
158  uint8_t c1, c2;
159  do {
160  c1 = av_tolower(*a++);
161  c2 = av_tolower(*b++);
162  } while (c1 && c1 == c2);
163  return c1 - c2;
164 }
165 
166 int av_strncasecmp(const char *a, const char *b, size_t n)
167 {
168  const char *end = a + n;
169  uint8_t c1, c2;
170  do {
171  c1 = av_tolower(*a++);
172  c2 = av_tolower(*b++);
173  } while (a < end && c1 && c1 == c2);
174  return c1 - c2;
175 }
176 
177 const char *av_basename(const char *path)
178 {
179  char *p = strrchr(path, '/');
180 
181 #if HAVE_DOS_PATHS
182  char *q = strrchr(path, '\\');
183  char *d = strchr(path, ':');
184 
185  p = FFMAX3(p, q, d);
186 #endif
187 
188  if (!p)
189  return path;
190 
191  return p + 1;
192 }
193 
194 const char *av_dirname(char *path)
195 {
196  char *p = strrchr(path, '/');
197 
198 #if HAVE_DOS_PATHS
199  char *q = strrchr(path, '\\');
200  char *d = strchr(path, ':');
201 
202  d = d ? d + 1 : d;
203 
204  p = FFMAX3(p, q, d);
205 #endif
206 
207  if (!p)
208  return ".";
209 
210  *p = '\0';
211 
212  return path;
213 }
214 
215 int av_isdigit(int c)
216 {
217  return c >= '0' && c <= '9';
218 }
219 
220 int av_isgraph(int c)
221 {
222  return c > 32 && c < 127;
223 }
224 
225 int av_isspace(int c)
226 {
227  return c == ' ' || c == '\f' || c == '\n' || c == '\r' || c == '\t' ||
228  c == '\v';
229 }
230 
231 int av_isxdigit(int c)
232 {
233  c = av_tolower(c);
234  return av_isdigit(c) || (c >= 'a' && c <= 'f');
235 }
236 
237 #ifdef TEST
238 
239 int main(void)
240 {
241  int i;
242  const char *strings[] = {
243  "''",
244  "",
245  ":",
246  "\\",
247  "'",
248  " '' :",
249  " '' '' :",
250  "foo '' :",
251  "'foo'",
252  "foo ",
253  " ' foo ' ",
254  "foo\\",
255  "foo': blah:blah",
256  "foo\\: blah:blah",
257  "foo\'",
258  "'foo : ' :blahblah",
259  "\\ :blah",
260  " foo",
261  " foo ",
262  " foo \\ ",
263  "foo ':blah",
264  " foo bar : blahblah",
265  "\\f\\o\\o",
266  "'foo : \\ \\ ' : blahblah",
267  "'\\fo\\o:': blahblah",
268  "\\'fo\\o\\:': foo ' :blahblah"
269  };
270 
271  printf("Testing av_get_token()\n");
272  for (i = 0; i < FF_ARRAY_ELEMS(strings); i++) {
273  const char *p = strings[i];
274  char *q;
275  printf("|%s|", p);
276  q = av_get_token(&p, ":");
277  printf(" -> |%s|", q);
278  printf(" + |%s|\n", p);
279  av_free(q);
280  }
281 
282  return 0;
283 }
284 
285 #endif /* TEST */