stack and heap commonly abused terms
play

STACK AND HEAP: COMMONLY ABUSED TERMS Simon Brand Codeplay Soware - PowerPoint PPT Presentation

Aug 08, 2023 •390 likes •637 views

STACK AND HEAP: COMMONLY ABUSED TERMS Simon Brand Codeplay Soware Ltd. AGENDA A bit about me What misuse am I talking about? Why is it wrong? What does the standard say? What terms should we use instead? C++ AND ME Work with C++ daily

  1. STACK AND HEAP: COMMONLY ABUSED TERMS Simon Brand Codeplay So�ware Ltd.

  2. AGENDA A bit about me What misuse am I talking about? Why is it wrong? What does the standard say? What terms should we use instead?

  3. C++ AND ME Work with C++ daily Active on Stack Overflow (C++ gold badge) Technically on the standards committee Interested in metaprogramming and dark corners

  4. WHAT MISUSE AM I TALKING ABOUT? static int a; static int b = 93; void foo (int c) { int d = 42; } int main() { auto e = new int{314}; foo(*e); } a .bss binary section b .data binary section c register d stack *e heap

  5. .file "test.cpp" .intel_syntax noprefix .local _ZL1a .comm _ZL1a,4,4 ;a in .bss (name,size,align) .data ;b in .data .align 4 .type _ZL1b, @object .size _ZL1b, 4 _ZL1b: .long 93 a .bss binary section b .data binary section

  6. main: ; ... call _Znwm ;allocate e with new mov DWORD PTR [rax], 314 ;store 314 at *e mov QWORD PTR [rbp-8], rax ;put e on stack mov rax, QWORD PTR [rbp-8] mov eax, DWORD PTR [rax] ;put *e in register mov edi, eax ;put *e in arg register call _Z3fooi ; ... c passed in register *e free store

  7. _Z3fooi: ;start of foo .LFB0: .cfi_startproc push rbp .cfi_def_cfa_offset 16 .cfi_offset 6, -16 mov rbp, rsp .cfi_def_cfa_register 6 mov DWORD PTR [rbp-20], edi ;move c from reg to stack mov DWORD PTR [rbp-4], 42 ;d on stack nop pop rbp .cfi_def_cfa 7, 8 ret .cfi_endproc c passed in register, stored on stack d stack

  8. "CORRECT" ANSWER static int a; static int b = 93; void foo (int c) { int d = 42; } int main() { auto e = new int{314}; foo(*e); } a .bss binary section b .data binary section c passed in register, stored on stack d stack *e free store

  10. WHY IS IT WRONG? Lets turn on optimizations static int a; static int b = 4; void foo (int c) { int d = 42; } int main() { auto e = new int{314}; foo(*e); } a Optimized out b Optimized out c Optimized out d Optimized out *e Free store

  11. .file "test.cpp" .intel_syntax noprefix a Optimized out b Optimized out

  12. main: .LFB1: .cfi_startproc sub rsp, 8 .cfi_def_cfa_offset 16 mov edi, 4 call _Znwm ;allocates e xor eax, eax add rsp, 8 .cfi_def_cfa_offset 8 ret .cfi_endproc c Optimized out *e Free store

  13. _Z3fooi: .LFB0: .cfi_startproc rep ret .cfi_endproc c Optimized out d Optimized out

  14. You can't know how things will be allocated in the general case.

  15. What does the standard say about stacks and heaps? NOTHING.

  16. C++ is built on abstractions. The standard does not define storage location , it defines storage duration .

  17. [basic.stc]/1: Storage duration is the property of an object that defines the minimum potential lifetime of the storage containing the object. The storage duration is determined by the construct used to create the object and is one of the following: static storage duration thread storage duration automatic storage duration dynamic storage duration

  18. STATIC STORAGE DURATION static int a; static int b = 42; void foo() { static int c = 4; } struct Bar { const static int d = 2; };

  19. THREAD STORAGE DURATION thread_local int a; thread_local int b = 42; void foo() { thread_local int ill_formed; static thread_local int c; } struct Bar { thread_local int d; };

  20. AUTOMATIC STORAGE DURATION void foo(int a) { int b; register int c; }

  21. DYNAMIC STORAGE DURATION int* a = new int{}; void foo() { int* b = new int{}; }

  22. What is the storage duration of the ints? static int a; static int b = 93; void foo (int c) { int d = 42; } int main() { auto e = new int{314}; foo(*e); } a Static b Static c Automatic d Automatic *e Dynamic

  23. A rule of thumb: Only refer to the storage location if you need to discuss where a variable is physically located. In all other cases, refer to the storage duration

  24. Blog: https://tartanllama.github.io Email: simon@codeplay.com Twitter: @TartanLlama Codeplay: www.codeplay.com

