dd133c7b24
One big difference is that PrioHeap puts the smallest element at the top of the heap, whereas stl puts the largest element on top, so I changed all comparisons so they did the right thing. Some usage of PrioHeap was simply changed to a std::vector, using sort at the right time, other usage had me just use the various heap functions in the stl.
70 lines
2.4 KiB
C++
70 lines
2.4 KiB
C++
/*
|
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <algorithm>
|
|
|
|
#include "gzstream.hh"
|
|
|
|
#include "mem/ruby/eventqueue/RubyEventQueue.hh"
|
|
#include "mem/ruby/recorder/CacheRecorder.hh"
|
|
|
|
using namespace std;
|
|
|
|
void
|
|
CacheRecorder::addRecord(Sequencer* sequencer, const Address& data_addr,
|
|
const Address& pc_addr, RubyRequestType type, Time time)
|
|
{
|
|
TraceRecord rec(sequencer, data_addr, pc_addr, type, time);
|
|
m_records.push_back(rec);
|
|
}
|
|
|
|
int
|
|
CacheRecorder::dumpRecords(string filename)
|
|
{
|
|
ogzstream out(filename.c_str());
|
|
if (out.fail()) {
|
|
cout << "Error: error opening file '" << filename << "'" << endl;
|
|
return 0;
|
|
}
|
|
|
|
std::sort(m_records.begin(), m_records.end(), greater<TraceRecord>());
|
|
|
|
int size = m_records.size();
|
|
for (int i = 0; i < size; ++i)
|
|
m_records[i].output(out);
|
|
|
|
m_records.clear();
|
|
|
|
return size;
|
|
}
|
|
|
|
void
|
|
CacheRecorder::print(ostream& out) const
|
|
{
|
|
}
|