You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
26 lines
821 B
26 lines
821 B
2 years ago
|
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 dba084e..c23f165 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;
|
||
|
|
--
|
||
|
|
2.23.0
|
||
|
|
|