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
|
/*
* Copyright (c) 2008-2009 Apple Inc. All rights reserved.
*
* @APPLE_APACHE_LICENSE_HEADER_START@
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* @APPLE_APACHE_LICENSE_HEADER_END@
*/
#include "config/config.h"
#include <stdio.h>
#include <dispatch/dispatch.h>
#define __DISPATCH_INDIRECT__
#include "src/queue_private.h"
#include <unistd.h>
#include <stdlib.h>
#include <assert.h>
#if HAVE_TARGETCONDITIONALS_H
#include <TargetConditionals.h>
#endif
#include "dispatch_test.h"
int done = 0;
#define BLOCKS 128
#define PRIORITIES 3
#if TARGET_OS_EMBEDDED
#define LOOP_COUNT 2000000
#else
#define LOOP_COUNT 100000000
#endif
char *labels[PRIORITIES] = { "LOW", "DEFAULT", "HIGH" };
int priorities[PRIORITIES] = { DISPATCH_QUEUE_PRIORITY_LOW, DISPATCH_QUEUE_PRIORITY_DEFAULT, DISPATCH_QUEUE_PRIORITY_HIGH };
union {
size_t count;
char padding[64];
} counts[PRIORITIES];
#define ITERATIONS (size_t)(PRIORITIES * BLOCKS * 0.50)
size_t iterations = ITERATIONS;
void
histogram(void) {
size_t maxcount = BLOCKS;
size_t sc[PRIORITIES];
size_t total = 0;
size_t x,y;
for (y = 0; y < PRIORITIES; ++y) {
sc[y] = counts[y].count;
}
for (y = 0; y < PRIORITIES; ++y) {
printf("%s: %ld\n", labels[y], sc[y]);
total += sc[y];
double fraction = (double)sc[y] / (double)maxcount;
double value = fraction * (double)80;
for (x = 0; x < 80; ++x) {
printf("%s", (value > x) ? "*" : " ");
}
printf("\n");
}
test_long("blocks completed", total, ITERATIONS);
test_long_less_than("high priority precedence", (long)sc[0], (long)sc[2]);
}
void
cpubusy(void* context)
{
size_t *count = context;
size_t iterdone;
size_t idx;
for (idx = 0; idx < LOOP_COUNT; ++idx) {
if (done) break;
}
if ((iterdone = __sync_sub_and_fetch(&iterations, 1)) == 0) {
__sync_add_and_fetch(&done, 1);
__sync_add_and_fetch(count, 1);
histogram();
test_stop();
exit(0);
} else if (iterdone > 0) {
__sync_add_and_fetch(count, 1);
}
}
void
submit_work(dispatch_queue_t queue, void* context)
{
int i;
for (i = 0; i < BLOCKS; ++i) {
dispatch_async_f(queue, context, cpubusy);
}
#if USE_SET_TARGET_QUEUE
dispatch_release(queue);
#endif
}
int
main(int argc __attribute__((unused)), char* argv[] __attribute__((unused)))
{
dispatch_queue_t q[PRIORITIES];
int i;
#if USE_SET_TARGET_QUEUE
test_start("Dispatch Priority (Set Target Queue)");
for(i = 0; i < PRIORITIES; i++) {
q[i] = dispatch_queue_create(labels[i], NULL);
test_ptr_notnull("q[i]", q[i]);
assert(q[i]);
dispatch_set_target_queue(q[i], dispatch_get_global_queue(priorities[i], 0));
dispatch_queue_set_width(q[i], DISPATCH_QUEUE_WIDTH_MAX_LOGICAL_CPUS);
}
#else
test_start("Dispatch Priority");
for(i = 0; i < PRIORITIES; i++) {
q[i] = dispatch_get_global_queue(priorities[i], 0);
}
#endif
for(i = 0; i < PRIORITIES; i++) {
submit_work(q[i], &counts[i].count);
}
dispatch_main();
return 0;
}
|
