aboutsummaryrefslogtreecommitdiff
path: root/qtmips_machine/physaddrspace.cpp
blob: bb01b604a6189002b4720533c77328303ceff59a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
// SPDX-License-Identifier: GPL-2.0+
/*******************************************************************************
 * QtMips - MIPS 32-bit Architecture Subset Simulator
 *
 * Implemented to support following courses:
 *
 *   B35APO - Computer Architectures
 *   https://cw.fel.cvut.cz/wiki/courses/b35apo
 *
 *   B4M35PAP - Advanced Computer Architectures
 *   https://cw.fel.cvut.cz/wiki/courses/b4m35pap/start
 *
 * Copyright (c) 2017-2019 Karel Koci<cynerd@email.cz>
 * Copyright (c) 2019      Pavel Pisa <pisa@cmp.felk.cvut.cz>
 *
 * Faculty of Electrical Engineering (http://www.fel.cvut.cz)
 * Czech Technical University        (http://www.cvut.cz/)
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA  02110-1301, USA.
 *
 ******************************************************************************/

#include "physaddrspace.h"

using namespace machine;

PhysAddrSpace::PhysAddrSpace() {

}

PhysAddrSpace::~PhysAddrSpace() {
    while (!ranges_by_access.isEmpty()) {
        RangeDesc *p_range = ranges_by_access.first();
        ranges_by_addr.remove(p_range->last_addr);
        ranges_by_access.remove(p_range->mem_acces);
        if (p_range->owned)
            delete p_range->mem_acces;
        delete p_range;
    }
}

bool PhysAddrSpace::wword(std::uint32_t address, std::uint32_t value) {
    RangeDesc *p_range = find_range(address);
    if (p_range == nullptr)
        return false;
    return p_range->mem_acces->write_word(address - p_range->start_addr, value);
}

std::uint32_t PhysAddrSpace::rword(std::uint32_t address) const {
    const RangeDesc *p_range = find_range(address);
    if (p_range == nullptr)
        return 0x00000000;
    return p_range->mem_acces->read_word(address - p_range->start_addr);
}

enum LocationStatus PhysAddrSpace::location_status(std::uint32_t address) const {
    const RangeDesc *p_range = find_range(address);
    if (p_range == nullptr)
        return LOCSTAT_ILLEGAL;
    return p_range->mem_acces->location_status(address - p_range->start_addr);
}

PhysAddrSpace::RangeDesc *PhysAddrSpace::find_range(std::uint32_t address) const {
    PhysAddrSpace::RangeDesc *p_range;
    auto i = ranges_by_addr.lowerBound(address);
    if (i == ranges_by_addr.end())
        return nullptr;
    p_range = i.value();
    if (address >= p_range->start_addr && address <= p_range->last_addr)
        return p_range;
    return nullptr;
}

bool PhysAddrSpace::insert_range(MemoryAccess *mem_acces, std::uint32_t start_addr, std::uint32_t last_addr, bool move_ownership) {
    RangeDesc *p_range = new RangeDesc(mem_acces, start_addr, last_addr, move_ownership);
    auto i = ranges_by_addr.lowerBound(start_addr);
    if (i != ranges_by_addr.end()) {
        if (i.value()->start_addr <= last_addr && i.value()->last_addr >= start_addr)
            return false;
    }
    ranges_by_addr.insert(last_addr, p_range);
    ranges_by_access.insert(mem_acces, p_range);
    return true;
}

bool PhysAddrSpace::remove_range(MemoryAccess *mem_acces) {
    RangeDesc *p_range = ranges_by_access.take(mem_acces);
    if (p_range == nullptr)
        return false;
    ranges_by_addr.remove(p_range->last_addr);
    if (p_range->owned)
        delete p_range->mem_acces;
    delete p_range;
    return true;
}

void PhysAddrSpace::clean_range(std::uint32_t start_addr, std::uint32_t last_addr) {
    auto i = ranges_by_addr.lowerBound(start_addr);
    while (i != ranges_by_addr.end()) {
        RangeDesc *p_range = i.value();
        i++;
        if (p_range->start_addr <= last_addr)
            remove_range(p_range->mem_acces);
        else
            break;
    }
}

PhysAddrSpace::RangeDesc::RangeDesc(MemoryAccess *mem_acces, std::uint32_t start_addr, std::uint32_t last_addr, bool owned) {
    this->mem_acces = mem_acces;
    this->start_addr = start_addr;
    this->last_addr = last_addr;
    this->owned = owned;
}