Tweet
Tweet

Slide 1

Slide 1 text

JESÚS ESPINO PRINCIPAL ENGINEER @ MATTERMOST warmup Understanding the memory model of 5 languages/ Or most of them DEVOXX FRANCE 2024

Slide 2

Slide 2 text

warmup Introduction DEVOXX FRANCE 2024

Slide 3

Slide 3 text

Thematic DEVELOPMENT & LANGUAGES DEVOXX FRANCE 2024 Introduction The Heap & the Stack DEVOXX FRANCE 2024

Slide 4

Slide 4 text

The Heap DEVOXX FRANCE 2024 The Stack function X: local variable a (int32) local variable b (int32) function Y: local variable c (int32) local variable d (int64) function Z: local variable e (int64) local variable f (int64) call X call Y call Z call Y

Slide 5

Slide 5 text

The Heap DEVOXX FRANCE 2024 The Stack function X: local variable a (int32) local variable b (int32) function Y: local variable c (int32) local variable d (int64) function Z: local variable e (int64) local variable f (int64) call X call Y call Z call Y a = ? b = ? 8 bytes

Slide 6

Slide 6 text

The Heap DEVOXX FRANCE 2024 The Stack function X: local variable a (int32) local variable b (int32) function Y: local variable c (int32) local variable d (int64) function Z: local variable e (int64) local variable f (int64) call X call Y call Z call Y a = ? b = ? 8 bytes c = ? d = ? 12 bytes

Slide 7

Slide 7 text

The Heap DEVOXX FRANCE 2024 The Stack function X: local variable a (int32) local variable b (int32) function Y: local variable c (int32) local variable d (int64) function Z: local variable e (int64) local variable f (int64) call X call Y call Z call Y a = ? b = ? 8 bytes c = ? d = ? 12 bytes

Slide 8

Slide 8 text

The Heap DEVOXX FRANCE 2024 The Stack function X: local variable a (int32) local variable b (int32) function Y: local variable c (int32) local variable d (int64) function Z: local variable e (int64) local variable f (int64) call X call Y call Z call Y a = ? b = ? 8 bytes e = ? f = ? 16 bytes

Slide 9

Slide 9 text

The Heap DEVOXX FRANCE 2024 The Stack function X: local variable a (int32) local variable b (int32) function Y: local variable c (int32) local variable d (int64) function Z: local variable e (int64) local variable f (int64) call X call Y call Z call Y a = ? b = ? 8 bytes e = ? f = ? 16 bytes

Slide 10

Slide 10 text

The Heap DEVOXX FRANCE 2024 The Stack function X: local variable a (int32) local variable b (int32) function Y: local variable c (int32) local variable d (int64) function Z: local variable e (int64) local variable f (int64) call X call Y call Z call Y c = ? d = ? 12 bytes

Slide 11

Slide 11 text

The Heap DEVOXX FRANCE 2024 The Stack function X: local variable a (int32) local variable b (int32) function Y: local variable c (int32) local variable d (int64) function Z: local variable e (int64) local variable f (int64) call X call Y call Z call Y c = ? d = ? 12 bytes

Slide 12

Slide 12 text

The Heap DEVOXX FRANCE 2024 The Heap x = malloc(32) free(x) y = malloc(64) z = malloc(128) free(y) free(z)

Slide 13

Slide 13 text

The Heap DEVOXX FRANCE 2024 The Heap x = malloc(32) free(x) y = malloc(64) z = malloc(128) free(y) free(z)

Slide 14

Slide 14 text

The Heap DEVOXX FRANCE 2024 The Heap x = malloc(32) free(x) y = malloc(64) z = malloc(128) free(y) free(z)

Slide 15

Slide 15 text

The Heap DEVOXX FRANCE 2024 The Heap x = malloc(32) free(x) y = malloc(64) z = malloc(128) free(y) free(z)

Slide 16

Slide 16 text

