2 * Copyright (c) 2004-2005 The Regents of The University of Michigan
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.
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.
33 #include "arch/mips/process.hh"
35 #include "arch/mips/isa_traits.hh"
36 #include "base/loader/elf_object.hh"
37 #include "base/loader/object_file.hh"
38 #include "base/misc.hh"
39 #include "cpu/thread_context.hh"
40 #include "debug/Loader.hh"
41 #include "mem/page_table.hh"
42 #include "sim/process.hh"
43 #include "sim/process_impl.hh"
44 #include "sim/system.hh"
47 using namespace MipsISA
;
49 MipsLiveProcess::MipsLiveProcess(LiveProcessParams
* params
,
51 : LiveProcess(params
, objFile
)
53 // Set up stack. On MIPS, stack starts at the top of kuseg
54 // user address space. MIPS stack grows down from here
55 stack_base
= 0x7FFFFFFF;
57 // Set pointer for next thread stack. Reserve 8M for main stack.
58 next_thread_stack_base
= stack_base
- (8 * 1024 * 1024);
60 // Set up break point (Top of Heap)
61 brk_point
= objFile
->dataBase() + objFile
->dataSize() + objFile
->bssSize();
62 brk_point
= roundUp(brk_point
, PageBytes
);
64 // Set up region for mmaps. Start it 1GB above the top of the heap.
65 mmap_end
= brk_point
+ 0x40000000L
;
69 MipsLiveProcess::initState()
71 LiveProcess::initState();
73 argsInit
<uint32_t>(PageBytes
);
76 template<class IntType
>
78 MipsLiveProcess::argsInit(int pageSize
)
80 int intSize
= sizeof(IntType
);
82 // Patch the ld_bias for dynamic executables.
85 // load object file into target memory
86 objFile
->loadSections(initVirtMem
);
88 typedef AuxVector
<IntType
> auxv_t
;
89 std::vector
<auxv_t
> auxv
;
91 ElfObject
* elfObject
= dynamic_cast<ElfObject
*>(objFile
);
94 // Set the system page size
95 auxv
.push_back(auxv_t(M5_AT_PAGESZ
, MipsISA::PageBytes
));
96 // Set the frequency at which time() increments
97 auxv
.push_back(auxv_t(M5_AT_CLKTCK
, 100));
98 // For statically linked executables, this is the virtual
99 // address of the program header tables if they appear in the
101 auxv
.push_back(auxv_t(M5_AT_PHDR
, elfObject
->programHeaderTable()));
102 DPRINTF(Loader
, "auxv at PHDR %08p\n", elfObject
->programHeaderTable());
103 // This is the size of a program header entry from the elf file.
104 auxv
.push_back(auxv_t(M5_AT_PHENT
, elfObject
->programHeaderSize()));
105 // This is the number of program headers from the original elf file.
106 auxv
.push_back(auxv_t(M5_AT_PHNUM
, elfObject
->programHeaderCount()));
107 // This is the base address of the ELF interpreter; it should be
108 // zero for static executables or contain the base address for
109 // dynamic executables.
110 auxv
.push_back(auxv_t(M5_AT_BASE
, getBias()));
111 //The entry point to the program
112 auxv
.push_back(auxv_t(M5_AT_ENTRY
, objFile
->entryPoint()));
113 //Different user and group IDs
114 auxv
.push_back(auxv_t(M5_AT_UID
, uid()));
115 auxv
.push_back(auxv_t(M5_AT_EUID
, euid()));
116 auxv
.push_back(auxv_t(M5_AT_GID
, gid()));
117 auxv
.push_back(auxv_t(M5_AT_EGID
, egid()));
120 // Calculate how much space we need for arg & env & auxv arrays.
121 int argv_array_size
= intSize
* (argv
.size() + 1);
122 int envp_array_size
= intSize
* (envp
.size() + 1);
123 int auxv_array_size
= intSize
* 2 * (auxv
.size() + 1);
125 int arg_data_size
= 0;
126 for (vector
<string
>::size_type i
= 0; i
< argv
.size(); ++i
) {
127 arg_data_size
+= argv
[i
].size() + 1;
129 int env_data_size
= 0;
130 for (vector
<string
>::size_type i
= 0; i
< envp
.size(); ++i
) {
131 env_data_size
+= envp
[i
].size() + 1;
141 // set bottom of stack
142 stack_min
= stack_base
- space_needed
;
144 stack_min
= roundDown(stack_min
, pageSize
);
145 stack_size
= stack_base
- stack_min
;
147 allocateMem(stack_min
, roundUp(stack_size
, pageSize
));
149 // map out initial stack contents
150 IntType argv_array_base
= stack_min
+ intSize
; // room for argc
151 IntType envp_array_base
= argv_array_base
+ argv_array_size
;
152 IntType auxv_array_base
= envp_array_base
+ envp_array_size
;
153 IntType arg_data_base
= auxv_array_base
+ auxv_array_size
;
154 IntType env_data_base
= arg_data_base
+ arg_data_size
;
156 // write contents to stack
157 IntType argc
= argv
.size();
159 argc
= htog((IntType
)argc
);
161 initVirtMem
.writeBlob(stack_min
, (uint8_t*)&argc
, intSize
);
163 copyStringArray(argv
, argv_array_base
, arg_data_base
, initVirtMem
);
165 copyStringArray(envp
, envp_array_base
, env_data_base
, initVirtMem
);
167 // Copy the aux vector
168 for (typename vector
<auxv_t
>::size_type x
= 0; x
< auxv
.size(); x
++) {
169 initVirtMem
.writeBlob(auxv_array_base
+ x
* 2 * intSize
,
170 (uint8_t*)&(auxv
[x
].a_type
), intSize
);
171 initVirtMem
.writeBlob(auxv_array_base
+ (x
* 2 + 1) * intSize
,
172 (uint8_t*)&(auxv
[x
].a_val
), intSize
);
175 // Write out the terminating zeroed auxilliary vector
176 for (unsigned i
= 0; i
< 2; i
++) {
177 const IntType zero
= 0;
178 const Addr addr
= auxv_array_base
+ 2 * intSize
* (auxv
.size() + i
);
179 initVirtMem
.writeBlob(addr
, (uint8_t*)&zero
, intSize
);
182 ThreadContext
*tc
= system
->getThreadContext(contextIds
[0]);
184 setSyscallArg(tc
, 0, argc
);
185 setSyscallArg(tc
, 1, argv_array_base
);
186 tc
->setIntReg(StackPointerReg
, stack_min
);
188 tc
->pcState(getStartPC());
193 MipsLiveProcess::getSyscallArg(ThreadContext
*tc
, int &i
)
196 return tc
->readIntReg(FirstArgumentReg
+ i
++);
200 MipsLiveProcess::setSyscallArg(ThreadContext
*tc
,
201 int i
, MipsISA::IntReg val
)
204 tc
->setIntReg(FirstArgumentReg
+ i
, val
);
208 MipsLiveProcess::setSyscallReturn(ThreadContext
*tc
, SyscallReturn sysret
)
210 if (sysret
.successful()) {
212 tc
->setIntReg(SyscallSuccessReg
, 0);
213 tc
->setIntReg(ReturnValueReg
, sysret
.returnValue());
215 // got an error, return details
216 tc
->setIntReg(SyscallSuccessReg
, (IntReg
) -1);
217 tc
->setIntReg(ReturnValueReg
, sysret
.errnoValue());