-
Notifications
You must be signed in to change notification settings - Fork 916
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Refactor setting stack size in regex code #8358
Refactor setting stack size in regex code #8358
Conversation
Question about the transition between "LARGE" stack size and "global memory". It seems like there's a hole between
Is there some kind of rounding thing going on here where it will always be some safe multiple of instructions? |
I think you are right. There appears to be an overlap where too much memory is being allocated. I should change the threshold check to use |
Codecov Report
@@ Coverage Diff @@
## branch-21.08 #8358 +/- ##
===============================================
Coverage ? 82.83%
===============================================
Files ? 109
Lines ? 17901
Branches ? 0
===============================================
Hits ? 14828
Misses ? 3073
Partials ? 0 Continue to review full report at Codecov.
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Didn't review the entire logic but now I understand the change. Code quality looks good.
@gpucibot merge |
This PR is the first of several to cleanup the regex strings code. The regex code employs multiple stack sizes to perform its matching based on the number of instructions in the given regex pattern. The current implementation allocates the stack for the regex code. This PR moves this down into the regex functions themselves. This helps simplify the interface and reduce compile time a bit.