| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * | 7 * |
| 8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
| (...skipping 13 matching lines...) Expand all Loading... |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "config.h" | 31 #include "config.h" |
| 32 #include "core/dom/Microtask.h" | 32 #include "core/dom/Microtask.h" |
| 33 | 33 |
| 34 #include "bindings/v8/V8PerIsolateData.h" |
| 34 #include "core/dom/MutationObserver.h" | 35 #include "core/dom/MutationObserver.h" |
| 35 #include "core/dom/custom/CustomElementScheduler.h" | 36 #include "core/dom/custom/CustomElementScheduler.h" |
| 36 #include "wtf/Vector.h" | 37 #include "wtf/Vector.h" |
| 37 | 38 |
| 38 namespace WebCore { | 39 namespace WebCore { |
| 39 | 40 |
| 41 typedef Vector<MicrotaskCallback> MicrotaskQueue; |
| 42 |
| 43 static MicrotaskQueue& microtaskQueue() |
| 44 { |
| 45 DEFINE_STATIC_LOCAL(MicrotaskQueue, microtaskQueue, ()); |
| 46 return microtaskQueue; |
| 47 } |
| 48 |
| 40 void Microtask::performCheckpoint() | 49 void Microtask::performCheckpoint() |
| 41 { | 50 { |
| 42 static bool performingCheckpoint = false; | 51 V8PerIsolateData* isolateData = V8PerIsolateData::current(); |
| 43 if (performingCheckpoint) | 52 ASSERT(isolateData); |
| 53 if (isolateData->performingMicrotaskCheckpoint()) |
| 44 return; | 54 return; |
| 45 performingCheckpoint = true; | 55 isolateData->setPerformingMicrotaskCheckpoint(true); |
| 46 | 56 |
| 47 bool anyWorkDone; | 57 // FIXME: Custom element's callbacks need to be refactored to enqueueMicrota
sk() |
| 48 do { | 58 while (CustomElementScheduler::dispatchMicrotaskProcessingSteps() || !microt
askQueue().isEmpty()) { |
| 49 MutationObserver::deliverAllMutations(); | 59 if (microtaskQueue().isEmpty()) |
| 50 anyWorkDone = CustomElementScheduler::dispatchMicrotaskProcessingSteps()
; | 60 continue; |
| 51 } while (anyWorkDone); | 61 Vector<MicrotaskCallback> microtasks; |
| 62 microtasks.swap(microtaskQueue()); |
| 63 for (size_t i = 0; i < microtasks.size(); ++i) { |
| 64 microtasks[i](); |
| 65 } |
| 66 } |
| 52 | 67 |
| 53 performingCheckpoint = false; | 68 isolateData->setPerformingMicrotaskCheckpoint(false); |
| 69 } |
| 70 |
| 71 void Microtask::enqueueMicrotask(MicrotaskCallback callback) |
| 72 { |
| 73 microtaskQueue().append(callback); |
| 54 } | 74 } |
| 55 | 75 |
| 56 } // namespace WebCore | 76 } // namespace WebCore |
| OLD | NEW |