-
Notifications
You must be signed in to change notification settings - Fork 0
/
qsip_wc_test.c
164 lines (155 loc) · 4.88 KB
/
qsip_wc_test.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
//====================== Unit test ================================
// Compile options for unit test:
// -DTIMES=n: number of unit tests (default is 100).
// -DSIZE=n: size of array to sort, for unit testing (default is 1000000).
// -DREPRODUCTIBLE: get reproductible unit test data (with one thread) (by default, unit tests are randomized).
#define _GNU_SOURCE
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <locale.h>
#include <assert.h>
#include <unistd.h>
#define ELEM_SIZE(arr) (sizeof(*arr))
#ifndef SIZE
# define SIZE 1000000
#endif
#ifndef TIMES
# define TIMES 100
#endif
#define _(s) (s)
#include "qsip_wc.h"
#include "wqm.h"
//typedef unsigned char SortableType;
typedef long long int SortableType;
static int
lti (const void *a, const void *b, void *arg)
{
(void) arg;
return ((*(const SortableType *) a)) < ((*(const SortableType *) b));
}
static int
cmpi (const void *a, const void *b, void *arg)
{
if (lti (a, b, arg))
return -1;
if (lti (b, a, arg))
return 1;
return 0;
}
struct gd
{
size_t size, elem_size;
char *tags;
};
static void *
tag (void *global)
{
return ((struct gd *) global)->tags++;
}
static void
untag (void *local, void *global)
{
(void) local;
((struct gd *) global)->tags--;
}
static void
monitoring (struct threadpool_monitor data)
{
static int legend = 0;
if (!legend)
legend = fprintf (stdout, "(=) succeeded tasks, (X) failed tasks, (*) processing tasks, (.) pending tasks, (/) canceled tasks, (-) idle workers.\n");
static char gauge = '\r';
static char roll = '\n';
(void) (roll + gauge);
fprintf (stdout, "[%p][% 10.4fs] ", (void *) data.threadpool, data.time);
size_t i;
for (i = 0; i < data.nb_succeeded_tasks; i++)
fprintf (stdout, "=");
for (i = 0; i < data.nb_failed_tasks; i++)
fprintf (stdout, "X");
for (i = 0; i < data.nb_processing_tasks; i++)
fprintf (stdout, "*");
for (i = 0; i < data.nb_pending_tasks; i++)
fprintf (stdout, ".");
for (i = 0; i < data.nb_canceled_tasks; i++)
fprintf (stdout, "/");
for (i = 0; i < data.nb_idle_workers; i++)
fprintf (stdout, "-");
for (i = 0; i < data.max_nb_workers; i++)
fprintf (stdout, " ");
fprintf (stdout, "%c", roll); // Use gauge, rather than roll, to display a progress bar.
fflush (stdout);
}
static int
worker (struct threadpool *threadpool, void *base)
{
int ret = 0;
(void) cmpi; // Avoid ‘cmpi’ defined but not used
#if 1
struct gd *gd = threadpool_global_data (threadpool);
# ifndef QSORT
qsip (base, gd->size, gd->elem_size, lti, 0);
# else
qsort_r (base, gd->size, gd->elem_size, cmpi, 0); // The single threaded algorithm is much faster than the multi-threaded (due to threading overhead).
# endif
// Check base[i] <= base[i + 1]
SortableType *st = base;
for (size_t i = 0; i < gd->size - 1 && ret == 0; i++)
if (lti (&st[i + 1], &st[i], 0))
ret = 1;
#else
sleep (1);
#endif
char *tag = threadpool_worker_local_data (threadpool);
(void) tag;
return ret;
}
int
main ()
{
setlocale (LC_ALL, "");
/*alignas(128) */
SortableType *base = malloc (((size_t) TIMES) * ((size_t) SIZE) * sizeof (*base)); // Beware of false sharing.
assert (base);
fprintf (stdout, _("Sorting %1$'zu elements (multi-threaded quick sort in place), %2$'i times:\n"), (size_t) SIZE, TIMES);
#ifndef REPRODUCTIBLE
struct timespec ts;
clock_gettime (CLOCK_MONOTONIC, &ts);
srandom ((unsigned int) ts.tv_nsec);
#else
fprintf (stdout, _(" [Reproductible]\n"));
#endif
fprintf (stdout, _("Initializing %'zu random numbers...\n"), (size_t) (TIMES * SIZE));
for (size_t i = 0; i < (size_t) TIMES; i++)
for (size_t j = 0; j < (size_t) SIZE; j++)
base[i * (size_t) SIZE + j] = ((1LL << 31) * random () + random ()) % (1LL << i);
char threads_tags[] = "1234567"; // 7 workers
struct gd gd = { (size_t) SIZE, ELEM_SIZE (base), threads_tags };
size_t nb_workers = strlen (threads_tags);
fprintf (stdout, _("%zu workers requested and processing...\n"), nb_workers);
struct threadpool *tp = threadpool_create_and_start (nb_workers, &gd, tag, untag); // Start 7 workers
threadpool_set_monitor (tp, monitoring);
size_t i = 0;
size_t task_id;
for (; i < ((size_t) TIMES) / 2; i++)
task_id = threadpool_add_task (tp, worker, base + (i * ((size_t) SIZE)), 0); // Parallel work
sleep (TIMES / 6);
for (; i < (size_t) TIMES; i++)
task_id = threadpool_add_task (tp, worker, base + (i * ((size_t) SIZE)), 0); // Parallel work
sleep (1);
threadpool_cancel_task (tp, task_id);
threadpool_cancel_task (tp, task_id);
sleep (1);
threadpool_cancel_task (tp, LAST_TASK);
threadpool_cancel_task (tp, LAST_TASK);
sleep (1);
threadpool_cancel_task (tp, NEXT_TASK);
threadpool_cancel_task (tp, NEXT_TASK);
sleep (1);
threadpool_cancel_task (tp, ALL_TASKS);
threadpool_wait_and_destroy (tp);
fprintf (stdout, _("Done.\n"));
free (base);
}