2 * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
3 * Copyright (c) 2007 Mans Rullgard
5 * This file is part of FFmpeg.
7 * FFmpeg 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.
12 * FFmpeg 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.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
34 int av_strstart(const char *str, const char *pfx, const char **ptr)
36 while (*pfx && *pfx == *str) {
45 int av_stristart(const char *str, const char *pfx, const char **ptr)
47 while (*pfx && av_toupper((unsigned)*pfx) == av_toupper((unsigned)*str)) {
56 char *av_stristr(const char *s1, const char *s2)
59 return (char*)(intptr_t)s1;
62 if (av_stristart(s1, s2, NULL))
63 return (char*)(intptr_t)s1;
69 char *av_strnstr(const char *haystack, const char *needle, size_t hay_length)
71 size_t needle_len = strlen(needle);
73 return (char*)haystack;
74 while (hay_length >= needle_len) {
76 if (!memcmp(haystack, needle, needle_len))
77 return (char*)haystack;
83 size_t av_strlcpy(char *dst, const char *src, size_t size)
86 while (++len < size && *src)
90 return len + strlen(src) - 1;
93 size_t av_strlcat(char *dst, const char *src, size_t size)
95 size_t len = strlen(dst);
97 return len + strlen(src);
98 return len + av_strlcpy(dst + len, src, size - len);
101 size_t av_strlcatf(char *dst, size_t size, const char *fmt, ...)
103 size_t len = strlen(dst);
107 len += vsnprintf(dst + len, size > len ? size - len : 0, fmt, vl);
113 char *av_asprintf(const char *fmt, ...)
120 len = vsnprintf(NULL, 0, fmt, va);
125 p = av_malloc(len + 1);
130 len = vsnprintf(p, len + 1, fmt, va);
139 char *av_d2str(double d)
141 char *str = av_malloc(16);
143 snprintf(str, 16, "%f", d);
147 #define WHITESPACES " \n\t\r"
149 char *av_get_token(const char **buf, const char *term)
151 char *out = av_malloc(strlen(*buf) + 1);
152 char *ret = out, *end = out;
153 const char *p = *buf;
156 p += strspn(p, WHITESPACES);
158 while (*p && !strspn(p, term)) {
160 if (c == '\\' && *p) {
163 } else if (c == '\'') {
164 while (*p && *p != '\'')
177 while (out >= end && strspn(out, WHITESPACES));
184 char *av_strtok(char *s, const char *delim, char **saveptr)
188 if (!s && !(s = *saveptr))
191 /* skip leading delimiters */
192 s += strspn(s, delim);
194 /* s now points to the first non delimiter char, or to the end of the string */
201 /* skip non delimiters */
202 s += strcspn(s, delim);
213 int av_strcasecmp(const char *a, const char *b)
217 c1 = av_tolower(*a++);
218 c2 = av_tolower(*b++);
219 } while (c1 && c1 == c2);
223 int av_strncasecmp(const char *a, const char *b, size_t n)
225 const char *end = a + n;
228 c1 = av_tolower(*a++);
229 c2 = av_tolower(*b++);
230 } while (a < end && c1 && c1 == c2);
234 char *av_strreplace(const char *str, const char *from, const char *to)
236 /* Adjust each of the below values to suit your needs. */
237 /* Increment positions cache size initially by this number. */
238 size_t cache_sz_inc = 16;
239 /* Thereafter, each time capacity needs to be increased,
240 * multiply the increment by this factor. */
241 const size_t cache_sz_inc_factor = 3;
242 /* But never increment capacity by more than this number. */
243 const size_t cache_sz_inc_max = 1048576;
245 char *pret, *ret = NULL;
246 const char *pstr2, *pstr = str;
248 uintptr_t *pos_cache_tmp, *pos_cache = NULL;
250 size_t cpylen, orglen, retlen, tolen, fromlen = strlen(from);
252 /* Find all matches and cache their positions. */
253 while ((pstr2 = av_stristr(pstr, from))) {
255 /* Increase the cache size when necessary. */
256 if (cache_sz < count) {
257 cache_sz += cache_sz_inc;
258 pos_cache_tmp = av_realloc(pos_cache, sizeof(*pos_cache) * cache_sz);
259 if (!pos_cache_tmp) {
261 } else pos_cache = pos_cache_tmp;
262 cache_sz_inc *= cache_sz_inc_factor;
263 if (cache_sz_inc > cache_sz_inc_max) {
264 cache_sz_inc = cache_sz_inc_max;
268 pos_cache[count-1] = pstr2 - str;
269 pstr = pstr2 + fromlen;
271 orglen = pstr - str + strlen(pstr);
272 /* Allocate memory for the post-replacement string. */
275 retlen = orglen + (tolen - fromlen) * count;
279 ret = av_malloc(retlen + 1);
285 /* If no matches, then just duplicate the string. */
286 av_strlcpy(ret, str, retlen + 1);
288 /* Otherwise, duplicate the string whilst performing
289 * the replacements using the position cache. */
291 memcpy(pret, str, pos_cache[0]);
292 pret += pos_cache[0];
293 for (i = 0; i < count; i++) {
294 memcpy(pret, to, tolen);
296 pstr = str + pos_cache[i] + fromlen;
297 cpylen = (i == count-1 ? orglen : pos_cache[i+1]) - pos_cache[i] - fromlen;
298 memcpy(pret, pstr, cpylen);
305 /* Free the cache and return the post-replacement string,
306 * which will be NULL in the event of an error. */
311 const char *av_basename(const char *path)
313 char *p = strrchr(path, '/');
316 char *q = strrchr(path, '\\');
317 char *d = strchr(path, ':');
328 const char *av_dirname(char *path)
330 char *p = strrchr(path, '/');
333 char *q = strrchr(path, '\\');
334 char *d = strchr(path, ':');
349 char *av_append_path_component(const char *path, const char *component)
355 return av_strdup(component);
357 return av_strdup(path);
359 p_len = strlen(path);
360 c_len = strlen(component);
361 if (p_len > SIZE_MAX - c_len || p_len + c_len > SIZE_MAX - 2)
363 fullpath = av_malloc(p_len + c_len + 2);
366 av_strlcpy(fullpath, path, p_len + 1);
368 if (fullpath[p_len - 1] != '/' && component[0] != '/')
369 fullpath[p_len++] = '/';
370 else if (fullpath[p_len - 1] == '/' && component[0] == '/')
374 av_strlcpy(&fullpath[p_len], component, c_len + 1);
375 fullpath[p_len + c_len] = 0;
380 int av_escape(char **dst, const char *src, const char *special_chars,
381 enum AVEscapeMode mode, int flags)
385 av_bprint_init(&dstbuf, 1, AV_BPRINT_SIZE_UNLIMITED);
386 av_bprint_escape(&dstbuf, src, special_chars, mode, flags);
388 if (!av_bprint_is_complete(&dstbuf)) {
389 av_bprint_finalize(&dstbuf, NULL);
390 return AVERROR(ENOMEM);
392 av_bprint_finalize(&dstbuf, dst);
397 int av_match_name(const char *name, const char *names)
405 namelen = strlen(name);
407 int negate = '-' == *names;
408 p = strchr(names, ',');
410 p = names + strlen(names);
412 len = FFMAX(p - names, namelen);
413 if (!av_strncasecmp(name, names, len) || !strncmp("ALL", names, FFMAX(3, p - names)))
415 names = p + (*p == ',');
420 int av_utf8_decode(int32_t *codep, const uint8_t **bufp, const uint8_t *buf_end,
423 const uint8_t *p = *bufp;
426 int ret = 0, tail_len;
427 uint32_t overlong_encoding_mins[6] = {
428 0x00000000, 0x00000080, 0x00000800, 0x00010000, 0x00200000, 0x04000000,
436 /* first sequence byte starts with 10, or is 1111-1110 or 1111-1111,
437 which is not admitted */
438 if ((code & 0xc0) == 0x80 || code >= 0xFE) {
439 ret = AVERROR(EILSEQ);
442 top = (code & 128) >> 1;
450 return AVERROR(EILSEQ); /* incomplete sequence */
453 /* we assume the byte to be in the form 10xx-xxxx */
454 tmp = *p++ - 128; /* strip leading 1 */
457 return AVERROR(EILSEQ);
459 code = (code<<6) + tmp;
462 code &= (top << 1) - 1;
464 /* check for overlong encodings */
465 av_assert0(tail_len <= 5);
466 if (code < overlong_encoding_mins[tail_len]) {
467 ret = AVERROR(EILSEQ);
471 if (code >= 1U<<31) {
472 ret = AVERROR(EILSEQ); /* out-of-range value */
478 if (code > 0x10FFFF &&
479 !(flags & AV_UTF8_FLAG_ACCEPT_INVALID_BIG_CODES))
480 ret = AVERROR(EILSEQ);
481 if (code < 0x20 && code != 0x9 && code != 0xA && code != 0xD &&
482 flags & AV_UTF8_FLAG_EXCLUDE_XML_INVALID_CONTROL_CODES)
483 ret = AVERROR(EILSEQ);
484 if (code >= 0xD800 && code <= 0xDFFF &&
485 !(flags & AV_UTF8_FLAG_ACCEPT_SURROGATES))
486 ret = AVERROR(EILSEQ);
487 if ((code == 0xFFFE || code == 0xFFFF) &&
488 !(flags & AV_UTF8_FLAG_ACCEPT_NON_CHARACTERS))
489 ret = AVERROR(EILSEQ);
496 int av_match_list(const char *name, const char *list, char separator)
500 for (p = name; p && *p; ) {
501 for (q = list; q && *q; ) {
503 for (k = 0; p[k] == q[k] || (p[k]*q[k] == 0 && p[k]+q[k] == separator); k++)
504 if (k && (!p[k] || p[k] == separator))
506 q = strchr(q, separator);
509 p = strchr(p, separator);