Method run

libCacheSim/traceAnalyzer/analyzer.cpp:88–284

}

void traceAnalyzer::TraceAnalyzer::run() {
  if (has_run_) return;

  request_t *req = new_request();
  read_one_req(reader_, req);
  start_ts_ = req->clock_time;
  int32_t curr_time_window_idx = 0;
  int next_time_window_ts = time_window_;

  int64_t n = 0;
  /* going through the trace */
  do {
    DEBUG_ASSERT(req->obj_size != 0);

    // change real time to relative time
    req->clock_time -= start_ts_;

    while (req->clock_time >= next_time_window_ts) {
      curr_time_window_idx += 1;
      next_time_window_ts += time_window_;
    }

    if (curr_time_window_idx != time_to_window_idx(req->clock_time)) {
      ERROR(
          "The data is not ordered by time, please sort the trace first!"
          "Current time %ld requested object %lu, obj size %lu\n",
          (long)(req->clock_time + start_ts_), (unsigned long)req->obj_id,
          (long)req->obj_size);
    }

    DEBUG_ASSERT(curr_time_window_idx == time_to_window_idx(req->clock_time));

    n_req_ += 1;
    sum_obj_size_req += req->obj_size;

    auto it = obj_map_.find(req->obj_id);
    if (it == obj_map_.end()) {
      /* the first request to the object */
      req->compulsory_miss =
          true; /* whether the object is seen for the first time */
      req->overwrite = false;
      req->first_seen_in_window = true;
      req->create_rtime = (int32_t)req->clock_time;
      req->prev_size = -1;
      //      req->last_seen_window_idx = curr_time_window_idx;

      req->vtime_since_last_access = -1;
      req->rtime_since_last_access = -1;

      struct obj_info obj_info;
      obj_info.create_rtime = (int32_t)req->clock_time;
      obj_info.freq = 1;
      obj_info.obj_size = (obj_size_t)req->obj_size;
      obj_info.last_access_rtime = (int32_t)req->clock_time;
      obj_info.last_access_vtime = n_req_;

      obj_map_[req->obj_id] = obj_info;
      sum_obj_size_obj += req->obj_size;