Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(251)

Side by Side Diff: src/smart-pointers.h

Issue 10807024: Optimize functions on a second thread. (Closed) Base URL: https://v8.googlecode.com/svn/branches/bleeding_edge
Patch Set: Created 8 years, 5 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright 2011 the V8 project authors. All rights reserved. 1 // Copyright 2011 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without 2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are 3 // modification, are permitted provided that the following conditions are
4 // met: 4 // met:
5 // 5 //
6 // * Redistributions of source code must retain the above copyright 6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer. 7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above 8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following 9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided 10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution. 11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its 12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived 13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission. 14 // from this software without specific prior written permission.
15 // 15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 27
28 #ifndef V8_SMART_ARRAY_POINTER_H_ 28 #ifndef V8_SMART_POINTERS_H_
29 #define V8_SMART_ARRAY_POINTER_H_ 29 #define V8_SMART_POINTERS_H_
30 30
31 namespace v8 { 31 namespace v8 {
32 namespace internal { 32 namespace internal {
33 33
34 34
35 // A 'scoped array pointer' that calls DeleteArray on its pointer when the 35 template<typename Deallocator, typename T>
36 // destructor is called. 36 class SmartPointerBase {
37 template<typename T>
38 class SmartArrayPointer {
39 public: 37 public:
40 // Default constructor. Constructs an empty scoped pointer. 38 // Default constructor. Constructs an empty scoped pointer.
41 inline SmartArrayPointer() : p_(NULL) {} 39 inline SmartPointerBase() : p_(NULL) {}
42 40
43 // Constructs a scoped pointer from a plain one. 41 // Constructs a scoped pointer from a plain one.
44 explicit inline SmartArrayPointer(T* ptr) : p_(ptr) {} 42 explicit inline SmartPointerBase(T* ptr) : p_(ptr) {}
45 43
46 // Copy constructor removes the pointer from the original to avoid double 44 // Copy constructor removes the pointer from the original to avoid double
47 // freeing. 45 // freeing.
48 inline SmartArrayPointer(const SmartArrayPointer<T>& rhs) : p_(rhs.p_) { 46 inline SmartPointerBase(const SmartPointerBase<Deallocator, T>& rhs)
49 const_cast<SmartArrayPointer<T>&>(rhs).p_ = NULL; 47 : p_(rhs.p_) {
48 const_cast<SmartPointerBase<Deallocator, T>&>(rhs).p_ = NULL;
50 } 49 }
51 50
52 // When the destructor of the scoped pointer is executed the plain pointer 51 // When the destructor of the scoped pointer is executed the plain pointer
53 // is deleted using DeleteArray. This implies that you must allocate with 52 // is deleted using DeleteArray. This implies that you must allocate with
54 // NewArray. 53 // NewArray.
55 inline ~SmartArrayPointer() { if (p_) DeleteArray(p_); } 54 inline ~SmartPointerBase() { if (p_) Deallocator::Delete(p_); }
56 55
57 inline T* operator->() const { return p_; } 56 inline T* operator->() const { return p_; }
58 57
59 // You can get the underlying pointer out with the * operator. 58 // You can get the underlying pointer out with the * operator.
60 inline T* operator*() { return p_; } 59 inline T* operator*() { return p_; }
61 60
62 // You can use [n] to index as if it was a plain pointer 61 // You can use [n] to index as if it was a plain pointer
63 inline T& operator[](size_t i) { 62 inline T& operator[](size_t i) {
64 return p_[i]; 63 return p_[i];
65 } 64 }
66 65
67 // We don't have implicit conversion to a T* since that hinders migration: 66 // We don't have implicit conversion to a T* since that hinders migration:
68 // You would not be able to change a method from returning a T* to 67 // You would not be able to change a method from returning a T* to
69 // returning an SmartArrayPointer<T> and then get errors wherever it is used. 68 // returning an SmartArrayPointer<T> and then get errors wherever it is used.
70 69
71 70
72 // If you want to take out the plain pointer and don't want it automatically 71 // If you want to take out the plain pointer and don't want it automatically
73 // deleted then call Detach(). Afterwards, the smart pointer is empty 72 // deleted then call Detach(). Afterwards, the smart pointer is empty
74 // (NULL). 73 // (NULL).
75 inline T* Detach() { 74 inline T* Detach() {
76 T* temp = p_; 75 T* temp = p_;
77 p_ = NULL; 76 p_ = NULL;
78 return temp; 77 return temp;
79 } 78 }
80 79
81 // Assignment requires an empty (NULL) SmartArrayPointer as the receiver. Like 80 // Assignment requires an empty (NULL) SmartArrayPointer as the receiver. Like
82 // the copy constructor it removes the pointer in the original to avoid 81 // the copy constructor it removes the pointer in the original to avoid
83 // double freeing. 82 // double freeing.
84 inline SmartArrayPointer& operator=(const SmartArrayPointer<T>& rhs) { 83 inline SmartPointerBase<Deallocator, T>& operator=(
84 const SmartPointerBase<Deallocator, T>& rhs) {
85 ASSERT(is_empty()); 85 ASSERT(is_empty());
86 T* tmp = rhs.p_; // swap to handle self-assignment 86 T* tmp = rhs.p_; // swap to handle self-assignment
87 const_cast<SmartArrayPointer<T>&>(rhs).p_ = NULL; 87 const_cast<SmartPointerBase<Deallocator, T>&>(rhs).p_ = NULL;
88 p_ = tmp; 88 p_ = tmp;
89 return *this; 89 return *this;
90 } 90 }
91 91
92 inline bool is_empty() { return p_ == NULL; } 92 inline bool is_empty() { return p_ == NULL; }
93 93
94 private: 94 private:
95 T* p_; 95 T* p_;
96 }; 96 };
97 97
98 // A 'scoped array pointer' that calls DeleteArray on its pointer when the
99 // destructor is called.
100
101 template<typename T>
102 struct ArrayDeallocator {
103 static void Delete(T* array) {
104 DeleteArray(array);
105 }
106 };
107
108
109 template<typename T>
110 class SmartArrayPointer: public SmartPointerBase<ArrayDeallocator<T>, T> {
111 public:
112 inline SmartArrayPointer() { }
113 explicit inline SmartArrayPointer(T* ptr)
114 : SmartPointerBase<ArrayDeallocator<T>, T>(ptr) { }
115 inline SmartArrayPointer(const SmartArrayPointer<T>& rhs)
116 : SmartPointerBase<ArrayDeallocator<T>, T>(rhs) { }
117 };
118
119
120 template<typename T>
121 struct ObjectDeallocator {
122 static void Delete(T* array) {
123 Malloced::Delete(array);
124 }
125 };
126
127 template<typename T>
128 class SmartPointer: public SmartPointerBase<ObjectDeallocator<T>, T> {
129 public:
130 inline SmartPointer() { }
131 explicit inline SmartPointer(T* ptr)
132 : SmartPointerBase<ObjectDeallocator<T>, T>(ptr) { }
133 inline SmartPointer(const SmartPointer<T>& rhs)
134 : SmartPointerBase<ObjectDeallocator<T>, T>(rhs) { }
135 };
136
98 } } // namespace v8::internal 137 } } // namespace v8::internal
99 138
100 #endif // V8_SMART_ARRAY_POINTER_H_ 139 #endif // V8_SMART_ARRAY_POINTERS_H_
Yang 2012/07/19 14:26:31 You probably mean V8_SMART_POINTERS_H_ in this com
sanjoy 2012/07/19 15:06:09 Done.
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698