a5802c823f
This changeset adds functionality that allows system calls to retry without affecting thread context state such as the program counter or register values for the associated thread context (when system calls return with a retry fault). This functionality is needed to solve problems with blocking system calls in multi-process or multi-threaded simulations where information is passed between processes/threads. Blocking system calls can cause deadlock because the simulator itself is single threaded. There is only a single thread servicing the event queue which can cause deadlock if the thread hits a blocking system call instruction. To illustrate the problem, consider two processes using the producer/consumer sharing model. The processes can use file descriptors and the read and write calls to pass information to one another. If the consumer calls the blocking read system call before the producer has produced anything, the call will block the event queue (while executing the system call instruction) and deadlock the simulation. The solution implemented in this changeset is to recognize that the system calls will block and then generate a special retry fault. The fault will be sent back up through the function call chain until it is exposed to the cpu model's pipeline where the fault becomes visible. The fault will trigger the cpu model to replay the instruction at a future tick where the call has a chance to succeed without actually going into a blocking state. In subsequent patches, we recognize that a syscall will block by calling a non-blocking poll (from inside the system call implementation) and checking for events. When events show up during the poll, it signifies that the call would not have blocked and the syscall is allowed to proceed (calling an underlying host system call if necessary). If no events are returned from the poll, we generate the fault and try the instruction for the thread context at a distant tick. Note that retrying every tick is not efficient. As an aside, the simulator has some multi-threading support for the event queue, but it is not used by default and needs work. Even if the event queue was completely multi-threaded, meaning that there is a hardware thread on the host servicing a single simulator thread contexts with a 1:1 mapping between them, it's still possible to run into deadlock due to the event queue barriers on quantum boundaries. The solution of replaying at a later tick is the simplest solution and solves the problem generally.
137 lines
4.2 KiB
C++
137 lines
4.2 KiB
C++
/*
|
|
* Copyright (c) 2003-2004 The Regents of The University of Michigan
|
|
* 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.
|
|
*
|
|
* Authors: Gabe Black
|
|
* Ali Saidi
|
|
*/
|
|
|
|
#ifndef __SPARC_PROCESS_HH__
|
|
#define __SPARC_PROCESS_HH__
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "mem/page_table.hh"
|
|
#include "sim/byteswap.hh"
|
|
#include "sim/process.hh"
|
|
|
|
class ObjectFile;
|
|
|
|
class SparcProcess : public Process
|
|
{
|
|
protected:
|
|
|
|
const Addr StackBias;
|
|
|
|
// The locations of the fill and spill handlers
|
|
Addr fillStart, spillStart;
|
|
|
|
SparcProcess(ProcessParams * params, ObjectFile *objFile,
|
|
Addr _StackBias);
|
|
|
|
void initState();
|
|
|
|
template<class IntType>
|
|
void argsInit(int pageSize);
|
|
|
|
public:
|
|
|
|
// Handles traps which request services from the operating system
|
|
virtual void handleTrap(int trapNum, ThreadContext *tc, Fault *fault);
|
|
|
|
Addr readFillStart() { return fillStart; }
|
|
Addr readSpillStart() { return spillStart; }
|
|
|
|
virtual void flushWindows(ThreadContext *tc) = 0;
|
|
void setSyscallReturn(ThreadContext *tc, SyscallReturn return_value);
|
|
};
|
|
|
|
class Sparc32Process : public SparcProcess
|
|
{
|
|
protected:
|
|
|
|
Sparc32Process(ProcessParams * params, ObjectFile *objFile)
|
|
: SparcProcess(params, objFile, 0)
|
|
{
|
|
// Set up stack. On SPARC Linux, stack goes from the top of memory
|
|
// downward, less the hole for the kernel address space.
|
|
stack_base = (Addr)0xf0000000ULL;
|
|
|
|
// Set up region for mmaps.
|
|
mmap_end = 0x70000000;
|
|
}
|
|
|
|
void initState();
|
|
|
|
public:
|
|
|
|
void argsInit(int intSize, int pageSize);
|
|
|
|
void flushWindows(ThreadContext *tc);
|
|
|
|
SparcISA::IntReg getSyscallArg(ThreadContext *tc, int &i);
|
|
/// Explicitly import the otherwise hidden getSyscallArg
|
|
using Process::getSyscallArg;
|
|
|
|
void setSyscallArg(ThreadContext *tc, int i, SparcISA::IntReg val);
|
|
};
|
|
|
|
class Sparc64Process : public SparcProcess
|
|
{
|
|
protected:
|
|
|
|
Sparc64Process(ProcessParams * params, ObjectFile *objFile)
|
|
: SparcProcess(params, objFile, 2047)
|
|
{
|
|
// Set up stack. On SPARC Linux, stack goes from the top of memory
|
|
// downward, less the hole for the kernel address space.
|
|
stack_base = (Addr)0x80000000000ULL;
|
|
|
|
// Set up region for mmaps.
|
|
mmap_end = 0xfffff80000000000ULL;
|
|
}
|
|
|
|
void initState();
|
|
|
|
public:
|
|
|
|
void argsInit(int intSize, int pageSize);
|
|
|
|
void flushWindows(ThreadContext *tc);
|
|
|
|
SparcISA::IntReg getSyscallArg(ThreadContext *tc, int &i);
|
|
/// Explicitly import the otherwise hidden getSyscallArg
|
|
using Process::getSyscallArg;
|
|
|
|
void setSyscallArg(ThreadContext *tc, int i, SparcISA::IntReg val);
|
|
};
|
|
|
|
/* No architectural page table defined for this ISA */
|
|
typedef NoArchPageTable ArchPageTable;
|
|
|
|
#endif // __SPARC_PROCESS_HH__
|