mirror of
https://github.com/Genymobile/scrcpy
synced 2024-11-18 21:26:07 +00:00
305 lines
7.4 KiB
C
305 lines
7.4 KiB
C
#include <assert.h>
|
|
#include <limits.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <SDL2/SDL.h>
|
|
|
|
#include "util/str_util.h"
|
|
|
|
static void test_xstrncpy_simple(void) {
|
|
char s[] = "xxxxxxxxxx";
|
|
size_t w = xstrncpy(s, "abcdef", sizeof(s));
|
|
|
|
// returns strlen of copied string
|
|
assert(w == 6);
|
|
|
|
// is nul-terminated
|
|
assert(s[6] == '\0');
|
|
|
|
// does not write useless bytes
|
|
assert(s[7] == 'x');
|
|
|
|
// copies the content as expected
|
|
assert(!strcmp("abcdef", s));
|
|
}
|
|
|
|
static void test_xstrncpy_just_fit(void) {
|
|
char s[] = "xxxxxx";
|
|
size_t w = xstrncpy(s, "abcdef", sizeof(s));
|
|
|
|
// returns strlen of copied string
|
|
assert(w == 6);
|
|
|
|
// is nul-terminated
|
|
assert(s[6] == '\0');
|
|
|
|
// copies the content as expected
|
|
assert(!strcmp("abcdef", s));
|
|
}
|
|
|
|
static void test_xstrncpy_truncated(void) {
|
|
char s[] = "xxx";
|
|
size_t w = xstrncpy(s, "abcdef", sizeof(s));
|
|
|
|
// returns 'n' (sizeof(s))
|
|
assert(w == 4);
|
|
|
|
// is nul-terminated
|
|
assert(s[3] == '\0');
|
|
|
|
// copies the content as expected
|
|
assert(!strncmp("abcdef", s, 3));
|
|
}
|
|
|
|
static void test_xstrjoin_simple(void) {
|
|
const char *const tokens[] = { "abc", "de", "fghi", NULL };
|
|
char s[] = "xxxxxxxxxxxxxx";
|
|
size_t w = xstrjoin(s, tokens, ' ', sizeof(s));
|
|
|
|
// returns strlen of concatenation
|
|
assert(w == 11);
|
|
|
|
// is nul-terminated
|
|
assert(s[11] == '\0');
|
|
|
|
// does not write useless bytes
|
|
assert(s[12] == 'x');
|
|
|
|
// copies the content as expected
|
|
assert(!strcmp("abc de fghi", s));
|
|
}
|
|
|
|
static void test_xstrjoin_just_fit(void) {
|
|
const char *const tokens[] = { "abc", "de", "fghi", NULL };
|
|
char s[] = "xxxxxxxxxxx";
|
|
size_t w = xstrjoin(s, tokens, ' ', sizeof(s));
|
|
|
|
// returns strlen of concatenation
|
|
assert(w == 11);
|
|
|
|
// is nul-terminated
|
|
assert(s[11] == '\0');
|
|
|
|
// copies the content as expected
|
|
assert(!strcmp("abc de fghi", s));
|
|
}
|
|
|
|
static void test_xstrjoin_truncated_in_token(void) {
|
|
const char *const tokens[] = { "abc", "de", "fghi", NULL };
|
|
char s[] = "xxxxx";
|
|
size_t w = xstrjoin(s, tokens, ' ', sizeof(s));
|
|
|
|
// returns 'n' (sizeof(s))
|
|
assert(w == 6);
|
|
|
|
// is nul-terminated
|
|
assert(s[5] == '\0');
|
|
|
|
// copies the content as expected
|
|
assert(!strcmp("abc d", s));
|
|
}
|
|
|
|
static void test_xstrjoin_truncated_before_sep(void) {
|
|
const char *const tokens[] = { "abc", "de", "fghi", NULL };
|
|
char s[] = "xxxxxx";
|
|
size_t w = xstrjoin(s, tokens, ' ', sizeof(s));
|
|
|
|
// returns 'n' (sizeof(s))
|
|
assert(w == 7);
|
|
|
|
// is nul-terminated
|
|
assert(s[6] == '\0');
|
|
|
|
// copies the content as expected
|
|
assert(!strcmp("abc de", s));
|
|
}
|
|
|
|
static void test_xstrjoin_truncated_after_sep(void) {
|
|
const char *const tokens[] = { "abc", "de", "fghi", NULL };
|
|
char s[] = "xxxxxxx";
|
|
size_t w = xstrjoin(s, tokens, ' ', sizeof(s));
|
|
|
|
// returns 'n' (sizeof(s))
|
|
assert(w == 8);
|
|
|
|
// is nul-terminated
|
|
assert(s[7] == '\0');
|
|
|
|
// copies the content as expected
|
|
assert(!strcmp("abc de ", s));
|
|
}
|
|
|
|
static void test_strquote(void) {
|
|
const char *s = "abcde";
|
|
char *out = strquote(s);
|
|
|
|
// add '"' at the beginning and the end
|
|
assert(!strcmp("\"abcde\"", out));
|
|
|
|
SDL_free(out);
|
|
}
|
|
|
|
static void test_utf8_truncate(void) {
|
|
const char *s = "aÉbÔc";
|
|
assert(strlen(s) == 7); // É and Ô are 2 bytes-wide
|
|
|
|
size_t count;
|
|
|
|
count = utf8_truncation_index(s, 1);
|
|
assert(count == 1);
|
|
|
|
count = utf8_truncation_index(s, 2);
|
|
assert(count == 1); // É is 2 bytes-wide
|
|
|
|
count = utf8_truncation_index(s, 3);
|
|
assert(count == 3);
|
|
|
|
count = utf8_truncation_index(s, 4);
|
|
assert(count == 4);
|
|
|
|
count = utf8_truncation_index(s, 5);
|
|
assert(count == 4); // Ô is 2 bytes-wide
|
|
|
|
count = utf8_truncation_index(s, 6);
|
|
assert(count == 6);
|
|
|
|
count = utf8_truncation_index(s, 7);
|
|
assert(count == 7);
|
|
|
|
count = utf8_truncation_index(s, 8);
|
|
assert(count == 7); // no more chars
|
|
}
|
|
|
|
static void test_parse_integer(void) {
|
|
long value;
|
|
bool ok = parse_integer("1234", &value);
|
|
assert(ok);
|
|
assert(value == 1234);
|
|
|
|
ok = parse_integer("-1234", &value);
|
|
assert(ok);
|
|
assert(value == -1234);
|
|
|
|
ok = parse_integer("1234k", &value);
|
|
assert(!ok);
|
|
|
|
ok = parse_integer("123456789876543212345678987654321", &value);
|
|
assert(!ok); // out-of-range
|
|
}
|
|
|
|
static void test_parse_integers(void) {
|
|
long values[5];
|
|
|
|
size_t count = parse_integers("1234", ':', 5, values);
|
|
assert(count == 1);
|
|
assert(values[0] == 1234);
|
|
|
|
count = parse_integers("1234:5678", ':', 5, values);
|
|
assert(count == 2);
|
|
assert(values[0] == 1234);
|
|
assert(values[1] == 5678);
|
|
|
|
count = parse_integers("1234:5678", ':', 2, values);
|
|
assert(count == 2);
|
|
assert(values[0] == 1234);
|
|
assert(values[1] == 5678);
|
|
|
|
count = parse_integers("1234:-5678", ':', 2, values);
|
|
assert(count == 2);
|
|
assert(values[0] == 1234);
|
|
assert(values[1] == -5678);
|
|
|
|
count = parse_integers("1:2:3:4:5", ':', 5, values);
|
|
assert(count == 5);
|
|
assert(values[0] == 1);
|
|
assert(values[1] == 2);
|
|
assert(values[2] == 3);
|
|
assert(values[3] == 4);
|
|
assert(values[4] == 5);
|
|
|
|
count = parse_integers("1234:5678", ':', 1, values);
|
|
assert(count == 0); // max_items == 1
|
|
|
|
count = parse_integers("1:2:3:4:5", ':', 3, values);
|
|
assert(count == 0); // max_items == 3
|
|
|
|
count = parse_integers(":1234", ':', 5, values);
|
|
assert(count == 0); // invalid
|
|
|
|
count = parse_integers("1234:", ':', 5, values);
|
|
assert(count == 0); // invalid
|
|
|
|
count = parse_integers("1234:", ':', 1, values);
|
|
assert(count == 0); // invalid, even when max_items == 1
|
|
|
|
count = parse_integers("1234::5678", ':', 5, values);
|
|
assert(count == 0); // invalid
|
|
}
|
|
|
|
static void test_parse_integer_with_suffix(void) {
|
|
long value;
|
|
bool ok = parse_integer_with_suffix("1234", &value);
|
|
assert(ok);
|
|
assert(value == 1234);
|
|
|
|
ok = parse_integer_with_suffix("-1234", &value);
|
|
assert(ok);
|
|
assert(value == -1234);
|
|
|
|
ok = parse_integer_with_suffix("1234k", &value);
|
|
assert(ok);
|
|
assert(value == 1234000);
|
|
|
|
ok = parse_integer_with_suffix("1234m", &value);
|
|
assert(ok);
|
|
assert(value == 1234000000);
|
|
|
|
ok = parse_integer_with_suffix("-1234k", &value);
|
|
assert(ok);
|
|
assert(value == -1234000);
|
|
|
|
ok = parse_integer_with_suffix("-1234m", &value);
|
|
assert(ok);
|
|
assert(value == -1234000000);
|
|
|
|
ok = parse_integer_with_suffix("123456789876543212345678987654321", &value);
|
|
assert(!ok); // out-of-range
|
|
|
|
char buf[32];
|
|
|
|
sprintf(buf, "%ldk", LONG_MAX / 2000);
|
|
ok = parse_integer_with_suffix(buf, &value);
|
|
assert(ok);
|
|
assert(value == LONG_MAX / 2000 * 1000);
|
|
|
|
sprintf(buf, "%ldm", LONG_MAX / 2000);
|
|
ok = parse_integer_with_suffix(buf, &value);
|
|
assert(!ok);
|
|
|
|
sprintf(buf, "%ldk", LONG_MIN / 2000);
|
|
ok = parse_integer_with_suffix(buf, &value);
|
|
assert(ok);
|
|
assert(value == LONG_MIN / 2000 * 1000);
|
|
|
|
sprintf(buf, "%ldm", LONG_MIN / 2000);
|
|
ok = parse_integer_with_suffix(buf, &value);
|
|
assert(!ok);
|
|
}
|
|
|
|
int main(void) {
|
|
test_xstrncpy_simple();
|
|
test_xstrncpy_just_fit();
|
|
test_xstrncpy_truncated();
|
|
test_xstrjoin_simple();
|
|
test_xstrjoin_just_fit();
|
|
test_xstrjoin_truncated_in_token();
|
|
test_xstrjoin_truncated_before_sep();
|
|
test_xstrjoin_truncated_after_sep();
|
|
test_strquote();
|
|
test_utf8_truncate();
|
|
test_parse_integer();
|
|
test_parse_integers();
|
|
test_parse_integer_with_suffix();
|
|
return 0;
|
|
}
|