build: Merge submodules into repo
This commit is contained in:
parent
540a30f719
commit
4c64279f90
422 changed files with 106715 additions and 8 deletions
86
src/minarch/libretro-common/test/hash/test_hash.c
Normal file
86
src/minarch/libretro-common/test/hash/test_hash.c
Normal file
|
|
@ -0,0 +1,86 @@
|
|||
/* Copyright (C) 2021 The RetroArch team
|
||||
*
|
||||
* ---------------------------------------------------------------------------------------
|
||||
* The following license statement only applies to this file (test_stdstring.c).
|
||||
* ---------------------------------------------------------------------------------------
|
||||
*
|
||||
* Permission is hereby granted, free of charge,
|
||||
* to any person obtaining a copy of this software and associated documentation files (the "Software"),
|
||||
* to deal in the Software without restriction, including without limitation the rights to
|
||||
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
|
||||
* and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
||||
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
||||
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <check.h>
|
||||
#include <stdarg.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
|
||||
#include <lrc_hash.h>
|
||||
|
||||
#define SUITE_NAME "hash"
|
||||
|
||||
START_TEST (test_sha256)
|
||||
{
|
||||
char output[65];
|
||||
sha256_hash(output, (uint8_t*)"abc", 3);
|
||||
ck_assert(!strcmp(output,
|
||||
"ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad"));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_sha1)
|
||||
{
|
||||
char output[41];
|
||||
char tmpfile[512];
|
||||
FILE *fd;
|
||||
tmpnam(tmpfile);
|
||||
fd = fopen(tmpfile, "wb");
|
||||
ck_assert(fd != NULL);
|
||||
fwrite("abc", 1, 3, fd);
|
||||
fclose(fd);
|
||||
sha1_calculate(tmpfile, output);
|
||||
|
||||
ck_assert(!strcmp(output,
|
||||
"A9993E364706816ABA3E25717850C26C9CD0D89D"));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_djb2)
|
||||
{
|
||||
ck_assert_uint_eq(djb2_calculate("retroarch"), 0xFADF3BCF);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
Suite *create_suite(void)
|
||||
{
|
||||
Suite *s = suite_create(SUITE_NAME);
|
||||
|
||||
TCase *tc_core = tcase_create("Core");
|
||||
tcase_add_test(tc_core, test_sha256);
|
||||
tcase_add_test(tc_core, test_sha1);
|
||||
tcase_add_test(tc_core, test_djb2);
|
||||
suite_add_tcase(s, tc_core);
|
||||
|
||||
return s;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int num_fail;
|
||||
Suite *s = create_suite();
|
||||
SRunner *sr = srunner_create(s);
|
||||
srunner_run_all(sr, CK_NORMAL);
|
||||
num_fail = srunner_ntests_failed(sr);
|
||||
srunner_free(sr);
|
||||
return (num_fail == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
|
||||
}
|
||||
1300
src/minarch/libretro-common/test/lists/test_linked_list.c
Normal file
1300
src/minarch/libretro-common/test/lists/test_linked_list.c
Normal file
File diff suppressed because it is too large
Load diff
410
src/minarch/libretro-common/test/queues/test_generic_queue.c
Normal file
410
src/minarch/libretro-common/test/queues/test_generic_queue.c
Normal file
|
|
@ -0,0 +1,410 @@
|
|||
/* Copyright (C) 2010-2020 The RetroArch team
|
||||
*
|
||||
* ---------------------------------------------------------------------------------------
|
||||
* The following license statement only applies to this file (test_generic_queue.c).
|
||||
* ---------------------------------------------------------------------------------------
|
||||
*
|
||||
* Permission is hereby granted, free of charge,
|
||||
* to any person obtaining a copy of this software and associated documentation files (the "Software"),
|
||||
* to deal in the Software without restriction, including without limitation the rights to
|
||||
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
|
||||
* and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
||||
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
||||
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
#include <check.h>
|
||||
#include <stdarg.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include <queues/generic_queue.h>
|
||||
|
||||
#define SUITE_NAME "Generic Queue"
|
||||
|
||||
static char *_value_1 = "value1";
|
||||
static char *_value_2 = "value2";
|
||||
static char *_value_3 = "value3";
|
||||
|
||||
START_TEST (test_generic_queue_create)
|
||||
{
|
||||
generic_queue_t *queue = generic_queue_new();
|
||||
ck_assert_ptr_nonnull(queue);
|
||||
generic_queue_free(queue, NULL);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_free)
|
||||
{
|
||||
generic_queue_t *queue = generic_queue_new();
|
||||
generic_queue_free(queue, NULL);
|
||||
generic_queue_free(NULL, NULL);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_push_pop)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
char *value;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 1);
|
||||
value = (char *) generic_queue_pop(queue);
|
||||
ck_assert_ptr_eq(value, _value_1);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 0);
|
||||
|
||||
generic_queue_push(queue, _value_2);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 1);
|
||||
generic_queue_push(queue, _value_3);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 2);
|
||||
value = (char *) generic_queue_pop(queue);
|
||||
ck_assert_ptr_eq(value, _value_3);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 1);
|
||||
value = (char *) generic_queue_pop(queue);
|
||||
ck_assert_ptr_eq(value, _value_2);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 0);
|
||||
|
||||
generic_queue_free(queue, NULL);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_peek)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
|
||||
queue = generic_queue_new();
|
||||
ck_assert_ptr_null(generic_queue_peek(queue));
|
||||
ck_assert_ptr_null(generic_queue_peek_first(queue));
|
||||
|
||||
generic_queue_push(queue, _value_1);
|
||||
ck_assert_ptr_eq(_value_1, generic_queue_peek(queue));
|
||||
ck_assert_ptr_eq(_value_1, generic_queue_peek_first(queue));
|
||||
|
||||
generic_queue_push(queue, _value_2);
|
||||
ck_assert_ptr_eq(_value_2, generic_queue_peek(queue));
|
||||
ck_assert_ptr_eq(_value_1, generic_queue_peek_first(queue));
|
||||
|
||||
generic_queue_push(queue, _value_3);
|
||||
ck_assert_ptr_eq(_value_3, generic_queue_peek(queue));
|
||||
ck_assert_ptr_eq(_value_1, generic_queue_peek_first(queue));
|
||||
|
||||
generic_queue_free(queue, NULL);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_shift_unshift)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
char *value;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_shift(queue, _value_1);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 1);
|
||||
value = (char *) generic_queue_unshift(queue);
|
||||
ck_assert_ptr_eq(value, _value_1);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 0);
|
||||
|
||||
generic_queue_shift(queue, _value_2);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 1);
|
||||
generic_queue_shift(queue, _value_3);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 2);
|
||||
value = (char *) generic_queue_unshift(queue);
|
||||
ck_assert_ptr_eq(value, _value_3);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 1);
|
||||
value = (char *) generic_queue_unshift(queue);
|
||||
ck_assert_ptr_eq(value, _value_2);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 0);
|
||||
|
||||
generic_queue_free(queue, NULL);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_empty)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
|
||||
queue = generic_queue_new();
|
||||
ck_assert_ptr_null(generic_queue_pop(queue));
|
||||
ck_assert_ptr_null(generic_queue_unshift(queue));
|
||||
generic_queue_free(queue, NULL);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
void _free_value(void *value)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
START_TEST (test_generic_queue_iterator)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
generic_queue_iterator_t *iterator;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
generic_queue_push(queue, _value_2);
|
||||
generic_queue_push(queue, _value_3);
|
||||
|
||||
iterator = generic_queue_iterator(queue, true);
|
||||
ck_assert_ptr_nonnull(iterator);
|
||||
ck_assert_ptr_eq(generic_queue_iterator_value(iterator), _value_1);
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
ck_assert_ptr_nonnull(iterator);
|
||||
ck_assert_ptr_eq(generic_queue_iterator_value(iterator), _value_2);
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
ck_assert_ptr_nonnull(iterator);
|
||||
ck_assert_ptr_eq(generic_queue_iterator_value(iterator), _value_3);
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
ck_assert_ptr_null(iterator);
|
||||
|
||||
iterator = generic_queue_iterator(queue, false);
|
||||
ck_assert_ptr_nonnull(iterator);
|
||||
ck_assert_ptr_eq(generic_queue_iterator_value(iterator), _value_3);
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
ck_assert_ptr_nonnull(iterator);
|
||||
ck_assert_ptr_eq(generic_queue_iterator_value(iterator), _value_2);
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
ck_assert_ptr_nonnull(iterator);
|
||||
ck_assert_ptr_eq(generic_queue_iterator_value(iterator), _value_1);
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
ck_assert_ptr_null(iterator);
|
||||
|
||||
generic_queue_free(queue, &_free_value);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_shift_free)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
|
||||
queue = generic_queue_new();
|
||||
|
||||
generic_queue_shift(queue, _value_1);
|
||||
generic_queue_shift(queue, _value_2);
|
||||
generic_queue_shift(queue, _value_3);
|
||||
|
||||
generic_queue_free(queue, &_free_value);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_remove_one)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
generic_queue_iterator_t *iterator;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
|
||||
iterator = generic_queue_iterator(queue, true);
|
||||
iterator = generic_queue_iterator_remove(iterator);
|
||||
ck_assert_ptr_null(iterator);
|
||||
ck_assert_int_eq(generic_queue_length(queue), 0);
|
||||
|
||||
generic_queue_free(queue, NULL);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
static void _verify_queue_values(generic_queue_t *queue, int count, ...)
|
||||
{
|
||||
va_list values_list;
|
||||
void **values;
|
||||
int i;
|
||||
generic_queue_iterator_t *iterator;
|
||||
|
||||
values = (void **)malloc(count * sizeof(void *));
|
||||
|
||||
ck_assert_int_eq(count, generic_queue_length(queue));
|
||||
|
||||
va_start(values_list, count);
|
||||
for (i = 0; i < count; i++)
|
||||
values[i] = va_arg(values_list, void *);
|
||||
va_end(values_list);
|
||||
|
||||
iterator = generic_queue_iterator(queue, true);
|
||||
for (i = 0; i < count; i++)
|
||||
{
|
||||
ck_assert_ptr_nonnull(iterator);
|
||||
ck_assert_ptr_eq(values[i], generic_queue_iterator_value(iterator));
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
}
|
||||
ck_assert_ptr_null(iterator);
|
||||
|
||||
iterator = generic_queue_iterator(queue, false);
|
||||
for (i = count - 1; i >= 0; i--)
|
||||
{
|
||||
ck_assert_ptr_nonnull(iterator);
|
||||
ck_assert_ptr_eq(values[i], generic_queue_iterator_value(iterator));
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
}
|
||||
ck_assert_ptr_null(iterator);
|
||||
|
||||
free(values);
|
||||
}
|
||||
|
||||
START_TEST (test_generic_queue_iterator_remove_first)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
generic_queue_iterator_t *iterator;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
generic_queue_push(queue, _value_2);
|
||||
generic_queue_push(queue, _value_3);
|
||||
|
||||
iterator = generic_queue_iterator(queue, true);
|
||||
iterator = generic_queue_iterator_remove(iterator);
|
||||
generic_queue_iterator_free(iterator);
|
||||
|
||||
_verify_queue_values(queue, 2, _value_2, _value_3);
|
||||
|
||||
generic_queue_free(queue, &_free_value);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_iterator_remove_middle)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
generic_queue_iterator_t *iterator;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
generic_queue_push(queue, _value_2);
|
||||
generic_queue_push(queue, _value_3);
|
||||
|
||||
iterator = generic_queue_iterator(queue, true);
|
||||
iterator = generic_queue_iterator_next(iterator);
|
||||
iterator = generic_queue_iterator_remove(iterator);
|
||||
generic_queue_iterator_free(iterator);
|
||||
|
||||
_verify_queue_values(queue, 2, _value_1, _value_3);
|
||||
|
||||
generic_queue_free(queue, &_free_value);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_iterator_remove_last)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
generic_queue_iterator_t *iterator;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
generic_queue_push(queue, _value_2);
|
||||
generic_queue_push(queue, _value_3);
|
||||
|
||||
iterator = generic_queue_iterator(queue, false);
|
||||
iterator = generic_queue_iterator_remove(iterator);
|
||||
generic_queue_iterator_free(iterator);
|
||||
|
||||
_verify_queue_values(queue, 2, _value_1, _value_2);
|
||||
|
||||
generic_queue_free(queue, &_free_value);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_generic_queue_remove_first)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
generic_queue_push(queue, _value_2);
|
||||
generic_queue_push(queue, _value_3);
|
||||
|
||||
ck_assert_ptr_eq(generic_queue_remove(queue, _value_1), _value_1);
|
||||
|
||||
_verify_queue_values(queue, 2, _value_2, _value_3);
|
||||
|
||||
generic_queue_free(queue, &_free_value);
|
||||
}
|
||||
|
||||
START_TEST (test_generic_queue_remove_middle)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
generic_queue_push(queue, _value_2);
|
||||
generic_queue_push(queue, _value_3);
|
||||
|
||||
ck_assert_ptr_eq(generic_queue_remove(queue, _value_2), _value_2);
|
||||
|
||||
_verify_queue_values(queue, 2, _value_1, _value_3);
|
||||
|
||||
generic_queue_free(queue, &_free_value);
|
||||
}
|
||||
|
||||
START_TEST (test_generic_queue_remove_last)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
generic_queue_push(queue, _value_2);
|
||||
generic_queue_push(queue, _value_3);
|
||||
|
||||
ck_assert_ptr_eq(generic_queue_remove(queue, _value_3), _value_3);
|
||||
|
||||
_verify_queue_values(queue, 2, _value_1, _value_2);
|
||||
|
||||
generic_queue_free(queue, &_free_value);
|
||||
}
|
||||
|
||||
START_TEST (test_generic_queue_iterator_free)
|
||||
{
|
||||
generic_queue_t *queue;
|
||||
generic_queue_iterator_t *iterator;
|
||||
|
||||
queue = generic_queue_new();
|
||||
generic_queue_push(queue, _value_1);
|
||||
iterator = generic_queue_iterator(queue, true);
|
||||
|
||||
generic_queue_iterator_free(iterator);
|
||||
generic_queue_iterator_free(NULL);
|
||||
|
||||
generic_queue_free(queue, _free_value);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
Suite *create_suite(void)
|
||||
{
|
||||
Suite *s = suite_create(SUITE_NAME);
|
||||
|
||||
TCase *tc_core = tcase_create("Core");
|
||||
tcase_add_test(tc_core, test_generic_queue_create);
|
||||
tcase_add_test(tc_core, test_generic_queue_free);
|
||||
tcase_add_test(tc_core, test_generic_queue_push_pop);
|
||||
tcase_add_test(tc_core, test_generic_queue_peek);
|
||||
tcase_add_test(tc_core, test_generic_queue_shift_unshift);
|
||||
tcase_add_test(tc_core, test_generic_queue_empty);
|
||||
tcase_add_test(tc_core, test_generic_queue_iterator);
|
||||
tcase_add_test(tc_core, test_generic_queue_shift_free);
|
||||
tcase_add_test(tc_core, test_generic_queue_remove_one);
|
||||
tcase_add_test(tc_core, test_generic_queue_iterator_remove_first);
|
||||
tcase_add_test(tc_core, test_generic_queue_iterator_remove_middle);
|
||||
tcase_add_test(tc_core, test_generic_queue_iterator_remove_last);
|
||||
tcase_add_test(tc_core, test_generic_queue_remove_first);
|
||||
tcase_add_test(tc_core, test_generic_queue_remove_middle);
|
||||
tcase_add_test(tc_core, test_generic_queue_remove_last);
|
||||
tcase_add_test(tc_core, test_generic_queue_iterator_free);
|
||||
suite_add_tcase(s, tc_core);
|
||||
|
||||
return s;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int num_fail;
|
||||
Suite *s = create_suite();
|
||||
SRunner *sr = srunner_create(s);
|
||||
srunner_run_all(sr, CK_NORMAL);
|
||||
num_fail = srunner_ntests_failed(sr);
|
||||
srunner_free(sr);
|
||||
return (num_fail == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
|
||||
}
|
||||
321
src/minarch/libretro-common/test/string/test_stdstring.c
Normal file
321
src/minarch/libretro-common/test/string/test_stdstring.c
Normal file
|
|
@ -0,0 +1,321 @@
|
|||
/* Copyright (C) 2021 The RetroArch team
|
||||
*
|
||||
* ---------------------------------------------------------------------------------------
|
||||
* The following license statement only applies to this file (test_stdstring.c).
|
||||
* ---------------------------------------------------------------------------------------
|
||||
*
|
||||
* Permission is hereby granted, free of charge,
|
||||
* to any person obtaining a copy of this software and associated documentation files (the "Software"),
|
||||
* to deal in the Software without restriction, including without limitation the rights to
|
||||
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
|
||||
* and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
||||
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
||||
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <check.h>
|
||||
#include <stdarg.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
|
||||
#include <string/stdstring.h>
|
||||
#include <encodings/utf.h>
|
||||
|
||||
#define SUITE_NAME "stdstring"
|
||||
|
||||
START_TEST (test_string_filter)
|
||||
{
|
||||
char test1[] = "foo bar some string";
|
||||
char test2[] = "";
|
||||
string_remove_all_chars(test1, 's');
|
||||
string_remove_all_chars(test2, '0');
|
||||
string_remove_all_chars(NULL, 'a');
|
||||
ck_assert(!strcmp(test1, "foo bar ome tring"));
|
||||
ck_assert(!strcmp(test2, ""));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_string_replace)
|
||||
{
|
||||
char test1[] = "foo bar some string";
|
||||
string_replace_all_chars(test1, 's', 'S');
|
||||
string_replace_all_chars(NULL, 'a', 'A');
|
||||
ck_assert(!strcmp(test1, "foo bar Some String"));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_string_case)
|
||||
{
|
||||
char test1[] = "foo";
|
||||
char test2[] = "01foOo[]_";
|
||||
ck_assert(!strcmp(string_to_upper(test1), "FOO"));
|
||||
ck_assert(!strcmp(string_to_upper(test2), "01FOOO[]_"));
|
||||
ck_assert(!strcmp(string_to_lower(test2), "01fooo[]_"));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_string_char_classify)
|
||||
{
|
||||
ck_assert(ISSPACE(' '));
|
||||
ck_assert(ISSPACE('\n'));
|
||||
ck_assert(ISSPACE('\r'));
|
||||
ck_assert(ISSPACE('\t'));
|
||||
ck_assert(!ISSPACE('a'));
|
||||
|
||||
ck_assert(ISALPHA('a'));
|
||||
ck_assert(ISALPHA('Z'));
|
||||
ck_assert(!ISALPHA('5'));
|
||||
|
||||
ck_assert(ISALNUM('a'));
|
||||
ck_assert(ISALNUM('Z'));
|
||||
ck_assert(ISALNUM('5'));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_string_num_conv)
|
||||
{
|
||||
ck_assert_uint_eq(3, string_to_unsigned("3"));
|
||||
ck_assert_uint_eq(2147483647, string_to_unsigned("2147483647"));
|
||||
ck_assert_uint_eq(0, string_to_unsigned("foo"));
|
||||
ck_assert_uint_eq(0, string_to_unsigned("-1"));
|
||||
ck_assert_uint_eq(0, string_to_unsigned(NULL));
|
||||
|
||||
ck_assert_uint_eq(10, string_hex_to_unsigned("0xa"));
|
||||
ck_assert_uint_eq(10, string_hex_to_unsigned("a"));
|
||||
ck_assert_uint_eq(255, string_hex_to_unsigned("FF"));
|
||||
ck_assert_uint_eq(255, string_hex_to_unsigned("0xff"));
|
||||
ck_assert_uint_eq(0, string_hex_to_unsigned("0xfzzf"));
|
||||
ck_assert_uint_eq(0, string_hex_to_unsigned("0x"));
|
||||
ck_assert_uint_eq(0, string_hex_to_unsigned("0xx"));
|
||||
ck_assert_uint_eq(0, string_hex_to_unsigned(NULL));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_string_tokenizer)
|
||||
{
|
||||
char *testinput = "@@1@@2@@3@@@@9@@@";
|
||||
char **ptr = &testinput;
|
||||
char *token = NULL;
|
||||
token = string_tokenize(ptr, "@@");
|
||||
ck_assert(token != NULL);
|
||||
ck_assert(!strcmp(token, ""));
|
||||
free(token);
|
||||
token = string_tokenize(ptr, "@@");
|
||||
ck_assert(token != NULL);
|
||||
ck_assert(!strcmp(token, "1"));
|
||||
free(token);
|
||||
token = string_tokenize(ptr, "@@");
|
||||
ck_assert(token != NULL);
|
||||
ck_assert(!strcmp(token, "2"));
|
||||
free(token);
|
||||
token = string_tokenize(ptr, "@@");
|
||||
ck_assert(token != NULL);
|
||||
ck_assert(!strcmp(token, "3"));
|
||||
free(token);
|
||||
token = string_tokenize(ptr, "@@");
|
||||
ck_assert(token != NULL);
|
||||
ck_assert(!strcmp(token, ""));
|
||||
free(token);
|
||||
token = string_tokenize(ptr, "@@");
|
||||
ck_assert(token != NULL);
|
||||
ck_assert(!strcmp(token, "9"));
|
||||
free(token);
|
||||
token = string_tokenize(ptr, "@@");
|
||||
ck_assert(token != NULL);
|
||||
ck_assert(!strcmp(token, "@"));
|
||||
free(token);
|
||||
token = string_tokenize(ptr, "@@");
|
||||
ck_assert(token == NULL);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_string_replacesubstr)
|
||||
{
|
||||
char *res = string_replace_substring("foobaarhellowooorldtest", "oo", "ooo");
|
||||
ck_assert(res != NULL);
|
||||
ck_assert(!strcmp(res, "fooobaarhellowoooorldtest"));
|
||||
free(res);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_string_trim)
|
||||
{
|
||||
char test1[] = "\t \t\nhey there \n \n";
|
||||
char test2[] = "\t \t\nhey there \n \n";
|
||||
char test3[] = "\t \t\nhey there \n \n";
|
||||
ck_assert(string_trim_whitespace_left(test1) == (char*)test1);
|
||||
ck_assert(!strcmp(test1, "hey there \n \n"));
|
||||
ck_assert(string_trim_whitespace_right(test2) == (char*)test2);
|
||||
ck_assert(!strcmp(test2, "\t \t\nhey there"));
|
||||
ck_assert(string_trim_whitespace(test3) == (char*)test3);
|
||||
ck_assert(!strcmp(test3, "hey there"));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_string_comparison)
|
||||
{
|
||||
ck_assert(string_is_not_equal_fast("foo", "bar", 3));
|
||||
ck_assert(string_is_equal_fast("foo2", "foo2", 4));
|
||||
ck_assert(!string_is_equal_fast("foo1", "foo2", 4));
|
||||
ck_assert(string_is_equal_fast("foo1", "foo2", 3));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_word_wrap)
|
||||
{
|
||||
const char *testtxt = (
|
||||
"Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam nec "
|
||||
"enim quis orci euismod efficitur at nec arcu. Vivamus imperdiet est "
|
||||
"feugiat massa rhoncus porttitor at vitae ante. Nunc a orci vel ipsum "
|
||||
"tempor posuere sed a lacus. Ut erat odio, ultrices vitae iaculis "
|
||||
"fringilla, iaculis ut eros.\nSed facilisis viverra lectus et "
|
||||
"ullamcorper. Aenean risus ex, ornare eget scelerisque ac, imperdiet eu "
|
||||
"ipsum. Morbi pellentesque erat metus, sit amet aliquet libero rutrum "
|
||||
"et. Integer non ullamcorper tellus.");
|
||||
const char *expected = (
|
||||
"Lorem ipsum dolor sit amet, consectetur\n"
|
||||
"adipiscing elit. Nam nec enim quis orci\n"
|
||||
"euismod efficitur at nec arcu. Vivamus\n"
|
||||
"imperdiet est feugiat massa rhoncus\n"
|
||||
"porttitor at vitae ante. Nunc a orci\n"
|
||||
"vel ipsum tempor posuere sed a lacus.\n"
|
||||
"Ut erat odio, ultrices vitae iaculis\n"
|
||||
"fringilla, iaculis ut eros.\n"
|
||||
"Sed facilisis viverra lectus et\n"
|
||||
"ullamcorper. "
|
||||
"Aenean risus ex, ornare eget scelerisque ac, imperdiet eu ipsum. Morbi "
|
||||
"pellentesque erat metus, sit amet aliquet libero rutrum et. Integer "
|
||||
"non ullamcorper tellus.");
|
||||
|
||||
char output[1024];
|
||||
|
||||
word_wrap(output, sizeof(output), testtxt, strlen(testtxt), 40, 100, 10);
|
||||
ck_assert(!strcmp(output, expected));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_strlcpy)
|
||||
{
|
||||
char buf1[8];
|
||||
ck_assert_uint_eq(3, strlcpy(buf1, "foo", sizeof(buf1)));
|
||||
ck_assert(!memcmp(buf1, "foo", 4));
|
||||
ck_assert_uint_eq(11, strlcpy(buf1, "foo12345678", sizeof(buf1)));
|
||||
ck_assert(!memcmp(buf1, "foo1234", 8));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_strlcat)
|
||||
{
|
||||
char buf1[8];
|
||||
buf1[0] = 'f';
|
||||
buf1[1] = '\0';
|
||||
ck_assert_uint_eq(10, strlcat(buf1, "ooooooooo", sizeof(buf1)));
|
||||
ck_assert(!memcmp(buf1, "foooooo\0", 8));
|
||||
ck_assert_uint_eq(13, strlcat(buf1, "123456", sizeof(buf1)));
|
||||
ck_assert(!memcmp(buf1, "foooooo\0", 8));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_strldup)
|
||||
{
|
||||
char buf1[8] = "foo";
|
||||
char *tv1 = strldup(buf1, 16);
|
||||
char *tv2 = strldup(buf1, 2);
|
||||
ck_assert(tv1 != (char*)buf1);
|
||||
ck_assert(tv2 != (char*)buf1);
|
||||
ck_assert_uint_eq(strlen(tv2), 1);
|
||||
ck_assert(tv2[0] == 'f' && tv2[1] == 0);
|
||||
free(tv1);
|
||||
free(tv2);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_utf8_conv_utf32)
|
||||
{
|
||||
uint32_t output[12];
|
||||
const char test1[] = "aæ⠻จйγチℝ\xff";
|
||||
ck_assert_uint_eq(8, utf8_conv_utf32(output, 12, test1, strlen(test1)));
|
||||
ck_assert_uint_eq(97, output[0]);
|
||||
ck_assert_uint_eq(230, output[1]);
|
||||
ck_assert_uint_eq(10299, output[2]);
|
||||
ck_assert_uint_eq(3592, output[3]);
|
||||
ck_assert_uint_eq(1081, output[4]);
|
||||
ck_assert_uint_eq(947, output[5]);
|
||||
ck_assert_uint_eq(12481, output[6]);
|
||||
ck_assert_uint_eq(8477, output[7]);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_utf8_util)
|
||||
{
|
||||
const char *test1 = "aæ⠻จ𠀤";
|
||||
const char **tptr = &test1;
|
||||
char out[64];
|
||||
ck_assert_uint_eq(utf8len(test1), 5);
|
||||
ck_assert_uint_eq(utf8len(NULL), 0);
|
||||
ck_assert(&test1[1 + 2 + 3] == utf8skip(test1, 3));
|
||||
|
||||
ck_assert_uint_eq(97, utf8_walk(tptr));
|
||||
ck_assert_uint_eq(230, utf8_walk(tptr));
|
||||
ck_assert_uint_eq(10299, utf8_walk(tptr));
|
||||
ck_assert_uint_eq(3592, utf8_walk(tptr));
|
||||
ck_assert_uint_eq(131108, utf8_walk(tptr));
|
||||
|
||||
//ck_assert_uint_eq(1, utf8cpy(out, 64, test1, 1));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_utf16_conv)
|
||||
{
|
||||
const uint16_t test1[] = {0x0061, 0x00e6, 0x283b, 0x0e08, 0xd840, 0xdc24};
|
||||
char out[64];
|
||||
size_t outlen = sizeof(out);
|
||||
ck_assert(utf16_conv_utf8((uint8_t*)out, &outlen, test1, sizeof(test1) / 2));
|
||||
ck_assert_uint_eq(outlen, 13);
|
||||
ck_assert(!memcmp(out, "aæ⠻จ𠀤", 13));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
Suite *create_suite(void)
|
||||
{
|
||||
Suite *s = suite_create(SUITE_NAME);
|
||||
|
||||
TCase *tc_core = tcase_create("Core");
|
||||
tcase_add_test(tc_core, test_string_comparison);
|
||||
tcase_add_test(tc_core, test_string_num_conv);
|
||||
tcase_add_test(tc_core, test_string_char_classify);
|
||||
tcase_add_test(tc_core, test_string_case);
|
||||
tcase_add_test(tc_core, test_string_filter);
|
||||
tcase_add_test(tc_core, test_string_replace);
|
||||
tcase_add_test(tc_core, test_string_tokenizer);
|
||||
tcase_add_test(tc_core, test_string_trim);
|
||||
tcase_add_test(tc_core, test_string_replacesubstr);
|
||||
tcase_add_test(tc_core, test_word_wrap);
|
||||
tcase_add_test(tc_core, test_strlcpy);
|
||||
tcase_add_test(tc_core, test_strlcat);
|
||||
tcase_add_test(tc_core, test_strldup);
|
||||
tcase_add_test(tc_core, test_utf8_conv_utf32);
|
||||
tcase_add_test(tc_core, test_utf16_conv);
|
||||
tcase_add_test(tc_core, test_utf8_util);
|
||||
suite_add_tcase(s, tc_core);
|
||||
|
||||
return s;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int num_fail;
|
||||
Suite *s = create_suite();
|
||||
SRunner *sr = srunner_create(s);
|
||||
srunner_run_all(sr, CK_NORMAL);
|
||||
num_fail = srunner_ntests_failed(sr);
|
||||
srunner_free(sr);
|
||||
return (num_fail == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
|
||||
}
|
||||
159
src/minarch/libretro-common/test/utils/test_utils.c
Normal file
159
src/minarch/libretro-common/test/utils/test_utils.c
Normal file
|
|
@ -0,0 +1,159 @@
|
|||
/* Copyright (C) 2021 The RetroArch team
|
||||
*
|
||||
* ---------------------------------------------------------------------------------------
|
||||
* The following license statement only applies to this file (test_stdstring.c).
|
||||
* ---------------------------------------------------------------------------------------
|
||||
*
|
||||
* Permission is hereby granted, free of charge,
|
||||
* to any person obtaining a copy of this software and associated documentation files (the "Software"),
|
||||
* to deal in the Software without restriction, including without limitation the rights to
|
||||
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
|
||||
* and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
||||
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
||||
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
||||
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <check.h>
|
||||
#include <stdarg.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
|
||||
#include <utils/md5.h>
|
||||
#include <encodings/crc32.h>
|
||||
#include <streams/file_stream.h>
|
||||
|
||||
#define SUITE_NAME "hash"
|
||||
|
||||
START_TEST (test_md5)
|
||||
{
|
||||
uint8_t output[16];
|
||||
MD5_CTX ctx;
|
||||
MD5_Init(&ctx);
|
||||
MD5_Final(output, &ctx);
|
||||
ck_assert(!memcmp(
|
||||
"\xd4\x1d\x8c\xd9\x8f\x00\xb2\x04\xe9\x80\x09\x98\xec\xf8\x42\x7e",
|
||||
output, 16));
|
||||
MD5_Init(&ctx);
|
||||
MD5_Update(&ctx, "The quick brown fox jumps over the lazy dog", 43);
|
||||
MD5_Final(output, &ctx);
|
||||
ck_assert(!memcmp(
|
||||
"\x9e\x10\x7d\x9d\x37\x2b\xb6\x82\x6b\xd8\x1d\x35\x42\xa4\x19\xd6",
|
||||
output, 16));
|
||||
MD5_Init(&ctx);
|
||||
MD5_Update(&ctx, "The quick brown fox jumps over the lazy dog", 43);
|
||||
MD5_Update(&ctx, "The quick brown fox jumps over the lazy dog", 43);
|
||||
MD5_Update(&ctx, "The quick brown fox jumps over the lazy dog", 43);
|
||||
MD5_Final(output, &ctx);
|
||||
ck_assert(!memcmp(
|
||||
"\x4e\x67\xdb\x4a\x7a\x40\x6b\x0c\xfd\xad\xd8\x87\xcd\xe7\x88\x8e",
|
||||
output, 16));
|
||||
}
|
||||
END_TEST
|
||||
|
||||
START_TEST (test_crc32)
|
||||
{
|
||||
char buf1[] = "retroarch";
|
||||
char buf2[] = "12345678";
|
||||
char buf3[] = "The quick brown fox jumps over the lazy dog";
|
||||
uint32_t test1 = encoding_crc32(0, (uint8_t*)buf1, strlen(buf1));
|
||||
uint32_t test2 = encoding_crc32(0, (uint8_t*)buf2, strlen(buf2));
|
||||
uint32_t test3 = encoding_crc32(0, (uint8_t*)buf3, strlen(buf3));
|
||||
ck_assert_uint_eq(0x3cae141a, test1);
|
||||
ck_assert_uint_eq(0x9ae0daaf, test2);
|
||||
ck_assert_uint_eq(0x414fa339, test3);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
#define CRC32_BUFFER_SIZE 1048576
|
||||
#define CRC32_MAX_MB 64
|
||||
|
||||
/**
|
||||
* Calculate a CRC32 from the first part of the given file.
|
||||
* "first part" being the first (CRC32_BUFFER_SIZE * CRC32_MAX_MB)
|
||||
* bytes.
|
||||
*
|
||||
* Returns: the crc32, or 0 if there was an error.
|
||||
*/
|
||||
static uint32_t file_crc32(uint32_t crc, const char *path)
|
||||
{
|
||||
unsigned i;
|
||||
RFILE *file = NULL;
|
||||
unsigned char *buf = NULL;
|
||||
if (!path)
|
||||
return 0;
|
||||
|
||||
if (!(file = filestream_open(path, RETRO_VFS_FILE_ACCESS_READ, 0)))
|
||||
return 0;
|
||||
|
||||
if (!(buf = (unsigned char*)malloc(CRC32_BUFFER_SIZE)))
|
||||
{
|
||||
filestream_close(file);
|
||||
return 0;
|
||||
}
|
||||
|
||||
for (i = 0; i < CRC32_MAX_MB; i++)
|
||||
{
|
||||
int64_t nread = filestream_read(file, buf, CRC32_BUFFER_SIZE);
|
||||
if (nread < 0)
|
||||
{
|
||||
free(buf);
|
||||
filestream_close(file);
|
||||
return 0;
|
||||
}
|
||||
|
||||
crc = encoding_crc32(crc, buf, (size_t)nread);
|
||||
if (filestream_eof(file))
|
||||
break;
|
||||
}
|
||||
free(buf);
|
||||
filestream_close(file);
|
||||
return crc;
|
||||
}
|
||||
|
||||
START_TEST (test_crc32_file)
|
||||
{
|
||||
char tmpfile[512];
|
||||
FILE *fd;
|
||||
tmpnam(tmpfile);
|
||||
fd = fopen(tmpfile, "wb");
|
||||
ck_assert(fd != NULL);
|
||||
fwrite("12345678", 1, 8, fd);
|
||||
fclose(fd);
|
||||
|
||||
ck_assert_uint_eq(file_crc32(0, tmpfile), 0x9ae0daaf);
|
||||
/* Error checking */
|
||||
ck_assert_uint_eq(file_crc32(0, "/this/path/should/not/exist"), 0);
|
||||
ck_assert_uint_eq(file_crc32(0, NULL), 0);
|
||||
}
|
||||
END_TEST
|
||||
|
||||
Suite *create_suite(void)
|
||||
{
|
||||
Suite *s = suite_create(SUITE_NAME);
|
||||
|
||||
TCase *tc_core = tcase_create("Core");
|
||||
tcase_add_test(tc_core, test_md5);
|
||||
tcase_add_test(tc_core, test_crc32);
|
||||
tcase_add_test(tc_core, test_crc32_file);
|
||||
suite_add_tcase(s, tc_core);
|
||||
|
||||
return s;
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
int num_fail;
|
||||
Suite *s = create_suite();
|
||||
SRunner *sr = srunner_create(s);
|
||||
srunner_run_all(sr, CK_NORMAL);
|
||||
num_fail = srunner_ntests_failed(sr);
|
||||
srunner_free(sr);
|
||||
return (num_fail == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue