Gnu Debugger (GDB) Topics Overview Quick Reference Card Readings: Quick Reference Card February 4, 2010 CSCE 212Honors Computer Organization.

Slides:



Advertisements
Similar presentations
Recitation 4 Outline Buffer overflow –Practical skills for Lab 3 Code optimization –Strength reduction –Common sub-expression –Loop unrolling Reminders.
Advertisements

Introduction to the Omega Server CSE Overview Intro to Omega Basic Unix Command Files Directories Printing C and C++ compilers GNU Debugger.
Gnu Debugger (GDB) Topics Overview Quick Reference Card Readings: Quick Reference Card February 7, 2012 CSCE 212Honors Computer Organization.
The art of exploitation
Utilizing the GDB debugger to analyze programs Background and application.
Debugging What can debuggers do? Run programs Make the program stops on specified places or on specified conditions Give information about current variables’
Chapter 1 Background System Software Chih-Shun Hsu
Outline Learning Assembly by an Example.  Program Formats  Some Simple Instructions  Assemble and Execute Learning Another Example  Data Definition.
PC hardware and x86 3/3/08 Frans Kaashoek MIT
Cse322, Programming Languages and Compilers 1 6/18/2015 Lecture #16, May 24, 2007 Runtime.c Running the code debugging assembler division strings for println.
CSE 303 Lecture 13a Debugging C programs
Microprocessor Systems Design I Instructor: Dr. Michael Geiger Spring 2014 Lecture 4: x86 memory.
C Slides and captured lecture (video and sound) are available at:
Recitation 2: Assembly & gdb Andrew Faulring Section A 16 September 2002.
Recitation: Bomb Lab June 5, 2015 Dipayan Bhattacharya.
Gdb is the GNU debugger on our CS machines. gdb is most effective when it is debugging a program that has debugging symbols linked in to it. With gcc and.
Debugging Cluster Programs using symbolic debuggers.
CSCE Systems Programming Lecture 17 Sockets CSCE March 20, 2013.
CEG 320/520: Computer Organization and Assembly Language ProgrammingIntel Assembly 1 Intel IA-32 vs Motorola
Memory & Storage Architecture Seoul National University GDB commands Hyeon-gyu School of Computer Science and Engineering.
6.828: PC hardware and x86 Frans Kaashoek
CAP6135: Malware and Software Vulnerability Analysis Buffer Overflow : Example of Using GDB to Check Stack Memory Cliff Zou Spring 2011.
Practical Session 4. Labels Definition - advanced label: (pseudo) instruction operands ; comment valid characters in labels are: letters, numbers, _,
Goals: To gain an understanding of assembly To get your hands dirty in GDB.
The ISA Level The Instruction Set Architecture (ISA) is positioned between the microarchtecture level and the operating system level.  Historically, this.
1 #include void silly(){ char s[30]; gets(s); printf("%s\n",s); } main(){ silly(); return 0; }
The x86 Architecture Lecture 15 Fri, Mar 4, 2005.
Carnegie Mellon Recitation: Bomb Lab 21 Sep 2015 Monil Shah, Shelton D’Souza.
Introduction to InfoSec – Recitation 2 Nir Krakowski (nirkrako at post.tau.ac.il) Itamar Gilad (itamargi at post.tau.ac.il)
A Tutorial on Introduction to gdb By Sasanka Madiraju Graduate Assistant Center for Computation and Technology.
Derived from "x86 Assembly Registers and the Stack" by Rodney BeedeRodney Beede x86 Assembly Registers and the Stack Nov 2009.
CSI605 Introduction to gdb. Compiling for gdb Execution I often compile as follows gcc -g -Wall -omyprog myprog.c g++ -g -Wall -omyprog myprog.c It suffices.
1 Carnegie Mellon Assembly and Bomb Lab : Introduction to Computer Systems Recitation 4, Sept. 17, 2012.
Chapter 2 Parts of a Computer System. 2.1 PC Hardware: Memory.
Debugging 1/6/2016. Debugging 1/6/2016 Debugging  Debugging is a methodical process of finding and reducing the number of bugs, or defects, in a program.
Dale Roberts Debugger Dale Roberts, Lecturer Computer Science, IUPUI Department of Computer and Information Science, School.
X86 Assembly Language We will be using the nasm assembler (other assemblers: MASM, as, gas)
EXPLOITATION CRASH COURSE – FALL 2013 UTD Computer Security Group – Andrew Folloder csg.utdallas.edu (credit: Scott Hand)
CMSC 104, Version 8/061L14AssignmentOps.ppt Assignment Operators Topics Increment and Decrement Operators Assignment Operators Debugging Tips Reading Section.
Introduction to Intel IA-32 and IA-64 Instruction Set Architectures.
CAP6135: Malware and Software Vulnerability Analysis Buffer Overflow : Example of Using GDB to Check Stack Memory Cliff Zou Spring 2014.
Dale Roberts Debugger Dale Roberts, Lecturer Computer Science, IUPUI Department of Computer and Information Science, School.
DEBUG.
Instructions for test_function
Instruction Set Architecture
Computer Architecture and Assembly Language
Assembly language.
Computer Architecture and Assembly Language
CSCE 212Honors Computer Organization
Debugging with gdb gdb is the GNU debugger on our CS machines.
Computer Architecture and Assembly Language
Assembly IA-32.
Introduction to Computer Systems
Machine-Level Programming 1 Introduction
Computer Architecture “Bomb Lab Hints”
Introduction to Intel IA-32 and IA-64 Instruction Set Architectures
Assembly Language Programming II: C Compiler Calling Sequences
GNU DEBUGGER TOOL. What is the GDB ? GNU Debugger It Works for several languages – including C/C++ [Assembly, Fortran,Go,Objective-C,Pascal]
CAP6135: Malware and Software Vulnerability Analysis Buffer Overflow : Example of Using GDB to Check Stack Memory Cliff Zou Spring 2015.
CNT4704: Analysis of Computer Communication Network Buffer Overflow : Example of Using GDB to Check Stack Memory Cliff Zou Fall 2011.
Week 2: Buffer Overflow Part 1.
Computer Architecture CST 250
CAP6135: Malware and Software Vulnerability Analysis Buffer Overflow : Example of Using GDB to Check Stack Memory Cliff Zou Spring 2016.
CSCE 212Honors Computer Organization
CAP6135: Malware and Software Vulnerability Analysis Buffer Overflow : Example of Using GDB to Check Stack Memory Cliff Zou Spring 2013.
CAP6135: Malware and Software Vulnerability Analysis Buffer Overflow : Example of Using GDB to Check Stack Memory Cliff Zou Spring 2010.
Computer Architecture and System Programming Laboratory
Computer Architecture and System Programming Laboratory
Computer Architecture and System Programming Laboratory
By Hugues Leger / Intro to GDB debugger By Hugues Leger / 11/16/2019.
Presentation transcript:

