v8  3.14.5(node0.10.28)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
smart-pointers.h
Go to the documentation of this file.
1 // Copyright 2011 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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.
27 
28 #ifndef V8_SMART_POINTERS_H_
29 #define V8_SMART_POINTERS_H_
30 
31 namespace v8 {
32 namespace internal {
33 
34 
35 template<typename Deallocator, typename T>
37  public:
38  // Default constructor. Constructs an empty scoped pointer.
39  inline SmartPointerBase() : p_(NULL) {}
40 
41  // Constructs a scoped pointer from a plain one.
42  explicit inline SmartPointerBase(T* ptr) : p_(ptr) {}
43 
44  // Copy constructor removes the pointer from the original to avoid double
45  // freeing.
47  : p_(rhs.p_) {
48  const_cast<SmartPointerBase<Deallocator, T>&>(rhs).p_ = NULL;
49  }
50 
51  // When the destructor of the scoped pointer is executed the plain pointer
52  // is deleted using DeleteArray. This implies that you must allocate with
53  // NewArray.
54  inline ~SmartPointerBase() { if (p_) Deallocator::Delete(p_); }
55 
56  inline T* operator->() const { return p_; }
57 
58  // You can get the underlying pointer out with the * operator.
59  inline T* operator*() { return p_; }
60 
61  // You can use [n] to index as if it was a plain pointer
62  inline T& operator[](size_t i) {
63  return p_[i];
64  }
65 
66  // We don't have implicit conversion to a T* since that hinders migration:
67  // You would not be able to change a method from returning a T* to
68  // returning an SmartArrayPointer<T> and then get errors wherever it is used.
69 
70 
71  // If you want to take out the plain pointer and don't want it automatically
72  // deleted then call Detach(). Afterwards, the smart pointer is empty
73  // (NULL).
74  inline T* Detach() {
75  T* temp = p_;
76  p_ = NULL;
77  return temp;
78  }
79 
80  // Assignment requires an empty (NULL) SmartArrayPointer as the receiver. Like
81  // the copy constructor it removes the pointer in the original to avoid
82  // double freeing.
85  ASSERT(is_empty());
86  T* tmp = rhs.p_; // swap to handle self-assignment
87  const_cast<SmartPointerBase<Deallocator, T>&>(rhs).p_ = NULL;
88  p_ = tmp;
89  return *this;
90  }
91 
92  inline bool is_empty() { return p_ == NULL; }
93 
94  private:
95  T* p_;
96 };
97 
98 // A 'scoped array pointer' that calls DeleteArray on its pointer when the
99 // destructor is called.
100 
101 template<typename T>
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) { }
116  : SmartPointerBase<ArrayDeallocator<T>, T>(rhs) { }
117 };
118 
119 
120 template<typename T>
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 
137 } } // namespace v8::internal
138 
139 #endif // V8_SMART_POINTERS_H_
static void Delete(void *p)
Definition: allocation.cc:47
#define ASSERT(condition)
Definition: checks.h:270
static void Delete(T *array)
SmartPointer(const SmartPointer< T > &rhs)
SmartPointerBase(const SmartPointerBase< Deallocator, T > &rhs)
#define T(name, string, precedence)
Definition: token.cc:48
SmartArrayPointer(const SmartArrayPointer< T > &rhs)
activate correct semantics for inheriting readonliness enable harmony semantics for typeof enable harmony enable harmony proxies enable all harmony harmony_scoping harmony_proxies harmony_scoping tracks arrays with only smi values automatically unbox arrays of doubles use crankshaft use hydrogen range analysis use hydrogen global value numbering use function inlining maximum number of AST nodes considered for a single inlining loop invariant code motion print statistics for hydrogen trace generated IR for specified phases trace register allocator trace range analysis trace representation types environment for every instruction put a break point before deoptimizing polymorphic inlining perform array bounds checks elimination use dead code elimination trace on stack replacement optimize closures cache optimized code for closures functions with arguments object loop weight for representation inference allow uint32 values on optimize frames if they are used only in safe operations track parallel recompilation enable all profiler experiments number of stack frames inspected by the profiler call recompile stub directly when self optimizing trigger profiler ticks based on counting instead of timing weight back edges by jump distance for interrupt triggering percentage of ICs that must have type info to allow optimization watch_ic_patching retry_self_opt interrupt_at_exit extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of SAHF instruction if enable use of VFP3 instructions if available this implies enabling ARMv7 and VFP2 enable use of VFP2 instructions if available enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of MIPS FPU instructions if NULL
Definition: flags.cc:301
void DeleteArray(T *array)
Definition: allocation.h:91
SmartPointerBase< Deallocator, T > & operator=(const SmartPointerBase< Deallocator, T > &rhs)
static void Delete(T *array)