avstring.c 10.5 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
/*
 * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
 * Copyright (c) 2007 Mans Rullgard
 *
 * This file is part of FFmpeg.
 *
 * FFmpeg is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * FFmpeg is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with FFmpeg; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 */

22
#include <stdarg.h>
23
#include <stdint.h>
24
#include <stdio.h>
25
#include <string.h>
26

27 28
#include "config.h"
#include "common.h"
29
#include "mem.h"
30
#include "avassert.h"
31
#include "avstring.h"
Stefano Sabatini's avatar
Stefano Sabatini committed
32
#include "bprint.h"
33 34 35

int av_strstart(const char *str, const char *pfx, const char **ptr)
{
36 37 38 39
    while (*pfx && *pfx == *str) {
        pfx++;
        str++;
    }
40 41 42 43 44 45 46
    if (!*pfx && ptr)
        *ptr = str;
    return !*pfx;
}

int av_stristart(const char *str, const char *pfx, const char **ptr)
{
47
    while (*pfx && av_toupper((unsigned)*pfx) == av_toupper((unsigned)*str)) {
48 49 50
        pfx++;
        str++;
    }
51 52 53 54 55
    if (!*pfx && ptr)
        *ptr = str;
    return !*pfx;
}

56 57 58
char *av_stristr(const char *s1, const char *s2)
{
    if (!*s2)
59
        return (char*)(intptr_t)s1;
60

61
    do
62
        if (av_stristart(s1, s2, NULL))
63
            return (char*)(intptr_t)s1;
64
    while (*s1++);
65 66 67 68

    return NULL;
}

69 70 71 72
char *av_strnstr(const char *haystack, const char *needle, size_t hay_length)
{
    size_t needle_len = strlen(needle);
    if (!needle_len)
73
        return (char*)haystack;
74 75 76
    while (hay_length >= needle_len) {
        hay_length--;
        if (!memcmp(haystack, needle, needle_len))
77
            return (char*)haystack;
78 79 80 81 82
        haystack++;
    }
    return NULL;
}

83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
size_t av_strlcpy(char *dst, const char *src, size_t size)
{
    size_t len = 0;
    while (++len < size && *src)
        *dst++ = *src++;
    if (len <= size)
        *dst = 0;
    return len + strlen(src) - 1;
}

size_t av_strlcat(char *dst, const char *src, size_t size)
{
    size_t len = strlen(dst);
    if (size <= len + 1)
        return len + strlen(src);
    return len + av_strlcpy(dst + len, src, size - len);
}
100 101 102

size_t av_strlcatf(char *dst, size_t size, const char *fmt, ...)
{
103
    size_t len = strlen(dst);
104 105 106 107 108 109 110 111
    va_list vl;

    va_start(vl, fmt);
    len += vsnprintf(dst + len, size > len ? size - len : 0, fmt, vl);
    va_end(vl);

    return len;
}
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
char *av_asprintf(const char *fmt, ...)
{
    char *p = NULL;
    va_list va;
    int len;

    va_start(va, fmt);
    len = vsnprintf(NULL, 0, fmt, va);
    va_end(va);
    if (len < 0)
        goto end;

    p = av_malloc(len + 1);
    if (!p)
        goto end;

    va_start(va, fmt);
    len = vsnprintf(p, len + 1, fmt, va);
    va_end(va);
    if (len < 0)
        av_freep(&p);

end:
    return p;
}

139 140
char *av_d2str(double d)
{
141 142 143
    char *str = av_malloc(16);
    if (str)
        snprintf(str, 16, "%f", d);
144 145
    return str;
}
146

147
#define WHITESPACES " \n\t\r"
148 149 150

char *av_get_token(const char **buf, const char *term)
{
151 152
    char *out     = av_malloc(strlen(*buf) + 1);
    char *ret     = out, *end = out;
153
    const char *p = *buf;
154 155
    if (!out)
        return NULL;
156 157
    p += strspn(p, WHITESPACES);

158
    while (*p && !strspn(p, term)) {
159
        char c = *p++;
160
        if (c == '\\' && *p) {
161
            *out++ = *p++;
162 163 164
            end    = out;
        } else if (c == '\'') {
            while (*p && *p != '\'')
165
                *out++ = *p++;
166
            if (*p) {
167
                p++;
168
                end = out;
169
            }
170
        } else {
171 172 173 174
            *out++ = c;
        }
    }

175
    do
176
        *out-- = 0;
177
    while (out >= end && strspn(out, WHITESPACES));
178 179 180 181 182 183

    *buf = p;

    return ret;
}

