queue.hh (12823:ba630bc7a36d) | queue.hh (13449:2f7efa89c58b) |
---|---|
1/* 2 * Copyright (c) 2012-2013, 2015-2016, 2018 ARM Limited 3 * All rights reserved. 4 * 5 * The license below extends only to copyright in the software and shall 6 * not be construed as granting a license to any other intellectual 7 * property including but not limited to intellectual property relating 8 * to a hardware implementation of the functionality of the software --- 38 unchanged lines hidden (view full) --- 47 */ 48 49#ifndef __MEM_CACHE_QUEUE_HH__ 50#define __MEM_CACHE_QUEUE_HH__ 51 52#include <cassert> 53#include <string> 54 | 1/* 2 * Copyright (c) 2012-2013, 2015-2016, 2018 ARM Limited 3 * All rights reserved. 4 * 5 * The license below extends only to copyright in the software and shall 6 * not be construed as granting a license to any other intellectual 7 * property including but not limited to intellectual property relating 8 * to a hardware implementation of the functionality of the software --- 38 unchanged lines hidden (view full) --- 47 */ 48 49#ifndef __MEM_CACHE_QUEUE_HH__ 50#define __MEM_CACHE_QUEUE_HH__ 51 52#include <cassert> 53#include <string> 54 |
55#include "base/logging.hh" |
|
55#include "base/trace.hh" 56#include "base/types.hh" 57#include "debug/Drain.hh" 58#include "mem/cache/queue_entry.hh" 59#include "mem/packet.hh" 60#include "sim/core.hh" 61#include "sim/drain.hh" 62 --- 40 unchanged lines hidden (view full) --- 103 return readyList.insert(readyList.end(), entry); 104 } 105 106 for (auto i = readyList.begin(); i != readyList.end(); ++i) { 107 if ((*i)->readyTime > entry->readyTime) { 108 return readyList.insert(i, entry); 109 } 110 } | 56#include "base/trace.hh" 57#include "base/types.hh" 58#include "debug/Drain.hh" 59#include "mem/cache/queue_entry.hh" 60#include "mem/packet.hh" 61#include "sim/core.hh" 62#include "sim/drain.hh" 63 --- 40 unchanged lines hidden (view full) --- 104 return readyList.insert(readyList.end(), entry); 105 } 106 107 for (auto i = readyList.begin(); i != readyList.end(); ++i) { 108 if ((*i)->readyTime > entry->readyTime) { 109 return readyList.insert(i, entry); 110 } 111 } |
111 assert(false); 112 return readyList.end(); // keep stupid compilers happy | 112 panic("Failed to add to ready list."); |
113 } 114 115 /** The number of entries that are in service. */ 116 int _numInService; 117 118 /** The number of currently allocated entries. */ 119 int allocated; 120 --- 138 unchanged lines hidden --- | 113 } 114 115 /** The number of entries that are in service. */ 116 int _numInService; 117 118 /** The number of currently allocated entries. */ 119 int allocated; 120 --- 138 unchanged lines hidden --- |