OLD | NEW |
---|---|
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 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 are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * 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 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...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/timing/PerformanceEntry.h" | 32 #include "core/dom/NodeListsNodeData.h" |
adamk
2014/07/14 17:29:26
Unfortunate that git thinks this is a copy...maybe
Inactive
2014/07/14 17:35:13
Yes, this is a straight move of code from NodeRare
| |
33 | 33 |
34 namespace WebCore { | 34 namespace WebCore { |
35 | 35 |
36 PerformanceEntry::PerformanceEntry(const String& name, const String& entryType, double startTime, double finishTime) | 36 void NodeListsNodeData::invalidateCaches(const QualifiedName* attrName) |
37 : m_name(name) | |
38 , m_entryType(entryType) | |
39 , m_startTime(startTime) | |
40 , m_duration(finishTime - startTime) | |
41 { | 37 { |
42 ScriptWrappable::init(this); | 38 NodeListAtomicNameCacheMap::const_iterator atomicNameCacheEnd = m_atomicName Caches.end(); |
39 for (NodeListAtomicNameCacheMap::const_iterator it = m_atomicNameCaches.begi n(); it != atomicNameCacheEnd; ++it) | |
40 it->value->invalidateCacheForAttribute(attrName); | |
41 | |
42 if (attrName) | |
43 return; | |
44 | |
45 TagCollectionCacheNS::iterator tagCacheEnd = m_tagCollectionCacheNS.end(); | |
46 for (TagCollectionCacheNS::iterator it = m_tagCollectionCacheNS.begin(); it != tagCacheEnd; ++it) | |
47 it->value->invalidateCache(); | |
43 } | 48 } |
44 | 49 |
45 PerformanceEntry::~PerformanceEntry() | 50 void NodeListsNodeData::trace(Visitor* visitor) |
46 { | 51 { |
47 } | 52 visitor->trace(m_childNodeList); |
48 | 53 visitor->trace(m_atomicNameCaches); |
49 String PerformanceEntry::name() const | 54 visitor->trace(m_tagCollectionCacheNS); |
50 { | |
51 return m_name; | |
52 } | |
53 | |
54 String PerformanceEntry::entryType() const | |
55 { | |
56 return m_entryType; | |
57 } | |
58 | |
59 double PerformanceEntry::startTime() const | |
60 { | |
61 return m_startTime; | |
62 } | |
63 | |
64 double PerformanceEntry::duration() const | |
65 { | |
66 return m_duration; | |
67 } | 55 } |
68 | 56 |
69 } // namespace WebCore | 57 } // namespace WebCore |
OLD | NEW |