Lines Matching refs:time

171     std::vector<Tick> time(numPlanes, 0);
198 time[plane_address] += accessTimes(locationTable[logic_page_addr]
203 stats.readLatency.sample(time[plane_address]);
210 time[plane_address] += accessTimes
214 time[plane_address] += remap(logic_page_addr);
218 stats.writeLatency.sample(time[plane_address]);
243 plane_address = (time[plane_address] > time[count]) ? plane_address
247 time[count]);
249 if (time[count] != 0) {
254 * time to the occupation time; otherwise, plan it after the
259 cbe.time = time[count] + curTick();
261 cbe.time = time[count] +
262 planeEventQueue[count].back().time;
266 DPRINTF(FlashDevice, "scheduled at: %ld\n", cbe.time);
269 schedule(planeEvent, planeEventQueue[count].back().time);
270 else if (planeEventQueue[count].back().time < planeEvent.when())
272 planeEventQueue[plane_address].back().time, true);
276 //worst case two plane finish at the same time, each triggers an event
305 assert(planeEventQueue[plane_address].front().time >= curTick());
307 if (planeEventQueue[plane_address].front().time == curTick()) {
330 (planeEventQueue[plane_address].front().time <
331 planeEventQueue[next_event].front().time))
338 reschedule(planeEvent, planeEventQueue[next_event].front().time, true);
365 Tick time = accessTimes(locationTable[logic_page_addr].block,
368 DPRINTF(FlashDevice, "Remap returns %d ticks\n", time);
369 return time;
372 //calculate how much time GC would have taken
374 Tick time = ((GCActivePercentage *
395 time);
397 return time;
408 Tick time = 0;
413 time = readLatency;
418 time = writeLatency + readLatency;
423 time = eraseLatency + readLatency;
429 time = validpages * (readLatency + writeLatency);
436 DPRINTF(FlashDevice, "Access returns %d ticks\n", time);
437 return time;