Generalized-cache-Simulation/fully_associative_lru.cpp at master · damanBirSingh/Generalized-cache-Simulation · GitHub

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
#include "cache.hpp"

void add_block_to_fully_associative_cache(map<int, cache> &, list<int> &, int, int, int);
void replace_block_in_fully_associative_cache(map<int, cache> &, list<int> &, int, int, int);

void cache_impl::retrieve_value_from_fully_associative_cache_LRU(int address){
    int mem_tag, mem_block_offset, mem_line;
    //cout<<"address : "<<address<<" bits required : "<<log2(address)<<endl;
    //int tag_bits = ciel(log2(address)) - block_offset_bits;
    //cout<<"Block offset bits: "<<block_offset_bits<<" tag bits "<<tag_bits<<endl;
    mem_block_offset = (address) & (int)(pow(2,block_offset_bits) - 1);
    mem_tag = (address>>block_offset_bits);
    //mem_line = mem_tag%num_lines;

    //cout<<"Tag: "<<mem_tag<<endl;

    if( (fully_associative_cache.find(mem_tag) != fully_associative_cache.end()) ) {
        hit++;
        auto itr = fa_keys.begin();
        while (itr != fa_keys.end() ) {
            //cout << *itr << " ";
            if(*itr == mem_tag)
                break;
            itr++;
        }
        fa_keys.erase(itr);
        fa_keys.push_front(mem_tag);
        //push this block to the front
       // cout<<"Is a Hit\n";
    } else {
        //cout<<"Is a Miss\n";
        miss++;
        if(fully_associative_cache.size() == num_lines) //cache is full
            replace_block_in_fully_associative_cache(fully_associative_cache, fa_keys,  mem_tag, address, block_size);
        else{
            //cout<<"calling add\n";
            add_block_to_fully_associative_cache(fully_associative_cache, fa_keys,  mem_tag, address, block_size);
        }

    }

}

void add_block_to_fully_associative_cache(map<int, cache> &fully_associative_cache, list<int> &keys,  int tag, int address, int block_size){
    //cout<<"adding\n";
    //fflush(stdout);
;
    string data = decimal_to_hex_string(address);
    if(block_size == 2)
        data += " "+  decimal_to_hex_string(address + 4);
    fully_associative_cache[tag] = cache(1, tag, data);
    keys.push_front(tag);

}

void replace_block_in_fully_associative_cache(map<int, cache> &fully_associative_cache, list<int> &keys, int tag, int address, int block_size){
    //cout<<"replacing\n";
    int block_to_remove = keys.back();
    //cout<<"Tag to remove : "<<block_to_remove<<endl;
    keys.pop_back();
    fully_associative_cache.erase(block_to_remove);
    add_block_to_fully_associative_cache(fully_associative_cache, keys, tag, address, block_size);
}