Gnu Debugger (GDB) Topics Overview Quick Reference Card Readings: Quick Reference Card February 4, 2010 CSCE 212Honors Computer Organization

– 2 – CSCE 212H Spring 2010 Overview Last Time Lab02 Lea for arithmetic examples, jumps Objectives for the Day Lecture 7 – slides 9- ; function calls rfact.c Pop Quiz address modes Gnu compiler “gcc”: gcc –Og -S GDB Next Time/Future: Function calls, 17-Feb Wed Test 1 Last day to drop a course or withdraw without grade of "WF"

– 3 – CSCE 212H Spring 2010 Class Exercise

– 4 – CSCE 212H Spring 2010 Gnu compiler “gcc”: gcc –Og -S cp $c/arith.c. // $c=/class/csce /Code/ cp $c/rfact.c. gcc –S arith.c//produces arith.s gcc –Og –S arith.c //produces arith.s optimized gcc –Og arith.c

– 5 – CSCE 212H Spring 2010 Gnu DeBugger (GDB) Overview Gnu (Gnu is not Unix) Free Software Foundation Richard Stallman – emacs fame Debuggers Allows one to execute a program step by step and observe the changes made during execution Allows one to execute a program step by step and observe the changes made during execution Dbx – Berkeley debugger Dbx – Berkeley debugger GDB – gnu debugger GDB – gnu debugger Compile with the “-g” option gcc –g source.c

