-
Notifications
You must be signed in to change notification settings - Fork 18
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
Sequencing UB #4
Open
ScottyBauer
wants to merge
1
commit into
regehr:master
Choose a base branch
from
ScottyBauer:sequence-this
base: master
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
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 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 |
---|---|---|
@@ -0,0 +1 @@ | ||
The expectation is that without sequence points between read/writes C will evaluate in a left to right fashion. Also, each modification of a value will complete before the next use of that variable. |
This file contains 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 |
---|---|---|
@@ -0,0 +1,26 @@ | ||
#include <stdio.h> | ||
#include <stdlib.h> | ||
|
||
|
||
/* comments say what the programmer would expect */ | ||
|
||
const int nums[32] = {1, 2, 3, 4, 5, 6, 7, 8, | ||
9, 10, 11, 12, 13, 14, | ||
15, 16, 17, 18, 19, 20, | ||
21, 22, 23, 24, 25, 26, | ||
27, 28, 29, 30, 31, 32 }; | ||
|
||
int main(void) { | ||
|
||
int index = 0; | ||
|
||
index = nums[index++]; //index = nums[0]; index++; -> index = 2; | ||
index = nums[index++]; //index = nums[2]; index++; -> index = 4; | ||
index = nums[index++]; //index = nums[4]; index++; -> index = 6; | ||
index = nums[index++]; //index = nums[6]; index++; -> index = 8; | ||
index = nums[index++]; //index = nums[8]; index++; -> index = 10; | ||
index = nums[index++]; //index = nums[10]; index++; -> index = 12; | ||
printf("index is %d\n", index); | ||
|
||
return EXIT_SUCCESS; | ||
} |
This file contains 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 |
---|---|---|
@@ -0,0 +1 @@ | ||
index is 12 |
This file contains 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 |
---|---|---|
@@ -0,0 +1,19 @@ | ||
#include <stdio.h> | ||
#include <stdlib.h> | ||
|
||
int main(void) | ||
{ | ||
|
||
unsigned int x = 15; | ||
unsigned int y = 25; | ||
unsigned result = 0; | ||
|
||
/* programmer assumes left to right evaluation, | ||
even with unary ops mixed in */ | ||
/* 16 + 15 + (50 * 50) + 50 + 15 */ | ||
result = x = y = x++ + x-- + (y*=2 * y) + y + x ; | ||
|
||
printf("result %d\n", result ); | ||
|
||
return EXIT_SUCCESS; | ||
} |
This file contains 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 |
---|---|---|
@@ -0,0 +1 @@ | ||
result 2596 |
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.
I'm not sure about your interpretation here (I tried multiple times to come up with a good example like this and also had a hard time). Can you refactor into simpler UBs such as i = i++?