commit
23ba875b82
|
@ -723,8 +723,8 @@ static int diff_write_buffer(buf_T *buf, diffin_T *din)
|
|||
char_u cbuf[MB_MAXBYTES + 1];
|
||||
|
||||
c = PTR2CHAR(s);
|
||||
c = enc_utf8 ? utf_fold(c) : TOLOWER_LOC(c);
|
||||
orig_len = MB_PTR2LEN(s);
|
||||
c = utf_fold(c);
|
||||
orig_len = utfc_ptr2len(s);
|
||||
if (utf_char2bytes(c, cbuf) != orig_len) {
|
||||
// TODO(Bram): handle byte length difference
|
||||
memmove(ptr + len, s, orig_len);
|
||||
|
|
|
@ -15502,7 +15502,7 @@ static void f_setcharsearch(typval_T *argvars, typval_T *rettv, FunPtr fptr)
|
|||
}
|
||||
else
|
||||
set_last_csearch(PTR2CHAR(csearch),
|
||||
csearch, MB_PTR2LEN(csearch));
|
||||
csearch, utfc_ptr2len(csearch));
|
||||
}
|
||||
|
||||
di = tv_dict_find(d, S_LEN("forward"));
|
||||
|
@ -24051,8 +24051,8 @@ char_u *do_string_sub(char_u *str, char_u *pat, char_u *sub,
|
|||
/* Skip empty match except for first match. */
|
||||
if (regmatch.startp[0] == regmatch.endp[0]) {
|
||||
if (zero_width == regmatch.startp[0]) {
|
||||
/* avoid getting stuck on a match with an empty string */
|
||||
int i = MB_PTR2LEN(tail);
|
||||
// avoid getting stuck on a match with an empty string
|
||||
int i = utfc_ptr2len(tail);
|
||||
memmove((char_u *)ga.ga_data + ga.ga_len, tail, (size_t)i);
|
||||
ga.ga_len += i;
|
||||
tail += i;
|
||||
|
|
|
@ -2320,7 +2320,7 @@ redraw:
|
|||
} while (++vcol % 8);
|
||||
p++;
|
||||
} else {
|
||||
len = MB_PTR2LEN(p);
|
||||
len = utfc_ptr2len(p);
|
||||
msg_outtrans_len(p, len);
|
||||
vcol += ptr2cells(p);
|
||||
p += len;
|
||||
|
|
|
@ -1102,8 +1102,8 @@ static bool ff_wc_equal(char_u *s1, char_u *s2)
|
|||
prev2 = prev1;
|
||||
prev1 = c1;
|
||||
|
||||
i += MB_PTR2LEN(s1 + i);
|
||||
j += MB_PTR2LEN(s2 + j);
|
||||
i += utfc_ptr2len(s1 + i);
|
||||
j += utfc_ptr2len(s2 + j);
|
||||
}
|
||||
return s1[i] == s2[j];
|
||||
}
|
||||
|
|
|
@ -1833,13 +1833,13 @@ static int vgetorpeek(int advance)
|
|||
char_u *p1 = mp->m_keys;
|
||||
char_u *p2 = (char_u *)mb_unescape((const char **)&p1);
|
||||
|
||||
if (has_mbyte && p2 != NULL && MB_BYTE2LEN(c1) > MB_PTR2LEN(p2))
|
||||
if (p2 != NULL && MB_BYTE2LEN(c1) > utfc_ptr2len(p2)) {
|
||||
mlen = 0;
|
||||
/*
|
||||
* Check an entry whether it matches.
|
||||
* - Full match: mlen == keylen
|
||||
* - Partly match: mlen == typebuf.tb_len
|
||||
*/
|
||||
}
|
||||
|
||||
// Check an entry whether it matches.
|
||||
// - Full match: mlen == keylen
|
||||
// - Partly match: mlen == typebuf.tb_len
|
||||
keylen = mp->m_keylen;
|
||||
if (mlen == keylen
|
||||
|| (mlen == typebuf.tb_len
|
||||
|
|
|
@ -110,8 +110,6 @@
|
|||
// MB_COPY_CHAR(f, t): copy one char from "f" to "t" and advance the pointers.
|
||||
// PTR2CHAR(): get character from pointer.
|
||||
|
||||
// Get the length of the character p points to, including composing chars.
|
||||
# define MB_PTR2LEN(p) mb_ptr2len(p)
|
||||
// Advance multi-byte pointer, skip over composing chars.
|
||||
# define MB_PTR_ADV(p) (p += mb_ptr2len((char_u *)p))
|
||||
// Advance multi-byte pointer, do not skip over composing chars.
|
||||
|
|
|
@ -4641,7 +4641,7 @@ int do_addsub(int op_type, pos_T *pos, int length, linenr_T Prenum1)
|
|||
if (visual) {
|
||||
while (ptr[col] != NUL && length > 0 && !ascii_isdigit(ptr[col])
|
||||
&& !(doalp && ASCII_ISALPHA(ptr[col]))) {
|
||||
int mb_len = MB_PTR2LEN(ptr + col);
|
||||
int mb_len = utfc_ptr2len(ptr + col);
|
||||
|
||||
col += mb_len;
|
||||
length -= mb_len;
|
||||
|
|
|
@ -338,9 +338,9 @@ int path_fnamencmp(const char *const fname1, const char *const fname2,
|
|||
&& (p_fic ? (c1 != c2 && CH_FOLD(c1) != CH_FOLD(c2)) : c1 != c2)) {
|
||||
break;
|
||||
}
|
||||
len -= (size_t)MB_PTR2LEN((const char_u *)p1);
|
||||
p1 += MB_PTR2LEN((const char_u *)p1);
|
||||
p2 += MB_PTR2LEN((const char_u *)p2);
|
||||
len -= (size_t)utfc_ptr2len((const char_u *)p1);
|
||||
p1 += utfc_ptr2len((const char_u *)p1);
|
||||
p2 += utfc_ptr2len((const char_u *)p2);
|
||||
}
|
||||
return c1 - c2;
|
||||
#else
|
||||
|
@ -1910,16 +1910,16 @@ int pathcmp(const char *p, const char *q, int maxlen)
|
|||
: c1 - c2; // no match
|
||||
}
|
||||
|
||||
i += MB_PTR2LEN((char_u *)p + i);
|
||||
j += MB_PTR2LEN((char_u *)q + j);
|
||||
i += utfc_ptr2len((char_u *)p + i);
|
||||
j += utfc_ptr2len((char_u *)q + j);
|
||||
}
|
||||
if (s == NULL) { // "i" or "j" ran into "maxlen"
|
||||
return 0;
|
||||
}
|
||||
|
||||
c1 = PTR2CHAR((char_u *)s + i);
|
||||
c2 = PTR2CHAR((char_u *)s + i + MB_PTR2LEN((char_u *)s + i));
|
||||
/* ignore a trailing slash, but not "//" or ":/" */
|
||||
c2 = PTR2CHAR((char_u *)s + i + utfc_ptr2len((char_u *)s + i));
|
||||
// ignore a trailing slash, but not "//" or ":/"
|
||||
if (c2 == NUL
|
||||
&& i > 0
|
||||
&& !after_pathsep((char *)s, (char *)s + i)
|
||||
|
@ -1928,10 +1928,12 @@ int pathcmp(const char *p, const char *q, int maxlen)
|
|||
#else
|
||||
&& c1 == '/'
|
||||
#endif
|
||||
)
|
||||
return 0; /* match with trailing slash */
|
||||
if (s == q)
|
||||
return -1; /* no match */
|
||||
) {
|
||||
return 0; // match with trailing slash
|
||||
}
|
||||
if (s == q) {
|
||||
return -1; // no match
|
||||
}
|
||||
return 1;
|
||||
}
|
||||
|
||||
|
|
|
@ -4943,7 +4943,7 @@ static int skip_to_start(int c, colnr_T *colp)
|
|||
*/
|
||||
static long find_match_text(colnr_T startcol, int regstart, char_u *match_text)
|
||||
{
|
||||
#define PTR2LEN(x) enc_utf8 ? utf_ptr2len(x) : MB_PTR2LEN(x)
|
||||
#define PTR2LEN(x) utf_ptr2len(x)
|
||||
|
||||
colnr_T col = startcol;
|
||||
int regstart_len = PTR2LEN(regline + startcol);
|
||||
|
|
|
@ -2994,7 +2994,7 @@ win_line (
|
|||
if (shl->startcol != MAXCOL
|
||||
&& v >= (long)shl->startcol
|
||||
&& v < (long)shl->endcol) {
|
||||
int tmp_col = v + MB_PTR2LEN(ptr);
|
||||
int tmp_col = v + utfc_ptr2len(ptr);
|
||||
|
||||
if (shl->endcol < tmp_col) {
|
||||
shl->endcol = tmp_col;
|
||||
|
|
|
@ -681,7 +681,7 @@ int searchit(
|
|||
}
|
||||
|
||||
if (matchcol == matchpos.col && ptr[matchcol] != NUL) {
|
||||
matchcol += MB_PTR2LEN(ptr + matchcol);
|
||||
matchcol += utfc_ptr2len(ptr + matchcol);
|
||||
}
|
||||
|
||||
if (matchcol == 0 && (options & SEARCH_START)) {
|
||||
|
@ -1755,7 +1755,7 @@ pos_T *findmatchlimit(oparg_T *oap, int initc, int flags, int64_t maxtravel)
|
|||
find_mps_values(&initc, &findc, &backwards, FALSE);
|
||||
if (findc)
|
||||
break;
|
||||
pos.col += MB_PTR2LEN(linep + pos.col);
|
||||
pos.col += utfc_ptr2len(linep + pos.col);
|
||||
}
|
||||
if (!findc) {
|
||||
/* no brace in the line, maybe use " #if" then */
|
||||
|
@ -2234,14 +2234,14 @@ showmatch(
|
|||
for (p = curbuf->b_p_mps; *p != NUL; ++p) {
|
||||
if (PTR2CHAR(p) == c && (curwin->w_p_rl ^ p_ri))
|
||||
break;
|
||||
p += MB_PTR2LEN(p) + 1;
|
||||
if (PTR2CHAR(p) == c
|
||||
&& !(curwin->w_p_rl ^ p_ri)
|
||||
)
|
||||
p += utfc_ptr2len(p) + 1;
|
||||
if (PTR2CHAR(p) == c && !(curwin->w_p_rl ^ p_ri)) {
|
||||
break;
|
||||
p += MB_PTR2LEN(p);
|
||||
if (*p == NUL)
|
||||
}
|
||||
p += utfc_ptr2len(p);
|
||||
if (*p == NUL) {
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
if ((lpos = findmatch(NULL, NUL)) == NULL) { // no match, so beep
|
||||
|
@ -4845,7 +4845,7 @@ exit_matched:
|
|||
&& action == ACTION_EXPAND
|
||||
&& !(compl_cont_status & CONT_SOL)
|
||||
&& *startp != NUL
|
||||
&& *(p = startp + MB_PTR2LEN(startp)) != NUL)
|
||||
&& *(p = startp + utfc_ptr2len(startp)) != NUL)
|
||||
goto search_line;
|
||||
}
|
||||
line_breakcheck();
|
||||
|
|
|
@ -2570,36 +2570,33 @@ void init_spell_chartab(void)
|
|||
/// Thus this only works properly when past the first character of the word.
|
||||
///
|
||||
/// @param wp Buffer used.
|
||||
static bool spell_iswordp(char_u *p, win_T *wp)
|
||||
static bool spell_iswordp(const char_u *p, const win_T *wp)
|
||||
FUNC_ATTR_NONNULL_ALL
|
||||
{
|
||||
char_u *s;
|
||||
int l;
|
||||
int c;
|
||||
|
||||
if (has_mbyte) {
|
||||
l = MB_PTR2LEN(p);
|
||||
s = p;
|
||||
if (l == 1) {
|
||||
// be quick for ASCII
|
||||
if (wp->w_s->b_spell_ismw[*p])
|
||||
s = p + 1; // skip a mid-word character
|
||||
} else {
|
||||
c = utf_ptr2char(p);
|
||||
if (c < 256 ? wp->w_s->b_spell_ismw[c]
|
||||
: (wp->w_s->b_spell_ismw_mb != NULL
|
||||
&& vim_strchr(wp->w_s->b_spell_ismw_mb, c) != NULL)) {
|
||||
s = p + l;
|
||||
}
|
||||
const int l = utfc_ptr2len(p);
|
||||
const char_u *s = p;
|
||||
if (l == 1) {
|
||||
// be quick for ASCII
|
||||
if (wp->w_s->b_spell_ismw[*p]) {
|
||||
s = p + 1; // skip a mid-word character
|
||||
}
|
||||
|
||||
c = utf_ptr2char(s);
|
||||
if (c > 255) {
|
||||
return spell_mb_isword_class(mb_get_class(s), wp);
|
||||
} else {
|
||||
c = utf_ptr2char(p);
|
||||
if (c < 256
|
||||
? wp->w_s->b_spell_ismw[c]
|
||||
: (wp->w_s->b_spell_ismw_mb != NULL
|
||||
&& vim_strchr(wp->w_s->b_spell_ismw_mb, c) != NULL)) {
|
||||
s = p + l;
|
||||
}
|
||||
return spelltab.st_isw[c];
|
||||
}
|
||||
|
||||
return spelltab.st_isw[wp->w_s->b_spell_ismw[*p] ? p[1] : p[0]];
|
||||
c = utf_ptr2char(s);
|
||||
if (c > 255) {
|
||||
return spell_mb_isword_class(mb_get_class(s), wp);
|
||||
}
|
||||
return spelltab.st_isw[c];
|
||||
}
|
||||
|
||||
// Returns true if "p" points to a word character.
|
||||
|
@ -2617,7 +2614,8 @@ bool spell_iswordp_nmw(const char_u *p, win_T *wp)
|
|||
// Only for characters above 255.
|
||||
// Unicode subscript and superscript are not considered word characters.
|
||||
// See also utf_class() in mbyte.c.
|
||||
static bool spell_mb_isword_class(int cl, win_T *wp)
|
||||
static bool spell_mb_isword_class(int cl, const win_T *wp)
|
||||
FUNC_ATTR_PURE FUNC_ATTR_NONNULL_ALL FUNC_ATTR_WARN_UNUSED_RESULT
|
||||
{
|
||||
if (wp->w_s->b_cjk)
|
||||
// East Asian characters are not considered word characters.
|
||||
|
@ -4118,7 +4116,7 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
|||
&& goodword_ends) {
|
||||
int l;
|
||||
|
||||
l = MB_PTR2LEN(fword + sp->ts_fidx);
|
||||
l = utfc_ptr2len(fword + sp->ts_fidx);
|
||||
if (fword_ends) {
|
||||
// Copy the skipped character to preword.
|
||||
memmove(preword + sp->ts_prewordlen,
|
||||
|
@ -4264,7 +4262,7 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
|||
// Correct ts_fidx for the byte length of the
|
||||
// character (we didn't check that before).
|
||||
sp->ts_fidx = sp->ts_fcharstart
|
||||
+ MB_PTR2LEN(fword + sp->ts_fcharstart);
|
||||
+ utfc_ptr2len(fword + sp->ts_fcharstart);
|
||||
|
||||
// For changing a composing character adjust
|
||||
// the score from SCORE_SUBST to
|
||||
|
@ -4363,7 +4361,7 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
|||
// a bit illogical for soundfold tree but it does give better
|
||||
// results.
|
||||
c = utf_ptr2char(fword + sp->ts_fidx);
|
||||
stack[depth].ts_fidx += MB_PTR2LEN(fword + sp->ts_fidx);
|
||||
stack[depth].ts_fidx += utfc_ptr2len(fword + sp->ts_fidx);
|
||||
if (utf_iscomposing(c)) {
|
||||
stack[depth].ts_score -= SCORE_DEL - SCORE_DELCOMP;
|
||||
} else if (c == utf_ptr2char(fword + stack[depth].ts_fidx)) {
|
||||
|
@ -4533,9 +4531,9 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
|||
case STATE_UNSWAP:
|
||||
// Undo the STATE_SWAP swap: "21" -> "12".
|
||||
p = fword + sp->ts_fidx;
|
||||
n = MB_PTR2LEN(p);
|
||||
n = utfc_ptr2len(p);
|
||||
c = utf_ptr2char(p + n);
|
||||
memmove(p + MB_PTR2LEN(p + n), p, n);
|
||||
memmove(p + utfc_ptr2len(p + n), p, n);
|
||||
utf_char2bytes(c, p);
|
||||
|
||||
FALLTHROUGH;
|
||||
|
@ -4589,11 +4587,11 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
|||
case STATE_UNSWAP3:
|
||||
// Undo STATE_SWAP3: "321" -> "123"
|
||||
p = fword + sp->ts_fidx;
|
||||
n = MB_PTR2LEN(p);
|
||||
n = utfc_ptr2len(p);
|
||||
c2 = utf_ptr2char(p + n);
|
||||
fl = MB_PTR2LEN(p + n);
|
||||
fl = utfc_ptr2len(p + n);
|
||||
c = utf_ptr2char(p + n + fl);
|
||||
tl = MB_PTR2LEN(p + n + fl);
|
||||
tl = utfc_ptr2len(p + n + fl);
|
||||
memmove(p + fl + tl, p, n);
|
||||
utf_char2bytes(c, p);
|
||||
utf_char2bytes(c2, p + tl);
|
||||
|
@ -4637,10 +4635,10 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
|||
case STATE_UNROT3L:
|
||||
// Undo ROT3L: "231" -> "123"
|
||||
p = fword + sp->ts_fidx;
|
||||
n = MB_PTR2LEN(p);
|
||||
n += MB_PTR2LEN(p + n);
|
||||
n = utfc_ptr2len(p);
|
||||
n += utfc_ptr2len(p + n);
|
||||
c = utf_ptr2char(p + n);
|
||||
tl = MB_PTR2LEN(p + n);
|
||||
tl = utfc_ptr2len(p + n);
|
||||
memmove(p + tl, p, n);
|
||||
utf_char2bytes(c, p);
|
||||
|
||||
|
@ -4675,9 +4673,9 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
|
|||
// Undo ROT3R: "312" -> "123"
|
||||
p = fword + sp->ts_fidx;
|
||||
c = utf_ptr2char(p);
|
||||
tl = MB_PTR2LEN(p);
|
||||
n = MB_PTR2LEN(p + tl);
|
||||
n += MB_PTR2LEN(p + tl + n);
|
||||
tl = utfc_ptr2len(p);
|
||||
n = utfc_ptr2len(p + tl);
|
||||
n += utfc_ptr2len(p + tl + n);
|
||||
memmove(p, p + tl, n);
|
||||
utf_char2bytes(c, p + n);
|
||||
|
||||
|
|
Loading…
Reference in New Issue