Search
22:48:14
drmeister
kpoeck_: Hi - I'm trying to get some evidence that it's the memory used by the HIR graph traversal that is the problem.
22:50:04
drmeister
But HIR processing uses about 8x the amount of memory that AST generation does.
22:51:32
drmeister
My hypothesis is that when we run HIR processing in multiple threads that it hammers the GC
22:52:57
drmeister
I suspect that much of the HIR processing memory is the hash-tables that we use to traverse the HIR graph.
23:02:57
drmeister
How do I traverse an AST?
0:42:34
Bike
cleavir-ast:map-something
0:42:39
Bike
ast-\depth-frist-preorder ,maybe
3:30:35
drmeister
I implemented the strong-key-hash-table
3:31:03
drmeister
It's a bit faster than our current hash-table.
3:31:46
drmeister
What's really important is to get an estimate of the size of the hash tables
3:32:16
drmeister
I'm using this...
3:32:17
drmeister
https://www.irccloud.com/pastebin/Ngc5m8Xf/
3:32:43
drmeister
It fills a strong-key-hash-table or a regular hash table with stuff.
3:34:33
drmeister
Huh - this run makes the strong-key-hash-table look even better
3:34:35
drmeister
https://www.irccloud.com/pastebin/1LYbmqrP/
3:35:53
drmeister
(time (strong-fill 7)) --> it creates the hash table near the final size.
3:36:23
drmeister
(time (string-fill 7 16)) starts the hash table with 16 entries and it rehashes 21 times by the time it finishes.
4:35:46
beach
Good morning everyone!
4:54:08
drmeister
https://www.irccloud.com/pastebin/00DhTP5Q/
4:54:56
drmeister
I posted that for reference