<feed xmlns='http://www.w3.org/2005/Atom'>
<title>llvm-project.git/llvm/lib/CodeGen/AsmPrinter/AccelTable.cpp, branch main</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>[CodeGen] Remove redundant declarations (NFC) (#166105)</title>
<updated>2025-11-03T06:42:40+00:00</updated>
<author>
<name>Kazu Hirata</name>
<email>kazu@google.com</email>
</author>
<published>2025-11-03T06:42:40+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=7db63441703b60324c697b10f6607cc9e611b91c'/>
<id>7db63441703b60324c697b10f6607cc9e611b91c</id>
<content type='text'>
In C++17, static constexpr members are implicitly inline, so they no
longer require an out-of-line definition.

Identified with readability-redundant-declaration.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
In C++17, static constexpr members are implicitly inline, so they no
longer require an out-of-line definition.

Identified with readability-redundant-declaration.</pre>
</div>
</content>
</entry>
<entry>
<title>[AsmPrinter] Remove unused includes (NFC) (#114698)</title>
<updated>2024-11-03T15:03:02+00:00</updated>
<author>
<name>Kazu Hirata</name>
<email>kazu@google.com</email>
</author>
<published>2024-11-03T15:03:02+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=2fccd5c576f2e056954996c3071163fc5c1eb4d4'/>
<id>2fccd5c576f2e056954996c3071163fc5c1eb4d4</id>
<content type='text'>
Identified with misc-include-cleaner.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Identified with misc-include-cleaner.</pre>
</div>
</content>
</entry>
<entry>
<title>[CodeGen] Construct SmallVector with ArrayRef (NFC) (#101841)</title>
<updated>2024-08-04T07:41:29+00:00</updated>
<author>
<name>Kazu Hirata</name>
<email>kazu@google.com</email>
</author>
<published>2024-08-04T07:41:29+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=8d1b17b6623742ec4454f5bae2e23f8b30124314'/>
<id>8d1b17b6623742ec4454f5bae2e23f8b30124314</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>[llvm] Use llvm::unique (NFC) (#95628)</title>
<updated>2024-06-15T05:49:36+00:00</updated>
<author>
<name>Kazu Hirata</name>
<email>kazu@google.com</email>
</author>
<published>2024-06-15T05:49:36+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=7c6d0d26b1792fdf437b3e33b98c55fee9b06516'/>
<id>7c6d0d26b1792fdf437b3e33b98c55fee9b06516</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>[DWARF] Refactor .debug_names bucket count computation (#88087)</title>
<updated>2024-04-09T18:02:39+00:00</updated>
<author>
<name>Fangrui Song</name>
<email>i@maskray.me</email>
</author>
<published>2024-04-09T18:02:39+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=d3016aa889ac12fd8a047d68fed2ddaca107b990'/>
<id>d3016aa889ac12fd8a047d68fed2ddaca107b990</id>
<content type='text'>
`getDebugNamesBucketAndHashCount` lures users to provide an array to
compute the bucket count using an O(n log n) sort. This is inefficient
as hash table based uniquifying is faster.

The performance issue matters less for Clang as the number of names is
relatively small. For `ld.lld --debug-names`, I plan to compute the
unique hash count as a side product of parallel entry pool computation,
and I just need a function to suggest a bucket count.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
`getDebugNamesBucketAndHashCount` lures users to provide an array to
compute the bucket count using an O(n log n) sort. This is inefficient
as hash table based uniquifying is faster.

The performance issue matters less for Clang as the number of names is
relatively small. For `ld.lld --debug-names`, I plan to compute the
unique hash count as a side product of parallel entry pool computation,
and I just need a function to suggest a bucket count.</pre>
</div>
</content>
</entry>
<entry>
<title>[CodeGen][Tablegen] Fix uninitialized var and shift overflow. (#84896)</title>
<updated>2024-03-13T14:03:15+00:00</updated>
<author>
<name>mahesh-attarde</name>
<email>145317060+mahesh-attarde@users.noreply.github.com</email>
</author>
<published>2024-03-13T14:03:15+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=390f28702fad7b704d026b5c3e9a6030cecab01b'/>
<id>390f28702fad7b704d026b5c3e9a6030cecab01b</id>
<content type='text'>
Fix uninitialized var and shift overflow.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Fix uninitialized var and shift overflow.</pre>
</div>
</content>
</entry>
<entry>
<title>[DWARF] Use std::tie after #83047. NFC</title>
<updated>2024-03-01T20:02:10+00:00</updated>
<author>
<name>Fangrui Song</name>
<email>i@maskray.me</email>
</author>
<published>2024-03-01T20:02:10+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=7b0b64a7016d67d6d8c538fe406a2ffd93c11602'/>
<id>7b0b64a7016d67d6d8c538fe406a2ffd93c11602</id>
<content type='text'>
The code suggestion was neglected when the patch landed.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
The code suggestion was neglected when the patch landed.
</pre>
</div>
</content>
</entry>
<entry>
<title>[LLVM][DWARF] Make dwarf::getDebugNamesBucketCount return a pair. (#83047)</title>
<updated>2024-02-27T05:54:10+00:00</updated>
<author>
<name>cmtice</name>
<email>cmtice@google.com</email>
</author>
<published>2024-02-27T05:54:10+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=f0663772463335bed253491fa380e1a9c2d78484'/>
<id>f0663772463335bed253491fa380e1a9c2d78484</id>
<content type='text'>
llvm::dwarf::getDebugNamesBucketCount directly returns the bucket count,
via return statement, but it also returns the hash count via a
parameter. This changes the function to return them both as a std::pair,
in the return statement. It also changes the name of the function to
make it clear it returns both values.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
llvm::dwarf::getDebugNamesBucketCount directly returns the bucket count,
via return statement, but it also returns the hash count via a
parameter. This changes the function to return them both as a std::pair,
in the return statement. It also changes the name of the function to
make it clear it returns both values.</pre>
</div>
</content>
</entry>
<entry>
<title>[LLVM][DWARF] Refactor code for generating DWARF V5 .debug_names (#82394)</title>
<updated>2024-02-21T16:26:05+00:00</updated>
<author>
<name>cmtice</name>
<email>cmtice@google.com</email>
</author>
<published>2024-02-21T16:26:05+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=453b1a2fce3c46e866131797f876976032cff384'/>
<id>453b1a2fce3c46e866131797f876976032cff384</id>
<content type='text'>
[LLVM][DWARF]  Refactor code for generating DWARF v5 .debug_names

Refactor the code that uniques the entries and computes the bucket count
for the DWARF V5 .debug_names accelerator table.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
[LLVM][DWARF]  Refactor code for generating DWARF v5 .debug_names

Refactor the code that uniques the entries and computes the bucket count
for the DWARF V5 .debug_names accelerator table.</pre>
</div>
</content>
</entry>
<entry>
<title>[LLVM][DWARF] Fix for memory leak (#81828)</title>
<updated>2024-02-15T17:45:32+00:00</updated>
<author>
<name>Alexander Yermolovich</name>
<email>43973793+ayermolo@users.noreply.github.com</email>
</author>
<published>2024-02-15T17:45:32+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=f905877f2039e97479425e4d78cbfde72f360b4d'/>
<id>f905877f2039e97479425e4d78cbfde72f360b4d</id>
<content type='text'>
This is followup to https://github.com/llvm/llvm-project/pull/8120.
Missed a destuctor.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This is followup to https://github.com/llvm/llvm-project/pull/8120.
Missed a destuctor.</pre>
</div>
</content>
</entry>
</feed>
