Jump to Content
Register
Forgot your password?
Third-party login
Log in with Discord

RISCY BUSINESS
Blog
Forums
Episode Guide
twitter
RISCY BUSINESS»Episode Guide
2.8 cont.
References ▼
David Patterson & John Hennessy (Morgan Kaufmann)
Computer Organization and Design RISC-V Edition
[1]3:20[5]33:47[6]36:41
[7]47:52[8]52:09[10]1:24:18
[11]1:25:48[12]1:37:26[14]1:42:38
GitLab
pcalc
[2]8:48[3]13:06[4]21:19
[9]1:17:30
RISC-V
User-Level ISA Specification v2.2
[13]1:37:26
David Patterson and Andrew Waterman (Strawberry Canyon)
RISC-V Reader
[15]2:12:17
RISCY BUSINESS
Annotated Episode Guide
[16]2:22:02
Filter mode:
Topics
asm
isa
language
memory
performance
(null topic)
Media
🗪Chat Comment
🖮Programming🟉
📖Research
🗩Speech
🖌Whiteboard
🎭
🏟
🔗
Link to: current timestamp
Credits
Host
Neo Ar
Indexer
Matt Mascarenhas
?
?

Keyboard Navigation

Global Keys

[, < / ], > Jump to previous / next episode
W, K, P / S, J, N Jump to previous / next marker
t / T Toggle theatre / SUPERtheatre mode
V Revert filter to original state Y Select link (requires manual Ctrl-c)

Menu toggling

q Quotes r References f Filter y Link c Credits

In-Menu Movement

a
w
s
d
h j k l
←
↑
↓
→

Quotes and References Menus

Enter Jump to timecode

Quotes, References and Credits Menus

o Open URL (in new tab)

Filter Menu

x, Space Toggle category and focus next
X, ShiftSpace Toggle category and focus previous
v Invert topics / media as per focus

Filter and Link Menus

z Toggle filter / linking mode

Credits Menu

