Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 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 11 matching lines...) Expand all Loading... | |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 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/custom/CustomElementAsyncImportMicrotaskQueue.h" | 32 #include "core/dom/custom/CustomElementSyncMicrotaskQueue.h" |
| 33 | |
| 34 #include "core/dom/custom/CustomElementMicrotaskImportStep.h" | |
| 35 | 33 |
| 36 namespace WebCore { | 34 namespace WebCore { |
| 37 | 35 |
| 38 void CustomElementAsyncImportMicrotaskQueue::enqueue(PassOwnPtrWillBeRawPtr<Cust omElementMicrotaskImportStep> step) | 36 void CustomElementSyncMicrotaskQueue::enqueue(PassOwnPtrWillBeRawPtr<CustomEleme ntMicrotaskStep> step) |
| 39 { | 37 { |
| 40 m_queue.append(step); | 38 m_queue.append(step); |
| 41 } | 39 } |
| 42 | 40 |
| 43 void CustomElementAsyncImportMicrotaskQueue::doDispatch() | 41 void CustomElementSyncMicrotaskQueue::doDispatch() |
| 44 { | 42 { |
| 45 WillBeHeapVector<OwnPtrWillBeMember<CustomElementMicrotaskStep> > remaining; | 43 unsigned i; |
| 46 | 44 |
| 47 for (unsigned i = 0; i < m_queue.size(); ++i) { | 45 for (i = 0; i < m_queue.size(); ++i) { |
| 48 if (CustomElementMicrotaskStep::Processing == m_queue[i]->process()) | 46 if (CustomElementMicrotaskStep::Processing == m_queue[i]->process()) |
| 49 remaining.append(m_queue[i].release()); | 47 break; |
| 50 } | 48 } |
| 51 | 49 |
| 52 m_queue.swap(remaining); | 50 m_queue.remove(0, i); |
|
dominicc (has gone to gerrit)
2014/06/17 00:29:23
Doesn't queue have a clear or something?
| |
| 53 } | 51 } |
| 54 | 52 |
| 55 } // namespace WebCore | 53 } // namespace WebCore |
| OLD | NEW |