[BinAST] Add a cache for MultiLookupHuffmanTable
Categories
(Core :: JavaScript Engine, task, P1)
Tracking
()
Tracking | Status | |
---|---|---|
firefox71 | --- | fixed |
People
(Reporter: Yoric, Assigned: Yoric)
References
Details
Attachments
(1 file)
In each MultiLookupHuffmanTable, we know that the values used most often are the ones with the shortest paths. We could add a cache of these values in MultiLookupHuffmanTable
to cut on the time spent resolving these most commonly used values.
Assignee | ||
Updated•5 years ago
|
Updated•5 years ago
|
Assignee | ||
Comment 1•5 years ago
|
||
By definition of Huffman encoding, the shortest keys are reserved for the most common values.
This patch changes how we store these shortest keys in a MultiLookupHuffmanTable
to
improve lookup speed: instead of storing short keys in a subtable by extending them,
we store them in a SingleLookupHuffmanTable
.
Comment 3•5 years ago
|
||
Backed out 2 changesets (bug 1587738, bug 1588051) for build bustage on js/src/jsapi-tests/testBinASTReader.cpp. CLOSED TREE
Log:
https://treeherder.mozilla.org/logviewer.html#/jobs?job_id=271301088&repo=autoland&lineNumber=43974
Push with failures:
https://treeherder.mozilla.org/#/jobs?repo=autoland&revision=0c632655907932ee1559cd09aa2b264c461e2b3b
Backout:
https://hg.mozilla.org/integration/autoland/rev/29f82221b2158aa65fd6e289d5111598fa7b2544
Assignee | ||
Comment 4•5 years ago
|
||
Sorry, typo in the other bug. Should be able to reland.
Comment 6•5 years ago
|
||
bugherder |
Description
•