OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * Copyright 2015 Google Inc. |
| 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. |
| 6 */ |
| 7 |
| 8 #include "SkSemaphore.h" |
| 9 |
| 10 #if defined(SK_BUILD_FOR_MAC) || defined(SK_BUILD_FOR_IOS) |
| 11 #include <mach/mach.h> |
| 12 struct SkSemaphore::OSSemaphore { |
| 13 semaphore_t fSemaphore; |
| 14 |
| 15 OSSemaphore() { |
| 16 semaphore_create(mach_task_self(), &fSemaphore, SYNC_POLICY_FIFO, 0/
*initial count*/); |
| 17 } |
| 18 ~OSSemaphore() { semaphore_destroy(mach_task_self(), fSemaphore); } |
| 19 |
| 20 void signal(int n) { while (n --> 0) { semaphore_signal(fSemaphore); } } |
| 21 void wait() { semaphore_wait(fSemaphore); } |
| 22 }; |
| 23 #elif defined(SK_BUILD_FOR_WIN32) |
| 24 struct SkSemaphore::OSSemaphore { |
| 25 HANDLE fSemaphore; |
| 26 |
| 27 OSSemaphore() { |
| 28 fSemaphore = CreateSemaphore(NULL /*security attributes, optional
*/, |
| 29 0 /*initial count*/, |
| 30 MAXLONG /*max count*/, |
| 31 NULL /*name, optional*/); |
| 32 } |
| 33 ~OSSemaphore() { CloseHandle(fSemaphore); } |
| 34 |
| 35 void signal(int n) { |
| 36 ReleaseSemaphore(fSemaphore, n, NULL/*returns previous count, option
al*/); |
| 37 } |
| 38 void wait() { WaitForSingleObject(fSemaphore, INFINITE/*timeout in ms*/)
; } |
| 39 }; |
| 40 #else |
| 41 // It's important we test for Mach before this. This code will compile but
not work there. |
| 42 #include <errno.h> |
| 43 #include <semaphore.h> |
| 44 struct SkSemaphore::OSSemaphore { |
| 45 sem_t fSemaphore; |
| 46 |
| 47 OSSemaphore() { sem_init(&fSemaphore, 0/*cross process?*/, 0/*initial c
ount*/); } |
| 48 ~OSSemaphore() { sem_destroy(&fSemaphore); } |
| 49 |
| 50 void signal(int n) { while (n --> 0) { sem_post(&fSemaphore); } } |
| 51 void wait() { |
| 52 // Try until we're not interrupted. |
| 53 while(sem_wait(&fSemaphore) == -1 && errno == EINTR); |
| 54 } |
| 55 }; |
| 56 #endif |
| 57 |
| 58 SkSemaphore::SkSemaphore() : fCount(0), fOSSemaphore(SkNEW(OSSemaphore)) {} |
| 59 SkSemaphore::~SkSemaphore() { SkDELETE(fOSSemaphore); } |
| 60 |
| 61 void SkSemaphore::signal(int n) { |
| 62 SkASSERT(n >= 0); |
| 63 |
| 64 // We only want to call the OS semaphore when our logical count crosses |
| 65 // from <= 0 to >0 (when we need to wake sleeping threads). |
| 66 // |
| 67 // This is easiest to think about with specific examples of prev and n. |
| 68 // If n == 5 and prev == -3, there are 3 threads sleeping and we signal |
| 69 // SkTMin(-(-3), 5) == 3 times on the OS semaphore, leaving the count at 2. |
| 70 // |
| 71 // If prev >= 0, no threads are waiting, SkTMin(-prev, n) is always <= 0, |
| 72 // so we don't call the OS semaphore, leaving the count at (prev + n). |
| 73 int prev = fCount.fetch_add(n, sk_memory_order_release); |
| 74 int toSignal = SkTMin(-prev, n); |
| 75 if (toSignal > 0) { |
| 76 fOSSemaphore->signal(toSignal); |
| 77 } |
| 78 } |
| 79 |
| 80 void SkSemaphore::wait() { |
| 81 // We only wait() on the OS semaphore if the count drops <= 0, |
| 82 // i.e. when we need to make this thread sleep to wait for it to go back up. |
| 83 if (fCount.fetch_add(-1, sk_memory_order_acquire) <= 0) { |
| 84 fOSSemaphore->wait(); |
| 85 } |
| 86 } |
OLD | NEW |