mcpat/cacti/Ucache.cc

68 void min_values_t::update_min_values(const uca_org_t & res) {
69     min_delay   = (min_delay > res.access_time) ? res.access_time : min_delay;
70     min_dyn     = (min_dyn > res.power.readOp.dynamic) ? res.power.readOp.dynamic : min_dyn;
71     min_leakage = (min_leakage > res.power.readOp.leakage) ? res.power.readOp.leakage : min_leakage;
72     min_area    = (min_area > res.area) ? res.area : min_area;
73     min_cyc     = (min_cyc > res.cycle_time) ? res.cycle_time : min_cyc;
76 void min_values_t::update_min_values(const nuca_org_t * res) {
77     min_delay   = (min_delay > res->nuca_pda.delay) ? res->nuca_pda.delay : min_delay;
78     min_dyn     = (min_dyn > res->nuca_pda.power.readOp.dynamic) ? res->nuca_pda.power.readOp.dynamic : min_dyn;
79     min_leakage = (min_leakage > res->nuca_pda.power.readOp.leakage) ? res->nuca_pda.power.readOp.leakage : min_leakage;
80     min_area    = (min_area > res->nuca_pda.area.get_area()) ? res->nuca_pda.area.get_area() : min_area;
81     min_cyc     = (min_cyc > res->nuca_pda.cycle_time) ? res->nuca_pda.cycle_time : min_cyc;
84 void min_values_t::update_min_values(const mem_array * res) {
85     min_delay   = (min_delay > res->access_time) ? res->access_time : min_delay;
86     min_dyn     = (min_dyn > res->power.readOp.dynamic) ? res->power.readOp.dynamic : min_dyn;
87     min_leakage = (min_leakage > res->power.readOp.leakage) ? res->power.readOp.leakage : min_leakage;
88     min_area    = (min_area > res->area) ? res->area : min_area;
89     min_cyc     = (min_cyc > res->cycle_time) ? res->cycle_time : min_cyc;
530 void find_optimal_uca(uca_org_t *res, min_values_t * minval,
554                 *res = (*(niter));
562                 *res = (*(niter));
581                     *res = (*(niter));
611     mem_array * res = NULL;
633             if (res != NULL) {
634                 delete res;
637             res  = list.back();
643     if (!res) {
648     list.push_back(res);