<feed xmlns='http://www.w3.org/2005/Atom'>
<title>llvm-project.git/libc/fuzzing/__support, branch users/nico/python-2</title>
<subtitle>Unnamed repository; edit this file 'description' to name the repository.
</subtitle>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/'/>
<entry>
<title>[libc] Add proxy header for ENTRY type. (#139746)</title>
<updated>2025-05-13T18:07:21+00:00</updated>
<author>
<name>lntue</name>
<email>lntue@google.com</email>
</author>
<published>2025-05-13T18:07:21+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=e581f1cc9a9fd6933ebf612ec3907a0fc67db1e6'/>
<id>e581f1cc9a9fd6933ebf612ec3907a0fc67db1e6</id>
<content type='text'>
https://github.com/llvm/llvm-project/issues/139561</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
https://github.com/llvm/llvm-project/issues/139561</pre>
</div>
</content>
</entry>
<entry>
<title>[libc] Fix warnings for freelist_heap_test/fuzz (#136634)</title>
<updated>2025-04-22T18:11:31+00:00</updated>
<author>
<name>Daniel Thornburgh</name>
<email>dthorn@google.com</email>
</author>
<published>2025-04-22T18:11:31+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=710ffb69bfdc9281eaaad267ad85ca60ddbb94f0'/>
<id>710ffb69bfdc9281eaaad267ad85ca60ddbb94f0</id>
<content type='text'>
Fixes #122367</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Fixes #122367</pre>
</div>
</content>
</entry>
<entry>
<title>[libc][NFC] Strip all training whitespace and missing newlines (#124163)</title>
<updated>2025-01-23T18:02:54+00:00</updated>
<author>
<name>Joseph Huber</name>
<email>huberjn@outlook.com</email>
</author>
<published>2025-01-23T18:02:54+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=db6b7a84e6e4949569e756f46357d9f54ad16a03'/>
<id>db6b7a84e6e4949569e756f46357d9f54ad16a03</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>[libc] Exclude FreeListHeap test and fuzzer on GPU (#120137)</title>
<updated>2024-12-16T21:28:42+00:00</updated>
<author>
<name>Petr Hosek</name>
<email>phosek@google.com</email>
</author>
<published>2024-12-16T21:28:42+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=51a0919412cf1868de689e03024c6f761a1b8b0a'/>
<id>51a0919412cf1868de689e03024c6f761a1b8b0a</id>
<content type='text'>
FreeListHeap uses the _end symbol which conflicts with the _end symbol
defined by GPU start.cpp files so for now we exclude the test and the
fuzzer on GPU.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
FreeListHeap uses the _end symbol which conflicts with the _end symbol
defined by GPU start.cpp files so for now we exclude the test and the
fuzzer on GPU.</pre>
</div>
</content>
</entry>
<entry>
<title>[libc] Breakup freelist_malloc into separate files (#119806)</title>
<updated>2024-12-16T18:30:27+00:00</updated>
<author>
<name>Petr Hosek</name>
<email>phosek@google.com</email>
</author>
<published>2024-12-16T18:30:27+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=7bf3137c39a61283ebcb58793e830f8b768b74e7'/>
<id>7bf3137c39a61283ebcb58793e830f8b768b74e7</id>
<content type='text'>
This better matches the structure we use for the rest of libc.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This better matches the structure we use for the rest of libc.</pre>
</div>
</content>
</entry>
<entry>
<title>Reapply "[libc] Use best-fit binary trie to make malloc logarithmic (#117065)"</title>
<updated>2024-11-21T23:26:24+00:00</updated>
<author>
<name>Daniel Thornburgh</name>
<email>dthorn@google.com</email>
</author>
<published>2024-11-21T21:43:27+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=385961d7b23d5500d20954ad8137b27ecced2692'/>
<id>385961d7b23d5500d20954ad8137b27ecced2692</id>
<content type='text'>
This reverts commit 93b83642ee34d0092b94776728dad0117c2b72a1.

 - Correct riscv32 assumption about alignment (bit of a hack).
 - Fix test case where the largest_small and smallest sizes are the
   same.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This reverts commit 93b83642ee34d0092b94776728dad0117c2b72a1.

 - Correct riscv32 assumption about alignment (bit of a hack).
 - Fix test case where the largest_small and smallest sizes are the
   same.
</pre>
</div>
</content>
</entry>
<entry>
<title>Revert "[libc] Use best-fit binary trie to make malloc logarithmic (#117065)"</title>
<updated>2024-11-21T19:56:05+00:00</updated>
<author>
<name>Daniel Thornburgh</name>
<email>dthorn@google.com</email>
</author>
<published>2024-11-21T19:55:44+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=93b83642ee34d0092b94776728dad0117c2b72a1'/>
<id>93b83642ee34d0092b94776728dad0117c2b72a1</id>
<content type='text'>
This reverts commit b05600d96f46697e21f6b1b7ad901391326243a8.
riscv32 unit test still broken
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This reverts commit b05600d96f46697e21f6b1b7ad901391326243a8.
riscv32 unit test still broken
</pre>
</div>
</content>
</entry>
<entry>
<title>Reapply "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)</title>
<updated>2024-11-21T19:30:51+00:00</updated>
<author>
<name>Daniel Thornburgh</name>
<email>dthorn@google.com</email>
</author>
<published>2024-11-20T22:05:44+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=b05600d96f46697e21f6b1b7ad901391326243a8'/>
<id>b05600d96f46697e21f6b1b7ad901391326243a8</id>
<content type='text'>
 - Fix assertion expressions.
 - Fix incorrect small size in freestore_test.
 - There may only be one small size for high alignment and small
   pointers (riscv32).
 - Don't rely on stack alignment in FreeList test.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
 - Fix assertion expressions.
 - Fix incorrect small size in freestore_test.
 - There may only be one small size for high alignment and small
   pointers (riscv32).
 - Don't rely on stack alignment in FreeList test.
</pre>
</div>
</content>
</entry>
<entry>
<title>Revert "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)</title>
<updated>2024-11-20T22:00:07+00:00</updated>
<author>
<name>Daniel Thornburgh</name>
<email>dthorn@google.com</email>
</author>
<published>2024-11-20T22:00:07+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=9be475af81ee36f1d360ad1d70b695c4b26c98fa'/>
<id>9be475af81ee36f1d360ad1d70b695c4b26c98fa</id>
<content type='text'>
Reverts llvm/llvm-project#106259

Unit tests break on AArch64.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Reverts llvm/llvm-project#106259

Unit tests break on AArch64.</pre>
</div>
</content>
</entry>
<entry>
<title>[libc] Use best-fit binary trie to make malloc logarithmic (#106259)</title>
<updated>2024-11-20T21:54:00+00:00</updated>
<author>
<name>Daniel Thornburgh</name>
<email>dthorn@google.com</email>
</author>
<published>2024-11-20T21:54:00+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=c3207c31fce8afa4e5ae728804f18b4e863197e7'/>
<id>c3207c31fce8afa4e5ae728804f18b4e863197e7</id>
<content type='text'>
This reworks the free store implementation in libc's malloc to use a
dlmalloc-style binary trie of circularly linked FIFO free lists. This
data structure can be maintained in logarithmic time, but it still
permits a relatively small implementation compared to other
logarithmic-time ordered maps.

The implementation doesn't do the various bitwise tricks or
optimizations used in actual dlmalloc; it instead optimizes for
(relative) readability and minimum code size. Specific optimization can
be added as necessary given future profiling.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This reworks the free store implementation in libc's malloc to use a
dlmalloc-style binary trie of circularly linked FIFO free lists. This
data structure can be maintained in logarithmic time, but it still
permits a relatively small implementation compared to other
logarithmic-time ordered maps.

The implementation doesn't do the various bitwise tricks or
optimizations used in actual dlmalloc; it instead optimizes for
(relative) readability and minimum code size. Specific optimization can
be added as necessary given future profiling.</pre>
</div>
</content>
</entry>
</feed>
