The Usage of Pointers, Arrays, and Structures

Total Page:16

File Type:pdf, Size:1020Kb

The Usage of Pointers, Arrays, and Structures The Usage of Pointers, Arrays, and Structures James Daly December 9, 2012 1 Introduction In 1968, the Association for Computing Machinery (ACM) proposed a sequence of eight courses that would provide the core of the computer science curriculum[3]. While their recommendations have changed signif- icantly over the years, their recommendations continue to influence how computer science is taught to this day. In particular, \CS1" is still used to refer to the introductory computer science course and \CS2" to the data structures course. The CS1 course typically covers such topics as basic language syntax, conditionals, looping, structures and objects, arrays, and pointers. Pointers are often considered to be one of the hardest concepts for novice programmers to understand and are usually one of their first stumbling blocks [8]. Pointers are also one of the foundations of the field and form the basis for most of the abstract data structures (ADS) that are traditionally taught during CS2. Without understanding pointers, students will not be able to understand the ADS or many other of the areas of the field. In hindsight, it should come as no surprise that many students find pointers very difficult. In the C++ programming language, pointers have no fewer than three operators associated with them: "*", the dereference operator; "&", the reference operator; and "->", the dereference and access operator. The fact that the asterisk is also used to declare a pointer, but it is the ampersand that is used to create one from an existing object probably does not help to alleviate confusion. This complicated syntax is one of the reasons that pointers are difficult for novice programmers [15]. This is supported by multiple studies showing that students learning Java (which has simplified and restricted pointer syntax) have an easier time understanding pointers than students who learn C++ [8, 9]. It is unclear from the articles whether such students are having an easier time because they are working with simplified syntax or if it carries over when they begin to learn C++. The addition of pointers also necessitates the addition of memory management. Novice programmers make frequent errors either allocating or deallocating memory [1]. Failing to allocate memory at the right time or to reassign a pointer to a safe value after deleting an object can create a wild pointer. Wild pointers are like time bombs that may crash a program when they are finally accessed. Failure to delete an object when the student should have causes a memory leak which can slowly sap resources as the leaks pile up. Finally, freeing memory that was never allocated (or has already been deallocated) is its own crash-worthy bug. As such, there are so many things that an intro programming student must get right that it is surprising that so many of them do pass the class. Several systems have been proposed to help students identify common mistakes that they may make with pointers [11, 1]. These systems, especially the Dereferee library by Allevato et al. can identify many potential problems like wild pointer accesses and pointer arithmetic making it much easier for students to identify what is wrong with their program. Alleveto believes that this is much more efficient than the common novice strategy of using trace statements to output variable states. While Dereferee can help the students identify what is wrong with their programs, other solutions are needed to help them understand the system well enough to not make the mistakes in the first place. 1 2 Background In a modern \objects-first” style to teaching, introductory computer science students are quickly taught how to encapsulate primitive data types (such as integers, floating-point numbers, or characters) into custom composite structures (or classes) [6]. These classes group data that is logically related into a single unit. A particular instance of a class is called an object. For example, a Complex data type can be defined that has two values representing the real and imaginary parts of a complex number. When a data type or object is to be passed to a function for processing, this can be done in two ways. In the first way, a copy of the object is made for the receiving function. The function can make modifications to its copy during whatever operations it performs, but the original copy will be unchanged. This is called pass by value semantics. The alternative is to pass to the function the location of the object. This allows the function to make changes that will be reflected in the calling function since it has access to the original object. This is called pass by reference semantics. This idea is closely related to the idea of a pointer. A pointer is a special data type whose value is the memory location of an object. In this case, the pointer is said to reference the other object. By dereferencing the pointer, this object can be read or modified. Another special data type is an array. Arrays are collections of data objects that are stored sequentially in memory. Arrays may be defined by having a pointer to the first object in the array. Other objects in the array can be referenced by adding multiples of the object size to the pointer value to get the location of the other objects. As such, pointers and arrays are almost semantically equivalent. Finally, the presence of pointers and arrays creates the problem of managing memory. It is frequently necessary to allocate new objects on the heap with the new command. These objects must be deallocated at some later date with the delete command or else that memory will be lost (or leaked). However, an object that still needs to be accessed should not be deleted or else a wild pointer will be created. Wild pointers have undefined behavior and may silently cause problems. Additionally, two pointers may both point to the same object and should not both be deleted (since they refer to the same object and each object should be deleted precisely once). As such, the semantics of when to delete an object can easily be nontrivial. Aside from the non-trivialities of properly allocating and deallocating memory, many students find point- ers difficult for other reasons. As mentioned in the introduction, the complicated syntax is one of the confounding factors making pointers difficult to understand [15]. Another author believes that the main reason is that novices often have a weak understanding of variables in general [7]. This suggests that the main problem may be that the students do not completely understand variables and as such are failing to transfer their knowledge to understanding pointers. Additionally, variables are a fairly abstract idea and pointers are another layer of abstraction added on top of this. It is not possible to physically observe the values stored in memory (although a debugger can give a good approximation of it) and the relationships that pointers have to objects is difficult to represent. According to Chi, this makes the concept of pointers much more difficult to learn [5]. Furthermore, it is not sufficient for students must be able to correctly apply pointers. This is a higher level of Bloom's taxonomy than if they simply had to be able to recall pointer syntax or understand pointer theory. The objective of this project is to explore these difficulties that students have and to determine ways to improve student understanding of pointers and their ability to apply them. After completing the CS1 course, the students should be able to collect data types together into classes and to then instantiate them as objects. They should also be able to acquire and dereference pointers to these objects and to create arrays of them. Additionally, they should be able to tell when to use a pointer and when they should use an object (and by association when to use pass by reference and when to use pass by value). Finally, they should be able to allocate and deallocate objects without leaking memory or creating wild pointers. These skills are necessary for the student to be able to take the CS2 (Abstract Data Structures) and more advanced courses. Finally, the CS1 course should lay the groundwork for the students to be able to independently frame and solve problems. In How People Learn, the authors review several surveys which analyze the differences between novices and experts and found that experts are much better at being able to notice patterns and are better able to use those patterns to solve new problems [10]. Several of the other courses, most notably CS2, 2 are designed for teaching students lots of tools and patterns to use for solving new problems. In contrast, the CS1 course teaches more basic building blocks rather than the more advanced schemata. However, the students should begin to become comfortable with the basics of design. 3 Pre-Assessment At Michigan State University, computer science students are required to take an introductory Python course before they take the C++ course. As such, they will already have seen many of the above ideas, albeit in a limited form and a different guise. Thus, we will create and administer a pre-assessment to determine how much they recall from their Python class and see how well they can use it to predict the behavior of similar situations in C++. This pre-assessment will not count towards their grade but rather serve as a starting point for the unit. Our pre-assessment will be a Background Knowledge Probe [2] where the students are given several short programs and they have to identify what each of the programs output. This quiz will have two parts to it.
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]