process.cc revision 6811
12207SN/A/* 25254Sksewell@umich.edu * Copyright (c) 2004-2005 The Regents of The University of Michigan 35254Sksewell@umich.edu * All rights reserved. 42207SN/A * 55254Sksewell@umich.edu * Redistribution and use in source and binary forms, with or without 65254Sksewell@umich.edu * modification, are permitted provided that the following conditions are 75254Sksewell@umich.edu * met: redistributions of source code must retain the above copyright 85254Sksewell@umich.edu * notice, this list of conditions and the following disclaimer; 95254Sksewell@umich.edu * redistributions in binary form must reproduce the above copyright 105254Sksewell@umich.edu * notice, this list of conditions and the following disclaimer in the 115254Sksewell@umich.edu * documentation and/or other materials provided with the distribution; 125254Sksewell@umich.edu * neither the name of the copyright holders nor the names of its 135254Sksewell@umich.edu * contributors may be used to endorse or promote products derived from 145254Sksewell@umich.edu * this software without specific prior written permission. 152207SN/A * 165254Sksewell@umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 175254Sksewell@umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 185254Sksewell@umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 195254Sksewell@umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 205254Sksewell@umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 215254Sksewell@umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 225254Sksewell@umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 235254Sksewell@umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 245254Sksewell@umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 255254Sksewell@umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 265254Sksewell@umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 272665Ssaidi@eecs.umich.edu * 285254Sksewell@umich.edu * Authors: Gabe Black 295254Sksewell@umich.edu * Ali Saidi 305254Sksewell@umich.edu * Korey Sewell 312207SN/A */ 322207SN/A 332474SN/A#include "arch/mips/isa_traits.hh" 342207SN/A#include "arch/mips/process.hh" 356650Sksewell@umich.edu 362454SN/A#include "base/loader/object_file.hh" 376811SMatt DeVuyst#include "base/loader/elf_object.hh" 382454SN/A#include "base/misc.hh" 392680Sktlim@umich.edu#include "cpu/thread_context.hh" 406650Sksewell@umich.edu 416650Sksewell@umich.edu#include "mem/page_table.hh" 426650Sksewell@umich.edu 436650Sksewell@umich.edu#include "sim/process.hh" 446650Sksewell@umich.edu#include "sim/process_impl.hh" 452474SN/A#include "sim/system.hh" 462207SN/A 472447SN/Ausing namespace std; 482474SN/Ausing namespace MipsISA; 492447SN/A 505154Sgblack@eecs.umich.eduMipsLiveProcess::MipsLiveProcess(LiveProcessParams * params, 515154Sgblack@eecs.umich.edu ObjectFile *objFile) 525154Sgblack@eecs.umich.edu : LiveProcess(params, objFile) 532474SN/A{ 542686Sksewell@umich.edu // Set up stack. On MIPS, stack starts at the top of kuseg 552686Sksewell@umich.edu // user address space. MIPS stack grows down from here 562935Sksewell@umich.edu stack_base = 0x7FFFFFFF; 572474SN/A 582474SN/A // Set pointer for next thread stack. Reserve 8M for main stack. 592474SN/A next_thread_stack_base = stack_base - (8 * 1024 * 1024); 602474SN/A 612686Sksewell@umich.edu // Set up break point (Top of Heap) 622686Sksewell@umich.edu brk_point = objFile->dataBase() + objFile->dataSize() + objFile->bssSize(); 632686Sksewell@umich.edu brk_point = roundUp(brk_point, VMPageSize); 642686Sksewell@umich.edu 656811SMatt DeVuyst // Set up region for mmaps. Start it 1GB above the top of the heap. 666811SMatt DeVuyst mmap_start = mmap_end = brk_point + 0x40000000L; 672474SN/A} 682474SN/A 692474SN/Avoid 702474SN/AMipsLiveProcess::startup() 712474SN/A{ 726650Sksewell@umich.edu Process::startup(); 736650Sksewell@umich.edu 746811SMatt DeVuyst argsInit<uint32_t>(VMPageSize); 752474SN/A} 765958Sgblack@eecs.umich.edu 776811SMatt DeVuysttemplate<class IntType> 786650Sksewell@umich.eduvoid 796811SMatt DeVuystMipsLiveProcess::argsInit(int pageSize) 806650Sksewell@umich.edu{ 816811SMatt DeVuyst int intSize = sizeof(IntType); 826811SMatt DeVuyst Process::startup(); 836811SMatt DeVuyst 846650Sksewell@umich.edu // load object file into target memory 856650Sksewell@umich.edu objFile->loadSections(initVirtMem); 866650Sksewell@umich.edu 876811SMatt DeVuyst typedef AuxVector<IntType> auxv_t; 886811SMatt DeVuyst std::vector<auxv_t> auxv; 896811SMatt DeVuyst 906811SMatt DeVuyst ElfObject * elfObject = dynamic_cast<ElfObject *>(objFile); 916811SMatt DeVuyst if (elfObject) 926811SMatt DeVuyst { 936811SMatt DeVuyst // Set the system page size 946811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_PAGESZ, MipsISA::VMPageSize)); 956811SMatt DeVuyst // Set the frequency at which time() increments 966811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_CLKTCK, 100)); 976811SMatt DeVuyst // For statically linked executables, this is the virtual 986811SMatt DeVuyst // address of the program header tables if they appear in the 996811SMatt DeVuyst // executable image. 1006811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_PHDR, elfObject->programHeaderTable())); 1016811SMatt DeVuyst DPRINTF(Loader, "auxv at PHDR %08p\n", elfObject->programHeaderTable()); 1026811SMatt DeVuyst // This is the size of a program header entry from the elf file. 1036811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_PHENT, elfObject->programHeaderSize())); 1046811SMatt DeVuyst // This is the number of program headers from the original elf file. 1056811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_PHNUM, elfObject->programHeaderCount())); 1066811SMatt DeVuyst //The entry point to the program 1076811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_ENTRY, objFile->entryPoint())); 1086811SMatt DeVuyst //Different user and group IDs 1096811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_UID, uid())); 1106811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_EUID, euid())); 1116811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_GID, gid())); 1126811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_EGID, egid())); 1136811SMatt DeVuyst } 1146811SMatt DeVuyst 1156811SMatt DeVuyst // Calculate how much space we need for arg & env & auxv arrays. 1166650Sksewell@umich.edu int argv_array_size = intSize * (argv.size() + 1); 1176650Sksewell@umich.edu int envp_array_size = intSize * (envp.size() + 1); 1186811SMatt DeVuyst int auxv_array_size = intSize * 2 * (auxv.size() + 1); 1196811SMatt DeVuyst 1206650Sksewell@umich.edu int arg_data_size = 0; 1216650Sksewell@umich.edu for (vector<string>::size_type i = 0; i < argv.size(); ++i) { 1226650Sksewell@umich.edu arg_data_size += argv[i].size() + 1; 1236650Sksewell@umich.edu } 1246650Sksewell@umich.edu int env_data_size = 0; 1256650Sksewell@umich.edu for (vector<string>::size_type i = 0; i < envp.size(); ++i) { 1266650Sksewell@umich.edu env_data_size += envp[i].size() + 1; 1276650Sksewell@umich.edu } 1286650Sksewell@umich.edu 1296650Sksewell@umich.edu int space_needed = 1306811SMatt DeVuyst argv_array_size + 1316811SMatt DeVuyst envp_array_size + 1326811SMatt DeVuyst auxv_array_size + 1336811SMatt DeVuyst arg_data_size + 1346811SMatt DeVuyst env_data_size; 1356650Sksewell@umich.edu 1366650Sksewell@umich.edu // set bottom of stack 1376650Sksewell@umich.edu stack_min = stack_base - space_needed; 1386650Sksewell@umich.edu // align it 1396650Sksewell@umich.edu stack_min = roundDown(stack_min, pageSize); 1406650Sksewell@umich.edu stack_size = stack_base - stack_min; 1416650Sksewell@umich.edu // map memory 1426650Sksewell@umich.edu pTable->allocate(stack_min, roundUp(stack_size, pageSize)); 1436650Sksewell@umich.edu 1446650Sksewell@umich.edu // map out initial stack contents 1456811SMatt DeVuyst IntType argv_array_base = stack_min + intSize; // room for argc 1466811SMatt DeVuyst IntType envp_array_base = argv_array_base + argv_array_size; 1476811SMatt DeVuyst IntType auxv_array_base = envp_array_base + envp_array_size; 1486811SMatt DeVuyst IntType arg_data_base = auxv_array_base + auxv_array_size; 1496811SMatt DeVuyst IntType env_data_base = arg_data_base + arg_data_size; 1506650Sksewell@umich.edu 1516650Sksewell@umich.edu // write contents to stack 1526811SMatt DeVuyst IntType argc = argv.size(); 1536650Sksewell@umich.edu 1546811SMatt DeVuyst argc = htog((IntType)argc); 1556650Sksewell@umich.edu 1566650Sksewell@umich.edu initVirtMem->writeBlob(stack_min, (uint8_t*)&argc, intSize); 1576650Sksewell@umich.edu 1586650Sksewell@umich.edu copyStringArray(argv, argv_array_base, arg_data_base, initVirtMem); 1596650Sksewell@umich.edu 1606650Sksewell@umich.edu copyStringArray(envp, envp_array_base, env_data_base, initVirtMem); 1616650Sksewell@umich.edu 1626811SMatt DeVuyst // Copy the aux vector 1636811SMatt DeVuyst for (typename vector<auxv_t>::size_type x = 0; x < auxv.size(); x++) { 1646811SMatt DeVuyst initVirtMem->writeBlob(auxv_array_base + x * 2 * intSize, 1656811SMatt DeVuyst (uint8_t*)&(auxv[x].a_type), intSize); 1666811SMatt DeVuyst initVirtMem->writeBlob(auxv_array_base + (x * 2 + 1) * intSize, 1676811SMatt DeVuyst (uint8_t*)&(auxv[x].a_val), intSize); 1686811SMatt DeVuyst } 1696811SMatt DeVuyst 1706811SMatt DeVuyst // Write out the terminating zeroed auxilliary vector 1716811SMatt DeVuyst for (unsigned i = 0; i < 2; i++) { 1726811SMatt DeVuyst const IntType zero = 0; 1736811SMatt DeVuyst const Addr addr = auxv_array_base + 2 * intSize * (auxv.size() + i); 1746811SMatt DeVuyst initVirtMem->writeBlob(addr, (uint8_t*)&zero, intSize); 1756811SMatt DeVuyst } 1766811SMatt DeVuyst 1776650Sksewell@umich.edu ThreadContext *tc = system->getThreadContext(contextIds[0]); 1786650Sksewell@umich.edu 1796650Sksewell@umich.edu setSyscallArg(tc, 0, argc); 1806650Sksewell@umich.edu setSyscallArg(tc, 1, argv_array_base); 1816650Sksewell@umich.edu tc->setIntReg(StackPointerReg, stack_min); 1826650Sksewell@umich.edu 1836650Sksewell@umich.edu Addr prog_entry = objFile->entryPoint(); 1846650Sksewell@umich.edu tc->setPC(prog_entry); 1856650Sksewell@umich.edu tc->setNextPC(prog_entry + sizeof(MachInst)); 1866650Sksewell@umich.edu tc->setNextNPC(prog_entry + (2 * sizeof(MachInst))); 1876650Sksewell@umich.edu} 1886650Sksewell@umich.edu 1896650Sksewell@umich.edu 1905958Sgblack@eecs.umich.eduMipsISA::IntReg 1916701Sgblack@eecs.umich.eduMipsLiveProcess::getSyscallArg(ThreadContext *tc, int &i) 1925958Sgblack@eecs.umich.edu{ 1935958Sgblack@eecs.umich.edu assert(i < 6); 1946701Sgblack@eecs.umich.edu return tc->readIntReg(FirstArgumentReg + i++); 1955958Sgblack@eecs.umich.edu} 1965958Sgblack@eecs.umich.edu 1975958Sgblack@eecs.umich.eduvoid 1985958Sgblack@eecs.umich.eduMipsLiveProcess::setSyscallArg(ThreadContext *tc, 1995958Sgblack@eecs.umich.edu int i, MipsISA::IntReg val) 2005958Sgblack@eecs.umich.edu{ 2015958Sgblack@eecs.umich.edu assert(i < 6); 2025958Sgblack@eecs.umich.edu tc->setIntReg(FirstArgumentReg + i, val); 2035958Sgblack@eecs.umich.edu} 2045958Sgblack@eecs.umich.edu 2055958Sgblack@eecs.umich.eduvoid 2065958Sgblack@eecs.umich.eduMipsLiveProcess::setSyscallReturn(ThreadContext *tc, 2075958Sgblack@eecs.umich.edu SyscallReturn return_value) 2085958Sgblack@eecs.umich.edu{ 2095958Sgblack@eecs.umich.edu if (return_value.successful()) { 2105958Sgblack@eecs.umich.edu // no error 2115958Sgblack@eecs.umich.edu tc->setIntReg(SyscallSuccessReg, 0); 2125958Sgblack@eecs.umich.edu tc->setIntReg(ReturnValueReg, return_value.value()); 2135958Sgblack@eecs.umich.edu } else { 2145958Sgblack@eecs.umich.edu // got an error, return details 2155958Sgblack@eecs.umich.edu tc->setIntReg(SyscallSuccessReg, (IntReg) -1); 2165958Sgblack@eecs.umich.edu tc->setIntReg(ReturnValueReg, -return_value.value()); 2175958Sgblack@eecs.umich.edu } 2185958Sgblack@eecs.umich.edu} 219