| ... | ... |
@@ -105,7 +105,7 @@ score_t match_positions(const char *needle, const char *haystack, size_t *positi |
| 105 | 105 |
for (int i = 0; i < m; i++) |
| 106 | 106 |
lower_haystack[i] = tolower(haystack[i]); |
| 107 | 107 |
|
| 108 |
- score_t match_bonus[m]; |
|
| 108 |
+ score_t match_bonus[MATCH_MAX_LEN]; |
|
| 109 | 109 |
score_t D[n][m], M[n][m]; |
| 110 | 110 |
|
| 111 | 111 |
/* |