cache offsets / lengths on updates #3135
Open
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Summary
Currently, in the UVM KJT pools, on every lookup, we recompute offset values for all lengths of the lookup ids. This can be extremely expensive if the pool size is very large and if the id lookup size is large. Furthermore, given that these offsets should only change upon updates to the pool, it should be unnecessary to recompute these values on every read path. Instead, we can compute these offsets on the pool's write path, and reference the offsets at the correct lookup indices, to significantly cut down on lookup latency.
Testing