IntenseFinance/neovim
3
0
Fork 0
mirror of https://github.com/neovim/neovim.git synced 2025-02-25 18:55:25 -06:00
Code Issues Packages Projects Releases Wiki Activity

quickfix: fix dead assignment

Browse Source 
Cherry-picked from vim patch 8.1.1489.
This commit is contained in:
Jan Edmund Lazo 2019-11-13 05:43:31 -05:00
parent 6989ac05f4
commit c2ceed4994
No known key found for this signature in database
GPG Key ID: 64915E6E9F735B15
1 changed files with 8 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/nvim/quickfix.c
View File

@ -4559,9 +4559,9 @@ static qfline_T *qf_find_closest_entry(qf_list_T *qfl,
/// Get the nth quickfix entry below the specified entry treating multiple /// Get the nth quickfix entry below the specified entry treating multiple
/// entries on a single line as one. Searches forward in the list. /// entries on a single line as one. Searches forward in the list.
static qfline_T *qf_get_nth_below_entry(qfline_T *entry, static void qf_get_nth_below_entry(qfline_T *entry,
int *errornr, int *errornr,
linenr_T n) linenr_T n)
{ {
while (n-- > 0 && !got_int) { while (n-- > 0 && !got_int) {
qfline_T *first_entry = entry; qfline_T *first_entry = entry;
@ -4582,15 +4582,13 @@ static qfline_T *qf_get_nth_below_entry(qfline_T *entry,
entry = entry->qf_next; entry = entry->qf_next;
(*errornr)++; (*errornr)++;
} }
return entry;
} }
/// Get the nth quickfix entry above the specified entry treating multiple /// Get the nth quickfix entry above the specified entry treating multiple
/// entries on a single line as one. Searches backwards in the list. /// entries on a single line as one. Searches backwards in the list.
static qfline_T *qf_get_nth_above_entry(qfline_T *entry, static void qf_get_nth_above_entry(qfline_T *entry,
int *errornr, int *errornr,
linenr_T n) linenr_T n)
{ {
while (n-- > 0 && !got_int) { while (n-- > 0 && !got_int) {
if (entry->qf_prev == NULL if (entry->qf_prev == NULL
@ -4604,8 +4602,6 @@ static qfline_T *qf_get_nth_above_entry(qfline_T *entry,
// If multiple entries are on the same line, then use the first entry // If multiple entries are on the same line, then use the first entry
entry = qf_find_first_entry_on_line(entry, errornr); entry = qf_find_first_entry_on_line(entry, errornr);
} }
return entry;
} }
/// Find the n'th quickfix entry adjacent to line 'lnum' in buffer 'bnr' in the /// Find the n'th quickfix entry adjacent to line 'lnum' in buffer 'bnr' in the
@ -4629,9 +4625,9 @@ static int qf_find_nth_adj_entry(qf_list_T *qfl,
if (--n > 0) { if (--n > 0) {
// Go to the n'th entry in the current buffer // Go to the n'th entry in the current buffer
if (dir == FORWARD) { if (dir == FORWARD) {
adj_entry = qf_get_nth_below_entry(adj_entry, &errornr, n); qf_get_nth_below_entry(adj_entry, &errornr, n);
} else { } else {
adj_entry = qf_get_nth_above_entry(adj_entry, &errornr, n); qf_get_nth_above_entry(adj_entry, &errornr, n);
} }
} }