f8f8b7e5c2
At several places, there are functions that take a cycle value as input and performs some computation. Along with each such function, another function was being defined that simply added one more cycle to input and computed the same function. This patch removes this second copy of the function. Places where these functions were being called have been updated to use the original function with argument being current cycle + 1.
91 lines
2.8 KiB
C++
91 lines
2.8 KiB
C++
/*
|
|
* Copyright (c) 2008 Princeton University
|
|
* 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.
|
|
*
|
|
* Authors: Niket Agarwal
|
|
*/
|
|
|
|
#ifndef __MEM_RUBY_NETWORK_GARNET_FIXED_PIPELINE_FLIT_BUFFER_D_HH__
|
|
#define __MEM_RUBY_NETWORK_GARNET_FIXED_PIPELINE_FLIT_BUFFER_D_HH__
|
|
|
|
#include <algorithm>
|
|
#include <iostream>
|
|
#include <vector>
|
|
|
|
#include "mem/ruby/network/garnet/fixed-pipeline/flit_d.hh"
|
|
#include "mem/ruby/network/garnet/NetworkHeader.hh"
|
|
|
|
class flitBuffer_d
|
|
{
|
|
public:
|
|
flitBuffer_d();
|
|
flitBuffer_d(int maximum_size);
|
|
|
|
bool isReady(Cycles curTime);
|
|
bool isEmpty();
|
|
void print(std::ostream& out) const;
|
|
bool isFull();
|
|
void setMaxSize(int maximum);
|
|
|
|
flit_d *
|
|
getTopFlit()
|
|
{
|
|
flit_d *f = m_buffer.front();
|
|
std::pop_heap(m_buffer.begin(), m_buffer.end(), flit_d::greater);
|
|
m_buffer.pop_back();
|
|
return f;
|
|
}
|
|
|
|
flit_d *
|
|
peekTopFlit()
|
|
{
|
|
return m_buffer.front();
|
|
}
|
|
|
|
void
|
|
insert(flit_d *flt)
|
|
{
|
|
m_buffer.push_back(flt);
|
|
std::push_heap(m_buffer.begin(), m_buffer.end(), flit_d::greater);
|
|
}
|
|
|
|
uint32_t functionalWrite(Packet *pkt);
|
|
|
|
private:
|
|
std::vector<flit_d *> m_buffer;
|
|
int max_size;
|
|
};
|
|
|
|
inline std::ostream&
|
|
operator<<(std::ostream& out, const flitBuffer_d& obj)
|
|
{
|
|
obj.print(out);
|
|
out << std::flush;
|
|
return out;
|
|
}
|
|
|
|
#endif // __MEM_RUBY_NETWORK_GARNET_FIXED_PIPELINE_FLIT_BUFFER_D_HH__
|