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.
Optimize stripos #7852
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
Optimize stripos #7852
Changes from all commits
70bd296
1b800b9
File filter
Filter by extension
Conversations
Jump to
There are no files selected for viewing
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.
For future scope: I think there may be a way to optimize this with SSE for really long strings, but it may not be worth it, especially with stripos not being used that often.
(both checking if the first character exists case-insensitively, and checking if long needles match)
Definitely not something to add to this PR.
(*needle_byte ^ *haystack_byte) == *needle_mask
, where needle_mask is 0xff or 0xcf (~0x20), since'a' ^ 'A'
is 0x20)For a block of 8/16/32 bytes, that could be checked by:
0xff ^ first_lower ^ first_upper
)This would make the worst case of case-insensitive search faster (
stripos(str_repeat('A', 1000000), 'a')
) by stopping at the first lowercase or uppercase byte . The memchr could also start at whatever that result was ifneedle_len > 1
.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.
I know nothing about SSE, but as you mentioned, the new implementation should already be much better for large strings, we can always improve it at a later point.