– 6 – CSCE 212H Spring 2010 GDB QUICK REFERENCE Essential Commands Starting GDB Stop GDB Getting Help Executing your Program run arglist Shell Commands Cd, pwd, make, etc Breakpoints and Watchpoints b line-number Program Stack bt (backtrace, i.e. showstack) Execution Control Display Automatic Display Expressions Symbol Table GDB Scripts Signals Debugging Targets Controlling GDB Working Files Source Files GDB under Emacs

– 7 – CSCE 212H Spring 2010 GDB - Essential Commands gdb program [core] debug program [using coredump core] b func [file:]function set breakpoint at function [in file] run [arglist] start your program [with arglist] backtrace: display program stack p expr display the value of an expression c continue running your program n next line, stepping over function calls s next line, stepping into function calls sinext assembly instruction info reg/args/locals

– 8 – CSCE 212H Spring 2010 GDB - Display print [/f ] [expr] p [/f ] [expr] show value of expr [or last value $] according to format f: call [/f ] expr like print but does not display void

– 9 – CSCE 212H Spring 2010 GDB – Display Formats x hexadecimal d signed decimal u unsigned decimal o octal t binary a address, absolute and relative c character f floating point (char *) null terminated string

– 10 – CSCE 212H Spring 2010 GDB - Automatic Display Automatic Display display /f exprshow the value of expr each time program stops according to format f Formats – x d u t (binary) c f s (string) i (machine instr) Formats – x d u t (binary) c f s (string) i (machine instr)Examples display /i $eip - show the machine instruction everytime gdb stops display /i $eip - show the machine instruction everytime gdb stops display /x numshow the value of the variable “num” … display /x numshow the value of the variable “num” …

– 11 – CSCE 212H Spring 2010 GDB – eXamining Memory x [/Nuf ] expr examine memory at address expr; Optional format spec follows slashFormat N count of how many units to display N count of how many units to display u unit size; one of u unit size; one of b individual bytes h halfwords (two bytes) w words (four bytes) g giant words (eight bytes)

– 12 – CSCE 212H Spring 2010 GDB Example - fibonnaci #include #include int fib(int n){ int nm1, nm2; int nm1, nm2; int temp, temp2; int temp, temp2; printf("Calling fib(%d)\n", n); printf("Calling fib(%d)\n", n); nm1 = n-1; nm1 = n-1; nm2 = n-2; nm2 = n-2; if (n <= 1) return 1; if (n <= 1) return 1; else{ else{ temp = fib(nm1); temp = fib(nm1); temp2 = fib(nm2); temp2 = fib(nm2); return temp + temp2; return temp + temp2; }} /* fibonnaci function written with lots of extra variables */ main(){ int i,j; int i,j; i = 4; i = 4; j = i+1; j = i+1; i = fib(j); i = fib(j);}

– 13 – CSCE 212H Spring 2010 Compiling and Running GDB ares> gcc -g fib.c -o fib ares> gdb fib GNU gdb 6.3 Copyright 2004 Free Software Foundation, Inc. GDB is free software, covered by the GNU General Public License, and you are welcome to change it and/or distribute copies of it under certain conditions. Type "show copying" to see the conditions. There is absolutely no warranty for GDB. Type "show warranty" for details. This GDB was configured as "i486-slackware-linux"...Using host libthread_db library "/lib/libthread_db.so.1". (gdb)

