branch scratch/hash-table-perf created (now b9c9539db96)

[Mattias Engdegård]

mattiase pushed a change to branch scratch/hash-table-perf.

        at  b9c9539db96 Change hash range reduction from remainder to 
multiplication

This branch includes the following new commits:

       new  594152bf667 Add internal hash-table debug functions
       new  422c91a822a ; * src/pdumper.c (dump_hash_table): Remove unused 
argument.
       new  e2a6ce36d83 Decouple profiler from Lisp hash table internals
       new  31950946290 Refactor: less egregious layering violation in 
composite.h
       new  9f94796b657 ; * src/fns.c (collect_interval): Move misplaced 
function.
       new  d77c9540363 Refactor: extract hash computation to a function
       new  3d2042c48a6 Refactor: extract hash index computation to a function
       new  c188b9f2bf5 Refactor hash table vector reallocation
       new  9141966be51 ; * src/alloc.c (purecopy_hash_table): Simplify
       new  fdc390f8dc0 Abstract predicate and constant for unused hash keys
       new  4e8d7725fd4 ; * src/fns.c (Fmake_hash_table): ensure `test` is a 
bare symbol
       new  c4df6041de8 * src/print.c (print_object): Don't print hash table 
test if `eql`.
       new  4b5d9f92abe * src/print.c (print_object): Don't print empty 
hash-table data
       new  f3e985a16ba Don't print or read the hash table size parameter
       new  6ffbccbf1dd Represent hash table weakness as an enum internally
       new  3e9e68333ae Remove rehash-threshold and rehash-size struct members
       new  e69035c6ef5 Leaner hash table dumping and thawing
       new  310f6584ccb Allow zero hash table size
       new  2d28042f56a Use non-Lisp allocation for internal hash-table vectors
       new  8e80d1930e3 Store hash values as EMACS_UINT instead of Lisp_Object
       new  1ebd00f6d0a Retype hash interfaces to use EMACS_UINT instead of 
Lisp fixnum
       new  8335891387a Inlined and specialised hash table look-up
       new  54807fee4d0 Use hash_idx_t for storing hash indices
       new  fc68176120f Use hash_hash_t for storing hash values
       new  ad3d2f8ed88 Share hash table test structs
       new  e53398ab698 ; Reorder structs (hash and test)
       new  e6defe82569 Change default hash table size to 8 (from 65)
       new  41e37c978e6 Rework index size and resize factor computations
       new  1672d880e0c Change hash_idx_t to int32_t on all platforms
       new  5cf627d70e1 Don't dump Qunbound
       new  830838eb5f3 Use KEY=Qunbound instead of HASH=hash_unused for unused 
entries
       new  8b1b140bed9 * src/lisp.h (hash_hash_t): Change to uint32_t.
       new  05297736aa6 Adapt hash functions to produce a hash_hash_t eventually
       new  8cd35079f4c Don't pretend that hash-table-size is useful
       new  681a2877cc2 Hash-table documentation updates
       new  e366ae38cd5 Improved hash-table allocation accounting
       new  b9c9539db96 Change hash range reduction from remainder to 
multiplication