92de70b69a
This was done with an automated process, so there could be things that were done in this tree in the past that didn't make it. One known regression is that atomic memory operations do not seem to work properly anymore.
67 lines
2.7 KiB
C++
67 lines
2.7 KiB
C++
/*
|
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
* 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.
|
|
*/
|
|
|
|
#include "mem/ruby/libruby.hh"
|
|
#include "writebuffer.hh"
|
|
#include <iostream>
|
|
|
|
writebuffer_status_t handleStore (writebuffer_t * writebuffer, const RubyRequest & request) {
|
|
assert(request.type == RubyRequestType_ST);
|
|
if (writebuffer->writeBufferFull()){
|
|
return WB_FULL;
|
|
}
|
|
else if (writebuffer->writeBufferFlushing()) {
|
|
return WB_FLUSHING;
|
|
}
|
|
else {
|
|
writebuffer->addToWriteBuffer(request);
|
|
return WB_OK;
|
|
}
|
|
}
|
|
|
|
uint64_t handleLoad(writebuffer_t * writebuffer, const RubyRequest & request) {
|
|
assert(request.type == RubyRequestType_LD);
|
|
return writebuffer->handleLoad(request);
|
|
}
|
|
|
|
uint64_t handleAtomic(writebuffer_t * writebuffer, const RubyRequest & request) {
|
|
// flush the store buffer
|
|
writebuffer->flushWriteBuffer();
|
|
// let writebuffer issue atomic
|
|
//return writebuffer->issueAtomic(request);
|
|
}
|
|
|
|
void flushSTB(writebuffer_t * writebuffer) {
|
|
// in in-order can't get a request to flushSTB if already flushing
|
|
// on out of order, have to check if already flushing
|
|
writebuffer->flushWriteBuffer();
|
|
}
|
|
|
|
void registerHitCallback(writebuffer_t * writebuffer, void (*hit_callback)(int64_t access_id)) {
|
|
writebuffer->registerHitCallback(hit_callback);
|
|
}
|