Linking. Today. Next time. Static linking Object files Static & dynamically linked libraries. Exceptional control flows

Similar documents
Example C Program The course that gives CMU its Zip! Linking March 2, Static Linking. Why Linkers? Page # Topics

Linking February 24, 2005

Lecture 16: Linking Computer Architecture and Systems Programming ( )

LINKING. Jo, Heeseung

Systems Programming and Computer Architecture ( ) Timothy Roscoe

Example C program. 11: Linking. Why linkers? Modularity! Static linking. Why linkers? Efficiency! What do linkers do? 10/28/2013

A Simplistic Program Translation Scheme

Linking Oct. 15, 2002

CSE 2421: Systems I Low-Level Programming and Computer Organization. Linking. Presentation N. Introduction to Linkers

Example C Program. Linking CS Instructor: Sanjeev Se(a. int buf[2] = {1, 2}; extern int buf[]; int main() { swap(); return 0; }

Computer Organization: A Programmer's Perspective

Systems I. Linking II

Computer Systems. Linking. Han, Hwansoo

Exercise Session 7 Computer Architecture and Systems Programming

E = 2 e lines per set. S = 2 s sets tag. valid bit B = 2 b bytes per cache block (the data) CSE351 Inaugural EdiNon Spring

Linking. Computer Systems Organization (Spring 2017) CSCI-UA 201, Section 3. Instructor: Joanna Klukowska

Linking Oct. 26, 2009"

CS429: Computer Organization and Architecture

Relocating Symbols and Resolving External References. CS429: Computer Organization and Architecture. m.o Relocation Info

CS 201 Linking Gerson Robboy Portland State University

Linker Puzzles The course that gives CMU its Zip! Linking Mar 4, A Simplistic Program Translation Scheme. A Better Scheme Using a Linker

Outline. 1 Background. 2 ELF Linking. 3 Static Linking. 4 Dynamic Linking. 5 Summary. Linker. Various Stages. 1 Linking can be done at compile.

Linking and Loading. CS61, Lecture 16. Prof. Stephen Chong October 25, 2011

Revealing Internals of Linkers. Zhiqiang Lin

Lecture 12-13: Linking

Sungkyunkwan University

(Extract from the slides by Terrance E. Boult

CSE2421 Systems1 Introduction to Low-Level Programming and Computer Organization

Link 7. Static Linking

Systemprogrammering och operativsystem Laborationer. Linker Puzzles. Systemprogrammering 2007 Föreläsning 1 Compilation and Linking

CS241 Computer Organization Spring Buffer Overflow

u Linking u Case study: Library interpositioning

Link 4. Relocation. Young W. Lim Thr. Young W. Lim Link 4. Relocation Thr 1 / 26

Link 4. Relocation. Young W. Lim Wed. Young W. Lim Link 4. Relocation Wed 1 / 22

A SimplisHc Program TranslaHon Scheme. TranslaHng the Example Program. Example C Program. Why Linkers? - Modularity. Linking

COMPILING OBJECTS AND OTHER LANGUAGE IMPLEMENTATION ISSUES. Credit: Mostly Bryant & O Hallaron

Link 7.A Static Linking

Link 7. Dynamic Linking

Link 8.A Dynamic Linking

Linking. Explain what ELF format is. Explain what an executable is and how it got that way. With huge thanks to Steve Chong for his notes from CS61.

Today. Linking. Example C Program. Sta7c Linking. Linking Case study: Library interposi7oning

Link 3. Symbols. Young W. Lim Mon. Young W. Lim Link 3. Symbols Mon 1 / 42

Link 2. Object Files

Link 2. Object Files

CS 550 Operating Systems Spring Process I

Carnegie Mellon. Bryant and O Hallaron, Computer Systems: A Programmer s Perspective, Third Edition

Linking. CS 485 Systems Programming Fall Instructor: James Griffioen

Generating Programs and Linking. Professor Rick Han Department of Computer Science University of Colorado at Boulder

Link 8. Dynamic Linking

Link 4. Relocation. Young W. Lim Sat. Young W. Lim Link 4. Relocation Sat 1 / 33

Executables and Linking. CS449 Spring 2016

Link 4. Relocation. Young W. Lim Tue. Young W. Lim Link 4. Relocation Tue 1 / 38

Link 4. Relocation. Young W. Lim Mon. Young W. Lim Link 4. Relocation Mon 1 / 35

238P: Operating Systems. Lecture 7: Basic Architecture of a Program. Anton Burtsev January, 2018

Executables and Linking. CS449 Fall 2017

Link 4. Relocation. Young W. Lim Thr. Young W. Lim Link 4. Relocation Thr 1 / 48

Linking : Introduc on to Computer Systems 13 th Lecture, October 11th, Instructor: Randy Bryant. Carnegie Mellon

Computer Systems Organization

Compiler Drivers = GCC

Link Edits and Relocatable Code

Binghamton University. CS-220 Spring Loading Code. Computer Systems Chapter 7.5, 7.8, 7.9

CIT 595 Spring System Software: Programming Tools. Assembly Process Example: First Pass. Assembly Process Example: Second Pass.

Systemprogrammering och operativsystem Linker Puzzles. Systemprogrammering 2009 Före lä s n in g 1 Compilation and Linking

Introduction Presentation A

Linkers and Loaders. CS 167 VI 1 Copyright 2008 Thomas W. Doeppner. All rights reserved.

CS 33. Linkers. CS33 Intro to Computer Systems XXV 1 Copyright 2017 Thomas W. Doeppner. All rights reserved.

Assembly Programmer s View Lecture 4A Machine-Level Programming I: Introduction

A software view. Computer Systems. The Compilation system. How it works. 1. Preprocesser. 1. Preprocessor (cpp)

CS 3214 Computer Systems. Do not start the test until instructed to do so! printed

An Experience Like No Other. Stack Discipline Aug. 30, 2006

CS , Fall 2001 Exam 1

Assembly I: Basic Operations. Jo, Heeseung

Turning C into Object Code Code in files p1.c p2.c Compile with command: gcc -O p1.c p2.c -o p Use optimizations (-O) Put resulting binary in file p

1 /* file cpuid2.s */ 4.asciz "The processor Vendor ID is %s \n" 5.section.bss. 6.lcomm buffer, section.text. 8.globl _start.

CSC 2400: Computing Systems. X86 Assembly: Function Calls

Midterm. Median: 56, Mean: "midterm.data" using 1:2 1 / 37

ASSEMBLY I: BASIC OPERATIONS. Jo, Heeseung

Machine Language, Assemblers and Linkers"

Lecture 8: linking CS 140. Dawson Engler Stanford CS department

ELF (1A) Young Won Lim 10/22/14

Process Environment. Pradipta De

Full Name: CISC 360, Fall 2008 Example of Exam

Comp 524 Spring 2009 Exercise 1 Solutions Due in class (on paper) at 3:30 PM, January 29, 2009.

Memory and C/C++ modules

CS , Fall 2002 Exam 1

Introduction to Computer Systems , fall th Lecture, Sep. 28 th

Stack Discipline Jan. 19, 2018

Overview REWARDS TIE HOWARD Summary CS 6V Data Structure Reverse Engineering. Zhiqiang Lin

CSL373: Operating Systems Linking

CS , Spring 2004 Exam 1

CSC 405 Computer Security Shellcode

Machine Programming 1: Introduction

Is stack overflow still a problem?

Machine-Level Programming I: Introduction Jan. 30, 2001

Lecture 2 Assembly Language

CS165 Computer Security. Understanding low-level program execution Oct 1 st, 2015

CSC 2400: Computing Systems. X86 Assembly: Function Calls"

Systems I. Machine-Level Programming I: Introduction

ECE 598 Advanced Operating Systems Lecture 10

CS , Fall 2004 Exam 1

Transcription:

Linking Today Static linking Object files Static & dynamically linked libraries Next time Exceptional control flows Fabián E. Bustamante, 2007

Example C program main.c void swap(); int buf[2] = {1, 2; int main() { swap(); return 0; swap.c extern int buf[]; int *bufp0 = &buf[0]; int *bufp1; void swap() { int temp; bufp1 = &buf[1]; temp = *bufp0; *bufp0 = *bufp1; *bufp1 = temp; 2

Building an executable from multiple files Programs are translated and linked using a compiler driver Compiler driver coordinates all steps in the translation and linking process. Typically included with each compilation system (e.g., gcc) Invokes preprocessor (cpp), compiler (cc1), assembler (as), and linker (ld). Passes command line arguments to appropriate phases Eg: create executable p from main.c and swap.c: unix> gcc -O2 g o p main.c swap.c unix>./p 3

Translating the example program unix> gcc -O2 -v -o p main.c swap.c Reading specs from /usr/lib/gcc/i386-redhat-linux/3.4.6/specs Configured with:../configure --prefix=/usr --mandir=/usr/share/man -- infodir=/usr/share/info --enable-shared --enable-threads=posix --disable-checking --with-system-zlib --enable- cxa_atexit --disable-libunwind-exceptions --enablejava-awt=gtk --host=i386-redhat-linux Thread model: posix gcc version 3.4.6 20060404 (Red Hat 3.4.6-11) /usr/libexec/gcc/i386-redhat-linux/3.4.6/cc1 -quiet -v main.c -quiet -dumpbase main.c -auxbase main -O2 -version -o /tmp/ccuck8xa.s unix> cpp [other args] main.c /tmp/main.i cc1 /tmp/main.i main.c O2 [other args] o /tm/main.s as [other args] o /tmp/main.o /tmp/main.s ls o p [sys obj files and args] /tmp/main.o /tmp/swap.o 4

Why linkers? Modularity Large program can be written as a collection of smaller files, rather than one monolithic mass Can build libraries of common functions (more on this later) e.g., Math library, standard C library Efficiency Time: Change one source file, compile, and then re-link No need to recompile other source files Space: Libraries of common functions can be put in a single file... Yet executable files and running memory images contain only code for the functions they actually use 5

What does a linker do? Step 1: Symbol resolution Programs define and reference symbols (variables and functions) void swap() { /* define symbol swap */ swap(); /* reference symbol swap */ int *xp = &x; /* define xp, reference x */ Symbol definitions are stored (by compilers) in a symbol table Symbol table is an array of structs Each entry includes name, type, size, and location of symbol Linker associates each symbol reference with exactly one symbol definition 6

What does a linker do? Step 2: Relocation Merges separate code and data sections into single sections Relocates symbols from their relative locations in the.o files to their final absolute memory locations in the executable Updates all references to these symbols to reflect their new positions 7

Three kinds of object files Generated by compilers and assemblers Relocatable object file Contains code and data in a form that can be combined with other relocatable object files to form an executable Each.o file is produced from exactly one source (.c) file Shared object file Special type of relocatable object file that can be loaded into memory and linked dynamically at either load or run time Called Dynamic Link Libraries (DLLs) in Windows Generated by linkers Executable object file Contains code and data in a form that can be copied directly into memory and executed 8

Executable and Linkable Format (ELF) Standard binary format for object files Derives from AT&T System V Unix (Common Object File Format COFF) Later adopted by BSD Unix variants and Linux One unified format for Executable object files Relocatable object files (.o), Shared object files (.so) Generic name: ELF binaries 9

ELF object file format ELF header Magic number, type (.o, exec,.so), machine, byte ordering, offset of section header table, etc. Segment header table Page size, virtual addresses memory segments (sections), segment sizes..text section Code.data section Initialized (static) data.bss section Uninitialized (static) data Originally an IBM 704 assembly instruction; Block Started by Symbol ( Better Save Space ) Has section header but occupies no space ELF header Segment header table (required for executables).text section.data section.bss section.symtab.rel.txt.rel.data.debug Section header table (required for relocatables) 0 10

ELF object file format (cont).symtab section Symbol table Procedure and static variable names Section names and locations.rel.text section Relocation info for.text section Addresses of instructions that will need to be modified in the executable Instructions for modifying..rel.data section Relocation info for.data section Addresses of pointer data that will need to be modified in the merged executable.debug section Info for symbolic debugging (gcc -g) Section header table Offsets and sizes of each section ELF header Segment header table (required for executables).text section.data section.bss section.symtab.rel.txt.rel.data.debug Section header table (required for relocatables) 0 11

Linker symbols Every relocatable object module has a symbol table Global symbols Symbols defined by a module that can be referenced by other modules E.g. non-static C functions and non-static global variables External symbols Global symbols that are referenced by a module but defined by some other module Local symbols Symbols that are defined and referenced exclusively by a module E.g. C functions and variables defined with the static attribute Local linker symbols are not local program variables (no symbols for local nonstatic program variables that are managed at runtime) 12

Global, external or local? void swap(); int buf[2] = {1, 2; int main() { swap(); return 0; In main.c buf main swap In swap.c buf bufp0 / bufpp1 swap temp Global Global main.c External (def. by swap.c) External (def. by main.c) Global Global extern int buf[]; int *bufp0 = &buf[0]; int *bufp1; void swap() { int temp; A local variable; not a local symbol bufp1 = &buf[1]; temp = *bufp0; *bufp0 = *bufp1; *bufp1 = temp; swap.c Global: defined by module, use by others (non-static C functions & global vars) External: referenced here, defined by others Local: defined & ref exclusively here (static vars and C functions) 13

ELF symbol table example ELF symbol int name; /* String table offset */ int value; /* Section offset, or VM address */ int size; /* Object size in bytes */ char type:4, /* Data, func, section or src file name (4 bits) */ binding:4; /* Local or global (4 bits) */ char reserved; /* Unused */ char section; /* Section header index, ABS, UNDEF or COMMON */ unix% readelf -s main.o Symbol table '.symtab' contains 10 entries: Num: Value Size Type Bind Vis Ndx Name 0: 00000000 0 NOTYPE LOCAL DEFAULT UND 1: 00000000 0 FILE LOCAL DEFAULT ABS main.c 2: 00000000 0 SECTION LOCAL DEFAULT 1 3: 00000000 0 SECTION LOCAL DEFAULT 3 4: 00000000 0 SECTION LOCAL DEFAULT 4 5: 00000000 0 SECTION LOCAL DEFAULT 6 6: 00000000 0 SECTION LOCAL DEFAULT 5 7: 00000000 20 FUNC GLOBAL DEFAULT 1 main 8: 00000000 0 NOTYPE GLOBAL DEFAULT UND swap 9: 00000000 8 OBJECT GLOBAL DEFAULT 3 buf Local symbols for use by the linker 14

Symbol resolution Linker associates each reference with exactly one symbol definition from symbol tables of its input files Easy for references to local symbols Trickier with global symbols compiler assumes it is defined only once, somewhere, and that the linker will take care of it If not anywhere, linker will complain If more than once, maybe it will complain Program symbols are either strong or weak strong: procedures and initialized globals weak: uninitialized globals p1.c p2.c strong int foo=5; int foo; weak strong p1() { p2() { strong 15

Linker s symbol rules Rule 1. Multiple strong symbols are not allowed Each item can be defined only once Otherwise: linker error Rule 2. A weak symbol can be overridden by a strong symbol of the same name. References to the weak symbol resolve to the strong symbol. Rule 3. If there are multiple weak symbols, the linker can pick an arbitrary one. Can override with gcc fno-common 16

Linker puzzles int x; p1() { p1() { Link time error: two strong symbols (p1). int x; p1() { int x; p2() { References to x will refer to the same uninitialized int. Is this what you really want? int x; int y; p1() { double x; p2() { Writes to x in p2 might overwrite y! Evil! int x=7; int y=5; p1() { double x; p2() { Writes to x in p2 will overwrite y! Nasty! int x=7; p1() { int x; p2() { References to x will refer to the same initialized variable. 17

Packaging commonly used functions How to package functions commonly used by programmers? Math, I/O, memory management, string manipulation, etc. Awkward, given the linker framework so far: Option 1: Have the compiler generate the code (Pascal) More complex compiler and a new version each time you add/delete/modify a function Option 2: Put all functions in a single source file Programmers link big object file into their programs Space and time inefficient Option 3: Put each function in a separate source file Programmers explicitly link appropriate binaries into their programs More efficient, but burdensome on the programmer 18

Solution: Static libraries Static libraries (.a archive files) Concatenate related re-locatable object files into a single file with an index (called an archive) Enhance linker so that it tries to resolve unresolved external references by looking for the symbols in one or more archives If an archive member file resolves reference, link into executable 19

Commonly used libraries libc.a (the C standard library) 5 MB archive of 1500 object files. I/O, memory allocation, signal handling, string handling, data and time, random numbers, integer math libm.a (the C math library) 1 MB archive of 400 object files. floating point math (sin, cos, tan, log, exp, sqrt, ) % ar -t /usr/lib/libc.a sort fork.o fprintf.o fpu_control.o fputc.o freopen.o fscanf.o fseek.o fstab.o % ar -t /usr/lib/libm.a sort e_acos.o e_acosf.o e_acosh.o e_acoshf.o e_acoshl.o e_acosl.o e_asin.o e_asinf.o e_asinl.o 20

Creating static libraries To create the library unix% gcc c addvec.c mulvec.c unix% ar rcs libvector.a addvec.o mulvec.o libvector.a void addvec(int *x, int *y, int *z, int n) { int i; for (i = 0; i < n; i++) z[i] = x[i] + y[i]; void multvec(int *x, int *y, int *z, int n) { int i; main2.c #include <stdio.h> #include "vector.h" int x[2] = {1, 2; int y[2] = {3, 4; int z[2]; int main() { addvec(x, y, z, 2); printf("z = [%d %d]\n", z[0], z[1]); return 0; for (i = 0; i < n; i++) z[i] = x[i] * y[i]; 21

Linking with static libraries main2.c unix% gcc O2 c main2.c unix% gcc static o p2 main2.o./libvector.a Translators (cpp, cc1, as) libvector.a libc.a Static libraries main2.o addvec.o printf.o and any other modules called by printf.o Linker (ld) p2 Fully linked executable object file 22

Using static libraries Linker s algorithm for resolving external references: Scan.o files and.a files in the command line order During the scan, keep a list of the current unresolved references As each new.o or.a file obj is encountered, try to resolve each unresolved reference in the list against symbols in obj If there are entries in the unresolved list at end, then error Problem: Command line order matters! Moral: put libraries at the end of the command line unix% gcc static./libvector.a main2.c /tmp/ccc19phi.o: In function `main': main2.c:(.text+0x29): undefined reference to `addvec' collect2: ld returned 1 exit status 23

Relocation Done with symbol resolution Each symbol reference is associated with one definition Every code and data sections of each module is known Relocation Relocating sections and symbol definitions Merge sections of same type and assign run-time addresses to each sections and symbols Relocating symbol references within sections Modify symbol reference to point to the right addresses For relocation, assembler generates a relocation table showing how to modify references when merging Relocation entries for code -.rel.text Relocation entries for data -.rel.data typedef struct { int offset; /* Section offset of the ref to modif */ int symbol: 24, /* Symbol the ref should point to */ type: 8; /* How to modify it e.g. R_386_PC32 */ Elf32_Rel; 24

Merging relocatable object files Relocatable Object Files Executable Object File system code system data.text.data 0 headers system code main.o main().text main() swap().text int e = 7.data more system code swap.o swap() int *bufp0 = &buf[0] int *bufp1.text.data.bss system data int buf[2]= {1,2 int *bufp0 = &buf[0] uninitialized data.symtab.debug.data.bss 25

Relocation info (main) Relocating PC-relative references void swap(); main.c int buf[2] = {1, 2; int main() { swap(); return 0; Disassembly of section.text: 00000000 <main>: 0: 55 push %ebp 1: 89 e5 mov %esp,%ebp 3: 83 e4 f0 and $0xfffffff0,%esp 6: e8 fc ff ff ff call 7 <main+0x7> 7: R_386_PC32 swap b: 31 c0 xor %eax,%eax d: 89 ec mov %ebp,%esp f: 5d Relocation entry pop %ebp 10: c3 ret for the reference Call instruction begins at section offset 0x6 Consists of 1-byte opcode (0xe8) and 32b ref 0xfffffffc (-4 decimal) r.offset = 0x7 r.symbol = swap r.type = R_386_PC32 source: objdump dr 26

Executable after relocation (.text) foreach section s { foreach relocation entry r { refptr = s + r.offset; /* Relocate a PC-relative reference *. if (r.type == R_386_PC32) { refaddr = ADDR(s) + r.offset; *refptr = (unsigned) (ADDR(r.symbol) + *refptr refaddr); r.offset = 0x7 r.symbol = swap r.type = R_386_PC32 ADDR(s) = ADDR(.text) = 0x80483c0 ADDR(r.symbol) = ADDR(swap) = 0x80483e0 What to change What to change it to refaddr = 0x80483c0 + 0x7 = 0x80483c7 *refptr = unsigned (0x80483e0 + (-4) 0x80483c7) = 0x15 080483c0 <main>: 80483c0: 55 push %ebp 80483c1: 89 e5 mov %esp,%ebp 80483c3: 83 e4 f0 and $0xfffffff0,%esp 80483c6: e8 15 00 00 00 call 80483e0 <swap> 80483cb: 31 c0 xor %eax,%eax 80483cd: 89 ec mov %ebp,%esp 80483cf: 5d pop %ebp 80483d0: c3 ret 80483d1: 90 nop... At run time call instruction is at 0x80483c8 and PC has 0x80483cb; To execute the call CPU 1.push PC onto stack 2.PC <- PC+0x15 = 0x80483e0 27

Relocation info (swap,.text) Relocating absolute references extern int buf[]; swap.c int *bufp0 = &buf[0]; int *bufp1; void swap() { int temp; bufp1 = &buf[1]; temp = *bufp0; *bufp0 = *bufp1; *bufp1 = temp; 00000000 <swap>: 0: a1 00 00 00 00 mov 0x0,%eax 1: R_386_32 bufp0 5: 55 push %ebp 6: 8b 0d 04 00 00 00 mov 0x4,%ecx 8: R_386_32 buf c: 89 e5 mov %esp,%ebp e: c7 05 00 00 00 00 04 movl $0x4,0x0 15: 00 00 00 10: R_386_32 bufp1 14: R_386_32 buf 18: 8b 10 mov (%eax),%edx 1a: 89 08 mov %ecx,(%eax) 1c: 5d pop %ebp 1d: 89 15 04 00 00 00 mov %edx,0x4 1f: R_386_32 buf 23: c3 ret source: objdump dr 28

Relocation info (swap,.data) extern int buf[]; int *bufp0 = &buf[0]; int *bufp1; void swap()... swap.c Because bufp0 is initialized it is stored in.data Disassembly of section.data: 00000000 <bufp0>: 0: 00 00 00 00... 0: R_386_32 buf r.offset = 0x0 r.symbol = buf r.type = R_386_32 ADDR(r.symbol) = ADDR(buf) = 0x804a010 foreach section s { foreach relocation entry r { refptr = s + r.offset;... /* Relocate an absolute reference *. if (r.type == R_386_P2) { *refptr = (unsigned) (ADDR(r.symbol) + *refptr); *refptr = unsigned (0x804a010 + 0) = 0x804a010 The run-time address of the buf array source: objdump dr j.data 29

Executable after relocation (.data) Disassembly of section.data: 0804a008 < data_start>: 804a008: 00 00 add %al,(%eax)... The run-time address 0804a00c < dso_handle>: 804a00c: of the 00 buf 00 array 00 00... 0804a010 <buf>: 804a010: 01 00 00 00 02 00 00 00... 0804a018 <bufp0>: 804a018: 10 a0 04 08... 30

Executable after relocation (.text) 080483c0 <main>: 80483c0: 55 push %ebp 80483c1: 89 e5 mov %esp,%ebp 80483c3: 83 e4 f0 and $0xfffffff0,%esp 80483c6: e8 15 00 00 00 call 80483e0 <swap> swap(); 80483cb: 31 c0 xor %eax,%eax 80483cd: 89 ec mov %ebp,%esp 80483cf: 5d pop %ebp 80483d0: c3 ret 80483d1: 90 nop... 080483e0 <swap>: 80483e0: a1 18 a0 04 08 mov 0x804a018,%eax Get *bufp0; 80483e5: 55 push %ebp 80483e6: 8b 0d 14 a0 04 08 mov 0x804a014,%ecx 80483ec: 89 e5 mov %esp,%ebp Get bufp[1]; 80483ee: c7 05 24 a0 04 08 14 movl $0x804a014,0x804a024 bufp1 = &buf[1]; 80483f5: a0 04 08 80483f8: 8b 10 mov (%eax),%edx Get *bufp1 80483fa: 89 08 mov %ecx,(%eax) 80483fc: 5d pop %ebp 80483fd: 89 15 14 a0 04 08 mov %edx,0x804a014 8048403: c3 ret 8048404:... 90 nop... 0804a010 <buf>: 804a010: 01 00 00 00 02 00 00 00... 0804a018 <bufp0>: 804a018: 10 a0 04 08... 31

Not loaded Loaded from the executable file Read/write Read-only Memory invisible to user code Loading executable binaries Typical ELF executable ELF header Segment header table.init 0 0xc0000000 Kernel virtual memory User stack (created at runtime) %esp.text.rodata.data 0x40000000 Memory-mapped region for shared libraries.bss.symtab.debug Run-time heap (created by malloc) brk.line.strtab Section header table 0x08048000 Read/write segment (.data,.bss) Read-only segment (.init,.text,.rodata) 0 Unused 32

Static and shared libraries Static libraries still have a few disadvantages: Potential for duplicating common code in multiple exec files e.g., every C program needs the standard C library Potential for duplicating code in the virtual mem. space of many processes Minor bug fixes of system libraries require each application to explicitly relink Shared libraries members are dynamically loaded into memory and linked into apps at run-time 33

Shared libraries Forms of sharing In any given file system, only one.so file for a particular library A single copy of.text section of the library is shared by different processes Shared libraries (.so on Unix, DDL for MS) Dynamic linking can occur when exec is first loaded and run Common case for Linux, handled automatically by ld-linux.so. Dynamic linking can also occur after program has begun In Linux, this is done explicitly by user with dlopen() Basis for High-Performance web servers. 34

Dynamically linked at load time unix> gcc shared o libvector.so addvec.c multvec.c main2.c vector.h Translators (cc1, cc1,as) libc.so libvector.so Relocatable object file main2.o Relocation and symbol table info Partially linked executable object file Loader detects object is dynamically linked Fully linked executable in memory Linker (ld) p2 Loader (execve) libc.so libvector.so Dynamic Linker (ld-linux.so) Code and data 35

Dynamic linking from applications Why? Distributing software new versions of shared libraries used as they become available (MS Windows) Building high-performance web servers functions that generate dynamic content available as dll #include <stdio.h> #include <dlfcn.h> int x[2] = {1, 2; int y[2] = {3, 4; int z[2]; /* get pointer to addvec() func loaded */ addvec = dlsym(handle, "addvec"); if ((error = dlerror())!= NULL) { fprintf(stderr, "%s\n", error); exit(1); int main() { void *handle; void (*addvec) (int *, int*, int *, int); char *error; /* dynamically load shared lib */ handle = dlopen("./libvector.so", RTLD_LAZY); if (!handle) { fprintf(stderr, "%s\n", dlerror()); exit(1); /* Now call addvec() as usual */ addvec(x, y, z, 2); prtintf("z = [%d %d]\n", z[0], z[1]); /* unload the shared library */ if (dlclose(handle) < 0) { fprintf(stderr, "%s\n", dlerror()); exit(1); return 0; 36

Summary Linking Linker mechanics Shared libraries Dynamic libraries Next time Exceptional control flow 37

A. Problem 7.2 REF(x.i) --> DEF(x.k) linker associates an arbitrary reference to symbol x in module i to the definition of x in module k For each example, indicate how the linker would resolve references to multiply defined symbols, ERROR if there is a link-time error, or UNKNOWN if the decision is arbitrary /* Module 1 */ int main() { /* Module 2 */ int main; int p2() { REF(main.1) --> DEF( main.1. ) REF(main.2) --> DEF( main.1. ) ERROR B. /* Module 1 */ /* Module 2 */ REF(main.1) --> DEF( ------. ) int main() int main=1; REF(main.2) --> DEF( ------. ) { int p2() { C. /* Module 1 */ int x; void main() { /* Module 2 */ double x=1.0; int p2() { REF(x.1) --> DEF( x.2. ) REF(x.2) --> DEF( x.2. ) 38

Problem 7.4 Concerning the following.text section A. What is the hex address of the relocated reference to swap in line 5? B. What is the hex value of the relocated reference to swap in line 5? C. Suppose the linker decided to locate.text at 0x80483b8 instead of 0x80483b4; what would be the hex value of the relocated reference in line 5 then? 080483b4 <main>: 80483b4: 55 push %ebp 80483b5: 89 e5 mov %esp,%ebp 80483b7: 83 ec 08 sub $0x8,%esp 80483ba: e8 09 00 00 00 call 80483c8 <swap> 80483bf: b8 00 00 00 00 mov $0x0,%eax 80483c1: 89 ec mov %ebp,%esp 80483c3: 5d pop %ebp 80483c4: c3 ret 80483c5: 90 nop 80483c6: 90 nop 80483c7: 90 nop... 39