process.cc revision 4786:47d848a9ccd9
1/* 2 * Copyright (c) 2003-2006 The Regents of The University of Michigan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution; 12 * neither the name of the copyright holders nor the names of its 13 * contributors may be used to endorse or promote products derived from 14 * this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 * 28 * Authors: Gabe Black 29 * Ali Saidi 30 */ 31 32/* 33 * Copyright (c) 2007 The Hewlett-Packard Development Company 34 * All rights reserved. 35 * 36 * Redistribution and use of this software in source and binary forms, 37 * with or without modification, are permitted provided that the 38 * following conditions are met: 39 * 40 * The software must be used only for Non-Commercial Use which means any 41 * use which is NOT directed to receiving any direct monetary 42 * compensation for, or commercial advantage from such use. Illustrative 43 * examples of non-commercial use are academic research, personal study, 44 * teaching, education and corporate research & development. 45 * Illustrative examples of commercial use are distributing products for 46 * commercial advantage and providing services using the software for 47 * commercial advantage. 48 * 49 * If you wish to use this software or functionality therein that may be 50 * covered by patents for commercial use, please contact: 51 * Director of Intellectual Property Licensing 52 * Office of Strategy and Technology 53 * Hewlett-Packard Company 54 * 1501 Page Mill Road 55 * Palo Alto, California 94304 56 * 57 * Redistributions of source code must retain the above copyright notice, 58 * this list of conditions and the following disclaimer. Redistributions 59 * in binary form must reproduce the above copyright notice, this list of 60 * conditions and the following disclaimer in the documentation and/or 61 * other materials provided with the distribution. Neither the name of 62 * the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its 63 * contributors may be used to endorse or promote products derived from 64 * this software without specific prior written permission. No right of 65 * sublicense is granted herewith. Derivatives of the software and 66 * output created using the software may be prepared, but only for 67 * Non-Commercial Uses. Derivatives of the software may be shared with 68 * others provided: (i) the others agree to abide by the list of 69 * conditions herein which includes the Non-Commercial Use restrictions; 70 * and (ii) such Derivatives of the software include the above copyright 71 * notice to acknowledge the contribution from this software where 72 * applicable, this list of conditions and the disclaimer below. 73 * 74 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 75 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 76 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 77 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 78 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 79 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 80 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 81 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 82 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 83 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 84 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 85 * 86 * Authors: Gabe Black 87 */ 88 89#include "arch/x86/isa_traits.hh" 90#include "arch/x86/process.hh" 91#include "arch/x86/types.hh" 92#include "base/loader/object_file.hh" 93#include "base/loader/elf_object.hh" 94#include "base/misc.hh" 95#include "cpu/thread_context.hh" 96#include "mem/page_table.hh" 97#include "mem/translating_port.hh" 98#include "sim/process_impl.hh" 99#include "sim/system.hh" 100 101using namespace std; 102using namespace X86ISA; 103 104M5_64_auxv_t::M5_64_auxv_t(int64_t type, int64_t val) 105{ 106 a_type = TheISA::htog(type); 107 a_val = TheISA::htog(val); 108} 109 110X86LiveProcess::X86LiveProcess(const std::string &nm, ObjectFile *objFile, 111 System *_system, int stdin_fd, int stdout_fd, int stderr_fd, 112 std::vector<std::string> &argv, std::vector<std::string> &envp, 113 const std::string &cwd, 114 uint64_t _uid, uint64_t _euid, uint64_t _gid, uint64_t _egid, 115 uint64_t _pid, uint64_t _ppid) 116 : LiveProcess(nm, objFile, _system, stdin_fd, stdout_fd, stderr_fd, 117 argv, envp, cwd, _uid, _euid, _gid, _egid, _pid, _ppid) 118{ 119 brk_point = objFile->dataBase() + objFile->dataSize() + objFile->bssSize(); 120 brk_point = roundUp(brk_point, VMPageSize); 121 122 // Set pointer for next thread stack. Reserve 8M for main stack. 123 next_thread_stack_base = stack_base - (8 * 1024 * 1024); 124 125 // Set up stack. On X86_64 Linux, stack goes from the top of memory 126 // downward, less the hole for the kernel address space plus one page 127 // for undertermined purposes. 128 stack_base = (Addr)0x7FFFFFFF000ULL; 129 130 // Set up region for mmaps. Tru64 seems to start just above 0 and 131 // grow up from there. 132 mmap_start = mmap_end = 0xfffff80000000000ULL; 133} 134 135void X86LiveProcess::handleTrap(int trapNum, ThreadContext *tc) 136{ 137 switch(trapNum) 138 { 139 default: 140 panic("Unimplemented trap to operating system: trap number %#x.\n", trapNum); 141 } 142} 143 144void 145X86LiveProcess::startup() 146{ 147 argsInit(sizeof(IntReg), VMPageSize); 148 149 //The AMD64 abi says that only rsp and rdx are defined at process 150 //startup. rsp will be set by argsInit, and I don't understand what 151 //rdx should be set to. The other floating point and integer registers 152 //will be zeroed by the register file constructors, but control registers 153 //should be initialized here. Since none of those are implemented, there 154 //isn't anything here. 155} 156 157void 158X86LiveProcess::argsInit(int intSize, int pageSize) 159{ 160 typedef M5_64_auxv_t auxv_t; 161 Process::startup(); 162 163 string filename; 164 if(argv.size() < 1) 165 filename = ""; 166 else 167 filename = argv[0]; 168 169 Addr alignmentMask = ~(intSize - 1); 170 171 // load object file into target memory 172 objFile->loadSections(initVirtMem); 173 174 //These are the auxilliary vector types 175 enum auxTypes 176 { 177 X86_AT_NULL = 0, 178 X86_AT_IGNORE = 1, 179 X86_AT_EXECFD = 2, 180 X86_AT_PHDR = 3, 181 X86_AT_PHENT = 4, 182 X86_AT_PHNUM = 5, 183 X86_AT_PAGESZ = 6, 184 X86_AT_BASE = 7, 185 X86_AT_FLAGS = 8, 186 X86_AT_ENTRY = 9, 187 X86_AT_NOTELF = 10, 188 X86_AT_UID = 11, 189 X86_AT_EUID = 12, 190 X86_AT_GID = 13, 191 X86_AT_EGID = 14, 192 X86_AT_PLATFORM = 15, 193 X86_AT_HWCAP = 16, 194 X86_AT_CLKTCK = 17, 195 196 X86_AT_SECURE = 13, 197 198 X86_AT_VECTOR_SIZE = 44 199 }; 200 201 //Setup the auxilliary vectors. These will already have endian conversion. 202 //Auxilliary vectors are loaded only for elf formatted executables. 203 ElfObject * elfObject = dynamic_cast<ElfObject *>(objFile); 204 if(elfObject) 205 { 206 //Bits which describe the system hardware capabilities 207 //XXX Figure out what these should be 208 auxv.push_back(auxv_t(X86_AT_HWCAP, 0)); 209 //The system page size 210 auxv.push_back(auxv_t(X86_AT_PAGESZ, X86ISA::VMPageSize)); 211 //Frequency at which times() increments 212 auxv.push_back(auxv_t(X86_AT_CLKTCK, 100)); 213 // For statically linked executables, this is the virtual address of the 214 // program header tables if they appear in the executable image 215 auxv.push_back(auxv_t(X86_AT_PHDR, elfObject->programHeaderTable())); 216 // This is the size of a program header entry from the elf file. 217 auxv.push_back(auxv_t(X86_AT_PHENT, elfObject->programHeaderSize())); 218 // This is the number of program headers from the original elf file. 219 auxv.push_back(auxv_t(X86_AT_PHNUM, elfObject->programHeaderCount())); 220 //Defined to be 100 in the kernel source. 221 //This is the address of the elf "interpreter", It should be set 222 //to 0 for regular executables. It should be something else 223 //(not sure what) for dynamic libraries. 224 auxv.push_back(auxv_t(X86_AT_BASE, 0)); 225 226 //XXX Figure out what this should be. 227 auxv.push_back(auxv_t(X86_AT_FLAGS, 0)); 228 //The entry point to the program 229 auxv.push_back(auxv_t(X86_AT_ENTRY, objFile->entryPoint())); 230 //Different user and group IDs 231 auxv.push_back(auxv_t(X86_AT_UID, uid())); 232 auxv.push_back(auxv_t(X86_AT_EUID, euid())); 233 auxv.push_back(auxv_t(X86_AT_GID, gid())); 234 auxv.push_back(auxv_t(X86_AT_EGID, egid())); 235 //Whether to enable "secure mode" in the executable 236 auxv.push_back(auxv_t(X86_AT_SECURE, 0)); 237 //The string "x86_64" with unknown meaning 238 auxv.push_back(auxv_t(X86_AT_PLATFORM, 0)); 239 } 240 241 //Figure out how big the initial stack needs to be 242 243 // The unaccounted for 0 at the top of the stack 244 int mysterious_size = intSize; 245 246 //This is the name of the file which is present on the initial stack 247 //It's purpose is to let the user space linker examine the original file. 248 int file_name_size = filename.size() + 1; 249 250 int env_data_size = 0; 251 for (int i = 0; i < envp.size(); ++i) { 252 env_data_size += envp[i].size() + 1; 253 } 254 int arg_data_size = 0; 255 for (int i = 0; i < argv.size(); ++i) { 256 arg_data_size += argv[i].size() + 1; 257 } 258 259 //The info_block needs to be padded so it's size is a multiple of the 260 //alignment mask. Also, it appears that there needs to be at least some 261 //padding, so if the size is already a multiple, we need to increase it 262 //anyway. 263 int info_block_size = 264 (file_name_size + 265 env_data_size + 266 arg_data_size + 267 intSize) & alignmentMask; 268 269 int info_block_padding = 270 info_block_size - 271 file_name_size - 272 env_data_size - 273 arg_data_size; 274 275 //Each auxilliary vector is two 8 byte words 276 int aux_array_size = intSize * 2 * (auxv.size() + 1); 277 278 int envp_array_size = intSize * (envp.size() + 1); 279 int argv_array_size = intSize * (argv.size() + 1); 280 281 int argc_size = intSize; 282 283 int space_needed = 284 mysterious_size + 285 info_block_size + 286 aux_array_size + 287 envp_array_size + 288 argv_array_size + 289 argc_size; 290 291 stack_min = stack_base - space_needed; 292 stack_min &= alignmentMask; 293 stack_size = stack_base - stack_min; 294 295 // map memory 296 pTable->allocate(roundDown(stack_min, pageSize), 297 roundUp(stack_size, pageSize)); 298 299 // map out initial stack contents 300 Addr mysterious_base = stack_base - mysterious_size; 301 Addr file_name_base = mysterious_base - file_name_size; 302 Addr env_data_base = file_name_base - env_data_size; 303 Addr arg_data_base = env_data_base - arg_data_size; 304 Addr auxv_array_base = arg_data_base - aux_array_size - info_block_padding; 305 Addr envp_array_base = auxv_array_base - envp_array_size; 306 Addr argv_array_base = envp_array_base - argv_array_size; 307 Addr argc_base = argv_array_base - argc_size; 308 309 DPRINTF(X86, "The addresses of items on the initial stack:\n"); 310 DPRINTF(X86, "0x%x - file name\n", file_name_base); 311 DPRINTF(X86, "0x%x - env data\n", env_data_base); 312 DPRINTF(X86, "0x%x - arg data\n", arg_data_base); 313 DPRINTF(X86, "0x%x - auxv array\n", auxv_array_base); 314 DPRINTF(X86, "0x%x - envp array\n", envp_array_base); 315 DPRINTF(X86, "0x%x - argv array\n", argv_array_base); 316 DPRINTF(X86, "0x%x - argc \n", argc_base); 317 DPRINTF(X86, "0x%x - stack min\n", stack_min); 318 319 // write contents to stack 320 321 // figure out argc 322 uint64_t argc = argv.size(); 323 uint64_t guestArgc = TheISA::htog(argc); 324 325 //Write out the mysterious 0 326 uint64_t mysterious_zero = 0; 327 initVirtMem->writeBlob(mysterious_base, 328 (uint8_t*)&mysterious_zero, mysterious_size); 329 330 //Write the file name 331 initVirtMem->writeString(file_name_base, filename.c_str()); 332 333 //Copy the aux stuff 334 for(int x = 0; x < auxv.size(); x++) 335 { 336 initVirtMem->writeBlob(auxv_array_base + x * 2 * intSize, 337 (uint8_t*)&(auxv[x].a_type), intSize); 338 initVirtMem->writeBlob(auxv_array_base + (x * 2 + 1) * intSize, 339 (uint8_t*)&(auxv[x].a_val), intSize); 340 } 341 //Write out the terminating zeroed auxilliary vector 342 const uint64_t zero = 0; 343 initVirtMem->writeBlob(auxv_array_base + 2 * intSize * auxv.size(), 344 (uint8_t*)&zero, 2 * intSize); 345 346 copyStringArray(envp, envp_array_base, env_data_base, initVirtMem); 347 copyStringArray(argv, argv_array_base, arg_data_base, initVirtMem); 348 349 initVirtMem->writeBlob(argc_base, (uint8_t*)&guestArgc, intSize); 350 351 //Set up the thread context to start running the process 352 threadContexts[0]->setIntReg(StackPointerReg, stack_min); 353 354 Addr prog_entry = objFile->entryPoint(); 355 threadContexts[0]->setPC(prog_entry); 356 threadContexts[0]->setNextPC(prog_entry + sizeof(MachInst)); 357 358 //Align the "stack_min" to a page boundary. 359 stack_min = roundDown(stack_min, pageSize); 360 361// num_processes++; 362} 363