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; --- 19 unchanged lines hidden (view full) --- 28 * Authors: Ali Saidi 29 */ 30 31#include "mem/tport.hh" 32 33void 34SimpleTimingPort::recvFunctional(Packet *pkt) 35{ |
36 std::list<Packet *>::iterator i; 37 std::list<Packet *>::iterator end; |
38 |
39 //First check queued events 40 i = transmitList.begin(); 41 end = transmitList.end(); 42 while (i != end) { |
43 Packet * target = *i; 44 // If the target contains data, and it overlaps the 45 // probed request, need to update data 46 if (target->intersect(pkt)) 47 fixPacket(pkt, target); 48 49 } |
50 |
51 //Then just do an atomic access and throw away the returned latency |
52 if (pkt->result != Packet::Success) |
53 recvAtomic(pkt); 54} 55 56bool 57SimpleTimingPort::recvTiming(Packet *pkt) 58{ 59 // If the device is only a slave, it should only be sending 60 // responses, which should never get nacked. There used to be --- 76 unchanged lines hidden --- |