Forwarded from ilo sona
This media is not supported in your browser
VIEW IN TELEGRAM
Why memory fragmentation matters.
This is the result of a random sequence of memory allocations and frees wherein the allocator uses a first-fitting-free-block algorithm. The sequence is randomly generated to issue an alloc or free call every 0.01 seconds, with a 60% bias towards allocating memory. Each allocation requests a randomly generated size between 2 and 18 bytes. The program stops when the page is full.
This is the result of a random sequence of memory allocations and frees wherein the allocator uses a first-fitting-free-block algorithm. The sequence is randomly generated to issue an alloc or free call every 0.01 seconds, with a 60% bias towards allocating memory. Each allocation requests a randomly generated size between 2 and 18 bytes. The program stops when the page is full.
Forwarded from Heartbleed
This media is not supported in your browser
VIEW IN TELEGRAM
CLÁSSICO KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK
🤣8
Sicks Nerds λ
Photo
Parece que a “Geovana safadinha” tem interesse em ciência da computação e matemática 😍
🤣5🤔4
/g/ Library
Michio_Shibuya,_Takashi_Tonagi,_Office_Sawa_The_Manga_Guide_to_Microprocessors.pdf
The manga guide to microprocessors
⚡3
Forwarded from Euler
Forwarded from Programming Deadlock
Object-oriented design patterns in the Kernel (C)
https://lwn.net/Articles/444910/
https://lwn.net/Articles/444910/
LWN.net
Object-oriented design patterns in the kernel, part 1
Despite the fact that the Linux Kernel is mostly written in C, it makes broad use of some techn [...]
⚡2
Integração de LLMs para automação de aplicações em engenharia reversa no Ghidra
https://github.com/LaurieWired/GhidraMCP
https://github.com/LaurieWired/GhidraMCP
GitHub
GitHub - LaurieWired/GhidraMCP: MCP Server for Ghidra
MCP Server for Ghidra. Contribute to LaurieWired/GhidraMCP development by creating an account on GitHub.
❤🔥4