The Heap DEVOXX FRANCE 2024 The Heap x = malloc(32) free(x) y = malloc(64) z = malloc(128) free(y) free(z)

Slide 17

Slide 17 text

The Heap DEVOXX FRANCE 2024 The Heap x = malloc(32) free(x) y = malloc(64) z = malloc(128) free(y) free(z)

Slide 18

Slide 18 text

The Heap DEVOXX FRANCE 2024 The Heap x = malloc(32) free(x) y = malloc(64) z = malloc(128) free(y) free(z)

Slide 19

Slide 19 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y }

Slide 20

Slide 20 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y } Stack Frame (main) x = 0

Slide 21

Slide 21 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y } Stack Frame (main) x = 0

Slide 22

Slide 22 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y } Stack Frame (main) x = 0 Stack Frame (sum) x = 3 y = 5

Slide 23

Slide 23 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y } Stack Frame (main) x = 0 Stack Frame (sum) x = 3 y = 5

Slide 24

Slide 24 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y } Stack Frame (main) x = 8 Stack Frame (sum) x = 3 y = 5

Slide 25

Slide 25 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y } Stack Frame (main) x = 8 Stack Frame (sum) x = 3 y = 5

Slide 26

Slide 26 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y } Stack Frame (main) x = 8 Stack Frame (fmt.Println) x = 8 …

Slide 27

Slide 27 text

Introduction DEVOXX FRANCE 2024 The Stack func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { return x + y } Stack Frame (main) x = 8 Stack Frame (fmt.Println) x = 8 …

Slide 28

Slide 28 text

Introduction DEVOXX FRANCE 2024 The Stack Problem func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { z := x + y return &z } Stack Frame (main) x = 0 Stack Frame (sum) x = 3 y = 5 z = 0

Slide 29

Slide 29 text

Introduction DEVOXX FRANCE 2024 The Stack Problem func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { z := x + y return &z } Stack Frame (main) x = 0 Stack Frame (sum) x = 3 y = 5 z = 8

Slide 30

Slide 30 text

Introduction DEVOXX FRANCE 2024 The Stack Problem func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { z := x + y return &z } Stack Frame (main) x = 0 Stack Frame (sum) x = 3 y = 5 z = 8

Slide 31

Slide 31 text

Introduction DEVOXX FRANCE 2024 The Stack Problem func main() { x := sum(3, 5) fmt.Println(x) } func sum(x, y int) int { z := x + y return &z } Stack Frame (main) x = 0xFA3C Stack Frame (sum) x = 3 y = 5 z = 8

Slide 32

Slide 32 text

