Memory Allocation

565ddddd-0f96-419f-85e5-282d3c34b1d9

Memory Allocation

Node Details

Public graph metadata

Updated5/2/2026

PageRank0.0001

Effectiveness0.000

Connections

21 linked nodes

PERTAIN_TOProblem

Buffer overflow cannot be demonstrated reliably

PERTAIN_TOSolution

Add another malloc() after overflowing and compile without optimizations to make the overflow easier to observe

PERTAIN_TORootCause

The number of bytes to read is implicitly specified in the allocated size of the buffer. — using Java's ByteBuffer and FileChannel. Tension: If I know the maximum number of bytes I will ever read I can allocate a single buffer just once and reuse it. Outcome: You can make a ByteBuffer appear to be smaller by changing its limit.

PERTAIN_TOProblem

Java FFM upcall pointer parameters are linked with a confined memory session on Windows when the callback also takes a larger-than-pointer struct

PERTAIN_TOSolution

Use the per-parameter attachment check when boxing native addresses, so only segments that actually need the upcall session are attached

PERTAIN_TOProblem

use `readAllBytes()` on a `DigestInputStream` to do checksum calculation. Tension: not apparently necessary to allocate a `byte[]` if I ignore the return value of `readAllBytes()` method. Outcome: Discarding the return value of `readAllBytes` will not prevent an `OutOfMemoryError` from being thrown.

PERTAIN_TOSolution

If you don't care about the bytes read and just want the digest. Outcome: byte[] buffer = new byte[2048]; while (digestInputStream.read(buffer) >= 0);.

PERTAIN_TOProblem

java.lang.OutOfMemoryError: Java heap space — When running the app in the dev environment (Gradle based), the app is running without any problem. If I build a jlink image of this app. Tension: I know about "Xmx" option, but this is not the solution. Outcome: the same line will throw.

PERTAIN_TOSolution

you can always just add the giant resource file directly into your jlink-produced sparse jvm build directly — jlink produces a whole bunch of files that you must then pack into an installer, zip up, or otherwise move to a system or run in place. Tension: This is ugly, error-prone, and requires writing multiple paths that are hard to test. Outcome: Your code can then just.. load the resource file straight from disk.

PERTAIN_TOProblem

This happens only when in create a "Release" build, not for "Debug " builds. — when heap-allocating (`new bool`, `make_unique`, ...) but not when stack-allocating in the same location. Tension: I was not able to reduce the code the code any further. Outcome: The code exhibits undefined behavior.

PERTAIN_TOSolution

Use `std::to_array()`.

PERTAIN_TOProblem

sometimes it fails at new/malloc/delete/free — in usb_otg_fs(interrupt) i read data and dynamically allocate 8 bytes. Tension: the problem is sometimes it fails at new/malloc/delete/free.

PERTAIN_TOProblem

Dynamic memory allocation is ill-advised in any event in most small scale and real-time embedded applications — in most small scale and real-time embedded applications. Tension: non-deterministic timing, the need to deal with the potential for failure and memory exhaustion. Outcome: particularly ill-advised in (and generally prohibited) safety critical systems.

PERTAIN_TOSolution

for small allocations it is particularly inefficient — Allocations are normally 8 byte aligned. Tension: each allocation carries an overhead of a small block for heap management. Outcome: at least 8 bytes to maintain alignment.

PERTAIN_TOSolution

the answer to your question is no, just no — Dynamic memory allocation from the system heap of any kind whether by `new` or `malloc()` is unsafe in an interrupt. Tension: heap operations of any kind are not intrinsically thread safe or reentrant.

PERTAIN_TOReport

CVE-2017-8421: Unbounded memory allocation in binutils relocation parsing

PERTAIN_TOProblem

Can someone explain the difference between the stack and the heap in Java?

PERTAIN_TOSolution

Stack: holds method call frames — local primitives and object references. Tension: Heap: holds object instances and arrays.

PERTAIN_TOProblem

A heap buffer overflow vulnerability exists in binutils BFD library when processing compressed ELF sections — when decompressing a section marked with SHF_COMPRESSED flag. Outcome: causing the decompression function to read far beyond the allocated buffer boundary.

PERTAIN_TORootCause

calculating a fixed heap buffer size (external_relocs) based on the maximum relocation count BEFORE input files are processed — when processing PE/COFF object files with multiple input sections contributing relocations to the same output section. Tension: then incremented during processing. Outcome: causing writes to exceed the allocated buffer when the final reloc_count exceeds the initial maximum.

PERTAIN_TOSolution

The fix is to recalculate max_output_reloc_count after _bfd_coff_link_input_bfd() completes. Tension: This ensures the buffer is large enough for the actual final relocation count. Outcome: then allocate external_relocs with the correct size.

[inerrata]Tags Knowledge Graph Docs About Team Pricing Contact Report a Bug Privacy Terms Cookie Settings Do Not Sell or Share My Info

Memory Allocation - inErrata Knowledge Graph | Inerrata