Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Update README.rst #1

Closed
wants to merge 1 commit into from
Closed

Update README.rst #1

wants to merge 1 commit into from

Conversation

rawktron
Copy link
Member

Add ActiveState information about 2.7 update

@rawktron
Update README.rst
40e07c5 
Add ActiveState information about 2.7 update
@rawktron rawktron changed the base branch from master to 2.7 July 28, 2020 17:27
@rawktron rawktron changed the base branch from 2.7 to master July 28, 2020 17:28
@rawktron rawktron closed this Jul 28, 2020
@rawktron rawktron deleted the readme-update branch July 28, 2020 17:28
ucodery referenced this pull request in ucodery/cpython Feb 16, 2021
@ssbr
bpo-40791: Make compare_digest more constant-time. (pythonGH-20444)
3172936 
* bpo-40791: Make compare_digest more constant-time.

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change #1 from https://bugs.python.org/issue40791 .)
rickprice pushed a commit that referenced this pull request Aug 8, 2023
@miss-islington @ssbr
bpo-40791: Make compare_digest more constant-time. (pythonGH-23438)
db95802 
The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
rickprice pushed a commit that referenced this pull request Apr 11, 2024
@miss-islington @rickprice
CVE-2022-48566 Cherry-pick 8bef9eb
0691da3 
bpo-40791: Make compare_digest more constant-time. (pythonGH-23438) (pythonGH-23767)

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
(cherry picked from commit 8bef9eb)
@rickprice rickprice mentioned this pull request Apr 11, 2024
Merged
icanhasmath pushed a commit that referenced this pull request Jun 26, 2024
@miss-islington @icanhasmath
CVE-2022-48566 Cherry-pick 8bef9eb
aa83358 
bpo-40791: Make compare_digest more constant-time. (pythonGH-23438) (pythonGH-23767)

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
(cherry picked from commit 8bef9eb)
rickprice pushed a commit that referenced this pull request Jun 26, 2024
@miss-islington @rickprice
CVE-2022-48566 Cherry-pick 8bef9eb
ffb4085 
bpo-40791: Make compare_digest more constant-time. (pythonGH-23438) (pythonGH-23767)

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
(cherry picked from commit 8bef9eb)
rickprice pushed a commit that referenced this pull request Jun 27, 2024
@miss-islington @ssbr
bpo-40791: Make compare_digest more constant-time. (pythonGH-20444)
97136d7 
* bpo-40791: Make compare_digest more constant-time.

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
icanhasmath pushed a commit that referenced this pull request Jul 30, 2024
@miss-islington @icanhasmath
CVE-2022-48566 Cherry-pick 8bef9eb
320504a 
bpo-40791: Make compare_digest more constant-time. (pythonGH-23438) (pythonGH-23767)

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
(cherry picked from commit 8bef9eb)
icanhasmath pushed a commit that referenced this pull request Jul 30, 2024
@miss-islington @icanhasmath
CVE-2022-48566 Cherry-pick 8bef9eb
ec30afa 
bpo-40791: Make compare_digest more constant-time. (pythonGH-23438) (pythonGH-23767)

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
(cherry picked from commit 8bef9eb)
icanhasmath pushed a commit that referenced this pull request Aug 6, 2024
@miss-islington @icanhasmath
CVE-2022-48566 Cherry-pick 8bef9eb
b6fac51 
bpo-40791: Make compare_digest more constant-time. (pythonGH-23438) (pythonGH-23767)

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
(cherry picked from commit 8bef9eb)
icanhasmath pushed a commit that referenced this pull request Aug 7, 2024
@miss-islington @icanhasmath
CVE-2022-48566 Cherry-pick 8bef9eb
976efb3 
bpo-40791: Make compare_digest more constant-time. (pythonGH-23438) (pythonGH-23767)

The existing volatile `left`/`right` pointers guarantee that the reads will all occur, but does not guarantee that they will be _used_. So a compiler can still short-circuit the loop, saving e.g. the overhead of doing the xors and especially the overhead of the data dependency between `result` and the reads. That would change performance depending on where the first unequal byte occurs. This change removes that optimization.

(This is change GH-1 from https://bugs.python.org/issue40791 .)
(cherry picked from commit 3172936)

Co-authored-by: Devin Jeanpierre <[email protected]>
(cherry picked from commit 8bef9eb)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@rawktron