75 lines
2.6 KiB
C++
75 lines
2.6 KiB
C++
/*
|
|
* Copyright (c) 2019, University of Kaiserslautern
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. 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.
|
|
*
|
|
* 3. Neither the name of the copyright holder 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 HOLDER
|
|
* 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.
|
|
*
|
|
* Author: Lukas Steiner
|
|
*/
|
|
|
|
#include "RespQueueReorder.h"
|
|
#include "../../common/dramExtensions.h"
|
|
|
|
using namespace tlm;
|
|
|
|
void RespQueueReorder::insertPayload(tlm_generic_payload *payload, sc_time strobeEnd)
|
|
{
|
|
buffer[DramExtension::getPayloadID(payload)] = {payload, strobeEnd};
|
|
}
|
|
|
|
tlm_generic_payload *RespQueueReorder::nextPayload()
|
|
{
|
|
if (!buffer.empty())
|
|
{
|
|
if (buffer.begin()->first == currentPayloadID)
|
|
{
|
|
std::pair<tlm_generic_payload *, sc_time> element = buffer.begin()->second;
|
|
if (element.second <= sc_time_stamp())
|
|
{
|
|
buffer.erase(currentPayloadID++);
|
|
return element.first;
|
|
}
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
sc_time RespQueueReorder::getTriggerTime() const
|
|
{
|
|
if (!buffer.empty())
|
|
{
|
|
if (buffer.begin()->first == currentPayloadID)
|
|
{
|
|
sc_time triggerTime = buffer.begin()->second.second;
|
|
if (triggerTime > sc_time_stamp())
|
|
return triggerTime;
|
|
}
|
|
}
|
|
return sc_max_time();
|
|
}
|