fluencelabs/redis
1
0
Fork 0
mirror of https://github.com/fluencelabs/redis synced 2025-06-30 09:21:34 +00:00
Code Issues Projects Releases Wiki Activity

Jemalloc upgraded to version 5.0.1.

Browse Source
This commit is contained in:
antirez
2018-05-24 17:17:37 +02:00
parent 8f4e2075a7
commit 08e1c8e820
300 changed files with 40996 additions and 35024 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
deps/jemalloc/test/unit/ql.c vendored
View File

@ -1,7 +1,9 @@
#include "test/jemalloc_test.h"
#include "jemalloc/internal/ql.h"
/* Number of ring entries, in [2..26]. */
#define NENTRIES 9
#define NENTRIES 9
typedef struct list_s list_t;
typedef ql_head(list_t) list_head_t;
@ -12,8 +14,7 @@ struct list_s {
};
static void
test_empty_list(list_head_t *head)
{
test_empty_list(list_head_t *head) {
list_t *t;
unsigned i;
@ -34,8 +35,7 @@ test_empty_list(list_head_t *head)
assert_u_eq(i, 0, "Unexpected element for empty list");
}
TEST_BEGIN(test_ql_empty)
{
TEST_BEGIN(test_ql_empty) {
list_head_t head;
ql_new(&head);
@ -44,8 +44,7 @@ TEST_BEGIN(test_ql_empty)
TEST_END
static void
init_entries(list_t *entries, unsigned nentries)
{
init_entries(list_t *entries, unsigned nentries) {
unsigned i;
for (i = 0; i < nentries; i++) {
@ -55,8 +54,7 @@ init_entries(list_t *entries, unsigned nentries)
}
static void
test_entries_list(list_head_t *head, list_t *entries, unsigned nentries)
{
test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) {
list_t *t;
unsigned i;
@ -91,31 +89,31 @@ test_entries_list(list_head_t *head, list_t *entries, unsigned nentries)
}
}
TEST_BEGIN(test_ql_tail_insert)
{
TEST_BEGIN(test_ql_tail_insert) {
list_head_t head;
list_t entries[NENTRIES];
unsigned i;
ql_new(&head);
init_entries(entries, sizeof(entries)/sizeof(list_t));
for (i = 0; i < NENTRIES; i++)
for (i = 0; i < NENTRIES; i++) {
ql_tail_insert(&head, &entries[i], link);
}
test_entries_list(&head, entries, NENTRIES);
}
TEST_END
TEST_BEGIN(test_ql_tail_remove)
{
TEST_BEGIN(test_ql_tail_remove) {
list_head_t head;
list_t entries[NENTRIES];
unsigned i;
ql_new(&head);
init_entries(entries, sizeof(entries)/sizeof(list_t));
for (i = 0; i < NENTRIES; i++)
for (i = 0; i < NENTRIES; i++) {
ql_tail_insert(&head, &entries[i], link);
}
for (i = 0; i < NENTRIES; i++) {
test_entries_list(&head, entries, NENTRIES-i);
@ -125,31 +123,31 @@ TEST_BEGIN(test_ql_tail_remove)
}
TEST_END
TEST_BEGIN(test_ql_head_insert)
{
TEST_BEGIN(test_ql_head_insert) {
list_head_t head;
list_t entries[NENTRIES];
unsigned i;
ql_new(&head);
init_entries(entries, sizeof(entries)/sizeof(list_t));
for (i = 0; i < NENTRIES; i++)
for (i = 0; i < NENTRIES; i++) {
ql_head_insert(&head, &entries[NENTRIES-i-1], link);
}
test_entries_list(&head, entries, NENTRIES);
}
TEST_END
TEST_BEGIN(test_ql_head_remove)
{
TEST_BEGIN(test_ql_head_remove) {
list_head_t head;
list_t entries[NENTRIES];
unsigned i;
ql_new(&head);
init_entries(entries, sizeof(entries)/sizeof(list_t));
for (i = 0; i < NENTRIES; i++)
for (i = 0; i < NENTRIES; i++) {
ql_head_insert(&head, &entries[NENTRIES-i-1], link);
}
for (i = 0; i < NENTRIES; i++) {
test_entries_list(&head, &entries[i], NENTRIES-i);
@ -159,8 +157,7 @@ TEST_BEGIN(test_ql_head_remove)
}
TEST_END
TEST_BEGIN(test_ql_insert)
{
TEST_BEGIN(test_ql_insert) {
list_head_t head;
list_t entries[8];
list_t *a, *b, *c, *d, *e, *f, *g, *h;
@ -196,14 +193,12 @@ TEST_BEGIN(test_ql_insert)
TEST_END
int
main(void)
{
return (test(
main(void) {
return test(
test_ql_empty,
test_ql_tail_insert,
test_ql_tail_remove,
test_ql_head_insert,
test_ql_head_remove,
test_ql_insert));
test_ql_insert);
}