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 SPARC Linux, stack goes from the top of memory
126 // downward, less the hole for the kernel address space.
127 stack_base = (Addr)0x80000000000ULL;
128
129 // Set up region for mmaps. Tru64 seems to start just above 0 and
130 // grow up from there.
131 mmap_start = mmap_end = 0xfffff80000000000ULL;
132}
133
134void X86LiveProcess::handleTrap(int trapNum, ThreadContext *tc)
135{
136 switch(trapNum)
137 {
138 default:
139 panic("Unimplemented trap to operating system: trap number %#x.\n", trapNum);
140 }
141}
142
143void
144X86LiveProcess::startup()
145{
146 argsInit(sizeof(IntReg), VMPageSize);
147
148 //The AMD64 abi says that only rsp and rdx are defined at process
149 //startup. rsp will be set by argsInit, and I don't understand what
150 //rdx should be set to. The other floating point and integer registers
151 //will be zeroed by the register file constructors, but control registers
152 //should be initialized here. Since none of those are implemented, there
153 //isn't anything here.
154}
155
156void
157X86LiveProcess::argsInit(int intSize, int pageSize)
158{
159 typedef M5_64_auxv_t auxv_t;
160 Process::startup();
161
162 string filename;
163 if(argv.size() < 1)
164 filename = "";
165 else
166 filename = argv[0];
167
168 Addr alignmentMask = ~(intSize - 1);
169
170 // load object file into target memory
171 objFile->loadSections(initVirtMem);
172
173 //These are the auxilliary vector types
174 enum auxTypes
175 {
176 X86_AT_NULL = 0,
177 X86_AT_IGNORE = 1,
178 X86_AT_EXECFD = 2,
179 X86_AT_PHDR = 3,
180 X86_AT_PHENT = 4,
181 X86_AT_PHNUM = 5,
182 X86_AT_PAGESZ = 6,
183 X86_AT_BASE = 7,
184 X86_AT_FLAGS = 8,
185 X86_AT_ENTRY = 9,
186 X86_AT_NOTELF = 10,
187 X86_AT_UID = 11,
188 X86_AT_EUID = 12,
189 X86_AT_GID = 13,
190 X86_AT_EGID = 14
191 };
192
193 //Setup the auxilliary vectors. These will already have endian conversion.
194 //Auxilliary vectors are loaded only for elf formatted executables.
195 ElfObject * elfObject = dynamic_cast<ElfObject *>(objFile);
196 if(elfObject)
197 {
198 /*
199 //Bits which describe the system hardware capabilities
200 auxv.push_back(auxv_t(SPARC_AT_HWCAP, hwcap));
201 //The system page size
202 auxv.push_back(auxv_t(SPARC_AT_PAGESZ, SparcISA::VMPageSize));
203 //Defined to be 100 in the kernel source.
204 //Frequency at which times() increments
205 auxv.push_back(auxv_t(SPARC_AT_CLKTCK, 100));
206 // For statically linked executables, this is the virtual address of the
207 // program header tables if they appear in the executable image
208 auxv.push_back(auxv_t(SPARC_AT_PHDR, elfObject->programHeaderTable()));
209 // This is the size of a program header entry from the elf file.
210 auxv.push_back(auxv_t(SPARC_AT_PHENT, elfObject->programHeaderSize()));
211 // This is the number of program headers from the original elf file.
212 auxv.push_back(auxv_t(SPARC_AT_PHNUM, elfObject->programHeaderCount()));
213 //This is the address of the elf "interpreter", It should be set
214 //to 0 for regular executables. It should be something else
215 //(not sure what) for dynamic libraries.
216 auxv.push_back(auxv_t(SPARC_AT_BASE, 0));
217 //This is hardwired to 0 in the elf loading code in the kernel
218 auxv.push_back(auxv_t(SPARC_AT_FLAGS, 0));
219 //The entry point to the program
220 auxv.push_back(auxv_t(SPARC_AT_ENTRY, objFile->entryPoint()));
221 //Different user and group IDs
222 auxv.push_back(auxv_t(SPARC_AT_UID, uid()));
223 auxv.push_back(auxv_t(SPARC_AT_EUID, euid()));
224 auxv.push_back(auxv_t(SPARC_AT_GID, gid()));
225 auxv.push_back(auxv_t(SPARC_AT_EGID, egid()));
226 //Whether to enable "secure mode" in the executable
227 auxv.push_back(auxv_t(SPARC_AT_SECURE, 0));*/
228 }
229
230 //Figure out how big the initial stack needs to be
231
232 // The unaccounted for 0 at the top of the stack
233 int mysterious_size = intSize;
234
235 //This is the name of the file which is present on the initial stack
236 //It's purpose is to let the user space linker examine the original file.
237 int file_name_size = filename.size() + 1;
238
239 int env_data_size = 0;
240 for (int i = 0; i < envp.size(); ++i) {
241 env_data_size += envp[i].size() + 1;
242 }
243 int arg_data_size = 0;
244 for (int i = 0; i < argv.size(); ++i) {
245 arg_data_size += argv[i].size() + 1;
246 }
247
248 //The info_block needs to be padded so it's size is a multiple of the
249 //alignment mask. Also, it appears that there needs to be at least some
250 //padding, so if the size is already a multiple, we need to increase it
251 //anyway.
252 int info_block_size =
253 (file_name_size +
254 env_data_size +
255 arg_data_size +
256 intSize) & alignmentMask;
257
258 int info_block_padding =
259 info_block_size -
260 file_name_size -
261 env_data_size -
262 arg_data_size;
263
264 //Each auxilliary vector is two 8 byte words
265 int aux_array_size = intSize * 2 * (auxv.size() + 1);
266
267 int envp_array_size = intSize * (envp.size() + 1);
268 int argv_array_size = intSize * (argv.size() + 1);
269
270 int argc_size = intSize;
| 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 SPARC Linux, stack goes from the top of memory
126 // downward, less the hole for the kernel address space.
127 stack_base = (Addr)0x80000000000ULL;
128
129 // Set up region for mmaps. Tru64 seems to start just above 0 and
130 // grow up from there.
131 mmap_start = mmap_end = 0xfffff80000000000ULL;
132}
133
134void X86LiveProcess::handleTrap(int trapNum, ThreadContext *tc)
135{
136 switch(trapNum)
137 {
138 default:
139 panic("Unimplemented trap to operating system: trap number %#x.\n", trapNum);
140 }
141}
142
143void
144X86LiveProcess::startup()
145{
146 argsInit(sizeof(IntReg), VMPageSize);
147
148 //The AMD64 abi says that only rsp and rdx are defined at process
149 //startup. rsp will be set by argsInit, and I don't understand what
150 //rdx should be set to. The other floating point and integer registers
151 //will be zeroed by the register file constructors, but control registers
152 //should be initialized here. Since none of those are implemented, there
153 //isn't anything here.
154}
155
156void
157X86LiveProcess::argsInit(int intSize, int pageSize)
158{
159 typedef M5_64_auxv_t auxv_t;
160 Process::startup();
161
162 string filename;
163 if(argv.size() < 1)
164 filename = "";
165 else
166 filename = argv[0];
167
168 Addr alignmentMask = ~(intSize - 1);
169
170 // load object file into target memory
171 objFile->loadSections(initVirtMem);
172
173 //These are the auxilliary vector types
174 enum auxTypes
175 {
176 X86_AT_NULL = 0,
177 X86_AT_IGNORE = 1,
178 X86_AT_EXECFD = 2,
179 X86_AT_PHDR = 3,
180 X86_AT_PHENT = 4,
181 X86_AT_PHNUM = 5,
182 X86_AT_PAGESZ = 6,
183 X86_AT_BASE = 7,
184 X86_AT_FLAGS = 8,
185 X86_AT_ENTRY = 9,
186 X86_AT_NOTELF = 10,
187 X86_AT_UID = 11,
188 X86_AT_EUID = 12,
189 X86_AT_GID = 13,
190 X86_AT_EGID = 14
191 };
192
193 //Setup the auxilliary vectors. These will already have endian conversion.
194 //Auxilliary vectors are loaded only for elf formatted executables.
195 ElfObject * elfObject = dynamic_cast<ElfObject *>(objFile);
196 if(elfObject)
197 {
198 /*
199 //Bits which describe the system hardware capabilities
200 auxv.push_back(auxv_t(SPARC_AT_HWCAP, hwcap));
201 //The system page size
202 auxv.push_back(auxv_t(SPARC_AT_PAGESZ, SparcISA::VMPageSize));
203 //Defined to be 100 in the kernel source.
204 //Frequency at which times() increments
205 auxv.push_back(auxv_t(SPARC_AT_CLKTCK, 100));
206 // For statically linked executables, this is the virtual address of the
207 // program header tables if they appear in the executable image
208 auxv.push_back(auxv_t(SPARC_AT_PHDR, elfObject->programHeaderTable()));
209 // This is the size of a program header entry from the elf file.
210 auxv.push_back(auxv_t(SPARC_AT_PHENT, elfObject->programHeaderSize()));
211 // This is the number of program headers from the original elf file.
212 auxv.push_back(auxv_t(SPARC_AT_PHNUM, elfObject->programHeaderCount()));
213 //This is the address of the elf "interpreter", It should be set
214 //to 0 for regular executables. It should be something else
215 //(not sure what) for dynamic libraries.
216 auxv.push_back(auxv_t(SPARC_AT_BASE, 0));
217 //This is hardwired to 0 in the elf loading code in the kernel
218 auxv.push_back(auxv_t(SPARC_AT_FLAGS, 0));
219 //The entry point to the program
220 auxv.push_back(auxv_t(SPARC_AT_ENTRY, objFile->entryPoint()));
221 //Different user and group IDs
222 auxv.push_back(auxv_t(SPARC_AT_UID, uid()));
223 auxv.push_back(auxv_t(SPARC_AT_EUID, euid()));
224 auxv.push_back(auxv_t(SPARC_AT_GID, gid()));
225 auxv.push_back(auxv_t(SPARC_AT_EGID, egid()));
226 //Whether to enable "secure mode" in the executable
227 auxv.push_back(auxv_t(SPARC_AT_SECURE, 0));*/
228 }
229
230 //Figure out how big the initial stack needs to be
231
232 // The unaccounted for 0 at the top of the stack
233 int mysterious_size = intSize;
234
235 //This is the name of the file which is present on the initial stack
236 //It's purpose is to let the user space linker examine the original file.
237 int file_name_size = filename.size() + 1;
238
239 int env_data_size = 0;
240 for (int i = 0; i < envp.size(); ++i) {
241 env_data_size += envp[i].size() + 1;
242 }
243 int arg_data_size = 0;
244 for (int i = 0; i < argv.size(); ++i) {
245 arg_data_size += argv[i].size() + 1;
246 }
247
248 //The info_block needs to be padded so it's size is a multiple of the
249 //alignment mask. Also, it appears that there needs to be at least some
250 //padding, so if the size is already a multiple, we need to increase it
251 //anyway.
252 int info_block_size =
253 (file_name_size +
254 env_data_size +
255 arg_data_size +
256 intSize) & alignmentMask;
257
258 int info_block_padding =
259 info_block_size -
260 file_name_size -
261 env_data_size -
262 arg_data_size;
263
264 //Each auxilliary vector is two 8 byte words
265 int aux_array_size = intSize * 2 * (auxv.size() + 1);
266
267 int envp_array_size = intSize * (envp.size() + 1);
268 int argv_array_size = intSize * (argv.size() + 1);
269
270 int argc_size = intSize;
|
313 DPRINTF(X86, "0x%x - stack min\n", stack_min);
314
315 // write contents to stack
316
317 // figure out argc
318 uint64_t argc = argv.size();
319 uint64_t guestArgc = TheISA::htog(argc);
320
321 //Write out the mysterious 0
322 uint64_t mysterious_zero = 0;
323 initVirtMem->writeBlob(mysterious_base,
324 (uint8_t*)&mysterious_zero, mysterious_size);
325
326 //Write the file name
327 initVirtMem->writeString(file_name_base, filename.c_str());
328
329 //Copy the aux stuff
330 for(int x = 0; x < auxv.size(); x++)
331 {
332 initVirtMem->writeBlob(auxv_array_base + x * 2 * intSize,
333 (uint8_t*)&(auxv[x].a_type), intSize);
334 initVirtMem->writeBlob(auxv_array_base + (x * 2 + 1) * intSize,
335 (uint8_t*)&(auxv[x].a_val), intSize);
336 }
337 //Write out the terminating zeroed auxilliary vector
338 const uint64_t zero = 0;
339 initVirtMem->writeBlob(auxv_array_base + 2 * intSize * auxv.size(),
340 (uint8_t*)&zero, 2 * intSize);
341
342 copyStringArray(envp, envp_array_base, env_data_base, initVirtMem);
343 copyStringArray(argv, argv_array_base, arg_data_base, initVirtMem);
344
345 initVirtMem->writeBlob(argc_base, (uint8_t*)&guestArgc, intSize);
346
347 //Set up the thread context to start running the process
348 threadContexts[0]->setIntReg(ArgumentReg0, argc);
349 threadContexts[0]->setIntReg(ArgumentReg1, argv_array_base);
350 threadContexts[0]->setIntReg(StackPointerReg, stack_min);
351
352 Addr prog_entry = objFile->entryPoint();
353 threadContexts[0]->setPC(prog_entry);
354 threadContexts[0]->setNextPC(prog_entry + sizeof(MachInst));
355
356 //Align the "stack_min" to a page boundary.
357 stack_min = roundDown(stack_min, pageSize);
358
359// num_processes++;
360}
| 306 DPRINTF(X86, "0x%x - stack min\n", stack_min);
307
308 // write contents to stack
309
310 // figure out argc
311 uint64_t argc = argv.size();
312 uint64_t guestArgc = TheISA::htog(argc);
313
314 //Write out the mysterious 0
315 uint64_t mysterious_zero = 0;
316 initVirtMem->writeBlob(mysterious_base,
317 (uint8_t*)&mysterious_zero, mysterious_size);
318
319 //Write the file name
320 initVirtMem->writeString(file_name_base, filename.c_str());
321
322 //Copy the aux stuff
323 for(int x = 0; x < auxv.size(); x++)
324 {
325 initVirtMem->writeBlob(auxv_array_base + x * 2 * intSize,
326 (uint8_t*)&(auxv[x].a_type), intSize);
327 initVirtMem->writeBlob(auxv_array_base + (x * 2 + 1) * intSize,
328 (uint8_t*)&(auxv[x].a_val), intSize);
329 }
330 //Write out the terminating zeroed auxilliary vector
331 const uint64_t zero = 0;
332 initVirtMem->writeBlob(auxv_array_base + 2 * intSize * auxv.size(),
333 (uint8_t*)&zero, 2 * intSize);
334
335 copyStringArray(envp, envp_array_base, env_data_base, initVirtMem);
336 copyStringArray(argv, argv_array_base, arg_data_base, initVirtMem);
337
338 initVirtMem->writeBlob(argc_base, (uint8_t*)&guestArgc, intSize);
339
340 //Set up the thread context to start running the process
341 threadContexts[0]->setIntReg(ArgumentReg0, argc);
342 threadContexts[0]->setIntReg(ArgumentReg1, argv_array_base);
343 threadContexts[0]->setIntReg(StackPointerReg, stack_min);
344
345 Addr prog_entry = objFile->entryPoint();
346 threadContexts[0]->setPC(prog_entry);
347 threadContexts[0]->setNextPC(prog_entry + sizeof(MachInst));
348
349 //Align the "stack_min" to a page boundary.
350 stack_min = roundDown(stack_min, pageSize);
351
352// num_processes++;
353}
|