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 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
45 , m_inCreatedCallback(false) | 45 , m_inCreatedCallback(false) |
46 { | 46 { |
47 } | 47 } |
48 | 48 |
49 bool CustomElementCallbackQueue::processInElementQueue(ElementQueueId caller) | 49 bool CustomElementCallbackQueue::processInElementQueue(ElementQueueId caller) |
50 { | 50 { |
51 ASSERT(!m_inCreatedCallback); | 51 ASSERT(!m_inCreatedCallback); |
52 bool didWork = false; | 52 bool didWork = false; |
53 | 53 |
54 while (m_index < m_queue.size() && owner() == caller) { | 54 while (m_index < m_queue.size() && owner() == caller) { |
55 m_inCreatedCallback = m_queue[m_index]->isCreated(); | 55 m_inCreatedCallback = m_queue[m_index]->isCreatedCallback(); |
56 | 56 |
57 // dispatch() may cause recursion which steals this callback | 57 // dispatch() may cause recursion which steals this callback |
58 // queue and reenters processInQueue. owner() == caller | 58 // queue and reenters processInQueue. owner() == caller |
59 // detects this recursion and cedes processing. | 59 // detects this recursion and cedes processing. |
60 m_queue[m_index++]->dispatch(m_element.get()); | 60 m_queue[m_index++]->dispatch(m_element.get()); |
61 m_inCreatedCallback = false; | 61 m_inCreatedCallback = false; |
62 didWork = true; | 62 didWork = true; |
63 } | 63 } |
64 | 64 |
65 if (owner() == caller && m_index == m_queue.size()) { | 65 if (owner() == caller && m_index == m_queue.size()) { |
66 // This processInQueue exhausted the queue; shrink it. | 66 // This processInQueue exhausted the queue; shrink it. |
67 m_index = 0; | 67 m_index = 0; |
68 m_queue.resize(0); | 68 m_queue.resize(0); |
69 m_owner = -1; | 69 m_owner = -1; |
70 } | 70 } |
71 | 71 |
72 return didWork; | 72 return didWork; |
73 } | 73 } |
74 | 74 |
75 void CustomElementCallbackQueue::trace(Visitor* visitor) | 75 void CustomElementCallbackQueue::trace(Visitor* visitor) |
76 { | 76 { |
77 visitor->trace(m_element); | 77 visitor->trace(m_element); |
78 } | 78 } |
79 | 79 |
80 } // namespace blink | 80 } // namespace blink |
OLD | NEW |