process.cc revision 11389
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" 358229Snate@binkert.org#include "base/loader/elf_object.hh" 362454SN/A#include "base/loader/object_file.hh" 372454SN/A#include "base/misc.hh" 382680Sktlim@umich.edu#include "cpu/thread_context.hh" 398232Snate@binkert.org#include "debug/Loader.hh" 406650Sksewell@umich.edu#include "mem/page_table.hh" 416650Sksewell@umich.edu#include "sim/process.hh" 426650Sksewell@umich.edu#include "sim/process_impl.hh" 432474SN/A#include "sim/system.hh" 442207SN/A 452447SN/Ausing namespace std; 462474SN/Ausing namespace MipsISA; 472447SN/A 485154Sgblack@eecs.umich.eduMipsLiveProcess::MipsLiveProcess(LiveProcessParams * params, 495154Sgblack@eecs.umich.edu ObjectFile *objFile) 505154Sgblack@eecs.umich.edu : LiveProcess(params, objFile) 512474SN/A{ 522686Sksewell@umich.edu // Set up stack. On MIPS, stack starts at the top of kuseg 532686Sksewell@umich.edu // user address space. MIPS stack grows down from here 542935Sksewell@umich.edu stack_base = 0x7FFFFFFF; 552474SN/A 562474SN/A // Set pointer for next thread stack. Reserve 8M for main stack. 572474SN/A next_thread_stack_base = stack_base - (8 * 1024 * 1024); 582474SN/A 592686Sksewell@umich.edu // Set up break point (Top of Heap) 602686Sksewell@umich.edu brk_point = objFile->dataBase() + objFile->dataSize() + objFile->bssSize(); 6110318Sandreas.hansson@arm.com brk_point = roundUp(brk_point, PageBytes); 622686Sksewell@umich.edu 636811SMatt DeVuyst // Set up region for mmaps. Start it 1GB above the top of the heap. 6411386Ssteve.reinhardt@amd.com mmap_end = brk_point + 0x40000000L; 652474SN/A} 662474SN/A 672474SN/Avoid 687532Ssteve.reinhardt@amd.comMipsLiveProcess::initState() 692474SN/A{ 707532Ssteve.reinhardt@amd.com LiveProcess::initState(); 716650Sksewell@umich.edu 7210318Sandreas.hansson@arm.com argsInit<uint32_t>(PageBytes); 732474SN/A} 745958Sgblack@eecs.umich.edu 756811SMatt DeVuysttemplate<class IntType> 766650Sksewell@umich.eduvoid 776811SMatt DeVuystMipsLiveProcess::argsInit(int pageSize) 786650Sksewell@umich.edu{ 796811SMatt DeVuyst int intSize = sizeof(IntType); 806811SMatt DeVuyst 8111389Sbrandon.potter@amd.com // Patch the ld_bias for dynamic executables. 8211389Sbrandon.potter@amd.com updateBias(); 8311389Sbrandon.potter@amd.com 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 9410318Sandreas.hansson@arm.com auxv.push_back(auxv_t(M5_AT_PAGESZ, MipsISA::PageBytes)); 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())); 10611389Sbrandon.potter@amd.com // This is the base address of the ELF interpreter; it should be 10711389Sbrandon.potter@amd.com // zero for static executables or contain the base address for 10811389Sbrandon.potter@amd.com // dynamic executables. 10911389Sbrandon.potter@amd.com auxv.push_back(auxv_t(M5_AT_BASE, getBias())); 1106811SMatt DeVuyst //The entry point to the program 1116811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_ENTRY, objFile->entryPoint())); 1126811SMatt DeVuyst //Different user and group IDs 1136811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_UID, uid())); 1146811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_EUID, euid())); 1156811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_GID, gid())); 1166811SMatt DeVuyst auxv.push_back(auxv_t(M5_AT_EGID, egid())); 1176811SMatt DeVuyst } 1186811SMatt DeVuyst 1196811SMatt DeVuyst // Calculate how much space we need for arg & env & auxv arrays. 1206650Sksewell@umich.edu int argv_array_size = intSize * (argv.size() + 1); 1216650Sksewell@umich.edu int envp_array_size = intSize * (envp.size() + 1); 1226811SMatt DeVuyst int auxv_array_size = intSize * 2 * (auxv.size() + 1); 1236811SMatt DeVuyst 1246650Sksewell@umich.edu int arg_data_size = 0; 1256650Sksewell@umich.edu for (vector<string>::size_type i = 0; i < argv.size(); ++i) { 1266650Sksewell@umich.edu arg_data_size += argv[i].size() + 1; 1276650Sksewell@umich.edu } 1286650Sksewell@umich.edu int env_data_size = 0; 1296650Sksewell@umich.edu for (vector<string>::size_type i = 0; i < envp.size(); ++i) { 1306650Sksewell@umich.edu env_data_size += envp[i].size() + 1; 1316650Sksewell@umich.edu } 1326650Sksewell@umich.edu 1336650Sksewell@umich.edu int space_needed = 1346811SMatt DeVuyst argv_array_size + 1356811SMatt DeVuyst envp_array_size + 1366811SMatt DeVuyst auxv_array_size + 1376811SMatt DeVuyst arg_data_size + 1386811SMatt DeVuyst env_data_size; 1396650Sksewell@umich.edu 1406650Sksewell@umich.edu // set bottom of stack 1416650Sksewell@umich.edu stack_min = stack_base - space_needed; 1426650Sksewell@umich.edu // align it 1436650Sksewell@umich.edu stack_min = roundDown(stack_min, pageSize); 1446650Sksewell@umich.edu stack_size = stack_base - stack_min; 1456650Sksewell@umich.edu // map memory 1468601Ssteve.reinhardt@amd.com allocateMem(stack_min, roundUp(stack_size, pageSize)); 1476650Sksewell@umich.edu 1486650Sksewell@umich.edu // map out initial stack contents 1496811SMatt DeVuyst IntType argv_array_base = stack_min + intSize; // room for argc 1506811SMatt DeVuyst IntType envp_array_base = argv_array_base + argv_array_size; 1516811SMatt DeVuyst IntType auxv_array_base = envp_array_base + envp_array_size; 1526811SMatt DeVuyst IntType arg_data_base = auxv_array_base + auxv_array_size; 1536811SMatt DeVuyst IntType env_data_base = arg_data_base + arg_data_size; 1546650Sksewell@umich.edu 1556650Sksewell@umich.edu // write contents to stack 1566811SMatt DeVuyst IntType argc = argv.size(); 1576650Sksewell@umich.edu 1586811SMatt DeVuyst argc = htog((IntType)argc); 1596650Sksewell@umich.edu 1608852Sandreas.hansson@arm.com initVirtMem.writeBlob(stack_min, (uint8_t*)&argc, intSize); 1616650Sksewell@umich.edu 1626650Sksewell@umich.edu copyStringArray(argv, argv_array_base, arg_data_base, initVirtMem); 1636650Sksewell@umich.edu 1646650Sksewell@umich.edu copyStringArray(envp, envp_array_base, env_data_base, initVirtMem); 1656650Sksewell@umich.edu 1666811SMatt DeVuyst // Copy the aux vector 1676811SMatt DeVuyst for (typename vector<auxv_t>::size_type x = 0; x < auxv.size(); x++) { 1688852Sandreas.hansson@arm.com initVirtMem.writeBlob(auxv_array_base + x * 2 * intSize, 1696811SMatt DeVuyst (uint8_t*)&(auxv[x].a_type), intSize); 1708852Sandreas.hansson@arm.com initVirtMem.writeBlob(auxv_array_base + (x * 2 + 1) * intSize, 1716811SMatt DeVuyst (uint8_t*)&(auxv[x].a_val), intSize); 1726811SMatt DeVuyst } 1736811SMatt DeVuyst 1746811SMatt DeVuyst // Write out the terminating zeroed auxilliary vector 1756811SMatt DeVuyst for (unsigned i = 0; i < 2; i++) { 1766811SMatt DeVuyst const IntType zero = 0; 1776811SMatt DeVuyst const Addr addr = auxv_array_base + 2 * intSize * (auxv.size() + i); 1788852Sandreas.hansson@arm.com initVirtMem.writeBlob(addr, (uint8_t*)&zero, intSize); 1796811SMatt DeVuyst } 1806811SMatt DeVuyst 1816650Sksewell@umich.edu ThreadContext *tc = system->getThreadContext(contextIds[0]); 1826650Sksewell@umich.edu 1836650Sksewell@umich.edu setSyscallArg(tc, 0, argc); 1846650Sksewell@umich.edu setSyscallArg(tc, 1, argv_array_base); 1856650Sksewell@umich.edu tc->setIntReg(StackPointerReg, stack_min); 1866650Sksewell@umich.edu 18711389Sbrandon.potter@amd.com tc->pcState(getStartPC()); 1886650Sksewell@umich.edu} 1896650Sksewell@umich.edu 1906650Sksewell@umich.edu 1915958Sgblack@eecs.umich.eduMipsISA::IntReg 1926701Sgblack@eecs.umich.eduMipsLiveProcess::getSyscallArg(ThreadContext *tc, int &i) 1935958Sgblack@eecs.umich.edu{ 1945958Sgblack@eecs.umich.edu assert(i < 6); 1956701Sgblack@eecs.umich.edu return tc->readIntReg(FirstArgumentReg + i++); 1965958Sgblack@eecs.umich.edu} 1975958Sgblack@eecs.umich.edu 1985958Sgblack@eecs.umich.eduvoid 1995958Sgblack@eecs.umich.eduMipsLiveProcess::setSyscallArg(ThreadContext *tc, 2005958Sgblack@eecs.umich.edu int i, MipsISA::IntReg val) 2015958Sgblack@eecs.umich.edu{ 2025958Sgblack@eecs.umich.edu assert(i < 6); 2035958Sgblack@eecs.umich.edu tc->setIntReg(FirstArgumentReg + i, val); 2045958Sgblack@eecs.umich.edu} 2055958Sgblack@eecs.umich.edu 2065958Sgblack@eecs.umich.eduvoid 20710223Ssteve.reinhardt@amd.comMipsLiveProcess::setSyscallReturn(ThreadContext *tc, SyscallReturn sysret) 2085958Sgblack@eecs.umich.edu{ 20910223Ssteve.reinhardt@amd.com if (sysret.successful()) { 2105958Sgblack@eecs.umich.edu // no error 2115958Sgblack@eecs.umich.edu tc->setIntReg(SyscallSuccessReg, 0); 21210223Ssteve.reinhardt@amd.com tc->setIntReg(ReturnValueReg, sysret.returnValue()); 2135958Sgblack@eecs.umich.edu } else { 2145958Sgblack@eecs.umich.edu // got an error, return details 2155958Sgblack@eecs.umich.edu tc->setIntReg(SyscallSuccessReg, (IntReg) -1); 21610223Ssteve.reinhardt@amd.com tc->setIntReg(ReturnValueReg, sysret.errnoValue()); 2175958Sgblack@eecs.umich.edu } 2185958Sgblack@eecs.umich.edu} 219