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
|
#include "sim.h"
#include "htif.h"
#include <sys/mman.h>
#include <map>
#include <iostream>
#include <climits>
#include <assert.h>
#ifdef __linux__
# define mmap mmap64
#endif
sim_t::sim_t(int _nprocs, htif_t* _htif)
: htif(_htif),
procs(_nprocs),
running(false)
{
// allocate target machine's memory, shrinking it as necessary
// until the allocation succeeds
size_t memsz0 = sizeof(size_t) == 8 ? 0x100000000ULL : 0x70000000UL;
size_t quantum = std::max(PGSIZE, (reg_t)sysconf(_SC_PAGESIZE));
memsz0 = memsz0/quantum*quantum;
memsz = memsz0;
mem = (char*)mmap(NULL, memsz, PROT_WRITE, MAP_PRIVATE|MAP_ANON, -1, 0);
if(mem == MAP_FAILED)
{
while(mem == MAP_FAILED && (memsz = memsz*10/11/quantum*quantum))
mem = (char*)mmap(NULL, memsz, PROT_WRITE, MAP_PRIVATE|MAP_ANON, -1, 0);
assert(mem != MAP_FAILED);
fprintf(stderr, "warning: only got %lu bytes of target mem (wanted %lu)\n",
(unsigned long)memsz, (unsigned long)memsz0);
}
mmu = new mmu_t(mem, memsz);
for(size_t i = 0; i < num_cores(); i++)
procs[i] = new processor_t(this, new mmu_t(mem, memsz), i);
htif->init(this);
}
sim_t::~sim_t()
{
for(size_t i = 0; i < num_cores(); i++)
{
mmu_t* pmmu = &procs[i]->mmu;
delete procs[i];
delete pmmu;
}
delete mmu;
munmap(mem, memsz);
}
void sim_t::set_tohost(reg_t val)
{
fromhost = 0;
tohost = val;
htif->wait_for_tohost_write();
}
reg_t sim_t::get_fromhost()
{
htif->wait_for_fromhost_write();
return fromhost;
}
void sim_t::send_ipi(reg_t who)
{
if(who < num_cores())
procs[who]->deliver_ipi();
}
void sim_t::run(bool debug)
{
htif->wait_for_start();
// start core 0
send_ipi(0);
for(running = true; running; )
{
if(!debug)
step_all(100,100,false);
else
interactive();
}
}
void sim_t::step_all(size_t n, size_t interleave, bool noisy)
{
for(size_t j = 0; j < n; j+=interleave)
for(int i = 0; i < (int)num_cores(); i++)
procs[i]->step(interleave,noisy);
}
|
