• Home
  • Raw
  • Download

Lines Matching +full:libinput +full:- +full:test +full:- +full:suite +full:- +full:switch

30 #include "util-list.h"
31 #include "util-strings.h"
32 #include "util-time.h"
33 #include "util-prop-parsers.h"
34 #include "util-macros.h"
35 #include "util-bits.h"
36 #include "util-ratelimit.h"
37 #include "util-matrix.h"
40 #include "libinput-versionsort.h"
42 #include "check-double-macros.h"
84 ck_assert_int_eq(entry->a, sexpected.a); in START_TEST()
85 ck_assert_int_eq(entry->b, sexpected.b); in START_TEST()
86 ck_assert_ptr_eq(entry->ptr, sexpected.ptr); in START_TEST()
98 * test: 0, 1, 7, 8, 31, 32, and 33 in START_TEST()
107 switch (i) { in START_TEST()
274 { "*-23412, 450, 800", 0 }, in START_TEST()
275 { "112@125, 450@125, 800@125, 900@-125", 0 }, in START_TEST()
298 { "-12", -12 }, in START_TEST()
302 { "-0", 0 }, in START_TEST()
305 { "10-", 0 }, in START_TEST()
325 { "-12", -12 }, in START_TEST()
329 { "-0", 0 }, in START_TEST()
332 { "10-", 0 }, in START_TEST()
362 { "-10x10", false, 0, 0 }, in START_TEST()
363 { "-1", false, 0, 0 }, in START_TEST()
364 { "1x-99", false, 0, 0 }, in START_TEST()
494 { "100:-1", true, 100, -1 }, in START_TEST()
495 { "-203813:-502023", true, -203813, -502023 }, in START_TEST()
535 { "-1", false, false }, in START_TEST()
567 { "-EV_ABS;", true, 1, {{ .type = EV_ABS, .code = 0xffff, .value = 0 }} }, in START_TEST()
569 { "-SW_TABLET_MODE;", true, 1, {{ .type = EV_SW, .code = SW_TABLET_MODE, .value = 0 }} }, in START_TEST()
571 { "-ABS_Y", true, 1, {{ .type = EV_ABS, .code = ABS_Y, .value = 0 }} }, in START_TEST()
573 { "-EV_ABS:01", true, 1, {{ .type = EV_ABS, .code = ABS_Y, .value = 0 }} }, in START_TEST()
574 { "+ABS_TILT_X;-ABS_TILT_Y;", true, 2, in START_TEST()
577 { "+BTN_TOOL_DOUBLETAP;+EV_KEY;-KEY_A", true, 3, in START_TEST()
581 { "+REL_Y;-ABS_Z;+BTN_STYLUS", true, 3, in START_TEST()
585 { "-REL_Y;+EV_KEY:0x123;-BTN_STYLUS", true, 3, in START_TEST()
591 { .prop = "-", .success = false }, in START_TEST()
594 { .prop = "+EV_KEY;-EV_FOO", .success = false }, in START_TEST()
595 { .prop = "+BTN_STYLUS;-EV_FOO", .success = false }, in START_TEST()
596 { .prop = "-BTN_UNKNOWN", .success = false }, in START_TEST()
598 { .prop = "-PR_UNKNOWN", .success = false }, in START_TEST()
599 { .prop = "-BTN_STYLUS;+PR_UNKNOWN;-ABS_X", .success = false }, in START_TEST()
600 { .prop = "-EV_REL:0xffff", .success = false }, in START_TEST()
601 { .prop = "-EV_REL:0x123.", .success = false }, in START_TEST()
602 { .prop = "-EV_REL:ffff", .success = false }, in START_TEST()
603 { .prop = "-EV_REL:blah", .success = false }, in START_TEST()
618 success = parse_evcode_property(t->prop, events, &nevents); in START_TEST()
619 ck_assert(success == t->success); in START_TEST()
623 ck_assert_int_eq(nevents, t->nevents); in START_TEST()
628 ck_assert_int_eq(t->events[j].type, type); in START_TEST()
629 ck_assert_int_eq(t->events[j].code, code); in START_TEST()
630 ck_assert_int_eq(t->events[j].value, value); in START_TEST()
645 { "+INPUT_PROP_BUTTONPAD;-INPUT_PROP_POINTER", true, 2, in START_TEST()
648 { "+INPUT_PROP_BUTTONPAD;-0x00;+0x03", true, 3, in START_TEST()
669 success = parse_input_prop_property(t->prop, props, &nprops); in START_TEST()
670 ck_assert(success == t->success); in START_TEST()
674 ck_assert_int_eq(nprops, t->nvals); in START_TEST()
675 for (size_t j = 0; j < t->nvals; j++) { in START_TEST()
676 ck_assert_int_eq(t->values[j].prop, props[j].prop); in START_TEST()
677 ck_assert_int_eq(t->values[j].enabled, props[j].enabled); in START_TEST()
685 struct test { in START_TEST() struct
742 mask = parse_evdev_abs_prop(t->prop, &abs); in START_TEST()
743 ck_assert_int_eq(mask, t->which); in START_TEST()
745 if (t->which & ABS_MASK_MIN) in START_TEST()
746 ck_assert_int_eq(abs.minimum, t->min); in START_TEST()
747 if (t->which & ABS_MASK_MAX) in START_TEST()
748 ck_assert_int_eq(abs.maximum, t->max); in START_TEST()
749 if (t->which & ABS_MASK_RES) in START_TEST()
750 ck_assert_int_eq(abs.resolution, t->res); in START_TEST()
751 if (t->which & ABS_MASK_FUZZ) in START_TEST()
752 ck_assert_int_eq(abs.fuzz, t->fuzz); in START_TEST()
753 if (t->which & ABS_MASK_FLAT) in START_TEST()
754 ck_assert_int_eq(abs.flat, t->flat); in START_TEST()
812 { "-1", true, -1 }, in START_TEST()
814 { "-2147483648", true, -2147483648 }, in START_TEST()
817 { "-10x10", false, 0 }, in START_TEST()
818 { "1x-99", false, 0 }, in START_TEST()
847 { "-1", true, -1 }, in START_TEST()
851 { "-10", true, -0x10 }, in START_TEST()
854 { "0x-99", false, 0 }, in START_TEST()
882 { "-1", true, -1 }, in START_TEST()
887 { "-10", true, -010 }, in START_TEST()
891 { "0x-99", false, 0 }, in START_TEST()
924 { "-1", false, 0 }, in START_TEST()
926 { "-2147483648", false, 0}, in START_TEST()
928 { "-10x10", false, 0 }, in START_TEST()
929 { "1x-99", false, 0 }, in START_TEST()
958 { "-1", false, 0 }, in START_TEST()
962 { "-10", false, 0 }, in START_TEST()
965 { "0x-99", false, 0 }, in START_TEST()
993 { "-1", false, 0 }, in START_TEST()
998 { "-10", false, 0 }, in START_TEST()
1002 { "0x-99", false, 0 }, in START_TEST()
1033 { "-1", true, -1 }, in START_TEST()
1035 { "-2147483648", true, -2147483648 }, in START_TEST()
1044 { "-324.9", true, -324.9 }, in START_TEST()
1048 { "-10x10", false, 0 }, in START_TEST()
1049 { "1x-99", false, 0 }, in START_TEST()
1090 { "+1-2++3--4++-+5-+-", "+-", { "1", "2", "3", "4", "5", NULL }, 5 }, in START_TEST()
1100 while (t->string) { in START_TEST()
1102 char **strv = strv_from_string(t->string, t->delim, &nelem); in START_TEST()
1104 for (size_t idx = 0; idx < t->nresults; idx++) in START_TEST()
1105 ck_assert_str_eq(t->results[idx], strv[idx]); in START_TEST()
1107 ck_assert_uint_eq(nelem, t->nresults); in START_TEST()
1111 if(t->nresults == 0) in START_TEST()
1114 ck_assert_ptr_eq(strv[t->nresults], NULL); in START_TEST()
1150 while (t->string) { in START_TEST()
1152 double *array = double_array_from_string(t->string, in START_TEST()
1153 t->delim, in START_TEST()
1155 ck_assert_int_eq(len, t->len); in START_TEST()
1158 ck_assert_double_eq(array[idx], t->array[idx]); in START_TEST()
1184 char **strv = strv_from_argv(t->argc, t->argv); in START_TEST()
1186 if (t->expected == 0) { in START_TEST()
1192 ck_assert_str_eq(*s, t->argv[count]); in START_TEST()
1196 ck_assert_int_eq(t->expected, count); in START_TEST()
1216 { "1.0x2.3 -3.2x4.5 8.090909x-6.00", " ", "x", 3, { {1.0, 2.3}, {-3.2, 4.5}, {8.090909, -6}}}, in START_TEST()
1219 { "1:2", ":", "x", -1, {}}, in START_TEST()
1220 { "1:2", NULL, "x", -1, {}}, in START_TEST()
1221 { "1:2", "", "x", -1, {}}, in START_TEST()
1222 { "1:2", "x", NULL, -1, {}}, in START_TEST()
1223 { "1:2", "x", "", -1, {}}, in START_TEST()
1224 { "a:b", "x", ":", -1, {}}, in START_TEST()
1225 { "", " ", "x", -1, {}}, in START_TEST()
1226 { "1.2.3.4.5", ".", "", -1, {}}, in START_TEST()
1231 while (t->string) { in START_TEST()
1235 npairs = kv_double_from_string(t->string, in START_TEST()
1236 t->psep, in START_TEST()
1237 t->kvsep, in START_TEST()
1239 ck_assert_int_eq(npairs, t->nresults); in START_TEST()
1242 ck_assert_double_eq(t->results[i].a, result[i].key); in START_TEST()
1243 ck_assert_double_eq(t->results[i].b, result[i].value); in START_TEST()
1276 while (t->strv[0]) { in START_TEST()
1278 str = strv_join(t->strv, t->joiner); in START_TEST()
1279 if (t->result == NULL) in START_TEST()
1282 ck_assert_str_eq(str, t->result); in START_TEST()
1319 while (t->string) { in START_TEST()
1321 str = strstrip(t->string, t->what); in START_TEST()
1322 ck_assert_str_eq(str, t->expected); in START_TEST()
1346 for (struct strendswith_test *t = tests; t->string; t++) { in START_TEST()
1347 ck_assert_int_eq(strendswith(t->string, t->suffix), in START_TEST()
1348 t->expected); in START_TEST()
1370 for (struct strstartswith_test *t = tests; t->string; t++) { in START_TEST()
1371 ck_assert_int_eq(strstartswith(t->string, t->suffix), in START_TEST()
1372 t->expected); in START_TEST()
1394 for (struct strsanitize_test *t = tests; t->string; t++) { in START_TEST()
1395 char *sanitized = str_sanitize(t->string); in START_TEST()
1396 ck_assert_str_eq(sanitized, t->expected); in START_TEST()
1420 list_insert(&head, &t->node); in START_TEST()
1425 ck_assert_int_eq(t->val, val); in START_TEST()
1426 val--; in START_TEST()
1451 list_append(&head, &t->node); in START_TEST()
1456 ck_assert_int_eq(t->val, val); in START_TEST()
1480 list_append(&head, &t->node); in START_TEST()
1502 ck_assert_int_eq(libinput_strverscmp("0.0.1", "0.0.2"), -1); in START_TEST()
1504 ck_assert_int_eq(libinput_strverscmp("0.0.1", "0.1.0"), -1); in START_TEST()
1533 struct test { in START_TEST() struct
1551 const char *result = safe_basename(t->path); in START_TEST()
1552 if (t->expected == NULL) in START_TEST()
1555 ck_assert_str_eq(result, t->expected); in START_TEST()
1561 struct test { in START_TEST() struct
1578 char *result = trunkname(t->path); in START_TEST()
1579 ck_assert_str_eq(result, t->expected); in START_TEST()
1585 static Suite *
1589 Suite *s; in litest_utils_suite()
1646 Suite *s; in main()