DOCSLIB.ORG

A Problem with Parameter Passing Via Stack Chapter 16  Consider the Following Function That's Designed to Swap the Values of Its Arguments

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Problem with Parameter Passing Via Stack Chapter 16  Consider the Following Function That's Designed to Swap the Values of Its Arguments A problem with parameter passing via stack Chapter 16 Consider the following function that's designed to swap the values of its arguments. void Swap(int firstVal, int secondVal){ int tempVal = firstVal; firstVal = secondVal; secondVal = tempVal; } Why do we need Pointers? Call by Value vs. Call by Reference in detail int main () { Implementing Arrays int valueA = 3, valueB = 4; … Buffer Overflow / The “Stack Hack” Swap (valueA, valueB); … Wright State University, College of Engineering CEG 320/520 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 2 Executing the Swap Function Pointers and Arrays Functions such as the swap example need to be able access variables before call after call stored in memory locations outside of their own activation record – A function’s activation record defines its “scope” 3 tempVal These values – We've seen examples of how to do this in Assembly. Swap changed... Pointer R6 – Address of a variable in memory R6 3 firstVal 4 firstVal – Allows us to indirectly access variables 4 secondVal 3 secondVal in other words, we can talk about its address rather than its value 4 valueB 4 valueB Array (still a pointer!) 3 valueA 3 valueA – An area of allocated memory with values arranged sequentially main ...but these – Expression a[4] refers to the 5th element of the array a did not. The array variable is a pointer to the base of the array Base + offset Thus… the first element is 0 Wright State University, College of Engineering CEG 320/520 Wright State University, College of Engineering CEG 320/520 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 3 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 4 Pointers in C Pointers in C C lets us talk about and manipulate addresses as “pointer variables” How do we store addresses? Pointer variables! But first, lets refresh the somewhat confusing bits. – Although all pointers in C are exactly the same type (address) they are also typed by the compiler so that the data to which they refer can be appropriately interpreted. – A pointer in C is always a pointer to a particular data type: int*, double*, &: The “address-of” or “reference” operator char*, etc. – This operator does one thing. Declaration – It returns the address of the variable which follows – int *p; /* p is a pointer to an int */ Operators #include <stdio.h> – *p -- returns the value pointed to by p (indirect address / dereference int main() { op) int x = 0; Output: Address of x = 0x0065FDF4 – &z -- returns the address of variable z (address-of operator) printf("Address of x "); Important point of common confusion! printf("= 0x%p \n", &x); return 0; – * means “a pointer variable” when used in a declaration } – * means “access the information that this address points to” elsewhere – What does *3 mean? Wright State University, College of Engineering CEG 320/520 Wright State University, College of Engineering CEG 320/520 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 5 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 6 1 Check for understanding Check for understanding #include <stdio.h> #include <stdio.h> int main() { int main() { int x = 12; int x[10] = {0,1,2,3,4,5,6,7,8,9}; int *ptr = &x; Address of x: 0x0065FDF4 printf("Address of x[0]:\t 0x%p\n", &x[0]); Address of x: 0x65fdf4 printf("Address of x:\t 0x%p\n", x); printf("Address of x:\t 0x%p\n", ptr); Address of ptr: 0x65fdf0 printf("Value of x[0]:\t %d\n", x[0]); Value of x: 12 printf("Address of x:\t 0x%x\n", &x); printf("Value of x[0]:\t %d\n", *x); printf("Address of ptr:\t 0x%x\n", &ptr); Address of x[0]: 0x0065FDD0 printf("Value of x:\t %d\n", *ptr); return 0; Address of x: 0x0065FDD0 } Value of x[0]: 0 return 0; Value of x[0]: 0 } Wright State University, College of Engineering CEG 320/520 Wright State University, College of Engineering CEG 320/520 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 7 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 8 Example Example: LC-3 Code ; i is 1st local (offset 0), ptr is 2nd (offset -1) Name Type Offset Scope int i; i = 4; store the value 4 into the memory location ; i int *ptr; int 0 main associated with i AND R0, R0, #0 ; clear R0 ptr Int* -1 main ADD R0, R0, #4 ; put 4 in R0 i = 4; store the address of i into the STR R0, R5, #0 ; store in i memory location associated with ptr ptr = &i; ; ptr = &i; ADD R0, R5, #0 ; R0 = R5 + 0 *ptr = *ptr + 1; (addr of i) STR R0, R5, #-1 ; store in ptr R6 xEFFC ptr ; *ptr = *ptr + 1; read the contents of memory R5 4 i LDR R0, R5, #-1 ; R0 = ptr at the address stored in ptr xxxx fp LDR R1, R0, #0 ; load contents xxxx pc store the result into memory (*ptr) ADD R1, R1, #1 xxxx ret at the address stored in ptr ; add one xF000 STR R1, R0, #0 ; store result where R0 points Wright State University, College of Engineering CEG 320/520 Wright State University, College of Engineering CEG 320/520 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 9 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 10 Call by reference Passing Pointers to a Function Passing a pointer as an argument allows the function to read/change main() wants to swap the values of valueA and valueB memory outside its activation record. – But not the pointer itself! NewSwap(&valueA, &valueB); – If you wanted to change the pointer itself, what would you need to do? LC-3 Code for main: void NewSwap(int *firstVal, int *secondVal) ADD R0, R5, #-1 ; addr of valueB R6 firstVal { xEFFA ADD R6, R6, #-1 ; push secondVal int tempVal = *firstVal; xEFF9 STR R0, R6, #0 valueB *firstVal = *secondVal; 4 R5 3 valueA *secondVal = tempVal; Arguments are ADD R0, R5, #0 ; addr of valueA } integer pointers. ADD R6, R6, #-1 ; push STR R0, R6, #0 Caller passes addresses xEFFD of variables that it wants function to change. Wright State University, College of Engineering CEG 320/520 Wright State University, College of Engineering CEG 320/520 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 11 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 12 2 Code Using Pointers Pointer arithmetic Pointer arithmetic Inside the NewSwap routine – If ptr is a pointer, what is ptr = ptr + 1? ; int tempVal = *firstVal; R6 3 tempVal – It depends on the size of the data pointed to by ptr!! LDR R0, R5, #4 ; R0=xEFFA R5 xEFFA dynLnk On a x86 (byte addressable) machine LDR R1, R0, #0 ; R1=M[xEFFA]=3 xxxx retAddr – int* ptr; ptr = ptr + 1; /* ptr increases by 2 */ STR R1, R5, #0 ; tempVal=3 xxxx retVal – long* ptr; ptr = ptr + 1; /* ptr increases by 4 */ ; *firstVal = *secondVal; xEFFA firstVal Sometimes we want a pointer that points to nothing. LDR R1, R5, #5 ; R1=xEFF9 xEFF9 secondVal LDR R2, R1, #0 ; R1=M[xEFF9]=4 – In other words, we declare a pointer, but have nothing to point to (yet). valueB STR R2, R0, #0 ; M[xEFFA]=4 9 3 int *p; A ; *secondVal = tempVal; 4 valueA p = NULL; /* p is a null pointer */ B NULL LDR R2, R5, #0 ; R2=3 is a predefined macro that contains a value that a non-null pointer C should never hold. STR R2, R1, #0 ; M[xEFF9]=3 xEFFD – Often, NULL = 0, because Address 0x00000000 is not a legal address for most programs on most platforms BUT it depends on the machine! Wright State University, College of Engineering CEG 320/520 Wright State University, College of Engineering CEG 320/520 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 13 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 14 Using Arguments for Results Arrays Pass address of variable where you want result stored Declaration – useful for multiple results – type variableName [size]; Example: – All elements are the same type/size return value via pointer – Number of elements known at compile time return status code as function result Reference grid[0] – variableName [num] grid[1] – Accesses num-th – 1 entry in array grid[2] This solves the “mystery” of why ‘&’ with argument to scanf: – Numbering starts from 0 grid[3] – scanf("%d ", &dataIn); – No limit checking at compile- or run-time grid[4] Array elements can be allocated as part of the grid[5] read a decimal integer activation record (local) or in global memory grid[6] and store in dataIn int grid[10]; grid[7] grid[8] But what about: – First element (grid[0]) is at lowest address of allocated space grid[9] – scanf(“%s”, &buffer); ?? – If grid is only local variable allocated, then R5 will point to grid[9] Wright State University, College of Engineering CEG 320/520 Wright State University, College of Engineering CEG 320/520 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 15 Dr. Doom, Computer Science & Engineering Comp. Org. & Assembly 16 Array code for LC-3 More Array code for LC-3 ; x = grid[3] + 1 ; grid[x+1] = grid[x] + 2 ADD R0, R5, #-9 ; R0 = &grid[0] LDR R0, R5, #-10 ; R0 = x LDR R1, R0, #3 ; R1 = grid[3] x ADD R1, R5, #-9 ; R1 = &grid[0] x ADD R1, R1, #1 ; plus 1 grid[0] ADD R1, R0, R1 ; R1 = &grid[x] grid[0] STR R1, R5, #-10 ; x = R1 grid[1] LDR R2, R1, #0 ; R2 = grid[x] grid[1] ; grid[6] = 5; grid[2] ADD R2, R2, #2 ; add 2 grid[2] AND R0, R0, #0 grid[3] LDR R0, R5, #-10 ; R0 = x grid[3] ADD R0, R0, #5 ; R0 = 5 grid[4] grid[4] ADD R1, R5, #-9 ; R1 = &grid[0] ADD R0, R0, #1 ; R0 = x+1 STR R0, R1, #6 ; grid[6] = R0 grid[5] ADD R1, R5, #-9 ; R1 = &grid[0] grid[5] grid[6] ADD R1, R0, R1 ; R1 = &grix[x+1] grid[6] grid[7] STR R2, R1, #0 ; grid[x+1] = R2 grid[7] Name Type Offset Scope grid[8] Name Type Offset Scope grid[8] grid int -9 main R5 grid[9] R5 grid[9] x int* -10 main grid int -9 main x int* -10 main Wright State University, College of Engineering CEG 320/520 Wright State University, College of Engineering CEG 320/520 Dr.
Load more

Recommended publications
  • What Is an Operating System III 2.1 Compnents II an Operating System
    Page 1 of 6 What is an Operating System III 2.1 Compnents II An operating system (OS) is software that manages computer hardware and software resources and provides common services for computer programs. The operating system is an essential component of the system software in a computer system. Application programs usually require an operating system to function. Memory management Among other things, a multiprogramming operating system kernel must be responsible for managing all system memory which is currently in use by programs. This ensures that a program does not interfere with memory already in use by another program. Since programs time share, each program must have independent access to memory. Cooperative memory management, used by many early operating systems, assumes that all programs make voluntary use of the kernel's memory manager, and do not exceed their allocated memory. This system of memory management is almost never seen any more, since programs often contain bugs which can cause them to exceed their allocated memory. If a program fails, it may cause memory used by one or more other programs to be affected or overwritten. Malicious programs or viruses may purposefully alter another program's memory, or may affect the operation of the operating system itself. With cooperative memory management, it takes only one misbehaved program to crash the system. Memory protection enables the kernel to limit a process' access to the computer's memory. Various methods of memory protection exist, including memory segmentation and paging. All methods require some level of hardware support (such as the 80286 MMU), which doesn't exist in all computers.
    [Show full text]
  • Measuring and Improving Memory's Resistance to Operating System
    University of Michigan CSE-TR-273-95 Measuring and Improving Memory’s Resistance to Operating System Crashes Wee Teck Ng, Gurushankar Rajamani, Christopher M. Aycock, Peter M. Chen Computer Science and Engineering Division Department of Electrical Engineering and Computer Science University of Michigan {weeteck,gurur,caycock,pmchen}@eecs.umich.edu Abstract: Memory is commonly viewed as an unreliable place to store permanent data because it is per- ceived to be vulnerable to system crashes.1 Yet despite all the negative implications of memory’s unreli- ability, no data exists that quantifies how vulnerable memory actually is to system crashes. The goals of this paper are to quantify the vulnerability of memory to operating system crashes and to propose a method for protecting memory from these crashes. We use software fault injection to induce a wide variety of operating system crashes in DEC Alpha work- stations running Digital Unix, ranging from bit errors in the kernel stack to deleting branch instructions to C-level allocation management errors. We show that memory is remarkably resistant to operating system crashes. Out of the 996 crashes we observed, only 17 corrupted file cache data. Excluding direct corruption from copy overruns, only 2 out of 820 corrupted file cache data. This data contradicts the common assump- tion that operating system crashes often corrupt files in memory. For users who need even greater protec- tion against operating system crashes, we propose a simple, low-overhead software scheme that controls access to file cache buffers using virtual memory protection and code patching. 1 Introduction A modern storage hierarchy combines random-access memory, magnetic disk, and possibly optical disk or magnetic tape to try to keep pace with rapid advances in processor performance.
    [Show full text]
  • Clusterfuzz: Fuzzing at Google Scale
    Black Hat Europe 2019 ClusterFuzz Fuzzing at Google Scale Abhishek Arya Oliver Chang About us ● Chrome Security team (Bugs--) ● Abhishek Arya (@infernosec) ○ Founding Chrome Security member ○ Founder of ClusterFuzz ● Oliver Chang (@halbecaf) ○ Lead developer of ClusterFuzz ○ Tech lead for OSS-Fuzz 2 Fuzzing ● Effective at finding bugs by exploring unexpected states ● Recent developments ○ Coverage guided fuzzing ■ AFL started “smart fuzzing” (Nov’13) ○ Making fuzzing more accessible ■ libFuzzer - in-process fuzzing (Jan’15) ■ OSS-Fuzz - free fuzzing for open source (Dec’16) 3 Fuzzing mythbusting ● Fuzzing is only for security researchers or security teams ● Fuzzing only finds security vulnerabilities ● We don’t need fuzzers if our project is well unit-tested ● Our project is secure if there are no open bugs 4 Scaling fuzzing ● How to fuzz effectively as a Defender? ○ Not just “more cores” ● Security teams can’t write all fuzzers for the entire project ○ Bugs create triage burden ● Should seamlessly fit in software development lifecycle ○ Input: Commit unit-test like fuzzer in source ○ Output: Bugs, Fuzzing Statistics and Code Coverage 5 Fuzzing lifecycle Manual Automated Fuzzing Upload builds Build bucket Cloud Storage Find crash Write fuzzers De-duplicate Minimize Bisect File bug Fix bugs Test if fixed (daily) Close bug 6 Assign bug ClusterFuzz ● Open source - https://github.com/google/clusterfuzz ● Automates everything in the fuzzing lifecycle apart from “fuzzer writing” and “bug fixing” ● Runs 5,000 fuzzers on 25,000 cores, can scale more ● Cross platform (Linux, macOS, Windows, Android) ● Powers OSS-Fuzz and Google’s fuzzing 7 Fuzzing lifecycle 1. Write fuzzers 2. Build fuzzers 3. Fuzz at scale 4.
    [Show full text]
  • The Fuzzing Hype-Train: How Random Testing Triggers Thousands of Crashes
    SYSTEMS ATTACKS AND DEFENSES Editors: D. Balzarotti, [email protected] | W. Enck, [email protected] | T. Holz, [email protected] | A. Stavrou, [email protected] The Fuzzing Hype-Train: How Random Testing Triggers Thousands of Crashes Mathias Payer | EPFL, Lausanne, Switzerland oftware contains bugs, and some System software, such as a browser, discovered crash. As a dynamic testing S bugs are exploitable. Mitigations a runtime system, or a kernel, is writ­ technique, fuzzing is incomplete for protect our systems in the presence ten in low­level languages (such as C nontrivial programs as it will neither of these vulnerabilities, often stop­ and C++) that are prone to exploit­ cover all possible program paths nor ping the program once a security able, low­level defects. Undefined all data­flow paths except when run violation has been detected. The alter­ behavior is at the root of low­level for an infinite amount of time. Fuzz­ native is to discover bugs during de­ vulnerabilities, e.g., invalid pointer ing strategies are inherently optimiza­ velopment and fix them tion problems where the in the code. The task of available resources are finding and reproducing The idea of fuzzing is simple: execute used to discover as many bugs is difficult; however, bugs as possible, covering fuzzing is an efficient way a program in a test environment with as much of the program to find security­critical random input and see if it crashes. functionality as possible bugs by triggering ex ­ through a probabilistic ceptions, such as crashes, exploration process. Due memory corruption, or to its nature as a dynamic assertion failures automatically (or dereferences resulting in memory testing technique, fuzzing faces several with a little help).
    [Show full text]
  • Recovering from Operating System Crashes
    Recovering from Operating System Crashes Francis David Daniel Chen Department of Computer Science Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign University of Illinois at Urbana-Champaign Urbana, USA Urbana, USA Email: [email protected] Email: [email protected] Abstract— When an operating system crashes and hangs, it timers and processor support techniques [12] are required to leaves the machine in an unusable state. All currently running detect such crashes. program state and data is lost. The usual solution is to reboot the It is accepted behavior that when an operating system machine and restart user programs. However, it is possible that after a crash, user program state and most operating system state crashes, all currently running user programs and data in is still in memory and hopefully, not corrupted. In this project, volatile memory is lost and unrecoverable because the proces- we use a watchdog timer to reset the processor on an operating sor halts and the system needs to be rebooted. This is inspite system crash. We have modified the Linux kernel and added of the fact that all of this information is available in volatile a recovery routine that is called instead of the normal boot up memory as long as there is no power failure. This paper function when the processor is reset by a watchdog. This resumes execution of user processes after killing the process that was explores the possibility of recovering the operating system executing when the watchdog fired. We have implemented this using the contents of memory in order to resume execution on the ARM architecture and we use a periodic watchdog kick of user programs without any data loss.
    [Show full text]
  • Protect Your Computer from Viruses, Hackers, & Spies
    Protect Your Computer from Viruses, Hackers, & Spies Tips for Consumers Consumer Information Sheet 12 • January 2015 Today we use our computers to do so many things. We go online to search for information, shop, bank, do homework, play games, and stay in touch with family and friends. As a result, our com- puters contain a wealth of personal information about us. This may include banking and other financial records, and medical information – information that we want to protect. If your computer is not protected, identity thieves and other fraudsters may be able to get access and steal your personal information. Spammers could use your computer as a “zombie drone” to send spam that looks like it came from you. Malicious viruses or spyware could be deposited on your computer, slowing it down or destroying files. By using safety measures and good practices to protect your home computer, you can protect your privacy and your family. The following tips are offered to help you lower your risk while you’re online. 3 Install a Firewall 3 Use Anti-virus Software A firewall is a software program or piece of Anti-virus software protects your computer hardware that blocks hackers from entering from viruses that can destroy your data, slow and using your computer. Hackers search the down or crash your computer, or allow spammers Internet the way some telemarketers automati- to send email through your account. Anti-virus cally dial random phone numbers. They send protection scans your computer and your out pings (calls) to thousands of computers incoming email for viruses, and then deletes and wait for responses.
    [Show full text]
  • PC Crash 7.2 Manual
    PC-CRASH A Simulation Program for Vehicle Accidents Operating Manual Version 9.0 November 2010 Dr. Steffan Datentechnik Linz, Austria Distributed and Supported in North America by: www.pc-crash.com Contents CHAPTER 1 INTRODUCTION AND INSTALLATION ........................................................................................ 1 INTRODUCTION ................................................................................................................................................... 1 ABOUT THIS MANUAL .......................................................................................................................................... 1 THE PC-CRASH SOFTWARE PACKAGE ................................................................................................................. 2 HARDWARE REQUIREMENTS ............................................................................................................................... 2 USE OF MOUSE AND PRINTERS ........................................................................................................................... 2 INSTALLATION OF PC-CRASH .............................................................................................................................. 2 Licensing PC-Crash ...................................................................................................................................................... 5 Check for Updates .......................................................................................................................................................
    [Show full text]
  • Internet Application Development
    8/28/12 Chapter 1 – PHP Crash Course Metropolitan State University ICS 325 Internet Application Development Class Notes – Chapter 1 – PHP Crash Course What is PHP? PHP is a server side scripting language, written specifically for the Web PHP was developed in 1994 by Rasmus Lerdorf PHP originally stood for Personal Home Page PHP currently stands for PHP Hypertext Preprocessor Current version of PHP is 4.3.6 Version 5 is available for early adopters Home page = http://www.php.net PHP strengths include: High performance, Interfacing with Different DBMS (uses ODBC), Libraries, Low Cost, Portability, open source, and thousands of functions. Web server must have PHP installed. PHP scripts are interpreted and executed on the server. Output from a PHP script looks like plain old HTML. The client cannot see your PHP code, only its output. PHP Tags – Short Style <? echo ”<p>Short Style</p>”; ?> XML Style <?php print(“<p>XML Style</p>”); ?> Script Style <script language=’php’>printf(“<p>Script Style</p>”);</script> ASP Style <% echo “<p>ASP Style</p>”; %> PHP Comments – C Style /* this is a multi line comment */ C++ Style // this is a single line comment PERL Style # this is a single line comment Most PHP code statements must end with a ; (semi-colon) Conditionals and loops are an exception to the rule Variables: All variables in PHP begin with $ (dollar sign) All variables are created the first time they are assigned a value. PHP does not require you to declare variables before using them. PHP variables are multi-type (may contain different data types at different times) cs.metrostate.edu/~f itzgesu/courses/ics325/f all04/Ch01Notes.htm 1/9 8/28/12 Chapter 1 – PHP Crash Course Variables from a form are the name of the attribute from the submitting form.
    [Show full text]
  • Kdump and Introduction to Vmcore Analysis How to Get Started with Inspecting Kernel Failures
    KDUMP AND INTRODUCTION TO VMCORE ANALYSIS HOW TO GET STARTED WITH INSPECTING KERNEL FAILURES PATRICK LADD TECHNICAL ACCOUNT MANAGER, RED HAT [email protected] slides available at https://people.redhat.com/pladd SUMMARY TOPICS TO BE COVERED WHAT IS A VMCORE, AND WHEN IS IS CAPTURED? CONFIGURATION OF THE KDUMP UTILITY AND TESTING SETTING UP A VMCORE ANALYSIS SYSTEM USING THE "CRASH" UTILITY FOR INITIAL ANALYSIS OF VMCORE CONTENTS WHAT IS A VMCORE? It is the contents of system RAM. Ordinarily, captured via: makedumpfile VMWare suspend files QEMU suspend-to-disk images # hexdump -C vmcore -s 0x00011d8 -n 200 000011d8 56 4d 43 4f 52 45 49 4e 46 4f 00 00 4f 53 52 45 |VMCOREINFO..OSRE| 000011e8 4c 45 41 53 45 3d 32 2e 36 2e 33 32 2d 35 37 33 |LEASE=2.6.32-573| 000011f8 2e 32 32 2e 31 2e 65 6c 36 2e 78 38 36 5f 36 34 |.22.1.el6.x86_64| 00001208 0a 50 41 47 45 53 49 5a 45 3d 34 30 39 36 0a 53 |.PAGESIZE=4096.S| 00001218 59 4d 42 4f 4c 28 69 6e 69 74 5f 75 74 73 5f 6e |YMBOL(init_uts_n| 00001228 73 29 3d 66 66 66 66 66 66 66 66 38 31 61 39 36 |s)=ffffffff81a96| 00001238 39 36 30 0a 53 59 4d 42 4f 4c 28 6e 6f 64 65 5f |960.SYMBOL(node_| 00001248 6f 6e 6c 69 6e 65 5f 6d 61 70 29 3d 66 66 66 66 |online_map)=ffff| 00001258 66 66 66 66 38 31 63 31 61 36 63 30 0a 53 59 4d |ffff81c1a6c0.SYM| 00001268 42 4f 4c 28 73 77 61 70 70 65 72 5f 70 67 5f 64 |BOL(swapper_pg_d| 00001278 69 72 29 3d 66 66 66 66 66 66 66 66 38 31 61 38 |ir)=ffffffff81a8| 00001288 64 30 30 30 0a 53 59 4d 42 4f 4c 28 5f 73 74 65 |d000.SYMBOL(_ste| 00001298 78 74 29 3d 66 66 66 66 |xt)=ffff| 000012a0 WHEN IS ONE WRITTEN? By default, when the kernel encounters a state in which it cannot gracefully continue execution.
    [Show full text]
  • COMP26120 Academic Session: 2018-19 Lab Exercise 3: Debugging
    COMP26120 Academic Session: 2018-19 Lab Exercise 3: Debugging; Arrays and Memory Management Duration: 1 lab session For this lab exercise you should do all your work on your ex3 branch. Important: Read the supporting material on (i) pointers and arrays, and (ii) how to debug C programs before the lab starts. Learning Objectives At the end of this lab you should be able to: 1. Identify some common mistakes related to strings and memory management in C; 2. Use structs, unions, pointers, malloc and free in C; 3. Explain some fundamental differences between C and Java - the explicit use of pointers and of memory management; 4. Use GDB and valgrind to help debug C programs. Introduction We strongly recommend you review the lecture slides, and the two sets of reading material on pointers and arrays and debugging before starting this lab. See the course unit website for these documents. You might also find The GNU C Programming Tutorial helpful now and throughout this course. The relevant parts to this lab are Pointers, Strings, and Data Structures. Part 1 In this part you will take the provided C program broken.c and produce a C program fixed.c and a text file part1.txt describing what you did. You do not need to get to the end of this part to get full marks. You need to have made some reasonable progress and write down what you did. You will also need to demonstrate how to use a debugger and Valgrind to the TA and explain what they do. 1 This program (fixed) should take a single string as input on the command line and print the result of making the first letter of each word upper-case and the rest of the letters lower-case.
    [Show full text]
  • Pointers, Arrays, Memory: AKA the Cause of Those F@#)(#@*( Segfaults
    Computer Science 61C Spring 2020 Weaver Pointers, Arrays, Memory: AKA the cause of those F@#)(#@*( Segfaults 1 Agenda Computer Science 61C Spring 2020 Weaver • Pointers Redux • This is subtle and important, so going over again • Arrays in C • Memory Allocation 2 Address vs. Value Computer Science 61C Spring 2020 Weaver • Consider memory to be a single huge array • Each cell of the array has an address associated with it • Each cell also stores some value • For addresses do we use signed or unsigned numbers? Negative address?! • Don’t confuse the address referring to a memory location with the value stored there 101 102 103 104 105 ... ... 23 42 ... 3 Pointers Computer Science 61C Spring 2020 Weaver • An address refers to a particular memory location; e.g., it points to a memory location • Pointer: A variable that contains the address of a variable Location (address) 101 102 103 104 105 ... ... 23 42 104 ... x y p name 4 Types of Pointers Computer Science 61C Spring 2020 Weaver • Pointers are used to point to any kind of data (int, char, a struct, etc.) • Normally a pointer only points to one type (int, char, a struct, etc.). • void * is a type that can point to anything (generic pointer) • Use void * sparingly to help avoid program bugs, and security issues, and other bad things! • You can even have pointers to functions… • int (*fn) (void *, void *) = &foo • fn is a function that accepts two void * pointers and returns an int and is initially pointing to the function foo. • (*fn)(x, y) will then call the function 5 More C Pointer Dangers Computer Science 61C Spring 2020 Weaver • Declaring a pointer just allocates space to hold the pointer – it does not allocate the thing being pointed to! • Local variables in C are not initialized, they may contain anything (aka “garbage”) • What does the following code do? void f() { int *ptr; *ptr = 5; } 6 NULL pointers..
    [Show full text]
  • Automating Problem Analysis and Triage Sasha Goldshtein @Goldshtn Production Debugging
    Automating Problem Analysis and Triage Sasha Goldshtein @goldshtn Production Debugging Requirements Limitations • Obtain actionable • Can’t install Visual information about Studio crashes and errors • Can’t suspend • Obtain accurate production servers performance • Can’t run intrusive information tools In the DevOps Process… Automatic build (CI) Automatic Automatic deployment remediation (CD) Automatic Automatic error triage monitoring and analysis Dump Files Dump Files • A user dump is a snapshot of a running process • A kernel dump is a snapshot of the entire system • Dump files are useful for post-mortem diagnostics and for production debugging • Anytime you can’t attach and start live debugging, a dump might help Limitations of Dump Files • A dump file is a static snapshot • You can’t debug a dump, just analyze it • Sometimes a repro is required (or more than one repro) • Sometimes several dumps must be compared Taxonomy of Dumps • Crash dumps are dumps generated when an application crashes • Hang dumps are dumps generated on-demand at a specific moment • These are just names; the contents of the dump files are the same! Generating a Hang Dump • Task Manager, right- click and choose “Create Dump File” • Creates a dump in %LOCALAPPDATA%\Te mp Procdump • Sysinternals utility for creating dumps • Examples: Procdump -ma app.exe app.dmp Procdump -ma -h app.exe hang.dmp Procdump -ma -e app.exe crash.dmp Procdump -ma -c 90 app.exe cpu.dmp Procdump -m 1000 -n 5 -s 600 -ma app.exe Windows Error Reporting • WER can create dumps automatically
    [Show full text]