"I am a person who works hard and plays hard."

---

Yuan Wei
Second Year Graduate Student Department of Computer Science
University of Virginia Charlottesville, VA 22903
Email: yw3f@cs.virginia.edu

---

Source Code Analysis
         

---

faclru.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include "../host.h"
#include "../misc.h"
#include "../machine.h"
#include "util.h"
#include "libcheetah.h"

Include dependency graph for faclru.c:

Go to the source code of this file.

Defines

• #define toggle(i)   if(i==1)i=0;else{i=1;}
• #define min(a, b)   ((a<b) ? a : b)
• #define ONE   1
• #define HASHNO   7211
• #define INPUT_BUFFER_SIZE   1000
• #define MAX_PHYSICAL_MEM   2097152
• #define BYTES_PER_LINE   35

Functions

• void outpr_faclru (FILE *fd)
• tree_node * delete_node (void)
• unsigned hash_lookup_add (md_addr_t addr)
• void hash_del (md_addr_t addr)
• void ref_tree (unsigned i_inum, md_addr_t addr)
• void init_faclru (void)
• void ptc (md_addr_t addr)

Variables

• hash_table slot [HASHNO]
• tree_node * root
• tree_node ** p_stack
• unsigned * out_stack
• unsigned tot_addrs
• unsigned t_entries
• short size_exceeded = 0
• int L
• int T
• unsigned MAX_CACHE_SIZE
• unsigned MAX_LINES
• int MISS_RATIO_INTERVAL
• int SAVE_INTERVAL
• int P_INTERVAL
• FILE * reportfile
• unsigned long next_save_time

---

Define Documentation

#define BYTES_PER_LINE   35

Definition at line 36 of file faclru.c.

#define HASHNO   7211

Definition at line 33 of file faclru.c.

#define INPUT_BUFFER_SIZE   1000

Definition at line 34 of file faclru.c. Referenced by init_faclru().

#define MAX_PHYSICAL_MEM   2097152

Definition at line 35 of file faclru.c.

#define min (  a, b    )     ((a<b) ? a : b)

Definition at line 30 of file faclru.c. Referenced by outpr_faclru(), and outpr_facopt().

#define ONE   1

Definition at line 32 of file faclru.c. Referenced by outpr_faclru().

#define toggle (  i    )     if(i==1)i=0;else{i=1;}

Definition at line 29 of file faclru.c. Referenced by Insert(), optpp(), ptc(), stack_proc_fa(), and term_optpp().

---

Function Documentation

struct tree_node* delete_node (  void    )

Definition at line 111 of file faclru.c. References fatal(), tree_node::inum, tree_node::lft, MAX_LINES, and tree_node::rt. Referenced by ptc(). { struct tree_node *ptr, *free_ptr; static struct tree_node **delete_stack; static int top; static short first_time=1; static unsigned last_inum; if (first_time || top < 5 || delete_stack[top]->inum != last_inum || delete_stack[top-1]->lft != delete_stack[top]) { if (first_time) { first_time = 0; delete_stack = calloc(MAX_LINES, sizeof (struct tree_node *)); if (!delete_stack) fatal("out of virtual memory"); } top = -1; ptr = root; while (ptr->lft != NULL) { ++top; delete_stack [top] = ptr; ptr = ptr->lft; } delete_stack[top]->lft = ptr->rt; free_ptr = ptr; ptr = delete_stack[top]->lft; while (ptr) { ++top; delete_stack [top] = ptr; ptr = ptr->lft; } last_inum = delete_stack[top]->inum; } else { if (delete_stack[top]->lft != NULL) fprintf(stderr, "libcheetah: lft ptr of last entry not NULL\n"); free_ptr = delete_stack[top]; delete_stack[top-1]->lft = delete_stack[top]->rt; --top; ptr = delete_stack[top]->lft; while (ptr) { ++top; delete_stack [top] = ptr; ptr = ptr->lft; } last_inum = delete_stack[top]->inum; } return free_ptr; }

void hash_del (  md_addr_t    addr )

Definition at line 240 of file faclru.c. References hash_table::addr, hash_table::inum, and hash_table::nxt. Referenced by ptc(). { int loc; /* Scratch variables */ struct hash_table *ptr, *oldptr; loc = addr % HASHNO; if (slot[loc].inum == 0) { fprintf(stderr, "libcheetah: addr not found in hash_table\n"); } else if (slot[loc].addr == addr) { if (slot[loc].nxt == NULL) slot[loc].inum = 0; else { slot[loc].addr = slot[loc].nxt->addr; slot[loc].inum = slot[loc].nxt->inum; ptr = slot[loc].nxt; slot[loc].nxt = slot[loc].nxt->nxt; free(ptr); } } else { ptr = &slot[loc]; while (ptr) { if (ptr->addr == addr) break; oldptr = ptr; ptr = ptr->nxt; } if (ptr) { oldptr->nxt = ptr->nxt; free (ptr); } else fprintf (stderr, "libcheetah: addr not found in hash_table\n"); } }

