x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
thread_heap_alloc.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\thread\win32\thread_heap_alloc.hpp
旋转
特效
属性
历史版本
// 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) // (C) Copyright 2007 Anthony Williams #ifndef THREAD_HEAP_ALLOC_HPP #define THREAD_HEAP_ALLOC_HPP #include
#include "thread_primitives.hpp" #include
#include
#if defined( BOOST_USE_WINDOWS_H ) # include
namespace boost { namespace detail { namespace win32 { using ::GetProcessHeap; using ::HeapAlloc; using ::HeapFree; } } } #else # ifdef HeapAlloc # undef HeapAlloc # endif namespace boost { namespace detail { namespace win32 { extern "C" { __declspec(dllimport) handle __stdcall GetProcessHeap(); __declspec(dllimport) void* __stdcall HeapAlloc(handle,unsigned long,ulong_ptr); __declspec(dllimport) int __stdcall HeapFree(handle,unsigned long,void*); } } } } #endif namespace boost { namespace detail { inline BOOST_THREAD_DECL void* allocate_raw_heap_memory(unsigned size) { void* const heap_memory=detail::win32::HeapAlloc(detail::win32::GetProcessHeap(),0,size); if(!heap_memory) { throw std::bad_alloc(); } return heap_memory; } inline BOOST_THREAD_DECL void free_raw_heap_memory(void* heap_memory) { BOOST_VERIFY(detail::win32::HeapFree(detail::win32::GetProcessHeap(),0,heap_memory)!=0); } template
T* heap_new() { void* const heap_memory=allocate_raw_heap_memory(sizeof(T)); try { T* const data=new (heap_memory) T(); return data; } catch(...) { free_raw_heap_memory(heap_memory); throw; } } template
T* heap_new(A1 a1) { void* const heap_memory=allocate_raw_heap_memory(sizeof(T)); try { T* const data=new (heap_memory) T(a1); return data; } catch(...) { free_raw_heap_memory(heap_memory); throw; } } template
T* heap_new(A1 a1,A2 a2) { void* const heap_memory=allocate_raw_heap_memory(sizeof(T)); try { T* const data=new (heap_memory) T(a1,a2); return data; } catch(...) { free_raw_heap_memory(heap_memory); throw; } } template
T* heap_new(A1 a1,A2 a2,A3 a3) { void* const heap_memory=allocate_raw_heap_memory(sizeof(T)); try { T* const data=new (heap_memory) T(a1,a2,a3); return data; } catch(...) { free_raw_heap_memory(heap_memory); throw; } } template
T* heap_new(A1 a1,A2 a2,A3 a3,A4 a4) { void* const heap_memory=allocate_raw_heap_memory(sizeof(T)); try { T* const data=new (heap_memory) T(a1,a2,a3,a4); return data; } catch(...) { free_raw_heap_memory(heap_memory); throw; } } template
void heap_delete(T* data) { data->~T(); free_raw_heap_memory(data); } template
struct do_heap_delete { void operator()(T* data) const { detail::heap_delete(data); } }; } } #endif
thread_heap_alloc.hpp
网页地址
文件地址
上一页
10/12
下一页
下载
( 4 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.