misc: Reorder sources in util/tlm and rewrite build scripts
[gem5.git] / util / tlm / src / sc_mm.cc
1 /*
2 * Copyright (c) 2015, University of Kaiserslautern
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met:
8 *
9 * 1. Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * 3. Neither the name of the copyright holder nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER
24 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
25 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
26 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
27 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
28 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
29 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
30 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 *
32 * Authors:
33 * Robert Gernhardt
34 * Matthias Jung
35 */
36
37 #include <iostream>
38
39 #include "sc_mm.hh"
40
41 using namespace std;
42
43 namespace Gem5SystemC
44 {
45
46 MemoryManager::MemoryManager(): numberOfAllocations(0), numberOfFrees(0)
47 {
48
49 }
50
51 MemoryManager::~MemoryManager()
52 {
53 for (gp* payload: freePayloads) {
54 delete payload;
55 numberOfFrees++;
56 }
57 }
58
59 gp*
60 MemoryManager::allocate()
61 {
62 if (freePayloads.empty()) {
63 numberOfAllocations++;
64 return new gp(this);
65 } else {
66 gp* result = freePayloads.back();
67 freePayloads.pop_back();
68 return result;
69 }
70 }
71
72 void
73 MemoryManager::free(gp* payload)
74 {
75 payload->reset(); //clears all extensions
76 freePayloads.push_back(payload);
77 }
78
79 }