cache_helper.c File Reference

Include dependency graph for cache_helper.c:

Go to the source code of this file.

Data Structures
struct	cache_info_t

Functions
static int	check_if_cache_info_available (void)
long long	get_cachesize (int type)
long long	get_entries (int type)
long long	get_linesize (int type)

Variables
const PAPI_hw_info_t *	hw_info =NULL
static struct cache_info_t	cache_info [MAX_CACHE]

Function Documentation

check_if_cache_info_available()

static int check_if_cache_info_available ( void  )

static

Definition at line 21 of file cache_helper.c.

                                               {
 
    int cache_type,level,j;
 
    /* Get PAPI Hardware Info */
    hw_info=PAPI_get_hardware_info();
    if (hw_info==NULL) {
        return -1;
    }
 
    /* Iterate down the levels (L1, L2, L3) */
    for(level=0;level<hw_info->mem_hierarchy.levels;level++) {
        for(j=0;j<2;j++) {
            cache_type=PAPI_MH_CACHE_TYPE(
                hw_info->mem_hierarchy.level[level].cache[j].type);
            if (cache_type==PAPI_MH_TYPE_EMPTY) continue;
 
            if (level==0) {
                if (cache_type==PAPI_MH_TYPE_DATA) {
                    cache_info[L1D_CACHE].size=hw_info->mem_hierarchy.level[level].cache[j].size;
                    cache_info[L1D_CACHE].linesize=hw_info->mem_hierarchy.level[level].cache[j].line_size;
                    cache_info[L1D_CACHE].ways=hw_info->mem_hierarchy.level[level].cache[j].associativity;
                    cache_info[L1D_CACHE].entries=cache_info[L1D_CACHE].size/cache_info[L1D_CACHE].linesize;
                    cache_info[L1D_CACHE].wpolicy=PAPI_MH_CACHE_WRITE_POLICY(hw_info->mem_hierarchy.level[level].cache[j].type);
                    cache_info[L1D_CACHE].replace=PAPI_MH_CACHE_REPLACEMENT_POLICY(hw_info->mem_hierarchy.level[level].cache[j].type);
                }
                else if (cache_type==PAPI_MH_TYPE_INST) {
                    cache_info[L1I_CACHE].size=hw_info->mem_hierarchy.level[level].cache[j].size;
                    cache_info[L1I_CACHE].linesize=hw_info->mem_hierarchy.level[level].cache[j].line_size;
                    cache_info[L1I_CACHE].ways=hw_info->mem_hierarchy.level[level].cache[j].associativity;
                    cache_info[L1I_CACHE].entries=cache_info[L1I_CACHE].size/cache_info[L1I_CACHE].linesize;
                    cache_info[L1I_CACHE].wpolicy=PAPI_MH_CACHE_WRITE_POLICY(hw_info->mem_hierarchy.level[level].cache[j].type);
                    cache_info[L1I_CACHE].replace=PAPI_MH_CACHE_REPLACEMENT_POLICY(hw_info->mem_hierarchy.level[level].cache[j].type);
                }
            }
            else if (level==1) {
                cache_info[L2_CACHE].size=hw_info->mem_hierarchy.level[level].cache[j].size;
                cache_info[L2_CACHE].linesize=hw_info->mem_hierarchy.level[level].cache[j].line_size;
                cache_info[L2_CACHE].ways=hw_info->mem_hierarchy.level[level].cache[j].associativity;
                cache_info[L2_CACHE].entries=cache_info[L2_CACHE].size/cache_info[L2_CACHE].linesize;
                cache_info[L2_CACHE].wpolicy=PAPI_MH_CACHE_WRITE_POLICY(hw_info->mem_hierarchy.level[level].cache[j].type);
                cache_info[L2_CACHE].replace=PAPI_MH_CACHE_REPLACEMENT_POLICY(hw_info->mem_hierarchy.level[level].cache[j].type);
            }
            else if (level==2) {
                cache_info[L3_CACHE].size=hw_info->mem_hierarchy.level[level].cache[j].size;
                cache_info[L3_CACHE].linesize=hw_info->mem_hierarchy.level[level].cache[j].line_size;
                cache_info[L3_CACHE].ways=hw_info->mem_hierarchy.level[level].cache[j].associativity;
                cache_info[L3_CACHE].entries=cache_info[L3_CACHE].size/cache_info[L3_CACHE].linesize;
                cache_info[L3_CACHE].wpolicy=PAPI_MH_CACHE_WRITE_POLICY(hw_info->mem_hierarchy.level[level].cache[j].type);
                cache_info[L3_CACHE].replace=PAPI_MH_CACHE_REPLACEMENT_POLICY(hw_info->mem_hierarchy.level[level].cache[j].type);
            }
 
        }
    }
    return 0;
}

Here is the caller graph for this function:

get_cachesize()

long long get_cachesize

(

int

type

)

Definition at line 78 of file cache_helper.c.

                                  {
 
    int result;
 
    result=check_if_cache_info_available();
    if (result<0) return result;
 
    if (type>=MAX_CACHE) {
        printf("Errror!\n");
        return -1;
    }
 
    return cache_info[type].size;
}

Here is the call graph for this function:

Here is the caller graph for this function:

get_entries()

long long get_entries

(

int

type

)

Definition at line 94 of file cache_helper.c.

                                {
 
    int result;
 
    result=check_if_cache_info_available();
    if (result<0) return result;
 
    if (type>=MAX_CACHE) {
        printf("Errror!\n");
        return -1;
    }
 
    return cache_info[type].entries;
}

Here is the call graph for this function:

Here is the caller graph for this function:

get_linesize()

long long get_linesize

(

int

type

)

Definition at line 110 of file cache_helper.c.

                                 {
 
    int result;
 
    result=check_if_cache_info_available();
    if (result<0) return result;
 
    if (type>=MAX_CACHE) {
        printf("Errror!\n");
        return -1;
    }
 
    return cache_info[type].linesize;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

cache_info

struct cache_info_t cache_info[MAX_CACHE]

static

Definition at line 19 of file cache_helper.c.

hw_info

const PAPI_hw_info_t* hw_info =NULL

Definition at line 8 of file cache_helper.c.