diff options
author | Joseph Huber <huberjn@outlook.com> | 2025-05-28 08:21:43 -0500 |
---|---|---|
committer | GitHub <noreply@github.com> | 2025-05-28 08:21:43 -0500 |
commit | b4bc8c6f83e3dc865cf6dccdc9f18edb6a2daa3f (patch) | |
tree | acad1e0cf4fc09c64c314eedfdd106e0b9aef4e1 /clang/lib/AST/ByteCode/Interp.cpp | |
parent | 11e804fcabce11a9fdfb4033263ef1e502cc8a72 (diff) | |
download | llvm-b4bc8c6f83e3dc865cf6dccdc9f18edb6a2daa3f.zip llvm-b4bc8c6f83e3dc865cf6dccdc9f18edb6a2daa3f.tar.gz llvm-b4bc8c6f83e3dc865cf6dccdc9f18edb6a2daa3f.tar.bz2 |
[libc] Implement efficient 'malloc' on the GPU (#140156)
Summary:
This is the big patch that implements an efficient device-side `malloc`
on the GPU. This is the first pass and many improvements will be made
later.
The scheme revolves around using a global reference counted pointer to
hand out access to a dynamically created and destroyed slab interface.
The slab is simply a large bitfield with one bit for each slab. All
allocations are the same size in a slab, so different sized allocations
are done through different slabs.
Allocation is thus searching for or creating a slab for the desired
slab, reserving space, and then searching for a free bit. Freeing is
clearing the bit and then releasing the space.
This interface allows memory to dynamically grow and shrink. Future
patches will have different modes to allow fast first-time-use as well
as a non-RPC version.
Diffstat (limited to 'clang/lib/AST/ByteCode/Interp.cpp')
0 files changed, 0 insertions, 0 deletions