process.cc revision 2474
12SN/A/*
24039Sbinkertn@umich.edu * Copyright (c) 2001-2005 The Regents of The University of Michigan
32SN/A * All rights reserved.
42SN/A *
52SN/A * Redistribution and use in source and binary forms, with or without
62SN/A * modification, are permitted provided that the following conditions are
72SN/A * met: redistributions of source code must retain the above copyright
82SN/A * notice, this list of conditions and the following disclaimer;
92SN/A * redistributions in binary form must reproduce the above copyright
102SN/A * notice, this list of conditions and the following disclaimer in the
112SN/A * documentation and/or other materials provided with the distribution;
122SN/A * neither the name of the copyright holders nor the names of its
132SN/A * contributors may be used to endorse or promote products derived from
142SN/A * this software without specific prior written permission.
152SN/A *
162SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
172SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
182SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
192SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
202SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
212SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
222SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
232SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
242SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
252SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
262SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
272665Ssaidi@eecs.umich.edu */
282665Ssaidi@eecs.umich.edu
292SN/A#include <unistd.h>
302SN/A#include <fcntl.h>
312SN/A
322SN/A#include <cstdio>
332SN/A#include <string>
342SN/A
352SN/A#include "base/intmath.hh"
3656SN/A#include "base/loader/object_file.hh"
372SN/A#include "base/loader/symtab.hh"
382SN/A#include "base/statistics.hh"
392SN/A#include "config/full_system.hh"
402SN/A#include "cpu/exec_context.hh"
412SN/A#include "mem/page_table.hh"
424039Sbinkertn@umich.edu#include "mem/mem_object.hh"
435756Snate@binkert.org#include "mem/translating_port.hh"
44492SN/A#include "sim/builder.hh"
454039Sbinkertn@umich.edu#include "sim/process.hh"
464039Sbinkertn@umich.edu#include "sim/stats.hh"
474039Sbinkertn@umich.edu#include "sim/syscall_emul.hh"
484039Sbinkertn@umich.edu#include "sim/system.hh"
494039Sbinkertn@umich.edu
504039Sbinkertn@umich.eduusing namespace std;
515756Snate@binkert.orgusing namespace TheISA;
524039Sbinkertn@umich.edu
534039Sbinkertn@umich.edu//
544039Sbinkertn@umich.edu// The purpose of this code is to fake the loader & syscall mechanism
554039Sbinkertn@umich.edu// when there's no OS: thus there's no resone to use it in FULL_SYSTEM
564039Sbinkertn@umich.edu// mode when we do have an OS
574039Sbinkertn@umich.edu//
584039Sbinkertn@umich.edu#if FULL_SYSTEM
594039Sbinkertn@umich.edu#error "process.cc not compatible with FULL_SYSTEM"
60492SN/A#endif
61492SN/A
622SN/A// current number of allocated processes
635756Snate@binkert.orgint num_processes = 0;
642SN/A
655756Snate@binkert.orgProcess::Process(const string &nm,
665756Snate@binkert.org                 System *_system,
674039Sbinkertn@umich.edu                 int stdin_fd, 	// initial I/O descriptors
68492SN/A                 int stdout_fd,
694039Sbinkertn@umich.edu                 int stderr_fd)
704039Sbinkertn@umich.edu    : SimObject(nm), system(_system)
714039Sbinkertn@umich.edu{
724039Sbinkertn@umich.edu    // initialize first 3 fds (stdin, stdout, stderr)
734039Sbinkertn@umich.edu    fd_map[STDIN_FILENO] = stdin_fd;
742SN/A    fd_map[STDOUT_FILENO] = stdout_fd;
754039Sbinkertn@umich.edu    fd_map[STDERR_FILENO] = stderr_fd;
764039Sbinkertn@umich.edu
772SN/A    // mark remaining fds as free
782SN/A    for (int i = 3; i <= MAX_FD; ++i) {
792SN/A        fd_map[i] = -1;
804039Sbinkertn@umich.edu    }
814039Sbinkertn@umich.edu
822SN/A    mmap_start = mmap_end = 0;
832SN/A    nxm_start = nxm_end = 0;
844039Sbinkertn@umich.edu    pTable = new PageTable(system);
854039Sbinkertn@umich.edu    // other parameters will be initialized when the program is loaded
864039Sbinkertn@umich.edu}
872SN/A
882SN/A
894039Sbinkertn@umich.eduvoid
904039Sbinkertn@umich.eduProcess::regStats()
914039Sbinkertn@umich.edu{
924039Sbinkertn@umich.edu    using namespace Stats;
932SN/A
942SN/A    num_syscalls
952SN/A        .name(name() + ".PROG:num_syscalls")
962SN/A        .desc("Number of system calls")
974039Sbinkertn@umich.edu        ;
984039Sbinkertn@umich.edu}
994039Sbinkertn@umich.edu
1004039Sbinkertn@umich.edu//
1014039Sbinkertn@umich.edu// static helper functions
1024039Sbinkertn@umich.edu//
1034039Sbinkertn@umich.eduint
1044039Sbinkertn@umich.eduProcess::openInputFile(const string &filename)
1054039Sbinkertn@umich.edu{
1064039Sbinkertn@umich.edu    int fd = open(filename.c_str(), O_RDONLY);
1074039Sbinkertn@umich.edu
1084039Sbinkertn@umich.edu    if (fd == -1) {
1094039Sbinkertn@umich.edu        perror(NULL);
1104039Sbinkertn@umich.edu        cerr << "unable to open \"" << filename << "\" for reading\n";
1114039Sbinkertn@umich.edu        fatal("can't open input file");
1124039Sbinkertn@umich.edu    }
1134039Sbinkertn@umich.edu
1144039Sbinkertn@umich.edu    return fd;
1154039Sbinkertn@umich.edu}
1164039Sbinkertn@umich.edu
1174039Sbinkertn@umich.edu
1184039Sbinkertn@umich.eduint
1194039Sbinkertn@umich.eduProcess::openOutputFile(const string &filename)
1204039Sbinkertn@umich.edu{
1214039Sbinkertn@umich.edu    int fd = open(filename.c_str(), O_WRONLY | O_CREAT | O_TRUNC, 0774);
1224039Sbinkertn@umich.edu
1234039Sbinkertn@umich.edu    if (fd == -1) {
1244039Sbinkertn@umich.edu        perror(NULL);
1254039Sbinkertn@umich.edu        cerr << "unable to open \"" << filename << "\" for writing\n";
1264039Sbinkertn@umich.edu        fatal("can't open output file");
1274039Sbinkertn@umich.edu    }
1284039Sbinkertn@umich.edu
1294039Sbinkertn@umich.edu    return fd;
1304039Sbinkertn@umich.edu}
1314039Sbinkertn@umich.edu
1324039Sbinkertn@umich.edu
1334039Sbinkertn@umich.eduint
1344039Sbinkertn@umich.eduProcess::registerExecContext(ExecContext *xc)
1354039Sbinkertn@umich.edu{
1364039Sbinkertn@umich.edu    // add to list
1374039Sbinkertn@umich.edu    int myIndex = execContexts.size();
1384039Sbinkertn@umich.edu    execContexts.push_back(xc);
1394039Sbinkertn@umich.edu
1404039Sbinkertn@umich.edu    // return CPU number to caller
1414039Sbinkertn@umich.edu    return myIndex;
1424039Sbinkertn@umich.edu}
1434039Sbinkertn@umich.edu
1444039Sbinkertn@umich.eduvoid
1454039Sbinkertn@umich.eduProcess::startup()
1464039Sbinkertn@umich.edu{
1474039Sbinkertn@umich.edu    if (execContexts.empty())
1484039Sbinkertn@umich.edu        fatal("Process %s is not associated with any CPUs!\n", name());
1494039Sbinkertn@umich.edu
1504039Sbinkertn@umich.edu    // first exec context for this process... initialize & enable
1514039Sbinkertn@umich.edu    ExecContext *xc = execContexts[0];
1524039Sbinkertn@umich.edu
1534039Sbinkertn@umich.edu    // mark this context as active so it will start ticking.
1544039Sbinkertn@umich.edu    xc->activate(0);
1554039Sbinkertn@umich.edu
1564039Sbinkertn@umich.edu    // Here we are grabbing the memory port of the CPU hosting the
1574039Sbinkertn@umich.edu    // initial execution context for initialization.  In the long run
1584039Sbinkertn@umich.edu    // this is not what we want, since it means that all
1594039Sbinkertn@umich.edu    // initialization accesses (e.g., loading object file sections)
1604039Sbinkertn@umich.edu    // will be done a cache block at a time through the CPU's cache.
1614039Sbinkertn@umich.edu    // We really want something more like:
1624039Sbinkertn@umich.edu    //
1634039Sbinkertn@umich.edu    // memport = system->physmem->getPort();
1644039Sbinkertn@umich.edu    // myPort.setPeer(memport);
1654039Sbinkertn@umich.edu    // memport->setPeer(&myPort);
1664039Sbinkertn@umich.edu    // initVirtMem = new TranslatingPort(myPort, pTable);
1674039Sbinkertn@umich.edu    //
1684039Sbinkertn@umich.edu    // but we need our own dummy port "myPort" that doesn't exist.
1694039Sbinkertn@umich.edu    // In the short term it works just fine though.
1704039Sbinkertn@umich.edu    initVirtMem = xc->getMemPort();
1714039Sbinkertn@umich.edu}
1724039Sbinkertn@umich.edu
1734039Sbinkertn@umich.eduvoid
1744039Sbinkertn@umich.eduProcess::replaceExecContext(ExecContext *xc, int xcIndex)
1754039Sbinkertn@umich.edu{
1764039Sbinkertn@umich.edu    if (xcIndex >= execContexts.size()) {
1774039Sbinkertn@umich.edu        panic("replaceExecContext: bad xcIndex, %d >= %d\n",
1784039Sbinkertn@umich.edu              xcIndex, execContexts.size());
1794039Sbinkertn@umich.edu    }
1804039Sbinkertn@umich.edu
1814039Sbinkertn@umich.edu    execContexts[xcIndex] = xc;
1824039Sbinkertn@umich.edu}
1834039Sbinkertn@umich.edu
1844039Sbinkertn@umich.edu// map simulator fd sim_fd to target fd tgt_fd
1854039Sbinkertn@umich.eduvoid
1864039Sbinkertn@umich.eduProcess::dup_fd(int sim_fd, int tgt_fd)
1874039Sbinkertn@umich.edu{
1884039Sbinkertn@umich.edu    if (tgt_fd < 0 || tgt_fd > MAX_FD)
1894039Sbinkertn@umich.edu        panic("Process::dup_fd tried to dup past MAX_FD (%d)", tgt_fd);
1904039Sbinkertn@umich.edu
1914039Sbinkertn@umich.edu    fd_map[tgt_fd] = sim_fd;
1924039Sbinkertn@umich.edu}
1934039Sbinkertn@umich.edu
1944039Sbinkertn@umich.edu
1954039Sbinkertn@umich.edu// generate new target fd for sim_fd
1964039Sbinkertn@umich.eduint
1974039Sbinkertn@umich.eduProcess::alloc_fd(int sim_fd)
1984039Sbinkertn@umich.edu{
1994039Sbinkertn@umich.edu    // in case open() returns an error, don't allocate a new fd
2004039Sbinkertn@umich.edu    if (sim_fd == -1)
2014039Sbinkertn@umich.edu        return -1;
2024039Sbinkertn@umich.edu
2034039Sbinkertn@umich.edu    // find first free target fd
2044039Sbinkertn@umich.edu    for (int free_fd = 0; free_fd < MAX_FD; ++free_fd) {
2054039Sbinkertn@umich.edu        if (fd_map[free_fd] == -1) {
2064039Sbinkertn@umich.edu            fd_map[free_fd] = sim_fd;
2074039Sbinkertn@umich.edu            return free_fd;
2084039Sbinkertn@umich.edu        }
2094039Sbinkertn@umich.edu    }
2104039Sbinkertn@umich.edu
2114039Sbinkertn@umich.edu    panic("Process::alloc_fd: out of file descriptors!");
2124039Sbinkertn@umich.edu}
2134039Sbinkertn@umich.edu
2144039Sbinkertn@umich.edu
2154039Sbinkertn@umich.edu// free target fd (e.g., after close)
2164039Sbinkertn@umich.eduvoid
2174039Sbinkertn@umich.eduProcess::free_fd(int tgt_fd)
2184039Sbinkertn@umich.edu{
2194039Sbinkertn@umich.edu    if (fd_map[tgt_fd] == -1)
2204039Sbinkertn@umich.edu        warn("Process::free_fd: request to free unused fd %d", tgt_fd);
2214039Sbinkertn@umich.edu
2224039Sbinkertn@umich.edu    fd_map[tgt_fd] = -1;
2234039Sbinkertn@umich.edu}
2244039Sbinkertn@umich.edu
2254039Sbinkertn@umich.edu
2265756Snate@binkert.org// look up simulator fd for given target fd
2275756Snate@binkert.orgint
2285756Snate@binkert.orgProcess::sim_fd(int tgt_fd)
2295756Snate@binkert.org{
2305756Snate@binkert.org    if (tgt_fd > MAX_FD)
2315756Snate@binkert.org        return -1;
2325756Snate@binkert.org
2334039Sbinkertn@umich.edu    return fd_map[tgt_fd];
2345756Snate@binkert.org}
2354039Sbinkertn@umich.edu
2364039Sbinkertn@umich.edu
2374039Sbinkertn@umich.edu
2384039Sbinkertn@umich.edu//
2394039Sbinkertn@umich.edu// need to declare these here since there is no concrete Process type
2404039Sbinkertn@umich.edu// that can be constructed (i.e., no REGISTER_SIM_OBJECT() macro call,
2414039Sbinkertn@umich.edu// which is where these get declared for concrete types).
2424039Sbinkertn@umich.edu//
2434039Sbinkertn@umich.eduDEFINE_SIM_OBJECT_CLASS_NAME("Process", Process)
2444039Sbinkertn@umich.edu
2454039Sbinkertn@umich.edu
2464039Sbinkertn@umich.edu////////////////////////////////////////////////////////////////////////
2474039Sbinkertn@umich.edu//
2484039Sbinkertn@umich.edu// LiveProcess member definitions
2494039Sbinkertn@umich.edu//
2504039Sbinkertn@umich.edu////////////////////////////////////////////////////////////////////////
2512SN/A
2524039Sbinkertn@umich.edu
2534039Sbinkertn@umich.edustatic void
2542SN/AcopyStringArray(vector<string> &strings, Addr array_ptr, Addr data_ptr,
2552SN/A                TranslatingPort* memPort)
2564039Sbinkertn@umich.edu{
2574039Sbinkertn@umich.edu    Addr data_ptr_swap;
2582SN/A    for (int i = 0; i < strings.size(); ++i) {
2594039Sbinkertn@umich.edu        data_ptr_swap = htog(data_ptr);
2602SN/A        memPort->writeBlob(array_ptr, (uint8_t*)&data_ptr_swap, sizeof(Addr));
2614039Sbinkertn@umich.edu        memPort->writeString(data_ptr, strings[i].c_str());
2624039Sbinkertn@umich.edu        array_ptr += sizeof(Addr);
2634039Sbinkertn@umich.edu        data_ptr += strings[i].size() + 1;
2644039Sbinkertn@umich.edu    }
2654039Sbinkertn@umich.edu    // add NULL terminator
2662SN/A    data_ptr = 0;
2674039Sbinkertn@umich.edu
2684039Sbinkertn@umich.edu    memPort->writeBlob(array_ptr, (uint8_t*)&data_ptr, sizeof(Addr));
2694039Sbinkertn@umich.edu}
2704039Sbinkertn@umich.edu
2714039Sbinkertn@umich.eduLiveProcess::LiveProcess(const string &nm, ObjectFile *_objFile,
2724039Sbinkertn@umich.edu                         System *_system,
2734039Sbinkertn@umich.edu                         int stdin_fd, int stdout_fd, int stderr_fd,
2744039Sbinkertn@umich.edu                         vector<string> &_argv, vector<string> &_envp)
2754039Sbinkertn@umich.edu    : Process(nm, _system, stdin_fd, stdout_fd, stderr_fd),
2764039Sbinkertn@umich.edu      objFile(_objFile), argv(_argv), envp(_envp)
2774039Sbinkertn@umich.edu{
2784039Sbinkertn@umich.edu    prog_fname = argv[0];
2794039Sbinkertn@umich.edu
2804039Sbinkertn@umich.edu    // load up symbols, if any... these may be used for debugging or
2814039Sbinkertn@umich.edu    // profiling.
2824039Sbinkertn@umich.edu    if (!debugSymbolTable) {
2834039Sbinkertn@umich.edu        debugSymbolTable = new SymbolTable();
2844039Sbinkertn@umich.edu        if (!objFile->loadGlobalSymbols(debugSymbolTable) ||
2854039Sbinkertn@umich.edu            !objFile->loadLocalSymbols(debugSymbolTable)) {
2864039Sbinkertn@umich.edu            // didn't load any symbols
2874039Sbinkertn@umich.edu            delete debugSymbolTable;
2884039Sbinkertn@umich.edu            debugSymbolTable = NULL;
2894039Sbinkertn@umich.edu        }
2904039Sbinkertn@umich.edu    }
2914039Sbinkertn@umich.edu}
2922SN/A
2932SN/Avoid
2947811Ssteve.reinhardt@amd.comLiveProcess::argsInit(int intSize, int pageSize)
295{
296    Process::startup();
297
298    // load object file into target memory
299    objFile->loadSections(initVirtMem);
300
301    // Calculate how much space we need for arg & env arrays.
302    int argv_array_size = intSize * (argv.size() + 1);
303    int envp_array_size = intSize * (envp.size() + 1);
304    int arg_data_size = 0;
305    for (int i = 0; i < argv.size(); ++i) {
306        arg_data_size += argv[i].size() + 1;
307    }
308    int env_data_size = 0;
309    for (int i = 0; i < envp.size(); ++i) {
310        env_data_size += envp[i].size() + 1;
311    }
312
313    int space_needed =
314        argv_array_size + envp_array_size + arg_data_size + env_data_size;
315    // for SimpleScalar compatibility
316    if (space_needed < 16384)
317        space_needed = 16384;
318
319    // set bottom of stack
320    stack_min = stack_base - space_needed;
321    // align it
322    stack_min &= ~(intSize-1);
323    stack_size = stack_base - stack_min;
324    // map memory
325    pTable->allocate(roundDown(stack_min, pageSize),
326                     roundUp(stack_size, pageSize));
327
328    // map out initial stack contents
329    Addr argv_array_base = stack_min + sizeof(uint64_t); // room for argc
330    Addr envp_array_base = argv_array_base + argv_array_size;
331    Addr arg_data_base = envp_array_base + envp_array_size;
332    Addr env_data_base = arg_data_base + arg_data_size;
333
334    // write contents to stack
335    uint64_t argc = argv.size();
336    if (intSize == 8)
337        argc = htog((uint64_t)argc);
338    else if (intSize == 4)
339        argc = htog((uint32_t)argc);
340    else
341        panic("Unknown int size");
342
343    initVirtMem->writeBlob(stack_min, (uint8_t*)&argc, intSize);
344
345    copyStringArray(argv, argv_array_base, arg_data_base, initVirtMem);
346    copyStringArray(envp, envp_array_base, env_data_base, initVirtMem);
347
348    execContexts[0]->setIntReg(ArgumentReg0, argc);
349    execContexts[0]->setIntReg(ArgumentReg1, argv_array_base);
350    execContexts[0]->setIntReg(StackPointerReg, stack_min);
351
352    Addr prog_entry = objFile->entryPoint();
353    execContexts[0]->setPC(prog_entry);
354    execContexts[0]->setNextPC(prog_entry + sizeof(MachInst));
355    execContexts[0]->setNextNPC(prog_entry + (2 * sizeof(MachInst)));
356
357    num_processes++;
358}
359
360void
361LiveProcess::syscall(ExecContext *xc)
362{
363    num_syscalls++;
364
365    int64_t callnum = xc->readIntReg(SyscallNumReg);
366
367    SyscallDesc *desc = getDesc(callnum);
368    if (desc == NULL)
369        fatal("Syscall %d out of range", callnum);
370
371    desc->doSyscall(callnum, this, xc);
372}
373
374DEFINE_SIM_OBJECT_CLASS_NAME("LiveProcess", LiveProcess);
375