assert(transmitList.size() != reqQueueLimit);
- transmitList.emplace_back(DeferredPacket(pkt, when));
+ transmitList.emplace_back(pkt, when);
}
bridge.schedule(sendEvent, when);
}
- transmitList.emplace_back(DeferredPacket(pkt, when));
+ transmitList.emplace_back(pkt, when);
}
void
}
}
- emplace_back(Target(pkt, readyTime, order, source, markPending));
+ emplace_back(pkt, readyTime, order, source, markPending);
}
DPRINTF(HWPrefetch, "Prefetch queued. "
"addr:%#x tick:%lld.\n", pf_addr, pf_time);
- pfq.emplace_back(DeferredPacket(pf_time, pf_pkt));
+ pfq.emplace_back(pf_time, pf_pkt);
}
}
// note that currently we ignore a potentially outstanding retry
// and could in theory put a new packet at the head of the
// transmit list before retrying the existing packet
- transmitList.emplace_front(DeferredPacket(when, pkt));
+ transmitList.emplace_front(when, pkt);
schedSendEvent(when);
return;
}
// list is non-empty and this belongs at the end
if (when >= transmitList.back().tick) {
- transmitList.emplace_back(DeferredPacket(when, pkt));
+ transmitList.emplace_back(when, pkt);
return;
}
++i; // already checked for insertion at front
while (i != transmitList.end() && when >= i->tick)
++i;
- transmitList.emplace(i, DeferredPacket(when, pkt));
+ transmitList.emplace(i, when, pkt);
}
void
// to keep things simple (and in order), we put the packet at
// the end even if the latency suggests it should be sent
// before the packet(s) before it
- packetQueue.emplace_back(DeferredPacket(pkt, curTick() + getLatency()));
+ packetQueue.emplace_back(pkt, curTick() + getLatency());
if (!retryResp && !dequeueEvent.scheduled())
schedule(dequeueEvent, packetQueue.back().tick);
} else {