|
version 1.14, 2002/06/01 00:56:34
|
version 1.24, 2006/11/10 18:14:58
|
|
|
|
| //%///////////////////////////////////////////////////////////////////////////// |
//%2006//////////////////////////////////////////////////////////////////////// |
| // | // |
| // Copyright (c) 2000, 2001, 2002 BMC Software, Hewlett-Packard Company, IBM, |
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
| // The Open Group, Tivoli Systems |
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
| |
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
| |
// IBM Corp.; EMC Corporation, The Open Group. |
| |
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
| |
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
| |
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
| |
// EMC Corporation; VERITAS Software Corporation; The Open Group. |
| |
// Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
| |
// EMC Corporation; Symantec Corporation; The Open Group. |
| // | // |
| // Permission is hereby granted, free of charge, to any person obtaining a copy | // Permission is hereby granted, free of charge, to any person obtaining a copy |
| // of this software and associated documentation files (the "Software"), to | // of this software and associated documentation files (the "Software"), to |
|
|
|
| // | // |
| //============================================================================== | //============================================================================== |
| // | // |
| // Author: Mike Brasher (mbrasher@bmc.com) |
|
| // |
|
| // Modified By: |
|
| // |
|
| //%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| | |
| //////////////////////////////////////////////////////////////////////////////// | //////////////////////////////////////////////////////////////////////////////// |
|
|
|
| #define Pegasus_Memory_h | #define Pegasus_Memory_h |
| | |
| #include <cstring> | #include <cstring> |
| |
#include <memory.h> |
| #include <Pegasus/Common/Config.h> | #include <Pegasus/Common/Config.h> |
| #include <Pegasus/Common/CIMType.h> | #include <Pegasus/Common/CIMType.h> |
| #include <Pegasus/Common/Char16.h> | #include <Pegasus/Common/Char16.h> |
|
|
|
| template<class T> | template<class T> |
| inline void Destroy(T* items, Uint32 size) | inline void Destroy(T* items, Uint32 size) |
| { | { |
| |
#ifdef PEGASUS_OS_HPUX |
| |
// Empirical evidence shows that the memory allocator on HP-UX performs |
| |
// better when deallocating more recently allocated memory first (LIFO). |
| |
// Since most arrays are built up by appending elements to the end, it is |
| |
// advantageous to destruct the elements in reverse order. |
| |
items += size-1; |
| |
while (size--) |
| |
(items--)->~T(); |
| |
#else |
| while (size--) | while (size--) |
| items++->~T(); | items++->~T(); |
| |
#endif |
| } | } |
| | |
| template<class T> | template<class T> |
|
|
|
| } | } |
| } | } |
| | |
| |
inline void CopyToRaw(char* to, const char* from, Uint32 size) |
| |
{ |
| |
memcpy(to, from, sizeof(char) * size); |
| |
} |
| |
|
| inline void CopyToRaw(Boolean* to, const Boolean* from, Uint32 size) | inline void CopyToRaw(Boolean* to, const Boolean* from, Uint32 size) |
| { | { |
| memcpy(to, from, sizeof(Boolean) * size); | memcpy(to, from, sizeof(Boolean) * size); |
Return to
Memory.h
CVS log
Up to [Pegasus] / pegasus / src / Pegasus / Common