zenithsiz/ftmemsim-valgrind
1
0
Fork 0
mirror of https://github.com/Zenithsiz/ftmemsim-valgrind.git synced 2026-02-05 03:07:56 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
ftmemsim-valgrind/cachegrind/cg_sim_L2.c
Nicholas Nethercote 1818ed0e51 vg_symtab2.c: 
Discovered sometimes a SLINE stabs entry is the last one (which broke an
    assertion).  In such a case, we must guess the line's instruction address
    range -- I've guessed 4, arbitrarily.

vg_cachegen.in, vg_cachesim_{I1,D1,L2}.c:
    Discovered a bad bug in the cache simulation:  when determining if a
    references straddles two memory blocks, to find the end of the range I was
    adding 'size' to the base address, rather than 'size - 1'.  This was
    causing way too many straddled references, which would inflate the miss
    counts.

vg_cachesim.c:
    Minor stuff


git-svn-id: svn://svn.valgrind.org/valgrind/trunk@176
2002-04-30 13:44:01 +00:00

251 lines
8.1 KiB
C
Raw Blame History

/* L2 cache simulator, generated by vg_cachegen.
* total size = 262144 bytes
* line size = 64 bytes
* associativity = 8-way associative
*
* This file should be #include-d into vg_cachesim.c
*/
static char L2_desc_line[] =
"desc: L2 cache: 262144 B, 64 B, 8-way associative\n";
static UInt L2_tags[512][8];
static void cachesim_L2_initcache(void)
{
UInt set, way;
for (set = 0; set < 512; set++)
for (way = 0; way < 8; way++)
L2_tags[set][way] = 0;
}
static __inline__
void cachesim_L2_doref(Addr a, UChar size, ULong *m2)
{
register UInt set1 = ( a >> 6) & (512-1);
register UInt set2 = ((a + size - 1) >> 6) & (512-1);
register UInt tag = a >> (6 + 9);
if (set1 == set2) {
if (tag == L2_tags[set1][0]) {
return;
}
else if (tag == L2_tags[set1][1]) {
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
return;
}
else if (tag == L2_tags[set1][2]) {
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
return;
}
else if (tag == L2_tags[set1][3]) {
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
return;
}
else if (tag == L2_tags[set1][4]) {
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
return;
}
else if (tag == L2_tags[set1][5]) {
L2_tags[set1][5] = L2_tags[set1][4];
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
return;
}
else if (tag == L2_tags[set1][6]) {
L2_tags[set1][6] = L2_tags[set1][5];
L2_tags[set1][5] = L2_tags[set1][4];
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
return;
}
else if (tag == L2_tags[set1][7]) {
L2_tags[set1][7] = L2_tags[set1][6];
L2_tags[set1][6] = L2_tags[set1][5];
L2_tags[set1][5] = L2_tags[set1][4];
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
return;
}
else {
/* A miss */
L2_tags[set1][7] = L2_tags[set1][6];
L2_tags[set1][6] = L2_tags[set1][5];
L2_tags[set1][5] = L2_tags[set1][4];
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
(*m2)++;
}
} else if ((set1 + 1) % 512 == set2) {
Bool is_L2_miss = False;
/* Block one */
if (tag == L2_tags[set1][0]) {
}
else if (tag == L2_tags[set1][1]) {
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
}
else if (tag == L2_tags[set1][2]) {
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
}
else if (tag == L2_tags[set1][3]) {
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
}
else if (tag == L2_tags[set1][4]) {
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
}
else if (tag == L2_tags[set1][5]) {
L2_tags[set1][5] = L2_tags[set1][4];
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
}
else if (tag == L2_tags[set1][6]) {
L2_tags[set1][6] = L2_tags[set1][5];
L2_tags[set1][5] = L2_tags[set1][4];
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
}
else if (tag == L2_tags[set1][7]) {
L2_tags[set1][7] = L2_tags[set1][6];
L2_tags[set1][6] = L2_tags[set1][5];
L2_tags[set1][5] = L2_tags[set1][4];
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
}
else {
/* A miss */
L2_tags[set1][7] = L2_tags[set1][6];
L2_tags[set1][6] = L2_tags[set1][5];
L2_tags[set1][5] = L2_tags[set1][4];
L2_tags[set1][4] = L2_tags[set1][3];
L2_tags[set1][3] = L2_tags[set1][2];
L2_tags[set1][2] = L2_tags[set1][1];
L2_tags[set1][1] = L2_tags[set1][0];
L2_tags[set1][0] = tag;
is_L2_miss = True;
}
/* Block two */
if (tag == L2_tags[set2][0]) {
}
else if (tag == L2_tags[set2][1]) {
L2_tags[set2][1] = L2_tags[set2][0];
L2_tags[set2][0] = tag;
}
else if (tag == L2_tags[set2][2]) {
L2_tags[set2][2] = L2_tags[set2][1];
L2_tags[set2][1] = L2_tags[set2][0];
L2_tags[set2][0] = tag;
}
else if (tag == L2_tags[set2][3]) {
L2_tags[set2][3] = L2_tags[set2][2];
L2_tags[set2][2] = L2_tags[set2][1];
L2_tags[set2][1] = L2_tags[set2][0];
L2_tags[set2][0] = tag;
}
else if (tag == L2_tags[set2][4]) {
L2_tags[set2][4] = L2_tags[set2][3];
L2_tags[set2][3] = L2_tags[set2][2];
L2_tags[set2][2] = L2_tags[set2][1];
L2_tags[set2][1] = L2_tags[set2][0];
L2_tags[set2][0] = tag;
}
else if (tag == L2_tags[set2][5]) {
L2_tags[set2][5] = L2_tags[set2][4];
L2_tags[set2][4] = L2_tags[set2][3];
L2_tags[set2][3] = L2_tags[set2][2];
L2_tags[set2][2] = L2_tags[set2][1];
L2_tags[set2][1] = L2_tags[set2][0];
L2_tags[set2][0] = tag;
}
else if (tag == L2_tags[set2][6]) {
L2_tags[set2][6] = L2_tags[set2][5];
L2_tags[set2][5] = L2_tags[set2][4];
L2_tags[set2][4] = L2_tags[set2][3];
L2_tags[set2][3] = L2_tags[set2][2];
L2_tags[set2][2] = L2_tags[set2][1];
L2_tags[set2][1] = L2_tags[set2][0];
L2_tags[set2][0] = tag;
}
else if (tag == L2_tags[set2][7]) {
L2_tags[set2][7] = L2_tags[set2][6];
L2_tags[set2][6] = L2_tags[set2][5];
L2_tags[set2][5] = L2_tags[set2][4];
L2_tags[set2][4] = L2_tags[set2][3];
L2_tags[set2][3] = L2_tags[set2][2];
L2_tags[set2][2] = L2_tags[set2][1];
L2_tags[set2][1] = L2_tags[set2][0];
L2_tags[set2][0] = tag;
}
else {
/* A miss */
L2_tags[set2][7] = L2_tags[set2][6];
L2_tags[set2][6] = L2_tags[set2][5];
L2_tags[set2][5] = L2_tags[set2][4];
L2_tags[set2][4] = L2_tags[set2][3];
L2_tags[set2][3] = L2_tags[set2][2];
L2_tags[set2][2] = L2_tags[set2][1];
L2_tags[set2][1] = L2_tags[set2][0];
L2_tags[set2][0] = tag;
is_L2_miss = True;
}
/* Miss treatment */
if (is_L2_miss) {
(*m2)++;
}
} else {
VG_(printf)("\nERROR: Data item 0x%x of size %u bytes is in two non-adjacent\n", a, size);
VG_(printf)("sets %d and %d.\n", set1, set2);
VG_(panic)("L2 cache set mismatch");
}
}
Reference in New Issue View Git Blame Copy Permalink