OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (C) 2011 University of Szeged | |
3 * Copyright (C) 2011 Gabor Loki <loki@webkit.org> | |
4 * All rights reserved. | |
5 * | |
6 * Redistribution and use in source and binary forms, with or without | |
7 * modification, are permitted provided that the following conditions | |
8 * are met: | |
9 * 1. Redistributions of source code must retain the above copyright | |
10 * notice, this list of conditions and the following disclaimer. | |
11 * 2. Redistributions in binary form must reproduce the above copyright | |
12 * notice, this list of conditions and the following disclaimer in the | |
13 * documentation and/or other materials provided with the distribution. | |
14 * | |
15 * THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY | |
16 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
18 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL UNIVERSITY OF SZEGED OR | |
19 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | |
20 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
21 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | |
22 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | |
23 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
25 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
26 */ | |
27 | |
28 #ifndef ParallelJobsLibdispatch_h | |
29 #define ParallelJobsLibdispatch_h | |
30 | |
31 #if ENABLE(THREADING_LIBDISPATCH) | |
32 | |
33 #include <dispatch/dispatch.h> | |
34 | |
35 namespace WTF { | |
36 | |
37 class ParallelEnvironment { | |
38 WTF_MAKE_FAST_ALLOCATED; | |
39 public: | |
40 typedef void (*ThreadFunction)(void*); | |
41 | |
42 ParallelEnvironment(ThreadFunction threadFunction, size_t sizeOfParameter, i
nt requestedJobNumber) | |
43 : m_threadFunction(threadFunction) | |
44 , m_sizeOfParameter(sizeOfParameter) | |
45 , m_numberOfJobs(requestedJobNumber) | |
46 { | |
47 // We go with the requested number of jobs. libdispatch will distribute
the work optimally. | |
48 ASSERT_ARG(requestedJobNumber, requestedJobNumber > 0); | |
49 } | |
50 | |
51 int numberOfJobs() | |
52 { | |
53 return m_numberOfJobs; | |
54 } | |
55 | |
56 void execute(unsigned char* parameters) | |
57 { | |
58 static dispatch_queue_t globalQueue = dispatch_get_global_queue(DISPATCH
_QUEUE_PRIORITY_DEFAULT, 0); | |
59 | |
60 dispatch_apply(m_numberOfJobs, globalQueue, ^(size_t i) { (*m_threadFunc
tion)(parameters + (m_sizeOfParameter * i)); }); | |
61 } | |
62 | |
63 private: | |
64 ThreadFunction m_threadFunction; | |
65 size_t m_sizeOfParameter; | |
66 int m_numberOfJobs; | |
67 }; | |
68 | |
69 } // namespace WTF | |
70 | |
71 #endif // ENABLE(THREADING_LIBDISPATCH) | |
72 | |
73 #endif // ParallelJobsLibdispatch_h | |
OLD | NEW |