Introduction DEVOXX FRANCE 2024 The Stack Problem 2 func main() { list := []int{} for x:=0; x

Slide 33

Slide 33 text

Introduction DEVOXX FRANCE 2024 The Heap func main() { size := rand.Intn(100) list := malloc(sizeof(int)*size) for x:=0; x

Slide 34

Slide 34 text

Introduction DEVOXX FRANCE 2024 The Heap func main() { size := rand.Intn(100) list := malloc(sizeof(int)*size) for x:=0; x

Slide 35

Slide 35 text

Introduction DEVOXX FRANCE 2024 The Heap func main() { size := rand.Intn(100) list := malloc(sizeof(int)*size) for x:=0; x

Slide 36

Slide 36 text

Introduction DEVOXX FRANCE 2024 The Heap func main() { size := rand.Intn(100) list := malloc(sizeof(int)*size) for x:=0; x

Slide 37

Slide 37 text

Introduction DEVOXX FRANCE 2024 The Heap func main() { size := rand.Intn(100) list := malloc(sizeof(int)*size) for x:=0; x

Slide 38

Slide 38 text

Introduction DEVOXX FRANCE 2024 The Heap func main() { size := rand.Intn(100) list := malloc(sizeof(int)*size) for x:=0; x

Slide 39

Slide 39 text

Introduction DEVOXX FRANCE 2024 The Heap func main() { size := rand.Intn(100) list := malloc(sizeof(int)*size) for x:=0; x

Slide 40

Slide 40 text

Introduction DEVOXX FRANCE 2024 The Heap func main() { size := rand.Intn(100) list := malloc(sizeof(int)*size) for x:=0; x

Slide 41

Slide 41 text

/ SUMMARY DEVOXX FRANCE 2024 summary 1. The manual model C 2. Ownership and borrowing Rust 3. Reference counting Python 4. Mark and Sweep Go 5. Mark and Sweep (Generational) Java

Slide 42

Slide 42 text

Thematic DEVELOPMENT & LANGUAGES DEVOXX FRANCE 2024 The manual model C DEVOXX FRANCE 2024

Slide 43

Slide 43 text

/ Manual Model DEVOXX FRANCE 2024 C 1. Everything goes to the stack 2. You manually ask for heap space 3. Use the heap for dynamic size entities 4. Use the heap for entities that survive the function call

Slide 44

Slide 44 text

Thematic DEVELOPMENT & LANGUAGES DEVOXX FRANCE 2024 Ownership and Borrowing Rust DEVOXX FRANCE 2024

Slide 45

Slide 45 text

/ Ownership and Borrowing DEVOXX FRANCE 2024 RUST 1. Basic types goes to the stack 2. Some types use space in the heap 3. You lend or give objects to other functions 4. The owner of the function frees the heap memory on finish

Slide 46

Slide 46 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 0, cap: 0, ptr: 0} x = 0

Slide 47

Slide 47 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 0, cap: 0, ptr: 0} x = 1

Slide 48

Slide 48 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 1, cap: 1, ptr: 0xFCA1} x = 1 1

Slide 49

Slide 49 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 2, cap: 2, ptr: 0xFCBA} x = 2 1 1 2

Slide 50

Slide 50 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 3, cap: 4, ptr: 0xFCCA} x = 3 1 2 1 2 3 0

Slide 51

Slide 51 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 4, cap: 4, ptr: 0xFCCA} x = 4 1 2 3 4

Slide 52

Slide 52 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 5 1 2 3 0 1 2 3 4 5 0 0 0

Slide 53

Slide 53 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0

Slide 54

Slide 54 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0

Slide 55

Slide 55 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0

Slide 56

Slide 56 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(list) // otherstuff… } fn otherfunc(list: Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0

Slide 57

Slide 57 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(list) // otherstuff… } fn otherfunc(list: Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xFCFA}

Slide 58

Slide 58 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(list) // otherstuff… } fn otherfunc(list: Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xFCFA}

Slide 59

Slide 59 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(list) // otherstuff… } fn otherfunc(list: Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xFCFA}

Slide 60

Slide 60 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(list) // otherstuff… } fn otherfunc(list: Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xFCFA}

Slide 61

Slide 61 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(&list) // otherstuff… } fn otherfunc(list: &Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0

Slide 62

Slide 62 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(&list) // otherstuff… } fn otherfunc(list: &Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xCDA1}

Slide 63

Slide 63 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(&list) // otherstuff… } fn otherfunc(list: &Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xCDA1}

Slide 64

Slide 64 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(&list) // otherstuff… } fn otherfunc(list: &Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xCDA1}

Slide 65

Slide 65 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(&list) // otherstuff… } fn otherfunc(list: &Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xCDA1}

Slide 66

Slide 66 text

RUST DEVOXX FRANCE 2024 Rust Heap and Stack fn myfunc() { let mut list = Vec::new(); for x in 1..6 { list.push(x); } otherfunc(&list) // otherstuff… } fn otherfunc(list: &Vec) { println!("{:?}", list); } Stack Frame (myfunc) list = {len: 5, cap: 8, ptr: 0xFCFA} x = 6 1 2 3 4 5 6 0 0 Stack Frame (otherfunc) list = {len: 5, cap: 8, ptr: 0xCDA1}

Slide 67

Slide 67 text

Thematic DEVELOPMENT & LANGUAGES DEVOXX FRANCE 2024 Reference counting Python DEVOXX FRANCE 2024

Slide 68

Slide 68 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=2 7 rc=1 9 rc=1 8 rc=2

Slide 69

Slide 69 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=2 7 rc=1 9 rc=1 8 rc=2

Slide 70

Slide 70 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=2 7 rc=1 9 rc=0 8 rc=2

Slide 71

Slide 71 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=2 7 rc=1 8 rc=2

Slide 72

Slide 72 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=2 7 rc=1 8 rc=1

Slide 73

Slide 73 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=2 7 rc=1 9 rc=1 8 rc=1

Slide 74

Slide 74 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=2 7 rc=1 9 rc=1 8 rc=1

Slide 75

Slide 75 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=1 7 rc=1 9 rc=1 8 rc=1

Slide 76

Slide 76 text

Python DEVOXX FRANCE 2024 Reference Counting ROOT Globals Stacks 1 rc=1 2 rc=1 6 rc=1 3 rc=1 5 rc=1 4 rc=1 7 rc=1 9 rc=1 8 rc=1

Slide 77

Slide 77 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): size = 6 l = [] for x in range(size): l.append(x) print(l) Stack Frame (myfunc) list = 0 size = 0xAF1C x = 0 rc=1 value = 6

Slide 78

Slide 78 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): size = 6 l = [] for x in range(size): l.append(x) print(l) Stack Frame (myfunc) list = 0xFC1A size = 0xAF1C x = 0 rc=1 size=0 allocated=0 data=0 rc=1 value = 6

Slide 79

Slide 79 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): size = 6 l = [] for x in range(size): l.append(x) print(l) Stack Frame (myfunc) list = 0xFC1A size = 0xAF1C x = 0xFC2B rc=1 size=0 allocated=0 data=0 rc=1 value = 6 rc=1 value = 0

Slide 80

Slide 80 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): size = 6 l = [] for x in range(size): l.append(x) print(l) Stack Frame (myfunc) list = 0xFC1A size = 0xAF1C x = 0xFC2B rc=1 size=1 allocated=1 data=0xFD12 rc=1 value = 6 rc=2 value = 0 0xFC2B