unsigned hash_lookup_add (  md_addr_t    addr )

Definition at line 184 of file faclru.c. References hash_table::addr, fatal(), hash_table::inum, hash_table::nxt, t_entries, and tot_addrs. Referenced by init_faclru(), and ptc(). { int old_inum; /* Scratch variables */ int loc; struct hash_table *ptr, *oldptr; loc = addr % HASHNO; if (slot[loc].inum == 0) { ++tot_addrs; slot[loc].addr = addr; slot[loc].inum = t_entries; slot[loc].nxt = NULL; return 0; } else { ptr = &slot[loc]; while (ptr) { oldptr = ptr; if (ptr->addr == addr) break; ptr = ptr->nxt; } if (ptr) { old_inum = ptr->inum; ptr->inum = t_entries; return old_inum; } else { ++tot_addrs; oldptr->nxt = calloc(1, sizeof(struct hash_table)); if (!oldptr->nxt) fatal("out of virtual memory"); oldptr->nxt->addr = addr; oldptr->nxt->nxt = NULL; oldptr->nxt->inum = t_entries; return 0; } } }

void init_faclru (  void    )

Definition at line 399 of file faclru.c. References tree_node::addr, fatal(), hash_lookup_add(), INPUT_BUFFER_SIZE, tree_node::inum, tree_node::lft, MAX_LINES, next_save_time, out_stack, tree_node::rt, tree_node::rtwt, SAVE_INTERVAL, t_entries, and tot_addrs. Referenced by cheetah_init(). { unsigned addr; next_save_time = SAVE_INTERVAL; /* Stack is not cut off precisely at MAX_LINES */ out_stack = calloc((MAX_LINES+INPUT_BUFFER_SIZE), sizeof (unsigned)); if (!out_stack) fatal("out of virtual memory"); p_stack = calloc(MAX_LINES, sizeof (struct tree_node *)); if (!p_stack) fatal("out of virtual memory"); addr = 1; /* Assumes that the first address is 1. */ ++t_entries; /* Kludge to avoid a warning in hash_del */ hash_lookup_add(addr); t_entries = 0; tot_addrs = 0;/* Resets tot_addrs which is incremented in hash_lookup_add */ root = calloc(1, sizeof(struct tree_node)); if (!root) fatal("out of virtual memory"); root->inum = t_entries; root->addr = addr; root->rtwt = 0; root->lft = root->rt = NULL; }

void outpr_faclru (  FILE *    fd )

