v7stanford.edu-Linkers_and_Dynamic_Linking

v7stanford.edu-Linkers_and_Dynamic_Linking - Linkers and...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
http://w w w .stanford.edu/~ouster/cgi-bin/cs140-w inter12/lecture.php?topic=linkers January 11, 2012 Linkers and Dynamic Linking Linkers and Dynamic Linking Lecture Notes for CS 140 Winter 2012 John Ousterhout Readings for this topic from Operating System Concepts : none. When a process is running, what does its memory look like? A collection of regions called sections . Basic memory layout for Linux and other Unix systems: Code (or "text" in Unix terminology): starts at location 0 Data: starts immediately above code, grows upward Stack: starts at highest address, grows downward System components that take part in managing a process's memory: Compiler and assembler: Generate one object file for each source code file containing information for that source file. Information is incomplete, since each source file generally references some things defined in other source files. Linker: Combines all of the object files for one program into a single object file. Linker output is complete and self-sufficient. Operating system: Loads object files into memory. Allows several different processes to share memory at once. Provides facilities for processes to get more memory after they've started running. Run-time library:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

v7stanford.edu-Linkers_and_Dynamic_Linking - Linkers and...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online