75 lines
2.2 KiB
C++
75 lines
2.2 KiB
C++
|
/*
|
||
|
* Copyright (c) 2015, University of Kaiserslautern
|
||
|
* All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions are
|
||
|
* met:
|
||
|
*
|
||
|
* 1. Redistributions of source code must retain the above copyright notice,
|
||
|
* this list of conditions and the following disclaimer.
|
||
|
*
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
* documentation and/or other materials provided with the distribution.
|
||
|
*
|
||
|
* 3. Neither the name of the copyright holder nor the names of its
|
||
|
* contributors may be used to endorse or promote products derived from
|
||
|
* this software without specific prior written permission.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
||
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER
|
||
|
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
||
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
||
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
||
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||
|
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
*
|
||
|
* Authors:
|
||
|
* Robert Gernhardt
|
||
|
* Matthias Jung
|
||
|
*/
|
||
|
|
||
|
#include <iostream>
|
||
|
|
||
|
#include "sc_mm.hh"
|
||
|
|
||
|
using namespace std;
|
||
|
|
||
|
MemoryManager::MemoryManager(): numberOfAllocations(0), numberOfFrees(0)
|
||
|
{
|
||
|
|
||
|
}
|
||
|
|
||
|
MemoryManager::~MemoryManager()
|
||
|
{
|
||
|
for(gp* payload: freePayloads) {
|
||
|
delete payload;
|
||
|
numberOfFrees++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
gp*
|
||
|
MemoryManager::allocate()
|
||
|
{
|
||
|
if(freePayloads.empty()) {
|
||
|
numberOfAllocations++;
|
||
|
return new gp(this);
|
||
|
} else {
|
||
|
gp* result = freePayloads.back();
|
||
|
freePayloads.pop_back();
|
||
|
return result;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
void
|
||
|
MemoryManager::free(gp* payload)
|
||
|
{
|
||
|
payload->reset(); //clears all extensions
|
||
|
freePayloads.push_back(payload);
|
||
|
}
|