Search
Friday, 18th of January 2019, 19:26:14 UTC
19:26:16
drmeister
Build instructions are here: https://github.com/clasp-developers/clasp/wiki/Build-Instructions
19:27:00
Selwyn
Will do, look forward to playing with it
20:54:09
kpoeck
The definition of proclaim looks a bit wrong wrt to inline/notinline
20:54:15
kpoeck
In https://github.com/clasp-developers/clasp/blob/master/src/lisp/kernel/init.lsp#L385
20:54:38
kpoeck
Why is only the cadr treated and not the whole list?
20:54:41
drmeister
kpoeck: Now I'm leaning towards the memory usage of HIR processing as being responsible for slowing down compile-file-parallel
20:55:06
Bike
kpoeck: yeah, that looks wrong.
20:55:21
kpoeck
(declaim (inline foo bar)) simply inlines foo, not bar
20:55:38
kpoeck
This looks easy enough so I'll send a pr
20:55:45
drmeister
I can demonstrate pretty clearly that it's not lock contention
20:56:44
Bike
http://ix.io/1yDG here's the ast interpreter
20:57:59
kpoeck
drmeister: hir processing is inside of compile-from-ast?
20:58:33
drmeister
kpoeck: Please go ahead with a PR for proclaim
21:02:24
shiho
drmeister: I pushed my change, so save-amber-parm-format can return residue-vector.
21:09:05
kpoeck
If HIR-processing is reponsable for the slow-down, than I wonder what the effect of limiting the number of execution threads with a thread-pool might be
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
Saturday, 19th of January 2019, 7:26:14 UTC