@@ -32,8 +32,6 @@ int has_match(const char *needle, const char *haystack) {

 #define max(a, b) (((a) > (b)) ? (a) : (b))

-#define MATCH_MAX_LEN 1024

-

 struct match_struct {

 	int needle_len;

 	int haystack_len;

@@ -7,6 +7,8 @@ typedef double score_t;

 #define SCORE_MAX INFINITY

 #define SCORE_MIN -INFINITY

+#define MATCH_MAX_LEN 1024

+

 int has_match(const char *needle, const char *haystack);

 score_t match_positions(const char *needle, const char *haystack, size_t *positions);

 score_t match(const char *needle, const char *haystack);

@@ -36,8 +36,8 @@ static void draw_match(tty_interface_t *state, const char *choice, int selected)

 	char *search = state->last_search;

 	int n = strlen(search);

-	size_t positions[n + 1];

-	for (int i = 0; i < n + 1; i++)

+	size_t positions[MATCH_MAX_LEN];

+	for (int i = 0; i < n + 1 && i < MATCH_MAX_LEN; i++)

 		positions[i] = -1;

 	score_t score = match_positions(search, choice, &positions[0]);