Stefano Sabatini's avatar
Stefano Sabatini committed
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 210 211 212
char *av_strtok(char *s, const char *delim, char **saveptr)
{
    char *tok;

    if (!s && !(s = *saveptr))
        return NULL;

    /* skip leading delimiters */
    s += strspn(s, delim);

    /* s now points to the first non delimiter char, or to the end of the string */
    if (!*s) {
        *saveptr = NULL;
        return NULL;
    }
    tok = s++;

    /* skip non delimiters */
    s += strcspn(s, delim);
    if (*s) {
        *s = 0;
        *saveptr = s+1;
    } else {
        *saveptr = NULL;
    }

    return tok;
}

213 214 215 216
int av_strcasecmp(const char *a, const char *b)
{
    uint8_t c1, c2;
    do {
217 218
        c1 = av_tolower(*a++);
        c2 = av_tolower(*b++);
219 220 221 222 223 224 225 226 227
    } while (c1 && c1 == c2);
    return c1 - c2;
}

int av_strncasecmp(const char *a, const char *b, size_t n)
{
    const char *end = a + n;
    uint8_t c1, c2;
    do {
228 229
        c1 = av_tolower(*a++);
        c2 = av_tolower(*b++);
230 231 232 233
    } while (a < end && c1 && c1 == c2);
    return c1 - c2;
}

234
char *av_strireplace(const char *str, const char *from, const char *to)
235
{
236
    char *ret = NULL;
237
    const char *pstr2, *pstr = str;
238 239
    size_t tolen = strlen(to), fromlen = strlen(from);
    AVBPrint pbuf;
240

241
    av_bprint_init(&pbuf, 1, AV_BPRINT_SIZE_UNLIMITED);
242
    while ((pstr2 = av_stristr(pstr, from))) {
243
        av_bprint_append_data(&pbuf, pstr, pstr2 - pstr);
244
        pstr = pstr2 + fromlen;
245
        av_bprint_append_data(&pbuf, to, tolen);
246
    }
247 248 249
    av_bprint_append_data(&pbuf, pstr, strlen(pstr));
    if (!av_bprint_is_complete(&pbuf)) {
        av_bprint_finalize(&pbuf, NULL);
250
    } else {
251
        av_bprint_finalize(&pbuf, &ret);
252 253 254 255 256
    }

    return ret;
}

257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
const char *av_basename(const char *path)
{
    char *p = strrchr(path, '/');

#if HAVE_DOS_PATHS
    char *q = strrchr(path, '\\');
    char *d = strchr(path, ':');

    p = FFMAX3(p, q, d);
#endif

    if (!p)
        return path;

    return p + 1;
}

const char *av_dirname(char *path)
{
    char *p = strrchr(path, '/');

#if HAVE_DOS_PATHS
    char *q = strrchr(path, '\\');
    char *d = strchr(path, ':');

    d = d ? d + 1 : d;

    p = FFMAX3(p, q, d);
#endif

    if (!p)
        return ".";

    *p = '\0';

    return path;
}

295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325
char *av_append_path_component(const char *path, const char *component)
{
    size_t p_len, c_len;
    char *fullpath;

    if (!path)
        return av_strdup(component);
    if (!component)
        return av_strdup(path);

    p_len = strlen(path);
    c_len = strlen(component);
    if (p_len > SIZE_MAX - c_len || p_len + c_len > SIZE_MAX - 2)
        return NULL;
    fullpath = av_malloc(p_len + c_len + 2);
    if (fullpath) {
        if (p_len) {
            av_strlcpy(fullpath, path, p_len + 1);
            if (c_len) {
                if (fullpath[p_len - 1] != '/' && component[0] != '/')
                    fullpath[p_len++] = '/';
                else if (fullpath[p_len - 1] == '/' && component[0] == '/')
                    p_len--;
            }
        }
        av_strlcpy(&fullpath[p_len], component, c_len + 1);
        fullpath[p_len + c_len] = 0;
    }
    return fullpath;
}

Stefano Sabatini's avatar
Stefano Sabatini committed
326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342
int av_escape(char **dst, const char *src, const char *special_chars,
              enum AVEscapeMode mode, int flags)
{
    AVBPrint dstbuf;

    av_bprint_init(&dstbuf, 1, AV_BPRINT_SIZE_UNLIMITED);
    av_bprint_escape(&dstbuf, src, special_chars, mode, flags);