Slide 81

Slide 81 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): size = 6 l = [] for x in range(size): l.append(x) print(l) Stack Frame (myfunc) list = 0xFC1A size = 0xAF1C x = 0xFC4B rc=1 size=1 allocated=1 data=0xFD12 rc=1 value = 6 rc=1 value = 0 0xFC2B rc=1 value = 1

Slide 82

Slide 82 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): size = 6 l = [] for x in range(size): l.append(x) print(l) Stack Frame (myfunc) list = 0xFC1A size = 0xAF1C x = 0xFC4B rc=1 size=2 allocated=2 data=0xFD42 rc=1 value = 6 rc=1 value = 0 0xFC2B 0xFC4B rc=2 value = 1 0xFC2B

Slide 83

Slide 83 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): size = 6 l = [] for x in range(size): l.append(x) print(l) Stack Frame (myfunc) list = 0xFC1A size = 0xAF1C x = 0xFD3A rc=1 size=8 allocated=6 data=0xFD82 rc=1 value = 6 rc=1 value = 0 0xFC2B 0xFC4B 0xFC8A 0xFCAC 0xFD1B 0xFD3A rc=1 value = 1 rc=1 value = 2 rc=1 value = 3 rc=1 value = 4 rc=1 value = 5

Slide 84

Slide 84 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): size = 6 l = [] for x in range(size): l.append(x) print(l) Stack Frame (myfunc) list = 0xFC1A size = 0xAF1C x = 0xFD3A rc=0 size=8 allocated=6 data=0xFD82 rc=0 value = 6 rc=0 value = 0 0xFC2B 0xFC4B 0xFC8A 0xFCAC 0xFD1B 0xFD3A rc=0 value = 1 rc=0 value = 2 rc=0 value = 3 rc=0 value = 4 rc=0 value = 5

