Skip to content

Fix typos #202

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

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Fix typos #202

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
eee5b23
asm/x86_64-xlate.pl: fix typo
vuittont60 Jan 19, 2024
f6488fb
asm/mulx_mont_256-x86_64.pl: fix typo
vuittont60 Jan 19, 2024
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
2 changes: 1 addition & 1 deletion src/asm/mulx_mont_256-x86_64.pl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@
# In general Montgomery multiplication algorithm can handle one of the
# inputs being non-reduced and capped by 1<<radix_width, 1<<256 in this
# case, rather than the modulus. Whether or not mul_mont_sparse_256, a
# *taylored* implementation of the algorithm, can handle such input can
# *tailored* implementation of the algorithm, can handle such input can
# be circumstantial. For example, in most general case it depends on
# similar "bit sparsity" of individual limbs of the second, fully reduced
# multiplicand. If you can't make such assumption about the limbs, then
Expand Down
2 changes: 1 addition & 1 deletion src/asm/x86_64-xlate.pl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1919,7 +1919,7 @@ sub process {
# ...
# mov -8(%rbp),%rbx
# mov %rbp,%rsp
# .cfi_def_cfa_regiser%rsp
# .cfi_def_cfa_register%rsp
# pop %rbp # recognized by Windows
# .cfi_pop %rbp
# .cfi_epilogue
Expand Down