OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2007, 2008 Apple Inc. All rights reserved. | 2 * Copyright (C) 2007, 2008 Apple 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 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | 22 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
23 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND | 23 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
24 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 */ | 27 */ |
28 | 28 |
29 #ifndef StaticNodeList_h | 29 #ifndef StaticNodeList_h |
30 #define StaticNodeList_h | 30 #define StaticNodeList_h |
31 | 31 |
32 #include "core/dom/Node.h" | |
33 #include "core/dom/NodeList.h" | 32 #include "core/dom/NodeList.h" |
34 #include "wtf/PassRefPtr.h" | 33 #include "wtf/PassRefPtr.h" |
35 #include "wtf/RefPtr.h" | 34 #include "wtf/RefPtr.h" |
36 #include "wtf/Vector.h" | 35 #include "wtf/Vector.h" |
| 36 #include <v8.h> |
37 | 37 |
38 namespace blink { | 38 namespace blink { |
39 | 39 |
| 40 class Element; |
40 class Node; | 41 class Node; |
41 | 42 |
42 class StaticNodeList FINAL : public NodeList { | 43 template <typename NodeType> |
| 44 class StaticNodeTypeList FINAL : public NodeList { |
43 public: | 45 public: |
44 static PassRefPtrWillBeRawPtr<StaticNodeList> adopt(WillBeHeapVector<RefPtrW
illBeMember<Node> >& nodes); | 46 static PassRefPtrWillBeRawPtr<StaticNodeTypeList> adopt(WillBeHeapVector<Ref
PtrWillBeMember<NodeType> >& nodes); |
45 | 47 |
46 static PassRefPtrWillBeRawPtr<StaticNodeList> createEmpty() | 48 static PassRefPtrWillBeRawPtr<StaticNodeTypeList> createEmpty() |
47 { | 49 { |
48 return adoptRefWillBeNoop(new StaticNodeList); | 50 return adoptRefWillBeNoop(new StaticNodeTypeList); |
49 } | 51 } |
50 | 52 |
51 virtual ~StaticNodeList(); | 53 virtual ~StaticNodeTypeList(); |
52 | 54 |
53 virtual unsigned length() const OVERRIDE; | 55 virtual unsigned length() const OVERRIDE; |
54 virtual Node* item(unsigned index) const OVERRIDE; | 56 virtual NodeType* item(unsigned index) const OVERRIDE; |
55 | 57 |
56 virtual void trace(Visitor*) OVERRIDE; | 58 virtual void trace(Visitor*) OVERRIDE; |
57 | 59 |
58 private: | 60 private: |
59 ptrdiff_t AllocationSize() | 61 ptrdiff_t AllocationSize() |
60 { | 62 { |
61 return m_nodes.capacity() * sizeof(RefPtrWillBeMember<Node>); | 63 return m_nodes.capacity() * sizeof(RefPtrWillBeMember<NodeType>); |
62 } | 64 } |
63 | 65 |
64 WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes; | 66 WillBeHeapVector<RefPtrWillBeMember<NodeType> > m_nodes; |
65 }; | 67 }; |
66 | 68 |
| 69 typedef StaticNodeTypeList<Node> StaticNodeList; |
| 70 typedef StaticNodeTypeList<Element> StaticElementList; |
| 71 |
| 72 template <typename NodeType> |
| 73 PassRefPtrWillBeRawPtr<StaticNodeTypeList<NodeType> > StaticNodeTypeList<NodeTyp
e>::adopt(WillBeHeapVector<RefPtrWillBeMember<NodeType> >& nodes) |
| 74 { |
| 75 RefPtrWillBeRawPtr<StaticNodeTypeList<NodeType> > nodeList = adoptRefWillBeN
oop(new StaticNodeTypeList<NodeType>); |
| 76 nodeList->m_nodes.swap(nodes); |
| 77 v8::Isolate::GetCurrent()->AdjustAmountOfExternalAllocatedMemory(nodeList->A
llocationSize()); |
| 78 return nodeList.release(); |
| 79 } |
| 80 |
| 81 template <typename NodeType> |
| 82 StaticNodeTypeList<NodeType>::~StaticNodeTypeList() |
| 83 { |
| 84 v8::Isolate::GetCurrent()->AdjustAmountOfExternalAllocatedMemory(-Allocation
Size()); |
| 85 } |
| 86 |
| 87 template <typename NodeType> |
| 88 unsigned StaticNodeTypeList<NodeType>::length() const |
| 89 { |
| 90 return m_nodes.size(); |
| 91 } |
| 92 |
| 93 template <typename NodeType> |
| 94 NodeType* StaticNodeTypeList<NodeType>::item(unsigned index) const |
| 95 { |
| 96 if (index < m_nodes.size()) |
| 97 return m_nodes[index].get(); |
| 98 return 0; |
| 99 } |
| 100 |
| 101 template <typename NodeType> |
| 102 void StaticNodeTypeList<NodeType>::trace(Visitor* visitor) |
| 103 { |
| 104 visitor->trace(m_nodes); |
| 105 NodeList::trace(visitor); |
| 106 } |
| 107 |
67 } // namespace blink | 108 } // namespace blink |
68 | 109 |
69 #endif // StaticNodeList_h | 110 #endif // StaticNodeList_h |
OLD | NEW |