1/*
2 * Copyright (c) 2006 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;

--- 30 unchanged lines hidden (view full) ---

39
40 while (i != end && !done) {
41 PacketPtr target = i->second;
42 // If the target contains data, and it overlaps the
43 // probed request, need to update data
44 if (target->intersect(pkt))
45 done = fixPacket(pkt, target);
46
47 }
48
49 //Then just do an atomic access and throw away the returned latency
50 if (pkt->result != Packet::Success)
51 recvAtomic(pkt);
52}
53
54bool

--- 38 unchanged lines hidden (view full) ---

93 drainEvent->process();
94 drainEvent = NULL;
95 }
96}
97
98void
99SimpleTimingPort::sendTiming(PacketPtr pkt, Tick time)
100{
101 if (transmitList.empty()) {
102 assert(!sendEvent.scheduled());
103 sendEvent.schedule(curTick+time);
104 }
105 transmitList.push_back(std::pair<Tick,PacketPtr>(time+curTick,pkt));
106}
107
108void
109SimpleTimingPort::SendEvent::process()
110{
111 assert(port->transmitList.size());
112 assert(port->transmitList.front().first <= curTick);
113 if (port->Port::sendTiming(port->transmitList.front().second)) {

--- 26 unchanged lines hidden ---