Slide 85

Slide 85 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0 y = 0

Slide 86

Slide 86 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0 rc=1 value = 3

Slide 87

Slide 87 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0xFC24 rc=1 value = 3 rc=1 value = 4

Slide 88

Slide 88 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0xFC24 rc=1 value = 3 rc=1 value = 4

Slide 89

Slide 89 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0xFC24 rc=2 value = 3 rc=2 value = 4 Stack Frame (add) x = 0xFC12 y = 0xFC24 z = 0

Slide 90

Slide 90 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0xFC24 rc=2 value = 3 rc=2 value = 4 Stack Frame (add) x = 0xFC12 y = 0xFC24 z = 0xFC36 rc=1 value = 7

Slide 91

Slide 91 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0xFC24 rc=2 value = 3 rc=2 value = 4 Stack Frame (add) x = 0xFC12 y = 0xFC24 z = 0xFC36 rc=1 value = 7

Slide 92

Slide 92 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0xFC24 rc=2 value = 3 rc=2 value = 4 Stack Frame (add) x = 0xFC12 y = 0xFC24 z = 0xFC36 rc=1 value = 7

Slide 93

Slide 93 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0xFC24 rc=1 value = 3 rc=1 value = 4 Stack Frame (add) x = 0xFC12 y = 0xFC24 z = 0xFC36 rc=0 value = 7

Slide 94

Slide 94 text

Python DEVOXX FRANCE 2024 Python Heap and Stack def myfunc(): x = 3 y = 4 add(x, y) def add(x, y): z = x + y return z Stack Frame (myfunc) x = 0xFC12 y = 0xFC24 rc=0 value = 3 rc=0 value = 4

Slide 95

Slide 95 text

Thematic DEVELOPMENT & LANGUAGES DEVOXX FRANCE 2024 Mark and Sweep Go DEVOXX FRANCE 2024

Slide 96

Slide 96 text

Thematic DEVELOPMENT & LANGUAGES DEVOXX FRANCE 2024 Stop the world DEVOXX FRANCE 2024

Slide 97

Slide 97 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 98

Slide 98 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 99

Slide 99 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 100

Slide 100 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 101

Slide 101 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 102

Slide 102 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 103

Slide 103 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 104

Slide 104 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 105

Slide 105 text

Go DEVOXX FRANCE 2024 Go Garbage Collector ROOT Globals Stacks 1 2 6 3 5 4 7 9 8

Slide 106

Slide 106 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 107

Slide 107 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 108

Slide 108 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 109

Slide 109 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 110

Slide 110 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 111

Slide 111 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 112

Slide 112 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 113

Slide 113 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 114

Slide 114 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 115

Slide 115 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 116

Slide 116 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 117

Slide 117 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 118

Slide 118 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 119

Slide 119 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 120

Slide 120 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 121

Slide 121 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 122

Slide 122 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 123

Slide 123 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 124

Slide 124 text