Definition at line 73 of file faclru.c. References L, MAX_LINES, min, MISS_RATIO_INTERVAL, ONE, out_stack, t_entries, and tot_addrs. Referenced by cheetah_stats(), and ptc(). { int i; int stack_end; unsigned sum = 0; fprintf(fd, "Addresses processed : %d\n", t_entries); fprintf(fd, "Line size : %d bytes \n", (ONE << L)); fprintf(fd, "Number of distinct lines %d\n", tot_addrs); #ifdef PERF fprintf(fd, "Number of Comparisons %lf\n", comp); fprintf(fd, "Number of balance steps %lf\n", no_splay_steps); #endif fprintf(fd, "Cache size (bytes)\tMiss Ratio\n"); stack_end = min (tot_addrs, MAX_LINES); for (i = 1; i <= stack_end; i++) { sum += out_stack[i]; if ((i % MISS_RATIO_INTERVAL) == 0) fprintf(fd, "%d\t\t\t%1.6f\n", (i * (ONE << L)), (1.0 - ((double)sum/(double)t_entries))); } if ((unsigned)stack_end == tot_addrs) fprintf(fd, "Miss ratio is %f for all bigger caches\n", (1.0 - ((double)sum/(double)t_entries))); fprintf(fd, "\n"); }

void ptc (  md_addr_t    addr )

Definition at line 441 of file faclru.c. References tree_node::addr, delete_node(), fatal(), hash_del(), hash_lookup_add(), tree_node::inum, L, tree_node::lft, MAX_LINES, next_save_time, outpr_faclru(), P_INTERVAL, ref_tree(), tree_node::rt, tree_node::rtwt, SAVE_INTERVAL, size_exceeded, t_entries, toggle, and tot_addrs. Referenced by cheetah_access(). { unsigned i_inum; /* Key lookup */ struct tree_node *nnode; /* New tree node */ if (tot_addrs > MAX_LINES) { if (size_exceeded == 0) { toggle (size_exceeded); fprintf(stderr, "libcheetah: distinct entries limit exceeded\n"); fprintf(stderr, "libcheetah: addresses processed %d\n", t_entries); } } if (t_entries > next_save_time) { outpr_faclru(stderr); next_save_time += SAVE_INTERVAL; } ++t_entries; if ((t_entries % P_INTERVAL) == 0) fprintf(stderr, "libcheetah: addresses processed %d\n", t_entries); addr >>= L; if (size_exceeded == 0) { if ((i_inum = hash_lookup_add(addr)) != 0) ref_tree(i_inum, addr); else { nnode = calloc(1, sizeof(struct tree_node)); if (!nnode) fatal("out of virtual memory"); nnode->inum = t_entries; nnode->addr = addr; nnode->lft = root; nnode->rt = NULL; nnode->rtwt = 0; root = nnode; } } else { if ((i_inum = hash_lookup_add(addr)) != 0) ref_tree(i_inum, addr); else { nnode = delete_node(); hash_del(nnode->addr); nnode->inum = t_entries; nnode->addr = addr; nnode->lft = root; nnode->rt = NULL; nnode->rtwt = 0; root = nnode; } } }

void ref_tree (  unsigned    i_inum, md_addr_t    addr )

Definition at line 294 of file faclru.c. References tree_node::addr, tree_node::inum, tree_node::lft, out_stack, tree_node::rt, tree_node::rtwt, splay(), and t_entries. Referenced by ptc(). { struct tree_node *ptr; int top, addr_above, pos, lstlft, at; #ifdef PERF comp += 1.0; #endif if (root->inum == i_inum) { ++out_stack[1]; root->inum = t_entries; } else { top = addr_above = lstlft = 0; ptr = root; while (ptr) { #ifdef PERF comp += 1.0; #endif ++top; p_stack[top] = ptr; if (ptr->inum > i_inum) { addr_above += ptr->rtwt + 1; lstlft = top; ptr = ptr->lft; } else { if (ptr->inum == i_inum) { addr_above += ptr->rtwt; ++out_stack[addr_above + 1]; pos = top; if (ptr->addr != addr) fprintf(stderr, "libcheetah: inconsistency w/ inum & addr'\n"); ptr->rtwt -= 1; ptr = ptr->rt; while (ptr) { ++top; p_stack[top] = ptr; ptr = ptr->lft; } break; } ptr->rtwt -= 1; ptr = ptr->rt; } } if (pos == top) { if (p_stack[top-1]->lft == p_stack[top]) p_stack[top-1]->lft = p_stack[top]->lft; else p_stack[top-1]->rt = p_stack[top]->lft; at = lstlft; } else { if (p_stack[top-1]->lft == p_stack[top]) p_stack[top-1]->lft = p_stack[top]->rt; else p_stack[top-1]->rt = p_stack[top]->rt; p_stack[pos]->addr = p_stack[top]->addr; p_stack[pos]->inum = p_stack[top]->inum; at = top-1; } while (at > 1) { #ifdef PERF no_splay_steps += 1.0; /* Counts the number of basic operations */ #endif splay(at, p_stack); at = at - 2; } root = p_stack[1]; p_stack[top]->lft = root; p_stack[top]->rt = NULL; p_stack[top]->inum = t_entries; p_stack[top]->addr = addr; p_stack[top]->rtwt = 0; root = p_stack[top]; /* traverse(root); */ } }

---

Variable Documentation

int L

Definition at line 52 of file faclru.c. Referenced by outpr_faclru(), and ptc().

unsigned MAX_CACHE_SIZE

Definition at line 54 of file faclru.c.

unsigned MAX_LINES

Definition at line 55 of file faclru.c. Referenced by delete_node(), init_faclru(), outpr_faclru(), and ptc().

int MISS_RATIO_INTERVAL

Definition at line 56 of file faclru.c. Referenced by outpr_faclru().

unsigned long next_save_time [static]

Definition at line 62 of file faclru.c. Referenced by init_faclru(), and ptc().

unsigned* out_stack [static]

Definition at line 42 of file faclru.c. Referenced by init_faclru(), outpr_faclru(), and ref_tree().

int P_INTERVAL

Definition at line 56 of file faclru.c. Referenced by ptc().

struct tree_node** p_stack [static]

Definition at line 40 of file faclru.c.

FILE* reportfile

Definition at line 60 of file faclru.c.

struct tree_node* root [static]

Definition at line 39 of file faclru.c.

int SAVE_INTERVAL

Definition at line 56 of file faclru.c. Referenced by init_faclru(), and ptc().

short size_exceeded = 0 [static]

Definition at line 49 of file faclru.c. Referenced by ptc().

struct hash_table slot[HASHNO] [static]

Definition at line 38 of file faclru.c.

int T

Definition at line 52 of file faclru.c.

unsigned t_entries [static]

Definition at line 47 of file faclru.c. Referenced by hash_lookup_add(), init_faclru(), outpr_faclru(), ptc(), and ref_tree().

unsigned tot_addrs [static]

Definition at line 47 of file faclru.c. Referenced by hash_lookup_add(), init_faclru(), outpr_faclru(), and ptc().

	Department of Computer Science School of Engineering, University of Virginia 151 Engineer's Way, P.O. Box 400740 Charlottesville, Virginia 22904-4740 (434) 982-2200  Fax: (434) 982-2214