    if (!av_bprint_is_complete(&dstbuf)) {
        av_bprint_finalize(&dstbuf, NULL);
        return AVERROR(ENOMEM);
    } else {
        av_bprint_finalize(&dstbuf, dst);
        return dstbuf.len;
    }
}

343 344 345 346 347 348 349 350 351
int av_match_name(const char *name, const char *names)
{
    const char *p;
    int len, namelen;

    if (!name || !names)
        return 0;

    namelen = strlen(name);
352 353 354 355 356 357
    while (*names) {
        int negate = '-' == *names;
        p = strchr(names, ',');
        if (!p)
            p = names + strlen(names);
        names += negate;
358
        len = FFMAX(p - names, namelen);
359 360 361
        if (!av_strncasecmp(name, names, len) || !strncmp("ALL", names, FFMAX(3, p - names)))
            return !negate;
        names = p + (*p == ',');
362
    }
363
    return 0;
364 365
}

366 367 368 369 370 371
int av_utf8_decode(int32_t *codep, const uint8_t **bufp, const uint8_t *buf_end,
                   unsigned int flags)
{
    const uint8_t *p = *bufp;
    uint32_t top;
    uint64_t code;
372 373 374 375
    int ret = 0, tail_len;
    uint32_t overlong_encoding_mins[6] = {
        0x00000000, 0x00000080, 0x00000800, 0x00010000, 0x00200000, 0x04000000,
    };
376 377 378 379 380 381 382 383 384 385 386 387 388 389

    if (p >= buf_end)
        return 0;

    code = *p++;

    /* first sequence byte starts with 10, or is 1111-1110 or 1111-1111,
       which is not admitted */
    if ((code & 0xc0) == 0x80 || code >= 0xFE) {
        ret = AVERROR(EILSEQ);
        goto end;
    }
    top = (code & 128) >> 1;

390
    tail_len = 0;
391 392
    while (code & top) {
        int tmp;
393
        tail_len++;
394
        if (p >= buf_end) {
395 396
            (*bufp) ++;
            return AVERROR(EILSEQ); /* incomplete sequence */
397 398 399 400 401
        }

        /* we assume the byte to be in the form 10xx-xxxx */
        tmp = *p++ - 128;   /* strip leading 1 */
        if (tmp>>6) {
402 403
            (*bufp) ++;
            return AVERROR(EILSEQ);
404 405 406 407 408 409
        }
        code = (code<<6) + tmp;
        top <<= 5;
    }
    code &= (top << 1) - 1;

410 411 412 413 414 415 416
    /* check for overlong encodings */
    av_assert0(tail_len <= 5);
    if (code < overlong_encoding_mins[tail_len]) {
        ret = AVERROR(EILSEQ);
        goto end;
    }

417
    if (code >= 1U<<31) {
418 419 420 421 422 423 424 425 426 427 428 429 430 431 432
        ret = AVERROR(EILSEQ);  /* out-of-range value */
        goto end;
    }

    *codep = code;

    if (code > 0x10FFFF &&
        !(flags & AV_UTF8_FLAG_ACCEPT_INVALID_BIG_CODES))
        ret = AVERROR(EILSEQ);
    if (code < 0x20 && code != 0x9 && code != 0xA && code != 0xD &&
        flags & AV_UTF8_FLAG_EXCLUDE_XML_INVALID_CONTROL_CODES)
        ret = AVERROR(EILSEQ);
    if (code >= 0xD800 && code <= 0xDFFF &&
        !(flags & AV_UTF8_FLAG_ACCEPT_SURROGATES))
        ret = AVERROR(EILSEQ);
433 434
    if ((code == 0xFFFE || code == 0xFFFF) &&
        !(flags & AV_UTF8_FLAG_ACCEPT_NON_CHARACTERS))
435 436 437 438 439 440 441
        ret = AVERROR(EILSEQ);

end:
    *bufp = p;
    return ret;
}

442 443
int av_match_list(const char *name, const char *list, char separator)
{
444 445 446 447 448
    const char *p, *q;

    for (p = name; p && *p; ) {
        for (q = list; q && *q; ) {
            int k;
449 450
            for (k = 0; p[k] == q[k] || (p[k]*q[k] == 0 && p[k]+q[k] == separator); k++)
                if (k && (!p[k] || p[k] == separator))
451
                    return 1;
452
            q = strchr(q, separator);
453 454
            q += !!q;
        }
455
        p = strchr(p, separator);
456
        p += !!p;
457
    }
458

459 460
    return 0;
}