Recommend

A heap, a stack, a bottle and a rack The Stack Canary Birds The heap Answer: The first three

A heap, a stack, a bottle and a rack The Stack Canary Birds The heap Answer: The first three

A heap, a stack, a bottle and a rack The Stack Canary Birds The heap Answer: The first three segments are: code , read-only data and global data for the running process gurka. Then there is a segment for the heap . The segment marked with

399 views • 10 slides
Stack Stack Heap Heap Data Data Text Text Program A Program B Stack Stack Text Heap

Stack Stack Heap Heap Data Data Text Text Program A Program B Stack Stack Text Heap

Stack Stack Heap Heap Data Data Text Text Program A Program B Stack Stack Text Heap Heap Data Data Text Text Text Program A Program B Physical Memory Stack Stack Stack Heap Stack Kernel Heap Heap Data Heap Data

1.17k views • 62 slides
Drug-Testing Requirements for Companies An Overview of the SAMHSA 5 Commonly-Abused Drugs

Drug-Testing Requirements for Companies An Overview of the SAMHSA 5 Commonly-Abused Drugs

Drug-Testing Requirements for Companies An Overview of the SAMHSA 5 Commonly-Abused Drugs Depending on the type of business, many companies fall under federal and state regulations that require employee drug testing. Certain industries,

357 views • 3 slides
Last week Data can be allocated on the stack or on the heap (aka dynamic memory) or on the heap

Last week Data can be allocated on the stack or on the heap (aka dynamic memory) or on the heap

