diff options
| author |   John Helmert III <jchelmert3@posteo.net> | 2020-06-18 22:50:19 -0500 |
|---|---|---|
| committer |   Aaron Bauman <bman@gentoo.org> | 2020-06-28 18:16:56 -0400 |
| commit | 4e89ec853a42dd375ccc12057c9376e6786d44ba (patch) | |
| tree | 66fe0353759abeb2e9f0cba94c51243c39086354 /app-text/hunspell/files/hunspell-1.7.0-CVE-2019-16707.patch | |
| parent | x11-misc/xmobar: drop old (diff) | |
| download | gentoo-4e89ec853a42dd375ccc12057c9376e6786d44ba.tar.gz gentoo-4e89ec853a42dd375ccc12057c9376e6786d44ba.tar.bz2 gentoo-4e89ec853a42dd375ccc12057c9376e6786d44ba.zip | |
app-text/hunspell: Patch CVE-2019-16707
Bug: https://bugs.gentoo.org/717968
Package-Manager: Portage-2.3.101, Repoman-2.3.22
Signed-off-by: John Helmert III <jchelmert3@posteo.net>
Closes: https://github.com/gentoo/gentoo/pull/16320
Signed-off-by: Aaron Bauman <bman@gentoo.org>
Diffstat (limited to 'app-text/hunspell/files/hunspell-1.7.0-CVE-2019-16707.patch')
| -rw-r--r-- | app-text/hunspell/files/hunspell-1.7.0-CVE-2019-16707.patch | 22 |
1 files changed, 22 insertions, 0 deletions
diff --git a/app-text/hunspell/files/hunspell-1.7.0-CVE-2019-16707.patch b/app-text/hunspell/files/hunspell-1.7.0-CVE-2019-16707.patch new file mode 100644 index 000000000000..649eef5b293d --- /dev/null +++ b/app-text/hunspell/files/hunspell-1.7.0-CVE-2019-16707.patch @@ -0,0 +1,22 @@ +From ac938e2ecb48ab4dd21298126c7921689d60571b Mon Sep 17 00:00:00 2001 +From: =?UTF-8?q?Caol=C3=A1n=20McNamara?= <caolanm@redhat.com> +Date: Tue, 12 Nov 2019 20:03:15 +0000 +Subject: [PATCH] invalid read memory access #624 + +--- + src/hunspell/suggestmgr.cxx | 2 +- + 1 file changed, 1 insertion(+), 1 deletion(-) + +diff --git a/src/hunspell/suggestmgr.cxx b/src/hunspell/suggestmgr.cxx +index dba084e9..c23f165a 100644 +--- a/src/hunspell/suggestmgr.cxx ++++ b/src/hunspell/suggestmgr.cxx +@@ -2040,7 +2040,7 @@ int SuggestMgr::leftcommonsubstring( + int l2 = su2.size(); + // decapitalize dictionary word + if (complexprefixes) { +- if (su1[l1 - 1] == su2[l2 - 1]) ++ if (l1 && l2 && su1[l1 - 1] == su2[l2 - 1]) + return 1; + } else { + unsigned short idx = su2.empty() ? 0 : (su2[0].h << 8) + su2[0].l; |