CalcInfo.cpp

#include "base.h"

using namespace std;


void CalcInfo()
{
    assert(i_cache_line_size != 0);
    i_num_line = (i_cache_size<<10)/i_cache_line_size;
    temp = i_cache_line_size; //计算块内地址位数

    while(temp)
    {
        temp >>= 1;
        bit_block++;
    }

    bit_block--; //warning

    if(t_assoc == direct_mapped)
    {
        bit_set = 0; // for direct_mapped,the bit_set is 0
        temp = i_num_line;

        while(temp)
        {
            temp >>= 1;
            bit_line++;
        }

        bit_line--; //warning
    }
    else if(t_assoc == full_associative)
    {
        bit_line = 0; // for full_associative,the bit_line is 0
        bit_set = 0; // for full_associative,the bit_set is 0
    }
    else if(t_assoc == set_associative)
    {
        bit_line = 0; // for set_associative,the bit_line is 0
        assert(i_cache_set != 0);
        assert(i_num_line > i_cache_set);
        i_num_set = i_num_line/i_cache_set;
        temp = i_num_set;

        while(temp)
        {
            temp >>= 1;
            bit_set++;
        }

        bit_set--;
    }

    bit_tag = 32ul - bit_block - bit_line - bit_set;
    assert(bit_tag <= 29); //32-valid-hit-dirty
    cout << "i_cache_line_size: " << i_cache_line_size << "B" << endl; // 显示块大小
    cout << "i_cache_size: " << i_cache_size << "KB" << endl; // 显示cache数据区总容量

    if(t_assoc == set_associative) // 如果为组相联，显示是几路组相联
    {
        cout << "i_cache_set: " << i_cache_set << " lines each set" << endl;
    }

    cout << "i_num_line: " << i_num_line << endl; // 显示共有多少行

    if(t_assoc == set_associative) // 如果为组相联，显示共有几组
    {
        cout << "i_num_set: " << i_num_set << endl;
    }

    cout << "bit_block: " << bit_block << endl; // 显示块内地址所需位数

    if(t_assoc == direct_mapped) // 如果为直接映射，显示行号所需位数
    {
        cout << "bit_line: " << bit_line << endl;
    }

    if(t_assoc == set_associative) // 如果为组相联，显示组号所需位数
    {
        cout << "bit_set: " << bit_set << endl;
    }

    cout << "bit_tag: " << bit_tag << endl; // 显示标志位所需位数
}