DriveHQ Start Menu
Cloud Drive Mapping
Folder Sync
Cloud Backup
True Drop Box
FTP/SFTP Hosting
Group Account
DriveHQ Start Menu
Online File Server
My Storage
|
Manage Shares
|
Publishes
|
Drop Boxes
|
Group Account
WebDAV Drive Mapping
Cloud Drive Home
|
WebDAV Guide
|
Drive Mapping Tool
|
Drive Mapping URL
Complete Data Backup
Backup Guide
|
Online Backup Tool
|
Cloud-to-Cloud Backup
FTP, Email & Web Service
FTP Home
|
FTP Hosting FAQ
|
Email Hosting
|
EmailManager
|
Web Hosting
Help & Resources
About
|
Enterprise Service
|
Partnership
|
Comparisons
|
Support
Quick Links
Security and Privacy
Download Software
Service Manual
Use Cases
Group Account
Online Help
Blog
Contact
Cloud Surveillance
Sign Up
Login
Features
Business Features
Online File Server
FTP Hosting
Cloud Drive Mapping
Cloud File Backup
Email Backup & Hosting
Cloud File Sharing
Folder Synchronization
Group Management
True Drop Box
Full-text Search
AD Integration/SSO
Mobile Access
IP Camera & DVR Solution
More...
Personal Features
Personal Cloud Drive
Backup All Devices
Mobile APPs
Personal Web Hosting
Sub-Account (for Kids)
Home/PC/Kids Monitoring
More...
Software
DriveHQ Drive Mapping Tool
DriveHQ FileManager
DriveHQ Online Backup
DriveHQ Mobile Apps
Pricing
Business Plans & Pricing
Personal Plans & Pricing
Price Comparison with Others
Feature Comparison with Others
Install Mobile App
Sign up
Creating account...
Invalid character in username! Only 0-9, a-z, A-Z, _, -, . allowed.
Username is required!
Invalid email address!
E-mail is required!
Password is required!
Password is invalid!
Password and confirmation do not match.
Confirm password is required!
I accept
Membership Agreement
Please read the Membership Agreement and check "I accept"!
Free Quick Sign-up
Sign-up Page
Log in
Signing in...
Username or e-mail address is required!
Password is required!
Keep me logged in
Quick Login
Forgot Password
Up
Upload
Download
Share
Publish
New Folder
New File
Copy
Cut
Delete
Paste
Rate
Upgrade
Rotate
Effect
Edit
Slide
History
////////////////////////////////////////////////////////////////////////////// // // This file is the adaptation for Interprocess of boost/detail/shared_count.hpp // // (C) Copyright Peter Dimov and Multi Media Ltd. 2001, 2002, 2003 // (C) Copyright Peter Dimov 2004-2005 // (C) Copyright Ion Gaztanaga 2006-2008. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/interprocess for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTERPROCESS_DETAIL_SHARED_COUNT_HPP_INCLUDED #define BOOST_INTERPROCESS_DETAIL_SHARED_COUNT_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #include
#include
#include
#include
#include
#include
#include
#include
// std::less namespace boost { namespace interprocess { namespace detail{ template
class weak_count; template
class shared_count { public: typedef typename detail::pointer_to_other
::type pointer; private: typedef sp_counted_impl_pd
counted_impl; typedef typename detail::pointer_to_other
::type counted_impl_ptr; typedef typename detail::pointer_to_other
::type counted_base_ptr; typedef typename VoidAllocator::template rebind
::other counted_impl_allocator; typedef typename detail::pointer_to_other
::type const_deleter_pointer; typedef typename detail::pointer_to_other
::type const_allocator_pointer; pointer m_px; counted_impl_ptr m_pi; template
friend class weak_count; template
friend class shared_count; public: shared_count() : m_px(0), m_pi(0) // nothrow {} template
shared_count(const Ptr &p, const VoidAllocator &a, Deleter d) : m_px(p), m_pi(0) { BOOST_TRY{ if(p){ counted_impl_allocator alloc(a); m_pi = alloc.allocate(1); //Anti-exception deallocator scoped_ptr
> deallocator(m_pi, alloc); //It's more correct to use VoidAllocator::construct but //this needs copy constructor and we don't like it new(detail::get_pointer(m_pi))counted_impl(p, a, d); deallocator.release(); } } BOOST_CATCH (...){ d(p); // delete p BOOST_RETHROW } BOOST_CATCH_END } ~shared_count() // nothrow { if( m_pi != 0 ) m_pi->release(); } shared_count(shared_count const & r) : m_px(r.m_px), m_pi(r.m_pi) // nothrow { if( m_pi != 0 ) m_pi->add_ref_copy(); } //this is a test template
explicit shared_count(shared_count
const & r) : m_px(r.m_px), m_pi(r.m_pi) // nothrow { if( m_pi != 0 ) m_pi->add_ref_copy(); } //this is a test template
explicit shared_count(const pointer & ptr, shared_count
const & r) : m_px(ptr), m_pi(r.m_pi) // nothrow { if( m_pi != 0 ) m_pi->add_ref_copy(); } /* explicit shared_count(weak_count
const & r) // throws bad_weak_ptr when r.use_count() == 0 : m_pi( r.m_pi ) { if( m_pi == 0 || !m_pi->add_ref_lock() ){ boost::throw_exception( boost::interprocess::bad_weak_ptr() ); } } */ template
explicit shared_count(weak_count
const & r) // throws bad_weak_ptr when r.use_count() == 0 : m_px(r.m_px), m_pi( r.m_pi ) { if( m_pi == 0 || !m_pi->add_ref_lock() ){ throw( boost::interprocess::bad_weak_ptr() ); } } const pointer &get_pointer() const { return m_px; } pointer &get_pointer() { return m_px; } shared_count & operator= (shared_count const & r) // nothrow { m_px = r.m_px; counted_impl_ptr tmp = r.m_pi; if( tmp != m_pi ){ if(tmp != 0) tmp->add_ref_copy(); if(m_pi != 0) m_pi->release(); m_pi = tmp; } return *this; } template
shared_count & operator= (shared_count
const & r) // nothrow { m_px = r.m_px; counted_impl_ptr tmp = r.m_pi; if( tmp != m_pi ){ if(tmp != 0) tmp->add_ref_copy(); if(m_pi != 0) m_pi->release(); m_pi = tmp; } return *this; } void swap(shared_count & r) // nothrow { detail::do_swap(m_px, r.m_px); detail::do_swap(m_pi, r.m_pi); } long use_count() const // nothrow { return m_pi != 0? m_pi->use_count(): 0; } bool unique() const // nothrow { return use_count() == 1; } const_deleter_pointer get_deleter() const { return m_pi ? m_pi->get_deleter() : 0; } // const_allocator_pointer get_allocator() const // { return m_pi ? m_pi->get_allocator() : 0; } template
bool internal_equal (shared_count
const & other) const { return this->m_pi == other.m_pi; } template
bool internal_less (shared_count
const & other) const { return std::less
()(this->m_pi, other.m_pi); } }; template
inline bool operator==(shared_count
const & a, shared_count
const & b) { return a.internal_equal(b); } template
inline bool operator<(shared_count
const & a, shared_count
const & b) { return a.internal_less(b); } template
class weak_count { public: typedef typename detail::pointer_to_other
::type pointer; private: typedef sp_counted_impl_pd
counted_impl; typedef typename detail::pointer_to_other
::type counted_impl_ptr; typedef typename detail::pointer_to_other
::type counted_base_ptr; pointer m_px; counted_impl_ptr m_pi; template
friend class weak_count; template
friend class shared_count; public: weak_count(): m_px(0), m_pi(0) // nothrow {} template
explicit weak_count(shared_count
const & r) : m_px(r.m_px), m_pi(r.m_pi) // nothrow { if(m_pi != 0) m_pi->weak_add_ref(); } weak_count(weak_count const & r) : m_px(r.m_px), m_pi(r.m_pi) // nothrow { if(m_pi != 0) m_pi->weak_add_ref(); } template
weak_count(weak_count
const & r) : m_px(r.m_px), m_pi(r.m_pi) // nothrow { if(m_pi != 0) m_pi->weak_add_ref(); } ~weak_count() // nothrow { if(m_pi != 0) m_pi->weak_release(); } template
weak_count & operator= (shared_count
const & r) // nothrow { m_px = r.m_px; counted_impl_ptr tmp = r.m_pi; if(tmp != 0) tmp->weak_add_ref(); if(m_pi != 0) m_pi->weak_release(); m_pi = tmp; return *this; } weak_count & operator= (weak_count const & r) // nothrow { counted_impl_ptr tmp = r.m_pi; if(tmp != 0) tmp->weak_add_ref(); if(m_pi != 0) m_pi->weak_release(); m_pi = tmp; return *this; } void set_pointer(const pointer &ptr) { m_px = ptr; } template
weak_count & operator= (weak_count
const& r) // nothrow { counted_impl_ptr tmp = r.m_pi; if(tmp != 0) tmp->weak_add_ref(); if(m_pi != 0) m_pi->weak_release(); m_pi = tmp; return *this; } void swap(weak_count & r) // nothrow { detail::do_swap(m_px, r.m_px); detail::do_swap(m_pi, r.m_pi); } long use_count() const // nothrow { return m_pi != 0? m_pi->use_count() : 0; } template
bool internal_equal (weak_count
const & other) const { return this->m_pi == other.m_pi; } template
bool internal_less (weak_count
const & other) const { return std::less
()(this->m_pi, other.m_pi); } }; template
inline bool operator==(weak_count
const & a, weak_count
const & b) { return a.internal_equal(b); } template
inline bool operator<(weak_count
const & a, weak_count
const & b) { return a.internal_less(b); } } // namespace detail } // namespace interprocess } // namespace boost #include
#endif // #ifndef BOOST_INTERPROCESS_DETAIL_SHARED_COUNT_HPP_INCLUDED
shared_count.hpp
Page URL
File URL
Prev
2/5
Next
Download
( 10 KB )
Note: The DriveHQ service banners will NOT be displayed if the file owner is a paid member.
Comments
Total ratings:
0
Average rating:
Not Rated
Would you like to comment?
Join DriveHQ
for a free account, or
Logon
if you are already a member.