Last week Data can be allocated on the stack or on the heap (aka dynamic memory) or on the heap (aka dynamic memory) Data on the stack is allocated automatically when we do a function call, and removed when we return ll d d h t f() {

605 views • 25 slides
Heap-stack Diagram Sanzheng Qiao McMaster University November, 2011 Sizes of Objects

Heap-stack Diagram Sanzheng Qiao McMaster University November, 2011 Sizes of Objects

Sizes of Objects Generating Heap-stack Diagrams Example Heap-stack Diagram Sanzheng Qiao McMaster University November, 2011 Sizes of Objects Generating Heap-stack Diagrams Example Outline 1 Sizes of Objects 2 Generating Heap-stack

246 views • 12 slides
Processs Address Space Linux Address Space 0x7fffffff Stack Data (Heap) Data (Heap)

Processs Address Space Linux Address Space 0x7fffffff Stack Data (Heap) Data (Heap)

10/21/2014 Processes, Address Spaces, and PROCESS Memory Management A running program and its associated data Jonathan Misurda jmisurda@cs.pitt.edu Processs Address Space Linux Address Space 0x7fffffff Stack Data (Heap) Data (Heap)

579 views • 3 slides
Buffer Overflow Attacks IA32 Linux Stack Higher Addresses Virtual Address Space Heap Data

Buffer Overflow Attacks IA32 Linux Stack Higher Addresses Virtual Address Space Heap Data

Buffer Overflow Attacks IA32 Linux Stack Higher Addresses Virtual Address Space Heap Data Text Lower Addresses Stack and Base Pointers Stack is made up of stack frames Stack frames contain: parameters, local variables, return

604 views • 45 slides
CSCI261 Lecture 27: Events, Interrupts & Event Handling Memory, Stack, Stack Frames, The Heap

CSCI261 Lecture 27: Events, Interrupts & Event Handling Memory, Stack, Stack Frames, The Heap

CSCI261 Lecture 27: Events, Interrupts & Event Handling Memory, Stack, Stack Frames, The Heap Attribution: http://123rf.com keypress Keyboard Interface (Serial USB) Bus CPU Operating System Application keypress Keyboard Interface

357 views • 25 slides
SIPBs IAP Programming in C Pointers, and Arrays Memory and Addresses stack stack grows

SIPBs IAP Programming in C Pointers, and Arrays Memory and Addresses stack stack grows

SIPBs IAP Programming in C Pointers, and Arrays Memory and Addresses stack stack grows down - C programs exist inside a memory space (unmapped) - That memory space is a sequence of bytes heap grows heap up - Each of those bytes

900 views • 77 slides
Processes pid = 1000 pid = 1001 stack stack heap heap data/globals data/globals code code

Processes pid = 1000 pid = 1001 stack stack heap heap data/globals data/globals code code

Processes pid = 1000 pid = 1001 stack stack heap heap data/globals data/globals code code file descriptor table: file descriptor table: 1 2 3 1 2 3 saved registers: saved registers: %rax %rbx %rcx %rax %rbx %rcx

715 views • 7 slides
The heap hic 1 Limitations of the stack int *table_of(int num, int len) { int table[len+1];

The heap hic 1 Limitations of the stack int *table_of(int num, int len) { int table[len+1];

The heap hic 1 Limitations of the stack int *table_of(int num, int len) { int table[len+1]; for (int i=0; i <= len; i++) { table[i] = i*num; } return table; /* an int[] can be used as an int* */ } What happens if we call the function

524 views • 37 slides
beta blocker [http://tai-studio.org] stack pickup heap counter BetaBlocker ? motivation

beta blocker [http://tai-studio.org] stack pickup heap counter BetaBlocker ? motivation

Computation as material in audio livecoding Dr. Till Bovermann, Department of Media, Aalto University, Finland beta blocker [http://tai-studio.org] stack pickup heap counter BetaBlocker ? motivation motivation writing and listening to

418 views • 10 slides
Value types are on the stack, reference types are on the heap C# PROGRAMMER ANSWERING

Value types are on the stack, reference types are on the heap C# PROGRAMMER ANSWERING

Value types are on the stack, reference types are on the heap C# PROGRAMMER ANSWERING INTERVIEW QUESTION 1 18.07.2020 WORLD OF UNSAFE - ADAM FURMANEK World of Unsafe CONTACT@ADAMFURMANEK.PL HTTP://BLOG.ADAMFURMANEK.PL FURMANEKADAM 2

693 views • 43 slides
PROGRAM HEAP 2020-2021 WHAT IS HEAP? HEAP is a federally funded program that assists low

PROGRAM HEAP 2020-2021 WHAT IS HEAP? HEAP is a federally funded program that assists low

ERIE COUNTY DEPARTMENT OF SOCIAL SERVICES Program Overview PROGRAM HEAP 2020-2021 WHAT IS HEAP? HEAP is a federally funded program that assists low income households to reduce energy expense s. HEAP PROGRAMS Regular HEAP Available

531 views • 14 slides
the stack & the heap hic 1 memory management So far: data representations: how are

the stack & the heap hic 1 memory management So far: data representations: how are

memory management the stack & the heap hic 1 memory management So far: data representations: how are individual data elements represented in memory? pointers and pointer arithmetic to find out where data is allocated Now: memory

230 views • 21 slides
Context: States as graphs heap stack Objects & method frames as nodes Graph-Based State

Context: States as graphs heap stack Objects & method frames as nodes Graph-Based State

Context: States as graphs heap stack Objects & method frames as nodes Graph-Based State Spaces Relations & variables as (labelled) edges Cell Object val next Arend Rensink next first last University of Twente Cell

317 views • 10 slides
Concepts Introduced in Chapter 7 Storage Allocation Strategies Static Stack Heap

Concepts Introduced in Chapter 7 Storage Allocation Strategies Static Stack Heap

Concepts Introduced in Chapter 7 Storage Allocation Strategies Static Stack Heap Activation Records Access to Nonlocal Names Access links followed by Fig. 7.1 1 EECS 665 Compiler Construction Activation Records An

494 views • 16 slides
Heapsort Build-Max-Heap Next we build a full heap from an unsorted sequence Build-Max-Heap(A)

Heapsort Build-Max-Heap Next we build a full heap from an unsorted sequence Build-Max-Heap(A)

Heapsort Build-Max-Heap Next we build a full heap from an unsorted sequence Build-Max-Heap(A) for i = floor( A.length/2 ) to 1 Max-Heapify(A, i) Build-Max-Heap Red part is already Heapified Build-Max-Heap Correctness: Base: Each alone

429 views • 23 slides
COMMONLY USED ABBREVIATIONS AND TERMS in CLINCAL TRIALS Abbreviation Definition ADR Adverse Drug

COMMONLY USED ABBREVIATIONS AND TERMS in CLINCAL TRIALS Abbreviation Definition ADR Adverse Drug

COMMONLY USED ABBREVIATIONS AND TERMS in CLINCAL TRIALS Abbreviation Definition ADR Adverse Drug Reaction AE Adverse Event AUC Area Under the Curve BLA Biologic Licensing Application BUN Blood Urea Nitrogen CAP College of American

157 views • 3 slides
STATIC DATA STACK CODE HEAP

STATIC DATA STACK CODE HEAP

617 views • 3 slides
Windows 8 Heap Internals Windows 8 Heap Internals Windows 8 Heap Internals INTRODUCTION Windows 8

Windows 8 Heap Internals Windows 8 Heap Internals Windows 8 Heap Internals INTRODUCTION Windows 8

Windows 8 Heap Internals Windows 8 Heap Internals Windows 8 Heap Internals INTRODUCTION Windows 8 Heap Internals Who Chris Valasek (@nudehaberdasher) Sr. Research Scientist Coverity Tarjei Mandt (@kernelpool) Vulnerability

1.33k views • 91 slides
Dynamic Memory Allocation in the Heap (malloc and free) Explicit allocators (a.k.a. manual memory

Dynamic Memory Allocation in the Heap (malloc and free) Explicit allocators (a.k.a. manual memory

Dynamic Memory Allocation in the Heap (malloc and free) Explicit allocators (a.k.a. manual memory management) Heap Allocation Addr Perm Contents Managed by Initialized Stack 2 N -1 RW Procedure context Compiler Run-time Programmer,

565 views • 31 slides
Binding the Daemon FreeBSD Kernel Stack and Heap Exploitation Patroklos (argp) Argyroudis

Binding the Daemon FreeBSD Kernel Stack and Heap Exploitation Patroklos (argp) Argyroudis

Binding the Daemon FreeBSD Kernel Stack and Heap Exploitation Patroklos (argp) Argyroudis argp@census-labs.com Outline Introduction Why target the kernel? Why target FreeBSD? Background Related work Exploitation

1.55k views • 56 slides
Memory Management Guest lecture by Junfeng Yang Outline Dynamic memory allocation Stack

Memory Management Guest lecture by Junfeng Yang Outline Dynamic memory allocation Stack

COMS 3995: Networks, Operating Systems and Security Memory Management Guest lecture by Junfeng Yang Outline Dynamic memory allocation Stack Heap Heap allocation strategies Intro to memory management Paging 1 Dynamic

770 views • 43 slides

More recommend