00001 /******************************************************************************* 00002 * Copyright (C) 2004 Vintela, Inc. All rights reserved. 00003 * Copyright (C) 2005 Novell, Inc. All rights reserved. 00004 * 00005 * Redistribution and use in source and binary forms, with or without 00006 * modification, are permitted provided that the following conditions are met: 00007 * 00008 * - Redistributions of source code must retain the above copyright notice, 00009 * this list of conditions and the following disclaimer. 00010 * 00011 * - Redistributions in binary form must reproduce the above copyright notice, 00012 * this list of conditions and the following disclaimer in the documentation 00013 * and/or other materials provided with the distribution. 00014 * 00015 * - Neither the name of Vintela, Inc., Novell, Inc., nor the names of its 00016 * contributors may be used to endorse or promote products derived from this 00017 * software without specific prior written permission. 00018 * 00019 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' 00020 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00021 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00022 * ARE DISCLAIMED. IN NO EVENT SHALL Vintela, Inc., Novell, Inc., OR THE 00023 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00024 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00025 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 00026 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 00027 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 00028 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 00029 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00030 *******************************************************************************/ 00031 00032 00037 // 00038 // Copyright (c) 2001, 2002 Peter Dimov 00039 // 00040 // Permission to copy, use, modify, sell and distribute this software 00041 // is granted provided this copyright notice appears in all copies. 00042 // This software is provided "as is" without express or implied 00043 // warranty, and with no claim as to its suitability for any purpose. 00044 // 00045 00046 #ifndef BLOCXX_COW_INTRUSIVE_COUNTABLE_BASE_HPP_INCLUDE_GUARD_ 00047 #define BLOCXX_COW_INTRUSIVE_COUNTABLE_BASE_HPP_INCLUDE_GUARD_ 00048 00049 #include "blocxx/BLOCXX_config.h" 00050 #include "blocxx/RefCount.hpp" 00051 00052 namespace BLOCXX_NAMESPACE 00053 { 00054 00070 class BLOCXX_COMMON_API COWIntrusiveCountableBase 00071 { 00072 private: 00073 RefCount m_usecount; 00074 00075 protected: 00079 COWIntrusiveCountableBase(COWIntrusiveCountableBase const &) 00080 : m_usecount(0) 00081 { 00082 } 00083 00087 COWIntrusiveCountableBase(): m_usecount(0) 00088 { 00089 } 00090 00096 COWIntrusiveCountableBase& operator=(COWIntrusiveCountableBase const &x) 00097 { 00098 // don't assign or change the ref count, since it won't be different. 00099 return *this; 00100 } 00101 00105 virtual ~COWIntrusiveCountableBase(); 00106 00110 RefCount getRefCount() const 00111 { 00112 return m_usecount; 00113 } 00114 00115 public: 00116 00122 inline friend void COWIntrusiveReferenceAddRef(COWIntrusiveCountableBase * p) 00123 { 00124 p->m_usecount.inc(); 00125 } 00126 00134 inline friend void COWIntrusiveReferenceRelease(COWIntrusiveCountableBase * p) 00135 { 00136 if (p->m_usecount.decAndTest()) 00137 delete p; 00138 } 00139 00146 inline friend bool COWIntrusiveReferenceUnique(COWIntrusiveCountableBase* p) 00147 { 00148 return p->m_usecount.get() == 1; 00149 } 00150 00156 template <typename T> 00157 inline friend T* COWIntrusiveReferenceClone(T* p) 00158 { 00159 // this needs to happen first to avoid a race condition between 00160 // another thread deleting the object and this one making a copy. 00161 T* tmp = p->clone(); 00162 if (p->m_usecount.decAndTest()) 00163 { 00164 // only copy--don't need to clone, also not a race condition. 00165 // undo the decAndTest. 00166 p->m_usecount.inc(); 00167 delete tmp; // we won't need this anymore. 00168 return p; 00169 } 00170 else 00171 { 00172 // need to become unique 00173 if (tmp) 00174 COWIntrusiveReferenceAddRef(tmp); 00175 return tmp; 00176 } 00177 } 00178 }; 00179 00180 } // end namespace BLOCXX_NAMESPACE 00181 00182 #endif 00183 00184
1.4.4