Enter Open URL (in new tab)
0:01Recap and set the stage for the day
🗩
0:01Recap and set the stage for the day
🗩
0:01Recap and set the stage for the day
🗩
1:41Memory allocation in Linux, using brk
🗩
1:41Memory allocation in Linux, using brk
🗩
1:41Memory allocation in Linux, using brk
🗩
3:20Chapter 2.8 continued, Allocating Space for New Data on the Heap1
3:20Chapter 2.8 continued, Allocating Space for New Data on the Heap1
3:20Chapter 2.8 continued, Allocating Space for New Data on the Heap1
3:32Static and automatic storage duration in C
🗩
3:32Static and automatic storage duration in C
🗩
3:32Static and automatic storage duration in C
🗩
7:03Static storage
🖌
7:03Static storage
🖌
7:03Static storage
🖌
8:48Static storage, as used in pcalc2
8:48Static storage, as used in pcalc2
8:48Static storage, as used in pcalc2
13:06Global variables, as used in pcalc3
13:06Global variables, as used in pcalc3
13:06Global variables, as used in pcalc3
18:15A general critique of global variables
🗩
18:15A general critique of global variables
🗩
18:15A general critique of global variables
🗩
21:19Uninitialised vs initialised static and automatic storage duration variables in pcalc4 (uninitialised automatic storage duration variables are undefined)
21:19Uninitialised vs initialised static and automatic storage duration variables in pcalc4 (uninitialised automatic storage duration variables are undefined)
21:19Uninitialised vs initialised static and automatic storage duration variables in pcalc4 (uninitialised automatic storage duration variables are undefined)
32:05The "auto" keyword in C
🖌
32:05The "auto" keyword in C
🖌
32:05The "auto" keyword in C
🖌
33:47Chapter 2.8 continued, Allocating Space for New Data on the Heap5
33:47Chapter 2.8 continued, Allocating Space for New Data on the Heap5
33:47Chapter 2.8 continued, Allocating Space for New Data on the Heap5
36:41Figure 2.13 - The RISC-V memory allocation for program and data6
🖌
36:41Figure 2.13 - The RISC-V memory allocation for program and data6
🖌
36:41Figure 2.13 - The RISC-V memory allocation for program and data6
🖌
44:24The fixed nature of the stack
🖌
44:24The fixed nature of the stack
🖌
44:24The fixed nature of the stack
🖌
46:41Tip of the day: Get into sponge mode
🗩
46:41Tip of the day: Get into sponge mode
🗩
46:41Tip of the day: Get into sponge mode
🗩
47:52Figure 2.13 continued - The RISC-V memory allocation for program and data7
📖
🖌
47:52Figure 2.13 continued - The RISC-V memory allocation for program and data7
📖
🖌
47:52Figure 2.13 continued - The RISC-V memory allocation for program and data7
📖
🖌
52:09Chapter 2.8 continued, on memory allocation8
52:09Chapter 2.8 continued, on memory allocation8
52:09Chapter 2.8 continued, on memory allocation8
52:57General-purpose memory allocation and garbage collection
🗩
52:57General-purpose memory allocation and garbage collection
🗩
52:57General-purpose memory allocation and garbage collection
🗩
57:48krish2nasa Mio, are you not interested in Ada programming as it is a more robust and reliable language? AdaCore now supports RISC-V!
🗪
57:48krish2nasa Mio, are you not interested in Ada programming as it is a more robust and reliable language? AdaCore now supports RISC-V!
🗪
57:48krish2nasa Mio, are you not interested in Ada programming as it is a more robust and reliable language? AdaCore now supports RISC-V!
🗪
59:13Continued thoughts on memory allocation and freeing, including swapping to disk and performance
🗩
59:13Continued thoughts on memory allocation and freeing, including swapping to disk and performance
🗩
59:13Continued thoughts on memory allocation and freeing, including swapping to disk and performance
🗩
1:06:01Legitimate memory leaking strategies
🗩
1:06:01Legitimate memory leaking strategies
🗩
1:06:01Legitimate memory leaking strategies
🗩
1:10:59Dangling pointers, prevented by zeroing out pointers
🗩
1:10:59Dangling pointers, prevented by zeroing out pointers
🗩
1:10:59Dangling pointers, prevented by zeroing out pointers
🗩
1:17:30Garbage collection, as used by pcalc's build.d script9
🗩
1:17:30Garbage collection, as used by pcalc's build.d script9
🗩
1:17:30Garbage collection, as used by pcalc's build.d script9
🗩
1:24:18Chapter 2.8 continued10
1:24:18Chapter 2.8 continued10
1:24:18Chapter 2.8 continued10
1:25:48Chapter 2.8 Elaboration 2 - Making the common case, that procedures take eight or fewer parameters, fast11
1:25:48Chapter 2.8 Elaboration 2 - Making the common case, that procedures take eight or fewer parameters, fast11
1:25:48Chapter 2.8 Elaboration 2 - Making the common case, that procedures take eight or fewer parameters, fast11
1:35:55On needing a frame pointer when a procedure's memory requirements are not known at compile-time
🗩
1:35:55On needing a frame pointer when a procedure's memory requirements are not known at compile-time
🗩
1:35:55On needing a frame pointer when a procedure's memory requirements are not known at compile-time
🗩
1:37:26Figure 2.14 - RISC-V register conventions12,13
1:37:26Figure 2.14 - RISC-V register conventions12,13
1:37:26Figure 2.14 - RISC-V register conventions12,13
1:42:38Chapter 2.8 Elaboration 3 - Implementing recursive procedures iteratively14
1:42:38Chapter 2.8 Elaboration 3 - Implementing recursive procedures iteratively14
1:42:38Chapter 2.8 Elaboration 3 - Implementing recursive procedures iteratively14
1:45:41Implementing a recursive accumulation procedure iteratively
🖌
1:45:41Implementing a recursive accumulation procedure iteratively
🖌
1:45:41Implementing a recursive accumulation procedure iteratively
🖌
2:03:54The "-->" operator (don't try this at home!)
🖌
2:03:54The "-->" operator (don't try this at home!)
🖌
2:03:54The "-->" operator (don't try this at home!)
🖌
2:07:08Completing our recursive-to-iterative accumulation procedure conversion
🖌
2:07:08Completing our recursive-to-iterative accumulation procedure conversion
🖌
2:07:08Completing our recursive-to-iterative accumulation procedure conversion
🖌
2:12:17Lower the recursive accumulation procedure to assembly15
🖌
2:12:17Lower the recursive accumulation procedure to assembly15
🖌
2:12:17Lower the recursive accumulation procedure to assembly15
🖌
2:21:24We are out of time
🗩
2:21:24We are out of time
🗩
2:21:24We are out of time
🗩
2:22:02krish2nasa I think first I need to watch your previous streams in the sequence for a better understanding16
🗪
2:22:02krish2nasa I think first I need to watch your previous streams in the sequence for a better understanding16
🗪
2:22:02krish2nasa I think first I need to watch your previous streams in the sequence for a better understanding16
🗪
2:23:57End this episode here
🗩
2:23:57End this episode here
🗩
2:23:57End this episode here
🗩
•
You have arrived at the (current) end of Computer Organisation and Architecture
•