Go DEVOXX FRANCE 2024 Go Heap and Stack func myfunc() { size := rand.Intn(100) list := []int{} for x:=0; x

Slide 125

Slide 125 text

Thematic DEVELOPMENT & LANGUAGES DEVOXX FRANCE 2024 Mark and Sweep (Generational) Java DEVOXX FRANCE 2024

Slide 126

Slide 126 text

Java DEVOXX FRANCE 2024 Java GC Generations Eden Survivor zero Survivor one Ternured ROOT Young Old

Slide 127

Slide 127 text

Java DEVOXX FRANCE 2024 Java GC Generations Eden Survivor zero Survivor one Ternured GC ROOT Young Old

Slide 128

Slide 128 text

Java DEVOXX FRANCE 2024 Java GC Generations Eden Survivor zero Survivor one Ternured ROOT Young Old

Slide 129

Slide 129 text

Java DEVOXX FRANCE 2024 Java GC Generations Eden Survivor zero Survivor one Ternured GC ROOT Young Old

Slide 130

Slide 130 text

Java DEVOXX FRANCE 2024 Java GC Generations Eden Survivor zero Survivor one Ternured ROOT Young Old

Slide 131

Slide 131 text

Java DEVOXX FRANCE 2024 Java GC Generations Eden Survivor zero Survivor one Ternured GC ROOT Young Old

Slide 132

Slide 132 text

/ OTHER LANGUAGES DEVOXX FRANCE 2024 other languages 1. C++ 2. C# (.NET) 3. Erlang 4. Fortran 5. Javascript 6. Java (JVM) 7. Julia 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 133

Slide 133 text

DEVOXX FRANCE 2024 other languages 1. C++ 2. C# (.NET) 3. Erlang 4. Fortran 5. Javascript 6. Java (JVM) 7. Julia 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 134

Slide 134 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET) 3. Erlang 4. Fortran 5. Javascript 6. Java (JVM) 7. Julia 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 135

Slide 135 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang 4. Fortran 5. Javascript 6. Java (JVM) 7. Julia 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 136

Slide 136 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran 5. Javascript 6. Java (JVM) 7. Julia 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 137

Slide 137 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript 6. Java (JVM) 7. Julia 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 138

Slide 138 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM) 7. Julia 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 139

Slide 139 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 140

Slide 140 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia: Mark and Sweep generational 8. LUA 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 141

Slide 141 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia: Mark and Sweep generational 8. LUA: Mark and Sweep generational (since 5.4) 9. Pascal 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 142

Slide 142 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia: Mark and Sweep generational 8. LUA: Mark and Sweep generational (since 5.4) 9. Pascal: Manual 10. PHP 11. Perl 12. R 13. Ruby 14. Swift

Slide 143

Slide 143 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia: Mark and Sweep generational 8. LUA: Mark and Sweep generational (since 5.4) 9. Pascal: Manual 10. PHP: Reference counting 11. Perl 12. R 13. Ruby 14. Swift

Slide 144

Slide 144 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia: Mark and Sweep generational 8. LUA: Mark and Sweep generational (since 5.4) 9. Pascal: Manual 10. PHP: Reference counting 11. Perl: Reference counting, but Raku Mark and Sweep generational 12. R 13. Ruby 14. Swift

Slide 145

Slide 145 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia: Mark and Sweep generational 8. LUA: Mark and Sweep generational (since 5.4) 9. Pascal: Manual 10. PHP: Reference counting 11. Perl: Reference counting, but Raku Mark and Sweep generational 12. R: Mark and Sweep generational 13. Ruby 14. Swift

Slide 146

Slide 146 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia: Mark and Sweep generational 8. LUA: Mark and Sweep generational (since 5.4) 9. Pascal: Manual 10. PHP: Reference counting 11. Perl: Reference counting, but Raku Mark and Sweep generational 12. R: Mark and Sweep generational 13. Ruby: Mark and Sweep generational 14. Swift

Slide 147

Slide 147 text

DEVOXX FRANCE 2024 other languages 1. C++: Manual, and ownership or refcounting with smart pointers 2. C# (.NET): Mark and Sweep generational 3. Erlang: Mark and Sweep generational + ref counting for shared heap 4. Fortran: Manual 5. Javascript: Mark and Sweep generational 6. Java (JVM): Mark and Sweep generational 7. Julia: Mark and Sweep generational 8. LUA: Mark and Sweep generational (since 5.4) 9. Pascal: Manual 10. PHP: Reference counting 11. Perl: Reference counting, but Raku Mark and Sweep generational 12. R: Mark and Sweep generational 13. Ruby: Mark and Sweep generational 14. Swift: Reference counting

Slide 148

Slide 148 text

THANKS DEVOXX FRANCE 2024

Slide 149

Slide 149 text

DEVOXX FRANCE 2024 Let’s keep in touch jespinog jesus-espino jespino