mirror of
https://github.com/neovim/neovim.git
synced 2025-10-04 08:56:29 +00:00
refactor: saner options for uncrustify #16196
* refactor: general good option changes sp_deref = remove sp_not = remove sp_inv = remove sp_inside_paren_cast = remove mod_remove_duplicate_include = true sp_after_semi = add sp_after_semi_for = force sp_sizeof_paren = remove nl_return_expr = remove nl_else_brace = remove nl_else_if = remove * refactor: mod_remove_extra_semicolon = true * refactor: nl_max = 3 * refactor: sp_bool = force * refactor: sp_compare = force * refactor: sp_inside_paren = remove * refactor: sp_paren_paren = remove * refactor: sp_inside_sparen = remove * refactor: sp_before_sparen = force * refactor: sp_sign = remove * refactor: sp_addr = remove * refactor: sp_member = remove * refactor: nl_struct_brace = remove * refactor: nl_before_if_closing_paren = remove * refactor: nl_fdef_brace = force * refactor: sp_paren_comma = force * refactor: mod_full_brace_do = add
This commit is contained in:
@@ -1758,7 +1758,8 @@ void slang_free(slang_T *lp)
|
||||
}
|
||||
|
||||
/// Frees a salitem_T
|
||||
static void free_salitem(salitem_T *smp) {
|
||||
static void free_salitem(salitem_T *smp)
|
||||
{
|
||||
xfree(smp->sm_lead);
|
||||
// Don't free sm_oneof and sm_rules, they point into sm_lead.
|
||||
xfree(smp->sm_to);
|
||||
@@ -1768,7 +1769,8 @@ static void free_salitem(salitem_T *smp) {
|
||||
}
|
||||
|
||||
/// Frees a fromto_T
|
||||
static void free_fromto(fromto_T *ftp) {
|
||||
static void free_fromto(fromto_T *ftp)
|
||||
{
|
||||
xfree(ftp->ft_from);
|
||||
xfree(ftp->ft_to);
|
||||
}
|
||||
@@ -3420,7 +3422,6 @@ static void spell_suggest_file(suginfo_T *su, char_u *fname)
|
||||
if (STRICMP(su->su_badword, line) == 0) {
|
||||
// Match! Isolate the good word, until CR or NL.
|
||||
for (len = 0; p[len] >= ' '; ++len) {
|
||||
;
|
||||
}
|
||||
p[len] = NUL;
|
||||
|
||||
@@ -3813,7 +3814,6 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
||||
if (sp->ts_prefixdepth == PFD_PREFIXTREE) {
|
||||
// Skip over the NUL bytes, we use them later.
|
||||
for (n = 0; n < len && byts[arridx + n] == 0; ++n) {
|
||||
;
|
||||
}
|
||||
sp->ts_curi += n;
|
||||
|
||||
@@ -3888,7 +3888,6 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
||||
n = stack[sp->ts_prefixdepth].ts_arridx;
|
||||
len = pbyts[n++];
|
||||
for (c = 0; c < len && pbyts[n + c] == 0; ++c) {
|
||||
;
|
||||
}
|
||||
if (c > 0) {
|
||||
c = valid_word_prefix(c, n, flags,
|
||||
|
Reference in New Issue
Block a user