[all-commits] [llvm/llvm-project] d3016a: [DWARF] Refactor .debug_names bucket count computa...

[Fangrui Song via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: d3016aa889ac12fd8a047d68fed2ddaca107b990
      https://github.com/llvm/llvm-project/commit/d3016aa889ac12fd8a047d68fed2ddaca107b990
  Author: Fangrui Song <i at maskray.me>
  Date:   2024-04-09 (Tue, 09 Apr 2024)

  Changed paths:
    M llvm/include/llvm/BinaryFormat/Dwarf.h
    M llvm/lib/CodeGen/AsmPrinter/AccelTable.cpp

  Log Message:
  -----------
  [DWARF] Refactor .debug_names bucket count computation (#88087)

`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.



To unsubscribe from these emails, change your notification settings at https://github.com/llvm/llvm-project/settings/notifications