– 14 – CSCE 212H Spring 2010 GDB: Run, List gdb > run Starting program: /class/csce /Examples/Lab04/fib Calling fib(5) Calling fib(4) Calling fib(3) Calling fib(2) Calling fib(1) Calling fib(0) Calling fib(1) Calling fib(2) Calling fib(1) Calling fib(0) Calling fib(3) Calling fib(2) Calling fib(1) Calling fib(0) Calling fib(1) Program exited with code 010. (gdb) list 10, /* fibonnaci function written with lots of extra variables */ 12 int fib(int n){ 13 int nm1, nm2; 14 int temp, temp2; 15 printf("Calling fib(%d)\n", n); 16 nm1 = n-1; 17 nm2 = n-2; 18 if (n <= 1) return 1; 19 else{ 20 temp = fib(nm1);

– 15 – CSCE 212H Spring 2010 Setting Breakpoints and N, S, C commands Setting breakpoint – b command Setting breakpoint – b command (gdb) b 17 Breakpoint 1 at 0x80483d5: file fib.c, line 17. Running the program Running the program (gdb) run Starting program: /class/csce /Examples/Lab04/fib Calling fib(5) Breakpoint 1, fib (n=5) at fib.c:17 Next command or just n Next command or just n (gdb) n 18 if (n <= 1) return 1; Continue command Continue command (gdb) c Continuing. Calling fib(4) Breakpoint 1, fib (n=4) at fib.c:17 17 nm2 = n-2; (gdb) c Continuing. Calling fib(3) Breakpoint 1, fib (n=3) at fib.c:17 17 nm2 = n-2; (gdb) c

– 16 – CSCE 212H Spring 2010 Backtrace – Show Activation Records Backtrace (bt) show the stack of activation records Backtrace (bt) show the stack of activation records (gdb) bt #0 fib (n=2) at fib.c:10 #1 0x080483e7 in fib (n=3) at fib.c:10 #2 0x080483e7 in fib (n=4) at fib.c:10 #3 0x080483e7 in fib (n=5) at fib.c:10 #4 0x in main () at fib.c:24 Up // move up one Activation Record in the stack Up // move up one Activation Record in the stack (gdb) up #1 0x in fib (n=2) at … (gdb) up #2 0x080483f8 in fib (n=3) at … p expr // Print the value of expr p expr // Print the value of expr (gdb) p nm2 $3 = 1 (gdb) p nm1 $4 = 2 (gdb)

– 17 – CSCE 212H Spring 2010 What’s in the registers? (gdb) info reg eax 0x0 0 ecx 0x0 0 edx 0xf 15 ebx 0xb7fcdff esp 0xbffff510 0xbffff510 ebp 0xbffff528 0xbffff528 esi 0xbffff63c edi 0x1 1 eip 0x80483dc 0x80483dc eip 0x80483dc 0x80483dc eflags 0x cs 0x ss 0x7b 123 ds 0x7b 123 es 0x7b 123 fs 0x0 0 gs 0x0 0 Note ebp – the frame pointer Note ebp – the frame pointer Esp – the stack pointer Esp – the stack pointer Eip – the program counter Eip – the program counter

– 18 – CSCE 212H Spring 2010 A look at the stack using X (examine) (gdb) x/30wx 0xbffff528 // the frame pointer (%ebp) 0xbffff528: 0xbffff558 0x080483e7 0x x xbffff538: 0xbffff63c 0x xbffff558 0xb7ee88f0 0xbffff548: 0xb7fce7a0 0x x x xbffff558: 0xbffff588 0x080483e7 0x x xbffff568: 0xbffff63c 0x xbffff588 0xb7ee88f0 0xbffff578: 0xb7fce7a0 0x x x xbffff588: 0xbffff5b8 0x080483e7 0x x xbffff598: 0xbffff5a8 0xb7eb90d5 ebp’s: 0xbffff528, 0xbffff558, 0xbffff588, 0xbffff5b8 Return addresses ebp+4 Argument1’s ebp+8