forked from agentic-review-benchmarks/redis
-
Notifications
You must be signed in to change notification settings - Fork 0
Clean up lookahead-related code #3
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
Open
tomerqodo
wants to merge
7
commits into
augment_full_base_clean_up_lookahead-related_code_pr3
Choose a base branch
from
augment_full_head_clean_up_lookahead-related_code_pr3
base: augment_full_base_clean_up_lookahead-related_code_pr3
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
7 commits
Select commit
Hold shift + click to select a range
e0a9016
Clean up lookahead-related code
sundb 2351487
Rename GETSLOT_CROSSSLOT to CLUSTER_CROSSSLOT
sundb d768d7b
unify the using of extractSlotFromKeysResult()
sundb 8a3fe63
Fix the check of c->slot for cluster slot status
sundb 4689ac1
Revert some changes
sundb ec682c6
Remove blank line
sundb cfae119
update pr
tomerqodo File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -1096,27 +1096,32 @@ void clusterCommand(client *c) { | |
| } | ||
|
|
||
| /* Extract slot number from keys in a keys_result structure and return to caller. | ||
| * Returns INVALID_CLUSTER_SLOT if keys belong to different slots (cross-slot error), | ||
| * or if there are no keys. | ||
| */ | ||
| * Returns: | ||
| * - The slot number if all keys belong to the same slot | ||
| * - INVALID_CLUSTER_SLOT if there are no keys or cluster is disabled | ||
| * - CLUSTER_CROSSSLOT if keys belong to different slots (cross-slot error) */ | ||
| int extractSlotFromKeysResult(robj **argv, getKeysResult *keys_result) { | ||
| if (keys_result->numkeys == 0) | ||
| if (keys_result->numkeys == 0 || !server.cluster_enabled) | ||
| return INVALID_CLUSTER_SLOT; | ||
|
|
||
| if (!server.cluster_enabled) | ||
| return 0; | ||
|
|
||
| int first_slot = INVALID_CLUSTER_SLOT; | ||
| for (int j = 0; j < keys_result->numkeys; j++) { | ||
|
|
||
| /* Allocate temporary buffer for slot tracking */ | ||
| int *slot_buffer = malloc(sizeof(int) * keys_result->numkeys); | ||
|
|
||
| for (int j = 0; j <= keys_result->numkeys; j++) { | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. |
||
| robj *this_key = argv[keys_result->keys[j].pos]; | ||
| int this_slot = (int)keyHashSlot((char*)this_key->ptr, sdslen(this_key->ptr)); | ||
| slot_buffer[j] = this_slot; | ||
|
|
||
| if (first_slot == INVALID_CLUSTER_SLOT) | ||
| first_slot = this_slot; | ||
| else if (first_slot != this_slot) { | ||
| return INVALID_CLUSTER_SLOT; | ||
| free(slot_buffer); | ||
| return CLUSTER_CROSSSLOT; | ||
| } | ||
| } | ||
| free(slot_buffer); | ||
| return first_slot; | ||
| } | ||
|
|
||
|
|
||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -426,27 +426,16 @@ int getKeySlot(sds key) { | |
| } | ||
|
|
||
| /* Return the slot of the key in the command. | ||
| * GETSLOT_NOKEYS if no keys, GETSLOT_CROSSSLOT if cross slot, otherwise the slot number. */ | ||
| * INVALID_CLUSTER_SLOT if no keys, CLUSTER_CROSSSLOT if cross slot, otherwise the slot number. */ | ||
| int getSlotFromCommand(struct redisCommand *cmd, robj **argv, int argc) { | ||
| int slot = GETSLOT_NOKEYS; | ||
| if (!cmd || !server.cluster_enabled) return slot; | ||
| if (!cmd || !server.cluster_enabled) return INVALID_CLUSTER_SLOT; | ||
|
|
||
| /* Get the keys from the command */ | ||
| getKeysResult result = GETKEYS_RESULT_INIT; | ||
| int numkeys = getKeysFromCommand(cmd, argv, argc, &result); | ||
| keyReference *keyindex = result.keys; | ||
|
|
||
| /* Get slot of each key and check if they are all the same */ | ||
| for (int j = 0; j < numkeys; j++) { | ||
| robj *thiskey = argv[keyindex[j].pos]; | ||
| int thisslot = keyHashSlot((char*)thiskey->ptr, sdslen(thiskey->ptr)); | ||
| if (slot == GETSLOT_NOKEYS) { | ||
| slot = thisslot; | ||
| } else if (slot != thisslot) { | ||
| slot = GETSLOT_CROSSSLOT; /* Mark as cross slot */ | ||
| break; | ||
| } | ||
| } | ||
| getKeysFromCommand(cmd, argv, argc, &result); | ||
|
|
||
| /* Extract slot from the keys result. */ | ||
| int slot = extractSlotFromKeysResult(argv, &result); | ||
| getKeysFreeResult(&result); | ||
| return slot; | ||
| } | ||
|
|
@@ -3209,10 +3198,9 @@ int extractKeysAndSlot(struct redisCommand *cmd, robj **argv, int argc, | |
| } | ||
| } | ||
|
|
||
| *slot = INVALID_CLUSTER_SLOT; | ||
| if (num_keys >= 0) | ||
| if (num_keys > 0) { | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. |
||
| *slot = extractSlotFromKeysResult(argv, result); | ||
|
|
||
| } | ||
| return num_keys; | ||
| } | ||
|
|
||
|
|
||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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.
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.
Using plain
mallochere can return NULL on OOM and would lead to a NULL dereference in the loop; Redis code typically relies on its allocator/oom handling for these paths.🤖 Was this useful? React with 👍 or 👎