Newer
Older
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
/*
* Fork/Join Framework
*
* Test that future_free() is implemented and working.
* For this test, we expect that any memory allocated by your
* threadpool implementation is freed when the program exits.
*
* While it is normally ok to not free memory before exiting,
* libraries that are intended for long-running programs, such
* as the threadpool library in this project, cannot leak
* memory during normal operation.
*
* Thus, this test will succeed only if valgrind reports this:
*
* ==2336955== LEAK SUMMARY:
* ==2336955== definitely lost: 0 bytes in 0 blocks
* ==2336955== indirectly lost: 0 bytes in 0 blocks
* ==2336955== possibly lost: 0 bytes in 0 blocks
* ==2336955== still reachable: 0 bytes in 0 blocks
*
* Written by G. Back for CS3214 Summer 2020.
*/
#include <assert.h>
#include <pthread.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#include <stdint.h>
#include <unistd.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <time.h>
#include "threadpool.h"
#include "threadpool_lib.h"
#define DEFAULT_THREADS 2
#define DEFAULT_TASKS 50
struct taskno_wrapper {
uintptr_t taskno;
};
static void *
test_task(struct thread_pool *pool, struct taskno_wrapper * data)
{
return (void *)data->taskno;
}
static int
run_test(int nthreads, int ntasks)
{
struct benchmark_data * bdata = start_benchmark();
struct thread_pool * threadpool = thread_pool_new(nthreads);
struct taskno_wrapper * task_data = malloc(sizeof(*task_data) * ntasks);
struct future ** futures = malloc(sizeof(*futures) * ntasks);
printf("starting %d tasks...\n", ntasks);
for (int i = 0; i < ntasks; i++) {
task_data[i].taskno = i;
futures[i] = thread_pool_submit(threadpool, (fork_join_task_t) test_task, task_data + i);
}
for (int i = 0; i < ntasks; i++) {
uintptr_t r = (uintptr_t) future_get(futures[i]);
// consistency check
if (r != i) {
fprintf(stderr, "Wrong result, expected %d, got %lu\n", i, r);
abort();
}
future_free(futures[i]);
}
free(task_data);
free(futures);
thread_pool_shutdown_and_destroy(threadpool);
stop_benchmark(bdata);
report_benchmark_results(bdata);
printf("Test successful.\n");
free(bdata);
return 0;
}
/**********************************************************************************/
static void
usage(char *av0, int exvalue)
{
fprintf(stderr, "Usage: %s [-n <n>] [-t <t>]\n"
" -n number of threads in pool, default %d\n"
" -t number of tasks, default %d\n"
, av0, DEFAULT_THREADS, DEFAULT_TASKS);
exit(exvalue);
}
int
main(int ac, char *av[])
{
int c, nthreads = DEFAULT_THREADS, ntasks = DEFAULT_TASKS;
while ((c = getopt(ac, av, "hn:t:")) != EOF) {
switch (c) {
case 'n':
nthreads = atoi(optarg);
break;
case 't':
ntasks = atoi(optarg);
break;
case 'h':
usage(av[0], EXIT_SUCCESS);
}
}
return run_test(nthreads, ntasks);
}