diff options
Diffstat (limited to 'ACE/ace/Malloc_T.h')
-rw-r--r-- | ACE/ace/Malloc_T.h | 58 |
1 files changed, 29 insertions, 29 deletions
diff --git a/ACE/ace/Malloc_T.h b/ACE/ace/Malloc_T.h index 0b622ec3df2..25998a9fb96 100644 --- a/ACE/ace/Malloc_T.h +++ b/ACE/ace/Malloc_T.h @@ -43,10 +43,10 @@ class ACE_Cached_Mem_Pool_Node { public: /// Return the address of free memory. - T *addr (void); + T *addr (); /// Get the next ACE_Cached_Mem_Pool_Node in a list. - ACE_Cached_Mem_Pool_Node<T> *get_next (void); + ACE_Cached_Mem_Pool_Node<T> *get_next (); /// Set the next ACE_Cached_Mem_Pool_Node. void set_next (ACE_Cached_Mem_Pool_Node<T> *ptr); @@ -90,7 +90,7 @@ public: ACE_Cached_Allocator (size_t n_chunks); /// Clear things up. - ~ACE_Cached_Allocator (void); + ~ACE_Cached_Allocator (); /** * Get a chunk of memory from free list cache. Note that @a nbytes is @@ -119,7 +119,7 @@ public: void free (void *); /// Return the number of chunks available in the cache. - size_t pool_depth (void); + size_t pool_depth (); ACE_ALLOC_HOOK_DECLARE; @@ -157,7 +157,7 @@ public: ACE_Dynamic_Cached_Allocator (size_t n_chunks, size_t chunk_size); /// Clear things up. - ~ACE_Dynamic_Cached_Allocator (void); + ~ACE_Dynamic_Cached_Allocator (); /** * Get a chunk of memory from free list cache. Note that @a nbytes is @@ -186,7 +186,7 @@ public: void free (void *); /// Return the number of chunks available in the cache. - size_t pool_depth (void); + size_t pool_depth (); private: /// Remember how we allocate the memory in the first place so @@ -251,7 +251,7 @@ public: #endif /* ACE_HAS_WCHAR */ /// Destructor. - virtual ~ACE_Allocator_Adapter (void); + virtual ~ACE_Allocator_Adapter (); // = Memory Management @@ -271,7 +271,7 @@ public: virtual void free (void *ptr); /// Remove any resources associated with this memory manager. - virtual int remove (void); + virtual int remove (); // = Map manager like functions @@ -338,7 +338,7 @@ public: virtual int protect (void *addr, size_t len, int prot = PROT_RDWR); /// Returns the underlying allocator. - ALLOCATOR &alloc (void); + ALLOCATOR &alloc (); #if defined (ACE_HAS_MALLOC_STATS) /// Dump statistics of how malloc is behaving. @@ -346,7 +346,7 @@ public: #endif /* ACE_HAS_MALLOC_STATS */ /// Dump the state of the object. - virtual void dump (void) const; + virtual void dump () const; ACE_ALLOC_HOOK_DECLARE; @@ -370,7 +370,7 @@ template <size_t POOL_SIZE> class ACE_Static_Allocator : public ACE_Static_Allocator_Base { public: - ACE_Static_Allocator (void) + ACE_Static_Allocator () : ACE_Static_Allocator_Base (pool_, POOL_SIZE) { // This function <{must}> be inlined!!! @@ -480,16 +480,16 @@ public: ACE_LOCK *lock); /// Destructor - ~ACE_Malloc_T (void); + ~ACE_Malloc_T (); /// Get Reference counter. - int ref_counter (void); + int ref_counter (); /// Release ref counter. int release (int close = 0); /// Releases resources allocated by this object. - int remove (void); + int remove (); // = Memory management @@ -510,7 +510,7 @@ public: void free (void *ptr); /// Returns a reference to the underlying memory pool. - MEMORY_POOL &memory_pool (void); + MEMORY_POOL &memory_pool (); // = Map manager like functions @@ -602,16 +602,16 @@ public: /// Returns a pointer to the lock used to provide mutual exclusion to /// an ACE_Malloc allocator. - ACE_LOCK &mutex (void); + ACE_LOCK &mutex (); /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; /// Return cb_ptr value. - void *base_addr (void); + void *base_addr (); /** * Bad flag. This operation should be called immediately after the @@ -621,11 +621,11 @@ public: * @retval 0 if all is fine. non-zero if this malloc object is * unuable. */ - int bad (void); + int bad (); private: /// Initialize the Malloc pool. - int open (void); + int open (); /// Associate @a name with @a pointer. Assumes that locks are held by /// callers. @@ -703,12 +703,12 @@ public: const char *name = 0); /// Destructor. - ~ACE_Malloc_LIFO_Iterator_T (void); + ~ACE_Malloc_LIFO_Iterator_T (); // = Iteration methods. /// Returns 1 when all items have been seen, else 0. - int done (void) const; + int done () const; /// Pass back the next entry in the set that hasn't yet been /// visited. Returns 0 when all items have been seen, else 1. @@ -723,10 +723,10 @@ public: /// Move forward by one element in the set. Returns 0 when all the /// items in the set have been seen, else 1. - int advance (void); + int advance (); /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; @@ -771,12 +771,12 @@ public: const char *name = 0); /// Destructor. - ~ACE_Malloc_FIFO_Iterator_T (void); + ~ACE_Malloc_FIFO_Iterator_T (); // = Iteration methods. /// Returns 1 when all items have been seen, else 0. - int done (void) const; + int done () const; /// Pass back the next entry in the set that hasn't yet been /// visited. Returns 0 when all items have been seen, else 1. @@ -791,14 +791,14 @@ public: /// Move forward by one element in the set. Returns 0 when all the /// items in the set have been seen, else 1. - int advance (void); + int advance (); /// Go to the starting element that was inserted first. Returns 0 /// when there is no item in the set, else 1. - int start (void); + int start (); /// Dump the state of an object. - void dump (void) const; + void dump () const; /// Declare the dynamic allocation hooks. ACE_ALLOC_HOOK_DECLARE; |